Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
THE LANDMARK HIERARCHY: A NEW HIERARCHY FOR ROUTING IN VERY LARGE NETWORKS
 

Summary: THE LANDMARK HIERARCHY: A NEW HIERARCHY
FOR ROUTING IN VERY LARGE NETWORKS
Paul F. Tsuchiya
tsuchiya@gateway.mitre.org
The MITRE Corporation
Abstract
Landmark Routing is a setof 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 androuting table sizessimilar to thosefound
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 comparesit with
the areahierarchy.
1. INTRODUCTION

  

Source: Akella, Aditya - Department of Computer Sciences, University of Wisconsin at Madison
Estrin, Deborah - Computer Science Department, University of California at Los Angeles
Francis, Paul - Max-Planck-Institut für Softwaresysteme
Gao, Jie - Department of Computer Science, SUNY at Stony Brook

 

Collections: Computer Technologies and Information Sciences