The landmark hierarchy: A new hierarchy for routing en very large networks

Symposium Proceedings on Communications Architectures and Protocols, SIGCOMM 1988

Volumn , Issue , 1988, Pages 35-42

  Tsuchiya, Paul F ^a  

^a MITRE CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET PROTOCOLS; NETWORK ARCHITECTURE;

COMMUNICATIONS NETWORKS; DYNAMIC NETWORK; LANDMARK ROUTING; LARGE NETWORKS; ON THE FLIES; PATH LENGTH; ROUTING TABLE;

NETWORK ROUTING;

EID: 84947308909     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/52324.52329     Document Type: Conference Paper

References (20)

1. Callon, R. and Lauer, G. (June 1985), "Hierarchical Routing for Packet Radio Networks," Report No. 5945, SRNTN No. 31, Cambridge, MA: BBN Laboratories Incorporated.
2. Cegrell, T. (June 1975), "A Routing Procedure for the Tidas Message-Switching Network," IEEE Trans, on Communications, Vol. COM-23, No. 6, pp. 575-585.
3. Garcia-Luna-Aceves, J. J. (1987), "A New Minimum-Hop Routing Algorithm," Proceedings IEEE Infocom '87, pp. 170-180.
4. Hagouel, J. (1983), "Issues in Routing for Large and Dynamic Networks," PhD. Thesis, Columbia University.
5. Jaffe, J. M. and Moss, F. H. (July 1982), "A Responsive Distributed Routing Algorithm for Computer Networks," IEEE Trans, on Communications, COM-30, No. 7, pp. 1758-1762.
6. Khanna, A. and Seeger, J. (January 1986), "Large Network Routing Study. Design Document," Report No. 6119, Cambridge, MA: BBN Communications Corporation.
7. Kleinrock, L. and Kamoun, F. (1977), "Hierarchical Routing for Large Networks: Performance Evaluation and Optimization," Computer Networks, Vol. 1, pp. 155-174.
8. Kleinrock, L. and Kamoun F. (November 1979), "Stochastic Performance Evaluation of Hierarchical Routing for Large Networks," Computer Networks, Vol. 3, No. 5, pp. 387-353.
9. Kleinrock, L. and Kamoun, F. (1980), "Optimal Clustering Structures for Hierarchical Topological Design of Large Computer Networks," Computer Networks, Vol. 10, No. 3, pp. 221-248.
10. McQuillan, J. M., Richer, I., Rosen, E. C. (April 1978) "ARPANET Routing Algorithm Improvements First Semiannual Technical Report," Bolt Beranek and Newman Inc., Report No. 3803.
11. Mullander, S. J. and Vitanyi, P. M. B. (August 1985), "Distributed Matchmaking for Processes in Computer Networks," Proceedings Fourth Conference on Principles of Distributed Computing, Minaki, Ontario.
12. Perlman, R. (1985), "Hierarchical Networks and the Subnetwork Partition Problem," Computer Networks and ISDN Systems 9, North-Holland, pp. 297-303.
13. Shacham, N. (November 1985), "Hierarchical Routing in Large, Dynamic Ground Radio Networks," Menlo Park, CA: SRI International.
14. Sparta Incorporated, (April 1986), "Design and Analysis for Area Routing in Large Networks," McLean, VA: Sparta Incorporated.
15. Stine, R. H. Jr. and Tsuchiya, P. F. (March 1987), "Assured Destination Binding: A Technique for Dynamic Address Binding," MTR-87W00050, McLean, VA: The MITRE Corporation.
16. Sunshine, C. (April 1981), "Addressing Problems in Multi-network Systems," Internet Engineering Note (IEN) 178.
17. Tajibnapis, W. D. (July 1977), "A Correctness Proof of a Topology Information Maintenance Protocol for Distributed Computer Networks," Communications of the ACM, Vol. 20, No. 7, pp. 477-485.
18. Tsuchiya, P. F. (June 1987a), "The Landmark Hierarchy: Description and Analysis," MTR-87W00152, McLean, VA: The MITRE Corporation.
19. Tsuchiya, P. F. (September 1987b), "Landmark Routing: Architecture, Algorithms, and Issues," MTR-87W00174, McLean, VA: The MITRE Corporation.
20. Westcott J. and Lauer, G. (1984), "Hierarchical Routing for Very Large Networks," Cambridge, MA: Bolt Beranek and Newman Incorporated.