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 (KAR id:14340)
PDF
Language: English |
|
Download this file (PDF/105kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader |
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 always yields trees with lower cost and traffic redundancy.
Item Type: | Reports and Papers (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: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Mark Wheadon |
Date Deposited: | 24 Nov 2008 18:03 UTC |
Last Modified: | 16 Nov 2021 09:52 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/14340 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):