Stabilizing Graph Algorithms

Mehmet Hakan Karaata

ISBN 10: 365980424X / ISBN 13: 9783659804243

Published by LAP LAMBERT Academic Publishing Jul 2016, 2016

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -A distributed system consists of a set of loosely connected processes that do not share a global memory. The task of many open distributed systems is to guarantee an invariance relationship over the states of the system, and the states of the environment influencing that system. When the invariant holds, the state of the system is legal; otherwise it is illegal. Occasionally, the actions of the environment perturbs the state of the system and puts it into an illegal state-this is viewed as a transient failure. A self-stabilizing system guarantees that, regardless of the current state, the system returns to a legal state in a bounded number of steps. Due to this property, self-stabilizing systems can beused to deal with variety of faults in distributed systems. This dissertation deals with devising self-stabilizing distributed systems for a variety of graph theoretic problems. These include graph coloring, center and median finding, and maxima finding problems. The proposed solutions tolerate dynamic changes in the topology of the network. 80 pp. Englisch.

Seller Inventory # 9783659804243

Bibliographic Details

• Title: Stabilizing Graph Algorithms
• Publisher: LAP LAMBERT Academic Publishing Jul 2016
• Publication Date: 2016
• Language: English
• ISBN 10: 365980424X
• ISBN 13: 9783659804243
• Binding: Taschenbuch
• Condition: Neu

About this title

Synopsis

A distributed system consists of a set of loosely connected processes that do not share a global memory. The task of many open distributed systems is to guarantee an invariance relationship over the states of the system, and the states of the environment influencing that system. When the invariant holds, the state of the system is legal; otherwise it is illegal. Occasionally, the actions of the environment perturbs the state of the system and puts it into an illegal state-this is viewed as a transient failure. A self-stabilizing system guarantees that, regardless of the current state, the system returns to a legal state in a bounded number of steps. Due to this property, self-stabilizing systems can beused to deal with variety of faults in distributed systems. This dissertation deals with devising self-stabilizing distributed systems for a variety of graph theoretic problems. These include graph coloring, center and median finding, and maxima finding problems. The proposed solutions tolerate dynamic changes in the topology of the network.

About the Author

Mehmet Hakan Karaata received his PhD degree in Computer Science in 1995 from the University of Iowa. He joined Bilkent University, Ankara, Turkey as an Assistant Professor in 1995. He is currently working as a Professor in the Department of Computer Engineering, Kuwait University. His research interests include mobile and distributed computing.