Adding more intelligence to the network routing problem: AntNet and Ga-agents

Authors:
S. Liang;A. N. Zincir-Heywood;M. I. Heywood
Affiliations:
NIMS Group, Faculty of Computer Science, Dalhousie University, 6050 University Avenue, Halifax, NS, Canada B3H 1W5;NIMS Group, Faculty of Computer Science, Dalhousie University, 6050 University Avenue, Halifax, NS, Canada B3H 1W5;NIMS Group, Faculty of Computer Science, Dalhousie University, 6050 University Avenue, Halifax, NS, Canada B3H 1W5
Venue:
Applied Soft Computing
Year:
2006

Citing 11
Cited 4

Internet Routing Architectures

Internet Routing Architectures
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Data Communications and Networking

Data Communications and Networking
The Ant System Applied to the Quadratic Assignment Problem

IEEE Transactions on Knowledge and Data Engineering
A Promising Genetic Algorithm Approach to Job-Shop SchedulingRe-Schedulingand Open-Shop Scheduling Problems

Proceedings of the 5th International Conference on Genetic Algorithms
Intelligent Packets For Dynamic Network Routing Using Distributed Genetic Algorithm

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Cognitive Packet Networks

ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
The effect of routing under local information using a social insect metaphor

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
AntNet: distributed stigmergetic control for communications networks

Journal of Artificial Intelligence Research
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A survey of active network research

IEEE Communications Magazine

Crossover can provably be useful in evolutionary computation

Proceedings of the 10th annual conference on Genetic and evolutionary computation
The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem

Applied Soft Computing
Crossover can provably be useful in evolutionary computation

Theoretical Computer Science
A novel neural network method for shortest path tree computation

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

AntNet and GA-agent algorithms are benchmarked against a series of dynamic network routing problems. Performance is characterized using multiple performance metrics on the Japanese backbone (NTTNET). NTTNET is used on account of the elongated topology presenting a more challenging routing problem than in the case of the American backbone, which is basically square. The AntNet scheme is found to provide the best routing ability providing global information is available and network security is not a factor. The GA-agent algorithm is shown to provide routing performance between the AntNet algorithm with global information and that without, whilst avoiding global information requirements and satisfying typical models of network security.