Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/sparse-communication-networks-and-efficient-routing-in-the-plane-zeZ0QdNkcS
References (13)
-
I. Althöfer, G. Das, D. Dobkin, D. Joseph, J. Soares (1993)
On sparse spanners of weighted graphsDiscrete & Computational Geometry, 9
-
S. Arya, D. Mount, M. Smid (1994)
Randomized and deterministic algorithms for geometric spanners of small diameterProceedings 35th Annual Symposium on Foundations of Computer Science
-
S. Basagni, I. Chlamtac, V. Syrotiuk, Barry Woodward (1998)
A distance routing effect algorithm for mobility (DREAM) -
D. Peleg (1987)
Distributed Computing: A Locality-Sensitive Approach -
S. Arya, M. Smid (1994)
Efficient Construction of a Bounded Degree Spanner with Low Weight -
P. Fraigniaud, C. Gavoille (1995)
Memory requirement for universal routing schemes -
J. Keil, C. Gutwin (1992)
Classes of graphs which approximate the complete euclidean graphDiscrete & Computational Geometry, 7
-
B. Awerbuch, D. Peleg (1992)
Routing with Polynomial Communication-Space Trade-OffSIAM J. Discret. Math., 5
-
N. Santoro, Ramez Khatib (1985)
Labelling and Implicit Routing in NetworksComput. J., 28
-
S. Arya, G. Das, D. Mount, Jeffrey Salowe, M. Smid (1995)
Euclidean spanners: short, thin, and lanky -
J. Soares (1994)
Approximating Euclidean distances by small degree graphsDiscrete & Computational Geometry, 11
-
D. Dobkin, Steven Friedman, K. Supowit (1987)
Delaunay graphs are almost as good as complete graphsDiscrete & Computational Geometry, 5
-
E. Kranakis, Harvinder Singh, J. Urrutia (1999)
Compass routing on geometric networks
- Publisher
- Springer Journals
- Copyright
- Copyright © 2001 by Springer-Verlag Berlin Heidelberg
- Subject
- Computer Science; Computer Communication Networks; Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Theory of Computation
- ISSN
- 0178-2770
- eISSN
- 1432-0452
- DOI
- 10.1007/s004460100054
- Publisher site
- See Article on Publisher Site
Abstract
Traditional approaches to network design separate the issues of designing the network itself and designing its management and control subsystems. This paper proposes an approach termed routing-oriented network design, which is based on designing the network topology and its routing scheme together, attempting to optimize some of the relevant parameters of both simultaneously. This approach is explored by considering the design of communication networks supporting efficient routing in the special case of points located in the Euclidean plane. The desirable network parameters considered include low degree and small number of communication links. The desirable routing parameters considered include small routing tables, small number of hops and low routing stretch. Two rather different schemes are presented, one based on direct navigation in the plane and the other based on efficient hierarchical tree covers. On a collection of n sites with diameter D, these methods yield networks with a total of $O(n\log D)$ communication links and some bounds on the degree, coupled with routing schemes with constant routing stretch, $O(\log n \log D)$ memory bits per vertex and routes with at most $\log n$ or $\log D$ hops.
Journal
Distributed Computing – Springer Journals
Published: Dec 1, 2001