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

LandmarkHierarchyComputer scienceRouting (electronic design automation)Routing tableComputer networkUrban hierarchyDistributed computingTheoretical computer scienceRouting protocolArtificial intelligencePopulation

Affiliated Institutions

Related Publications

Publication Info

Year
1988
Type
article
Pages
35-42
Citations
325
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

325
OpenAlex

Cite This

Paul F. Tsuchiya (1988). The landmark hierarchy: a new hierarchy for routing in very large networks. , 35-42. https://doi.org/10.1145/52324.52329

Identifiers

DOI
10.1145/52324.52329