Access the full text.
Sign up today, get DeepDyve free for 14 days.
Yuh-Shyan Chen, Chao-Yu Chiang, Che-Yi Chen (2004)
Multi-node broadcasting in all-ported 3-D wormhole-routed torus using an aggregation-then-distribution strategyJ. Syst. Archit., 50
D. Cokuslu, K. Erciyes, A. Hameurlain (2010)
A Maximum Degree Self-Stabilizing Spanning Tree Algorithm
M. Karaata, Anwar AlMutairi (2020)
A Snap-Stabilizing m-wave Algorithm for Tree NetworksComput. J., 63
S. Mane, S. Kandekar, B. Waphare (2018)
Constructing spanning trees in augmented cubesJ. Parallel Distributed Comput., 122
A. Richa, C. Scheideler (2012)
Stabilization, Safety, and Security of Distributed Systems, 7596
Yu Xiang, Hang Liu, Tian Lan, Howie Huang, S. Subramaniam (2021)
Optimizing Job Reliability Through Contention-Free, Distributed Checkpoint SchedulingIEEE Transactions on Network and Service Management, 18
Sukumar Ghosh, A. Bejan (2003)
A Framework of Safe Stabilization
M. Karaata (2019)
An open modal stabilizing m-wave algorithm for arbitrary networksJ. Parallel Distributed Comput., 128
Y. Sudo, A. Datta, L. Larmore, T. Masuzawa (2020)
Self-stabilizing token distribution on trees with constant spaceJ. Parallel Distributed Comput., 146
Florence Levé, K. Mohamed, V. Villain (2016)
Snap-Stabilizing PIF on Arbitrary Connected Networks in Message Passing Model
A. Bui, A. Datta, F. Petit, V. Villain (1999)
State-optimal snap-stabilizing PIF in tree networksProceedings 19th IEEE International Conference on Distributed Computing Systems
S. Delaët, S. Dolev, O. Peres (2009)
Safe and Eventually Safe: Comparing Self-stabilizing and Non-stabilizing Algorithms on a Common Ground
Alain Cournier, A. Datta, F. Petit, V. Villain (2005)
Optimal snap-stabilizing PIF algorithms in un-oriented treesJ. High Speed Networks, 14
Y. Afek, S. Dolev (1997)
Local stabilizerProceedings of the Fifth Israeli Symposium on Theory of Computing and Systems
S. Dolev, T. Herman (1995)
SuperStabilizing protocols for dynamic distributed systemsChic. J. Theor. Comput. Sci., 1997
B. Cheng, Jianxi Fan, Dajin Wang, Jiwen Yang (2015)
A Reliable Broadcasting Algorithm in Locally Twisted Cubes2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing
Qin Shi, X. Cui, Sihao Zhao, Shuang Xu, Mingquan Lu (2019)
BLAS: Broadcast Relative Localization and Clock Synchronization for Dynamic Dense Multiagent SystemsIEEE Transactions on Aerospace and Electronic Systems, 56
Fabien Viger, Matthieu Latapy (2005)
Efficient and simple generation of random simple connected graphs with prescribed degree sequenceJ. Complex Networks, 4
M. Usha, J. Sathiamoorthy, R. Ashween, B. Ramakrishnan (2020)
EEMCCP - A Novel Architecture Protocol Design for Efficient Data Transmission in Underwater Acoustic Wireless Sensor Network, 7
Yuh-Shyan Chen, T. Juang, Ying-Ying Shen (2000)
Multi-node broadcasting in an arrangement graph using multiple spanning treesProceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)
Abou-Bakr Djaker, Kechar Bouabdellah, Hatem Ibn-Khedher, Hassine Moungla, H. Afifi (2020)
Scalable and Cost Efficient Maximum Concurrent Flow over IoT using Reinforcement Learning2020 International Wireless Communications and Mobile Computing (IWCMC)
Sven Köhler, V. Turau (2010)
Fault-containing self-stabilization in asynchronous systems with constant fault-gapDistributed Computing, 25
A. Arora, M. Gouda (1994)
Distributed ResetIEEE Trans. Computers, 43
S. Mane, S. Kandekar, B. Waphare (2017)
Construction of Four Completely Independent Spanning Trees on Augmented CubesarXiv: Combinatorics
Muhammad Khan, N. Salman, A. Kemp, L. Mihaylova (2016)
Localisation of Sensor Nodes with Hybrid Measurements in Wireless Sensor NetworksSensors (Basel, Switzerland), 16
Sukumar Ghosh, Arobinda Gupta, T. Herman, S. Pemmaraju (2007)
Fault-containing self-stabilizing distributed protocolsDistributed Computing, 20
Lélia Blin, S. Tixeuil (2017)
Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkativeDistributed Computing, 31
E. Dijkstra (1974)
Self-stabilizing systems in spite of distributed controlCommun. ACM, 17
R. Prakash, M. Singhal (1994)
Maximal global snapshot with concurrent initiatorsProceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing
Doina Bein, A. Datta, M. Karaata (2005)
An optimal snap-stabilizing multi-wave algorithm25th IEEE International Conference on Distributed Computing Systems Workshops
(2006)
IEEE Transactions on Dependable and Secure Computing
Ching-Hsiang Chu, Xiaoyi Lu, A. Awan, H. Subramoni, J. Hashmi, B. Elton, D. Panda (2017)
Efficient and Scalable Multi-Source Streaming Broadcast on GPU Clusters for Deep Learning2017 46th International Conference on Parallel Processing (ICPP)
S. Sahana, Karan Singh (2020)
Cluster Based Localization Scheme with Backup Node in Underwater Wireless Sensor NetworkWireless Personal Communications, 110
Shmuel Katz, K. Perry (1993)
Self-stabilizing extensions for meassage-passing systemsDistributed Computing, 7
Jie Wu, W. Lou (2003)
Forward-node-set-based broadcast in clustered mobile ad hoc networksWirel. Commun. Mob. Comput., 3
Patricia Ruiz, P. Bouvry (2015)
Survey on Broadcast Algorithms for Mobile Ad Hoc NetworksACM Computing Surveys (CSUR), 48
Stéphane Devismes, C. Johnen (2019)
Self-Stabilizing Distributed Cooperative Reset2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS)
S. Delaët, S. Dolev, O. Peres (2009)
Safer Than Safe: On the Initial State of Self-stabilizing Systems
S Ghosh, A Gupta, S Pemmaraju (1996)
A fault-containing self-stabilizing algorithm for spanning treesJ Comput Inf, 2
S Dolev, T Herman (1997)
Superstabilizing protocols for dynamic distributed systemsThe Chicago Journal of Theoretical Computer Science, 3
Jun Zheng, Yik-Chung Wu (2010)
Joint Time Synchronization and Localization of an Unknown Node in Wireless Sensor NetworksIEEE Transactions on Signal Processing, 58
S. Kamei, H. Kakugawa (2018)
Self-Stabilizing Algorithm for Dynamically Maintaining Two Disjoint Dominating Sets2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)
S. Delaët, S. Tixeuil (2002)
Tolerating Transient and Intermittent FailuresJ. Parallel Distributed Comput., 62
Yonghwan Kim, Junya Nakamura, Y. Katayama, T. Masuzawa (2018)
A Cooperative Partial Snapshot Algorithm for Checkpoint-Rollback Recovery of Large-Scale and Dynamic Distributed Systems2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)
S. Kutten, B. Patt-Shamir (1997)
Time-adaptive self stabilization
Sukumar Ghosh, Arobinda Gupta, T. Herman, S. Pemmaraju (1996)
Fault-containing self-stabilizing algorithms
Shmuel Katz, K. Perry (1990)
Self-stabilizing extensions for message-passing systems
H. Kruijer (1979)
Self-Stabilization (in Spite of Distributed Control) in Tree-Structured SystemsInf. Process. Lett., 8
Sukumar Ghosh, Arobinda Gupta (1996)
An Exercise in Fault-Containment: Self-Stabilizing Leader ElectionInf. Process. Lett., 59
Weifeng Hao, Jiajie Zeng, Xiaohai Dai, Jiang Xiao, Qiang-Sheng Hua, Hanhua Chen, Kuan-Ching Li, Hai Jin (2020)
Towards a Trust-Enhanced Blockchain P2P Topology for Enabling Fast and Reliable BroadcastIEEE Transactions on Network and Service Management, 17
V. Turau (2017)
Computing the Fault-Containment Time of Self-Stabilizing Algorithms Using Markov Chains and Lumping
Y. Azar, S. Kutten, B. Patt-Shamir (2010)
Distributed error confinementACM Trans. Algorithms, 6
Khedidja Medani, M. Aliouat, Z. Aliouat (2017)
Fault tolerant time synchronization using offsets table robust broadcasting protocol for vehicular ad hoc networksAeu-international Journal of Electronics and Communications, 81
J. Beauquier, S. Delaët, S. Haddad (2006)
A 1-Strong Self-stabilizing Transformer
Minghu Zhang, Senzu Shen, Jianguo Shi, Ting Zhang (2008)
Simple clock synchronization for distributed real-time systems2008 IEEE International Conference on Industrial Technology
M. Gouda (2002)
Multiphase StabilizationIEEE Trans. Software Eng., 28
B. Cheng, Dajin Wang, Jianxi Fan (2017)
Constructing completely independent spanning trees in crossed cubesDiscret. Appl. Math., 219
Y. Tseng (1997)
Multi-node broadcasting in hypercubes and star graphsProceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing
Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations
Shuo-I Wang, Fu-Hsing Wang (2017)
Independent Spanning Trees in RTCC-PyramidsComput. J., 60
J Nakamura, Y Kim, Y Katayama, T Masuzawa (2020)
A cooperative partial snapshot algorithm for checkpoint-rollback recovery of large-scale and dynamic distributed systems and experimental evaluationsConcurrency and Computation: Practice and Experience, 33
In this paper, we propose the first self-stabilizing c-wave algorithm for broadcasting large size messages from multiple initiator processes such that every process receives at least one of these messages broadcast by the initiators. The proposed algorithm first splits each message into a sequence of message shares and then broadcasts the message shares in a pipelined manner in order. We then present an improved maximally concurrent self-stabilizing c-wave algorithm called dynamic clusteringc-wavealgorithm that constructs dynamic broadcast trees by allowing a process to dynamically change its parent to a neighbouring process with the most message shares to implement a maximally concurrent broadcasting of large size messages. The improved algorithm is maximally concurrent in the sense that a process is allowed to receive a message share from any neighbouring process with a larger sequence of message shares than its current parent from which it receives message shares in the broadcast trees constructed by the initiators when available. We implemented and experimentally evaluated the c-wave algorithm to compare its message propagation delay to those of the m and the k-wave algorithms. Simulation results show that the proposed algorithm significantly reduces the broadcast propagation delays compared to that of the m and the k-wave algorithms. The improvement is more evident over the m-wave algorithm. Solutions to global-snapshots, distributed broadcast and various synchronization problems can be solved efficiently using c-wave algorithms. In addition, the proposed algorithms have applications in blockchain, mobile wireless sensor networks, VANETs and military communication networks.
Computing – Springer Journals
Published: Jan 1, 2023
Keywords: c-wave; Distributed computing; Multi-node broadcast; m-wave; Self-stabilization; Wave algorithms; 68M12; 68M14; 68W15
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.