<abstract xml:lang="en" xmlns="http://www.w3.org/1999/xhtml">This paper describes an analytical study of open two-node (tandem) network models with blocking and truncation. The study is based on semi-Markov process theory, and network models assume that multiple servers serve each queue. Tasks arrive at the tandem in a Poisson fashion at the rate λ, and the service times at the first and the second node are non-exponentially distributed with means <italic>sA</italic> and <italic>sB</italic>, respectively. Both nodes have buffers with finite capacities. In this type of network, if the second buffer is full, the accumulation of new tasks by the second node is temporarily suspended (a blocking factor) and tasks must wait on the first node until the transmission process is resumed. All new tasks that find the first buffer full are turned away and are lost (a truncation factor). First, a Markov model of the tandem is investigated. Here, a two-dimensional state graph is constructed and a set of steady-state equations is created. These equations allow calculating state probabilities for each graph state. A special algorithm for transforming the Markov model into a semi-Markov process is presented. This approach allows calculating steady-state probabilities in the semi-Markov model. Next, the algorithms for calculating the main measures of effectiveness in the semi-Markov model are presented. In the numerical part of this paper, the author investigates examples of several semi-Markov models. Finally, the results of calculating both the main measures of effectiveness and quality of service (QoS) parameters are presented.</abstract>

This paper describes an analytical study of open two-node (tandem) network models with blocking and truncation. The study is based on semi-Markov process theory, and network models assume that multiple servers serve each queue. Tasks arrive at the tandem in a Poisson fashion at the rate λ, and the service times at the first and the second node are non-exponentially distributed with means sA and sB, respectively. Both nodes have buffers with finite capacities. In this type of network, if the second buffer is full, the accumulation of new tasks by the second node is temporarily suspended (a blocking factor) and tasks must wait on the first node until the transmission process is resumed. All new tasks that find the first buffer full are turned away and are lost (a truncation factor). First, a Markov model of the tandem is investigated. Here, a two-dimensional state graph is constructed and a set of steady-state equations is created. These equations allow calculating state probabilities for each graph state. A special algorithm for transforming the Markov model into a semi-Markov process is presented. This approach allows calculating steady-state probabilities in the semi-Markov model. Next, the algorithms for calculating the main measures of effectiveness in the semi-Markov model are presented. In the numerical part of this paper, the author investigates examples of several semi-Markov models. Finally, the results of calculating both the main measures of effectiveness and quality of service (QoS) parameters are presented.

Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation

Faculty of Computer Science, Białystok Technical University, ul. Wiejska 45A, 15-351 Białystok, Poland

International Journal of Applied Mathematics and Computer Science

This paper describes an analytical study of open two-node (tandem) network models with blocking and truncation. The study is based on semi-Markov process...

Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation

Online veröffentlicht: 02. Apr. 2009

Seitenbereich: 151 - 164

DOI: https://doi.org/10.2478/v10006-009-0014-6

Schlüsselwörter
two-node network with blocking and truncation, semi-Markov model, Markov exact algorithm

This content is open access.

Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation

Online veröffentlicht: 02. Apr. 2009

Seitenbereich: 151 - 164

DOI: https://doi.org/10.2478/v10006-009-0014-6

Schlüsselwörtertwo-node network with blocking and truncation, semi-Markov model, Markov exact algorithm

This content is open access.

Schlüsselwörter
two-node network with blocking and truncation, semi-Markov model, Markov exact algorithm