ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Routing and Rate Allocation to Provide End-to-End Delay Guarantees under PGPS Scheduling

Diwan, Aniruddha S and Sivarajan, Kumar N (2001) Routing and Rate Allocation to Provide End-to-End Delay Guarantees under PGPS Scheduling. In: IEEE International Conference on Communications, June 11-14, Helsinki, pp. 2128-2133.


Download (705kB)


This paper considers the problem of routing sessions with Quality of Service (QoS) requirements in a network under Packet Gener- alized Proceqsor Sharing (PGPS) scheduling. PGPS is a non-preemptive scheduling policy that tracks GPS. The GPS policy operates by allocating a weight $\phi_n^m$ for a session n whose traffic uses link m. These weights determine the rate at which the traffic from session n is served at link m and the rate in turn determines the end-to-end delay of packets belonging to session n. As a deterministic and easily computable end-to-end delay bound is available for locally stable sessions, we consider the locally stable regime in this paper. Two separate problems are considered in this paper. The first problem deals with the practically important inverse pro- cedure of specifying appropriate weights for sessions at each link on their paths, that satisfy predetermined delay bounds, when the set of sessions to be routed is given. Here we show that the fixed routing case can be formulated as a Iirieur progrum (LP) and the adaptive routing case can he formulated as a mixed integer linear program (MILP). The second problem examines the performance of PGPS scheduling policy when providing per- session QoS guarantees. We measure the performance in terms of weighred urrred rrufic.. We derive an upper hound on the weighted carried traffic for mil heuristic algorithm for admission control that operates within the locally stable domain. This upper bound can be obtained by computing a linear program (LP). By simulating a simple heuristic algorithm for admission control, we show that this upper bound is reasonably tight. Hence our upper bound can be used as a metric against which the performance of different algorithms can he compared.

Item Type: Conference Paper
Publisher: Elsevier
Additional Information: Copyright 2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 25 Aug 2008
Last Modified: 19 Sep 2010 04:32
URI: http://eprints.iisc.ac.in/id/eprint/8962

Actions (login required)

View Item View Item