Multipath allocation algorithm for the distributed computer environment
Kenji Minato, Yasuyuki Okumura, Ryozo Kishimoto · Electronics and Communications in Japan (Part I Communications) · 1994
Abstract This paper discusses the multipath allocation problem in the communication network and proposes a multipath allocation algorithm suited to the distributed environment. The multipath allocation problem is a problem where multiple paths are to be allocated without a conflict. This problem has been difficult to solve in the distributed environment since relations among various routes must be considered. The algorithm proposed in this paper solves this point by realizing the asynchronous path search. In this paper, the basic characteristics of the proposed algorithm are described through the comparison between the proposed and the traditional algorithms for the case of serial computation under the centralized control. Then the proposed algorithm is applied to several kinds of distributed cooperative multiagent models, and it is demonstrated that the proposed model can easily be applied to the distributed environment. A simulation is executed actually using several workstations, and it is shown that the proposed algorithm is desirable as a solution method for the multipath allocation problem in the distributed environment.