Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

Reliable and efficient hop-by-hop flow control

Published: 01 October 1994 Publication History

Abstract

Hop-by-hop flow control can be used to fairly share the bandwidth of a network among competing flows. No data is lost even in overload conditions; yet each flow gets access to the maximum throughput when the network is lightly loaded. However, some schemes for hop-by-hop flow control require too much memory; some of them are not resilient to errors. We propose a scheme for making hop-by-hop flow control resilient and show that it has advantages over schemes proposed by Kung. We also describe a novel method for sharing the available buffers among the flows on a link; our scheme allows us to potentially reduce the memory requirement (or increase the number of flows that can be supported) by an order of magnitude. Most of the work is described in the context of an ATM network that uses credit based flow control. However our ideas extend to networks in which flows can be distinguished, and to rate based flow control schemes.

References

[1]
T. Anderson, S. Owicki, J. Saxe, and C. Thacker. High speed switch scheduling for local area networks. In Proceedings of the 5th Annual A CM Symposium on Architectural Support for Programming Languages and Operating Systems, 1993.
[2]
K. Mani Chandy and Leslie Lamport. Distributed snapshots: Determining global states of distributed systems. A CM Trans. on Cornput. Syst., 3(1):63-75, February 1985.
[3]
Alan Chapman and H.T. Kung. Use of flow control for effective statistical multiplexing and notes on implementation. A TM Forum Contribution No.9~.0085, January 1994.
[4]
Alan Demers, Srinivasan Keshav, and Scott Shenker. Analysis and simulation of a fair queueing algorithm. Proceedings of the Sigcomm '89 Symposium on Communications Archtectures and Protocols, 19(4):1-12, September 1989.
[5]
M. Goguen. AN2: a self-confi~ng local ATM network. In Proceedings of the National Communicationa Forum (NCF), 1992.
[6]
Raj Jain. A timeout-based congestion control scheme for window flow-controlled networks. IEEE Journal on Selected Areas in Communications, October 1986.
[7]
Raj Jain. Myths about congestion management in high speed networks. Internetworking: Research and Experience, 3, 1992.
[8]
H.T. Kung and Alan Chapman. The FCVC (Flow Controlled Virtual Channel) proposal for ATM networks. Proc. of Int. Conf. on Network Protocols, October 1993.
[9]
N. A. Lynch and M. R. Turtle. An introduction to input/output automata. MIT/LCS/TM-373, Lab for Computer Science Massachusetts Institute of Technology, November 1988.
[10]
M.Schroeder, A.BirreU, M.Burrows, et al Autonet: a high-speed, self-configuring local area network using point-to-point links. TR 59, Digital Systems Research Center, April 1990.
[11]
K. K. Ramakrishnan and Raj Jain. A binary feedback scheme for congestion avoidance in computer networks with a cormectionless network layer. In Proceedings A CM SIGCOMM '88 Symposium, pages 303-313, August 1988.
[12]
K. K. Ramakrishnan and Raj Jain. A binary feedback scheme for congestion avoidance in computer networks. A CM Transactions on Computer Systems, 8(2), May 1990.
[13]
A. Tanenbaum. Computer Networks. Prentice Hall, 2d.edition edition, 1989.
[14]
J. Turner. New directions in communications, or which way to the information age? IEEE Communications Magazine, 24(10), October 1986.
[15]
Lixia Zhang. Virtual clock: A new traffic control algorithm for packet switched networks. A CM Trans. on Comput. Syst., 9(2):101-125, May 1991.

Cited By

View all
  • (2017)Safe Randomized Load-Balanced Switching By Diffusing Extra LoadsProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/31544871:2(1-37)Online publication date: 19-Dec-2017
  • (2009)Block-switched networksProceedings of the 6th USENIX symposium on Networked systems design and implementation10.5555/1558977.1559006(423-436)Online publication date: 22-Apr-2009
  • (1998)Analysis and dimensioning of credit-based flow control for the ABR service in ATM networksIEEE GLOBECOM 1998 (Cat. NO. 98CH36250)10.1109/GLOCOM.1998.775957(2399-2404)Online publication date: 1998
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review
ACM SIGCOMM Computer Communication Review  Volume 24, Issue 4
Oct. 1994
318 pages
ISSN:0146-4833
DOI:10.1145/190809
  • Editor:
  • David Oran
Issue’s Table of Contents
  • cover image ACM Conferences
    SIGCOMM '94: Proceedings of the conference on Communications architectures, protocols and applications
    October 1994
    328 pages
    ISBN:0897916824
    DOI:10.1145/190314
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: 01 October 1994
Published in SIGCOMM-CCR Volume 24, Issue 4

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)88
  • Downloads (Last 6 weeks)19
Reflects downloads up to 19 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2017)Safe Randomized Load-Balanced Switching By Diffusing Extra LoadsProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/31544871:2(1-37)Online publication date: 19-Dec-2017
  • (2009)Block-switched networksProceedings of the 6th USENIX symposium on Networked systems design and implementation10.5555/1558977.1559006(423-436)Online publication date: 22-Apr-2009
  • (1998)Analysis and dimensioning of credit-based flow control for the ABR service in ATM networksIEEE GLOBECOM 1998 (Cat. NO. 98CH36250)10.1109/GLOCOM.1998.775957(2399-2404)Online publication date: 1998
  • (1998)The interaction of the TCP flow control procedure in end nodes on the proposed flow control mechanism for use in IEEE 802.3 switchesHigh Performance Networking10.1007/978-0-387-35388-3_31(515-534)Online publication date: 1998
  • (1996)Congestion-oriented shortest multipath routingProceedings of IEEE INFOCOM '96. Conference on Computer Communications10.1109/INFCOM.1996.493045(1028-1036)Online publication date: 1996
  • (1996)A minimal-buffer loss-free flow control protocol for ATM networksProceedings of the International IFIP-IEEE Conference on Broadband Communications, Global Infrastructure for the Information Age10.1109/ICBC.1996.887791(161-172)Online publication date: 1996
  • (2024)HarmonyProceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation10.5555/3691825.3691845(329-343)Online publication date: 16-Apr-2024
  • (2017)Safe Randomized Load-Balanced Switching By Diffusing Extra LoadsProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/31544871:2(1-37)Online publication date: 19-Dec-2017
  • (2015)An Overview of Congestion Control Techniques in ATM Networks and Some Performance ResultsIETE Technical Review10.1080/02564602.2000.1141688917:3(87-103)Online publication date: 26-Mar-2015
  • (2011)Highly-Dynamic Cross-Layered Aeronautical Network ArchitectureIEEE Transactions on Aerospace and Electronic Systems10.1109/TAES.2011.603466247:4(2742-2765)Online publication date: 2011
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media