Proof of optimal algorithm for maximum-bandwidth ALM tree construction

We construct an ALM (application layer multicast) tree that achieves the maximum bandwidth by using underlay traffic information. Since this problem was previously shown to be NP-hard, no polynomial-time algorithms for maximum-bandwidth ALM tree construction exist. In our work, we assume that the underlay network has a tree network topology, and we show a polynomial-time algorithm that constructs a maximum-bandwidth ALM tree on such a tree network topology. We propose an ALM tree construction algorithm that achieves bandwidth b and apply this algorithm with various bandwidth values b. We show that it can make a maximum-bandwidth ALM tree in polynomial time.

[1]  Klara Nahrstedt,et al.  Maxmin overlay multicast: rate allocation and tree construction , 2004, Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004..

[2]  Reuven Cohen,et al.  A unicast-based approach for streaming multicast , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  Ram Ramanathan.  An algorithm for multicast tree generation in networks with asymmetric links , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[4]  Yajun Wang,et al.  Network Topology Inference Based on End-to-End Measurements , 2006, IEEE Journal on Selected Areas in Communications.

[5]  Yajun Wang,et al.  On Maximizing Tree Bandwidth for Topology-Aware Peer-to-Peer Streaming , 2007, IEEE Transactions on Multimedia.

[6]  Kirk L. Johnson,et al.  Overcast: reliable multicasting with on overlay network , 2000, OSDI.

[7]  Miki Yamamoto,et al.  Construction of a robust multicast tree for application-level multicast , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.