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

@article{1994_gallager_GPS-Integrated-Services-Single-Node, 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. It is shown 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. The authors present a practical packet-by-packet service discipline, PGPS that closely approximates GPS. This allows them to relate results for GPS to the packet-by-packet scheme in a precise manner. 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}, address = {Piscataway, NJ, USA}, author = {Parekh, A. K. and Gallager, R. G.}, citeulike-article-id = {214713}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=159914}, citeulike-linkout-1 = {http://dx.doi.org/10.1109/90.234856}, citeulike-linkout-2 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=234856}, day = {06}, doi = {10.1109/90.234856}, issn = {1063-6692}, journal = {Networking, IEEE/ACM Transactions on}, keywords = {generalizedprocessorsharing, gps, processorsharing, queueingmodel, queueingtheory}, month = {August}, number = {3}, pages = {344--357}, posted-at = {2009-11-03 11:16:28}, priority = {0}, publisher = {IEEE Press}, title = {A generalized processor sharing approach to flow control in integrated services networks: the single-node case}, url = {http://dx.doi.org/10.1109/90.234856}, volume = {1}, year = {2002} }

TY - JOUR ID - 1994_gallager_GPS-Integrated-Services-Single-Node L3 - citeulike-article-id:214713 N2 - 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. It is shown 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. The authors present a practical packet-by-packet service discipline, PGPS that closely approximates GPS. This allows them to relate results for GPS to the packet-by-packet scheme in a precise manner. 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 IS - 3 JF - Networking, IEEE/ACM Transactions on SN - 1063-6692 AD - Piscataway, NJ, USA EP - 357 TI - A generalized processor sharing approach to flow control in integrated services networks: the single-node case PB - IEEE Press VL - 1 SP - 344 KW - generalizedprocessorsharing KW - gps KW - processorsharing KW - queueingmodel KW - queueingtheory AU - Parekh, AK AU - Gallager, RG PY - 2002/08/06/ UR - http://dx.doi.org/10.1109/90.234856 ER -