Skip to main content
Article thumbnail
Location of Repository

Constructing Efficient Self-Organising Application Layer Multicast Overlays

By Su-Wei Tan

Abstract

This thesis investigates efficient techniques to build both low cost (i.e. low resource usage) and low\ud delay ALM trees. We focus on self-organising distributed proposals that use limited information about\ud the underlying physical network, limited coordination between the members, and construct overlays with\ud bounded branching degree subject to the bandwidth constraint of each individual member

Topics: QA76
OAI identifier: oai:kar.kent.ac.uk:24024

Suggested articles

Citations

  1. (1994). A comparison of multicast trees and algorithms.
  2. (2004). A proactive approach to reconstructing overlay multicast trees.
  3. (2002). AMRoute: Adhoc multicast routing protocol.
  4. (2002). An evaluation of shared multicast trees with multiple cores.
  5. (2001). Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination.
  6. (2002). Host multicast: A framework for delivering multicast to end users.
  7. (2004). Improving the performance of overlay with dynamic adaptation.
  8. (2002). Overlay optimizations for end-host multicast.
  9. (1996). Quality of service routing for supporting multimedia applications.
  10. (1988). Routing of multipoint connections.
  11. (2001). Tapestry: An infrastructure for fault-tolerant wide-area location and routing.
  12. (2002). Universal IP multicast delivery.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.