By Topic

EPH: An Efficient and Robust Group Membership Topology for Distributed Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Madipadaga, R. ; Siemens Corp. Technol., Bangalore ; Bhaskaran, S. ; Mukherjee, S.

Group membership protocols in distributed systems enable entities in a group to be aware of all other entities in the group. This information is essential for the system to perform as a cohesive unit collaborating to achieve a common objective. In dynamic environments where devices join and leave the group frequently and failures occur, maintaining consistent group membership information efficiently is a non-trivial problem. We evaluate different logical topologies used to represent distributed systems and propose a group membership topology, extended polygonal hubs (EPH) which provides, 1) faster view convergence times and 2) better robustness characteristics compared to traditional hierarchical trees.

Published in:

Network Computing and Applications, 2008. NCA '08. Seventh IEEE International Symposium on

Date of Conference:

10-12 July 2008