MeshTree: Reliable low delay degree-bounded multicast overlays

Su Wei Tan; Gill Waters; John Crawford

doi:10.1109/ICPADS.2005.183

MeshTree: Reliable low delay degree-bounded multicast overlays

Su Wei Tan, Gill Waters, John Crawford

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

5 Citations (Scopus)

Abstract

We study decentralised low delay degree-constrained overlay multicast tree construction for single source real-time applications. This optimisation problem is NP-hard even if computed centrally. We identify two problems in traditional distributed solutions, namely the greedy problem and delay-cost trade-off. By offering solutions to these problems, we propose a new self-organising distributed tree building protocol called MeshTree. The main idea is to embed the delivery tree in a degree-bounded mesh containing many low cost links. Our simulation results show that MeshTree is comparable to the centralised Compact Tree algorithm, and always outperforms existing distributed solutions in delay optimisation. In addition, it generally yields trees with lower cost and traffic redundancy.

Original language	English
Title of host publication	Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005
Editors	J. Ma, L.T. Yang
Pages	565-569
Number of pages	5
DOIs	https://doi.org/10.1109/ICPADS.2005.183
Publication status	Published - 2005
Externally published	Yes
Event	International Workshop on Distributed, Parallel and Network Applications 2005 - Fukuoka, Japan Duration: 20 Jul 2005 → 22 Jul 2005 Conference number: 1st https://ieeexplore.ieee.org/xpl/conhome/10248/proceeding (Proceedings)

Publication series

Name	Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
Volume	2
ISSN (Print)	1521-9097

Workshop

Workshop	International Workshop on Distributed, Parallel and Network Applications 2005
Abbreviated title	DPNA 2005
Country/Territory	Japan
City	Fukuoka
Period	20/07/05 → 22/07/05
Internet address	https://ieeexplore.ieee.org/xpl/conhome/10248/proceeding (Proceedings)

Access to Document

10.1109/ICPADS.2005.183

Cite this

Tan, S. W., Waters, G., & Crawford, J. (2005). MeshTree: Reliable low delay degree-bounded multicast overlays. In J. Ma, & L. T. Yang (Eds.), Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005 (pp. 565-569). (Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS; Vol. 2). https://doi.org/10.1109/ICPADS.2005.183

@inproceedings{176c6240d4c541c4adbc7a0a0e7b49ef,

title = "MeshTree: Reliable low delay degree-bounded multicast overlays",

abstract = "We study decentralised low delay degree-constrained overlay multicast tree construction for single source real-time applications. This optimisation problem is NP-hard even if computed centrally. We identify two problems in traditional distributed solutions, namely the greedy problem and delay-cost trade-off. By offering solutions to these problems, we propose a new self-organising distributed tree building protocol called MeshTree. The main idea is to embed the delivery tree in a degree-bounded mesh containing many low cost links. Our simulation results show that MeshTree is comparable to the centralised Compact Tree algorithm, and always outperforms existing distributed solutions in delay optimisation. In addition, it generally yields trees with lower cost and traffic redundancy.",

author = "Tan, {Su Wei} and Gill Waters and John Crawford",

year = "2005",

doi = "10.1109/ICPADS.2005.183",

language = "English",

isbn = "0769522815",

series = "Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS",

pages = "565--569",

editor = "J. Ma and L.T. Yang",

booktitle = "Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005",

note = "International Workshop on Distributed, Parallel and Network Applications 2005, DPNA 2005 ; Conference date: 20-07-2005 Through 22-07-2005",

url = "https://ieeexplore.ieee.org/xpl/conhome/10248/proceeding",

}

Tan, SW, Waters, G & Crawford, J 2005, MeshTree: Reliable low delay degree-bounded multicast overlays. in J Ma & LT Yang (eds), Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005. Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS, vol. 2, pp. 565-569, International Workshop on Distributed, Parallel and Network Applications 2005, Fukuoka, Japan, 20/07/05. https://doi.org/10.1109/ICPADS.2005.183

MeshTree: Reliable low delay degree-bounded multicast overlays. / Tan, Su Wei; Waters, Gill; Crawford, John.
Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005. ed. / J. Ma; L.T. Yang. 2005. p. 565-569 (Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - MeshTree

T2 - International Workshop on Distributed, Parallel and Network Applications 2005

AU - Tan, Su Wei

AU - Waters, Gill

AU - Crawford, John

N1 - Conference code: 1st

PY - 2005

Y1 - 2005

N2 - We study decentralised low delay degree-constrained overlay multicast tree construction for single source real-time applications. This optimisation problem is NP-hard even if computed centrally. We identify two problems in traditional distributed solutions, namely the greedy problem and delay-cost trade-off. By offering solutions to these problems, we propose a new self-organising distributed tree building protocol called MeshTree. The main idea is to embed the delivery tree in a degree-bounded mesh containing many low cost links. Our simulation results show that MeshTree is comparable to the centralised Compact Tree algorithm, and always outperforms existing distributed solutions in delay optimisation. In addition, it generally yields trees with lower cost and traffic redundancy.

AB - We study decentralised low delay degree-constrained overlay multicast tree construction for single source real-time applications. This optimisation problem is NP-hard even if computed centrally. We identify two problems in traditional distributed solutions, namely the greedy problem and delay-cost trade-off. By offering solutions to these problems, we propose a new self-organising distributed tree building protocol called MeshTree. The main idea is to embed the delivery tree in a degree-bounded mesh containing many low cost links. Our simulation results show that MeshTree is comparable to the centralised Compact Tree algorithm, and always outperforms existing distributed solutions in delay optimisation. In addition, it generally yields trees with lower cost and traffic redundancy.

UR - http://www.scopus.com/inward/record.url?scp=23944516306&partnerID=8YFLogxK

U2 - 10.1109/ICPADS.2005.183

DO - 10.1109/ICPADS.2005.183

M3 - Conference Paper

AN - SCOPUS:23944516306

SN - 0769522815

T3 - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

SP - 565

EP - 569

BT - Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005

A2 - Ma, J.

A2 - Yang, L.T.

Y2 - 20 July 2005 through 22 July 2005

ER -

MeshTree: Reliable low delay degree-bounded multicast overlays

Abstract

Publication series

Workshop

Access to Document

Other files and links

Cite this