SEARCHING FOR INFORMATION IN A P2P SYSTEM

I. Sygkouna, M. Anagnostou, and E. Sykas

References

  1. [1] M. Satyanarayanan, Challenges in implementing a context-aware system, Editorial Introduction in IEEE Pervasive Computing, July–September 2002, 2.
  2. [2] S. Xynogalas, M. Chantzara, I. Sygkouna, S. Vrontis, I. Roussaki, & M. Anagnostou, Context management for the provision of adaptive services to roaming users, IEEE Wireless Communications, 11 (2), 2004, 40–47. doi:10.1109/MWC.2004.1295737
  3. [3] M. Parameswaran, A. Susarla, & A.B. Whinston, P2P networking: An information-sharing alternative, Computer, 34 (7), 2001, 31–38. doi:10.1109/2.933501
  4. [4] Q. Lv, P. Cao, E. Cohen, K. Li, & S. Shenker, Search and replication in unstructured peer-to-peer networks, Proc. ACM Sigmetrics Conf., Marina del Rey, California, USA, 2002, 258–259.
  5. [5] B. Yang & H. Garcia-Molina, Improving search in peer-to-peersystems, Proc. IEEE ICDCS, Vienna, July 2002, 5–14.
  6. [6] C. Gkantsidis, M. Mihail, & A. Saberi, Random walks in peer-to-peer networks, Proc. IEEE Infocom 2004, Hong Kong, March 2004, 130–140.
  7. [7] C. Gkantsidis, M. Mihail, & A. Saberi, Hybrid search schemesfor unstructured peer-to-peer networks, Proc. IEEE Infocom2005, Miami, March 2005, 1526–1537.
  8. [8] E. Cohen & S. Shenker, Replication strategies in unstructuredpeer-to-peer networks, Proc. ACM SIGCOMM, Pittsburgh, August 2002, 177–190. doi:10.1145/964725.633043
  9. [9] D.A. Menascé & L. Kanchanapalli, Probabilistic scalable P2Presource location services, ACM Sigmetrics Performance Evaluation Rev., 30 (2), 2002, 48–58. doi:10.1145/588160.588167
  10. [10] A. Crespo & H. Garcia-Molina, Routing indices for peer-to-peersystems, Proc. IEEE ICDCS, Vienna, July 2002, 23–30.
  11. [11] E. Cohen, A. Fiat, & H. Kaplan, Associative search in peer-to-peer networks: Harnessing latent semantics, Proc. IEEE INFOCOM, San Francisco, April 2003, 1261–1271.
  12. [12] K. Sripanidkulchai, B. Maggs, & H. Zhang, Efficient contentlocation using interest-based locality in peer-to-peer systems,Proc. IEEE INFOCOM, San Francisco, April 2003, 2166–2176.
  13. [13] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, & S. Shenker, Making Gnutella-like P2P systems scalable, Proc. ACM SIGCOMM, Karlsruhe, Germany, August 2003, 407–418.
  14. [14] B. Yang & H. Garcia-Molina, Designing a super-peer network,Proc. IEEE ICDE, Bangalore, India, 2003, 49–60.
  15. [15] I. Stoica, R. Morris, D. Karger, M. Kaashoek, & H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, Proc. ACM Sigcomm, San Diego, CA, USA, 2001, 149–160. doi:10.1145/964723.383071
  16. [16] S. Ratnasamy, P. Francis, M. Handley, R. Karp, & S. Shenker,A scalable content addressable network, Proc. ACM Sigcomm,San Diego, CA, USA, August 2001, 161–172. doi:10.1145/964723.383072
  17. [17] A. Rowstron & P. Druschel, Pastry: Scalable, distributed,object location and routing for large-scale peer-to-peer systems,Proc. IFIP/ACM Int. Conf. on Distributed System Platforms(Middleware), Heidelberg, Germany, 2001, 329–350.
  18. [18] Y. Zhao, J.D. Kubiatowicz, & A. Joseph, Tapestry: Aninfrastructure for fault-tolerant wide-area location and routing,Technical Report UCB/CSD-01-1141, Berkeley, 2000.
  19. [19] P. Reynolds & A. Vahdat, Efficient peer-to-peer keywordsearching, Proc. ACM/IFIP/USENIX Middleware, Rio de Janeiro, Brazil, June 2003, 21–40.
  20. [20] C. Tang, Z. Xu, & S. Dwarkadas, Peer-to-peer informationretrieval using self-organizing semantic overlay networks, Proc.ACM SIGCOMM, Karlsruhe-Germany, August 2003, 175–186.
  21. [21] C. Tang & S. Dwarkadas, Hybrid global-local indexing forefficient peer-to-peer information retrieval, Proc. USENIXNSDI, San Francisco, California, March 2004, 211–224.
  22. [22] B. Cooper & H. Garcia-Molina, Ad hoc: Self-supervising peer-to-peer search networks, ACM Trans. on Information Systems,23 (2), 2005, 169–200. doi:10.1145/1059981.1059983
  23. [23] H. Zhang, A. Goel, & R. Govindan, Using the small-world model to improve Freenet performance, Proc. Infocom, New York, 2002, 1228–1237.
  24. [24] J. Kleinberg, Small-world phenomena and the dynamics of information, Advances in Neural Information Processing Systems(NIPS), 14, 2001.
  25. [25] J. Kleinberg, The small-world phenomenon: An algorithmicperspective, Proc. 32nd ACM Symp. on Theory of Computing, Portland, OR, USA, 2000, 163–170.
  26. [26] B.M. Waxman, Routing of multipoint connections, IEEE Journal on Selected Areas in Communications, 6 (9), 1988, 1617–1622. doi:10.1109/49.12889
  27. [27] L. Breslau, P. Cao, L. Fan, G. Phillips, & S. Shenker, Webcaching and zipf-like distributions: Evidence and implications,Proc. INFOCOM, vol. 1, 1999, 126–134.

Important Links:

Go Back