Level crossing ordering of Markov chains: computing end to end delays in an all optical network

• Authors: Ana Bušić;Tadeusz Czachórski;Jean-Michel Fourneau;Krzysztof Grochla
• Venue: Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
• Year: 2007

We advocate the use of level crossing ordering of Markov chains and we present two applications of this ordering to analyze the deflection routing in an all optical packet network. As optical storage of packets is not available, we assume that the routing protocol is based on deflection. This routing strategy does not allow packet loss. However it keeps the packets inside the network, increases the delay and reduces the bandwidth. Thus the transport delay distribution is the key performance issue for these networks. Here, we consider the deflection routing of a packet in a hypercube. First we assume that the deflection probability is known and we build an absorbing Markov chain to model the packet inside the network. Then we present a more abstract model of the topology and we show that under weak assumptions bounds on the deflection probability provide bounds on the end to end delay. This result is based on level-crossing comparison of Markov chains. Then we present an approximate model of the switch to obtain a fixed point system between two sub-models. The first subsystem describes the global network performance while the other one models the stochastic behavior of the packet. The fixed point system is solved by a numerical algorithm and the convergence of this algorithm is proved using again the theory of level crossing comparison of Markov chains. Proving convergence is a new application for the theory of Markov chain comparison and this example can be generalized to many algorithms based on Markov chains.