Ohio State University

Displaying 1-40 of 168 results

  • White Papers // Apr 2014

    When Queueing Meets Coding: Optimal-Latency Data Retrieving Scheme in Storage Clouds

    Storage clouds, such as Amazon S3, are being widely used for web services and Internet applications. It has been observed that the delay for retrieving data from and placing data into the clouds is quite random, and exhibits weak correlations between different read/write requests. This inspires the authors to investigate...

    Provided By Ohio State University

  • White Papers // Mar 2014

    A System for Energy-Efficient Data Management

    Energy consumption of computer systems has increased at a steep rate in recent years. Following extensive energy-related research and practice in the hardware and OS communities, much attention has been paid to developing energy-efficient applications. With database systems being a heavy energy consumer in modern data centers, the authors face...

    Provided By Ohio State University

  • White Papers // Feb 2014

    On Big Data Benchmarking

    Big data systems address the challenges of capturing, storing, managing, analyzing, and visualizing big data. Within this context, developing benchmarks to evaluate and compare big data systems has become an active topic for both research and industry communities. To date, most of the state-of-the-art big data benchmarks are designed for...

    Provided By Ohio State University

  • White Papers // Jan 2014

    Efficient, Accurate and Privacy-Preserving Data Mining for Frequent Itemsets in Distributed Databases

    Mining distributed databases is emerging as a fundamental computational problem. A common approach for mining distributed databases is to move all of the data from each database to a central site and a single model is built. This approach is accurate, but too expensive in terms of time required. For...

    Provided By Ohio State University

  • White Papers // Oct 2013

    Systematic Testing for Resource Leaks in Android Applications

    The use of mobile devices and the complexity of their software continue to grow rapidly. This growth presents significant challenges for software correctness and performance. In addition to traditional defects, a key consideration are defects related to the limited resources available on these devices. Resource leaks in an application, due...

    Provided By Ohio State University

  • White Papers // Mar 2013

    Life-Add: Lifetime Adjustable Design for WiFi Networks With Heterogeneous Energy Supplies

    WiFi usage significantly reduces the battery lifetime of handheld devices such as Smartphones and tablets, due to its high energy consumption. In this paper, the authors propose "Life-Add": a Lifetime Adjustable design for WiFi networks, where the devices are powered by battery, electric power, and/or renewable energy. In Life-Add, a...

    Provided By Ohio State University

  • White Papers // Feb 2013

    Retransmission Delays With Bounded Packets: Power Law Body and Exponential Tail

    Retransmissions serve as the basic building block that communication protocols use to achieve reliable data transfer. Until recently, the number of retransmissions were thought to follow a geometric (light-tailed) distribution. However, recent work shows that when the distribution of the packet sizes have infinite support, retransmission-based protocols may result in...

    Provided By Ohio State University

  • White Papers // Jan 2013

    On Sample-Path Optimal Dynamic Scheduling for Sum-Queue Minimization in Forests

    The authors investigate the problem of minimizing the sum of the queue lengths of all the nodes in a wireless network with a forest topology. Each packet is destined to one of the roots (sinks) of the forest. They consider a time-slotted system, and a primary (or one-hop) interference model....

    Provided By Ohio State University

  • White Papers // Jan 2013

    Network Control Without CSI Using Rateless Codes for Downlink Cellular Systems

    Wireless network scheduling and control techniques (e.g., opportunistic scheduling) rely heavily on access to Channel State Information (CSI). However, obtaining this information is costly in terms of bandwidth, time, and power, and could result in large overhead. Therefore, a critical question is how to optimally manage network resources in the...

    Provided By Ohio State University

  • White Papers // Jan 2013

    LDPC-in-SSD: Making Advanced Error Correction Codes Work Effectively in Solid State Drives

    Conventional Error Correction Codes (ECCs), such as the commonly used BCH code, have become increasingly inadequate for Solid State Drives (SSDs) as the capacity of NAND flash memory continues to increase and its reliability continues to degrade. It is highly desirable to deploy a much more powerful ECC, such as...

    Provided By Ohio State University

  • White Papers // Jan 2013

    Understanding the Robustness of SSDs Under Power Fault

    Modern storage technology (SSDs, No-SQL databases, commoditized RAID hardware, etc.) bring new reliability challenges to the already complicated storage stack. Among other things, the behavior of these new components during power faults - which happen relatively frequently in data centers - is an important yet mostly ignored issue in this...

    Provided By Ohio State University

  • White Papers // Jan 2013

    Online Packet Scheduling With Hard Deadlines in Multihop Communication Networks

    The problem of online job or packet scheduling with hard deadlines has been studied extensively in the single hop setting, whereas it is notoriously difficult in the multihop setting. This difficulty stems from the fact that packet scheduling decisions at each hop influences and is influenced by decisions on other...

    Provided By Ohio State University

  • White Papers // Jan 2013

    Distributed Cross-Layer Optimization in Wireless Networks: A Second-Order Approach

    Due to the rapidly growing scale and heterogeneity of wireless networks, the design of distributed cross-layer optimization algorithms has received significant interest from the networking research community. So far, the standard distributed cross-layer approach in the literature is based on the first-order Lagrangian dual decomposition and the sub-gradient method, which...

    Provided By Ohio State University

  • White Papers // Jan 2013

    An Economic Analysis of Regulating Security Investments in the Internet

    Regulating the ISPs to adopt more security measures has been proposed as an effective method in mitigating the threats of attacks in the Internet. However, economic incentives of the ISPs and the network effects of security measures can lead to an under-investment in their adoption. The authors study the potential...

    Provided By Ohio State University

  • White Papers // Jan 2013

    A New Analytical Technique for Designing Provably Efficient MapReduce Schedulers

    With the rapid increase in size and number of jobs that are being processed in the MapReduce framework, efficiently scheduling jobs under this framework is becoming increasingly important. The authors consider the problem of minimizing the total flow-time of a sequence of jobs in the MapReduce framework, where the jobs...

    Provided By Ohio State University

  • White Papers // Jan 2013

    Exploiting Double Opportunities for Deadline Based Content Propagation in Wireless Networks

    In this paper, the authors focus on mobile wireless networks comprising of a powerful communication center and a multitude of mobile users. They investigate the propagation of deadline-based content in the wireless network characterized by heterogeneous (time-varying and user-dependent) wireless channel conditions, heterogeneous user mobility, and where communication could occur...

    Provided By Ohio State University

  • White Papers // Jan 2013

    Maximizing Social Welfare in Operator-Based Cognitive Radio Networks Under Spectrum Uncertainty and Sensing Inaccuracy

    In Cognitive Radio Networks (CRNs), Secondary Users (SUs) are allowed to opportunistically access the unused/under-utilized channels of Primary Users (PUs). To utilize spectrum resources efficiently, an auction scheme is often applied where an operator serves as an auctioneer and accepts spectrum requests from SUs. Most existing works on spectrum auctions...

    Provided By Ohio State University

  • White Papers // Jan 2013

    Exploring the Inefficiency and Instability of Back-Pressure Algorithms

    In this paper, the authors focus on the issue of stability in multi-hop wireless networks under flow-level dynamics, and explore the inefficiency and instability of the celebrated Back-Pressure algorithms. It has been well-known that the Back-Pressure (or MaxWeight) algorithms achieve queue stability and throughput optimality in a wide variety of...

    Provided By Ohio State University

  • White Papers // Jan 2013

    Providing Probabilistic Guarantees on the Time of Information Spread in Opportunistic Networks

    Spreading patterns of pandemics, computer viruses, and information have been widely studied in various research disciplines including epidemics, biology, physics, sociology, and computer networks. In these disciplines, most studies have been devoted to characterizing spread behaviors toward a network of mobile agents including humans, vehicles, and mobile devices over time....

    Provided By Ohio State University

  • White Papers // Dec 2012

    Performance of Low-Complexity Greedy Scheduling Policies in Multi-Channel Wireless Networks: Optimal Throughput and Near-Optimal Delay

    In this paper, the authors focus on the scheduling problem in multi-channel wireless networks, e.g., the downlink of a single cell in Fourth Generation (4G) OFDM-based cellular networks. Their goal is to design efficient scheduling policies that can achieve provably good performance in terms of both throughput and delay, at...

    Provided By Ohio State University

  • White Papers // Nov 2012

    Maximizing Information in Unreliable Sensor Networks Under Deadline and Energy Constraints

    The authors study the problem of maximizing the information in a wireless sensor network with unreliable links. They consider a sensor network with a tree topology, where the root corresponds to the sink, and the rest of the network detects an event and transmits data to the sink. They formulate...

    Provided By Ohio State University

  • White Papers // Oct 2012

    Performance Analysis of Work-Conserving Schedulers for Minimizing Total Flow-Time With Phase Precedence

    The authors consider the problem of minimizing the total flow-time of multiple jobs in a pool of multiple homogeneous machines, where the jobs arrive over time and have to be served with phase precedence. This is a common occurrence in job scheduling for the increasingly popular data center oriented systems,...

    Provided By Ohio State University

  • White Papers // Oct 2012

    An Extended Reduction Based Parallel Programming Paradigm with Low Overhead Fault-Tolerance Support

    It is widely accepted that the existing MPI-based fault-tolerance solutions will not be applicable in the exascale era, as with growing level of concurrency and relatively lower I/O bandwidths, the time required to complete a check-point can exceed the Mean-Time To Failure (MTTF). In this paper, the authors show that...

    Provided By Ohio State University

  • White Papers // Sep 2012

    A High-Fidelity Temperature Distribution Forecasting System for Data Centers

    Data centers have become a critical computing infrastructure in the era of cloud computing. Temperature monitoring and forecasting are essential for preventing over heating induced server shutdowns and improving a data center's energy efficiency. This paper presents a novel cyber-physical approach for temperature forecasting in data centers, which integrates Computational...

    Provided By Ohio State University

  • White Papers // Sep 2012

    Maximizing System Throughput Using Cooperative Sensing in Multi-Channel Cognitive Radio Networks

    In Cognitive Radio Networks (CRNs), unlicensed users are allowed to access the licensed spectrum when it is not currently being used by Primary Users (PUs). To guarantee a high system throughput in CRNs, the channel state of PUs needs to be accurately detected to reduce conflict. To this end, cooperative...

    Provided By Ohio State University

  • White Papers // Aug 2012

    A Fault-Tolerant Environment for Large-Scale Query Processing

    As datasets are increasing in size, the data management and processing needs are being met with added parallelism, i.e., by involving more nodes and/or cores in the system. This, in turn, is increasing the chances of failures during processing. In this paper, the authors present the design and implementation of...

    Provided By Ohio State University

  • White Papers // Jun 2012

    Low-Complexity Optimal Scheduling Over Correlated Fading Channels With ARQ Feedback

    The authors investigate the downlink scheduling problem under Markovian ON/OFF fading channels, where the instantaneous channel state information is not directly accessible, but is revealed via ARQ-type feedback. The scheduler can exploit the temporal correlation/channel memory inherent in the Markovian channels to improve network performance. However, designing low-complexity and throughput-optimal...

    Provided By Ohio State University

  • White Papers // May 2012

    On Wireless Network Infrastructure Optimization for Cyber-Physical Systems in Future Smart Buildings

    Today, most Cyber-Physical Systems (CPS) in smart buildings require a wireless-based network infrastructure for sensing, communication, and actuation. In such CPSs, the energy expenditure and hence battery lifetime of the wireless network infrastructure depend heavily upon the placement of the Base Stations (BS). However, in indoor environments, BS placement is...

    Provided By Ohio State University

  • White Papers // Apr 2012

    Scheduling Heterogeneous Delay Tolerant Tasks in Smart Grid With Renewable Energy

    The smart grid is the new generation of electricity grid that can efficiently facilitate new distributed sources of energy (e.g., harvested renewable energy), and allow for dynamic electricity price. In this paper, the authors investigate the cost minimization problem for an end-user, such as a home, community, or a business,...

    Provided By Ohio State University

  • White Papers // Apr 2012

    Maximizing a Submodular Utility for Deadline Constrained Data Collection in Sensor Networks

    The authors study the utility maximization problem for data collection in sensor networks subject to a deadline constraint, where the data on a selected subset of nodes are collected through a routing tree rooted at a sink subject to the 1-hop interference model. Their problem can be viewed as a...

    Provided By Ohio State University

  • White Papers // Mar 2012

    Design of a Power Efficient Cloud Computing Environment: Heavy Traffic Limits and QoS

    Cloud computing is fast being deployed by the industry as a means to provide efficient computing resources. A significant fraction of the overall cost of cloud computing operation is the amount of power it consumes, which is related to the number of machines in operation. In order to efficiently manage...

    Provided By Ohio State University

  • White Papers // Mar 2012

    Spammer Behavior Analysis and Detection in User Generated Content on Social Networks

    Spam content is surging with an explosive increase of User Generated Content (UGC) on the Internet. Spammers often insert popular keywords or simply copy and paste recent articles from the Web with spam links inserted, attempting to disable content-based detection. In order to effectively detect spam in user generated content,...

    Provided By Ohio State University

  • White Papers // Feb 2012

    Tracking Conflicting Accesses Efficiently for Software Record and Replay

    Record and replay, which records a multithreaded program's execution in one run and reproduces it deterministically in a second run, is useful for program debugging, fault detection and analysis. The key challenge in multithreaded record and replay is ensuring that conflicting, cross-thread accesses to shared variables are properly detected, recorded...

    Provided By Ohio State University

  • White Papers // Jan 2012

    TurfCast: A Service for Controlling Information Dissemination in Wireless Networks

    Recent years have witnessed mass proliferation of mobile devices with rich wireless communication capabilities as well as emerging mobile device based information dissemination applications that leverage these capabilities. This paper proposes TurfCast, a novel information dissemination service that selectively broadcasts information in particular "Turfs," abstract logical spaces in which receivers...

    Provided By Ohio State University

  • White Papers // Jan 2012

    A Distributed Newton's Method for Joint Multi-Hop Routing and Flow Control: Theory and Algorithm

    The fast growing scale and heterogeneity of current communication networks necessitate the design of distributed cross-layer optimization algorithms. So far, the standard approach of distributed cross-layer design is based on dual decomposition and the sub-gradient algorithm, which is a first-order method that has a slow convergence rate. In this paper,...

    Provided By Ohio State University

  • White Papers // Jan 2012

    Maximizing System Throughput by Cooperative Sensing in Cognitive Radio Networks

    Cognitive Radio Networks allow unlicensed users to opportunistically access the licensed spectrum without causing disruptive interference to the Primary Users (PUs). One of the main challenges in CRNs is the ability to detect PU transmissions. Recent works have suggested the use of Secondary User (SU) cooperation over individual sensing to...

    Provided By Ohio State University

  • White Papers // Jan 2012

    A Pursuer-Evader Game for Sensor Networks

    In this paper, the authors present a self-stabilizing program for solving a pursuer-evader problem in sensor networks. The program can be tuned for tracking speed or energy efficiency. In the program, sensor motes close to the evader dynamically maintain a "Tracking" tree of depth R that is always rooted at...

    Provided By Ohio State University

  • White Papers // Jan 2012

    A Hierarchy-Based Fault-Local Stabilizing Algorithm for Tracking in Sensor Networks

    In this paper, the authors introduce the concept of hierarchy-based fault-local stabilization and a novel self-healing/fault-containment technique and apply them in Stalk. Stalk is an algorithm for tracking in sensor networks that maintains a data structure on top of an underlying hierarchical partitioning of the network. Starting from an arbitrarily...

    Provided By Ohio State University

  • White Papers // Jan 2012

    Design and Analysis of a Fast Local Clustering Service for Wireless Sensor Networks

    The authors present a fast local clustering service, FLOC, that partitions a multi-hop wireless network into non-overlapping and approximately equal-sized clusters. Each cluster has a cluster-head such that all nodes within unit distance of the cluster-head belong to the cluster but no node beyond distance m from the cluster-head belongs...

    Provided By Ohio State University

  • White Papers // Jan 2012

    On the Secrecy Capacity of Fading Channels

    The authors consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. They eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long coherence intervals. They first...

    Provided By Ohio State University

  • White Papers // Nov 2011

    Co-Designing MPI Library and Applications for InfiniBand Clusters

    The field of High Performance Computing (HPC) is forging ahead with complex and high performing system architectures. It is predicted that by the turn of the decade, the authors would have surpassed Exaflop level of computing power. In order to provide balanced system performance, it is necessary to design processor,...

    Provided By Ohio State University

  • White Papers // Jan 2014

    Efficient, Accurate and Privacy-Preserving Data Mining for Frequent Itemsets in Distributed Databases

    Mining distributed databases is emerging as a fundamental computational problem. A common approach for mining distributed databases is to move all of the data from each database to a central site and a single model is built. This approach is accurate, but too expensive in terms of time required. For...

    Provided By Ohio State University

  • White Papers // Oct 2013

    Systematic Testing for Resource Leaks in Android Applications

    The use of mobile devices and the complexity of their software continue to grow rapidly. This growth presents significant challenges for software correctness and performance. In addition to traditional defects, a key consideration are defects related to the limited resources available on these devices. Resource leaks in an application, due...

    Provided By Ohio State University

  • White Papers // Dec 2010

    Provisioning for Cloud Computing

    The paradigm of cloud computing has started a new era of service computing. While there are many research efforts on developing enabling technologies for cloud computing, few focuses on how to strategically set price and capacity and what key components are leading to success in this emerging market. In this...

    Provided By Ohio State University

  • White Papers // Jul 2011

    Throughput-Optimal Scheduling in Multi-Hop Wireless Networks Without Per-Flow Information

    This paper focuses on designing throughput-optimal scheduling policies that avoid using per-flow or per-destination information, maintain a single data queue for each link, and exploit only local information, for multi-hop wireless networks under general interference constraints. Although the celebrated backpressure algorithm maximizes throughput, it requires per-flow or per-destination information (which...

    Provided By Ohio State University

  • White Papers // Mar 2010

    Visualizing Data in Criminal Justice

    For the most part, the methods were developed early in the last century, when collecting data was an expensive proposition. For this reason, to reduce the cost of data collection many of the methods were predicated on taking random samples. Moreover, analyzing data could take hours or days, even with...

    Provided By Ohio State University

  • White Papers // Jan 2011

    Structure-Free Data Aggregation in Sensor Networks

    Data aggregation protocols can reduce the communication cost, thereby extending the lifetime of sensor networks. Prior works on data aggregation protocols have focused on tree-based or cluster-based structured approaches. Although structured approaches are suited for data gathering applications, they incur high maintenance overhead in dynamic scenarios for event-based applications. The...

    Provided By Ohio State University

  • White Papers // Dec 2009

    Maximizing the Contact Opportunity for Vehicular Internet Access

    With increasing popularity of media enabled hand-helds, the need for high data-rate services for mobile users is evident. Large-scale Wireless LANs (WLANs) can provide such a service, but they are expensive to deploy and maintain. Open WLAN Access-Points (APs), on the other hand, need no new deployments, but can offer...

    Provided By Ohio State University

  • White Papers // Dec 2009

    Joint Energy Management and Resource Allocation in Rechargeable Sensor Networks

    Energy harvesting sensor platforms have opened up a new dimension to the design of network protocols. In order to sustain the network operation, the energy consumption rate cannot be higher than the energy harvesting rate, otherwise, sensor nodes will eventually deplete their batteries. In contrast to traditional network resource allocation...

    Provided By Ohio State University

  • White Papers // Jan 2011

    Dynamic Forwarding Over Tree-on-DAG for Scalable Data Aggregation in Sensor Networks

    Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Moreover, structured approaches are sensitive to the waiting-time which is used by nodes to wait for packets from their children before forwarding the packet...

    Provided By Ohio State University

  • White Papers // May 2010

    Delay Analysis and Optimality of Scheduling Policies for Multi-Hop Wireless Networks

    In this paper, the authors analyze the delay performance of a multi-hop wireless network in which the routes between source-destination pairs are fixed. They develop a new queue grouping technique to handle the complex correlations of the service process resulting from the multi-hop nature of the flows and their mutual...

    Provided By Ohio State University

  • White Papers // Dec 2009

    On the Asymptotic Queueing Behavior of General AQM Routers

    In this paper, the authors study the asymptotic behavior of an AQM router serving many AIMD flows. Their model for the AQM router is general and covers most AQM schemes in the current literature. They use a window-based model for the AIMD flows. When the number of AIMD flows is...

    Provided By Ohio State University

  • White Papers // Jan 2011

    Peer-to-Peer Spatial Queries in Sensor Networks

    Sensor networks that consist of potentially several thousands of nodes each with sensing (heat, sound, light, magnetism, etc.) and wireless communication capabilities provide great opportunities for monitoring spatial information about a region of interest. Although spatial query execution has been studied extensively in the context of database systems (e.g., indexing...

    Provided By Ohio State University

  • White Papers // Jan 2011

    On the Potential of Structure-Free Data Aggregation in Sensor Networks

    Data aggregation protocols can reduce the cost of communication, thereby extending the lifetime of sensor networks. Prior work on data aggregation protocols has focused on tree-based or cluster-based structured approaches. Although structured approaches are suited for data gathering applications, they incur high maintenance overhead in dynamic scenarios for event-based applications....

    Provided By Ohio State University

  • White Papers // Oct 2010

    Competitive Nonlinear Pricing And Contract Variety

    The authors analyze markets with both horizontally and vertically differentiated products under both monopoly and duopoly. In the base model with two consumer types, the authors identify conditions under which entry prompts an incumbent to expand or contract its product line. The analysis offers a novel explanation for the widespread...

    Provided By Ohio State University

  • White Papers // Jan 2011

    Rate Quantization and the Speedup Required to Achieve 100% Throughput for Multicast Over Crossbar Switches

    The problem of providing quality of service guarantees for multicast traffic over crossbar switches has received a limited attention, despite the popularity of its counterpart for unicast traffic. Providing a 100% throughput to all admissible multicast traffic has been shown to be very difficult task and it requires a very...

    Provided By Ohio State University

  • White Papers // Feb 2010

    Energy Optimal Transmission Scheduling in Wireless Sensor Networks

    One of the main issues in the design of sensor networks is energy efficient communication of time-critical data. Energy wastage can be caused by failed packet transmission attempts at each node due to channel dynamics and interference. Therefore transmission control techniques that are unaware of the channel dynamics can lead...

    Provided By Ohio State University

  • White Papers // Dec 2009

    A Greedy Link Scheduler for Wireless Networks With Gaussian Multiple Access and Broadcast Channels

    Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to transmit data simultaneously to a single node respectively. In this paper, the authors address the problem of link scheduling in multihop wireless networks containing nodes...

    Provided By Ohio State University

  • White Papers // Aug 2009

    Distributed Cross-Layer Algorithms for the Optimal Control of Multi-hop Wireless Networks

    In this paper, the authors provide and study a general framework that facilitates the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In particular, they describe a generic randomized routing, scheduling and flow control scheme that allows for a set of imperfections in the operation of...

    Provided By Ohio State University

  • White Papers // May 2009

    Impact of Router Queuing Disciplines on Multimedia QoE in IPTV Deployments

    Internet television (IPTV) is rapidly gaining popularity and is being widely deployed on the Internet. In order to deliver optimum user Quality of Experience (QoE), service providers need to understand and balance the trade-offs involved with user (video content, display device), application (codec type, encoding bit rate) and network (network...

    Provided By Ohio State University

  • White Papers // Jan 2011

    Performance Limits of Greedy Maximal Matching in Multi-Hop Wireless Networks

    In this paper, the authors characterize the performance limits of an important class of scheduling schemes, called Greedy Maximal Matching (GMM), for multi-hop wireless networks. For simplicity, they focus on the well-established node-exclusive interference model, although many of the stated results can be readily extended to more general interference models....

    Provided By Ohio State University

  • White Papers // Aug 2010

    In-Flight Camera Platform Geometric Calibration of the Aerial Multi-Head Camera System

    This paper describes an in-flight camera platform geometric calibration method for aerial multi-head camera systems. The platform calibration parameters express the geometric relationship between camera heads and are estimated by means of a temporal geometric constraint in consecutive frames. The constraint used here is the relative geometry between camera heads...

    Provided By Ohio State University

  • White Papers // May 2010

    3D Reconstruction Using Photo Consistency From Uncalibrated Multiple Views

    This paper presents a new 3D object shape reconstruction approach, which exploits the homography transform and photo consistency between multiple images. The proposed method eliminates the requirement for dense feature correspondences, camera calibration, and pose estimation. Using planar homography, the authors generate a set of planes slicing the object to...

    Provided By Ohio State University

  • White Papers // Jul 2009

    An Efficient Hardware-Software Approach to Network Fault Tolerance With InfiniBand

    In the last decade or so, clusters have observed a tremendous rise in popularity due to excellent price to performance ratio. A variety of Interconnects have been proposed during this period, with InfiniBand leading the way due to its high performance and open standard. Increasing size of the InfiniBand clusters...

    Provided By Ohio State University

  • White Papers // Jan 2011

    A Software Based Approach for Providing Network Fault Tolerance in Clusters With UDAPL Interface: MPI Level Design and Performance Evaluation

    In the arena of cluster computing, MPI has emerged as the de facto standard for writing parallel applications. At the same time, introduction of high speed RDMA-enabled interconnects like InfiniBand, Myrinet, Quadrics, RDMA-enabled Ethernet has escalated the trends in cluster computing. Network APIs like uDAPL (user Direct Access Provider Library)...

    Provided By Ohio State University

  • White Papers // Jan 2011

    DDSS: A Low-Overhead Distributed Data Sharing Substrate for Cluster-Based Data-Centers Over Modern Interconnects

    Information-sharing is a key aspect of distributed applications such as database servers and web servers. Information-sharing also assists services such as caching, reconfiguration, etc. In the past, information-sharing has been implemented using ad-hoc messaging protocols which often incur high overheads and are not very scalable. This paper presents a new...

    Provided By Ohio State University

  • White Papers // Jan 2011

    Advanced RDMA-Based Admission Control for Modern Data-Centers

    Current data-centers employ admission control mechanism to maintain low response time and high throughput under overloaded scenarios. Existing mechanisms use internal (On the overloaded server) or external (On the frontend proxies) admission control approaches. The external admission control is preferred since it can be performed transparently without any modifications to...

    Provided By Ohio State University

  • White Papers // Jan 2011

    Secret Instantiation in Ad-Hoc Networks

    Security is typically an important issue in wireless ad-hoc networks, including sensor networks, where the communication medium is broadcast in nature and, hence, an adversary can overhear all messages sent by any user. For this reason, a sender must authenticate the receiver and encrypt any messages it sends. One way...

    Provided By Ohio State University

  • White Papers // Aug 2009

    A Wireless Security Framework Without Shared Secrets

    This paper develops a framework for wireless security that provides confidentiality, identity authentication, message authentication, integrity, sender non-repudiation, receiver non-repudiation and anonymity. The framework is based on two physical primitives: collaborative jamming and spatial signature enforcement. Notably, it eschews the use of shared secrets, while providing a cryptosystem that is...

    Provided By Ohio State University

  • White Papers // Jan 2011

    Applying MPI Derived Datatypes to the NAS Benchmarks: A Case Study

    MPI derived datatypes are a powerful method to define arbitrary collections of non-contiguous data in memory and to enable non-contiguous data communication in a single MPI function call. In this paper, the authors employs MPI datatypes in four NAS benchmarks (MG, LU, BT, and SP) to transfer non-contiguous data. Comprehensive...

    Provided By Ohio State University

  • White Papers // Aug 2010

    Power-Aware Consolidation of Scientific Workflows in Virtualized Environments

    Use of virtualization technologies is becoming prevalent, including, but not limited to, the current commercial cloud environments. At the same time, besides resources costs and application performance, energy efficiency is becoming a dominant consideration while designing systems and executing applications on them. The premise of the work is that consolidation...

    Provided By Ohio State University

  • White Papers // Jan 2010

    QoS-Based Multicast Routing for Distributing Layered Video to Heterogeneous Receivers in Rate-Based Networks

    This paper design an effective multicast routing algorithm for distributing layered multicast video to heterogeneous receivers in networks with rate-based link schedulers. The multicast tree constructed by the algorithm fulfills the QoS requirements imposed by heterogeneous receivers both in terms of bandwidth and delay, and at the same time, consumes...

    Provided By Ohio State University

  • White Papers // Dec 2009

    Leveraged Buyouts Of Private Companies

    Over the last two decades, the number (Enterprise value) of leveraged buyout transactions involving privately held targets totals 10,013 ($855 billion), accounting for 46% (21%) of the worldwide leveraged buyout market. Yet the vast majority of academic studies focus on the buyouts of publicly held targets. This paper investigates the...

    Provided By Ohio State University

  • White Papers // Apr 2010

    Elastic Cloud Caches for Accelerating Service-Oriented Computations

    Computing as a utility, that is, on-demand access to computing and storage infrastructure has emerged in the form of the Cloud. In this model of computing, elastic resource allocation, i.e., the ability to scale resource allocation for specific applications should be optimized to manage cost versus performance. Meanwhile, the wake...

    Provided By Ohio State University

  • White Papers // Jan 2010

    Secure Communications Over Wireless Channels

    This paper presents new techniques that leverage the wireless medium in facilitating secure communications in the presence of eavesdroppers. First, this paper considers the secure transmission of information over an ergodic fading channel with long coherence intervals. The secrecy capacity of such a system is characterized under different assumptions on...

    Provided By Ohio State University

  • White Papers // Aug 2009

    RDMA Over Ethernet - A Preliminary Study

    Though convergence has been a buzzword in the net-working industry for sometime now, no vendor has successfully brought out a solution which combines the ubiquitous nature of Ethernet with the low latency and high performance capabilities that InfiniBand offers. Most of the overlay protocols introduced in the past have had...

    Provided By Ohio State University

  • White Papers // Jan 2010

    A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries

    In this paper the authors present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining an optimal query plan, based on said estimates, for complex queries. The approach relies on summary structure that contains...

    Provided By Ohio State University

  • White Papers // Jan 2010

    Approximate Medial Axis for CAD Models

    Several researches have pointed out the potential use of the medical axis in various geometric modeling applications. The computation of the medial axis for a three dimensional shape often becomes the major bottleneck in these applications. Towards this end, in a recent work, the authors suggested an efficient algorithm that...

    Provided By Ohio State University

  • White Papers // Jan 2010

    HIMAC: High Throughput MAC Layer Multicasting in Wireless Networks

    Efficient, scalable and robust multicasting support from the MAC layer is needed for meeting the demands of multicast based applications over WiFi and mesh networks. However, the IEEE 802.11 protocol has no specific mechanism for multicasting. It implements multicasting using broadcasting at the base transmission rate. This paper identifies two...

    Provided By Ohio State University

  • White Papers // Aug 2009

    Design of an Intelligent Object-Based Storage Device

    Intelligent storage systems were an active area of research in later half of last decade. The idea was to improve the throughput of data intensive applications from database and image processing domains by offloading computation onto the active storage elements and hopefully reducing unnecessary data traffic between data sources and...

    Provided By Ohio State University