Leader election in Peer-to-Peer systems

Obeidat, Atef A.; Gubarev, V.V.

doi:10.1109/sibcon.2009.5044825

Cited by 3 publications

(4 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Low Workload:A ll servers are already in lo wer utilizat ion than U l . In this case, first of all High Utilized Server (HUS) is selected by (6). Then election will be held among VMs identified by (7).…”

Section: Problem Formulati Onmentioning

confidence: 99%

See 1 more Smart Citation

Power Aware Reliable Virtual Machine Coordinator Election Algorithm in Service Oriented Systems

DanialRahdari¹,

Golmohammadi²,

AbasPirmoradi³

2013

IJIEEB

View full text Add to dashboard Cite

Abstract-Service oriented systems such as cloud computing are emerg ing widely even in people's daily life due to its magnificent advantages for enterprise and clients. However these computing paradig ms are challenged in many aspects such as power usage, availability, reliab ility and especially security. Hence a central controller existence is crucial in order to coordinate Virtual Machines (VM ) placed on physical resources. In this paper an algorithm is proposed to elect this controller among various VM wh ich is able to tolerate mult iple numbers of faults in the system and reduce power usage as well. Moreover the algorithm exchanges dramat ically fewer messages than other relevant proposed algorithms.

show abstract

Section: Problem Formulati Onmentioning

confidence: 99%

“…Leader election algorith ms are useful in various areas such as distributed systems for load balancing and to keep resource replicas consistent [6].…”

Section: Introductionmentioning

confidence: 99%

Power Aware Reliable Virtual Machine Coordinator Election Algorithm in Service Oriented Systems

DanialRahdari¹,

Golmohammadi²,

AbasPirmoradi³

2013

IJIEEB

View full text Add to dashboard Cite

show abstract

“…Many algorithms have been proposed for electing coordinators, such as ring [5], bully [6], Chang and Robert [7], Fran klin [8], and many other ones. R.Bakhshi [9,10] proposed an algorithm for electing coordinator in a network which based on assumptions that numbers aren't assigned to any processes and process's fault probability is zero.…”

Section: Related Workmentioning

confidence: 99%

Fault Tolerant Message Efficient Coordinator Election Algorithm in High Traffic Bidirectional Ring Network

Rahdari¹,

Rahmani²,

Arabshahi³

2012

IJITCS

View full text Add to dashboard Cite

Nowadays use of distributed systems such as internet and cloud computing is growing dramatically. Coordinator existence in these systems is crucial due to processes coordinating and consistency requirement as well. However the growth makes their election algorith m even more co mplicated. Too many algorith ms are proposed in this area but the two most well known one are Bully and Ring. In this paper we propose a fault tolerant coordinator election algorithm in typical bidirectional ring topology which is twice as fast as Ring algorithm although far fewer messages are passing due to election. Fault tolerance technique is applied which leads the waiting t ime for the election reaching to zero.

show abstract

“…They are used in distributed systems for load balancing and keeping resource replicas consistency [2]. When a coordinator crashes, some wait time is applied to processes supposed to communicate to coordinator.…”

Section: Introductionmentioning

confidence: 99%

A Distributed Fault Tolerance Global Coordinator Election Algorithm in Unreliable High Traffic Distributed Systems

Rahdari

Rahmani²,

Aboutaleby³

et al. 2015

IJITCS

View full text Add to dashboard Cite

-Distributed systems consist of several management sites which have different resource sharing levels. Resources can be shared among inner site and outer site processes at first and second level respectively. Global coordinator should exist in order to coordinate access to multi site's shared resources. Moreover; some other coordinators should manage access to inner site's shared resources so that exerting appropriate coordinator election algorithms in each level is crucial to achieve most efficient system. In this paper a hierarchical distributed election algorithm is proposed which eliminates single point of failure of election launcher. Meanwhile traffic is applied to network at different times and the number of election messages is extremely decreased as well which applies more efficiency especially in high traffic networks. A standby system between coordinators and their first alternative is considered to induct less wait time to processes which want to communicate with coordinator .

show abstract

Leader election in Peer-to-Peer systems

Cited by 3 publications

References 3 publications

Power Aware Reliable Virtual Machine Coordinator Election Algorithm in Service Oriented Systems

Power Aware Reliable Virtual Machine Coordinator Election Algorithm in Service Oriented Systems

Fault Tolerant Message Efficient Coordinator Election Algorithm in High Traffic Bidirectional Ring Network

A Distributed Fault Tolerance Global Coordinator Election Algorithm in Unreliable High Traffic Distributed Systems

Contact Info

Product

Resources

About