2018
DOI: 10.1080/02331934.2018.1434171
|View full text |Cite
|
Sign up to set email alerts
|

Research and optimization of semi-Markov queueing models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 7 publications
0
5
0
Order By: Relevance
“…In this section we repeat some definitions presented [22][23][24] and then derive some relations for the semi-Markov kernel and probability measures used in construction of the accumulation functional. The classic case [22] has a semi-Markov process that is πœ‰(𝑑) defined by a homogeneous two-dimensional Markov chain or a homogeneous Markov renewal process:…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…In this section we repeat some definitions presented [22][23][24] and then derive some relations for the semi-Markov kernel and probability measures used in construction of the accumulation functional. The classic case [22] has a semi-Markov process that is πœ‰(𝑑) defined by a homogeneous two-dimensional Markov chain or a homogeneous Markov renewal process:…”
Section: Methodsmentioning
confidence: 99%
“…. Given the numerical functions 𝑅 𝑖𝑗 (𝑑, 𝑒), 𝑖, 𝑗 ∈ 𝐸, the value of the functional corresponding to the trajectory defined above is determined by βˆ‘ 𝑅 𝑖 π‘˜ 𝑖 π‘˜+1 (𝑑 π‘˜+1 , 𝑒 π‘˜+1 ) + 𝑅 𝑖 𝑛(𝑇) 𝑖 𝑛(𝑇)+1 𝑛(𝑇)βˆ’1 π‘˜=0 (22) The function 𝑅 𝑖𝑗 (𝑑, 𝜏, 𝑒) is the mathematical expectation of the accumulated effect (income) over time 𝜏, provided that the process is in state 𝑖 and the next state will be state 𝑗, and the time of this transition is 𝑑, provided that the decision 𝑒 is made at the time of the transition from state 𝑖.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Note that it is very reasonable to change the characteristics of arrival flows in various models for optimization of its functioning. The control is based on the theory of controlled semi-markov processes for system optimization [10][11][12]. The control is carried out using a type of the next batch, the moments of batch arrivals and the quantity of queries in the batch.…”
Section: Control On the Basis Of Controlled Queueing Modelsmentioning
confidence: 99%
“…Note that, CBSMAP-flow is also good for modeling of data-flows and other flows. All major characteristics for the CBSMAP-model was obtained in the previous papers [10][11][12].…”
Section: Control On the Basis Of Controlled Queueing Modelsmentioning
confidence: 99%