DocumentCode
3038546
Title
Efficient Data Dissemination in Overlays
Author
Vu, Dung ; Repantis, Thomas ; Kalogeraki, Vana
Author_Institution
Dept. of Comput. Sci. & Eng., Univ. of California, Riverside, CA, USA
fYear
2009
fDate
17-17 March 2009
Firstpage
93
Lastpage
100
Abstract
In this paper we propose adaptive data dissemination algorithms for intelligently routing search queries in a peer-to-peer network. In our mechanism nodes build content synopses of their data and adaptively disseminate them to the most appropriate nodes. Based on the content synopses, a routing mechanism is being built to forward the queries to those nodes that have a high probability of providing the desired results. Our simulation results show that our approach is highly scalable and significantly improves resources usage by saving both bandwidth and processing power.
Keywords
data handling; peer-to-peer computing; query processing; telecommunication network routing; data dissemination algorithm; overlay network; peer-to-peer network; routing mechanism; search query; data dissemination; overlays; peer-to-peer;
fLanguage
English
Publisher
ieee
Conference_Titel
Future Dependable Distributed Systems, 2009 Software Technologies for
Conference_Location
Tokyo
Print_ISBN
978-0-7695-3572-2
Electronic_ISBN
978-0-7695-3572-2
Type
conf
DOI
10.1109/STFSSD.2009.44
Filename
4804579
Link To Document