A self-stabilizing token circulation with graceful handover on bidirectional ring networks

H. Kakugawa, S. Kamei
{"title":"A self-stabilizing token circulation with graceful handover on bidirectional ring networks","authors":"H. Kakugawa, S. Kamei","doi":"10.1109/IPDPSW52791.2021.00093","DOIUrl":null,"url":null,"abstract":"In self-organizing distributed systems in which there is no centralized controler, cooperation of processes and fault-tolerance are crucial. The former can be formalized by process synchronization, which is one of the fundamental problems in concurrent, parallel and distributed computing. The latter can be formalized by self-stabilization. A self-stabilizing distributed algorithm is a class of fault tolerant distributed algorithms which tolerates finite number of any kind of transient faults. It can be considered as a self-organizing system because it does not need a globally synchronized initialization nor reset, and the system automatically converges to legitimate configuration.In this paper, we propose a self-stabilizing distributed algorithm for token ring with graceful handover on bidirectional ring network with message passing communication model. The motivation of this work is to design a protocol, by a formal approach, which is useful for self-organizing multi-node security camera system that guarantees continuous observation. More specifically, a system consists of several nodes each of which is equipped with a video camera, some of nodes are active in monitoring, and others are inactive to save energy. The problem is to design an algorithm with graceful handover of active nodes. That is, at least one node is active at any time, in other words, there is no time instant at which no node is active. This problem is formalized as the mutual inclusion problem, which is a process synchronization problem such that at least one process is in critical section. To this end, we propose an algorithm for circulating two tokens on bidirectional ring network with the locally shared memory model by extending Dijkstra’s self-stabilizing token ring. We also propose the concept of the model gap tolerance property for graceful handover. The proposed algorithm is self-stabilizing, and it guarantees graceful handover in message passing distributed system.","PeriodicalId":170832,"journal":{"name":"2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPDPSW52791.2021.00093","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In self-organizing distributed systems in which there is no centralized controler, cooperation of processes and fault-tolerance are crucial. The former can be formalized by process synchronization, which is one of the fundamental problems in concurrent, parallel and distributed computing. The latter can be formalized by self-stabilization. A self-stabilizing distributed algorithm is a class of fault tolerant distributed algorithms which tolerates finite number of any kind of transient faults. It can be considered as a self-organizing system because it does not need a globally synchronized initialization nor reset, and the system automatically converges to legitimate configuration.In this paper, we propose a self-stabilizing distributed algorithm for token ring with graceful handover on bidirectional ring network with message passing communication model. The motivation of this work is to design a protocol, by a formal approach, which is useful for self-organizing multi-node security camera system that guarantees continuous observation. More specifically, a system consists of several nodes each of which is equipped with a video camera, some of nodes are active in monitoring, and others are inactive to save energy. The problem is to design an algorithm with graceful handover of active nodes. That is, at least one node is active at any time, in other words, there is no time instant at which no node is active. This problem is formalized as the mutual inclusion problem, which is a process synchronization problem such that at least one process is in critical section. To this end, we propose an algorithm for circulating two tokens on bidirectional ring network with the locally shared memory model by extending Dijkstra’s self-stabilizing token ring. We also propose the concept of the model gap tolerance property for graceful handover. The proposed algorithm is self-stabilizing, and it guarantees graceful handover in message passing distributed system.
双向环网络上具有优美切换的自稳定令牌循环
在没有集中控制器的自组织分布式系统中,过程的协作和容错是至关重要的。前者可以通过进程同步形式化,进程同步是并发、并行和分布式计算的基本问题之一。后者可以通过自稳定形式化。自稳定分布式算法是一类容错的分布式算法,它能容忍有限数量的任意一种暂态故障。它可以被认为是一个自组织系统,因为它不需要全局同步的初始化或重置,并且系统自动收敛到合法配置。提出了一种基于消息传递通信模型的双向环网令牌环优雅切换自稳定分布式算法。本文的工作动机是通过形式化的方法设计一种协议,该协议可用于自组织多节点安全摄像机系统,保证连续观察。更具体地说,一个系统由几个节点组成,每个节点都配备一个摄像机,一些节点在监控中处于活动状态,而另一些节点则处于非活动状态以节省能源。问题是设计一种具有活动节点优美切换的算法。也就是说,在任何时间至少有一个节点处于活动状态,换句话说,不存在没有节点处于活动状态的时间瞬间。该问题形式化为互包含问题,即至少有一个进程处于临界段的进程同步问题。为此,我们通过扩展Dijkstra的自稳定令牌环,提出了一种利用局部共享内存模型在双向环网络上循环两个令牌的算法。提出了模型间隙容差特性的概念。该算法具有自稳定性,保证了消息传递分布式系统的优美切换。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信