26. Epidemic Data Dissemination for Mobile Peer-to-Peer Lookup Services

2005 ◽  
pp. 435-455 ◽  
Author(s):  
Christoph Lindemann ◽  
Oliver P. Waldhorst
Keyword(s):  
Data Dissemination ◽  
Peer To Peer ◽  
Lookup Services

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

scholarly journals D4V: a peer-to-peer architecture for data dissemination in smartphone-based vehicular applications

2015 ◽  
Vol 1 ◽  
pp. e15 ◽  
Author(s):  
Marco Picone ◽  
Michele Amoretti ◽  
Gianluigi Ferrari ◽  
Francesco Zanichelli
Keyword(s):  
Data Dissemination ◽  
Peer To Peer

HIERARCHICAL PEER-TO-PEER SYSTEMS

2003 ◽  
Vol 13 (04) ◽  
pp. 643-657 ◽  
Author(s):  
L. GARCÉS-ERICE ◽  
E. W. BIERSACK ◽  
K. W. ROSS ◽  
P. A. FELBER ◽  
G. URVOY-KELLER
Keyword(s):  
Hash Table ◽  
Overlay Network ◽  
Peer To Peer ◽  
Distributed Hash Table ◽  
Hierarchical Design ◽  
P2p Systems ◽  
Lookup Services ◽  
Peer To Peer Systems ◽  
Responsible Group ◽  
Overlay Management

Structured peer-to-peer (P2P) lookup services organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. Data is associated with keys and each peer is responsible for a subset of the keys. In hierarchical DHTs, peers are organized into groups, and each group has its autonomous intra-group overlay network and lookup service. Groups are organized in a top-level overlay network. To find a peer that is responsible for a key, the top-level overlay first determines the group responsible for the key; the responsible group then uses its intra-group overlay to determine the specific peer that is responsible for the key. We provide a general framework for hierarchical DHTs with scalable overlay management. We specifically study a two-tier hierarchy that uses Chord for the top level. Our analysis shows that by using the most reliable peers in the top level, the hierarchical design significantly reduces the expected number of hops. We also present a method to construct hierarchical DHTs that map well to the Internet topology and achieve short intra-group communication delay. The results demonstrate the feasibility of locality-based peer groups, which allow P2P systems to take full advantage of the hierarchical design.

Sign in / Sign up

Export Citation Format

Share Document