Routing Protocols

  • Mischa Schwartz
  • Thomas E. Stern
Chapter
Part of the Applications of Communications Theory book series (ACTH)

Abstract

In this chapter, we provide an overview of routing techniques used in a variety of computer communication networks in current operation. These include the public data networks tymnetandtranspac (the former is a specialized common carrier network based in the United States, but with connections to Europe as well; the latter is the French government PTT data network), arpanet, the U.S. Department of Defense Computer Network, and the commercial network architectures SNA (Systems Network Architecture) and DNA (Digital Network Architecture), developed by IBM and Digital Equipment Corporation, respectively. The networks are all examples of store-and-forward networks with data packets* moving from a source to a destination, buffered at intermediate nodes along a path. The path is defined simply as the collection of sequential communication links ultimately connecting source to destination.

Keywords

Short Path Data Packet Destination Node Congestion Control Link Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. Schwartz, Computer Communication Network Design and Analysis. Englewood Cliffs, NJ: Prentice-Hall, 1977.MATHGoogle Scholar
  2. [2]
    J. M. McQuillan, G. Falk, and I. Richer, “A review of the development and performance of the ARPAnet routing algorithm,” IEEE Trans. Commun., vol. COM-26, pp. 1802–1811, Dec. 1978.CrossRefGoogle Scholar
  3. [3]
    T. Cegrell, “A routing procedure for the tidas message-switching network,” IEEE Trans. Commun., vol. COM-23, pp. 575–585, June 1975.CrossRefGoogle Scholar
  4. [4]
    F. Poncet and C. S. Repton, “The EIN communications sub-network: Principles and practice,” in Proc. 3rd ICCC, Toronto, Ont., Canada, Aug. 1976, pp. 523–531.Google Scholar
  5. [5]
    J. L. Grangé and M. I. Irland, “Thirty-nine steps to a computer network,” in Proc. 4th ICCC, Kyoto, Japan, Sept. 1978, pp. 763–769.Google Scholar
  6. [6]
    L. Fratta, M. Gerla, and L. Kleinrock, “The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design,” Networks, vol. 3. New York: Wiley, 1973, pp. 97–133.Google Scholar
  7. [7]
    W. Older and D. A. Twyver, personal communication.Google Scholar
  8. [8]
    J. M. McQuillan, “Interactions between routing and congestion control in computer networks,” in Proc. Int. Symp. Plow Contr. in Comput. Networks, Versailles, France, Feb. 1979, J. L. Grangé and M. Gien, Eds., Amsterdam: North-Holland, pp. 63–75.Google Scholar
  9. [9]
    M. Schwartz and C. Cheung, “The gradient projection algorithm for multiple routing in message-switched networks,” IEEE Trans. Commun., vol. COM-24, pp. 449–456, Apr. 1976.CrossRefGoogle Scholar
  10. [10]
    R. Gallager, “An optimal routing algorithm using distributed computation,” IEEE Trans. Commun., vol. COM-25, pp. 73–85, Jan. 1977.MathSciNetCrossRefGoogle Scholar
  11. [11]
    T. E. Stern, “A class of decentralized routing algorithms using relaxation,” IEEE Trans. Commun., vol. COM-25, pp. 1092–1102, Oct. 1977.CrossRefGoogle Scholar
  12. [12]
    E. W. Dijkstra, “A note on two problems in connection with graphs,” Numer. Math., vol. 1, pp. 269–271, 1959.MathSciNetMATHCrossRefGoogle Scholar
  13. [13]
    A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.MATHGoogle Scholar
  14. [14]
    L. R. Ford, Jr. and D. R. Fulkerson, Flows in Networks. Princeton, NJ: Princeton Univ. Press, 1962.MATHGoogle Scholar
  15. [15]
    D. P. Bertsekas, “Dynamic behavior of a shortest path routing algorithm of the ARPAnet type,” presented at the Int. Symp. Inform. Theory, Grigano, Italy, June 1979.Google Scholar
  16. [16]
    A. Rajaraman, “Routing in tymnet,” presented at the European Computing Conf., London, England, May 1978.Google Scholar
  17. [17]
    R. R. Jueneman and G. S. Kerr, “Explicit routing in communications networks,” in Proc. 3rd ICCC, Toronto, Ont., Canada, Aug. 1976, pp. 340–342.Google Scholar
  18. [18]
    D. C. Walden, “Experiences in building, operating, and using the arpa network,” presented at the 2nd USA—Japan Comput. Conf., Tokyo, Japan, Aug. 1975.Google Scholar
  19. 19.
    J. M. McQuillan, “Adaptive routing algorithms for distributed computer networks,” BBN Rep. 2831, May 1974.Google Scholar
  20. [20]
    J. M. McQuillan et al, “The new routing algorithm for the ARPAnet,” IEEE Trans. Commun., vol. COM-28, pp. 711–719, May 1980.CrossRefGoogle Scholar
  21. [21]
    L. Tymes, “tymnet—A terminal oriented communication network,” in 1971 Spring Joint Comput. Conf., AFIPS Conf. Proc., vol. 38, 1971, pp. 211–216.Google Scholar
  22. [22]
    J. Rinde, “Routing and control in a centrally-directed network,” in 1977 Nat. Comput. Conf., A FTPS Conf. Proc., vol. 46, 1977, pp. 603–608.Google Scholar
  23. [23]
    J. Rinde, “tymnet I: An alternative to packet technology,” in Proc. 3rd ICCC, Toronto, Ont., Canada, Aug. 1976, pp. 268–273.Google Scholar
  24. [24]
    A. Danet, R. Despres, A. LaRest, G. Pichon, and S. Ritzenthaler, “The French public packet switching service: The transpac network,” in Proc. 3rd ICCC, Toronto, Ont., Canada, Aug. 1976, pp. 251–260.Google Scholar
  25. [25]
    J. M. Simon and A. Danet, “Contrôle des resources et principes du routage dans le réseau transpac,” in Proc., Int. Symp. Flow Control in Comput. Networks, Versailles, France, Feb. 1979, J. L. Grangé and M. Gien, Eds. Amsterdam: North-Holland, pp. 33–44.Google Scholar
  26. [26]
    J. M. Simon, personal communication.Google Scholar
  27. [27]
    H. Rudin, “On routing and ‘Delta-routing’: A taxonomy and performance comparison of techniques for packet-switched networks,” IEEE Trans. Commun., vol. COM-24, pp. 43–59, Jan. 1976.CrossRefGoogle Scholar
  28. [28]
    R. J. Cypser, Communications Architecture for Distributed Systems. Reading, MA: Addison-Wesley, 1978.Google Scholar
  29. [29]
    P. E. Green, “An introduction to network architectures and protocols,” IBM Syst. J., vol. 18, no. 2, pp. 202–222, 1979.CrossRefGoogle Scholar
  30. [30]
    J. P. Gray and T. B. McNeill, “SNA multiple-system networking,” IBM Syst. J., vol. 18, no. 2, pp. 263–297, 1979.CrossRefGoogle Scholar
  31. [31]
    V. Ahuja, “Routing and flow control in systems network architecture,” IBM Syst. J., vol. 18, no. 2, pp. 298–314, 1979.CrossRefGoogle Scholar
  32. [32]
    W. L. Price, “Data network simulation experiments at the National Physical Laboratory, 1968–1976,” Comput. Networks, vol. 1, no. 4, pp. 199–210, 1977.Google Scholar
  33. [33]
    M. Schwartz, Telecommunications Networks. Reading, MA: Addison-Wesley, 1987.Google Scholar
  34. [34]
    W. D. Tajibnapis, “A correctness proof of a topology information maintenance protocol for distributed computer networks,” Commun. Ass. Comput. Mach., vol. 20, pp. 477–485, July 1977.MathSciNetMATHGoogle Scholar
  35. [35]
    M. Irland, “Buffer management in a packet switch,” IEEE Trans. Commun., vol. COM-26, pp. 328–337, Mar. 1978.CrossRefGoogle Scholar

Copyright information

© Plenum Press, New York 1989

Authors and Affiliations

  • Mischa Schwartz
    • 1
  • Thomas E. Stern
    • 1
  1. 1.Center for Telecommunications ResearchColumbia UniversityNew YorkUSA

Personalised recommendations