Loading...
Please wait, while we are loading the content...
Similar Documents
Implementation of Election Algorithm for Asynchronous Complete Networks with Intermittent Link Failures
| Content Provider | Semantic Scholar |
|---|---|
| Author | Abu-Amaradepartment, Hosame |
| Abstract | A network is complete if every processor has a direct communication channel to every other processor. We consider the election problem on complete asynchronous networks when the processors are reliable while some of the channel s are subject to failure. In this paper, we have implemented Lokre's distributed election algorithm for faulty complete networks 1]. We built a complete network, designed the random generating software modules, and implemented the algorithm. We ran the program for several values of n and for various conngurations of the network. During each run we counted the number of messages passed, and the number of phases advanced before a leader was elected. For each value of n we did a best case, average case, and the worst case analysis of the number of messages passed. We compare the number of messages, and the number of phases advanced with the theoretical results. Doing this we show that the bounds proved by the algorithm are satissed. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.cs.tamu.edu/people/pkrishna/election.ps.Z |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
