Cart (Loading....) | Create Account
Close category search window
 

Bounds on end-to-end delay and jitter in input-buffered and internally-buffered IP 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

1 Author(s)
Szymanski, T.H. ; Dept. of Data Commun., McMaster Univ., Hamilton, ON

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 K middot IIDT 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 O(KH middot IIDT ) time-slots, (c) the end-to-end jitter and service lead/lag are near-minimal and bounded by O(K middot IIDT ) 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.

Published in:

Sarnoff Symposium, 2009. SARNOFF '09. IEEE

Date of Conference:

March 30 2009-April 1 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.