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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
V. Ahuja, “Routing and flow control in systems network architecture,” IBM Syst J., vol. 18, no. 2, pp. 298–314, 1979.
G. Akavia and L. Kleinrock, “Performance tradeoffs in distributed packet-switching communication networks,” Dep. Comput. Sci., School of Eng. Appl. Sci., Univ. of Califomia, Los Angeles, Tech. Rep. UCLA-ENG-7942, Sept. 1979.
P. Brinch-Hansen, Operating System Principles. Englewood Cliffs, New Jersey, Prentice- Hall, 1973.
S. Carr et al., “Host/host protocol in the ARPA network,” in Proc. Spring Joint Comput. Conf., 1970, pp. 589–597.
V. G. Cerf and R. Kahn, “A protocol for packet network intercommunication,” IEEE Trans. Commun., vol. COM-22, May 1974.
V. G. Cerf, “DARPA activities in packet network interconnection,” in Interlinking of Computer Networks (NATO Advanced Study Inst. Series). Reidel.
A. Danet et al., “The French public packet switching service: The Transpac network,” in Proc. Int. Conf. Comput. Commun., Toronto, Ont., Canada, Aug. 1976.
D. W. Davies, “The control of congestion in packet-switching networks,” IEEE Trans. Commun., vol. COM-20, June 1972.
H. C. Folts, “International standards in computer communications,” in Proc. Nat. Telecommun. Conf, Nov. 1979, pp. 59.5.1–59.5.5.
J. Forgie and A. Nemeth, “An efficient packetized voice/data network using statistical flow control,” in Proc. Int. Conf Commun. Chicago, IL, June 1977.
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.
M. Gerla, “Routing and flow control in virtual circuit computer networks,” in Proc. INFO II Int. Conf, July 1979.
M. Gerla and P. O. Nielson, “Routing and flow control interplay in computer networks,” ICCC Proc., Atlanta, November, 1980.
M. Gerla, “Bandwidth control in X.25 networks, PTC Proc., Hawaii, January 1981.
A. Giessler et al., “Free buffer allocation—An investigation by simulation,” Comput. Networks, vol. 2, pp. 191–208, 1978.
I. Gitman and H. Frank, “Economic analysis of integrated voice and data networks,” Proc. IEEE, pp. 1549–1570, Nov. 1978.
J. P. Gray, “Network services in systems network architecture,” IEEE Trans.Commun., vol. COM-25, pp. 104–116, Jan. 1977.
J. P. Gray and T. B. McNeill, “SNA multiple-system networking,” IBM Syst. J., vol. 18, no. 2, 1979.
P. E. Green, “The structure of computer networks,” this book. Chap. 1; also in IBM Syst. J. no. 2, 1979.
M. Irland, “Buffer management in a packet switch,” IEEE Trans. Commun., vol. COM-26, pp. 328–337, Mar. 1978.
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.
F. Kamoun, “Design considerations for large computer communications networks,” Ph.D. dissertation, Univ. of California, Los Angeles, Eng. Rep. 7642, Apr. 1976.
F. Kamoun, “A drop and throttle flow control (DTFC) policy for computer networks,” Proceedings of the 9th Int. Teletraffic Congr., Spain, Oct. 1979.
P. Kermani and L. Kleinrock, “Dynamic flow control in store and forward computer networks,” IEEE Trans. Commun., vol. COM-27, Feb. 1979.
L. Kleinrock, Queueing Systems: Volume II. Computer Applications. New York: Wiley- Interscience, 1976.
L. Kleinrock, “On flow control in computer networks,” in Proc. Int. Conf Commun., June 1978.
L. Kleinrock, “Power and deterministic rules of thumb for probabilistic problems in computer communications,” in Proc. Int. Conf Commun., June 1979.
L. Kleinrock and P. Kermani, “Static flow control in store and forward computer networks,” IEEE Trans. Commun., vol. COM-27, Feb. 1979.
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.
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.
J. C. Majithia et al., “Experiments in congestion control techniques,” in Proc. Int. Symp. Flow Control Comput. Networks, Versailles, France, Feb. 1979.
J. M. McQuillan et al., “Improvements in the design and performance of the ARPA network,” in Proc. Fall Joint Comput. Conf., 1972.
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.
M. Pennotti and M. Schwartz, “Congestion control in store and forward tandem Hnks,” IEEE Trans. Commun., Dec. 1975.
J. Postel, “A graph model analysis of computer communications protocols,” Ph.D. disseration, Univ. of Califomia, Los Angeles, Jan. 1974.
L. Pouzin, “Flow control in data networks—Methods and tools,” in Proc. Int. Conf Comput. Commun., Toronto, Ont. Canada, Aug. 1976.
W. L. Price, “Data network simulation experiments at the National Physical Laboratory,” Comput. Networks, vol. I, 1977.
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.
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.
M. Reiser, “A queueing network analysis of computer communication networks with window flow control,” IEEE Trans. Commun., pp. 1199–1209, Aug. 1979.
J. Rinde, “Routing and control in a centrally directed network,” in Proc. Nat. Comput Conf, Dallas, TX, June 1977.
J. Rinde and A. Caisse, “Passive flow control techniques for distributed networks,” in Proc. Int Symp. Comput Networks, Versailles, France, Feb. 1979.
M. Schwartz, and S. Saad, “Analysis of congestion control techniques in computer communication networks,” in Proc. Int Symp. Comput. Networks. Versailles, France, Feb. 1979.
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.
J. Silvester “On spatial capacity of packet radio networks,” Ph.D. dissertation, Dep. Comput. Sci., School Eng. Appl. Sci., Univ. of Califomia, Los Angeles, Mar. 1980.
A. C. Sunshine, “Interconnection of computer networks,” Comput Networks, vol. 1, 1977.
A. C. Sunshine, “Transport protocols for computer networks,” in Protocols and Techniques for Data Communications Networks, F. Kuo, Ed. Englewood Cliffs, NJ: Prentice- Hall, 1980.
F. Tobagi, “Multiaccess link control,” this book. Chap. 6.
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.
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.
P. Zafiropulo, “A new approach to protocol validation,” in Proc. Int. Conf. Commun. June, 1977.
H. Zimmermann, “The Cyclades end-to-end protocol,” in Proc. 4th Data Commun. Symp., Quebec, P. Q., Canada, Oct. 1975, pp. 7:21–26.
Schwartz and Stern, “Routing protocols,” this book. Chap. 12.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Plenum Press, New York
About this chapter
Cite this chapter
Gerla, M., Kleinrock, L. (1982). Flow Control Protocols. In: Green, P.E. (eds) Computer Network Architectures and Protocols. Applications of Communications Theory. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6698-4_13
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6698-4_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4615-6700-4
Online ISBN: 978-1-4615-6698-4
eBook Packages: Springer Book Archive