Adobe PDF
(136.99 kB)
| Title Details: | |
|
Fundamental problems and algorithms with immobile agents |
|
| Authors: |
Markou, Evripidis Kranakis, Evangelos Pagourtzis, Aristeidis Krizanc, Danny |
| Reviewer: |
Nikolopoulos, Stavros |
| Description: | |
| Abstract: |
This chapter presents and analyzes basic concepts and models of distributed computing with immobile agents and message exchange. The Broadcast Problem. Presentation of algorithms in synchronous and asynchronous networks and complexity analysis. The Leader Election Problem. Negative results. Leader election in trees, rings, complete graphs, and other special categories of graphs. Presentation of algorithms and complexity analysis in synchronous and asynchronous networks. Distributed computing and problems in fault-tolerant networks. Types and models of failures. Node and edge failures. Malicious nodes. Negative results. Fault-tolerant algorithms and complexity analysis in synchronous and asynchronous networks.
|
| Type: |
Chapter |
| Creation Date: | 2015 |
| Item Details: | |
| License: |
http://creativecommons.org/licenses/by-nc-nd/3.0/gr |
| Handle | http://hdl.handle.net/11419/5771 |
| Bibliographic Reference: | Markou, E., Kranakis, E., Pagourtzis, A., & Krizanc, D. (2015). Fundamental problems and algorithms with immobile agents [Chapter]. In Markou, E., Kranakis, E., Pagourtzis, A., & Krizanc, D. 2015. Algorithmic theory of distributed computing [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/5771 |
| Language: |
Greek |
| Is Part of: |
Algorithmic theory of distributed computing |
| Publication Origin: |
Kallipos, Open Academic Editions |