Abstract
In this paper we evaluate a method of using inter-leaved spanning trees to compose a resilient, high performance overlay mesh. Though spanning trees of arbitrary type could be used to construct an overlay mesh, we focus on a distributed algorithm that computes k minimum spanning trees on an arbitrary graph. The principal motivation behind this strategy is to provide applications with a k-redundant, high quality mesh suitable for demanding applications like A/V broadcast, video conferencing, data collection, multi-path routing, and file mirroring/transfer. We elaborate details of k-MST, pointing out advantages and potential problem points of the protocol, and then analyze its performance using a variety of metrics with simulation as well as a functional PlanetLab implementation.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 396-407 |
| Number of pages | 12 |
| Journal | Proceedings - IEEE INFOCOM |
| Volume | 1 |
| State | Published - 2004 |
| Event | IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies - Hongkong, China Duration: Mar 7 2004 → Mar 11 2004 |
Keywords
- Experimentation with real networks/Testbeds
- System design
ASJC Scopus subject areas
- Computer Science(all)
- Electrical and Electronic Engineering