Markov chains state transitions for reliable persistent routing

The work presented in this article analyzes the Markov chain transition process for achieving reliable persistent routes. State representations of data packet traversals through networks, signify events that can be measured, tuned and optimized, in order to provide a reliability feature for communication infrastructures. These events are analyzed having a time based design criterion as a central logical unit, a management possibility that is defined by queuing theory applications in order to tune the data persistence reliability metric. As the main contribution of this paper represents an analytical model definition for designing real-time transmission reliability, the state representation of the persistence phenomenon in an established rout, represents a significant step forward in enabling end-to-end fault-tolerant communications.