The China Press Berhad

Displaying 1-25 of 25 results

  • White Papers // Jan 2014

    Parity Logging with Reserved Space: Towards Efficient Updates and Recovery in Erasure-coded Clustered Storage

    Many modern storage systems adopt erasure coding to provide data availability guarantees with low redundancy. Log-based storage is often used to append new data rather than overwrite existing data so as to achieve high update efficiency, but introduces significant I/O overhead during recovery due to reassembling updates from data and...

    Provided By The China Press Berhad

  • White Papers // Jan 2014

    STAIR Codes: A General Family of Erasure Codes for Tolerating Device and Sector Failures in Practical Storage Systems

    Practical storage systems often adopt erasure codes to tolerate device failures and sector failures, both of which are prevalent in the field. However, traditional erasure codes employ device-level redundancy to protect against sector failures, and hence incur significant space overhead. Recent Sector-Disk (SD) codes are available only for limited configurations...

    Provided By The China Press Berhad

  • White Papers // Jul 2013

    Stochastic Analysis on RAID Reliability for Solid-State Drives

    Solid-State drives (SSDs) have been widely deployed in desktops and data centers. However, SSDs suffer from bit errors, and the bit error rate is time dependent since it increases as an SSD wears down. Traditional storage systems mainly use parity-based RAID to provide reliability guarantees by striping redundancy across multiple...

    Provided By The China Press Berhad

  • White Papers // May 2013

    Symmetry in Distributed Storage Systems

    The max-flow outer bound is achievable by regenerating codes for functional repair distributed storage system. However, the capacity of exact repair distributed storage system is an open problem. In this paper, the linear programming bound for exact repair distributed storage systems is formulated. A notion of symmetrical sets for a...

    Provided By The China Press Berhad

  • White Papers // Mar 2013

    Wireless Broadcast with Physical-Layer Network Coding

    In this paper, the authors investigate the maximum broadcast throughput and its achievability in multi-hop wireless networks with half-duplex node constraint. They allow the use of Physical-layer Network Coding (PNC). Although the use of PNC for unicast has been extensively studied, to their best knowledge, there has been little, if...

    Provided By The China Press Berhad

  • White Papers // Mar 2013

    DroidAnalytics: A Signature Based Analytic System to Collect, Extract, Analyze and Associate Android Malware

    Smartphone's are becoming prevailing devices for many people. Unfortunately, malware on Smartphone's is also increasing at an unprecedented rate. Android OS-based systems, being the most popular platform for mobile devices, have been a popular target for malware developers. As stated in, the exponential growth of mobile malware is mainly due...

    Provided By The China Press Berhad

  • White Papers // Feb 2013

    FRANTIC: A Fast Reference-Based Algorithm for Network Tomography Via Compressive Sensing

    The authors study the problem of link and node delay estimation in undirected networks when at most k out of n links or nodes in the network is congested. Their approach relies on end-to-end measurements of path delays across pre-specified paths in the network. They present a class of algorithms...

    Provided By The China Press Berhad

  • White Papers // Jan 2013

    On AVCs With Quadratic Constraints

    In this paper, the authors study an Arbitrarily Varying Channel (AVC) with quadratic power constraints on the transmitter and a so-called "Oblivious" jammer (along with additional AWGN) under a maximum probability of error criterion, and no private randomness between the transmitter and the receiver. This is in contrast to similar...

    Provided By The China Press Berhad

  • White Papers // Jan 2013

    Reliable Deniable Communication: Hiding Messages in Noise

    Alice is in jail, and may wish to communicate reliably with Bob in the neighboring cell, over n uses of a noisy BSC (if she stays silent, the input to the channel is all zeroes). Unfortunately, the warden Willie is monitoring Alice (though his observations are significantly noisier, since his...

    Provided By The China Press Berhad

  • White Papers // Jan 2013

    Database-Assisted Distributed Spectrum Sharing

    According to FCC's ruling for white-space spectrum access, white-space devices are required to query a database to determine the spectrum availability. In this paper, the authors study the database-assisted distributed whitespace Access Point (AP) network design. They first model the cooperative and non-cooperative channel selection problems among the APs as...

    Provided By The China Press Berhad

  • White Papers // Feb 2012

    Simple and Effective Dynamic Provisioning for Power-Proportional Data Centers

    Energy consumption represents a significant cost in data center operation. A large fraction of the energy, however, is used to power idle servers when the workload is low. Dynamic provisioning techniques aim at saving this portion of the energy, by turning off unnecessary servers. In this paper, the authors explore...

    Provided By The China Press Berhad

  • White Papers // Feb 2012

    Linear Network Code for Erasure Broadcast Channel with Feedback: Complexity and Algorithms

    In this paper, the authors investigate the construction of linear network codes for broadcasting a set of data packets to a number of users. The links from the source to the users are modeled as independent erasure channels. Users are allowed to inform the source node whether a packet is...

    Provided By The China Press Berhad

  • White Papers // Feb 2012

    Analog Network Coding in General SNR Regime

    The problem of maximum rate achievable with analog network coding for a unicast communication over a layered relay network with directed links is considered. A relay node performing analog network coding scales and forwards the signals received at its input. Recently this problem has been considered with two conditions: each...

    Provided By The China Press Berhad

  • White Papers // Aug 2011

    On the Sparsity of a Linear Network Code for Broadcast Systems with Feedback

    One method for reducing the decoding complexity of network coding in wireless broadcast systems is to generate sparse encoding vectors. The problem of finding the minimal Hamming weight of innovative encoding vectors over large finite field is formulated. By reducing the problem of hitting set to it, the authors show...

    Provided By The China Press Berhad

  • White Papers // Jul 2011

    Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration

    In a distributed storage system, the storage costs of different storage nodes, in general, can be different. How to store a file in a given set of storage nodes so as to minimize the total storage cost is investigated. By analyzing the min-cut constraints of the information flow graph, the...

    Provided By The China Press Berhad

  • White Papers // Jul 2011

    Non-Adaptive Probabilistic Group Testing With Noisy Measurements: Near-Optimal Bounds With Efficient Algorithms

    The authors consider the problem of detecting a small subset of defective items from a large set via non-adaptive "Random pooling" group tests. They consider both the case when the measurements are noiseless, and the case when the measurements are noisy (the outcome of each group test may be independently...

    Provided By The China Press Berhad

  • White Papers // Jun 2011

    Exact Minimum-Repair-Bandwidth Cooperative Regenerating Codes for Distributed Storage Systems

    In order to provide high data reliability, distributed storage systems disperse data with redundancy to multiple storage nodes. Regenerating codes is a new class of erasure codes to introduce redundancy for the purpose of improving the data repair performance in distributed storage. Most of the studies on regenerating codes focus...

    Provided By The China Press Berhad

  • White Papers // May 2011

    The Capacity Region of Classes of Product Broadcast Channels

    The authors establish a new outer bound for the capacity region of product broadcast channels. This outer bound matches Marton's inner bound for a variety of classes of product broadcast channels whose capacity regions were previously unknown. These classes include product of reversely semi-deterministic and product of reversely more-capable channels....

    Provided By The China Press Berhad

  • White Papers // May 2011

    Coding for a Network Coded Fountain

    BATched Sparse (BATS) codes are proposed for transmitting a collection of packets through communication networks employing linear network coding. BATS codes generalize fountain codes and preserve the properties such as ratelessness and low encoding/decoding complexity. Moreover, the buffer size and the computation capability of the intermediate network nodes required to...

    Provided By The China Press Berhad

  • White Papers // May 2011

    Generation of Innovative and Sparse Encoding Vectors for Broadcast Systems with Feedback

    In the application of linear network coding to wireless broadcasting with feedback, the authors prove that the problem of determining the existence of an innovative encoding vector is NP-complete when the finite field size is two. When the finite field size is larger than or equal to the number of...

    Provided By The China Press Berhad

  • White Papers // May 2011

    Feedback Enlarges Capacity Region of Two-Way Relay Channel

    The authors consider a Two-way Relay Channel (TRC) in which two terminals exchange messages with the help of a relay between them. The two terminals transmit messages to the relay through the Multiple Access Channel (MAC) and the relay transmits messages to the two terminals through the Broadcast Channel (BC)....

    Provided By The China Press Berhad

  • White Papers // Feb 2011

    On Marton's Inner Bound for Two Receiver Broadcast Channels

    In this paper, the authors considered the 2-letter sum rate of the Marton's inner bound and deduced some properties of this expression. They showed that Marton's sum rate for product of non-identical channels does not factorize and hence their focus was on a much related quantity called the -sum rate....

    Provided By The China Press Berhad

  • White Papers // Mar 2010

    Network Coding Theory: An introduction

    For a long time, store-and-forward had been the transport mode in network communications. In other words, information had been regarded as a commodity that only needs to be routed through the network, possibly with replication at the intermediate nodes. In the late 1990's, a new concept called network coding fundamentally...

    Provided By The China Press Berhad

  • White Papers // Jan 2010

    An Information Inequality for the BSSC Broadcast Channel

    The broadcast channel is a fundamental network information theory setting modeling the communication of messages (private and common) from a single sender to multiple receivers. There has been some recent progress for the discrete memoryless setting, and this work establishes a conjecture proposed in one of the recent papers. The...

    Provided By The China Press Berhad

  • White Papers // Sep 2008

    Variable-Rate Linear Network Coding

    Network coding, first studied by Yeung and Zhang and Ahlswede et al., reveals that if coding is applied at the nodes in a network, rather than routing alone, the network capacity can be increased. Li et al. and subsequently Koetter and Medard proved that linear network coding is sufficient to...

    Provided By The China Press Berhad

  • White Papers // Mar 2013

    Wireless Broadcast with Physical-Layer Network Coding

    In this paper, the authors investigate the maximum broadcast throughput and its achievability in multi-hop wireless networks with half-duplex node constraint. They allow the use of Physical-layer Network Coding (PNC). Although the use of PNC for unicast has been extensively studied, to their best knowledge, there has been little, if...

    Provided By The China Press Berhad

  • White Papers // Mar 2013

    DroidAnalytics: A Signature Based Analytic System to Collect, Extract, Analyze and Associate Android Malware

    Smartphone's are becoming prevailing devices for many people. Unfortunately, malware on Smartphone's is also increasing at an unprecedented rate. Android OS-based systems, being the most popular platform for mobile devices, have been a popular target for malware developers. As stated in, the exponential growth of mobile malware is mainly due...

    Provided By The China Press Berhad

  • White Papers // Jan 2013

    Reliable Deniable Communication: Hiding Messages in Noise

    Alice is in jail, and may wish to communicate reliably with Bob in the neighboring cell, over n uses of a noisy BSC (if she stays silent, the input to the channel is all zeroes). Unfortunately, the warden Willie is monitoring Alice (though his observations are significantly noisier, since his...

    Provided By The China Press Berhad

  • White Papers // Jan 2013

    On AVCs With Quadratic Constraints

    In this paper, the authors study an Arbitrarily Varying Channel (AVC) with quadratic power constraints on the transmitter and a so-called "Oblivious" jammer (along with additional AWGN) under a maximum probability of error criterion, and no private randomness between the transmitter and the receiver. This is in contrast to similar...

    Provided By The China Press Berhad

  • White Papers // Feb 2013

    FRANTIC: A Fast Reference-Based Algorithm for Network Tomography Via Compressive Sensing

    The authors study the problem of link and node delay estimation in undirected networks when at most k out of n links or nodes in the network is congested. Their approach relies on end-to-end measurements of path delays across pre-specified paths in the network. They present a class of algorithms...

    Provided By The China Press Berhad

  • White Papers // Feb 2012

    Simple and Effective Dynamic Provisioning for Power-Proportional Data Centers

    Energy consumption represents a significant cost in data center operation. A large fraction of the energy, however, is used to power idle servers when the workload is low. Dynamic provisioning techniques aim at saving this portion of the energy, by turning off unnecessary servers. In this paper, the authors explore...

    Provided By The China Press Berhad

  • White Papers // Feb 2011

    On Marton's Inner Bound for Two Receiver Broadcast Channels

    In this paper, the authors considered the 2-letter sum rate of the Marton's inner bound and deduced some properties of this expression. They showed that Marton's sum rate for product of non-identical channels does not factorize and hence their focus was on a much related quantity called the -sum rate....

    Provided By The China Press Berhad

  • White Papers // May 2011

    The Capacity Region of Classes of Product Broadcast Channels

    The authors establish a new outer bound for the capacity region of product broadcast channels. This outer bound matches Marton's inner bound for a variety of classes of product broadcast channels whose capacity regions were previously unknown. These classes include product of reversely semi-deterministic and product of reversely more-capable channels....

    Provided By The China Press Berhad

  • White Papers // Sep 2008

    Variable-Rate Linear Network Coding

    Network coding, first studied by Yeung and Zhang and Ahlswede et al., reveals that if coding is applied at the nodes in a network, rather than routing alone, the network capacity can be increased. Li et al. and subsequently Koetter and Medard proved that linear network coding is sufficient to...

    Provided By The China Press Berhad

  • White Papers // May 2011

    Generation of Innovative and Sparse Encoding Vectors for Broadcast Systems with Feedback

    In the application of linear network coding to wireless broadcasting with feedback, the authors prove that the problem of determining the existence of an innovative encoding vector is NP-complete when the finite field size is two. When the finite field size is larger than or equal to the number of...

    Provided By The China Press Berhad

  • White Papers // May 2011

    Coding for a Network Coded Fountain

    BATched Sparse (BATS) codes are proposed for transmitting a collection of packets through communication networks employing linear network coding. BATS codes generalize fountain codes and preserve the properties such as ratelessness and low encoding/decoding complexity. Moreover, the buffer size and the computation capability of the intermediate network nodes required to...

    Provided By The China Press Berhad

  • White Papers // Aug 2011

    On the Sparsity of a Linear Network Code for Broadcast Systems with Feedback

    One method for reducing the decoding complexity of network coding in wireless broadcast systems is to generate sparse encoding vectors. The problem of finding the minimal Hamming weight of innovative encoding vectors over large finite field is formulated. By reducing the problem of hitting set to it, the authors show...

    Provided By The China Press Berhad

  • White Papers // May 2011

    Feedback Enlarges Capacity Region of Two-Way Relay Channel

    The authors consider a Two-way Relay Channel (TRC) in which two terminals exchange messages with the help of a relay between them. The two terminals transmit messages to the relay through the Multiple Access Channel (MAC) and the relay transmits messages to the two terminals through the Broadcast Channel (BC)....

    Provided By The China Press Berhad

  • White Papers // Feb 2012

    Linear Network Code for Erasure Broadcast Channel with Feedback: Complexity and Algorithms

    In this paper, the authors investigate the construction of linear network codes for broadcasting a set of data packets to a number of users. The links from the source to the users are modeled as independent erasure channels. Users are allowed to inform the source node whether a packet is...

    Provided By The China Press Berhad

  • White Papers // Jan 2010

    An Information Inequality for the BSSC Broadcast Channel

    The broadcast channel is a fundamental network information theory setting modeling the communication of messages (private and common) from a single sender to multiple receivers. There has been some recent progress for the discrete memoryless setting, and this work establishes a conjecture proposed in one of the recent papers. The...

    Provided By The China Press Berhad

  • White Papers // Jan 2013

    Database-Assisted Distributed Spectrum Sharing

    According to FCC's ruling for white-space spectrum access, white-space devices are required to query a database to determine the spectrum availability. In this paper, the authors study the database-assisted distributed whitespace Access Point (AP) network design. They first model the cooperative and non-cooperative channel selection problems among the APs as...

    Provided By The China Press Berhad

  • White Papers // May 2013

    Symmetry in Distributed Storage Systems

    The max-flow outer bound is achievable by regenerating codes for functional repair distributed storage system. However, the capacity of exact repair distributed storage system is an open problem. In this paper, the linear programming bound for exact repair distributed storage systems is formulated. A notion of symmetrical sets for a...

    Provided By The China Press Berhad

  • White Papers // Jul 2011

    Minimization of Storage Cost in Distributed Storage Systems with Repair Consideration

    In a distributed storage system, the storage costs of different storage nodes, in general, can be different. How to store a file in a given set of storage nodes so as to minimize the total storage cost is investigated. By analyzing the min-cut constraints of the information flow graph, the...

    Provided By The China Press Berhad

  • White Papers // Jun 2011

    Exact Minimum-Repair-Bandwidth Cooperative Regenerating Codes for Distributed Storage Systems

    In order to provide high data reliability, distributed storage systems disperse data with redundancy to multiple storage nodes. Regenerating codes is a new class of erasure codes to introduce redundancy for the purpose of improving the data repair performance in distributed storage. Most of the studies on regenerating codes focus...

    Provided By The China Press Berhad

  • White Papers // Feb 2012

    Analog Network Coding in General SNR Regime

    The problem of maximum rate achievable with analog network coding for a unicast communication over a layered relay network with directed links is considered. A relay node performing analog network coding scales and forwards the signals received at its input. Recently this problem has been considered with two conditions: each...

    Provided By The China Press Berhad

  • White Papers // Jul 2011

    Non-Adaptive Probabilistic Group Testing With Noisy Measurements: Near-Optimal Bounds With Efficient Algorithms

    The authors consider the problem of detecting a small subset of defective items from a large set via non-adaptive "Random pooling" group tests. They consider both the case when the measurements are noiseless, and the case when the measurements are noisy (the outcome of each group test may be independently...

    Provided By The China Press Berhad

  • White Papers // Mar 2010

    Network Coding Theory: An introduction

    For a long time, store-and-forward had been the transport mode in network communications. In other words, information had been regarded as a commodity that only needs to be routed through the network, possibly with replication at the intermediate nodes. In the late 1990's, a new concept called network coding fundamentally...

    Provided By The China Press Berhad

  • White Papers // Jul 2013

    Stochastic Analysis on RAID Reliability for Solid-State Drives

    Solid-State drives (SSDs) have been widely deployed in desktops and data centers. However, SSDs suffer from bit errors, and the bit error rate is time dependent since it increases as an SSD wears down. Traditional storage systems mainly use parity-based RAID to provide reliability guarantees by striping redundancy across multiple...

    Provided By The China Press Berhad

  • White Papers // Jan 2014

    Parity Logging with Reserved Space: Towards Efficient Updates and Recovery in Erasure-coded Clustered Storage

    Many modern storage systems adopt erasure coding to provide data availability guarantees with low redundancy. Log-based storage is often used to append new data rather than overwrite existing data so as to achieve high update efficiency, but introduces significant I/O overhead during recovery due to reassembling updates from data and...

    Provided By The China Press Berhad

  • White Papers // Jan 2014

    STAIR Codes: A General Family of Erasure Codes for Tolerating Device and Sector Failures in Practical Storage Systems

    Practical storage systems often adopt erasure codes to tolerate device failures and sector failures, both of which are prevalent in the field. However, traditional erasure codes employ device-level redundancy to protect against sector failures, and hence incur significant space overhead. Recent Sector-Disk (SD) codes are available only for limited configurations...

    Provided By The China Press Berhad