Genetic Algorithm-Based QoS Multicast Routing for Uncertainty in Network Parameters

  • Layuan Li
  • Chunlin Li
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2642)


This paper discusses the multicast routing problem with multiple QoS constraints in networks with uncertain parameters, and describes a network model that is suitable to research such QoS multicast routing problem. The paper mainly presents GAQMR, a multicast routing policy for Internet, mobile network or other high-performance networks, that is based on the genetic algorithm, and can provide QoS sensitive paths in a scalable and flexible way, in the networks environment with uncertain parameters. The GAQMR can also optimize the network resources such as bandwidth and delay, and can converge to the optimal or near-optimal solution within few iterations, even for the networks environment with uncertain parameters. The incremental rate of computational cost can close to polynomial and is less than exponential rate. The performance measures of the GAQMR are evaluated using simulations. The results shows that GAQMR provides an available approach to QoS Multicast routing for uncertainty in network parameters.


QoS multicast routing genetic algorithm uncertainty network parameters 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Bin Wang and Jennifer C. Hou, “Multicast routing and its QoS extension: Problems, algorithms, and protocols,” IEEE Network, Jan/Feb, 2000. pp. 22–36.Google Scholar
  2. [2]
    Roch A. Guerin and Ariel Orda. “QoS routing in networks with inaccurate information: Theory and algorithms,” IEEE/ACM. Trans. On Networking, No. 3, Vol. 7. June. 1999. pp. 350–363.CrossRefGoogle Scholar
  3. [3]
    Li Layuan and Li Chunlin, Computer Networking, National Defense Industry Press, Beijing, 2001.Google Scholar
  4. [4]
    Moses Charikar, Joseph Naor and Baruch Schieber, Resource optimization in QoS multicast routing of real-time multimedia, Proc of IEEE INFOCOM. 2000. pp. 1518–1527.Google Scholar
  5. [5]
    Li Layuan and Li Chunlin, “The QoS routing algorithm for ATM networks”, Computer Communications, NO. 3–4, Vol. 24, 2001, pp. 416–421.CrossRefGoogle Scholar
  6. [6]
    Li Layuan. “A formal specification technique for communication protocol”. Proc of IEEE INFOCOM, April. 1989, pp. 74–81.Google Scholar
  7. [7]
    X. Jia. “A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks”, IEEE/ACM Transactions on Networking, No. 6, Vol. 6, Dec. 1998, pp. 828–837.CrossRefGoogle Scholar
  8. [8]
    Li Layuan and Li Chunlin, “The QoS-based routing algorithms for high-speed networks” Proc of WCC, Aug. 2000, pp. 623–1628.Google Scholar
  9. [9]
    Li Layuan and Li Chunlin, “A multicast routing protocol with multiple QoS constraints.” Proc of WCC, Aug. 2002.Google Scholar
  10. [10]
    Zhang Q, Lenug Y W, “An orthogonal genetic algorithm for multimedia multicast routing.” IEEE Trans Evolutionary Computation, 1999, 3(1): 53–62.CrossRefGoogle Scholar
  11. [11]
    F. Xiang, L. Junzhou. W. Jieyi and G. Guanqun. “QoS routing based on genetic algorithm”, Computer Communications, 22(1999), pp. 1392–1399.CrossRefGoogle Scholar
  12. [12]
    Dean H. Lorenz and Ariel Orda. “QoS routing in networks with uncertain parameters” IEEE/ACM Transactions on Networking. Vol. 6, No. 6, DEC. 1998, pp. 768–778.CrossRefGoogle Scholar
  13. [13]
    Li Layuan and Li Chunlin, “A routing protocol for dynamic and large computer networks with clustering topology,” Computer Communication, No. 2, Vol. 23, 2000, pp. 171–176.CrossRefGoogle Scholar
  14. [14]
    D. G. Thaler and C. V. Ravishankar, “Distributed center location algorithms,” IEEE JSAC, Vol. 15, April 1997, pp. 291–303.Google Scholar
  15. [15]
    I. Cidon, R. Rom, and Y. Shavitt, “Multi-path routing combined with resource resetvation,” Proc of IEEE INFOCOM, April 1997, pp. 92–100.Google Scholar
  16. [16]
    J. Mog. “Multicast routing exeensions to OSPF.” RFC 1584. March. 1994.Google Scholar
  17. [17]
    Y. Xiong and L.G. Mason, “Restoration strategies and spare capacity requirements in self-healing ATM networks,” IEEE Trans on Networks, Vol. 7, No. 1, Feb, 1999, pp. 98–110.CrossRefGoogle Scholar
  18. [18]
    S. Chen and K. Nahrstedt, “Distributed QoS routing in ad-hoc networks,” IEEE JSAC, special issue on ad-hoc networks, Aug. 1999.Google Scholar
  19. [19]
    Li Layuan. “The routing protocol for dynamic and large computer networks”. Journal of computers, No. 2, Vol. 11, 1998, PP. 137–144.Google Scholar
  20. [20]
    B. M. Waxman. “Routing of multipoint connections.” IEEE Journal of Selected Area in Communications, Dec. 1998, pp. 1617–1622.Google Scholar
  21. [21]
    R.G. Busacker and T. L. Saaty, Finite Graphs and Networks: An introduction with applications, McGraw-Hill, 1965.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Layuan Li
    • 1
  • Chunlin Li
    • 1
  1. 1.Department of Computer ScienceWuhan University of TechnologyWuhanP. R. China

Personalised recommendations