• DocumentCode
    759580
  • Title

    Routing Techniques Used in Computer Communication Networks

  • Author

    Schwartz, Mischa ; Stern, Thomas E.

  • Author_Institution
    Dept. of Electr. Eng. and Computer Science, Columbia Univ., New York, NY, USA
  • Volume
    28
  • Issue
    4
  • fYear
    1980
  • fDate
    4/1/1980 12:00:00 AM
  • Firstpage
    539
  • Lastpage
    552
  • Abstract
    An overview is provided in this paper of the routing procedures used in a number of operating networks, as well as in two commercial network architectures. The networks include TYMNET, ARPANET, and TRANSPAC. The network architectures discussed are the IBM SNA and the DEC DNA. The routing algorithms all tend to fall in the shortest path class. In the introductory sections, routing procedures in general are discussed, with specialization to shortest path algorithms. Two shortest path algorithms, one appropriate for centralized computation, the other for distributed computation, are described. These algorithms, in somewhat modified form, provide the basis for the algorithms actually used in the networks discussed.
  • Keywords
    Computer communications; ARPANET; Communication networks; Computer networks; Costs; DNA; Delay effects; Delay estimation; Distributed computing; Routing; Telecommunication traffic;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOM.1980.1094690
  • Filename
    1094690