Multicast routing with end-to-end delay and delay variation constraints Export

@article{citeulike:2568545, abstract = {We study the problem or constructing multicast trees to meet the quality of service requirements of real-time interactive applications operating in high-speed packet-switched environments. In particular, we assume that multicast communication depends on: (1) bounded delay along the paths from the source to each destination and (2) bounded variation among the delays along these paths. We first establish that the problem of determining such a constrained tree is NP-complete. We then present a heuristic that demonstrates good average case behavior in terms of the maximum interdestination delay variation. The heuristic achieves its best performance under conditions typical of multicast scenarios in high speed networks. We also show that it is possible to dynamically reorganize the initial tree in response to changes in the destination set, in a way that is minimally disruptive to the multicast session}, author = {Rouskas, G. N. and Baldine, I.}, booktitle = {Selected Areas in Communications, IEEE Journal on}, citeulike-article-id = {2568545}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/49.564133}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=564133}, doi = {10.1109/49.564133}, journal = {Selected Areas in Communications, IEEE Journal on}, keywords = {multicast}, number = {3}, pages = {346--356}, posted-at = {2008-03-21 03:01:35}, priority = {3}, title = {Multicast routing with end-to-end delay and delay variation constraints}, url = {http://dx.doi.org/10.1109/49.564133}, volume = {15}, year = {1997} }

TY - JOUR ID - citeulike:2568545 L3 - citeulike-article-id:2568545 N2 - We study the problem or constructing multicast trees to meet the quality of service requirements of real-time interactive applications operating in high-speed packet-switched environments. In particular, we assume that multicast communication depends on: (1) bounded delay along the paths from the source to each destination and (2) bounded variation among the delays along these paths. We first establish that the problem of determining such a constrained tree is NP-complete. We then present a heuristic that demonstrates good average case behavior in terms of the maximum interdestination delay variation. The heuristic achieves its best performance under conditions typical of multicast scenarios in high speed networks. We also show that it is possible to dynamically reorganize the initial tree in response to changes in the destination set, in a way that is minimally disruptive to the multicast session IS - 3 JF - Selected Areas in Communications, IEEE Journal on EP - 356 TI - Multicast routing with end-to-end delay and delay variation constraints VL - 15 T2 - Selected Areas in Communications, IEEE Journal on SP - 346 KW - multicast AU - Rouskas, GN AU - Baldine, I PY - 1997/// UR - http://dx.doi.org/10.1109/49.564133 ER -