Two Dimensional Continuous Time Markov Chain for Packet Traffic: A Newly Proposed Approach

Abstract

Packet traffic is analyzed based on two states continuous time Markovian chain where one state indicates overloaded and the other is
under loaded condition of the network. The sojourn time of a state follows exponential distribution. Still no specific Markov chain
exists for analysis of two dimensional packet traffic of combined link. In this paper a two dimentinal Markovian chain is proposed for
two different types of packet traffic on a common trunk link. Several methods are prevalent to solve such Markovian chain; this paper
gives a method based on Laplace Transform to solve the chain. Theoretical explanation of the paper will be helpful for a network
planar to allocate channels to support offered traffic of a network.