A framing strategy for congestion management
- 1 September 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 9 (7), 1064-1077
- https://doi.org/10.1109/49.103553
Abstract
A congestion management strategy for integrated services packet networks that is robust with regard to transmission speed and network size is proposed. The strategy supports several classes of services with zero loss and different delay bounds as well as services without stringent loss and delay guarantees. Loss-free and bounded-delay transmission is accomplished by means of an admission policy which ensure smoothness of the traffic at the network edge, and by a service discipline called stop-and-go queuing, which maintains the traffic smoothness throughout the network. Both the admission policy and the stop-and-go queuing are based on a time framing concept described elsewhere by the author (IEEE Trans. Commun., vol.39, Dec.1991). This concept is further developed to incorporate several frame sizes into the strategy, thereby providing flexibility in meeting throughput and delay requirements of different applications. Stop-and-go queueing is realizable with minor modification to a first-in first-out (FIFO) queueing structure.Keywords
This publication has 12 references indexed in Scilit:
- Emulating circuits in a broadband packet networkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Congestion-free communication in high-speed packet networksIEEE Transactions on Communications, 1991
- A calculus for network delay. II. Network analysisIEEE Transactions on Information Theory, 1991
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991
- Virtual clock: a new traffic control algorithm for packet switching networksACM SIGCOMM Computer Communication Review, 1990
- An architecture for integrated networks that guarantees quality of serviceInternational Journal of Communication Systems, 1990
- Network delay considerations for packetized voicePerformance Evaluation, 1989
- Congestion avoidance and controlPublished by Association for Computing Machinery (ACM) ,1988
- Round Robin Scheduling for Fair Flow Control in Data Communication NetworksPublished by Defense Technical Information Center (DTIC) ,1986
- A Minimum Delay Routing Algorithm Using Distributed ComputationIEEE Transactions on Communications, 1977