We study the expected self-stabilization time of Herman's algorithm. For N processors the lower bound is 4/27N(2) (0.148N(2)), and an upper bound of 0.64N(2) is presented in Kiefer et al. (2011) [4]. In this paper...
详细信息
We study the expected self-stabilization time of Herman's algorithm. For N processors the lower bound is 4/27N(2) (0.148N(2)), and an upper bound of 0.64N(2) is presented in Kiefer et al. (2011) [4]. In this paper we give a tighter upper bound 0.521N(2). (C) 2013 Published by Elsevier B.V.
Abstract This paper presents self-stabilizing statistical algorithm for validation and optimisation of communication channel. There is usually a need to transmit data describing some industrial process for purpose of ...
详细信息
Abstract This paper presents self-stabilizing statistical algorithm for validation and optimisation of communication channel. There is usually a need to transmit data describing some industrial process for purpose of archiving and/or remote evaluation of system performance quality. The communication self-stabilization is possible in multi-agent system (MAS) when certain data loss for remote user is acceptable. Communication overload especially in case of wireless transmission may cause unpredictable data loss. System may self-organize and reach some stable equilibrium point where communication load level and data loss is optimal. Perturbation in system usually does not change structure of the MAS but change equilibrium point that guarantees optimal performance.
暂无评论