2014 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT) 2014
DOI: 10.1109/conecct.2014.6740345
|View full text |Cite
|
Sign up to set email alerts
|

A two-queue finite-buffer polling model with limited service and state-dependent service times

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…The exhaustive type k-limited vacation queuing systems were studied in [19]- [22], where the server takes a vacation when either a queue has been emptied or a predefined number of k customers have been served during the visit. In [19], the distributions of queue length, waiting time and busy period were obtained by using the embedded Markov chain and a combination of the supplementary variables and sample biasing techniques.…”
Section: A Previous Work Related To Epons With Gated-limited Servicementioning
confidence: 99%
See 1 more Smart Citation
“…The exhaustive type k-limited vacation queuing systems were studied in [19]- [22], where the server takes a vacation when either a queue has been emptied or a predefined number of k customers have been served during the visit. In [19], the distributions of queue length, waiting time and busy period were obtained by using the embedded Markov chain and a combination of the supplementary variables and sample biasing techniques.…”
Section: A Previous Work Related To Epons With Gated-limited Servicementioning
confidence: 99%
“…In [20], [21], the authors used matrixanalytic techniques to iteratively calculate the queue length distribution. In [22], a polling system with two priority queues and k-limited service discipline was analyzed, where the high priority queue is served with queue length dependent service time while the low priority queue is served with constant service time. The high priority queue length distribution at departure instants were derived by the embedded Markov chain.…”
Section: A Previous Work Related To Epons With Gated-limited Servicementioning
confidence: 99%
“…Kramer has derived QLD in M /G/1 queue with finite capacity and limited service system [12]. To derive QLD of the queueing system under study, we have followed the method proposed in [13].…”
Section: A Literature Reviewmentioning
confidence: 99%