Tree Overlay Network (T.O.N.): Decentralized Node Location, Routing and Maintenance Network Overlay for Large Scale Peer to Peer Systems

this paper presents the design and working of Tree Overlay Network (T.O.N). (1), a completely decentralized network overlay which is used for network creation, maintenance and routing in large scale peer-to-peer applications. It performs routing on the application layer for nodes that are connected via Internet with the help of a structured overlay developed using our proposed modified B-Tree. It has applications in large number of peer-to-peer services. Each node in the T.O.N. is assigned a unique identifier (nodeId) which is assigned on the basis of epoch time. When a node is presented with a message and nodeId, it routes the message through previously formed node packs, which are formed through a sorting mechanism of nodeId corresponding to each node, in an effective manner. In T.O.N. (1) each node keeps track of its neighbors by maintaining various pointers which are used to map their keys to their corresponding IP addresses. The following system is capable of self-adaptation i.e. can manage itself on arrival, departure and failure of nodes.