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

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 fo...

Full description

Saved in:
Bibliographic Details
Published in:Computer communications 2002-11, Vol.25 (17), p.1513-1526
Main Authors: Elsayed, Khaled M.F., Saad, Amr, El-Hadidi, Mahmoud T.
Format: Article
Language:English
Subjects:
ATM networks
Call admission control
Deterministic services
Evaluation
Networks
Packet switching
Packet-by-packet generalized processor sharing
Performance measures
Resource reservation
Resource-based routing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0140-3664
1873-703X
DOI:10.1016/S0140-3664(02)00058-0