Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
497508 | Applied Soft Computing | 2006 | 14 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
S. Liang, A.N. Zincir-Heywood, M.I. Heywood,