Purdue Federal Credit Union

Displaying 41-80 of 102 results

  • White Papers // Sep 2012

    Optimal Node Placement in Underwater Wireless Sensor Networks

    Wireless Sensor Networks (WSN) is expected to play a vital role in the exploration and monitoring of underwater areas which are not easily reachable by humans. However, underwater communication via acoustic waves is subject to several performance limitations that are very different from those used for terresstrial networks. In this...

    Provided By Purdue Federal Credit Union

  • White Papers // Sep 2012

    Programming Model Support for Dependable, Elastic Cloud Applications

    An attractive approach to leveraging the ability of cloud-computing platforms to provide resources on demand is to build elastic applications, which can scale up or down based on resource requirements. To ease the development of elastic applications, it is useful for programmers to write applications with simple, inelastic semantics and...

    Provided By Purdue Federal Credit Union

  • White Papers // Sep 2012

    ABHRANTA: Locating Bugs that Manifest at Large System Scales

    A key challenge in developing large scale applications (both in system size and in input size) is finding bugs that are latent at the small scales of testing, only manifesting when a program is deployed at large scales. Traditional statistical techniques fail because no error-free run is available at deployment...

    Provided By Purdue Federal Credit Union

  • White Papers // Aug 2012

    The Impact of Communication Structure and Interpersonal Dependencies on Distributed Teams

    In the past decade, the authors have witnessed an explosive growth of the Web, online communities, and social media. This has led to a substantial increase in the range and scope of electronic communication and distributed collaboration. In distributed teams, social communication is thought to be critical for creating and...

    Provided By Purdue Federal Credit Union

  • White Papers // Jul 2012

    Inter-Session Network Coding Schemes for Two Unicast Sessions With Sequential Hard Deadline Constraints

    The emerging wireless media delivery services have placed greater demands for wireless networks to support high-throughput applications while minimizing the delay of individual packets. In this paper, the authors investigate using inter-session network coding to send packets wirelessly for two deadline-constrained unicast sessions. Specifically, each unicast session aims to transmit...

    Provided By Purdue Federal Credit Union

  • White Papers // Jul 2012

    Privacy Vulnerability of Published Anonymous Mobility Traces

    In this paper, the authors investigate how an adversary, when equipped with a small amount of the snapshot information termed as side information, can infer an extended view of the whereabouts of a victim node appearing in an anonymous trace. Their results quantify the loss of victim nodes' privacy as...

    Provided By Purdue Federal Credit Union

  • White Papers // Jul 2012

    An End-to-End Security Auditing Approach for Service Oriented Architectures

    Service-Oriented Architecture (SOA) is becoming a major paradigm for distributed application development in the recent explosion of Internet services and cloud computing. However, SOA introduces new security challenges not present in the single-hop client-server architectures due to the involvement of multiple service providers in a service request. The interactions of...

    Provided By Purdue Federal Credit Union

  • White Papers // Jun 2012

    On Hashing Graphs

    Collision resistant one-way hashing schemes are the basic building blocks of almost all crypto-systems. Use of graph-structured data models are on the rise - in graph databases, representation of biological and healthcare data as well as in modeling systems for representing system topologies. Therefore, the problem of hashing graphs with...

    Provided By Purdue Federal Credit Union

  • White Papers // Jun 2012

    Network Sampling Designs for Relational Classification

    Relational classification has been extensively studied recently due to its applications in social, biological, technological, and information networks. Much of the work in relational learning has focused on analyzing input data that comprise a single network. Although machine learning researchers have considered the issue of how to sample training and...

    Provided By Purdue Federal Credit Union

  • White Papers // May 2012

    On the Error-Prone Substructures for the Binary-Input Ternary-Output Channel and Its Corresponding Exhaustive Search Algorithm

    The error floor performance of a Low-Density ParityCheck (LDPC) code is highly related to the presence of ErrorProne Substructures (EPSs). In general, existing characterizations of the EPSs are inspired by the LDPC decoding behavior under simple binary erasure channel (BEC) and Binary Symmetric Channel (BSC) models. In this paper, the...

    Provided By Purdue Federal Credit Union

  • White Papers // May 2012

    Extended Abstract: Cipher Techniques to Protect Anonymized Mobility Traces from Privacy Attacks

    The authors study the problem of privacy protection of openly published mobility traces of people and other real-world entities, beyond standard protection techniques of anonymization and spatial/temporal cloaking. In this paper, they argue that a major challenge of more effective protection is the need to balance between secrecy for protection...

    Provided By Purdue Federal Credit Union

  • White Papers // May 2012

    Composable Reliability for Asynchronous Systems

    Distributed systems designs often employ replication to solve two different kinds of availability problems. First, to prevent the loss of data through the permanent destruction or disconnection of a distributed node, and second, to allow prompt retrieval of data when some distributed nodes respond slowly. For simplicity, many systems further...

    Provided By Purdue Federal Credit Union

  • White Papers // Apr 2012

    Split Null Keys: A Null Space Based Defense for Pollution Attacks in Wireless Network Coding

    Recent work in defending against pollution attacks for intra-flow network coding systems proposed a null spaces based algebraic approach which has a smaller computation cost than previous pollution defenses. The approach requires the source to distribute keys periodically, but in order to scale involves forwarder nodes in the creation of...

    Provided By Purdue Federal Credit Union

  • White Papers // Apr 2012

    Dynamic Activation Policies for Event Capture with Rechargeable Sensors

    In this paper, the authors first consider the single-sensor problem. Using dynamic control theory, they consider a full-information model in which, independent of its activation schedule, the sensor will know whether an event has occurred in the last time slot or not. In this case, the problem is framed as...

    Provided By Purdue Federal Credit Union

  • White Papers // Mar 2012

    The Internet-Wide Impact of P2P Traffic Localization on ISP Profitability

    The authors conduct a detailed simulation study to examine how localizing P2P traffic within network boundaries impacts the profitability of an ISP. A distinguishing aspect of their work is the focus on Internet-wide implications, i.e., how adoption of localization within an ISP affects both itself and other ISPs. Their simulations...

    Provided By Purdue Federal Credit Union

  • White Papers // Mar 2012

    Securing Virtual Coordinates by Enforcing Physical Laws

    Virtual Coordinate Systems (VCS) provide accurate estimations of latency between arbitrary hosts on a network, while conducting a small amount of actual measurements and relying on node cooperation. While these systems have good accuracy under benign settings, they suffer a severe decrease of their effectiveness when under attack by compromised...

    Provided By Purdue Federal Credit Union

  • White Papers // Mar 2012

    Joint Optimization of Relay Selection and Power Allocation in Cooperative OFDM Networks With Imperfect Channel Estimation

    The authors consider the wireless relay network in which a base station communicates with multiple subscribers, each of which has the ability to act as a relay to forward information to a base station. Here, they propose an algorithm for joint optimization of power allocation, time scheduling, and relay selection...

    Provided By Purdue Federal Credit Union

  • White Papers // Mar 2012

    The TCP Outcast Problem: Exposing Unfairness in Data Center Networks

    In this paper, the authors observe that bandwidth sharing via TCP in commodity data center networks organized in multi-rooted tree topologies can lead to severe unfairness, which they term as the TCP Outcast problem, under many common traffic patterns. When many flows and a few flows arrive at two ports...

    Provided By Purdue Federal Credit Union

  • White Papers // Mar 2012

    Exercises for Graduate Students Using GENI

    GENI brings together a wide variety of heterogeneous networking infrastructure and technologies under a common platform. The authors propose programming exercises for graduate students to introduce GENI and enable students to conduct high fidelity networking experiments. In this paper, they focus on an exercise to study congestion control and reliability...

    Provided By Purdue Federal Credit Union

  • White Papers // Jan 2012

    Towards A Practical and Effective BGP Defense System

    At the center of the Internet, major ISPs use the Border Gateway Protocol (BGP) to propagate information about Internet destinations and how to reach them. Despite decades of research, BGP problems still exist. In particular, the Internet has a long history of hijacking incidents in which an ISP uses BGP...

    Provided By Purdue Federal Credit Union

  • White Papers // Jan 2012

    VSlicer: Latency-Aware Virtual Machine Scheduling Via Differentiated-Frequency CPU Slicing

    Recent advances in virtualization technologies have made it feasible to host multiple Virtual Machines (VMs) in the same physical host and even the same CPU core, with fair share of the physical resources among the VMs. However, as more VMs share the same core/CPU, the CPU access latency experienced by...

    Provided By Purdue Federal Credit Union

  • White Papers // Nov 2011

    Key Agreement for Wireless Networks in the Presence of Active Adversaries

    In this paper, the authors consider key agreement in a distributed wireless network in which adversarial nodes may exist in the network. Two practical scenarios are studied, i.e., path-key establishment and key pool bootstrapping. For both scenarios, previous work mainly focuses on preventing adversarial eavesdropping attacks. When the adversarial nodes...

    Provided By Purdue Federal Credit Union

  • White Papers // Oct 2011

    Tensioned Metastable Fluid Detectors in Nuclear Security for Passively Monitoring of Special Nuclear Materials-Part A

    In this paper, the authors describe the transformational Tensioned Metastable Fluid Detector (TMFD) based method for \"Passive\" detection of Special Nuclear Materials (SNMs) as related to nuclear security. Purdue University is developing novel, multi-purpose tension metastable fluid nuclear particle detectors by which multiple types of nuclear particles can be detected...

    Provided By Purdue Federal Credit Union

  • White Papers // Oct 2011

    Tensioned Metastable Fluid Detectors in Nuclear Security for Active Interrogation of Special Nuclear Materials-Part B

    In this paper, the authors addresses active interrogation for detecting Special Nuclear Materials (SN- Ms) and includes description of the transformational Tensioned Metastable Fluid Detector (TMFD) based method for optimal monitoring. One of the greatest difficulties in detection of SNMs by active interrogation is the task of distinguishing between the...

    Provided By Purdue Federal Credit Union

  • White Papers // Sep 2011

    Precise, Scalable, and Online Request Tracing for Multi-Tier Services of Black Boxes

    As more and more multi-tier services are developed from commercial off-the-shelf components or heterogeneous middleware without source code available, both developers and administrators need a request tracing tool to exactly know how a user request of interest travels through services of black boxes and obtain macro-level user request behaviors of...

    Provided By Purdue Federal Credit Union

  • White Papers // Sep 2011

    Placement of Applications in Computing Clouds Using Voronoi Diagrams

    The vision of millions of users launching tens of millions of applications running on millions of globally scattered servers presents a new challenge for Cloud Providers: how to assign so many virtual applications to physical servers, while meeting latency needs, improving network utilization, and satisfying availability constraints. Today's application placement...

    Provided By Purdue Federal Credit Union

  • White Papers // Sep 2011

    Exploring the Synergy Between Link Correlation and Network Coding for Energy-Efficient Flooding in Wsns

    Flooding of messages is a fundamental operation in wireless sensor networks which requires special attention to achieve communication efficiency and reliability. The existing works are dominated by ACK/NACK based approaches which demonstrates their effectiveness in achieving efficiency and reliability. A recent work shows that the performance can be further improved...

    Provided By Purdue Federal Credit Union

  • White Papers // Jul 2011

    Cloud Computing Infrastructure Robustness: A Game Theory Approach

    A cloud computing infrastructure typically consists of a number of sites that house servers and are connected to the Internet. Its operation critically depends both on cyber components, including servers and routers, and physical components, including fiber and power routes. Both types of components are subject to attacks of different...

    Provided By Purdue Federal Credit Union

  • White Papers // Jul 2011

    Removing the Blinders: Using Information to Mitigate Adversaries in Adaptive Overlays

    The proliferation of peer-to-peer systems has led to the increasing deployment of dynamic, adaptive overlay networks that are designed to preserve application performance goals. While such networks provide increased performance and resiliency to benign faults, they are susceptible to attacks conducted by compromised overlay nodes, especially those targeting the adaptation...

    Provided By Purdue Federal Credit Union

  • White Papers // Jul 2011

    Process Implanting: A New Active Introspection Framework for Virtualization

    Previous research on virtual machine introspection proposed "Out-of-box" approach by moving out security tools from the guest operating system. However, compared to the traditional "In-the-box" approach, it remains a challenge to obtain a complete semantic view due to the semantic gap between the guest VM and the hypervisor. In this...

    Provided By Purdue Federal Credit Union

  • White Papers // Jun 2011

    Memory Energy Management for an Enterprise Decision Support System

    Energy efficiency is an important factor in designing and configuring enterprise servers. In these servers, memory may consume 40% of the total system power. Different memory configurations (sizes, numbers of ranks, speeds, etc.) can have significant impacts on the performance and energy consumption of enterprise workloads. Many of these workloads,...

    Provided By Purdue Federal Credit Union

  • White Papers // Jun 2011

    Securing Application-Level Topology Estimation Networks: Facing the Frog-Boiling Attack

    Peer-to-peer real-time communication and media streaming applications optimize their performance by using application-level topology estimation services such as virtual coordinate systems. Virtual coordinate systems allow nodes in a peer-to-peer network to accurately predict latency between arbitrary nodes without the need of performing extensive measurements. However, systems that leverage virtual coordinates...

    Provided By Purdue Federal Credit Union

  • White Papers // Jun 2011

    Exploiting Overlays for Practical and Profitable Traffic Attraction

    The Internet is heading towards efficiency with the continued deployment of technologies such as Content Distribution Networks (CDN) and with the introduction of Peer-To-Peer (P2P) localization. These technologies reduce the amount of costly traffic that Internet Service Providers (ISPs) must send to other ISPs. While these advances will undoubtedly cause...

    Provided By Purdue Federal Credit Union

  • White Papers // May 2011

    Relational Active Learning for Joint Collective Classification Models

    In many network domains, labeled data may be costly to acquire - indicating a need for relational active learning methods. Recent paper has demonstrated that relational model performance can be improved by taking network structure into account when choosing instances to label. However, in collective inference settings, both model estimation...

    Provided By Purdue Federal Credit Union

  • White Papers // Apr 2011

    Applying Game Theory to Analyze Attacks and Defenses in Virtual Coordinate Systems

    Virtual coordinate systems provide an accurate and efficient service that allows hosts on the Internet to determine latency to arbitrary hosts based on information provided by a subset of participating nodes. Unfortunately, the accuracy of the service can be severely impacted by compromised nodes providing misleading information. The authors define...

    Provided By Purdue Federal Credit Union

  • White Papers // Mar 2011

    Efficient and Robust Localization of Multiple Radiation Sources in Complex Environments

    There has been increasing interest in the detection and localization of radiation sources as part of the defense strategy against Radiological Dispersal Devices (RDD) commonly known as dirty bombs. In particular, the higher concentration of people in urban areas increases the susceptibility to coordinated dirty bomb attacks. Harmful radioactive substances...

    Provided By Purdue Federal Credit Union

  • White Papers // Mar 2011

    A Game Theoretic Study of Attack and Defense in Cyber-Physical Systems

    Cyber-physical systems encompass a wide range of systems such as sensor networks, cloud computing complexes, and communication networks. They require both the cyber and physical components to function, and hence are susceptible to attacks on either. In this paper, the authors present a number of game theoretic formulations of attack...

    Provided By Purdue Federal Credit Union

  • White Papers // Mar 2011

    Privacy in Cloud Computing Through Identity Management

    The migration of web applications to cloud computing platform has raised concerns about the privacy of sensitive data belonging to the consumers of cloud services. The traditional form of security tokens like username/password used to access cloud services are prone to phishing attacks and hence do not provide complete security....

    Provided By Purdue Federal Credit Union

  • White Papers // Feb 2011

    A Mobile-Cloud Pedestrian Crossing Guide for the Blind

    The ability to detect the status of pedestrian signals at street intersections is a critical aspect of safe outdoor navigation for the blind and visually-impaired, especially in unfamiliar environments. Existing outdoor navigation devices for the blind prove insufficient in providing such guidance due to their reliance on limited mobile computational...

    Provided By Purdue Federal Credit Union

  • White Papers // Feb 2011

    Network Security for Virtual Machine in Cloud Computing

    Cloud computing is the next generation of networking computing, since it can deliver both software and hardware as on-demand resources and services over the Internet. Undoubtedly, one of the significant concerns in cloud computing is security. Virtualization is a key feature of cloud computing. In this paper, the authors focus...

    Provided By Purdue Federal Credit Union

  • White Papers // Jan 2013

    Capacity of P2P On-Demand Streaming with Simple, Robust and Decentralized Control

    The performance of large-scaled Peer-To-Peer (P2P) Video-on-Demand (VoD) streaming systems can be very challenging to analyze. In practical P2P VoD systems, each peer only interacts with a small number of other peers/neighbors. Further, its upload capacity may vary randomly and both its downloading position and content availability change dynamically. In...

    Provided By Purdue Federal Credit Union

  • White Papers // Jan 2013

    Desired Compensation Adaptive Robust Control of Mobile Satellite Communication System with Disturbance and Model Uncertainties

    The tracking and stabilizing control of a typical ship-mounted Mobile Satellite Communication System (MSCS) is studied in this paper. Severe parametric uncertain-ties and uncertain nonlinearities exist in the dynamic model of the MSCS. Therefore, a discontinuous projection-based Desired Compensation Adaptive Robust Control (DCARC) strategy is adopted to compensate for both...

    Provided By Purdue Federal Credit Union

  • White Papers // Oct 2009

    Efficient Privacy Preserving Protocols for Decentralized Computation of Reputation

    Reputation systems represent a key technology for securing distributed applications from misuse by dishonest entities. A reputation system computes reputation scores of the entities in the system, which helps single out those that are exhibiting less than desirable behavior. Examples of reputation systems may be found in several application domains:...

    Provided By Purdue Federal Credit Union

  • White Papers // Sep 2012

    ABHRANTA: Locating Bugs that Manifest at Large System Scales

    A key challenge in developing large scale applications (both in system size and in input size) is finding bugs that are latent at the small scales of testing, only manifesting when a program is deployed at large scales. Traditional statistical techniques fail because no error-free run is available at deployment...

    Provided By Purdue Federal Credit Union

  • White Papers // Sep 2012

    Programming Model Support for Dependable, Elastic Cloud Applications

    An attractive approach to leveraging the ability of cloud-computing platforms to provide resources on demand is to build elastic applications, which can scale up or down based on resource requirements. To ease the development of elastic applications, it is useful for programmers to write applications with simple, inelastic semantics and...

    Provided By Purdue Federal Credit Union

  • White Papers // Mar 2010

    Stochastic Steepest-Descent Optimization of Multiple-Objective Mobile Sensor Coverage

    In this paper, the authors propose a steepest descent method to compute control parameters for achieving an optimal tradeoff between multiple objectives in stateless stochastic scheduling. By stateless, they mean that the scheduling algorithm does not need any bookkeeping of prior service received by clients, but the scheduling decision is...

    Provided By Purdue Federal Credit Union

  • White Papers // Jan 2013

    A Sensor-Cyber Network Testbed for Plume Detection, Identification, and Tracking

    Detection, Identification, and Tracking (DIT) problems that arise in applications such as the protection of people and the environment against radiational, biological, and chemical plumes can be solved by combining the modalities of sensor and cyber networks. The sensor network provides information about physical space activities, such as the locations...

    Provided By Purdue Federal Credit Union

  • White Papers // Feb 2013

    Profit-Optimal and Stability-Aware Load Curtailment in Smart Grids

    A key feature of future smart grids is demand response. With the integration of a two-way communication infrastructure, a smart grid allows its operator to monitor the production and usage of power in real time. In this paper, the authors optimize operator profits for the different cases of load curtailment,...

    Provided By Purdue Federal Credit Union

  • White Papers // Jul 2012

    Privacy Vulnerability of Published Anonymous Mobility Traces

    In this paper, the authors investigate how an adversary, when equipped with a small amount of the snapshot information termed as side information, can infer an extended view of the whereabouts of a victim node appearing in an anonymous trace. Their results quantify the loss of victim nodes' privacy as...

    Provided By Purdue Federal Credit Union

  • White Papers // Dec 2012

    Markov Game Analysis for Attack-Defense of Power Networks Under Possible Misinformation

    In this paper, the authors use zero-sum Markov games to model these interactions subject to underlying uncertainties of real-world events and actions. They solve equilibrium mixed strategies of the players that maximize their respective minimum payoffs with a time-decayed metric. They also show how the defender can use deception as...

    Provided By Purdue Federal Credit Union

  • White Papers // Oct 2012

    Scalable Solutions of Markov Games for Smart-Grid Infrastructure Protection

    In this paper, the authors show that when the players' current interest is a subset of the states only and they are willing to accept small inaccuracies in the game solutions; many Markov game states can be pruned. They present a pruning algorithm in which a threshold parameter is used...

    Provided By Purdue Federal Credit Union

  • White Papers // Jun 2010

    Cyber-Physical Trade-Offs in Distributed Detection Networks

    The authors consider a network of sensors that measure the scalar intensity due to the background or a source combined with background, inside a two-dimensional monitoring area. The sensor measurements may be random due to the underlying nature of the source and background or due to sensor errors or both....

    Provided By Purdue Federal Credit Union

  • White Papers // Apr 2012

    Dynamic Activation Policies for Event Capture with Rechargeable Sensors

    In this paper, the authors first consider the single-sensor problem. Using dynamic control theory, they consider a full-information model in which, independent of its activation schedule, the sensor will know whether an event has occurred in the last time slot or not. In this case, the problem is framed as...

    Provided By Purdue Federal Credit Union

  • White Papers // May 2012

    Extended Abstract: Cipher Techniques to Protect Anonymized Mobility Traces from Privacy Attacks

    The authors study the problem of privacy protection of openly published mobility traces of people and other real-world entities, beyond standard protection techniques of anonymization and spatial/temporal cloaking. In this paper, they argue that a major challenge of more effective protection is the need to balance between secrecy for protection...

    Provided By Purdue Federal Credit Union

  • White Papers // Dec 2009

    Optimizing Link Assignment to Enhance Service in Probabilistic Network

    In this paper, the authors make minor adaptations to the well-known notion of probabilistic network from the machine learning community and use it as their communication model. They then formally define the above optimization problem as the Link Assignment for Successful Service problem (LASS). While LASS can be reduced to...

    Provided By Purdue Federal Credit Union

  • White Papers // Mar 2011

    Efficient and Robust Localization of Multiple Radiation Sources in Complex Environments

    There has been increasing interest in the detection and localization of radiation sources as part of the defense strategy against Radiological Dispersal Devices (RDD) commonly known as dirty bombs. In particular, the higher concentration of people in urban areas increases the susceptibility to coordinated dirty bomb attacks. Harmful radioactive substances...

    Provided By Purdue Federal Credit Union

  • White Papers // Mar 2011

    A Game Theoretic Study of Attack and Defense in Cyber-Physical Systems

    Cyber-physical systems encompass a wide range of systems such as sensor networks, cloud computing complexes, and communication networks. They require both the cyber and physical components to function, and hence are susceptible to attacks on either. In this paper, the authors present a number of game theoretic formulations of attack...

    Provided By Purdue Federal Credit Union

  • White Papers // Jan 2011

    On Robustness of a Class of Cyber-Physical Network Infrastructures

    The authors consider a class of networked system infrastructures that rely on both cyber and physical components for their operation. Both components may be degraded by natural, incidental, or intentional factors. In this paper, they consider a class of Cyber-Physical Network Infrastructures (CPNI) that can be modeled as graphs, wherein...

    Provided By Purdue Federal Credit Union

  • White Papers // Mar 2010

    Localization Leads to Improved Distributed Detection Under Non-Smooth Distributions

    The authors consider a detection network of sensors that measure intensity levels due to a source amidst background inside a two-dimensional monitoring area. The source intensity decays away from it possibly in discrete jumps, and the corresponding sensor measurements could be random due to the nature of source and background,...

    Provided By Purdue Federal Credit Union

  • White Papers // Jan 2013

    Supero: A Sensor System for Unsupervised Residential Power Usage Monitoring

    As a key technology of home area networks in smart grids, fine-grained power usage monitoring may help conserve electricity. Several existing systems achieve this goal by exploiting appliances' power usage signatures identified in labor-intensive in situ training processes. Recent work shows that autonomous power usage monitoring can be achieved by...

    Provided By Purdue Federal Credit Union

  • White Papers // Jul 2011

    Cloud Computing Infrastructure Robustness: A Game Theory Approach

    A cloud computing infrastructure typically consists of a number of sites that house servers and are connected to the Internet. Its operation critically depends both on cyber components, including servers and routers, and physical components, including fiber and power routes. Both types of components are subject to attacks of different...

    Provided By Purdue Federal Credit Union

  • White Papers // Jul 2011

    Process Implanting: A New Active Introspection Framework for Virtualization

    Previous research on virtual machine introspection proposed "Out-of-box" approach by moving out security tools from the guest operating system. However, compared to the traditional "In-the-box" approach, it remains a challenge to obtain a complete semantic view due to the semantic gap between the guest VM and the hypervisor. In this...

    Provided By Purdue Federal Credit Union

  • White Papers // Sep 2010

    A Dynamic Data Middleware Cache for Rapidly-Growing Scientific Repositories

    Modern scientific repositories are growing rapidly in size. Scientists are increasingly interested in viewing the latest data as part of query results. Current scientific middleware cache systems, however, assume repositories are static. Thus, they cannot answer scientific queries with the latest data. The queries, instead, are routed to the repository...

    Provided By Purdue Federal Credit Union

  • White Papers // Mar 2012

    Joint Optimization of Relay Selection and Power Allocation in Cooperative OFDM Networks With Imperfect Channel Estimation

    The authors consider the wireless relay network in which a base station communicates with multiple subscribers, each of which has the ability to act as a relay to forward information to a base station. Here, they propose an algorithm for joint optimization of power allocation, time scheduling, and relay selection...

    Provided By Purdue Federal Credit Union

  • White Papers // May 2012

    On the Error-Prone Substructures for the Binary-Input Ternary-Output Channel and Its Corresponding Exhaustive Search Algorithm

    The error floor performance of a Low-Density ParityCheck (LDPC) code is highly related to the presence of ErrorProne Substructures (EPSs). In general, existing characterizations of the EPSs are inspired by the LDPC decoding behavior under simple binary erasure channel (BEC) and Binary Symmetric Channel (BSC) models. In this paper, the...

    Provided By Purdue Federal Credit Union

  • White Papers // Jun 2013

    Exploring Smart Grid and Data Center Interactions for Electric Power Load Balancing

    The operation of a data center consumes a tremendous amount of electricity, and the energy cost accounts for a large portion of the data center's operation cost. This leads to a growing interest towards reducing the energy cost of data centers. One approach advocated in recent studies is to distribute...

    Provided By Purdue Federal Credit Union

  • White Papers // Sep 2011

    Precise, Scalable, and Online Request Tracing for Multi-Tier Services of Black Boxes

    As more and more multi-tier services are developed from commercial off-the-shelf components or heterogeneous middleware without source code available, both developers and administrators need a request tracing tool to exactly know how a user request of interest travels through services of black boxes and obtain macro-level user request behaviors of...

    Provided By Purdue Federal Credit Union

  • White Papers // Jan 2012

    VSlicer: Latency-Aware Virtual Machine Scheduling Via Differentiated-Frequency CPU Slicing

    Recent advances in virtualization technologies have made it feasible to host multiple Virtual Machines (VMs) in the same physical host and even the same CPU core, with fair share of the physical resources among the VMs. However, as more VMs share the same core/CPU, the CPU access latency experienced by...

    Provided By Purdue Federal Credit Union

  • White Papers // Dec 2012

    High Accuracy Attack Provenance Via Binary-Based Execution Partition

    An important aspect of cyber attack forensics is to understand the provenance of suspicious events, as it discloses the root cause and ramifications of cyber attacks. Traditionally, this is done by analyzing audit log. However, the presence of long running programs makes a live process receiving a large volume of...

    Provided By Purdue Federal Credit Union

  • White Papers // Sep 2011

    Placement of Applications in Computing Clouds Using Voronoi Diagrams

    The vision of millions of users launching tens of millions of applications running on millions of globally scattered servers presents a new challenge for Cloud Providers: how to assign so many virtual applications to physical servers, while meeting latency needs, improving network utilization, and satisfying availability constraints. Today's application placement...

    Provided By Purdue Federal Credit Union

  • White Papers // Oct 2010

    Capacity of 1-to-K Broadcast Packet Erasure Channels With Channel Output Feedback

    In the last decade, the new network coding concept has emerged, which focuses on achieving the capacity of a communication network. More explicitly, the network-coding-based approaches generally model each hop of a packet-based communication network by a Packet Erasure Channel (PEC) instead of the classic Gaussian channel. Such simple abstraction...

    Provided By Purdue Federal Credit Union

  • White Papers // Jul 2012

    Inter-Session Network Coding Schemes for Two Unicast Sessions With Sequential Hard Deadline Constraints

    The emerging wireless media delivery services have placed greater demands for wireless networks to support high-throughput applications while minimizing the delay of individual packets. In this paper, the authors investigate using inter-session network coding to send packets wirelessly for two deadline-constrained unicast sessions. Specifically, each unicast session aims to transmit...

    Provided By Purdue Federal Credit Union

  • White Papers // Jan 2013

    Outsourcing Privacy-Preserving Social Networks to a Cloud

    In the real world, companies would publish social networks to a third party, e.g., a cloud service provider, for marketing reasons. Preserving privacy when publishing social network data becomes an important issue. In this paper, the authors identify a novel type of privacy attack, termed 1-neighborhood attack. They assume that...

    Provided By Purdue Federal Credit Union

  • White Papers // May 2010

    Spatio-Temporal Access Methods: Part 2 (2003 - 2010)

    In spatio-temporal applications, moving objects detect their locations via location-aware devices and update their locations continuously to the server. With the ubiquity and massive numbers of moving objects, many spatio-temporal access methods are developed to process user queries efficiently. Spatio-temporal access methods are classified into four categories: Indexing the past...

    Provided By Purdue Federal Credit Union

  • White Papers // Jan 2013

    An Efficient Algorithm for Shortest Path Multicast Routing Under Delay and Delay Variation Constraints

    A new heuristic algorithm is proposed for constructing multicast tree for multimedia and interactive applications that require certain quality of services, QoS. The authors consider two main QoS parameters that are the delay and delay variation. The problem is formulated as constructing shortest path tree under delay and delay variation...

    Provided By Purdue Federal Credit Union

  • White Papers // Jan 2013

    Scalable Spatio-Temporal Continuous Query Processing for Location-Aware Services

    Real-time spatio-temporal query processing needs to effectively handle a large number of moving objects and continuous spatio-temporal queries. In this paper, the authors use shared execution as a mechanism to support scalability in location-aware servers. Their main idea is to maintain a query table that stores information about continuous spatio-temporal...

    Provided By Purdue Federal Credit Union

  • White Papers // Jan 2013

    Spatio-Temporal Access Methods

    The rapid increase in spatio-temporal applications calls for new auxiliary indexing structures. A typical spatio-temporal application is one that tracks the behavior of moving objects through location-aware devices (e.g., GPS). Through the last decade, many spatio-temporal access methods are developed. Spatio-temporal access methods focus on two orthogonal directions: Indexing the...

    Provided By Purdue Federal Credit Union

  • White Papers // Sep 2011

    Exploring the Synergy Between Link Correlation and Network Coding for Energy-Efficient Flooding in Wsns

    Flooding of messages is a fundamental operation in wireless sensor networks which requires special attention to achieve communication efficiency and reliability. The existing works are dominated by ACK/NACK based approaches which demonstrates their effectiveness in achieving efficiency and reliability. A recent work shows that the performance can be further improved...

    Provided By Purdue Federal Credit Union

  • White Papers // Mar 2012

    The TCP Outcast Problem: Exposing Unfairness in Data Center Networks

    In this paper, the authors observe that bandwidth sharing via TCP in commodity data center networks organized in multi-rooted tree topologies can lead to severe unfairness, which they term as the TCP Outcast problem, under many common traffic patterns. When many flows and a few flows arrive at two ports...

    Provided By Purdue Federal Credit Union

  • White Papers // Jan 2013

    On the Impact of Packet Spraying in Data Center Networks

    Modern data center networks are commonly organized in multi-rooted tree topologies. They typically rely on equal-cost multipath to split flows across multiple paths, which can lead to significant load imbalance. Splitting individual flows can provide better load balance, but is not preferred because of potential packet reordering that conventional wisdom...

    Provided By Purdue Federal Credit Union