Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Peer-to-peer File-sharing over Mobile Ad hoc Networks
PERCOMW '04 Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 07
Asynchronous distributed P2P-SIP model for VoIP
GIIS'09 Proceedings of the Second international conference on Global Information Infrastructure Symposium
GPM: A generic and scalable P2P model that optimizes tree depth for multicast communications
International Journal of Communication Systems
| Hi-index | 0.00 |
Peer-to-Peer systems are based on the concept of resources localization and mutualization in dynamic context. In specific environment such as mobile networks, characterized by high variability and dynamicity of network conditions and performances, where nodes can join and leave the network dynamically, resources reliability and availability constitute a critical issue. To deal with this critical issue, we introduce a new concept and model called ”P4L” (four layers Peer-to-Peer model) which define a novel P2P architecture, aims to improve: fault-tolerance, self- organization and scalability, with limited complexity while providing a rapid convergence for the lookup algorithm. The cost of ”P4L” lookup is O(∑ln (ni)) where ni is the number of nodes on ring level i (with maximum of 256 nodes in each ring). ”P4L” is efficiently adapted to the context where nodes join and leave dynamically and frequently. Each node maintains routing information of 2*O(ln (ni)), where ni is the number of nodes on one ring. Thus ”P4L” is well adapted for terminals with limited resources such as mobile terminals. ”P4L” is based on ring topology with each ring connecting ”neighbouring” nodes in terms of physical and logical position. When ”P4L” is combined with broadcast mechanism, the lookup process is significantly improved. The proposed model is evaluated and compared with Chord protocol, an extension is proposed to support IPv6.