Distributed pattern matching for P2P systems

IEEE Symposium Record on Network Operations and Management Symposium

Volumn , Issue , 2006, Pages 198-208

  Ahmed, Reaz ^a   Boutaba, Raouf ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS; PROBLEM SOLVING;

DISTRIBUTED PATTERN MATCHING SYSTEM (DPMS); SERVICE DISCOVERY SYSTEMS; STRUCTURED SEARCH TECHNIQUES;

PATTERN MATCHING;

EID: 34250703637     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/noms.2006.1687551     Document Type: Conference Paper

References (23)

1. Fasttrack peer-to-peer technology, http://www.fasttrack.nu/.
2. http://www.gnutella.com, gnutella website.
3. Peersim peer-to-peer simulator, http://peersim.sourceforge.net/.
4. Amihood Amir, Ely Porat, and Moshe Lewenstein. Approximate subset matching with don't cares. In SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 305-306, Philadelphia, PA, USA, 2001. Society for Industrial and Applied Mathematics.
5. Burton H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
6. A. Broder and M. Mitzenmacher. Network applications of bloom filters: A survey. In Proceedings of the Allerton Conference, 2002.
7. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker. Making gnutella-like p2p systems scalable. In Sigcomm, 2003.
8. E. Cohen and S. Shenker. Replication strategies in unstructured peer-to-peer networks. In SIGCOMM Conference, August 2002.
9. Edith Cohen, Amos Fiat, and Haim Kaplan. Associative search in peer to peer networks: Harnessing latent semantics. In IEEE INFOCOM, 2003.
10. 3 m) time. In Proc. 29th ACM STOC, pages 66-75, 1997.
11. Steven E. Czerwinski, Ben Y. Zhao, Todd D. Hodes, Anthony D. Joseph, and Randy H. Katz. An Architecture for a Secure Service Discovery Service. In Mobile Computing and Networking, pages 24-35, 1999.
12. Mei Li, Wang-Chien Lee, and Anand Sivasubramaniam. Neighborhood signatures for searching p2p networks. In IDEAS, pages 149-159, 2003.
13. Lintao Liu, Kyung Dong Ryu, and Kang-Won Lee. Supporting efficient keyword-based file search in peer-to-peer file sharing systems. In GLOBECOM, 2004.
14. C. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks. In ICS, 2002.
15. Petar Maymounkov and David Mazi. Kademlia: A peer-to-peer information system based on the xor metric. In Revised Papers from the First International Workshop on Peer-to-Peer Systems, pages 53-65. Springer-Verlag, 2002.
16. Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Schenker. A scalable content-addressable network. In Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pages 161-172, 2001.
17. S. Rhea and J. Kubiatowicz. Probabilistic location and routing. In INFOCOM, 2002.
18. C. Schmidt and M. Parashar. Flexible information discovery in decentralized distributed systems. In Proceedings of HPDC, WA, USA, June 2003.
19. Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM SIGCOMM '01 Conference, pages 149-160, San Diego, California 2001.
20. D. Tsoumakos and N. Roussopoulos. Adaptive probabilistic search for peer-to-peer networks. In 3rd IEEE Intl Conference on P2P Computing, 2003.
21. Spyros Voulgaris, Mark Jelasity, and Maarten van Steen. A robust and scalable peer-to-peer gossiping protocol. In Proceedings of the Second International Workshop on Agents and Peer-to-Peer Computing (AP2PC), 2003.
22. B. Yang and H. Garcia-Molina. Improving search in peer-to-peer networks. In ICDCS, 2002.
23. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, April 2001.