Skip to main content
SpringerLink
Log in

Flow Control Protocols

  • Chapter
Computer Network Architectures and Protocols

Part of the book series: Applications of Communications Theory ((ACTH))

Abstract

A packet-switched network may be thought of as a distributed pool of productive resources (channels, buffers, and switching processors) whose capacity must be shared dynamically by a community of competing users (or, more generally, processes) wishing to communicate with each other. Dynamic resource sharing is what distinguishes packet switching from the more traditional circuit-switching approach, in which network resources are dedicated to each user for an entire session. The key advantages of dynamic sharing are greater speed and flexibility in setting up users’ connections across the network and more efficient use of network resources after the connection is established.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Ahuja, “Routing and flow control in systems network architecture,” IBM Syst. J., vol. 18, no. 2, pp. 298–314, 1979.

    Article  Google Scholar 

  2. G. Akavia and L. Kleinrock, “Performance tradeoffs in distributed packet-switching communication networks,” Dep. Comput. Sci., School of Eng. Appl. Sci., Univ. of California, Los Angeles, Tech. Rep. UCLA-ENG-7942, Sept. 1979.

    Google Scholar 

  3. P. Brinch-Hansen, Operating System Principles. Englewood Cliffs, NJ: Prentice-Hall, 1973.

    Google Scholar 

  4. S. Carr et al., “Host/host protocol in the ARPA network,” in Proc. Spring Joint Comput. Conf., 1970, pp. 589–597.

    Google Scholar 

  5. V. G. Cerf and R. Kahn, “A protocol for packet network intercommunication,” IEEE Trans. Commun., vol. COM-22, May 1974.

    Google Scholar 

  6. V. G. Cerf, “DARPA activities in packet network interconnection,” in Interlinking of Computer Networks (NATO Advanced Study Inst. Series). Dordrecht: Reidel.

    Google Scholar 

  7. A. Danet et al., “The French public packet switching service: The Transpac network,” in Proc. Int. Conf. Comput. Commun., Toronto, Ont., Canada, Aug. 1976.

    Google Scholar 

  8. D. W. Davies, “The control of congestion in packet-switching networks,” IEEE Trans. Commun., vol. COM-20, June 1972.

    Google Scholar 

  9. H. C. Folts, “International standards in computer communications,” in Proc. Nat. Telecommun. Conf., Nov. 1979, 59.5.1–59.5.5.

    Google Scholar 

  10. J. Forgie and A. Nemeth, “An efficient packetized voice/data network using statistical flow control,” in Proc. Int. Conf. Commun. Chicago, IL, June 1977.

    Google Scholar 

  11. M. Gerla and D. DeStasio, “Integration of packet and circuit transport protocols in the TRAN data network,” in Proc. Comput. Network Symp., Liege, Belgium, Feb. 1978.

    Google Scholar 

  12. M. Gerla, “Routing and flow control in virtual circuit computer networks,” in Proc. INFO II Int. Conf., July 1979.

    Google Scholar 

  13. M. Gerla and P. O. Nielson, “Routing and flow control interplay in computer networks,” ICCC Proc., Atlanta, November 1980.

    Google Scholar 

  14. M. Gerla, “Bandwidth control in X.25 networks”, PTC Proc., Hawaii, Jan. 1981.

    Google Scholar 

  15. A. Giessler et al., “Free buffer allocation—An investigation by simulation,” Comput. Networks, vol. 2, pp. 191–208, 1978.

    Google Scholar 

  16. I. Gitman and H. Frank, “Economic analysis of integrated voice and data networks,” Proc. IEEE, pp. 1549–1570, Nov. 1978.

    Google Scholar 

  17. J. P. Gray, “Network services in systems network architecture,” IEEE Trans. Commun., vol. COM-25, pp. 104–116, Jan. 1977.

    Article  Google Scholar 

  18. J. P. Gray and T. B. McNeill, “SNA multiple-system networking,” IBM Syst. J., vol. 18, no. 2,1979.

    Google Scholar 

  19. P. E. Green, “The structure of computer networks,” this book, Chap. 1; also in IBM Syst. J., no. 2, 1979.

    Google Scholar 

  20. M. Irland, “Buffer management in a packet switch,” IEEE Trans. Commun., vol. COM-26, pp. 328–337, Mar. 1978.

    Article  Google Scholar 

  21. R. E. Kahn and W. R. Crowther, “A study of the ARPA computer network design and performance,” Bolt Beranek and Newman, Inc., Tech. Rep. 2161, Aug. 1971.

    Google Scholar 

  22. F. Kamoun, “Design considerations for large computer communications networks,” Ph.D. dissertation, Univ. of California, Los Angeles, Eng. Rep. 7642, Apr. 1976.

    Google Scholar 

  23. F. Kamoun, “A drop and throttle flow control (DTFC) policy for computer networks,” Proceedings of the 9th Int. Teletraffic Congr., Spain, Oct. 1979.

    Google Scholar 

  24. P. Kermani and L. Kleinrock, “Dynamic flow control in store and forward computer networks,” IEEE Trans. Commun., vol. COM-27, Feb. 1979.

    Google Scholar 

  25. L. Kleinrock, Queueing Systems: Volume II. Computer Applications. New York: Wiley-Interscience, 1976.

    Google Scholar 

  26. L. Kleinrock, “On flow control in computer networks,” in Proc. Int. Conf. Commun., June 1978.

    Google Scholar 

  27. L. Kleinrock, “Power and deterministic rules of thumb for probabilistic problems in computer communications,” in Proc. Int. Conf. Commun., June 1979.

    Google Scholar 

  28. L. Kleinrock and P. Kermani, “Static flow control in store and forward computer networks,” IEEE Trans. Commun., vol. COM-27, Feb. 1979.

    Google Scholar 

  29. S. Lam and M. Reiser, “Congestion control of store and forward networks by buffer input limits,” in Proc. Nat. Telecommun. Conf., Los Angeles, CA, Dec. 1977.

    Google Scholar 

  30. R. Magoon and D. Twyver, “Flow and congestion control in SL-10 networks,” in Proc. Int. Symp. Flow Control Comput. Networks. Versailles, France, Feb. 1979.

    Google Scholar 

  31. J. C. Majithia et al., “Experiments in congestion control techniques,” in Proc. Int. Symp. Flow Control Comput. Networks, Versailles, France, Feb. 1979.

    Google Scholar 

  32. J. M. McQuillan et al., “Improvements in the design and performance of the ARPA network,” in Proc. Fall Joint Comput. Conf., 1912.

    Google Scholar 

  33. W. E. Naylor, “Stream traffic communication in packet-switched networks,” Ph.D. dissertation, Dep. Comput. Sci., School Eng. Appl. Sci., Univ. of California, Los Angeles, Sept. 1977.

    Google Scholar 

  34. M. Pennotti and M. Schwartz, “Congestion control in store and forward tandem links,” IEEE Trans. Commun., Dec. 1975.

    Google Scholar 

  35. J. Postel, “A graph model analysis of computer communications protocols,” Ph.D. dissertation, Univ. of California, Los Angeles, Jan. 1974.

    Google Scholar 

  36. L. Pouzin, “Flow control in data networks—Methods and tools,” in Proc. Int. Conf. Comput. Commun., Toronto, Ont. Canada, Aug. 1976.

    Google Scholar 

  37. W. L. Price, “Data network simulation experiments as the National Physical Laboratory,” Comput. Networks, vol. I, 1977.

    Google Scholar 

  38. W. L. Price, “A review of the flow control aspects of the network simulation studies at the National Physical Laboratory,” in Proc. Int. Symp. Flow Control in Comput. Networks, Versailles, France, Feb. 1979.

    Google Scholar 

  39. E. Raubold and J. Haenle, “A method of deadlock-free resource allocation and flow control in packet networks,” in Proc. Int. Conf. Comput. Commun., Toronto Ont., Canada, Aug. 1976.

    Google Scholar 

  40. M. Reiser, “A queueing network analysis of computer communication networks with window flow control,” IEEE Trans. Commun., pp. 1199–1209, Aug. 1979.

    Google Scholar 

  41. J. Rinde, “Routing and control in a centrally directed network,” in Proc. Nat. Comput. Conf., Dallas, TX, June 1977.

    Google Scholar 

  42. J. Rinde and A. Caisse, “Passive flow control techniques for distributed networks,” in Proc. Int. Symp. Comput Networks, Versailles, France, Feb. 1979.

    Google Scholar 

  43. M. Schwartz and S. Saad, “Analysis of congestion control techniques in computer communication networks,” in Proc. Int. Symp. Comput. Networks. Versailles, France, Feb. 1979.

    Google Scholar 

  44. J. M. Simon and A. Danet, “Controle des ressources et principes de routage dans le reseau TRANSPAC,” in Proc. Int. Symp. Comput. Networks. Versailles, France, Feb. 1979.

    Google Scholar 

  45. J. Silvester, “On spatial capacity of packet radio networks,” Ph.D. dissertation, Dep. Comput. Sci., School Eng. Appl. Sci., Univ. of California, Los Angeles, Mar. 1980.

    Google Scholar 

  46. C. A. Sunshine, “Interconnection of computer networks,” Comput. Networks, vol. 1, 1977.

    Google Scholar 

  47. C. A. Sunshine, “Transport protocols for computer networks,” in Protocols and Techniques for Data Communications Networks, F. Kuo, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1980.

    Google Scholar 

  48. F. Tobagi, “Multiaccess link control,” this book, Chap. 6.

    Google Scholar 

  49. J. W. Wong and M. S. Unsoy, “Analysis of flow control in switched data networks,” in Proc. Int. Fed. Inf. Processing Soc. Conf., Aug. 1977.

    Google Scholar 

  50. Y. Yemini and L. Kleinrock, “On a general rule for access control or, silence is golden,” in Proc. Int. Symp. Flow Control Comput. Networks, Versailles, France, Feb. 1979.

    Google Scholar 

  51. P. Zafiropulo, “A new approach to protocol validation,” in Proc. Int. Conf. Commun., June 1977.

    Google Scholar 

  52. H. Zimmermann, “The Cyclades end-to-end protocol,” in Proc. 4th Data Commun. Symp., Quebec, P. Q., Canada, Oct. 1975, pp. 7:21–26.

    Google Scholar 

  53. Schwartz and Stern, “Routing protocols,” this book, Chap. 9.

    Google Scholar 

  54. H. Rudin, “Congestion control: Preview and some comments,” IEEE Trans. Commun., vol. COM-29, no. 4, pp. 373–375, April 1981.

    Article  Google Scholar 

  55. D. G. Haenschke, D. A. Kettler, and E. Oberer, “Network management and congestion in the U.S. telecommunications network,” IEEE Trans. Commun., vol. COM-29, no. 4, pp. 376–385, April 1981.

    Article  Google Scholar 

  56. D. E. Sproule and F. Mellor, “Routing, flow, and congestion control in the Datapac network,” IEEE Trans. Commun., vol. COM-29, no. 4, pp. 386–391, April 1981.

    Article  Google Scholar 

  57. L. Tymes, “Routing and flow control in TYMNET,” IEEE Trans. Commun., vol. COM-29, no. 4, pp. 392–398, April 1981.

    Google Scholar 

  58. C. Lemieux, “Theory of flow control in shared networks and its application in the Canadian telephone network,” IEEE Trans. Commun., vol. COM-29, no. 4, pp. 399–412, April 1981.

    Article  MathSciNet  Google Scholar 

  59. L. Puzin, “Methods, tools, and observations on flow control in packet-switched data networks,” IEEE Trans. Commun., vol. COM-29, no. 4, pp. 413–426, April 1981.

    Article  Google Scholar 

  60. K. Bharath-Kumar and J. M. Jaffe, “A new approach to performance-oriented flow control,” IEEE Trans. Commun., vol. COM-29, no. 4, pp. 427–435, April 1981.

    Article  Google Scholar 

  61. A. Giessler, A. Jägemann, E. Mäser, and J. O. Hänle, “Flow control based on buffer classes,” IEEE Trans. Commun., vol. COM-29, no. 4, pp. 436–443, April 1981.

    Article  Google Scholar 

  62. F. Kamoun, “A drop and throttle flow control policy for computer networks,” IEEE Trans. Commun., vol. COM-29, no. 4, pp. 444–452, April 1981.

    Article  Google Scholar 

  63. L. Kaufman, B. Gopinath, and E. F. Wunderlich, “Analysis of packet network congestion control using sparse matrix algorithms,” IEEE Trans. Commun., vol. COM-29, no. 4, pp. 453–465, April 1981.

    Article  Google Scholar 

  64. J. Matsumoto and H. Mori, “Flow control in packet-switched networks by gradual restrictions of virtual calls,” IEEE Trans. Commun., vol. COM-29, no. 4, pp. 466–473, April 1981.

    Article  Google Scholar 

  65. K. D. Günther, “Prevention of deadlocks in packet-switched data transport systems,” IEEE Trans. Commun., vol. COM-29, no. 4, pp. 512–524, April 1981.

    Article  Google Scholar 

  66. D. F. Weir, J. B. Holmblad, and A. C. Rothberg, “An X.75 based network architecture,” ICCC 80 Proceedings, Atlanta, GA, pp. 741–750.

    Google Scholar 

  67. M. Schwartz, Telecommunication Networks: Protocols, Modeling and Analysis. Reading, MA: Addison Wesley, 1986.

    Google Scholar 

  68. M. Gerla, “Routing and flow control in ISDN’s,” ICCC 86 Proceedings, Munich, pp. 643–647.

    Google Scholar 

  69. J. Swiderski, “Examining packet-switching networks with local congestion control for exposure to store-and-forward deadlocks,” ICCC 86 Proceedings, Munich, pp. 670–674.

    Google Scholar 

  70. M. Gerla et al., “Fairness in computer networks,” ICCC 85 Proceedings, Chicago, pp. 43.5.1–43.5.6.

    Google Scholar 

  71. M. Gerla et al., “Routing, flow control, and fairness in computer networks,” ICCC 84 Proceedings, Amstermdam, pp. 1272–1276.

    Google Scholar 

  72. M. Gerla and H. W. Chan, “Window selection in flow controlled networks,” 9th Data Communications Symposium Proceedings, Vancouver, Canada, Sept. 85, pp. 84–92.

    Google Scholar 

  73. J. M. Selga, “Flow-control method for packet networks,” ICCC 86 Proceedings, Munich, pp. 625–630.

    Google Scholar 

  74. D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1987.

    Google Scholar 

  75. J. S. Turner, “Design of an integrated services packet network,” IEEE J SAC, vol. SAC-4, no. 8, pp. 1373–1380.

    Google Scholar 

  76. M. Gerla and L. Fratta, “Design and control in processor limited packet networks,” International Teletraffic Conference Proceedings, Torino, June 1–8, 1988, pp. 5.2B.5.1–5.2B.5.7.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, UCLA, 90024, Los Angeles, California, USA

    Mario Gerla & Leonard Kleinrock

Authors
  1. Mario Gerla
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leonard Kleinrock
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Unisys West Coast Research Center, Santa Monica, 90406, California, USA

    Carl A. Sunshine

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Plenum Press, New York

About this chapter

Cite this chapter

Gerla, M., Kleinrock, L. (1989). Flow Control Protocols. In: Sunshine, C.A. (eds) Computer Network Architectures and Protocols. Applications of Communications Theory. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0809-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0809-6_10

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-8093-4

  • Online ISBN: 978-1-4613-0809-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation