Routing method based on OTT-shaped overlay network - An improvement and evaluation -

A multi-agent system that consists of agents distributed in a network requires an application-level routing method using abstract identifiers such as agent names. We have accordingly proposed a routing method based on an Ordered-Tree-with-Tuft-shaped (OTT-shaped) overlay network. The method can maintain the network robustly and at low cost, and also make use of short-cuts between nodes to find shorter paths than those only found by the ordered tree of OTT. However it has a problem that the path-search cost by shortcuts is too expensive to achieve a reasonable success rate. This paper proposes our newly improved method that finds shorter-paths with both reasonable cost and high success rate of path-search by short-cuts and discusses some of experimental results achieved by software simulation. The results illustrate the validity of our proposed method.