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

DMCA

A generalized processor sharing approach to flow control in integrated services networks: The single-node case (1993)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Abhay K. Parekh , Robert G. Gallager

Venue:	IEEE/ACM TRANSACTIONS ON NETWORKING
Citations:	1988 - 5 self

BibTeX

@ARTICLE{Parekh93ageneralized,
    author = {Abhay K. Parekh and Robert G. Gallager},
    title = {A generalized processor sharing approach to flow control in integrated services networks: The single-node case},
    journal = {IEEE/ACM TRANSACTIONS ON NETWORKING},
    year = {1993},
    volume = {1},
    pages = {344--357}
}

OpenURL

Abstract

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 network is assumed to be a virtual circuit, connection-based packet network. We show that the use of Generalized processor Sharing (GPS), when combined with Leaky Bucket admission control, allows the network to make a wide range of worst-case performance guarantees on throughput and delay. The scheme is flexible in that different users may be given widely different performance guarantees, and is efficient in that each of the servers is work conserving. We present a practical packet-by-packet service discipline, PGPS (first proposed by Deme5 Shenker, and Keshav [7] under the name of Weighted Fair Queueing), that closely approximates GPS. This allows us to relate ressdta for GPS to the packet-by-packet scheme in a precise manner. In this paper, the performance of a single-server GPS system is analyzed exactly from the standpoint of worst-case packet delay and burstiness when the sources are constrained by leaky buckets. The worst-case session backlogs are also determined. In the sequel to this paper, these results are extended to arbitrary topology networks with multiple nodes.

Keyphrases

generalized processor single-node case integrated service network abstruet-the problem practicat packet-by-packet service discipline wide range multiple node packet-bypacket scheme network resource virtual circuiq comection-based packet network deme5 shenker arbitrary topology network rate-based flow control worst-case packet delay single-server gps system worst-case performance guarantee leaky bucket weighted fair queueing worst-case sewdon backlog erent user service network leaky bucket admission control precise manner generalized processor sharing different performance guarantee

DMCA