Overlay mesh construction using interleaved spanning trees

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

Overlay mesh construction using interleaved spanning trees

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

Computer Science

Research output: Contribution to journal › Conference article

48 Scopus citations

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 - Nov 22 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

Access to Document

Fingerprint Dive into the research topics of 'Overlay mesh construction using interleaved spanning trees'. Together they form a unique fingerprint.

Cite this

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

@article{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 Larry Peterson and Wang, {Randolph Y.}",

year = "2004",

month = nov,

day = "22",

language = "English (US)",

volume = "1",

pages = "396--407",

journal = "Proceedings - IEEE INFOCOM",

issn = "0743-166X",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies ; Conference date: 07-03-2004 Through 11-03-2004",

}

TY - JOUR

T1 - Overlay mesh construction using interleaved spanning trees

AU - Young, Anthony

AU - Chen, Jiang

AU - Ma, Zheng

AU - Krishnamurthy, Arvind

AU - Peterson, Larry

AU - Wang, Randolph Y.

PY - 2004/11/22

Y1 - 2004/11/22

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 article

AN - SCOPUS:8344275898

VL - 1

SP - 396

EP - 407

JO - Proceedings - IEEE INFOCOM

JF - Proceedings - IEEE INFOCOM

SN - 0743-166X

T2 - IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies

Y2 - 7 March 2004 through 11 March 2004

ER -