A generalized processor sharing approach to flow control in integrated services networks-the single node case

The problem of allocating network resources to the users of an integrated services network is investigated in the context of rate based flow control. The authors propose the use of a packet service discipline at the nodes of the network that is based on a multiplex scheme called generalized processor sharing (GPS). This service discipline is combined with leaky bucket rate admission control to provide flexible, efficient and fair use of the links. A single server GPS system is analyzed exactly, and tight bounds on worst case packet delay, output burstiness and backlog are derived for each session, when the sources are constrained by leaky buckets. The analysis yields a simple resource assignment scheme that allows the server to make worst case delay and rate guarantees to every session in the system. Extensions of this work to arbitrary topology networks are also discussed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>