Dynamic Multicast in Overlay Networks With Linear Capacity Constraints

Download Now Free registration required

Executive Summary

In a peer-to-peer overlay network, the phenomenon of multiple overlay links sharing bottleneck physical links leads to correlation of overlay link capacities. The authors are able to more accurately model the overlay by incorporating these Linear Capacity Constraints (LCC). They formulate the problem of maximizing bandwidth in overlay multicast using the LCC model. They show that finding a maximum-bandwidth multicast tree in an overlay network with LCC is NP-complete. Therefore, an efficient heuristics algorithm is designed to solve the problem. Extensive simulations show that the algorithm is able to construct multicast trees that are optimal or extremely close to optimal, with significantly higher bandwidth than trees formed in overlays with no LCC.

  • Format: PDF
  • Size: 584.8 KB