pith. sign in

arxiv: 1207.1337 · v1 · pith:7WEOIVAYnew · submitted 2012-07-05 · 💻 cs.DC

Optimization in a Self-Stabilizing Service Discovery Framework for Large Scale Systems

classification 💻 cs.DC
keywords discoverydistributedself-stabilizingdesignedframeworkserviceservicessystems
0
0 comments X
read the original abstract

Ability to find and get services is a key requirement in the development of large-scale distributed sys- tems. We consider dynamic and unstable environments, namely Peer-to-Peer (P2P) systems. In previous work, we designed a service discovery solution called Distributed Lexicographic Placement Table (DLPT), based on a hierar- chical overlay structure. A self-stabilizing version was given using the Propagation of Information with Feedback (PIF) paradigm. In this paper, we introduce the self-stabilizing COPIF (for Collaborative PIF) scheme. An algo- rithm is provided with its correctness proof. We use this approach to improve a distributed P2P framework designed for the services discovery. Significantly efficient experimental results are presented.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.