The Community for Technology Leaders
Green Image
Issue No. 07 - July (2009 vol. 20)
ISSN: 1045-9219
pp: 925-939
Ying Zhu , University of Ontario Institute of Technology, Oshawa
Baochun Li , University of Toronto, Toronto
Ken Qian Pu , University of Ontario Institute of Technology, Oshawa
In a peer-to-peer overlay network, the phenomenon of multiple overlay links sharing bottleneck physical links leads to correlation of overlay link capacities. We are able to more accurately model the overlay by incorporating these linear capacity constraints (LCCs). We formulate the problem of maximizing bandwidth in overlay multicast using our LCC model. We 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 our 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. Furthermore, we develop a fully distributed algorithm for obtaining near-optimal multicast trees, by means of gossip-based algorithms and a restricted but inherently distributed class of LCC (node-based LCC). We demonstrate that the distributed algorithm converges quickly to the centralized optimal and is highly scalable.
Peer-to-peer overlay networks, multicast, algorithms, network protocols.

K. Q. Pu, B. Li and Y. Zhu, "Dynamic Multicast in Overlay Networks with Linear Capacity Constraints," in IEEE Transactions on Parallel & Distributed Systems, vol. 20, no. , pp. 925-939, 2008.
85 ms
(Ver 3.3 (11022016))