Deadlocks are a persistent problem in distributed queueing networks due to dynamic workloads, shared resource contention, and nondeterministic execution. Conventional deadlock detection techniques are predominantly reactive and rely on deterministic rules, which limits their effectiveness in highly dynamic environments. This study proposes a Markov-based proactive deadlock detection system that estimates deadlock risk using probabilistic state modeling. The system is modeled as a stochastic process under the Markov assumption, where future system behavior depends only on the current state. System metrics such as resource utilization, traffic intensity, and queue contention are mapped to probabilistic indicators that approximate state transition likelihoods. Using Markov-based probability estimation, the likelihood of transitioning from a safe state to a deadlockprone state is continuously evaluated. These probabilistic outputs are combined into a unified deadlock risk score and integrated with machine learning classifiers to improve detection accuracy. Simulation experiments conducted under varying contention and workload conditions show that the proposed approach achieves an average detection accuracy of 91.8%, precision of 89.4%, and recall of 93.1%, while detecting deadlock-prone states 22–30% earlier than traditional reactive methods. The results demonstrate that Markov-based probabilistic state modeling effectively captures uncertainty and dynamic system behavior, enabling proactive deadlock detection and improved system reliability in distributed queueing networks.
Deadlocks occur when a group of processes wait indefinitely for resources held by others, forming a dependency cycle that halts system progress. In distributed systems, deadlocks are particularly challenging to detect and resolve due to their complexity and asynchronous nature, leading to system inefficiencies and potential service disruptions. Traditional methods typically address deadlocks reactively, resulting in increased downtime and resource wastage. This study proposes a proactive approach that integrates Graph Neural Networks (GNNs) and consensus algorithms to detect and prevent deadlocks in distributed systems. GNNs analyze real-time system states by modeling the dependencies between processes and resource allocations, enabling early prediction of deadlock-prone situations. Consensus algorithms then coordinate distributed nodes to agree on unified prevention strategies, ensuring reliable system-wide coordination. System logs, resource allocation states, and communication traces from a simulated distributed environment and encoded into graph structures for training and evaluation of the GNN model. The experimental results demonstrate that the proposed framework achieves a highest reduction in deadlock occurrences, improved prediction accuracy, and enhanced overall system performance compared to traditional reactive methods. Furthermore, the approach shows superior scalability and adaptability to dynamic changes, reducing system downtime and manual intervention.
Deadlocks remain a significant challenge in distributed and cloud-based computing systems, where concurrent processes compete for limited resources, potentially leading to service unavailability and cascading system failures. This issue is particularly critical in systems supporting societal infrastructure, where reliability and timely response are essential. Conventional deadlock handling techniques are largely reactive, detecting deadlocks only after system performance has already degraded. This limitation motivates the need for predictive approaches that can identify deadlock-prone states in advance. This research presents a predictive deadlock prevention framework based on probabilistic state modeling using Markov processes. System execution is represented as a sequence of state transitions derived from observed resource allocation and waiting behaviors. Transition probabilities are used to estimate the likelihood of entering deadlock-prone states, enabling early identification of high-risk conditions prior to deadlock formation. The proposed model is evaluated using experimentally generated system traces under varying levels of resource contention. Performance is assessed using classification accuracy, precision, and recall. The results show that the model achieves measurable predictive accuracy while maintaining a balanced ability to detect deadlock-prone states and limit false alarms. These findings indicate that probabilistic state-based modeling provides an interpretable and computationally lightweight foundation for proactive deadlock prevention. This work establishes a baseline predictive framework for deadlock management and highlights its potential for extension using more advanced learning techniques to improve prediction accuracy and scalability in complex cloud environments by safeguarding societal infrastructure.