There are many variants of leader election algorithm in distributed networks. In this research, an agent based approach to leader election in distributed networks is investigated. Agents have shown to be useful in several ways. In the theoretical perspective, agents sometime help in reducing the message complexity of the system and sometimes help in lowering time complexity. In a more practical sense, agents perform operations independent of the processors, thereby lending a more flexible algorithm supporting different types of networks.
| Identifer | oai:union.ndltd.org:TEXASAandM/oai:repository.tamu.edu:1969.1/287 |
| Date | 30 September 2004 |
| Creators | Tandon, Raghav |
| Contributors | In, Hoh, Reddy, A. L. Narasimha, Liu, Jyh-Charn (Steve) |
| Publisher | Texas A&M University |
| Source Sets | Texas A and M University |
| Language | en_US |
| Detected Language | English |
| Type | Electronic Thesis, text |
| Format | 203889 bytes, 69734 bytes, electronic, application/pdf, text/plain, born digital |
Page generated in 0.0017 seconds