Performance evaluation of Recursive Distributed Rendezvous based service discovery for Peer-to-Peer Session Initiation Protocol

2012 ◽  
Vol 56 (5) ◽  
pp. 1612-1626 ◽  
Author(s):  
Jouni Mäenpää
Keyword(s):  
Performance Evaluation ◽  
Service Discovery ◽  
Session Initiation Protocol ◽  
Peer To Peer

scholarly journals A Peer-to-Peer Architecture for Remote Service Discovery

2012 ◽  
Vol 10 ◽  
pp. 976-983 ◽  
Author(s):  
Stefan D. Bruda ◽  
Farzad Salehi ◽  
Yasir Malik ◽  
Bessam Abdulrazak
Keyword(s):  
Service Discovery ◽  
Peer To Peer

Capacity and load-aware service discovery with service selection in peer-to-peer grids

2012 ◽  
Vol 28 (7) ◽  
pp. 1090-1099 ◽  
Author(s):  
Neeraj Kumar ◽  
Rahat Iqbal ◽  
Naveen Chilamkurti
Keyword(s):  
Service Discovery ◽  
Service Selection ◽  
Peer To Peer

Peer-to-Peer Service Discovery for Grid Computing

2012 ◽  
pp. 232-259
Author(s):  
Eddy Caron ◽  
Frédéric Desprez ◽  
Franck Petit ◽  
Cédric Tedeschi
Keyword(s):  
Fault Tolerance ◽  
Load Balancing ◽  
Service Discovery ◽  
Large Scale ◽  
Dynamic Networks ◽  
Peer To Peer ◽  
Indexing System ◽  
Key Points ◽  
Computing Platforms ◽  
Traditional Approaches

Within distributed computing platforms, some computing abilities (or services) are offered to clients. To build dynamic applications using such services as basic blocks, a critical prerequisite is to discover those services. Traditional approaches to the service discovery problem have historically relied upon centralized solutions, unable to scale well in large unreliable platforms. In this chapter, we will first give an overview of the state of the art of service discovery solutions based on peer-to-peer (P2P) technologies that allow such a functionality to remain efficient at large scale. We then focus on one of these approaches: the Distributed Lexicographic Placement Table (DLPT) architecture, that provide particular mechanisms for load balancing and fault-tolerance. This solution centers around three key points. First, it calls upon an indexing system structured as a prefix tree, allowing multi-attribute range queries. Second, it allows the mapping of such structures onto heterogeneous and dynamic networks and proposes some load balancing heuristics for it. Third, as our target platform is dynamic and unreliable, we describe its powerful fault-tolerance mechanisms, based on self-stabilization. Finally, we present the software prototype of this architecture and its early experiments.

Sign in / Sign up

Export Citation Format

Share Document