MeshTree: Reliable Low Delay Degree-bounded Multicast Overlays

Tan, Su-Wei and Waters, A.G. and Crawford, John (2005) MeshTree: Reliable Low Delay Degree-bounded Multicast Overlays. In: First International Workshop on Distributed, Parallel and Network Applications (DPNA-2005), 20-22 July 2005, Fukuoka, Japan. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)

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.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: Application layer multicast, self-organising, tree building
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Systems Architecture Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:03
Last Modified: 02 Dec 2008 12:07
Resource URI: http://kar.kent.ac.uk/id/eprint/14296 (The current URI for this page, for reference purposes)
  • Depositors only (login required):