Intelligent packets for dynamic network routing.

摘要

A distributed GA (Genetic Algorithm) is designed for the packet switched network routing problem under minimal information, i.e., without information exchange, every node only knows the existence of its neighboring nodes. The requirements of such a problem mean that intelligent packets are required to possess more intelligence than was the norm. To this end a distributed GA approach is developed and benchmarked against the AntNet algorithm under similar information constraints. A profile of AntNet under local and global information is developed with the proposed distributed GA clearly improving on the AntNet algorithm under local information constraints.