A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Controlled flooding search in a large network
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Mobile Computing
HBA: Distributed Metadata Management for Large Cluster-Based Storage Systems
IEEE Transactions on Parallel and Distributed Systems
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Distributed pattern matching: a key to flexible and efficient P2P search
IEEE Journal on Selected Areas in Communications
On the fundamental performance limits of peer-to-peer data replication in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Assisted Peer-to-Peer Search with Partial Indexing
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
Peer-to-peer(P2P) multimedia sharing is widely envisioned as one of the major applications of wireless communication network in the future, and wireless bandwidth constraint is its principal obstacle. Aiming to save bandwidth, a novel P2P lookup protocol named BF-Chord is proposed, in which the finger table in Chord is changed, shared files' information is compressed into Bloom Filters(BFs) before it is broadcasted to P2P system, and the broadcasting nature of wireless channel is exploited as well. Simulation results show that the proposed scheme not only decreases system's wireless bandwidth consumption, speeds object location, but also reduces the index information storage space.