Performance evaluation of resource reservation and call admission policies for deterministic services in PGPS-based packet networks

Abstract

We address the issue of reserving resources at packet switches along the path of calls requiring a deterministic bound on end-to-end delay. The switches are assumed to schedule outgoing packets using the packet-by-packet generalized processor sharing scheduling discipline. We propose an algorithm for call admission control and a number of resource reservation policies that are used to map the end-to-end delay requirement into a local rate to be reserved at each switch. The proposed reservation policies are the uniform reservation (EVEN) policy, the capacity proportional policy, and the remaining capacity proportional policy. We present extensive simulation results to evaluate the performance of these resource allocation policies for various topologies and traffic characteristics. We also propose a resource-based routing algorithm and show the performance gain when it is used.