Abstract
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 (n i )) where n i 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 (n i )), where n i 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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cramer, C., Kutzner, K., Fuhrmann, T.: Bootstrapping Locality-Aware P2P Networks (2003)
Shirky, C.: What is P2P and what Isn’t. O’Reilly Network, Sebastopol (2001)
Ding, G., Bhargava, B.: Peer-to-Pee file sharing over mobile Ad hoc Networks. In: Proceedings of the second IEEE annual conference pervasive computing and communications Workshops (PERCOMW 2004) (2004)
Gnutella, http://www.gnutella.com
Milojicic, D.S., Kalogeraki, V., Lukose, R., Nagaraja, K., Pruyne, J., Richard, B., Rollins, S., Xu, Z.: Peer to Peer conputing Survey. HP Laboratories Palo Alto, HPL-2002-57 (March 2002)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: ACM SIGCOMM (2001)
Rowstron, A., Druschel, P.: Pastry: a scalable, decentralized object location and routing for large scale peer to peer systems. In: Proceedings of the 18th IFIP/ACM international conference on distributed systems plateforms (Middelware 2001), Heidelberg, Germany (November 2001)
Schoder, D., Fischbach, k.: The Peer-to-Peer Paradigm. In: Proceeding of the 38th Hawaii International Conference on System Sciences, IEEE Internet computing (2005)
Singh, K., Schulzrinne, H.: P2P Internet telephony using SIP. Technical report, Department of computer Science, Columbia University (2004)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer lookup Service for Internet Application. In: Proceedings of the ACM SIGCOMM 2001, San Diego, California (2001)
Peer to Peer Working Group. Bidirectional Peer-to-Peer communication with interposing Firewalls and NATs. Peer-to-Peer Working group, White Paper (2001)
Zhao, B., Kubiatowich, J., Joseph, A.D.: Tapestry: an infrastructure for fault-tolerant Wide-area location and routing. Report No. UCB/CDS-01-1141, Computer Science Division, University of California, Berkeley (April 2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amad, M., Meddahi, A. (2006). ”P4L”: A Four Layers P2P Model for Optimizing Resources Discovery and Localization. In: Kim, YT., Takano, M. (eds) Management of Convergence Networks and Services. APNOMS 2006. Lecture Notes in Computer Science, vol 4238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11876601_35
Download citation
DOI: https://doi.org/10.1007/11876601_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45776-3
Online ISBN: 978-3-540-46233-0
eBook Packages: Computer ScienceComputer Science (R0)