Adobe PDF (185.08 kB)
Title Details:
Hostile nodes in graphs and memoryless
Authors: Markou, Evripidis
Kranakis, Evangelos
Pagourtzis, Aristeidis
Krizanc, Danny
Reviewer: Nikolopoulos, Stavros
Description:
Abstract:
Models of powerful hostile nodes (Byzantine black holes). Algorithms for exploring rings in which Byzantine black holes exist. Classification of hostile node capabilities. Report on problems with hostile agents.
Type: Chapter
Creation Date: 2015
Item Details:
License: http://creativecommons.org/licenses/by-nc-nd/3.0/gr
Handle http://hdl.handle.net/11419/5776
Bibliographic Reference: Markou, E., Kranakis, E., Pagourtzis, A., & Krizanc, D. (2015). Hostile nodes in graphs and memoryless [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/5776
Language: Greek
Is Part of: Algorithmic theory of distributed computing
Publication Origin: Kallipos, Open Academic Editions