Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Efficient Implementations of a Delay-Constrained Least-Cost Multicast Algorithm

  • Feng, Gang (Department of Electrical Engineering at University of Wisconsin) ;
  • Makki, Kia (Telecommunications & Information Technology Institute, Florida International University) ;
  • Pissinou, Niki (Telecommunications & Information Technology Institute, Florida International University)
  • Published : 2002.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with quality of service (QoS) support. Bounded shortest path algorithm (BSMA) has been recognized as one of the best algorithms for the CMST problem due to its excellent cost performance. This algorithm starts with a minimumdelay tree, and then iteratively uses a -shortest-path (KSP) algorithm to search for a better path to replace a “superedge” in the existing tree, and consequently reduces the cost of the tree. The major drawback of BSMA is its high time complexity because of the use of the KSP algorithm. For this reason, we investigate in this paper the possibility of more efficient implementations of BSMA by using different methods to locate the target path for replacing a superedge. Our experimental results indicate that our methods can significantly reduce the time complexity of BSMA without deteriorating the cost performance.

Keywords

References

  1. S. Chen and K. Nahrstedt, 'An overview of quality of service routing for next-generation high-speed networks: Problems and solutions,' IEEE Network, pp.64-79, Nov./Dec. 1998
  2. K. Makki, N. Pissinou, and 0. Frieder, 'Efficient solutions to multicast routing in communication networks,' Mobile networks and Applications, vol.1,pp.221-232, 1996 https://doi.org/10.1007/BF01193338
  3. H. F. Salama, D. S. Reeves, and Y. Viniotis, 'Evaluation of multicast routing algorithms for real-time communication on high-speed networks,' IEEE J. Select. Areas Commun., vol. 15, no. 3, pp. 332-345, Apr. 1997 https://doi.org/10.1109/49.564132
  4. Q. Zhu, M. Parsa, and J. J. Garcia-Luna-Aceves, 'A source-based algohthm for delay-constrained minimum-cost multicasting,' IEEE INFOCOM'95, vol. 1, 1995, pp. 377-385
  5. M. Parsa, Q. Zhu, and J. J. Garcia-Luna-Aceves, 'An iterative algorithm for delay-constrained minimum-cost multicasting,' IEEE/ACM Trans Networking, vol. 6, no. 4, pp. 461-474, 1998 https://doi.org/10.1109/90.720901
  6. J. Moy, 'OSPF version 2, 'Stands track RFC 2328, IETF, Apr. 1998
  7. X. Jia. 'A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks,' IEEE/ACM Trans. Networking, vol. 6, no. 6, pp. 828-837, Aug. 1998 https://doi.org/10.1109/90.748092
  8. C. Hedric, 'Routing information protocol,' RFC 1058, 1988
  9. Internetworking Technology Handbook, Cisco online documentation, available at http://www.cisco.com/univercd/cc/td/doc /cisintwk/ito-doc/index.htm
  10. M. R. Garey and D. S. Johnson, Computers and intractability, a guide to the theory of NP-completeness, Freeman, San Francisco, 1979
  11. L. Kyou, G. Markowsky, and L, Berman, 'A fast algorithm for Steiner trees,' Acta Info., vol. 15, no. 2, pp. 141-145, 1981 https://doi.org/10.1007/BF00288961
  12. M. Faloutsos, A. Banerjea, and R. Pankaj, 'QoSMIC: Quality of service sensitive multicast internet protocol,' SIGCOMM '98, Sept. 1998, pp. 144-153 https://doi.org/10.1145/285237.285276
  13. I. Matta and L. Guo, 'QDMR: An efficient QoS dependent multicast routing algorithm,' J. Commun. Networks, vol. 2, no. 2, 2000
  14. E. L. Lawler, Combinatorial optimization: networks and matroids, Holt, Rinehart and Winston. 1976
  15. G. Feng and C. Doulgeris, 'Fast algorithms for delay-constrained least cost unicast routing,' shortened version presented on INFORMS'2001, Miami Beach, Nov.2001, available at http://www.students.miami.edu/-gfeng/
  16. A. Julttner et al., 'Lagrange relaxation based method for the QoS routing problem,' INFOCOM'2001, Alaska, 2001
  17. R. Widyono, 'The design and evaluation of routing algorithms for realtime channels,' Tech. Rep. ICSI TR-94-024, University of California at Berkley, international Computer Science institute, June 1994
  18. E. Dijkstra, 'A note on two problems in connexion with graphs,' Numerische Mathematik, vol. 1, pp. 269-271, 1959 https://doi.org/10.1007/BF01386390
  19. T. Korkmaz and M. Krunz, 'MuIti-constrained optimal path selection,' INFOCOM'-200l, Alaska, 2001
  20. D. Eppstein, 'Finding the k shortest paths,' SIAM J. Computing, vol. 28, no. 2, pp.652-673, 1998 https://doi.org/10.1137/S0097539795290477
  21. G. Fens: et al., 'Heuristic and exact algorithms for QoS routing with multiple constraints,' IEICE Trans. Communications, accepted for publication, available at http://www.students.miami.edu/-gteng/
  22. G. Feng et al. ' Performance evaluation of delay-constrained least-cost QoS routing algorithms based on linear and nonlinear Lagrange relaxation.' ICC'02. vol. 4. New York, 2002, pp. 2273-2278
  23. V. Kompella, J. C. Pasquale, and G. Polyxos, 'Multicast routing for multimedia communication,' IEEE/ACM Trans. Networking, vol. 1, no. 3. pp.286-292, 1993 https://doi.org/10.1109/90.234851
  24. S. P. Hong. H. Lee. and B. H. Park. 'An efficient multicast routing algorithrn for delay-sensitive applications with dynamic membership.' INFOC0M'9X. 1998, pp. 1433-1440
  25. D. Blokh and G. Gutin. 'An approximate algorithm for combinatorial optimization problems with two parameters,' IMADA preprint pp-1995-14(Department of Mathematics and Computer Science, Univ. of Southern Denmark), 1995
  26. R. Hassin, 'Approximation scheme for the restricted shortest path problem,' Mathematics of Operation Research. 17(1): 36-42. Feb. 1992 https://doi.org/10.1287/moor.17.1.36
  27. E. W. Zegura, K. Calven, and S. Bhattacharjee, 'How to model an internetwork', Infocom'96, Mar. 1996, pp. 594-602
  28. B. M. Waxman, 'Routing of multipoint connections,' IEEE J. Select. Areas Commun., 6(9): 1617-1622, Dec. 1988 https://doi.org/10.1109/49.12889