Ant-based load balancing in telecommunications networks
Adaptive Behavior
QoS routing in networks with inaccurate information: theory and algorithms
IEEE/ACM Transactions on Networking (TON)
Mobile Agents for Adaptive Routing
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
A short convergence proof for a class of ant colony optimizationalgorithms
IEEE Transactions on Evolutionary Computation
Parametric study for an ant algorithm applied to water distribution system optimization
IEEE Transactions on Evolutionary Computation
Ant colony optimization for routing and load-balancing: survey and new directions
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
A QoS multicast routing protocol for clustering mobile ad hoc networks
Computer Communications
QoS-based MPLS multicast tree selection algorithms
Proceedings of the 7th International Conference on Frontiers of Information Technology
| Hi-index | 0.00 |
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.