Routing method based on a computational ecology model
T. Yamasaki, Toshimitsu Ushio · 2003
Proposes a network routing method based on a computational ecology model by Hogg and Huberman (1991), which represents the macro action of multi-agent systems. We consider routing on a network as a resource allocation problem, where packets and links are regarded as agents and resources, respectively. Then, we apply a computational ecology model for this problem. Routing is accomplished autonomously with adaptivity and some fault-tolerance on the packet network. Finally, we examine the efficiency of the proposed method by computer simulation from several points of view.