Bandwidth allocation for multiple qualities of service using generalized processor sharing

We consider the asymptotic behavior of the queue length distribution in segregated buffers sharing a deterministic server via a class of weighted processor sharing policies. Such policies have been proposed as a means to guarantee individual quality of service constraints to heterogeneous streams in integrated services digital networks. These results exhibit the manner in which spare capacity is shared by statistically multiplexed traffic streams. The framework corresponds to a natural relaxation of networks with so called (σ,ρ)-constrained flows, where, instead of studying the worst case behavior. We consider statistical bounds on the performance of individual traffic streams. We obtain effective bandwidth results for generalized processor sharing (GPS) and packetised generalized processor sharing (PGPS) buffering systems, in the context of ATM-based B-ISDN networks, allowing for a circuit-switched style admission control and routing for multiple QoS