The landmark hierarchy: a new hierarchy for routing in very large networks
- 1 August 1988
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 18 (4), 35-42
- https://doi.org/10.1145/52324.52329
Abstract
Landmark Routing is a set of algorithms for routing in communications networks of arbitrary size. Landmark Routing is based on a new type of hierarchy, the Landmark Hierarchy. The Landmark Hierarchy exhibits path lengths and routing table sizes similar to those found in the traditional area or cluster hierarchy. The Landmark Hierarchy, however, is easier to dynamically configure using a distributed algorithm. It can therefore be used as the basis for algorithms that dynamically configure the hierarchy on the fly, thus allowing for very large, dynamic networks. This paper describes the Landmark Hierarchy, analyzes it, and compares it with the area hierarchy.Keywords
This publication has 6 references indexed in Scilit:
- Hierarchical networks and the subnetwork partition problemComputer Networks and ISDN Systems, 1985
- Distributed match-making for processes in computer networks (preliminary version)Published by Association for Computing Machinery (ACM) ,1985
- A Responsive Distributed Routing Algorithm for Computer NetworksIEEE Transactions on Communications, 1982
- ARPANET Routing Algorithm ImprovementsPublished by Defense Technical Information Center (DTIC) ,1978
- A correctness proof of a topology information maintenance protocol for a distributed computer networkCommunications of the ACM, 1977
- A Routing Procedure for the TIDAS Message-Switching NetworkIEEE Transactions on Communications, 1975