NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
Implementation of election algorithm for asynchronous complete networks with intermittent link failures
| dc.creator | Krishna, P. | |
| dc.date.accessioned | 2012-06-07T22:32:25Z | |
| dc.date.available | 2012-06-07T22:32:25Z | |
| dc.date.created | 1993 | |
| dc.date.issued | 1993 | |
| dc.identifier.uri | https://hdl.handle.net/1969.1/ETD-TAMU-1993-THESIS-K924 | |
| dc.description | Due to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to digital@library.tamu.edu, referencing the URI of the item. | en |
| dc.description | Includes bibliographical references. | en |
| dc.description.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 channels are subject to failure. In this thesis, we have implemented Lokre's distributed election algorithm for faulty complete networks [1]. Lokre's algorithm works as long as each node has at most f faulty links incident on it, f < (n-1)/2 where n is the number of nodes in the network. The algorithm uses at most 0(n 2 + nf 2) messages to elect a unique leader of the network. Each message consists of at most 0(logITI) bits, where ITI is the cardinality of the set of node identifiers. 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 configurations 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 compared 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 satisfied. | en |
| dc.format.medium | electronic | en |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.publisher | Texas A&M University | |
| dc.rights | This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries in 2008. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. | en |
| dc.subject | electrical engineering. | en |
| dc.subject | Major electrical engineering. | en |
| dc.title | Implementation of election algorithm for asynchronous complete networks with intermittent link failures | en |
| dc.type | Thesis | en |
| thesis.degree.discipline | electrical engineering | en |
| thesis.degree.name | M.S. | en |
| thesis.degree.level | Masters | en |
| dc.type.genre | thesis | en |
| dc.type.material | text | en |
| dc.format.digitalOrigin | reformatted digital | en |
Files in this item
This item appears in the following Collection(s)
-
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.