Skip to main content

MeshTree: A Delay optimised Overlay Multicast Tree Building Protocol

Tan, Su-Wei and Waters, A. Gill and Crawford, John (2005) MeshTree: A Delay optimised Overlay Multicast Tree Building Protocol. Technical report. IEEE Computer Society, Washington, DC, USA, University of Kent


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 always yields trees with lower cost and traffic redundancy.

Item Type: Monograph (Technical report)
Uncontrolled keywords: Application layer multicast, self-organising, tree building
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Systems Architecture Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:03 UTC
Last Modified: 28 May 2019 13:51 UTC
Resource URI: (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year