Proceedings of the 17th International Conference on Data Engineering
BestPeer: A Self-Configurable Peer-to-Peer System
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Coordinated enroute multimedia object caching in transcoding proxies for tree networks
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Peer-to-peer management of XML data: issues and research challenges
ACM SIGMOD Record
Optimal methods for coordinated enroute web caching for tree networks
ACM Transactions on Internet Technology (TOIT)
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Random Sampling for Continuous Streams with Arbitrary Updates
IEEE Transactions on Knowledge and Data Engineering
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multimedia Object Placement for Transparent Data Replication
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
The existing sharable file searching methods have at least one of the following disadvantages: (1) they are applicable only to certain topology patterns, (2) suffer single point failure, or (3) incur prohibitive maintenance cost. These drawbacks prevent their effective application in unstructured Peer-to-peer (P2P) systems (where the system topologies are changed time to time due to peers' frequently entering and leaving the systems), despite the considerable success of sharing file search in conventional peer-to-peer systems. Motivated by this, we develop several fully dynamic algorithms for searching sharing files in unstructured peer to peer systems. Our solutions can handle any topology pattern with small search time and computational overhead. We also present an in-depth analysis that provides valuable insight into the characteristics of alternative effective search strategies and leads to precision guarantees. Extensive experiments validate our theoretical findings and demonstrate the efficiency of our techniques in practice.