An application of a computational ecology model to a routing methodin computer networks

摘要

The paper proposes a network routing method based on ancomputational ecology model. The computational ecology model is anmathematical model proposed by B.A. Huberman and T. Hogg (1988), whichnrepresents a macro action of multi-agent systems. We formulate routingnon a computer network as a resource allocation problem, where packetsnand links are regarded as agents and resources, respectively. Then, wenapply an extended computational ecology model for this problem. Agentsnconflict so as to get more payoffs from links. As a result, they get thensame payoffs, and a good resource allocation is achieved. In each node,neach packet selects a link according to the selection rate decidednthrough conflicts, and routing is accomplished autonomously withnadaptability on the computer network. Moreover, we improvenfault-tolerance of the system by local information exchanges. Finally,nwe examine the efficiency of the proposed method by computer simulation