Please use this identifier to cite or link to this item:
Fulltext available Open Access
Title: A self-stabilizing algorithm for virtual ring construction
Language: English
Authors: Paulsen, Hans-Peter 
Siegemund, Gerry 
Keywords: self-stabilization; virtual ring; distributed algorithm
Issue Date: 14-Apr-2016
Abstract (german): 
Diese Arbeit präsentiert SelfVRC, einen selbststabilisierenden, verteilten Algorithmus zum bestimmen von virtuellen Ringen in verbundenen ungewichteten Graphen.
Abstract (english): 
This paper presents a self-stabilizing, distributed algorithm for finding a virtual ring in a connected unweighted graph, named SelfVRC. A virtual ring allows routing without knowing the topology of the underlying network. All network nodes know their own positions on the ring as well as those of their neighbors. While self-stabilizing algorithms that construct a virtual ring exist, little work has been done in minimizing its length. SelfVRC was evaluated with different fair and unfair schedulers. It stabilizes in O(n) rounds. The resulting ring is not longer than 2(n − 1) and is on average significantly shorter.
Cycles in the underlying graph are utilized to reduce the length of the virtual ring. SelfVRC depends on unique node identifiers and a root node.
Conference: 7. IEEE Germany Student Conference 2016 
DOI: 10.15480/882.1314
Institute: Telematik E-17 
Document Type: Chapter/Article (Proceedings)
Project: Tolerance-Zone - Fehlertolerante Middleware-Idiome basierend auf selbststabilisierenden Techniken 
License: In Copyright In Copyright
Appears in Collections:Publications with fulltext

Files in This Item:
File Description SizeFormat
SelfVRC.pdf780,58 kBAdobe PDFView/Open
Show full item record

Page view(s)

Last Week
Last month
checked on May 31, 2023


checked on May 31, 2023

Google ScholarTM


Note about this record

Cite this record


Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.