Ant Agent-Based QoS Multicast Routing in Networks with Imprecise State Information

  • Xin Yan
  • Layuan Li
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4088)


The existing schemes based on ant agents don’t take into account the impact of the imprecision of network state information on routing performance. In this paper, we design a novel ant agent-based multicast routing algorithm with bandwidth and delay guarantees, called QMRA, which works for packet- switching networks where the state information is imprecise. In our scheme, an ant uses the probability that a link satisfies QoS requirements and the cost of a path instead of the ant’s trip time or age to determine the amount of pheromone to deposit, so that it has a simpler migration process, less control parameters and can tolerate the imprecision of state information. Extensive simulations show our algorithm can achieve low routing blocking ratio, low average packet delay and fast convergence when the network state information is imprecise.


Destination Node Multicast Tree Delay Requirement Average Packet Delay Multicast Session 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Sim, K.M., Sun, W.H.: Ant Colony Optimization for Routing and Load-Balancing: Survey and New Directions. IEEE Transactions on Systems, Man and Cybernetics, Part A 33(5), 560–572 (2003)CrossRefGoogle Scholar
  2. 2.
    Bonabeau, E., Dorigo, M., Theraulaz, G.: Inspiration for Optimization from Social Insect Behavior. Nature 406(6791), 39–42 (2000)CrossRefGoogle Scholar
  3. 3.
    Schoonderwoerd, R., Holland, O., Bruten, J., Rothkrantz, L.: Ant-based Load Balancing in Telecommunications Networks. Adaptive Behavior 5(2), 169–207 (1997)CrossRefGoogle Scholar
  4. 4.
    Caro, G.D., Dorigo, M.: Mobile Agents for Adaptive Routing. In: Proc. of the Thirty-First Hawaii International Conference on System Sciences, January 6-9, 1998, Kohala Coast, HI, vol. 7, pp. 74–83 (1998)Google Scholar
  5. 5.
    Oida, K., Sekido, M.: An Agent-based Routing System for QoS Guarantees. In: Proc. of IEEE International Conference on Systems, Man, and Cybernetics, October 12-15, 1999, Tokyo, Japan, vol. 3, pp. 833–838 (1999)Google Scholar
  6. 6.
    Lu, G.Y., Liu, Z.M.: Multicast Routing Based on Ant-Algorithm with Delay and Delay Variation Constraints. In: Proc. of IEEE Asia-Pacific Conference on Circuits and Systems, Decembert 4-6, 2000, Tianjin, China, pp. 243–246 (2000)Google Scholar
  7. 7.
    Guerin, R.A., Orda, A.: QoS Routing in Networks with Inaccurate Information: Theory and Algorithms. IEEE/ACM Transactions on Networking 7(3), 350–364 (1999)CrossRefGoogle Scholar
  8. 8.
    Waxman, B.M.: Routing of Multiple Connections. IEEE Journal on Selected Areas in Communications 6(9), 1617–1622 (1998)CrossRefGoogle Scholar
  9. 9.
    Ouyang, J., Yan, G.R.: A Multi-group Ant Colony System Algorithm for TSP. In: Proc. of International Conference on Machine Learning and Cybernetics, August 26-29, 2004, Shanghai, China, pp. 117–121 (2004)Google Scholar
  10. 10.
    Zecchin, A.C., Simpson, A.R., Maier, H.R., Nixon, J.B.: Parametric Study for an Ant Algorithm Applied to Water Distribution System Optimization. IEEE Transactions on Evolutionary Computation 9(2), 175–191 (2005)CrossRefGoogle Scholar
  11. 11.
    Stützle, T., Dorigo, M.: A Short Convergence Proof for a Class of Ant Colony Optimization Algorithms. IEEE Transactions on Evolutionary Computation 6(4), 358–365 (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

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

Personalised recommendations