Spanners and message distribution in networks

Authors:
Arthur M. Farley;Andrzej Proskurowski;Daniel Zappala;Kurt Windisch
Affiliations:
Computer and Information Science Department, University of Oregon, Eugene, OR;Computer and Information Science Department, University of Oregon, Eugene, OR;Computer and Information Science Department, University of Oregon, Eugene, OR;Computer and Information Science Department, University of Oregon, Eugene, OR and Advanced Network Technology Center, Computing Center, University of Oregon, Eugene, OR
Venue:
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Year:
2004

Citing 7
Cited 11

Steiner problem in networks: a survey

Networks
An optimal synchronizer for the hypercube

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
NP-completeness of minimum spanner problems

Discrete Applied Mathematics
An architecture for wide-area multicast routing

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Tree Spanners

SIAM Journal on Discrete Mathematics
An Approximation Algorithm for Minimum-Cost Network Design

An Approximation Algorithm for Minimum-Cost Network Design
Mechanisms for broadcast and selective broadcast

Mechanisms for broadcast and selective broadcast

Finding the best shortcut in a geometric network

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Sparse geometric graphs with small dilation

Computational Geometry: Theory and Applications
On the locality of distributed sparse spanner construction

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Fault-tolerant spanners for general graphs

Proceedings of the forty-first annual ACM symposium on Theory of computing
Experimental study of geometric t-spanners

Journal of Experimental Algorithmics (JEA)
Fault Tolerant Spanners for General Graphs

SIAM Journal on Computing
Experimental study of geometric t-spanners

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Sparse geometric graphs with small dilation

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Improved distance oracles and spanners for vertex-labeled graphs

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Fault tolerant additive spanners

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Multipath spanners via fault-tolerant spanners

MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the applicability of spanners as substructures that offer both low cost and low delay for broadcast and multicast. A k-spanner has the potential to offer lower delay than shared multicast trees because it limits the distance between any two nodes in the network to a multiplicative factor k of the shortest-path distance. Using simulation over random topologies, we compare k-spanners to single-source minimum-distance spanning trees and show that a k-spanner can have similar cost and lower delay. We illustrate that by varying the value of k a spanner can be made to gradually favor cost over delay. These results indicate the spanner can reduce the cost of flooding, which is a basic mechanism used in multicast routing protocols.