Indexing through Querying in Unstructured Peer-to-Peer Overlay Networks

摘要：

The efficiency of a Peer-to-Peer file sharing overlay is measured in terms of the scalability and versatility of its object lookup strategy.In these networks peers carry out distributed query relaying to discover the service providers.Existing lookup mechanisms like flooding and random walks in unstructured P2P overlays create huge communication overhead and increased response time.In this work we propose efficient lookup in unstructured peer-to-peer overlay networks using indexing through querying,distributing indices through queries.Our simulation studies show that by our approach more than 97% of the queries are answered in one hop and the rest in few hops thus reducing the network load.Our approach is efficient in worst case scenarios where contents are distributed over thousands of peers and the overlay network condition is highly dynamic.

关键词： Peer-to-Peer Overlay Networks Indexing Lookup Bloom Filters.

作者: K.Haribabu Chittaranjan Hota Antti Yl(a)-J(a)(a)ski

作者单位: Computer Sc.& Information Systems Group,Birla Institute of Technology and Science Pilani,Rajasthan,I Computer Sc.& Information Syst.Group,Birla Institute of Technology and Science,Pilani Hyderabad Camp Data Communications Software Laboratory,Deptartment of Computer Sc.& Engineering Helsinki University

会议类型: 国际会议

会议名称: 11th Asia-Pacific Network Operations and Management Symposium(APNOMS 2008)(第十一届亚太网络运行和管理国际研讨会)

会议地点: 北京

会议语种:英文

页码: 102-111

在线出版日期: 2008-10-22（万方平台首次上网日期，不代表论文的发表时间）