Abstract
The popularity of peer-to-peer search networks continues to grow, even as the limitations to the scalability of existing systems become apparent. We propose a simple model for search networks, called the Search/Index Links (SIL) model. The SIL model describes existing networks while also yielding organizations not previously studied. Using analytical and simulation results, we argue that one new organization, parallel search clusters, is superior to existing supernode networks in many cases.
This material is based upon work supported by the National Science Foundation under Award 9811992.
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
Adamic, L., Lukose, R., Puniyani, A., Huberman, B.: Search in power-law networks. Phys. Rev. E 64, 46135–46143 (2001)
Bernstein, P.A., Giunchiglia, F., Kementsietsidis, A., Mylopoulos, J., Serafini, L., Zaihrayeu, I.: Data management for peer-to-peer computing: A vision. In: Proc. Workshop on the Web and Databases, WebDB (2002)
Cohen, E., Shenker, S.: Replication strategies in unstructured peer-to-peer networks. In: Proc. SIGCOMM (August 2002)
Cooper, B.F., Garcia-Molina, H.: Ad hoc, self-supervising peer-to-peer search networks. Technical Report, Stanford University Database Group (2003)
Cooper, B.F., Garcia-Molina, H.: SIL: Modeling and measuring scalable peer-to-peer search networks (2003) (extended version), http://dbpubs.stanford.edu/pub/2003-53
Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proc. Int’l Conf. on Distributed Computing Systems (ICDCS) (July 2002)
Harren, M., Hellerstein, J.M., Huebsch, R., Loo, B.T., Shenker, S., Stoica, I.: Complex queries in DHT-based peer-to-peer networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 242. Springer, Heidelberg (2002)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proc. of ACM Int’l Conf. on Supercomputing (ICS 2002) (June 2002)
Lv, Q., Ratnasamy, S., Shenker, S.: Can heterogeneity make gnutella scalable? In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 94. Springer, Heidelberg (2002)
Pandurangan, G., Raghavan, P., Upfal, E.: Building low-diameter P2P networks. In: Proc. IEEE Symposium on Foundations of Computer Science (2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. SIGCOMM (August 2001)
Ripeanu, M., Foster, I.: Mapping the gnutella network: Macroscopic properties of large-scale peer-to-peer systems. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 85. Springer, Heidelberg (2002)
Saroiu, S., Gummadi, K., Gribble, S.: A measurement study of peer-to-peer file sharing systems. In: Proc. Multimedia Conferencing and Networking (January 2002)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. SIGCOMM (August 2001)
Yang, B., Garcia-Molina, H.: Efficient search in peer-to-peer networks. In: Proc. Int’l Conf. on Distributed Computing Systems (ICDCS) (July 2002)
Yang, B., Garcia-Molina, H.: Desigining a super-peer network. In: Proc. ICDE (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cooper, B.F., Garcia-Molina, H. (2004). SIL: Modeling and Measuring Scalable Peer-to-Peer Search Networks. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P 2003. Lecture Notes in Computer Science, vol 2944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24629-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-24629-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20968-3
Online ISBN: 978-3-540-24629-9
eBook Packages: Springer Book Archive