An Efficient Peer-to-Peer Semantic Overlay Network for Learning Query Routing

2013 ◽  
Author(s):  
T. Yeferny ◽  
K. Arour ◽  
A. Bouzeghoub
Keyword(s):  
Overlay Network ◽  
Peer To Peer ◽  
Query Routing

scholarly journals Content pollution propagation in the overlay network of peer-to-peer live streaming systems: modelling and analysis

2018 ◽  
Vol 12 (17) ◽  
pp. 2119-2131 ◽  
Author(s):  
Haizhou Wang ◽  
Xingshu Chen ◽  
Wenxian Wang ◽  
Mei Ya Chan
Keyword(s):  
Overlay Network ◽  
Peer To Peer ◽  
Live Streaming ◽  
Systems Modelling ◽  
Streaming Systems

Usage of Broadcast Messaging in a Distributed Hash Table for Intrusion Detection

2011 ◽  
pp. 77-93
Author(s):  
Zoltán Czirkos ◽  
Gábor Hosszú
Keyword(s):  
Intrusion Detection ◽  
Intrusion Detection System ◽  
Detection System ◽  
High Reliability ◽  
Hash Table ◽  
User Interaction ◽  
Overlay Network ◽  
Peer To Peer ◽  
Transport Layer ◽  
Distributed Hash Table

In this chapter, the authors present a novel peer-to-peer based intrusion detection system called Komondor, more specifically, its internals regarding the utilized peer-to-peer transport layer. The novelty of our intrusion detection system is that it is composed of independent software instances running on different hosts and is organized into a peer-to-peer network. The maintenance of this overlay network does not require any user interaction. The applied P2P overlay network model enables the nodes to communicate evenly over an unstable network. The base of our Komondor NIDS is a P2P network similar to Kademlia. To achieve high reliability and availability, we had to modify the Kademlia overlay network in such a way so that it would be resistent to network failures and support broadcast messages. The main purpose of this chapter is to present our modifications and enhancements on Kademlia.

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.

scholarly journals A survey and comparison of peer-to-peer overlay network schemes

2005 ◽  
Vol 7 (2) ◽  
pp. 72-93 ◽  
Author(s):  
Eng Keong Lua ◽  
J. Crowcroft ◽  
M. Pias ◽  
R. Sharma ◽  
S. Lim
Keyword(s):  
Overlay Network ◽  
Peer To Peer
Sign in / Sign up

Export Citation Format

Share Document