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) |
|---|---|
| Title of host publication | Proceedings - IEEE INFOCOM |
| Pages | 396-407 |
| Number of pages | 12 |
| Volume | 1 |
| State | Published - 2004 |
| Externally published | Yes |
| 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 |
Other
| Other | IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies |
|---|---|
| Country | China |
| City | Hongkong |
| Period | 3/7/04 → 3/11/04 |
Fingerprint
Keywords
- Experimentation with real networks/Testbeds
- System design
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Hardware and Architecture
Cite this
Overlay mesh construction using interleaved spanning trees. / Young, Anthony; Chen, Jiang; Ma, Zheng; Krishnamurthy, Arvind; Peterson, Larry Lee; Wang, Randolph Y.
Proceedings - IEEE INFOCOM. Vol. 1 2004. p. 396-407.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Overlay mesh construction using interleaved spanning trees
AU - Young, Anthony
AU - Chen, Jiang
AU - Ma, Zheng
AU - Krishnamurthy, Arvind
AU - Peterson, Larry Lee
AU - Wang, Randolph Y.
PY - 2004
Y1 - 2004
N2 - 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.
AB - 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.
KW - Experimentation with real networks/Testbeds
KW - System design
UR - http://www.scopus.com/inward/record.url?scp=8344275898&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=8344275898&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:8344275898
VL - 1
SP - 396
EP - 407
BT - Proceedings - IEEE INFOCOM
ER -