Overlay mesh construction using interleaved spanning trees

Anthony Young, Jiang Chen, Zheng Ma, Arvind Krishnamurthy, Larry Lee Peterson, Randolph Y. Wang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

48 Citations (Scopus)

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 languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages396-407
Number of pages12
Volume1
StatePublished - 2004
Externally publishedYes
EventIEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies - Hongkong, China
Duration: Mar 7 2004Mar 11 2004

Other

OtherIEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
CountryChina
CityHongkong
Period3/7/043/11/04

Fingerprint

Video conferencing
Parallel algorithms
Network protocols

Keywords

  • Experimentation with real networks/Testbeds
  • System design

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Young, A., Chen, J., Ma, Z., Krishnamurthy, A., Peterson, L. L., & Wang, R. Y. (2004). Overlay mesh construction using interleaved spanning trees. In Proceedings - IEEE INFOCOM (Vol. 1, pp. 396-407)

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 proceedingConference contribution

Young, A, Chen, J, Ma, Z, Krishnamurthy, A, Peterson, LL & Wang, RY 2004, Overlay mesh construction using interleaved spanning trees. in Proceedings - IEEE INFOCOM. vol. 1, pp. 396-407, IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies, Hongkong, China, 3/7/04.
Young A, Chen J, Ma Z, Krishnamurthy A, Peterson LL, Wang RY. Overlay mesh construction using interleaved spanning trees. In Proceedings - IEEE INFOCOM. Vol. 1. 2004. p. 396-407
Young, Anthony ; Chen, Jiang ; Ma, Zheng ; Krishnamurthy, Arvind ; Peterson, Larry Lee ; Wang, Randolph Y. / Overlay mesh construction using interleaved spanning trees. Proceedings - IEEE INFOCOM. Vol. 1 2004. pp. 396-407
@inproceedings{74944da72eb148fdaddc33a57f71a121,
title = "Overlay mesh construction using interleaved spanning trees",
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.",
keywords = "Experimentation with real networks/Testbeds, System design",
author = "Anthony Young and Jiang Chen and Zheng Ma and Arvind Krishnamurthy and Peterson, {Larry Lee} and Wang, {Randolph Y.}",
year = "2004",
language = "English (US)",
volume = "1",
pages = "396--407",
booktitle = "Proceedings - IEEE INFOCOM",

}

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 -