Congestion-free communication in high-speed packet networks
- 1 December 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 39 (12), 1802-1812
- https://doi.org/10.1109/26.120166
Abstract
The process of packet clustering in a network with well-regulated input traffic is studied and a strategy for congestion-free communication in packet networks is proposed. The strategy provides guaranteed services per connection with no packet loss and an end-to-end delay which is a constant plus a small bounded jitter term. It is composed of an admission policy imposed per connection at the source node, and a particular queuing scheme practiced at the switching nodes, which is called stop-and-go queuing. The admission policy requires the packet stream of each connection to possess a certain smoothness property upon arrival at the network. This is equivalent to a peak bandwidth allocation per connection. The queuing scheme eliminates the process of packet clustering and thereby preserves the smoothness property as packets travel inside the network. Implementation is simple.Keywords
This publication has 7 references indexed in Scilit:
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991
- A stop-and-go queueing framework for congestion managementPublished by Association for Computing Machinery (ACM) ,1990
- Network delay considerations for packetized voicePerformance Evaluation, 1989
- Circuit emulationsInternational Journal of Communication Systems, 1988
- Congestion avoidance and controlPublished by Association for Computing Machinery (ACM) ,1988
- Flow Control: A Comparative SurveyIEEE Transactions on Communications, 1980
- Flow Control in a Resource-Sharing Computer NetworkIEEE Transactions on Communications, 1972