Transitons of Markovian Process Through a Given Level
Gustav Cepciansky
DOI:
Abstract
This paper is a free continuation of [l] where properties of Markovian process were also dealt with. It may be necessary to determine the count of transitions through a given level and the mean time during that the random process persists over or below a chosen level. Traffic load estimations and predictions in dynamically controlled broadband networks may serve as an example of practical applications. Unlike of [l] where as many changes in the state of random process as possible shall be caught up, now we are only interested in those transitions which cross a chosen level.