By Topic

End-to-end delay bound calculation in generalized processor sharing 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
$33 $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

4 Author(s)
P. Barta ; Dept. of Telecommun. & Telematics, Budapest Univ. of Technol. & Econ., Hungary ; F. Nemeth ; R. Szabo ; J. Biro

We propose a solution to the problem of calculating deterministic end-to-end delay bounds in arbitrary topology networks, which employ the generalized processor sharing (GPS) discipline at each node. We give a general framework under network calculus by extending the service curve model of GPS and constructing the end-to-end service curve for each session, from which exact values of delay and backlog bounds can be computed. Network internal traffic characterization and traffic shaping are applied to support local performance bound computation. Sessions are allowed to be arbitrary weighted and virtual feedback is handled by the iterative approach of Barta, Nemeth, Szabo and Bird (see ICC2001). Numerical examples are shown to illustrate our algorithmic approach for per-session end-to-end delay bound computation

Published in:

Computers and Communications, 2001. Proceedings. Sixth IEEE Symposium on

Date of Conference:

2001