Neural Network Based Algorithm for Multi-Constrained Shortest Path Problem
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks
Steps toward self-aware networks
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
Adaptive primal-dual genetic algorithms in dynamic environments
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An initiative for a classified bibliography on G-networks
Performance Evaluation
Bibliography on G-networks, negative customers and applications
Mathematical and Computer Modelling: An International Journal
Dynamic path planning of mobile robots with improved genetic algorithm
Computers and Electrical Engineering
An intelligent routing approach using genetic algorithms for quality graded network
International Journal of Intelligent Systems Technologies and Applications
A QoS-based routing approach using genetic algorithms for bandwidth maximisation in networks
International Journal of Artificial Intelligence and Soft Computing
Multiobjective learning in the random neural network
International Journal of Advanced Intelligence Paradigms
Hi-index | 0.00 |
Packet routing in networks requires knowledge about available paths, which can be either acquired dynamically while the traffic is being forwarded, or statically (in advance) based on prior information of a network's topology. This paper describes an experimental investigation of path discovery using genetic algorithms (GAs). We start with the quality-of-service (QoS)-driven routing protocol called "cognitive packet network" (CPN), which uses smart packets (SPs) to dynamically select routes in a distributed autonomic manner based on a user's QoS requirements. We extend it by introducing a GA at the source routers, which modifies and filters the paths discovered by the CPN. The GA can combine the paths that were previously discovered to create new untested but valid source-to-destination paths, which are then selected on the basis of their "fitness." We present an implementation of this approach, where the GA runs in background mode so as not to overload the ingress routers. Measurements conducted on a network test bed indicate that when the background-traffic load of the network is light to medium, the GA can result in improved QoS. When the background-traffic load is high, it appears that the use of the GA may be detrimental to the QoS experienced by users as compared to CPN routing because the GA uses less timely state information in its decision making