Maxmin overlay multicast: rate allocation and tree construction

@inproceedings{iwqos04-cui-maxmin, abstract = {Although initially proposed as the deployable alternative to IP multicast, overlay multicast actually offers us great flexibilities on QoS-aware resource allocation for network applications. For example, in overlay multicast streaming, (1) the streaming rate of each client can be diversified to better accommodate network heterogeneity, through various end-to-end streaming adaptation techniques; and (2) one can freely organize the overlay session by rearranging the multicast tree, for the purpose of better resource utilization and fairness among all clients. The goal of this paper, is to find the max-min rate allocation in overlay multicast, which is pareto-optimal in terms of network resource utilization, and max-min fair. We approach this goal in two steps. First, we present a distributed algorithm, which is able to return the max-min rate allocation for any given overlay multicast tree. Second, we study the problem of finding the optimal tree, whose max-min rate allocation is optimal among all trees. After proving its NP-hardness, we propose a heuristic algorithm of overlay multicast tree construction. A variation of the heuristic is also designed to handle the dynamic client join/departure. Both of them have approximation bound of 1/2 to the optimal value. Experimental results show that they achieve high average throughput, almost saturate link utilization, and consistent min-favorability.}, author = {Cui, Yi and Xue, Y. and Nahrstedt, K. }, citeulike-article-id = {760353}, journal = {Quality of Service, 2004. IWQOS 2004. Twelfth IEEE International Workshop on}, keywords = {multicast, overlay}, pages = {221--231}, posted-at = {2006-07-15 22:10:18}, priority = {2}, title = {Maxmin overlay multicast: rate allocation and tree construction}, url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1309385}, year = {2004} }

TY - CONF ID - iwqos04-cui-maxmin L3 - citeulike-article-id:760353 TI - Maxmin overlay multicast: rate allocation and tree construction JF - Quality of Service, 2004. IWQOS 2004. Twelfth IEEE International Workshop on SP - 221 EP - 231 N2 - Although initially proposed as the deployable alternative to IP multicast, overlay multicast actually offers us great flexibilities on QoS-aware resource allocation for network applications. For example, in overlay multicast streaming, (1) the streaming rate of each client can be diversified to better accommodate network heterogeneity, through various end-to-end streaming adaptation techniques; and (2) one can freely organize the overlay session by rearranging the multicast tree, for the purpose of better resource utilization and fairness among all clients. The goal of this paper, is to find the max-min rate allocation in overlay multicast, which is pareto-optimal in terms of network resource utilization, and max-min fair. We approach this goal in two steps. First, we present a distributed algorithm, which is able to return the max-min rate allocation for any given overlay multicast tree. Second, we study the problem of finding the optimal tree, whose max-min rate allocation is optimal among all trees. After proving its NP-hardness, we propose a heuristic algorithm of overlay multicast tree construction. A variation of the heuristic is also designed to handle the dynamic client join/departure. Both of them have approximation bound of 1/2 to the optimal value. Experimental results show that they achieve high average throughput, almost saturate link utilization, and consistent min-favorability. KW - multicast KW - overlay AU - Cui, Yi AU - Xue, Y AU - Nahrstedt, K PY - 2004/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1309385 ER -