Adaptive Routing Filters for Robust Query Processing in Schema-Based P2P Systems

2006 ◽  
Author(s):  
K. Hose ◽  
M. Karnstedt ◽  
K.-U. Sattler ◽  
E.-A. Stehr
Keyword(s):  
Query Processing ◽  
Adaptive Routing ◽  
P2p Systems

scholarly journals Efficient Early Top-k Query Processing in Overloaded P2P Systems

2011 ◽  
pp. 140-155 ◽  
Author(s):  
William Kokou Dédzoé ◽  
Philippe Lamarre ◽  
Reza Akbarinia ◽  
Patrick Valduriez
Keyword(s):  
Query Processing ◽  
P2p Systems

scholarly journals As-Soon-As-Possible Top-k Query Processing in P2P Systems

2013 ◽  
pp. 1-27
Author(s):  
William Kokou Dédzoé ◽  
Philippe Lamarre ◽  
Reza Akbarinia ◽  
Patrick Valduriez
Keyword(s):  
Query Processing ◽  
P2p Systems

An Efficient Searching Scheme in Unstructured P2P Networks

2010 ◽  
Vol 439-440 ◽  
pp. 865-869 ◽  
Author(s):  
Ming Zhang ◽  
Jin Qiu Yang
Keyword(s):  
Routing Protocol ◽  
Adaptive Routing ◽  
P2p Networks ◽  
Community Network ◽  
Simple Scheme ◽  
P2p Systems ◽  
Simulation Results ◽  
Unstructured P2p ◽  
P2p System ◽  
Present Simulation

Unstructured peer-to-peer (P2P) systems，due to their excellent support for content lookup and sharing，are creating a large proportion of network traffic in today’s Internet. A P2P system typically involves thousands or millions of live peers in the network. In this paper, we propose and evaluate an efficient searching scheme in unstructured P2P networks. This scheme proposes a local adaptive routing protocol. This routing protocol adopts a simple scheme which driven by query interest among peers. We analyze this scheme’s performance and present simulation results. Our simulation results demonstrated the benefits of the proposed system and show that the approach is able to dynamically group nodes in clusters containing peers with shared interests, at the same time, and organized into a community network.

Pampoo: An Efficient Skip-Trie Based Query Processing Framework for P2P Systems

2007 ◽  
pp. 190-198
Author(s):  
Li Meifang ◽  
Zhu Hongkai ◽  
Shen Derong ◽  
Nie Tiezheng ◽  
Kou Yue ◽  
...  
Keyword(s):  
Query Processing ◽  
P2p Systems ◽  
Processing Framework

Fault-tolerant query processing in structured P2P-systems

2010 ◽  
Vol 28 (1) ◽  
pp. 33-66 ◽  
Author(s):  
Markus Bestehorn ◽  
Christian von der Weth ◽  
Erik Buchmann ◽  
Klemens Böhm
Keyword(s):  
Query Processing ◽  
Fault Tolerant ◽  
P2p Systems
Sign in / Sign up

Export Citation Format

Share Document