Snap-Stabilizing Wave Algorithm with Multiple Initiators in Arbitrary Networks

Abstract

A wave is a distributed execution, often made up of a broadcast phase followed by a feedback phase, requiring the participation of all the system processes before a particular event called decision is taken. Solutions to a large number of problems such as globalsnapshots can be solved efficiently using multiple concurrent initiators. In this paper, we propose an optimal snapstabilizing algorithm, referred to as an mwave algorithm, that would be initiated by one or more initiator processes, essentially forming a collection of individual waves. Having multiple initiators enables a better reach and faster completion of broadcasted messages as a result. Our algorithm differs from existing multi-node broadcasting techniques in a few notable ways, such as working in any arbitrary network and having dynamic initiator processes that participate in an m-wave cycle depending on the presence of an external input. Being snap-stabilizing ensures the proposed algorithm always behaves according to its specification.