Article

Free access

Local congestion control in computer-communication networks with random routing

Authors:

N. D. Georganas,

A. Chatterjee,

P. K. VermaAuthors Info & Claims

SIGCOMM '77: Proceedings of the fifth symposium on Data communications

Pages 5.19 - 5.24

https://doi.org/10.1145/800103.803347

Published: 27 September 1977 Publication History

PDF eReader

Abstract

This paper considers the problem of congestion in message-switched, or packet-switched, networks, which employ probabilistic routing schemes. A queueing model for the analysis of a local congestion control scheme is presented. Analytic study of the model shows that local congestion control with random routing is superior to similar control with deterministic routing for a particular example worked out here.

References

[1]

M.C. Pennotti and M. Schwartz "Congestion Control in Store and Forward Tandem Links", IEEE Trans. Commun. Vol. COM-23, No.12, Dec. 1975, pp.1434-1443.

Crossref

Google Scholar

[2]

M.C. Pennotti "The Control of Congestion in Message Switched Networks", Ph.D. Dissertation, Polytechnic Inst. New York, Brooklyn, N.Y. June 1974.

Google Scholar

[3]

A. Chatterjee, N.D. Georganas and P.K. Verma, "Analysis of a Packet-Switched Network with End-to-End Congestion Control and Random Routing", Proc. 3rd International Conf. on Computer Communication, Toronto, Aug. 1976, pp. 488-494. Also in IEEE Trans. Comm. (Concise Paper) (to appear).

Google Scholar

[4]

W.J. Gordon and G.F. Newell, "Cyclic Queueing Systems with Restricted Queue Lengths", "Cyclic Queueing Systems with Restricted Queue Lengths", Oper. Res., April 1967, pp. 266-277.

Google Scholar

[5]

G.C. Hunt, "Sequential Arrays of Waiting Lines", Oper. Res., Dec. 1956, pp. 674-683.

Digital Library

Google Scholar

[6]

S.J. Mason, "Feedback Theory - Further Properties of Signal Flow Graphs", Proc. IRE, Vol. 44, 1956, pp. 220-226.

Google Scholar

[7]

L. Kleinrock, "Queueing Systems Vol. I: Theory", Wiley, N.Y., 1975.

Digital Library

Google Scholar

[8]

Kahn, R.E. and Crowther, W.R., "Flow Control in Resource Sharing Computer Networks", IEEE Transaction on Communications, COM 20, No. 3, June 1972.

Google Scholar

Cited By

View all

Mandelbaum MHlynka M(2017)History of Queueing Theory in Canada Prior to 1980INFOR: Information Systems and Operational Research10.3138/infor.47.4.33547:4(335-353)Online publication date: 18-Jan-2017
https://doi.org/10.3138/infor.47.4.335
Georganas NChatterjee AVerma P(2016) Application Note Local Congestion Control In Computercommunication Networks With Random Routing * † INFOR: Information Systems and Operational Research10.1080/03155986.1980.1173176618:1(74-79)Online publication date: 25-May-2016
https://doi.org/10.1080/03155986.1980.11731766
Swiderski J(1984)Unified Analysis of Local Flow Control Mechanisms in Message-Switched NetworksIEEE Transactions on Communications10.1109/TCOM.1984.109601932:12(1286-1293)Online publication date: Dec-1984
https://doi.org/10.1109/TCOM.1984.1096019
Show More Cited By

Index Terms

Local congestion control in computer-communication networks with random routing
1. Mathematics of computing
  1. Probability and statistics
    1. Statistical paradigms
      1. Queueing theory
2. Networks
  1. Network types
    1. Packet-switching networks

Recommendations

Flow and congestion control for reliable multicast communication in wide-area networks
Congestion control in TCP/IP networks: a combined ECN and BECN approach
MILCOM'03: Proceedings of the 2003 IEEE conference on Military communications - Volume I

In this paper a novel algorithm is proposed which combines the merits of Explicit Congestion Notification (ECN) and Backward Explicit Congestion Notification (BECN) mechanisms for congestion control in TCP/IP networks. A comparative performance ...
Unreliable transport protocol using congestion control for high-speed networks

Currently there is no control for the real-time traffic of multimedia applications using UDP (User Datagram Protocol) in high-speed networks. Therefore, although a number of high-speed TCP (Transmission Control Protocol) protocols have been developed ...

Comments

Information & Contributors

Information

Published In

SIGCOMM '77: Proceedings of the fifth symposium on Data communications

September 1977

180 pages

ISBN:9781450374064

DOI:10.1145/800103

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 September 1977

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
275
Total Downloads

Downloads (Last 12 months)21
Downloads (Last 6 weeks)4

Reflects downloads up to 27 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Mandelbaum MHlynka M(2017)History of Queueing Theory in Canada Prior to 1980INFOR: Information Systems and Operational Research10.3138/infor.47.4.33547:4(335-353)Online publication date: 18-Jan-2017
https://doi.org/10.3138/infor.47.4.335
Georganas NChatterjee AVerma P(2016) Application Note Local Congestion Control In Computercommunication Networks With Random Routing * † INFOR: Information Systems and Operational Research10.1080/03155986.1980.1173176618:1(74-79)Online publication date: 25-May-2016
https://doi.org/10.1080/03155986.1980.11731766
Swiderski J(1984)Unified Analysis of Local Flow Control Mechanisms in Message-Switched NetworksIEEE Transactions on Communications10.1109/TCOM.1984.109601932:12(1286-1293)Online publication date: Dec-1984
https://doi.org/10.1109/TCOM.1984.1096019
Reiser M(1982)Performance evaluation of data communication systemsProceedings of the IEEE10.1109/PROC.1982.1226170:2(171-196)Online publication date: 1982
https://doi.org/10.1109/PROC.1982.12261

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Flow and congestion control for reliable multicast communication in wide-area networks

Congestion control in TCP/IP networks: a combined ECN and BECN approach

Unreliable transport protocol using congestion control for high-speed networks

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Flow and congestion control for reliable multicast communication in wide-area networks

Congestion control in TCP/IP networks: a combined ECN and BECN approach

Unreliable transport protocol using congestion control for high-speed networks

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations