The Pennsylvania State University

Displaying 1-18 of 18 results

  • White Papers // Jun 2012

    Carbon-Aware Energy Capacity Planning for Datacenters

    Datacenters are facing increasing pressure to cap their carbon footprints at low cost. Recent work has shown the significant environmental benefits of using renewable energy for datacenters by supply-following techniques (workload scheduling, geographical load balancing, etc.) However, all such prior work has only considered on-site renewable generation when numerous other...

    Provided By The Pennsylvania State University

  • White Papers // Mar 2012

    Distributed Maintenance of Cache Freshness in Opportunistic Mobile Networks

    Opportunistic mobile networks consist of personal mobile devices which are intermittently connected with each other. Data access can be provided to these devices via cooperative caching without support from the cellular network infrastructure, but only limited research has been done on maintaining the freshness of cached data which may be...

    Provided By The Pennsylvania State University

  • White Papers // Mar 2012

    Optimal Recovery From Large-Scale Failures in IP Networks

    Quickly recovering IP networks from failures is critical to enhancing Internet robustness and availability. Due to their serious impact on network routing, large-scale failures have received increasing attention in recent years. The authors propose an approach called Reactive Two-phase Rerouting (RTR) for intra-domain routing to quickly recover from large-scale failures...

    Provided By The Pennsylvania State University

  • White Papers // Mar 2012

    Degraded Broadcast Diamond Channels With Non-Causal State Information at the Source

    A state-dependent degraded broadcast diamond channel is studied where the source-to-relays cut is modeled with two noiseless, finite-capacity digital links with a degraded broadcasting structure, while the relays-to-destination cut is a general multiple access channel controlled by a random state. It is assumed that the source has non-causal channel state...

    Provided By The Pennsylvania State University

  • White Papers // Feb 2012

    Sum-Rate Optimal Power Policies for Energy Harvesting Transmitters in an Interference Channel

    This paper considers a two-user Gaussian interference channel with energy harvesting transmitters. Different than conventional battery powered wireless nodes, energy harvesting transmitters have to adapt transmission to availability of energy at a particular instant. In this setting, the optimal power allocation problem to maximize the sum throughput with a given...

    Provided By The Pennsylvania State University

  • White Papers // Feb 2012

    Graph Partitioning for Scalable Distributed Graph Computations

    Inter-node communication time constitutes a significant fraction of the execution time of graph algorithms on distributed-memory systems. Global computations on large-scale sparse graphs with skewed degree distributions are particularly challenging to optimize for, as prior work shows that it is difficult to obtain balanced partitions with low edge cuts for...

    Provided By The Pennsylvania State University

  • White Papers // Jan 2012

    Robust Topology Control in Multi-Hop Cognitive Radio Networks

    The opening of under-utilized spectrum creates the opportunity of substantial performance improvement through cognitive radio techniques. However, the real network performance may be limited since unlicensed users must vacate and switch to other available spectrum if the current spectrum is reclaimed by the licensed (primary) users. During the spectrum switching...

    Provided By The Pennsylvania State University

  • White Papers // Jan 2012

    Distributed Critical Location Coverage in Wireless Sensor Networks With Lifetime Constraint

    In many surveillance scenarios, there are some known critical locations where the events of concern are expected to occur. A common goal in such applications is to use sensors to monitor these critical locations with sufficient quality of surveillance within a designated period. However, with limited sensing resources, the coverage...

    Provided By The Pennsylvania State University

  • White Papers // Mar 2011

    Leveraging Value Locality in Optimizing NAND Flash-Based SSDs

    NAND flash-based Solid-State Drives (SSDs) are increasingly being deployed in storage systems at different levels such as buffer-caches and even secondary storage. However, the poor reliability and performance offered by these SSDs for write-intensive workloads continues to be their key shortcoming. Several solutions based on traditionally popular notions of temporal...

    Provided By The Pennsylvania State University

  • White Papers // Feb 2011

    Message and State Cooperation in a Relay Channel When Only the Relay Knows the State

    A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and destination. The source and the relay are connected via two unidirectional out-of-band orthogonal links of finite capacity, and a state-dependent memoryless channel...

    Provided By The Pennsylvania State University

  • White Papers // Dec 2010

    Middleware for a Re-Configurable Distributed Archival Store Based on Secret Sharing

    Modern storage systems are often faced with complex trade-offs between the confidentiality, availability, and performance they offer their users. Secret sharing is a data encoding technique that provides information-theoretically provable guarantees on confidentiality unlike conventional encryption. Additionally, secret sharing provides quantifiable guarantees on the availability of the encoded data. The...

    Provided By The Pennsylvania State University

  • White Papers // Nov 2010

    Multiple Access Channels With States Causally Known at Transmitters

    The state-dependent Multiple Access Channel (MAC) is considered where the state sequences are known causally to the encoders. First, a MAC with two independent states each known causally to one encoder is revisited, and a new achievable scheme inspired by the recently proposed noisy network coding is presented. This scheme...

    Provided By The Pennsylvania State University

  • White Papers // Jul 2010

    MIMO Wiretap Channels With Arbitrarily Varying Eavesdropper Channel States

    In this paper, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel of the eavesdropper is arbitrarily varying over time. Assuming that the number of antennas of...

    Provided By The Pennsylvania State University

  • White Papers // Jan 2010

    Network Service Description and Discovery for the Next Generation Internet

    The next generation Internet will face new challenges due to the coexisting heterogeneous networks and highly diverse networking applications. Therefore how to coordinate heterogeneous networking systems to support a wide spectrum of application requirements becomes a significant research problem. A key to solving this problem lies in effective and flexible...

    Provided By The Pennsylvania State University

  • White Papers // Oct 2009

    Interference Channels With Strong Secrecy

    It is known that given the real sum of two independent uniformly distributed lattice points from the same nested lattice codebook, the eavesdropper can obtain at most 1 bit of information per channel regarding the value of one of the lattice points. In this paper, the authors study the effect...

    Provided By The Pennsylvania State University

  • White Papers // Oct 2009

    Cost Sharing With Network Coding in Two-Way Relay Networks

    The authors consider a scenario in which two sources exchange stochastically varying traffic with the aid of a bidirectional relay that may perform network coding over the incoming packets. Each relay use incurs a unit cost, e.g., transmission energy. This cost is shared between the sources when packets from both...

    Provided By The Pennsylvania State University

  • White Papers // May 2009

    FlashSim: A Simulator for NAND Flash-Based Solid-State Drives

    NAND Flash memory-based Solid-State Disks (SSDs) are becoming popular as the storage media in domains ranging from mobile laptops to enterprise-scale storage systems due to a number of benefits (e.g., lighter weights, faster access times, lower power consumption, higher resistance to vibrations) they offer over the conventionally popular Hard Disk...

    Provided By The Pennsylvania State University

  • White Papers // Mar 2009

    A Stochastic Model of the Damage Propagation in Database Systems

    Security defense tools like firewalls and antivirus software's are not sufficient to defend against dynamic threats to database systems. Successful attacks could not only seriously impair the integrity of a database but also potentially harm the business operation, assets, and profitability. A better understanding of the attack behavior and its...

    Provided By The Pennsylvania State University

  • White Papers // Jan 2010

    Network Service Description and Discovery for the Next Generation Internet

    The next generation Internet will face new challenges due to the coexisting heterogeneous networks and highly diverse networking applications. Therefore how to coordinate heterogeneous networking systems to support a wide spectrum of application requirements becomes a significant research problem. A key to solving this problem lies in effective and flexible...

    Provided By The Pennsylvania State University

  • White Papers // Mar 2012

    Distributed Maintenance of Cache Freshness in Opportunistic Mobile Networks

    Opportunistic mobile networks consist of personal mobile devices which are intermittently connected with each other. Data access can be provided to these devices via cooperative caching without support from the cellular network infrastructure, but only limited research has been done on maintaining the freshness of cached data which may be...

    Provided By The Pennsylvania State University

  • White Papers // Mar 2012

    Optimal Recovery From Large-Scale Failures in IP Networks

    Quickly recovering IP networks from failures is critical to enhancing Internet robustness and availability. Due to their serious impact on network routing, large-scale failures have received increasing attention in recent years. The authors propose an approach called Reactive Two-phase Rerouting (RTR) for intra-domain routing to quickly recover from large-scale failures...

    Provided By The Pennsylvania State University

  • White Papers // Jan 2012

    Robust Topology Control in Multi-Hop Cognitive Radio Networks

    The opening of under-utilized spectrum creates the opportunity of substantial performance improvement through cognitive radio techniques. However, the real network performance may be limited since unlicensed users must vacate and switch to other available spectrum if the current spectrum is reclaimed by the licensed (primary) users. During the spectrum switching...

    Provided By The Pennsylvania State University

  • White Papers // Jan 2012

    Distributed Critical Location Coverage in Wireless Sensor Networks With Lifetime Constraint

    In many surveillance scenarios, there are some known critical locations where the events of concern are expected to occur. A common goal in such applications is to use sensors to monitor these critical locations with sufficient quality of surveillance within a designated period. However, with limited sensing resources, the coverage...

    Provided By The Pennsylvania State University

  • White Papers // Oct 2009

    Interference Channels With Strong Secrecy

    It is known that given the real sum of two independent uniformly distributed lattice points from the same nested lattice codebook, the eavesdropper can obtain at most 1 bit of information per channel regarding the value of one of the lattice points. In this paper, the authors study the effect...

    Provided By The Pennsylvania State University

  • White Papers // Mar 2009

    A Stochastic Model of the Damage Propagation in Database Systems

    Security defense tools like firewalls and antivirus software's are not sufficient to defend against dynamic threats to database systems. Successful attacks could not only seriously impair the integrity of a database but also potentially harm the business operation, assets, and profitability. A better understanding of the attack behavior and its...

    Provided By The Pennsylvania State University

  • White Papers // Oct 2009

    Cost Sharing With Network Coding in Two-Way Relay Networks

    The authors consider a scenario in which two sources exchange stochastically varying traffic with the aid of a bidirectional relay that may perform network coding over the incoming packets. Each relay use incurs a unit cost, e.g., transmission energy. This cost is shared between the sources when packets from both...

    Provided By The Pennsylvania State University

  • White Papers // Mar 2012

    Degraded Broadcast Diamond Channels With Non-Causal State Information at the Source

    A state-dependent degraded broadcast diamond channel is studied where the source-to-relays cut is modeled with two noiseless, finite-capacity digital links with a degraded broadcasting structure, while the relays-to-destination cut is a general multiple access channel controlled by a random state. It is assumed that the source has non-causal channel state...

    Provided By The Pennsylvania State University

  • White Papers // Jun 2012

    Carbon-Aware Energy Capacity Planning for Datacenters

    Datacenters are facing increasing pressure to cap their carbon footprints at low cost. Recent work has shown the significant environmental benefits of using renewable energy for datacenters by supply-following techniques (workload scheduling, geographical load balancing, etc.) However, all such prior work has only considered on-site renewable generation when numerous other...

    Provided By The Pennsylvania State University

  • White Papers // Mar 2011

    Leveraging Value Locality in Optimizing NAND Flash-Based SSDs

    NAND flash-based Solid-State Drives (SSDs) are increasingly being deployed in storage systems at different levels such as buffer-caches and even secondary storage. However, the poor reliability and performance offered by these SSDs for write-intensive workloads continues to be their key shortcoming. Several solutions based on traditionally popular notions of temporal...

    Provided By The Pennsylvania State University

  • White Papers // Dec 2010

    Middleware for a Re-Configurable Distributed Archival Store Based on Secret Sharing

    Modern storage systems are often faced with complex trade-offs between the confidentiality, availability, and performance they offer their users. Secret sharing is a data encoding technique that provides information-theoretically provable guarantees on confidentiality unlike conventional encryption. Additionally, secret sharing provides quantifiable guarantees on the availability of the encoded data. The...

    Provided By The Pennsylvania State University

  • White Papers // May 2009

    FlashSim: A Simulator for NAND Flash-Based Solid-State Drives

    NAND Flash memory-based Solid-State Disks (SSDs) are becoming popular as the storage media in domains ranging from mobile laptops to enterprise-scale storage systems due to a number of benefits (e.g., lighter weights, faster access times, lower power consumption, higher resistance to vibrations) they offer over the conventionally popular Hard Disk...

    Provided By The Pennsylvania State University

  • White Papers // Feb 2012

    Sum-Rate Optimal Power Policies for Energy Harvesting Transmitters in an Interference Channel

    This paper considers a two-user Gaussian interference channel with energy harvesting transmitters. Different than conventional battery powered wireless nodes, energy harvesting transmitters have to adapt transmission to availability of energy at a particular instant. In this setting, the optimal power allocation problem to maximize the sum throughput with a given...

    Provided By The Pennsylvania State University

  • White Papers // Feb 2011

    Message and State Cooperation in a Relay Channel When Only the Relay Knows the State

    A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and destination. The source and the relay are connected via two unidirectional out-of-band orthogonal links of finite capacity, and a state-dependent memoryless channel...

    Provided By The Pennsylvania State University

  • White Papers // Nov 2010

    Multiple Access Channels With States Causally Known at Transmitters

    The state-dependent Multiple Access Channel (MAC) is considered where the state sequences are known causally to the encoders. First, a MAC with two independent states each known causally to one encoder is revisited, and a new achievable scheme inspired by the recently proposed noisy network coding is presented. This scheme...

    Provided By The Pennsylvania State University

  • White Papers // Jul 2010

    MIMO Wiretap Channels With Arbitrarily Varying Eavesdropper Channel States

    In this paper, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel of the eavesdropper is arbitrarily varying over time. Assuming that the number of antennas of...

    Provided By The Pennsylvania State University

  • White Papers // Feb 2012

    Graph Partitioning for Scalable Distributed Graph Computations

    Inter-node communication time constitutes a significant fraction of the execution time of graph algorithms on distributed-memory systems. Global computations on large-scale sparse graphs with skewed degree distributions are particularly challenging to optimize for, as prior work shows that it is difficult to obtain balanced partitions with low edge cuts for...

    Provided By The Pennsylvania State University