skip to main content
research-article
Free Access

An architecture for routing in the ISO connectionless internet

Published:01 October 1985Publication History
Skip Abstract Section

Abstract

The ISO Connectionless Internet Protocol provides a uniform network service over many types of subnetworks. The protocol has currently progressed to the status of draft international standard (DIS 8473). Ideally, the Internet protocol allows for a high degree of connectivity in a global packet-switched network. However, much work needs to be done in the area of routing before this becomes possible in practice.

References

  1. Kleinrock, L. and Kamoun, F., "Hierarchical Routing for Large Networks; Performance Evaluation and Optimization", Computer Networks, Vol. 1, 1977, pp. 155--174 (20 pgs.)Google ScholarGoogle Scholar
  2. Kleinrock, L. and F. Kamoun, F., "Stochastic Performance Evaluation of Hierarchical Routing for Large Networks", Computer Networks, Vol. 3, 1979, pp. 337--353 (17 pgs.)Google ScholarGoogle Scholar
  3. Kleinrock, L. and Kamoun, F., "Optimal Clustering Structures for Hierarchical Topological Design of Large Computer Networks", Networks, Vol. 10, 1980, pp. 221--248 (28 pgs.)Google ScholarGoogle ScholarCross RefCross Ref
  4. McQuillan, John, et. al. "A Review of the Development and Performance of the ARPANET Routing Algorithm", IEEE Transactions on Communications, Vol. COM-26, No. 12, Dec. 1978, pp. 1802--1810 (9 pgs.)Google ScholarGoogle Scholar
  5. McQuillan, John, et. al. "The New Routing Algorithm for the ARPANET", IEEE Transactions on Communications, Vol. COM-28, No. 5, May 1980, pp. 711--719 (9 pgs.)Google ScholarGoogle Scholar
  6. Rosen, Eric C., "The Updating Protocol of ARPANET's New Routing Algorithm", Computer Networks, Vol. 4, 1980, pp. 11--19 (9 pgs.)Google ScholarGoogle Scholar
  7. Tajibnapis, W. D., "A Correctness Proof of a Topology Information Maintenance Protocol for Distributed Computer Networks", Communications of the ACM, Vol. 20, No. 7, July 1977, pp. 477--485 (9 pgs.) Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Merlin, Philip M. and Segall, Adrian, "A Failsafe Distributed Routing Protocol", IEEE Transactions on Communications, Vol. Com-27, No. 9, Sept. 1979, pp. 1280--1287 (8 pgs.)Google ScholarGoogle Scholar
  9. Segall, Adrian, "Advances in Verifiable Fail-Safe Routing Procedures", IEEE Transactions on Communications, Vol. COM-29, No. 4, April 1981, pp. 491--497 (7 pgs.)Google ScholarGoogle Scholar
  10. Jaffe, Jeffrey M. and Moss, Franklin H., "A Responsive Distributed Routing Algorithm for Computer Networks", IEEE Transactions on Communications, Vol. COM-30, No. 7, July 1982, pp. 1758--1762 (5 pgs.)Google ScholarGoogle Scholar
  11. Dijkstra, E. W., "A Note on Two Problems in Connexion with Graphs", Numerische Mathematik 1, 269--271, (1959) pp. 269--271 (3 pgs.)Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Bellman, Richard, "On a Routing Problem", Quarterly of Applied Mathematics, No. 16, 1958, pp. 87--90 (4 pgs.)Google ScholarGoogle Scholar
  13. Friedman, Daniel Uri, "Communications Complexity of Distributed Shortest Path Algorithms", MIT M.S.E.E. Thesis, 1979 (98 pgs.)Google ScholarGoogle Scholar
  14. Golden, Bruce, "Shortest-Path Algorithms: A Comparison", Operations Research, Vol. 24, No. 6, November--December, 1976, pp. 1164--1168 (5 pgs.)Google ScholarGoogle Scholar
  15. Pape, U., "Implementation and Efficiency of Moore-Algorithms for the Shortest Route Problem", Mathematical Programming, Vol. 7, 1974, pp. 212--222 (11 pgs.)Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Johnson, Donald B., "Efficient Algorithms for Shortest Paths in Sparse Networks", Journal of the ACM, Vol. 24, No. 1, January 1977, pp. 1--13 (13 pgs.) Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. ISO/DP8348/DAD2 "Addendum to the Network Service Definition Covering Network Layer Addressing"Google ScholarGoogle Scholar
  18. ISO/DP8473 "Protocol for Providing the Connectionless Network Service"Google ScholarGoogle Scholar

Index Terms

  1. An architecture for routing in the ISO connectionless internet
      Index terms have been assigned to the content through auto-classification.

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM SIGCOMM Computer Communication Review
        ACM SIGCOMM Computer Communication Review  Volume 15, Issue 5
        October/November 1985
        83 pages
        ISSN:0146-4833
        DOI:10.1145/1570499
        Issue’s Table of Contents

        Copyright © 1985 Author

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 October 1985

        Check for updates

        Qualifiers

        • research-article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader