Bounds on end-to-end delay and jitter in input-buffered and internally-buffered IP networks

Authors:
T. H. Szymanski
Affiliations:
McMaster University, Hamilton, ON, Canada
Venue:
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Year:
2009

Citing 10
Cited 3

A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
The iSLIP scheduling algorithm for input-queued switches

IEEE/ACM Transactions on Networking (TON)
Sizing router buffers

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Open issues in router buffer sizing

ACM SIGCOMM Computer Communication Review
On guaranteed smooth scheduling for input-queued switches

IEEE/ACM Transactions on Networking (TON)
Update on buffer sizing in internet routers

ACM SIGCOMM Computer Communication Review
A critique of recently proposed buffer-sizing strategies

ACM SIGCOMM Computer Communication Review
Low jitter guaranteed-rate communications for cluster computing systems

International Journal of Communication Networks and Distributed Systems
Throughput and QoS optimization in nonuniform multichannel wireless mesh networks

Proceedings of the 4th ACM symposium on QoS and security for wireless and mobile networks
A low-jitter guaranteed-rate scheduling algorithm for packet-switched IP routers

IEEE Transactions on Communications

A low-jitter guaranteed-rate scheduling algorithm for packet-switched IP routers

IEEE Transactions on Communications
Provisioning mission-critical telerobotic control systems over internet backbone networks with essentially-perfect QoS

IEEE Journal on Selected Areas in Communications
Provisioning backhaul traffic flows in TDMA/OFDMA infrastructure wireless mesh networks with near-perfect QoS

Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bounds on the end-to-end delay, jitter and service lead/lag for all statically-provisioned multimedia traffic flows routed through any network of Input-Queued (IQ) switches are presented. A Recursive Fair Stochastic Matrix Decomposition (RFSMD) algorithm is used to determine near-optimal transmission schedules for each switch, where the jitter and service lead/lag of all flows are simultaneously bounded by time-slots for small constant K, where IIDT denotes the Ideal Inter-Departure Time for each flow. It is established that: (a) the number of buffered cells per flow per switch is near-minimal and bounded by O(K) cells, (b) the end-to-end queueing delay along an H-hop path is near-minimal and bounded by time-slots, (c) the end-to-end jitter and service lead/lag are near-minimal and bounded by time-slots (the jitter is not cumulative), and (d) all network-introduced jitter can be provably removed using small playback buffers with O(K) cells. It follows that all statically-provisioned traffic flows, including VOIP, IPTV and Video-on-Demand traffic, can be delivered with essentially-perfect QoS even at 100% loads, thereby achieving the optimal statistical multiplexing gain. The bounds also apply when the crossbar switches use a combination of IQs and crosspoint queues. These theories explain several exhaustive results which have recently been presented in the literature.