2004
DOI: 10.1239/aap/1103662965
|View full text |Cite
|
Sign up to set email alerts
|

The stationary tail asymptotics in the GI/G/1-type queue with countably many background states

Abstract: We consider the asymptotic behaviour of the stationary tail probabilities in the discrete-time GI/G/1-type queue with countable background state space. These probabilities are presented in matrix form with respect to the background state space, and shown to be the solution of a Markov renewal equation. Using this fact, we consider their decay rates. Applying the Markov renewal theorem, it is shown that certain reasonable conditions lead to the geometric decay of the tail probabilities as the level goes to infi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

3
84
0

Year Published

2007
2007
2017
2017

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 63 publications
(87 citation statements)
references
References 26 publications
(43 reference statements)
3
84
0
Order By: Relevance
“…For the one-dimensional case, we extend existing results of Miyazawa and Zhao [24] from the case of countably many background states to real-valued background states. This allows us to consider precise asymptotics of a system with autoregressive input.…”
mentioning
confidence: 59%
See 3 more Smart Citations
“…For the one-dimensional case, we extend existing results of Miyazawa and Zhao [24] from the case of countably many background states to real-valued background states. This allows us to consider precise asymptotics of a system with autoregressive input.…”
mentioning
confidence: 59%
“…We defer the proof of this lemma to Appendix E since it is similar to Lemma 4.2 of [24]. We are now ready to present a main result of this subsection.…”
mentioning
confidence: 96%
See 2 more Smart Citations
“…On the other hand, Miyazawa [6] As other related works, Miyazawa [7] and Miyazawa and Zhao [8] finite Ii], Takine [13] (12) A(e))ldOl,=, < 1.…”
Section: Nii-electronic Library Servicementioning
confidence: 99%