Improved Hierarchical Network Model Based on Pastry Scheme

The traditional Pastry design is a flat overlay network and limited-scope searching, in which all nodes have identical capabilities and responsibilities and all communication is symmetric. But in practice, because of a variety of available bandwidth and delay, each node has different capabilities. in this paper, a hierarchical Pastry network model is presented to address this limitation. Furthermore, the routing procedure and handling algorithm of the arrival and departure of nodes will be carefully discussed. Finally, some elementary experimental results obtained with a prototype implementation on JXTA platform indicate that the improved Pastry network model is superior in routing performance.