End-to-End Delay Bound Calculation in Generalized Processor Sharing Networks

Authors:
Affiliations:
Venue:
ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
Year:
2001

Citing 0
Cited 3

Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline

Computer Networks: The International Journal of Computer and Telecommunications Networking
Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline

Computer Networks: The International Journal of Computer and Telecommunications Networking
Call admission control in generalized processor sharing schedulers with tight deterministic delay bounds

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: In this paper 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 [1] 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 [2]. Numerical examples are shown to illustrate our algorithmic approach for per-session end-to-end delay bound computation.