Ohio State University

Displaying 1-40 of 165 results

  • 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