METHOD FOR LEADER NODE SELECTION AND PROCESSING PIPELINE FORMATION IN DISTRIBUTED TELECOMMUNICATION SYSTEMS
DOI:
https://doi.org/10.18372/2310-5461.66.20311Keywords:
distributed telecommunication systems (DTS), self-organization, optimization, network, topology, fault tolerance, latency, algorithms, computational capacity, clusterAbstract
The paper proposes a method for selecting the master node (coordinator) in distributed telecommunication systems (DTS) with a clustered architecture and pipeline-based data processing. The method is aimed at ensuring stable data flow management within a cluster under conditions of dynamically changing workloads, network instability, and limited computational resources. Unlike classical leader election procedures that rely on global synchronization or broadcast-based voting algorithms, the proposed approach implements deterministic coordinator selection based on local node ranking, taking into account latency metrics, computational capacity, and unique identifiers.
As part of the proposed method, the Gossip-based leader election algorithm has been enhanced by integrating mechanisms for periodic metric exchange, local candidate ranking, pre-assignment of backup nodes, and automatic control transfer in case of coordinator failure. The algorithm maintains the current state of nodes as local lists and uses heartbeat-type control messages to confirm the coordinator’s activity. To prevent redundant message propagation, mechanisms such as Time-To-Live (TTL) and iteration markers have been introduced, which eliminate the circulation of outdated data.
Experimental modeling shows that the improved algorithm achieves full data convergence in a 50-node cluster within 4–6 seconds, demonstrates high resilience to message loss (≤1%), and ensures minimal delay during automatic coordinator reassignment. Compared to the fast Bully algorithm, the proposed approach reduces total control recovery traffic by up to 18% and significantly improves cluster stability under frequent topology changes.
Thus, the proposed method enables effective management of clustered DTS with pipeline processing without initiating explicit election procedures, making it suitable for deployment in scalable and high-load telecommunication environments.
References
Attiya, H., & Welch, J. (2004). Distributed Computing: Fundamentals, Simulations, and Advanced Topics. A JOHN WILEY & SONS, INC., PUBLICATION, Р. 414 http://lib.ysu.am/disciplines_bk/c95d04e111f3e28ae4cc589bfda1e18b.pdf
Chandrakant K., Piwowarek G. (2024) Consensus Algorithms in Distributed Systems, https://www.baeldung.com/cs/consensus-algorithms-distributed-systems
Ongaro D., Ousterhout J. (2014) In Search of an Understandable Consensus Algorithm// https://web.stanford.edu/~ouster/cgi-bin/papers/raft-atc14.pdf
Tel, G. (2000). Introduction to Distributed Algorithms. Cambridge University Press, https://doi.org/10.1017/CBO9781139168724
Bakhshi, R., et al. (2008) Leader Election in Anonymous Rings: Franklin Goes Probabilistic// IFIP International Federation for Information Processing, Volume 273; PP. 57–72, https://satoss.uni.lu/members/jun/papers/TCS08.pdf
Chang, Y.-J., & Jiang, S. (2022). The Energy Complexity of Las Vegas Leader Election. Computer Science - Data Structures and Algorithms, DOI: 10.48550/arXiv.2205.08642
Dolev, S., Israeli, A., & Moran, S. (1997). Uniform dynamic self-stabilizing leader election. IEEE Transactions on Parallel and Distributed Systems ( Volume: 8, Issue: 4, April 1997), РР. 424 – 440, DOI: 10.1109/71.588622
Gilbert, S., Robinson, P., & Sourav, S. (2019). Leader Election in Well-Connected Graphs. Computer Science. Distributed, Parallel, and Cluster Computing, https://doi.org/10.48550/arXiv.1901.00342
Khan, M. S., & Ahmad, I. (2016). A Dynamic Leader Election Algorithm for Decentralized Networks, Journal of Computer and Communications, Vol.4 No.1, January 2016, DOI: 10.4236/jcc.2016.41001.
Kim, T. W., & Kim, T. Y. (1995). Predictable Leader Election Algorithm, Concurrent Engineering, Volume 3, Issue 3, https://doi.org/10.1177/1063293X9500300305
Kowalski, D. R., & Mosteiro, M. A. (2021). Time and Communication Complexity of Leader Election in Anonymous Networks. Computer Science. Distributed, Parallel, and Cluster Computing, https://doi.org/10.48550/arXiv.2101.04400
Lavault, C., & Louchard, G. (2006). Asymptotic Analysis of a Leader Election Algorithm. Computer Science. Distributed, Parallel, and Cluster Computing, https://doi.org/10.48550/arXiv.cs/0607032
BeaulahSoundarabai, P., Thriveni, J., Venugopal, K. R., & Patnaik, L. M. (2013). An Improved Leader Election Algorithm for Distributed Systems. International Journal of Next-Generation Networks (IJNGN) Vol.5, No.1, March 2013, https://airccse.org/journal/ijngn/papers/5113ijngn02.pdf
Ulukök Mehtap Köse, Sarıyıldız İrfan, Evri Vesile (2024) Hybrid Raft-PoW Blockchain Consensus Algorithm// IEEE Access, P.P(99):1-1, DOI:10.1109/ACCESS.2025.3562725
Syvolovskyi, I. M., Lysechko V. P. (2025) A method of hierarchical clustering of nodes in distributed telecommunication systems using graph algorithms.
16. 2025. National University «Yuri Kondratyuk Poltava Polytechnic». Control, Navigation and Communication Systems, 2(80).
Hirschberg, D. S., & Sinclair, J. B. (1980). Decentralized Extrema-Finding in Circular Configurations of Processors. Communications of the ACM, 1980, Vol 23, Issue 11, Р. 627, https://dl.acm.org/doi/pdf/10.1145/359024.359029
