End-to-end delay bound calculation in generalized processor sharing networks

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