Constructing a Balanced, (log(N)/loglog(N))-Diameter Super-Peer Topology for Scalable P2P Systems
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Semantic reconciliation in peer multi-data source management system
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Data mining effect in peer-to-peer queries routing
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Semantic query routing in senpeer, a P2P data management system
NBiS'07 Proceedings of the 1st international conference on Network-based information systems
| Hi-index | 0.00 |
An important issue for peer-to-peer application is to locate content within the network. There are many existing solutions to this problem, however, each of them addresses different aspects and each has its deficiencies. In this paper, we focus on the unstructured peer-to-peer scenario and present a constrained flooding routing algorithm, Efa, which overcomes some of the deficiencies of those existing strategies. Efa performs application levelbroadcasting in a potentially very large peer-to-peer network overlaid on the Internet. Efa is completely decentralized and self-organized. It is a more scalable alternative to flooding, which is commonly used in unstructured peer-to-peer systems. Utilizing just a small amount of topology info, Efa is almost as simple as flooding, but it is much more efficient and scalable.