Congestion Avoidance on Networks Using Independent Memory Information
We propose in this paper a new routing method that utilizes hop distance information and transmitting history. Most of conventional routing methods use global and real-time information such as the number of waiting packets at nodes. In addition, they assumed that these real-time information can be accessed instantaneously at every node. These unrealistic network circumstances, however, limit applicability of routing methods. On the other hand, our proposed method in this paper uses transmitting histories held by each node to diversify routes of packets. In addition, any packets to exchange global information is not necessary. Numerical simulations indicate that our proposed method shows higher arrival rate of packets for various scale-free type communication network models.
The research of T.K. was partially supported by a Grant-in-Aid for Young Scientists (B) from JSPS (No.16K21327).