H. Kashiwazaki and Y. Takai (Japan)
Multi-agent networks, adaptive routing, network congestion, network simulation.
In this paper, we present a network routing algorithm which has autonomous adaptability to network traffic conditions. When a routing node has some different paths to a given destination, we can evaluate these paths in terms of their latency (delay time) which will be informed back from the destination node. By using scores evaluation of the path for selection, every node works as a distributed autonomous agent for adaptive routing. In forwarding packets, a routing node decides the next routing node according to the local rules with score evaluation. There are two local rules for adaptive routing: a deterministic rule in which we select the next node with the shortest latency, and a random rule in which we select the next node at a probability inversely proportional to the latency value. A heuristic combination of these two rules results in the convergence to the global optimal solution. Our network simulations show that the multiagents-based routing algorithm has good adaptability in congested path avoidance.
Important Links:
Go Back
