We consider the M [x] /G/1 queueing system, in which the server operates N policy and a single vacation. As soon as the system becomes empty the server leaves for a vacation of random length V . When he returns from the vacation and the system size is greater than or equal to a threshold value N , h
β¦ LIBER β¦
Analysis of batch arrival queue with randomized vacation policy and an un-reliable server
β Scribed by Jau Chuan Ke, Kai Bin Huang
- Book ID
- 118813917
- Publisher
- Academy of Mathematics and Systems Science, Chinese Academy of Sciences
- Year
- 2012
- Tongue
- English
- Weight
- 528 KB
- Volume
- 25
- Category
- Article
- ISSN
- 1009-6124
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Maximum entropy approach for batch-arriv
β
Jau-Chuan Ke; Chuen-Horng Lin
π
Article
π
2008
π
Elsevier Science
π
English
β 342 KB
Optimal strategy policy in batch arrival
β
Jau-Chuan Ke
π
Article
π
2003
π
Springer
π
English
β 290 KB
An M/G/1 queue under hysteretic vacation
β
Jau-Chuan Ke
π
Article
π
2006
π
Springer
π
English
β 126 KB
Analysis of an Infinite-Server Queue wit
β
H. Masuyama; T. Takine
π
Article
π
2002
π
Springer US
π
English
β 203 KB
Analysis of an M/G/β queue with batch ar
β
Refik GΓΌllΓΌ
π
Article
π
2004
π
Elsevier Science
π
English
β 209 KB
Two thresholds of a batch arrival queuei
β
Jau-Chuan Ke
π
Article
π
2007
π
John Wiley and Sons
π
English
β 205 KB
## Abstract This paper studies the operating characteristics of the variant of an M^[x]^/G/1 vacation queue with startup and closedown times. After all the customers are served in the system exhaustively, the server shuts down (deactivates) by a closedown time, and then takes at most __J__ vacation