Throughput and Latency in Finite-Buffer Line Networks

DOI10.1109/TIT.2011.2137070MaRDI QIDQ5273617zbMATH OpenOpenAlexFDO

Authors Badri N. Vellambi, Nima Torabkhani, Faramarz Fekri

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1012.2628

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Queues and service in operations research (90B22) Communication networks in operations research (90B18) Feedback control (93B52) Network design and communication in computer systems (68M10)

Abstract: This work investigates the effect of finite buffer sizes on the throughput capacity and packet delay of line networks with packet erasure links that have perfect feedback. These performance measures are shown to be linked to the stationary distribution of an underlying irreducible Markov chain that models the system exactly. Using simple strategies, bounds on the throughput capacity are derived. The work then presents two iterative schemes to approximate the steady-state distribution of node occupancies by decoupling the chain to smaller queueing blocks. These approximate solutions are used to understand the effect of buffer sizes on throughput capacity and the distribution of packet delay. Using the exact modeling for line networks, it is shown that the throughput capacity is unaltered in the absence of hop-by-hop feedback provided packet-level network coding is allowed. Finally, using simulations, it is confirmed that the proposed framework yields accurate estimates of the throughput capacity and delay distribution and captures the vital trends and tradeoffs in these networks.

Cited in

(6)

• Extremal throughputs in free-choice nets
• Throughput equivalencies in fork/ join queueing networks with finite buffers and general service times
• RETRIAL NETWORKS WITH FINITE BUFFERS AND THEIR APPLICATION TO INTERNET DATA TRAFFIC
• Optimal multiplexing on a single link: delay and buffer requirements
• A 0.487 throughput limited sensing algorithm
• Applications and Theory of Petri Nets 2005

This page was built for publication: Throughput and Latency in Finite-Buffer Line Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5273617)