Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/52324.52355acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free access

A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer

Published: 01 August 1988 Publication History
  • Get Citation Alerts
  • Abstract

    We propose a scheme for congestion avoidance in networks using a connectionless protocol at the network layer. The scheme uses feedback from the network to the users of the network. The interesting challenge for the scheme is to use a minimal amount of feedback (one bit in each packet) from the network to adjust the amount of traffic allowed into the network. The servers in the network detect congestion and set a congestion indication bit on packets flowing in the forward direction. The congestion indication is communicated back to the users through the transport level acknowledgement.
    The scheme is distributed, adapts to the dynamic state of the networks, converges to the optimal operating point, is quite simple to implement, and has low overhead while operational. The scheme also addresses a very important aspect of fairness in the service provided to the various sources utilizing the network. The scheme attempts to maintain fairness in service provided to multiple sources.
    This paper presents the scheme and the analysis that went into the choice of the various decision mechanisms. We also address the performance of the scheme under transient changes in the network and for pathological conditions.

    References

    [1]
    V. A~uja. Routing ~nd tlow control ill systems network architecture. IBM $Fstems Journal, 18(2):293-314, 1979.
    [2]
    Werner Bux and Davids C:rillo. Flow control in local-area networks of interconnected token rings. IEEE Transactions on Communications, COM-33(10)-1058-1066, October 1985.
    [3]
    DECnet 'Digital Network Architecture {Phase iV} General Description. Digital Equipment Corporation, 1982. Order No. AA-N149A-TC.
    [4]
    A. Giessler, J. Haanle, A. Konig and E. Padc. Free Buffer Allocation - An Investigation by Simulation. Computer Networks, Vol. 1, No. 3, July 1978, pp. 191-204.
    [5]
    J.C. Majithia etal. Experiments in congestion control techniques. In Proceedings of the International $~rnposlum on Flow Contol in Computer Networks, pages 211- 234, February 1979.
    [6]
    Mario Gerla al~d Leonard Kleinrock. Flow control: a comparative survey. 1EEE Tran~actior~ on (7ommumcation~, COM-2S(4):553-574, April 1980.
    [7]
    Peter G. Harrison. An analytic model for flow control schemes in colllnmnication network nodes. IEEE Transactions on Communications, COM-32(9):1013-1019, September 1984.
    [8]
    Lqo 8073: Information Processing Systems - Open Systems Ir, terconnection - Connection Orier~ted Tran.~port Protocol Specification. International Organization for Standardization, July 1986. (Rel.no. ISO 8073-1986 (E)).
    [9]
    Raj Jain. A timeout-based congestion control scheme for window flow-controlled networks. IEEE Journal on Selected Areas in Communicgtior~s, October 1986.
    [10]
    R.K. Jain, l)ah-Ming Chiu, and Willian~ R. ttawe. A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Systems. DEC Technical tleport TR-301, Digital Equipment Corporation, September 1984.
    [11]
    Raj Jain and K. K. Ralnakrishnan. Congestion Avoidance in Computer Networks with a Oonnectionless Network Layer: Concepts, Goals and Methodology. Proceedings of the Computer Networking Symposium - 1988, pages 134- 143, April 1988.
    [12]
    Leonard Kleinrock. On flow control in computer networks. In Proceedings of the International Conference on Communications, June 1978.
    [13]
    L. Kleinrock. Power and deterministic rules of thumb for probabilistic problems ill computer communications. Proceedir~gs of the international Conference on Uommuncations, June 1979.
    [14]
    John Nagle. Congestion control in tcp/ip internetworks. Computer Communication Review, 14(4), October 1984.
    [15]
    K.K. Ramakrishnan. Analysis of a dynamic window congestion control protocol in heterogeneous enviroltnmnts including satellite links, ht Proceedings of the Computer Networking Symposium, November 1986.
    [16]
    M. Reiser. Queuei~g and delay analysis of a buffer pool with resume level. In A. K. Agrawala altd S. K. Tripathi, editor% Performance '83, pages 25-32, May 1983.
    [17]
    Andrew S. Ta~mnbaum. Computer Networks. Prentice- Hall, Englewood Cliffs, N. J., 1981.
    [18]
    Takshing P. Yum and Hung-Ming Yen. Design algorithm for a hysteresis buffer congestion control strategy. In Proceedings of the IEEE International Conference on Commnications~ pages 499-503, June 1983.
    [19]
    J. Zahorjan, K. C. Sevcik, D. L. Eager, and B. Caller. Balanced job bound analysis of queueing networks. Communications of the ACM, 25(2), February 1982.

    Cited By

    View all
    • (2022)A feedback control principle common to several biological and engineered systemsJournal of The Royal Society Interface10.1098/rsif.2021.071119:188Online publication date: 2-Mar-2022
    • (2021)TCP Incast Solutions in Data Center Networks: SurveyHybrid Intelligent Systems10.1007/978-3-030-73050-5_54(535-545)Online publication date: 17-Apr-2021
    • (2020)On the Future of Congestion Control for the Public InternetProceedings of the 19th ACM Workshop on Hot Topics in Networks10.1145/3422604.3425939(30-37)Online publication date: 4-Nov-2020
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SIGCOMM '88: Symposium proceedings on Communications architectures and protocols
    August 1988
    339 pages
    ISBN:0897912799
    DOI:10.1145/52324
    • Editor:
    • Vinton Cerf
    • cover image ACM SIGCOMM Computer Communication Review
      ACM SIGCOMM Computer Communication Review  Volume 18, Issue 4
      August 1988
      338 pages
      ISSN:0146-4833
      DOI:10.1145/52325
      Issue’s Table of Contents
    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]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 August 1988

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Article

    Conference

    SIGCOMM88
    Sponsor:
    SIGCOMM88: Communication Architecture and Protocols
    August 16 - 18, 1988
    California, Stanford, USA

    Acceptance Rates

    Overall Acceptance Rate 554 of 3,547 submissions, 16%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)132
    • Downloads (Last 6 weeks)26

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)A feedback control principle common to several biological and engineered systemsJournal of The Royal Society Interface10.1098/rsif.2021.071119:188Online publication date: 2-Mar-2022
    • (2021)TCP Incast Solutions in Data Center Networks: SurveyHybrid Intelligent Systems10.1007/978-3-030-73050-5_54(535-545)Online publication date: 17-Apr-2021
    • (2020)On the Future of Congestion Control for the Public InternetProceedings of the 19th ACM Workshop on Hot Topics in Networks10.1145/3422604.3425939(30-37)Online publication date: 4-Nov-2020
    • (2019)P4-enabled Network-assisted Congestion FeedbackProceedings of the 2019 Workshop on Buffer Sizing10.1145/3375235.3375238(1-7)Online publication date: 2-Dec-2019
    • (2018)New congestion control algorithm to improve computer networks performance2018 International Conference on Innovative Trends in Computer Engineering (ITCE)10.1109/ITCE.2018.8316605(87-93)Online publication date: Feb-2018
    • (2013)Generalized fairness in QoS scheduling2013 19th IEEE International Conference on Networks (ICON)10.1109/ICON.2013.6781972(1-6)Online publication date: Dec-2013
    • (2013)Congestion Control in ISDN Frame-Relay NetworksAT&T Technical Journal10.1002/j.1538-7305.1988.tb00065.x67:6(35-46)Online publication date: 29-Jul-2013
    • (2012)Congestion Control in Data Transmission Networks: Historical PerspectiveCongestion Control in Data Transmission Networks10.1007/978-1-4471-4147-1_2(9-44)Online publication date: 7-Jun-2012
    • (2011)NF-TCPProceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II10.5555/2008826.2008859(342-355)Online publication date: 9-May-2011
    • (2011)Rate equalizationProceedings of the 2011 IEEE 36th Conference on Local Computer Networks10.1109/LCN.2011.6115513(50-57)Online publication date: 4-Oct-2011
    • Show More Cited By

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media