Genetic algorithm for delay- and degree-constrained multimedia broadcasting on overlay networks

Computer Communications

Volumn 29, Issue 17, 2006, Pages 3625-3632

  Tseng, Sheng Yuan ^a   Huang, Yueh Min ^a   Lin, Chang Chun ^b  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

^b KUN SHAN UNIVERSITY   (Taiwan)

Author keywords

Degree and delay constraints; Genetic algorithm; Multimedia broadcasting; Peer to peer network; QoS

Indexed keywords

BROADCASTING; COMPUTER SIMULATION; CONSTRAINT THEORY; GENETIC ALGORITHMS; INTERNET; QUALITY OF SERVICE; REAL TIME SYSTEMS; TELECOMMUNICATION NETWORKS; VIDEO CONFERENCING;

BROADCASTING PROBLEM; DEGREE AND DELAY CONSTRAINTS; MULTIMEDIA BROADCASTING; PEER-TO-PEER NETWORK;

MULTIMEDIA SYSTEMS;

EID: 33750304763     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2006.06.003     Document Type: Article

References (30)

1. Ding J.W., Tseng S.Y., and Huang Y.M. Packet permutation: a robust transmission scheme for continuous media streams over the Internet. Multimedia Tools and Applications 21 3 (2003) 281-305
2. Moy J. Multicast Routing Extensions for OSPF. Communications of the ACM 37 8 (1994) 61-67
3. D. Waitzman, C. Partridge, S.E. Deering, Distance Vector Multicast Routing Protocol, IETF RFC 1075, 1988.
4. A.J. Ballardie, P.F. Francis, J. Crowcroft, Core based trees, in: Proceedings of the ACM SIGCOMM, 1992.
5. Diot C., Levine B.N., Lyles B., Kassem H., and Balensiefen D. Deployment issues for the IP multicast service and architecture. IEEE Networks 14 1 (2000) 78-88
6. Y. Chawathe, Scattercast: An architecture for Internet broadcast distribution as an infrastructure service, Ph.D. thesis, University of California, Berkeley, CA, USA, 2000.
7. Y. Chu, S. Rao, H. Zhang, Enabling conferencing applications on the Internet using an overlay multicast architecture, in: Proceedings of the ACM SIGCOMM, San Diego, CA, USA, 2001, pp. 55-67.
8. J. Jannotti, D.K. Gifford, K.L. Johnson, Overcast: Reliable multicasting with an overlay networks, in: Proceedings of the Forth Symposium on Operating Systems Design and Implementation, San Diego, CA, USA, 2000.
9. Zhou G., and Gen M. Genetic algorithms on leaf-constrained minimum spanning tree problem. Beijing Mathematics 7 2 (1998) 50-62
10. Julstrom B.A. Codings and operators in two genetic algorithms for the leaf-constrained minimum spanning tree problem. International Journal of Applied Mathematics and Computer Science 14 3 (2004) 385-396
11. G.R. Raidl, B.A. Julstrom, Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem, in: Proceedings of the 2003 ACM Symposium on Applied Computing, Melbourne, FL, USA, 2003, pp. 747-752.
12. Narula S.C., and Ho C.A. Degree-constrained minimum spanning trees. Computers and Operations Research 7 (1980) 239-249
13. Zhou G., and Gen M. Approach to degree-constrained minimum spanning tree problem using genetic algorithm. Engineering Design & Automation 3 2 (1997) 157-165
14. Knowles J., and Come D. A new evolutionary approach to the degree-constrained minimum spanning tree problem. IEEE Transactions on Evolutionary Computation 4 (2000) 125-134
15. Y. Liu, J. Wu, A genetic algorithm for the degree-constrained multicasting problem, in: Proceedings of the Fifth IEEE International Conference on High Speed Networks and Multimedia Communications, Jeju Island, Korea, 2002, pp. 315-319.
16. Y. Feng, Z. Yu, Y. Pan, Heuristic genetic algorithm for degree-constrained multicast routing problem, in: Proceedings of 2004 International Conference on Machine Learning and Cybernetics, Shanghai, China, 2004, pp. 2448-2452.
17. H.F. Salama, D.S. Reeves, Y. Viniotis, The delay-constrained minimum spanning tree problem, in: Proceedings of the Second IEEE Symposium on Computers and Communications, Alexandria, Egypt, 1997, pp. 699-703.
18. Sriram R., Manimaran G., Murthy C., and Siva R. Algorithms for delay-constrained low-cost multicast tree construction. Computer Communications 21 18 (1998) 1693-1706
19. Parsa M., Zhu Q., and Garcia-Luna-Aceves J.J. An iterative algorithm for delay-constrained minimum-cost multicasting. IEEE/ACM Transactions on Networking 6 4 (1998) 461-474
20. Tawfig A., and Taieb Z. Delay-constrained, low-cost multicast routing in multimedia networks. Journal of Parallel and Distributed Computing 61 9 (2001) 1307-1336
21. Hać A., and Zhou K. A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay. International Journal of Network Management 9 4 (1999) 265-278
22. Wang Z., Shi B., and Zhao E. Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm. Computer Communications 24 (2001) 685-692
23. L. Chen, Z. Yang, Z. Xu, A degree-delay-constrained genetic algorithm for multicast routing tree, in: Proceedings of the Fourth International Conference on Computer and Information Technology, 2004, pp. 1033-1038.
24. Prüfer H. Neuer beweis eines stazes über permutation. Archiv für Mathematik und Physik 27 (1918) 742-744
25. Y. Li, An effective implementation of a direct spanning tree representation in GAs, in: Proceedings of the EvoWorkshops on Applications of Evolutionary Computing, 2003, pp. 11-19.
26. Zhang Q., and Lenug Y.W. An orthogonal genetic algorithm for multimedia multicast routing. IEEE Transactions on Evolutionary Computation 3 1 (1999) 53-62
27. C.C. Palmer, An approach to a problem in network design using genetic algorithms, Ph.D. Dissertation in Computer Science, Polytechnic University, April 1994.
28. Prim R. Shortest connection networks and some generalizations. Bell System Technical Journal 36 (1957) 1389-1401
29. Kompella V.P., Pasquale J.C., and Polyzos G.C. Multicast routing for multimedia communication. IEEE/ACM Transactions on Networking 1 3 (1993) 286-292
30. Waxman B.M. Routing of multipoint connections. IEEE Journal on Selected Area on Communications 6 9 (1988) 1617-1622