ACM Home Page
Please provide us with feedback. Feedback
A stop-and-go queueing framework for congestion management
Full text PdfPdf (1.19 MB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the ACM symposium on Communications architectures & protocols table of contents
Philadelphia, Pennsylvania, United States
Pages: 8 - 18  
Year of Publication: 1990
ISBN:0-89791-405-8
Also published in ...
Author
S. J. Golestani  Bell Communications Research, 445 South Street, Morristown, NJ
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 81,   Citation Count: 28
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/99508.99523
What is a DOI?

ABSTRACT

A framework for congestion management in integrated services packet networks based on a particular service discipline, called stop-and-go queueing, is proposed. In this framework, loss-free and bounded-delay transmission is provided to the class of traffic with stringent delay and loss requirements, e.g., real-time traffic, while the bursty traffic without such requirements is treated on a different basis to achieve high transmission efficiency. Loss-free and bounded-delay transmission is accomplished by means of an admission policy which ensures smoothness of the traffic at the network edge, and the stop-and-go queueing which maintains the traffic smoothness throughout the network. Both the admission policy and the stop-and-go queueing are based on a time framing concept, addressed in a previous paper. This concept is further developed here to incorporate several frame sizes into the strategy, thereby providing the necessary flexibility in accommodating throughput and end-to-end delay requirements of different connections on an as-needed basis.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
R. Kahn and W. Crowther, "Flow Cc,ntrol in a Resource-Sharing Computer Network:", IEEE Trans. Commun., June 1972, pp. 539-546.
 
2
M. Gerla and L. Kleinrock, "Flow Control: A Comparative Survey", IEEE Trans. Commun., 1980, pp. 553-574.
 
3
S. J. Golestani, A Unified Theory of Flow Control and Routing in Data Communication Networks. PhD thesis, MIT, Dept. of Electrical Engineering and Computer Science, Cambridge, MA, 1980.
4
 
5
S. 3. Golestani, "Congestion-Free Transmission of Real-Time Traffic in Packet Networks," Proceedings of INFOCOM, San Francisco, California, June 1990.

CITED BY  28