摘要：In this present era of networking, the different opportunities are being explored in order to maximize it's utilization within limited resources. It is in the benefit of the system that the same infrastructure should be utilized for more and more connections. The recent research works are going to explore all the possible options that are feasible. The existing option could be in the field of designing new scheduling algorithms. The work done by Moges and Robertazzi has developed the concept of divisible load scheduling and have shown its analogue with the Markov chain model. Working on the same line, in this paper, we are trying to predict the behavior of single level tree network with the help of Markov chain model. It will wave a path for network designer for it's application and use.
关键词：Markov chain model; Single level tree network; Divisible jobs; Divisible load ; scheduling; Supportive divisible load scheduling
