Improving Efficiency of Peer Network Applications by Formulating Distributed Spanning Tree

Peer to Peer (P2P) networks are the important part of the next cohort of Internet. But in Peer networks, achieving required efficiency for any application is difficult. This is because efficiency of application evidently depends on the effective communication. For any communication process in peer network very large number of message passes needed because the message may go through a node multiple times. In order to limit the number of message passes needed for effective communication in any peer network, we follow an interconnection structure called Distributed Spanning Tree (DST) which defines each node as the root of a spanning tree. DST will make the peer network into a layered structure to improve the effective routing and data availability. In this paper, we propose a technique to formulate DST in peer network and determined efficiency improvement in various P2P applications using DST.