Self-stabilizing depth-first token circulation on networks without fair scheduling assumption

碩士 === 元智大學 === 電資與資訊工程研究所 === 86 === This thesis proposes a self-stabilizing protocol which circulates a token on a connected network in nondeterministic depth-first-search order, rooted at a special node. Starting with any initial state in which the network may have no token at all or m...

Full description

Bibliographic Details
Main Authors: Chen-Kuo Yang, 楊鎮國
Other Authors: Ji-Cherng Lin
Format: Others
Language:zh-TW
Online Access:http://ndltd.ncl.edu.tw/handle/04624364680556141698
Description
Summary:碩士 === 元智大學 === 電資與資訊工程研究所 === 86 === This thesis proposes a self-stabilizing protocol which circulates a token on a connected network in nondeterministic depth-first-search order, rooted at a special node. Starting with any initial state in which the network may have no token at all or more than one token, the protocol eventually makes the system stabilize in states having exactly one circulating token. In each of existing solutions for the self-stabilizing token circulation problem, a fair daemon is assumed. However, in the proposed protocol, we eliminate the assumption.