Abstract
In large scale peer-to-peer networks, it is impossible to perform a query request by visiting all peers. There are some works that try to find the location of resources probabilistically (i.e. non-deterministically). They all have used inefficient protocols for finding the probable location of peers who manage the resources. This paper presents a more efficient protocol that is proximity-aware in the sense that it is able to cache and replicate the popular queries proportional to distance latency. The protocol dictates that the farther the resources are located from the origin of a query, the more should be the probability of their replication in the caches of intermediate peers. We have validated the proposed distributed caching scheme by running it on a simulated peer-to-peer network using the well-known Gnutella system parameters. The simulation results show that the proximity-aware distributed caching can improve the efficiency of peer-to-peer resource location services.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rowstron, A., Druschel, P.: Pastry: Scalable, Distributed, Object Location and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Dai, L., Cao, Y., Cui, Y., Xue, Y.: On Scalability of Proximity-Aware Peer-to-Peer Streaming. Computer Communications 32(1), 144–153 (2009)
Menascé, D.A., Kanchanapalli, L.: Probabilistic Scalable P2P Resource Location Services. ACM Sigmetrics Performance Evaluation Rev. 30(2), 48–58 (2002)
Menascé, D.: Scalable P2P Search. IEEE Internet Computing 7(2) (2003)
Zhu, Y., Hu, Y.: Efficient, Proximity-Aware Load Balancing for DHT-Based P2P Systems. IEEE Transactions on Parallel and Distributed Systems 16(1), 349–361 (2005)
Zhu, Y., Li, B., Pu, K.Q.: Dynamic Multicast in Overlay Networks with Linear Capacity Constraints. IEEE Transactions on Parallel and Distributed Systems 20(7), 925–939 (2009)
Zhu, Y., Li, B.: Overlay Networks with Linear Capacity Constraints. IEEE Transactions on Parallel and Distributed Systems 19(2), 159–173 (2008)
Yang, B., Garcia-Molina, H.: Improving Search in Peer-to-Peer Networks. In: The 22nd International Conference on Distributed Computing Systems (ICDCS 2002), Vienna, Austria (2002)
Adamic, L., Lukose, R., Puniyani, A., Huberman, B.: Search in Power-Law Networks (2001), http://www.parc.xerox.com/istl/groups/iea/papers/plsearch/
Zhao, L., Newell, D., Iyer, R., Milekal, R.: Priority Aware Selective Cache Allocation. Patent (2009)
Jung, H., Yeom, H.Y.: Efficient Lookup Using Proximity Caching for P2P Networks. In: Proceeding of International Conference on Grid and Cooperative Computing (GCC), Wuhan, China, pp. 567–574 (2004)
Jesi, G.P., Montresor, A., Babaoglu, O.: Proximity-Aware Superpeer Overlay Topologies. IEEE Transactions on Network and Service Management (2007)
Yang, B., Garcia-Molina, H.: Designing a Super-Peer Network. In: Proc. Int’l Conf. Data Eng. (ICDE), pp. 49–63 (2003)
Palmer, C., Steffan, J.: Generating network topologies that obey power laws. In: The GLOBECOM (2000)
Yang, B., Garcia-Molina, H.: Comparing Hybrid Peer-to-Peer Systems. In: Proc. 27th Int. Conf. on Very Large Data Bases, Rome (2001)
Song, J.W., Park, K.S., Yang, S.B.: An Effective Cooperative Cache Replacement Policy for Mobile P2P Environments. In: Proceeding of IEEE International Conference on Hybrid Information Technology (ICHIT 2006), Korea, vol. 2, pp. 24–30 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Analoui, M., Rezvani, M.H. (2010). A Case for Content Distribution in Peer-to-Peer Networks. In: An, A., Lingras, P., Petty, S., Huang, R. (eds) Active Media Technology. AMT 2010. Lecture Notes in Computer Science, vol 6335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15470-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-15470-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15469-0
Online ISBN: 978-3-642-15470-6
eBook Packages: Computer ScienceComputer Science (R0)