Opportunistic Data Dissemination in Mobile Peer-to-Peer Networks

2005 ◽  
pp. 346-363 ◽  
Author(s):  
A. Prasad Sistla ◽  
Ouri Wolfson ◽  
Bo Xu
Keyword(s):  
Data Dissemination ◽  
Peer To Peer ◽  
Peer Networks ◽  
Peer To Peer Networks

Data Dissemination and Query Routing in Mobile Peer-to-Peer Networks

2010 ◽  
pp. 26-49
Author(s):  
Thomas Repantis ◽  
Vana Kalogeraki
Keyword(s):  
High Probability ◽  
Data Dissemination ◽  
Peer To Peer ◽  
Peer Networks ◽  
Query Routing ◽  
Data Propagation ◽  
Peer Network ◽  
Peer To Peer Networks ◽  
Routing Mechanism ◽  
Peer To Peer Network

In this chapter the authors study the problems of data dissemination and query routing in mobile peerto- peer networks. They provide a taxonomy and discussion of existing literature, spanning overlay topologies, query routing, and data propagation. They proceed by proposing content-driven routing and adaptive data dissemination algorithms for intelligently routing search queries in a peer-to-peer network that supports mobile users. In the authors’ mechanism, nodes build content synopses of their data and adaptively disseminate them to their most appropriate peers. Based on the content synopses, a routing mechanism is being built, to forward the queries to those peers that have a high probability of providing the desired results. The authors provide an experimental evaluation of different dissemination strategies, which shows that content-driven routing and adaptive data dissemination is highly scalable and significantly improves resource usage.

Real-time data dissemination in mobile peer-to-peer networks

2014 ◽  
Vol 90 ◽  
pp. 179-190 ◽  
Author(s):  
Fotis Loukos ◽  
Helen Karatza ◽  
Vana Kalogeraki
Keyword(s):  
Real Time ◽  
Data Dissemination ◽  
Peer To Peer ◽  
Peer Networks ◽  
Time Data ◽  
Peer To Peer Networks ◽  
Real Time Data

Data Dissemination and Query Routing in Mobile Peer-to-Peer Networks

2010 ◽  
pp. 371-394
Author(s):  
Thomas Repantis ◽  
Vana Kalogeraki
Keyword(s):  
High Probability ◽  
Data Dissemination ◽  
Peer To Peer ◽  
Peer Networks ◽  
Query Routing ◽  
Data Propagation ◽  
Peer Network ◽  
Peer To Peer Networks ◽  
Routing Mechanism ◽  
Peer To Peer Network

In this chapter the authors study the problems of data dissemination and query routing in mobile peerto- peer networks. They provide a taxonomy and discussion of existing literature, spanning overlay topologies, query routing, and data propagation. They proceed by proposing content-driven routing and adaptive data dissemination algorithms for intelligently routing search queries in a peer-to-peer network that supports mobile users. In the authors’ mechanism, nodes build content synopses of their data and adaptively disseminate them to their most appropriate peers. Based on the content synopses, a routing mechanism is being built, to forward the queries to those peers that have a high probability of providing the desired results. The authors provide an experimental evaluation of different dissemination strategies, which shows that content-driven routing and adaptive data dissemination is highly scalable and significantly improves resource usage.

Partition Nodes: Topologically-Critical Nodes of Unstructured Peer-to-Peer Networks

2008 ◽  
Vol 19 (9) ◽  
pp. 2376-2388 ◽  
Author(s):  
Zhen-Hua LI ◽  
Gui-Hai CHEN ◽  
Tong-Qing QIU
Keyword(s):  
Peer To Peer ◽  
Peer Networks ◽  
Critical Nodes ◽  
Peer To Peer Networks
Sign in / Sign up

Export Citation Format

Share Document