This Article 
 Bibliographic References 
 Add to: 
On the Hardness of Approximating the Multicast Delay Variation Problem
November 2007 (vol. 56 no. 11)
pp. 1575-1577
Given a network with one source and multiple destinations, the multicast delay variation problem attempts to construct a multicast tree such that the inter-destination delay variation among all the paths from the source to each destination is minimized. In this paper, we show that the problem is NP-hard and that it is not approximable within a constant factor in polynomial time unless NP = P. These findings indicate that it is impossible to develop efficient optimal or approximation algorithms for any multicast routing problem under the inter-destination delay variation constraint unless NP = P.

[1] M. Charikar, J. Naor, and B. Schieber, “Resource Optimization in QoS Multicast Routing of Real-Time Multimedia,” IEEE/ACM Trans. Networking, vol. 12, no. 2, pp. 340-348, Apr. 2004.
[2] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Company, 1979.
[3] A. Goel, K.G. Ramakrishnan, D. Kataria, and D. Logothetis, “Efficient Computation of Delay-Sensitive Routes from One Source to All Destinations,” Proc. IEEE INFOCOM '01, pp. 854-858, Apr. 2001.
[4] Approximation Algorithms for NP-Hard Problems, D.S. Hochbaum, ed. PWS Publishing Company, 1997.
[5] E. Horowitz, S. Sahni, and S. Rajasekaran, Computer Algorithms/C++. W.H. Freeman & Company, 1997.
[6] J. Huang, Z. Yang, X. Du, and W. Cheng, “Available Bandwidth-Based Real-Time Multicast Routing with Constraints of Delay and Delay Variation,” Proc. 10th Int'l Conf. Telecomm. (ICT '03), pp. 476-481, Feb. 2003.
[7] M. Kim, Y.-C. Bang, and H. Choo, “Efficient Algorithm for Reducing Delay Variation on Bounded Multicast Trees,” Proc. Int'l Conf. Information Networking (ICOIN '04), pp. 440-450, Feb. 2004.
[8] Z. Kun, W. Heng, and L. Feng-Yu, “An Efficient Algorithm Based on Simulated Annealing for Multicast Routing with Delay and Delay Variation Constraints,” Proc. 19th Int'l Conf. Advanced Information Networking and Applications (AINA '05), vol. 1, pp. 261-266, Mar. 2005.
[9] Z. Kun, W. Heng, and L. Feng-Yu, “Distributed Multicast Routing for Delay and Delay Variation-Bounded Steiner Tree Using Simulated Annealing,” Computer Comm., vol. 28, no. 11, pp. 1356-1370, July 2005.
[10] D.H. Lorenz, A. Orda, D. Raz, and Y. Shavitt, “Efficient QoS Partition and Routing of Unicast and Multicast,” Proc. Eighth Int'l Workshop Quality of Service (IWQoS '00), pp. 75-83, June 2000.
[11] C.P. Low and Y.J. Lee, “Distributed Multicast Routing, with End-to-End Delay and Delay Variation Constraints,” Computer Comm., vol. 23, no. 9, pp.848-862, Apr. 2000.
[12] D. Raz and Y. Shavitt, “Optimal Partition of QoS Requirements with Discrete Cost Functions,” Proc. IEEE INFOCOM '00, pp. 613-622, Mar. 2000.
[13] G.N. Rouskas and I. Baldine, “Multicast Routing with End-to-End Delay and Delay Variation Constraints,” IEEE J. Selected Areas in Comm., vol. 15, no. 3, pp. 346-356, Apr. 1997.
[14] H.-Y. Tyan, J.C. Hou, and B. Wang, “Many-to-Many Multicast Routing with Temporal Quality of Service Guarantees,” IEEE Trans. Computers, vol. 52, no. 6, pp. 826-832, June 2003.
[15] Z. Wang and J. Crowcroft, “Quality-of-Service Routing for Supporting Multimedia Applications,” IEEE J. Selected Areas in Comm., vol. 14, no. 7, pp.1228-1234, Sept. 1996.
[16] B. Wang and J.C. Hou, “Multicast Routing and Its QoS Extension: Problems, Algorithms, and Protocols,” IEEE Network, vol. 14, no. 1, pp.22-36, Jan./Feb. 2000.
[17] G. Xue, “Minimum-Cost QoS Multicast and Unicast Routing in Communication Networks,” IEEE Trans. Comm., vol. 51, no. 5, pp. 817-824, May 2003.

Index Terms:
Inapproximability, inter-destination delay variation, multicast routing, NP-complete, NP-hard
Pi-Rong Sheu, Shan-Tai Chen, "On the Hardness of Approximating the Multicast Delay Variation Problem," IEEE Transactions on Computers, vol. 56, no. 11, pp. 1575-1577, Nov. 2007, doi:10.1109/TC.2007.1046
Usage of this product signifies your acceptance of the Terms of Use.