Abstract
Overlay networks play an important role in group communication applications in Internet. These applications require better efficiency in terms of delay, cost and load balancing. This paper presents an artificial immune system (AIS)-based hybrid genetic algorithm for the construction of Quality of Service (QoS) multicast tree among multicast service nodes in overlay network which optimizes path delivery, load-balancing variance and cost under bounded delay–degree constraint. This paper proposes an alternative AIS-based approach to handle the constraints instead of penalty function in overlay multicast routing problem. The clonal selection method of AIS is incorporated into the genetic algorithm (GA) to improve the diversity–convergence relationship which leads to optimized results. Proposed algorithm has the following features: (1) embedded problem specific local search function along with random point crossover to fine tune the search; (2) AIS principle is used to solve the constraints in GA; (3) clonal selection method to get the optimized results. Adaptable procedure is embedded into algorithm to handle the end user join/end user drop. Non-parametric statistical analysis has performed to show the significant difference among the proposed and existing algorithms. Simulation results reveal that our proposed algorithm produces better results in terms of cost, average path length, user rejection rate and convergence. Statistical analysis is also performed to assure the significance of the differences among the tested algorithms.
Similar content being viewed by others
References
Ada GL, Nossal G (1987) The clonal selection theory. Sci Am 257(2):50–57
Back T, Fogel DB, Michalewicz Z (1997) Handbook of Evolutionary Computation. Institute of Physics Publishing and Oxford University Press
Bui NT, Moon BR (1996) Genetic algorithm and graph partitioning. IEEE Trans Comput 45(7):841–855
Chawathe Y (2000) Scattercast: an architecture for internet broadcast distribution as an infrastructure service. PhD thesis, University of California Berkeley
Chu Y, Rao SG, Seshan S, Zhang H (2002) A case for end system multicast. IEEE J Selected Areas Commun 20(8):1456–1471
Coello CAC (2002) Theoretical and Numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191(11–12):1245–1287
Coello CAC, Cruz-Cortés N (2004) Hybridizing a genetic algorithm with an artificial immune system for global optimization. Eng Optim 36(5):607–634
Dasgupta D (2006) Advances in artificial immune system. IEEE Comput Intell Mag 1(4):40–49
Davis L (1991) Handbook of genetic algorithms, chap 6 & 7. Van Nostrand Reinhold Publication, New York
De Castro LN, Von Zuben FJ (2002) Learning and optimization using the clonal selection principle. IEEE Trans Evol Comput 6(3):239–251
Farmer JD, Packard NH, Perelson AS (1986) The immune system, adaptation, and machine learning. Phys D 2(1–3):187–204
Forest S, Hofmeyr S, Somayaji A (1997) Computer immunology. Commun ACM 40(10):88–96
Francis P (2000) Yoid: extending the internet multicast architecture. White paper, http://www.icir.org/yoid/docs/index.html
Garcia S, Fernadez A, Luengo J, Herrera F (2009) A study of statistical techniques and performance measures for genetics based machine learning: accuracy and interpretability. Soft Comput Fusion Found Methodol Appl 13(10):959–977
Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley, New York
Haghighat AT, Faez K, Dehghan M, Mowlaei A, Ghahremani Y (2004) GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing. Comput Commun 27(1):111–127
Hajela P, Lee J (1996) Constrained genetic search via schema adaptation: an immune network solution. Struct Multidiscipl Optim 12(1):11–15
Hwang R-H, Do W-Y, Yang S-C (2000) Multicast routing based on genetic algorithms. J Inform Sci Eng 16(4):885–901
Jog P, Suh JY, Gucht DV (1989) The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem. In: Proceedings of third international conference on genetic algorithms, pp 110–115
Lao L, Cui J-H, Gerla M, Maggiorini D (2005) A comparative study of multicast protocols: top, bottom, or in the middle. INFOCOM’05 4:2809–2814
Lao L, Cui J-H, Gerla M, Chen S (2007) A scalable overlay multicast architecture for large-scale applications. IEEE Trans Parallel Distrib Syst 18(4):449–459
Lua EK, Crowcroft J, Pias M, Sharma R, Lim S (2005) A survey and comparison of peer-to-peer overlay network schemes. IEEE Commun Surv Tutor 7(2):72–93
Minseok K, Sonia F (2005) Path-aware overlay multicast. Comput Netw 47(1):23–45
Özgűr Y (2005) Penalty function methods for constrained optimization with genetic algorithms. Math Comput Appl 10(1):45–56
Pan Y, Zhenwei YU, Wang L (2003) A genetic algorithm for the overlay multicast routing problem. In: International conference on computer networks and mobile computing (ICCNMC’03), pp 261–265
Pan Y, Zhenwei YU, Wang L (2005) Hybrid Genetic algorithm for solving the degree-constrained minimal bandwidth multicast routing problem. In: International conference on computational intelligence and security (CIS (1)), pp 285–290
Peng C, Dai QH, Wu QF (2007) An overlay multicast routing algorithm based on genetic algorithm. Chin J Electron 16(1):161–165
Richardson JT, Palmer MR, Liepins GE, Hilliard M (1989) Some guidelines for genetic algorithms with penalty functions. In: Third international conference on genetic algorithms, pp 191–197
Sheskin DJ (2006) Handbook of parametric and nonparametric statistical procedures, vol 1736. Chapman & Hall/CRC, London/West Palm Beach
Shi S, Turner JS (2002a) Issues in overlay multicast networks: dynamic routing and communication cost. Technical Report WUCS-0214, Washington University in St. Louis
Shi S, Turner JS (2002b) Multicast routing and bandwidth dimensioning in overlay networks. IEEE J Selected Areas Commun 20(8):1444–1455
Shimamoto N, Hiramatsu A, Yamasaki K (1993) A dynamic routing control based on a genetic algorithm. IEEE Int Conf Neural Netw 2:1123–1128
Stoica L, Morris R, Liben-Nowell D, Karger DR, Kaashoek MF, Dabek F, Balakrishnan H (2003) Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE Trans Netw 11(1):17–32
Tsai CF, Tsai CW, Chen CP (2004) A novel algorithm for multimedia multicast routing in a large scale networks. J Syst Softw 72(3):431–441
Tseng SY, Huang YM, Lin C-C (2006) Genetic algorithm for delay- and degree-constrained multimedia broadcasting on Overlay networks. Comput Commun 29(17):3625–3632
Vijayalakshmi K, Radhakrishnan S (2005) Dynamic Routing from one to group of nodes using elitism based GA—novel multi-parameter approach. In: IEEE international conference on emerging trends in electrical and information technology (INDICON), pp 265–269
Vijayalakshmi K, Radhakrishnan S (2008) Dynamic routing to multiple destinations in ip networks using hybrid genetic algorithm. Int J Inform Technol 4(1):45–52
Zhang B, Jamin S, Zhang L (2002) Host multicast: a framework for delivering multicast to end users. INFOCOM’02 3, pp 1366–1375
Zhao Y-H, An Y-Y, Wang D-D, Wang C-R, Yang J-X, Gao Y (2005) A genetic algorithm in layered overlay multicast network. Int Conf Mach Learn Cybernet 5:3036–3041
Zhi L, Prasant M (2004) QRON: QoS-aware routing in overlay networks. IEEE J Selected Areas Commun (JSAC) 22(1):29–40
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Vijayalakshmi, K., Radhakrishnan, S. A novel hybrid immune-based GA for dynamic routing to multiple destinations for overlay networks. Soft Comput 14, 1227–1239 (2010). https://doi.org/10.1007/s00500-009-0534-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-009-0534-x