Results 1 - 10 of 9,052

Capacity of a Mobile Multiple-Antenna Communication Link in Rayleigh Flat Fading

by Thomas L. Marzetta, Bertrand M. Hochwald
"... We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flat-fading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence int ..."
Abstract - Cited by 495 (22 self) - Add to MetaCart
interval of T symbol periods, after which they change to new independent values which they maintain for another T symbol periods, and so on. Computing the link capacity, associated with channel coding over multiple fading intervals, requires an optimization over the joint density of T M complex transmitted

Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility

by Antony Rowstron, Peter Druschel , 2001
"... This paper presents and evaluates the storage management and caching in PAST, a large-scale peer-to-peer persistent storage utility. PAST is based on a self-organizing, Internetbased overlay network of storage nodes that cooperatively route file queries, store multiple replicas of files, and cache a ..."
Abstract - Cited by 803 (23 self) - Add to MetaCart
balances the number of files stored on each node. However, non-uniform storage node capacities and file sizes require more explicit storage load balancing to permit graceful behavior under high global storage utilization; likewise, non-uniform popularity of files requires caching to minimize fetch distance

An algebraic approach to network coding

by Ralf Koetter, Muriel Médard - IEEE/ACM TRANSACTIONS ON NETWORKING , 2003
"... We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al., who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary n ..."
Abstract - Cited by 858 (88 self) - Add to MetaCart
We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al., who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary

On limits of wireless communications in a fading environment when using multiple antennas

by G. J. Foschini, M. J. Gans - Wireless Personal Communications , 1998
"... Abstract. This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bit-rates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multi-element array (M ..."
Abstract - Cited by 2426 (14 self) - Add to MetaCart
communication links. We explore the important case when the channel characteristic is not available at the transmitter but the receiver knows (tracks) the characteristic which is subject to Rayleigh fading. Fixing the overall transmitted power, we express the capacity offered by MEA technology and we see how

Receiver-driven Layered Multicast

by Steven McCanne, Van Jacobson, Martin Vetterli , 1996
"... State of the art, real-time, rate-adaptive, multimedia applications adjust their transmission rate to match the available network capacity. Unfortunately, this source-based rate-adaptation performs poorly in a heterogeneous multicast environment because there is no single target rate — the conflicti ..."
Abstract - Cited by 737 (22 self) - Add to MetaCart
State of the art, real-time, rate-adaptive, multimedia applications adjust their transmission rate to match the available network capacity. Unfortunately, this source-based rate-adaptation performs poorly in a heterogeneous multicast environment because there is no single target rate

Loopy belief propagation for approximate inference: An empirical study. In:

by Kevin P Murphy , Yair Weiss , Michael I Jordan - Proceedings of Uncertainty in AI, , 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract - Cited by 676 (15 self) - Add to MetaCart
X passes to its parent U; is given by: and the message X sends to its child Y j is given by: k;Cj For noisy-or links between parents and children, there exists an analytic expression for 1r( x) and Ax ( u;) that avoids the exhaustive enumeration over parent config urations We made a slight

Practical Network Coding

by Philip A. Chou, Yunnan Wu, Kamal Jain , 2003
"... We propose a distributed scheme for practical network coding that obviates the need for centralized knowledge of the graph topology, the encoding functions, and the decoding functions, and furthermore obviates the need for information to be communicated synchronously through the network. The resu ..."
Abstract - Cited by 462 (15 self) - Add to MetaCart
. The result is a practical system for network coding that is robust to random packet loss and delay as well as robust to any changes in the network topology or capacity due to joins, leaves, node or link failures, congestion, and so on. We simulate such a practical network coding system using the network

ExOR: Opportunistic Multi-Hop Routing for Wireless Networks

by Sanjit Biswas, Robert Morris - in SIGCOMM , 2005
"... This paper describes ExOR, an integrated routing and MAC protocol that increases the throughput of large unicast transfers in multi-hop wireless networks. ExOR chooses each hop of a packet’s route after the transmission for that hop, so that the choice can reflect which intermediate nodes actually r ..."
Abstract - Cited by 457 (0 self) - Add to MetaCart
received the transmission. This deferred choice gives each transmission multiple opportunities to make progress. As a result ExOR can use long radio links with high loss rates, which would be avoided by traditional routing. ExOR increases a connection’s throughput while using no more network capacity than

Congestion control for high bandwidth-delay product networks

by Dina Katabi, Mark Handley, Charlie Rohrs - SIGCOMM '02 , 2002
"... Theory and experiments show that as the per-flow product of bandwidth and latency increases, TCP becomes inefficient and prone to instability, regardless of the queuing scheme. This failing becomes increasingly important as the Internet evolves to incorporate very high-bandwidth optical links and mo ..."
Abstract - Cited by 454 (4 self) - Add to MetaCart
framework, we model XCP and demonstrate it is stable and efficient regardless of the link capacity, the round trip delay, and the number of sources. Extensive packet-level simulations show that XCP outperforms TCP in both conventional and high bandwidth-delay environments. Further, XCP achieves fair

Efficient Link Capacity and QoS Design for Network-on-Chip

by Zvika Guz, Evgeny Bolotin, Israel Cidon, Ran Ginosar, Avinoam Kolodny - In Proc. of Design, Automation and Test in Europe , 2006
"... This paper addresses the allocation of link capacities in the automated design process of a network-on-chip based system. Communication resource costs are minimized under Quality-of-Service timing constraints. First, we introduce a novel analytical delay model for virtual channeled wormhole networks ..."
Abstract - Cited by 16 (2 self) - Add to MetaCart
networks with non-uniform link capacities that eliminates costly simulations at the inner-loop of the optimization process. Second, we present an efficient capacity allocation algorithm that assigns link capacities such that packet delays requirements for each flow are satisfied. We demonstrate the benefit
Results 1 - 10 of 9,052