Snap-Stabilizing Wave Algorithm with Multiple Initiators in Arbitrary Networks

Ganesh Nandakumaran; Mehmet Hakan Karaata

doi:10.4028/www.scientific.net/AMR.905.619

Paper Titles

An Energy Efficient Communication Routing Protocol Based on LEACH for WSN
p.595

Analysis and Optimization of Rail Vehicles Networked Control System Based on Static Scheduling Algorithm
p.600

Multiuser Detection with Delay Feedback Scheme for Asynchronous Cooperative Networks
p.611

Research and Implementation on CDR Synthesis Scheme of GTPV2 Protocol in LTE Network
p.615

Snap-Stabilizing Wave Algorithm with Multiple Initiators in Arbitrary Networks
p.619

The Improvement of MIPv6 Protocol with Point-to-Point Tactics
p.623

The Development of a Local Area Network Communication Software Based on Peer-to-Peer Mode
p.627

The Remote Management System for Greenhouses Based on 3G and Power Line Carrier
p.631

A Survey of Using Weakly Supervised and Semi-Supervised for Cross-Domain Sentiment Classification
p.637

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 905Snap-Stabilizing Wave Algorithm with Multiple...

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.

You might also be interested in these eBooks

Advances in Applied Materials and Electronics Engineering III

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 905)

Pages:

619-622

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.905.619

Citation:

Cite this paper

Online since:

April 2014

Authors:

Ganesh Nandakumaran*, Mehmet Hakan Karaata

Keywords:

Distributed Computing, Multi Node Broadcast, Propagation of Information with Feedback and Cleaning (PFC), Self-Stabilization, Wave Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] D. Bein, A. Datta, M. Karaata, and S. Zaman, An optimal snap-stabilizing multi-wavealgorithm, in Distributed Computing Systems Workshops, 2005. 25th IEEE InternationalConference on, 2005, p.35–41.

DOI: 10.1109/icdcsw.2005.39

Google Scholar

[2] R. Prakash, M. Singhal, Maximal global snapshot with concurrent initiators, (1994).

Google Scholar

[3] Y. -S. Chen, T. -Y. Juang, and Y. -Y. Shen, Multi-node broadcasting in an arrangementgraph using multiple spanning trees, in Parallel and Distributed Systems, Proceedings. Seventh International Conference on, 2000, p.213–220.

DOI: 10.1109/icpads.2000.857701

Google Scholar