Article

Free access

The landmark hierarchy: a new hierarchy for routing in very large networks

Author:

P. F. TsuchiyaAuthors Info & Claims

SIGCOMM '88: Symposium proceedings on Communications architectures and protocols

Pages 35 - 42

https://doi.org/10.1145/52324.52329

Published: 01 August 1988 Publication History

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.

References

[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," IEE Trans. on Communications, VoL COM-23, No. 6, pp. 575-585.

[3]

Gaxcia-Luna-Aceves, J. I. (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," Phl). Thesis, Columbia University.

Digital Library

[5]

Jaffe, J. M. aad:Moss, F;H~(Yuly 1982), "A Responsive Distributed RoutingAIgoritlim for Computer Networks," 1EEE Trans. on Communications, COM-30, No. 7, pp. 1758-1762.

[6]

Khanna, A. and S0eger, $. (January 1986), "Large Network Routing Study. Design Documem," 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 Rouiing 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.

Digital Library

[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]

$tine, 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," Intemet Engineering Note (raN) ~78.

[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.

Digital Library

[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 I. and Lauer, G. (1984), "Hierarchical Routing for Very Large Networks," Cambridge, MA: Bolt Beranek and Newman Incorporated.

Cited By

Ababneh MKolachala KVishwanathan RQuek TGao DZhou JCardenas A(2024)Auroch: Auction-Based Multipath Routing for Payment Channel NetworksProceedings of the 19th ACM Asia Conference on Computer and Communications Security10.1145/3634737.3657021(1861-1877)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1145/3634737.3657021
Zhang YYang D(2021) RobustPay + : Robust Payment Routing With Approximation Guarantee in Blockchain-Based Payment Channel Networks IEEE/ACM Transactions on Networking10.1109/TNET.2021.306972529:4(1676-1686)Online publication date: Aug-2021
https://doi.org/10.1109/TNET.2021.3069725
Varma SMaguluri S(2021)Throughput Optimal Routing in Blockchain-Based Payment SystemsIEEE Transactions on Control of Network Systems10.1109/TCNS.2021.30887998:4(1859-1868)Online publication date: Dec-2021
https://doi.org/10.1109/TCNS.2021.3088799
Show More Cited By

Index Terms

The landmark hierarchy: a new hierarchy for routing in very large networks

Recommendations

The landmark hierarchy: a new hierarchy for routing in very large networks

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 ...
Design hierarchy-guided multilevel circuit partitioning

In this paper, we present a new multilevel circuit partitioning algorithm (dhml) which is guided by design hierarchy. In addition to flat netlist hypergraph, we use user design hierarchy as a hint for partitioning. This design hierarchy already has some ...
The landmark hierarchy: A new hierarchy for routing in very large networks
Innovations in Internetworking

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '88: Symposium proceedings on Communications architectures and protocols

August 1988

339 pages

ISBN:0897912799

DOI:10.1145/52324

Editor:
Vinton Cerf
Corporation for National Research Initiatives, Washington, DC

ACM SIGCOMM Computer Communication Review Volume 18, Issue 4
August 1988
338 pages
ISSN:0146-4833
DOI:10.1145/52325
Editor:
J. C. Burruss
Bolt Beranek & Newman Inc., Cambridge, MA
Issue’s Table of Contents

Copyright © 1988 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1988

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGCOMM88

Sponsor:

SIGCOMM
SRI Intl

SIGCOMM88: Communication Architecture and Protocols

August 16 - 18, 1988

California, Stanford, USA

Acceptance Rates

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

236
Total Citations
View Citations
2,829
Total Downloads

Downloads (Last 12 months)186
Downloads (Last 6 weeks)41

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ababneh MKolachala KVishwanathan RQuek TGao DZhou JCardenas A(2024)Auroch: Auction-Based Multipath Routing for Payment Channel NetworksProceedings of the 19th ACM Asia Conference on Computer and Communications Security10.1145/3634737.3657021(1861-1877)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1145/3634737.3657021
Zhang YYang D(2021) RobustPay + : Robust Payment Routing With Approximation Guarantee in Blockchain-Based Payment Channel Networks IEEE/ACM Transactions on Networking10.1109/TNET.2021.306972529:4(1676-1686)Online publication date: Aug-2021
https://doi.org/10.1109/TNET.2021.3069725
Varma SMaguluri S(2021)Throughput Optimal Routing in Blockchain-Based Payment SystemsIEEE Transactions on Control of Network Systems10.1109/TCNS.2021.30887998:4(1859-1868)Online publication date: Dec-2021
https://doi.org/10.1109/TCNS.2021.3088799
Panwar GMisra SVishwanathan RAhn GThuraisingham BKantarcioglu MKrishnan R(2019)BlAnCProceedings of the Ninth ACM Conference on Data and Application Security and Privacy10.1145/3292006.3300034(339-350)Online publication date: 13-Mar-2019
https://dl.acm.org/doi/10.1145/3292006.3300034
Zhang YYang DXue G(2019)CheaPay: An Optimal Algorithm for Fee Minimization in Blockchain-Based Payment Channel NetworksICC 2019 - 2019 IEEE International Conference on Communications (ICC)10.1109/ICC.2019.8761804(1-6)Online publication date: May-2019
https://doi.org/10.1109/ICC.2019.8761804
Zhang LZheng WShi LZhu X(2019)RecEvent: Multiple Features Hybrid Event Recommendation in Social NetworksICC 2019 - 2019 IEEE International Conference on Communications (ICC)10.1109/ICC.2019.8761649(1-6)Online publication date: May-2019
https://doi.org/10.1109/ICC.2019.8761649
Avramovic I(2019)Routing Sets and Hint-Based Routing10.1007/978-3-030-12385-7_43(586-602)Online publication date: 2-Feb-2019
https://doi.org/10.1007/978-3-030-12385-7_43
Sivaraman VVenkatakrishnan SAlizadeh MFanti GViswanath P(2018)Routing Cryptocurrency with the Spider NetworkProceedings of the 17th ACM Workshop on Hot Topics in Networks10.1145/3286062.3286067(29-35)Online publication date: 15-Nov-2018
https://dl.acm.org/doi/10.1145/3286062.3286067
Sobrinho JVanbever LLe FSousa ARexford J(2016)Scaling the Internet Routing System Through Distributed Route AggregationIEEE/ACM Transactions on Networking10.1109/TNET.2016.252784224:6(3462-3476)Online publication date: 1-Dec-2016
https://dl.acm.org/doi/10.1109/TNET.2016.2527842
Tan GYin ZJiang H(2016)Trap arrayIEEE/ACM Transactions on Networking10.1109/TNET.2014.236294324:1(328-341)Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1109/TNET.2014.2362943
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents