By Topic

Buffer Asymptotics for Coding Over Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bhadra, S. ; Texas Instrum., Dallas, TX, USA ; Shakkottai, S.

Traditionally, network buffer resources have been used at routers to queue transient packets to prevent packet drops. In contrast, we propose a scheme for large multihop networks where intermediate routers have no buffers for queueing transient packets. In the proposed scheme, network storage resources (memory) are used only at source and destination nodes to encode/decode packets using random linear coding over time. Our scheme capitalizes on the common empirical observation that for large networks with many flows through each router, if packet loss occurs in a flow path, it will very likely occur only at only a very few links on the path. Unfortunately, the location of this congested link varies with time, thereby preventing prevailing static buffer allocation strategies from exploiting this observation. We propose source coding over packets at the session layer as a means of “sharing” memory across links along a flow path. We call this spatial buffer multiplexing-where buffering and coding implemented at the source compensates for packet loss at any downstream bufferless link. First, we consider large spatial multihop networks with N nodes (each with finite buffer space for coding/decoding) and Θ(N) flows; the number of flows through each link scales as Ω(Nα) for some α ∈ (0,1). Using many-sources large deviations analysis, we show that to obtain comparable packet drop probabilities (QoS), spatial buffer multiplexing provides an order-wise buffer gain of Ω(Nα) per node over traditional static buffer allocation for queueing. Next we consider the complementary case of a network with a small number of flows through a buffer, but large source buffer. Here, we provide a sufficient condition under which the packet loss probability decreases exponentially in a function that is linear in the size of the input buffer, where the function is required to - - meet a predetermined negative slope -δ. We express the loss effective bandwidth for coding and compare it against that for queueing.

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 12 )