Constructing Low-Latency Overlay Networks: Tree vs. Mesh Algorithms

Free registration required

Executive Summary

Distributed interactive applications may have stringent latency requirements and dynamic user groups. These applications may benefit from a group communication system, and to improve the system support for such applications, the authors investigate graph algorithms that construct low-latency overlay networks for application-layer multicast. In particular, they focus on reducing the diameter and the pair-wise latencies in the overlay. The overlay construction time is also considered, as it is often time-dependent in their dynamic target applications. Here, they have implemented and experimentally analyzed spanning-tree heuristics and mesh construction heuristics, and compared their performance and applicability to distributed interactive applications. They found that trees are faster to construct and save considerable amounts of resources in the network.

  • Format: PDF
  • Size: 225.31 KB