Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29644

Select areas to restrict search in scientific publication database:
An Efficient Algorithm for Delay Delay-variation Bounded Least Cost Multicast Routing
Many multimedia communication applications require a source to transmit messages to multiple destinations subject to quality of service (QoS) delay constraint. To support delay constrained multicast communications, computer networks need to guarantee an upper bound end-to-end delay from the source node to each of the destination nodes. This is known as multicast delay problem. On the other hand, if the same message fails to arrive at each destination node at the same time, there may arise inconsistency and unfairness problem among users. This is related to multicast delayvariation problem. The problem to find a minimum cost multicast tree with delay and delay-variation constraints has been proven to be NP-Complete. In this paper, we propose an efficient heuristic algorithm, namely, Economic Delay and Delay-Variation Bounded Multicast (EDVBM) algorithm, based on a novel heuristic function, to construct an economic delay and delay-variation bounded multicast tree. A noteworthy feature of this algorithm is that it has very high probability of finding the optimal solution in polynomial time with low computational complexity.
Digital Object Identifier (DOI):


[1] D. Kosiur, IP Multicasting: The Complete Guide to Interactive Corporate Networks, Wiley, New York,1998.
[2] Z. Kun, W. Heng, L. Feng-Yu, Distributed Multicast Routing for delay delay variation-bounded Steiner tree using Simulated Annealing, Computer Communications, 28, 2005, pp. 1356-1370.
[3] M. R .Kabat, S. K. Mohanty, R. Mall, C. R. Tripathy, An Efficient Heuristic Multicast QoS-Routing Algorithm for Real-Time Applications, International Journal on Information Processing, 1(1), 2007, pp. 22-29.
[4] Z.F. Jia, P. Varaiya, Heuristic methods for delay constrained least cost routing using k-shortest paths, INFOCOM 2001.
[5] V.P. Kompella, J.C.Pasquale, G.C.Polyzos, Multicast routing for multimedia communication. IEEE/ACM Transaction on Networking, 1(3), 1993, pp. 286-292.
[6] Q. Zhu, M. Parsa, J. Garcia, A source-based algorithm for delayconstrained minimum cost multicasting, Proceedings of IEEE INFOCOM, 95, 1995, pp. 353-360.
[7] R. Widyono, The design and evaluation of routing algorithm for realtime channels. Tech report icsi tr-94-024, University of Calfornia at Berkeley, International Computer Science Institute, June1994.
[8] H.Youssef, A. Al-Mulhem, S.M.Sait, M.A. Tahir, QoS-driven multicast tree generation using Tabu search, Computer Communication, 25, 2002, pp. 1140-1149.
[9] H.F. Salama, D.S. Reeves, Y. Viniotis, Evaluation of multicast routing algorithms for real-time communication on high-speed networks, IEEE Journal on Selected Areas in Communications, 15(3), 1997, pp. 332-345.
[10] E.W. Dijkstra, A note on two problems in connection with graphs, Numer. Math., I, 1959, 269-271.
[11] S.Rampal, D Reeves, An evaluation of routing and admission control algorithms for multimedia traffic. Computer communication, 18(10), 1995, pp. 755-768.
[12] G.N.Rouskas, I. Baldine, Multicast routing with end-to-end delay and delay variation constraints, IEEE J. Selected Areas Communication, 15(3), 1997, pp. 346-356.
[13] P.R.Sheu, S.T.Chen, On the hardness of approximating the delay variation constraint multicast trees, Proceedings of the 1999 National Computer Symposium, Taipci, Taiwan, ROC, pp. A351-A358.
[14] S.T.Chen, A Study on multicast routing with delay variation constraints, Master Thesis, Department of Electrical Engg. National Yunlin University of Science & Technology, Taiwan, ROC, June 1998.
[15] P.R.Sheu, S.T.Chen, A Fast and Efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem, Computer Communication, 25, 2002, pp. 825-833.
[16] C. P. Low, Y.J. Lee, Distributed Multicast Routing with end-to-end delay and delay variation constraints, Computer Communication, 23 (9), 2000, pp. 848-862.
[17] T. Pusateri, Distance Vector Routing Protocol, draft-etf-idmr-dvmrp-v3- 07, 1998.
Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007