Leader election algorithms for three dimensions torus networks with the presence of one or two links failure
Other Title(s)
خوارزميات انتخاب القائد للشبكات المحدبة ثلاثية الأبعاد في حالة وجود عطل في وصلة أو وصلتين
Dissertant
Thesis advisor
Comitee Members
Kanan, Ghassan
Kasasibah, Basil
al-Bahadly, Husayn
University
Amman Arab University
Faculty
Collage of Computer Sciences and Informatics
Department
Department of Computer Science
University Country
Jordan
Degree
Ph.D.
Degree Date
2012
English Abstract
Leader election is a very important algorithm in wired and wireless networks.
It is used to solve the single point failure in distributed systems when one process which called leader is responsible to coordinate and manage the whole network.
The leader election algorithms solve the instability problem in the network, which is caused by leader failure.
The algorithm aims to find a new leader identified by some characteristics from all other nodes.
When the algorithm is terminated, the network is returned to a stable state with one node detected as a leader, All the other nodes will be in formed to be aware of this leader.
The algorithm starts by one or more processes who detect that the leader process is failed for any reason like battery age, CPU speed, memory…etc .
It terminates when all nodes know who the new leader is.
The research work reported here is concerned with building and designing two leader election algorithms, to contribute in solving leader crash problem in three dimensional torus networks.
The algorithms solve the problem in presence of one/two link failure.
Many issues are considered when designing these algorithms, For instance, Collision avoidance mechanisms which may decrease the message and time complexity, and messages synchronization which may help in concurrent execution overall the network.
Algorithm performance is evaluated by calculating the number of messages and time steps overall the algorithms.
In a network of N nodes connected by a three dimensional torus network, the performance is evaluated in simple case, when leader failure is detected by one node and In the worst case, when leader failure is detected by (N-1) nodes.
For all cases the number of messages is O(N) in steps.
This result is valid even in the presence of one or two links failure.
Simulation model is used to proof the result of mathematical analysis
Main Subjects
Topics
No. of Pages
145
Table of Contents
Table of contents.
Abstract.
Abstract in Arabic.
Chapter One : Overview.
Chapter Two : Approaches to interconnection networks and topologies.
Chapter Three : Literature review.
Chapter Four : New leader election algorithms in 3d torus.
Chapter Five : Algorithms performance evaluation.
Chapter Six : Conclusion and future work.
References.
American Psychological Association (APA)
al-Hammuri, Abd al-Khaliq. (2012). Leader election algorithms for three dimensions torus networks with the presence of one or two links failure. (Doctoral dissertations Theses and Dissertations Master). Amman Arab University, Jordan
https://search.emarefa.net/detail/BIM-528683
Modern Language Association (MLA)
al-Hammuri, Abd al-Khaliq. Leader election algorithms for three dimensions torus networks with the presence of one or two links failure. (Doctoral dissertations Theses and Dissertations Master). Amman Arab University. (2012).
https://search.emarefa.net/detail/BIM-528683
American Medical Association (AMA)
al-Hammuri, Abd al-Khaliq. (2012). Leader election algorithms for three dimensions torus networks with the presence of one or two links failure. (Doctoral dissertations Theses and Dissertations Master). Amman Arab University, Jordan
https://search.emarefa.net/detail/BIM-528683
Language
English
Data Type
Arab Theses
Record ID
BIM-528683
