An Improved Ant Colony Optimization Algorithm for Multiple QoS Routing to Find Multiple Feasible Paths for Packet Switched Network

Free registration required

Executive Summary

In recent years, Ant-based algorithms were used to solve classical routing problems such as: traveling salesman problem, vehicle routing problem, quadratic assignment problem, connection-oriented/connectionless routing, sequential ordering, graph coloring and shortest common super-sequence. In this paper, the authors propose an ant colony optimization based, QoS routing algorithm to find multiple feasible path. In this algorithm they regulates the pheromone on the best path and adopts resetting method and candidate set strategy to avoid falling into local optimal path and expand searching space of ant colony. In this paper, they propose that the algorithm can find multiple feasible path between a pair of source and destination which satisfied the QoS constraints quickly, and balance network traffic reasonably.

  • Format: PDF
  • Size: 971.2 KB