An SMDP model for a multiclass multi-server queueing control problem considering conversion times

Zhicong Zhang; Na Li; Shuai Li; Xiaohui Yan; Jianwen Guo

RAIRO - Operations Research - Recherche Opérationnelle (2014)

  • Volume: 48, Issue: 4, page 615-639
  • ISSN: 0399-0559

Abstract

top
We address a queueing control problem considering service times and conversion times following normal distributions. We formulate the multi-server queueing control problem by constructing a semi-Markov decision process (SMDP) model. The mechanism of state transitions is developed through mathematical derivation of the transition probabilities and transition times. We also study the property of the queueing control system and show that optimizing the objective function of the addressed queueing control problem is equivalent to maximizing the time-average reward.

How to cite

top

Zhang, Zhicong, et al. "An SMDP model for a multiclass multi-server queueing control problem considering conversion times." RAIRO - Operations Research - Recherche Opérationnelle 48.4 (2014): 615-639. <http://eudml.org/doc/275006>.

@article{Zhang2014,
abstract = {We address a queueing control problem considering service times and conversion times following normal distributions. We formulate the multi-server queueing control problem by constructing a semi-Markov decision process (SMDP) model. The mechanism of state transitions is developed through mathematical derivation of the transition probabilities and transition times. We also study the property of the queueing control system and show that optimizing the objective function of the addressed queueing control problem is equivalent to maximizing the time-average reward.},
author = {Zhang, Zhicong, Li, Na, Li, Shuai, Yan, Xiaohui, Guo, Jianwen},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {queueing control; semi-Markov decision process; reward; queueing control problem; time-average reward},
language = {eng},
number = {4},
pages = {615-639},
publisher = {EDP-Sciences},
title = {An SMDP model for a multiclass multi-server queueing control problem considering conversion times},
url = {http://eudml.org/doc/275006},
volume = {48},
year = {2014},
}

TY - JOUR
AU - Zhang, Zhicong
AU - Li, Na
AU - Li, Shuai
AU - Yan, Xiaohui
AU - Guo, Jianwen
TI - An SMDP model for a multiclass multi-server queueing control problem considering conversion times
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 2014
PB - EDP-Sciences
VL - 48
IS - 4
SP - 615
EP - 639
AB - We address a queueing control problem considering service times and conversion times following normal distributions. We formulate the multi-server queueing control problem by constructing a semi-Markov decision process (SMDP) model. The mechanism of state transitions is developed through mathematical derivation of the transition probabilities and transition times. We also study the property of the queueing control system and show that optimizing the objective function of the addressed queueing control problem is equivalent to maximizing the time-average reward.
LA - eng
KW - queueing control; semi-Markov decision process; reward; queueing control problem; time-average reward
UR - http://eudml.org/doc/275006
ER -

References

top
  1. [1] R. Andriansyah, T.V. Woensel and F.R.B. Cruz, Performance optimization of open zero-buffer multi-server queueing networks. Comput. Oper. Res.37 (2010) 1472–1487. Zbl1183.90109MR2578215
  2. [2] A. Azaron, H. Katagiri and K. Kato, Longest path analysis in networks of queues: Dynamic scheduling problems. Eur. J. Oper. Res.174 (2006) 132–149. Zbl1116.90025MR2245930
  3. [3] S. Borst, N. Hegde and A. Proutière, Interacting queues with server selection and coordinated scheduling-application to cellular data networks. Annal. Oper. Res.170 (2009) 59–78. Zbl1169.90334MR2506275
  4. [4] C.K. Chen, H.H. Kuo and J.J. Yan, GA-based PID active queue management control design for a class of TCP communication networks. Exp. Syst. Appl.36 (2009) 1903–1913. 
  5. [5] D. Choi, T.S. Kim and S. Lee, Analysis of a queueing system with a general service scheduling function, with applications to telecommunication network traffic control. Eur. J. Oper. Res.178 (2007) 463–471. Zbl1107.90009
  6. [6] A. Choudhury and M. Pallabi, Some aspects of balking and reneging in finite buffer queues. RAIRO-Oper. Res. 45 (2011) 223–240. Zbl1246.60114
  7. [7] J. Granger, Performance improvement of queueing networks with synchronization stations, Ph.D. dissertation, University of Wisconsin (2006). 
  8. [8] M. Harchol-Balter, T. Osogami and A. Scheller-Wolf, Multi-server queueing systems with multiple priority classes. Queueing Syst.51 (2005) 331–360. Zbl1085.60070MR2189597
  9. [9] M. Haridass and R. Arumuganathan, Analysis of a MX/G (a, b)/1 queueing system with vacation interruption. RAIRO-Oper. Res. 46 (2012) 305–334. Zbl1268.60113MR2995739
  10. [10] C. Kim, S. Dudin and V. Klimenok, The MAP/PH/1/N queue with flows of customers as a model for traffic. Perform. Eval.66 (2009) 564–579. 
  11. [11] Y.L. Koçaǧa and A.R. Ward, Admission control for a multi-server queue with abandonment. Queueing Syst.65 (2010) 275–323. Zbl1247.90103MR2652045
  12. [12] L.B. Le, E. Hossain, A.S. Alfa, Queueing analysis and admission control for multi-rate wireless networks with opportunistic scheduling and ARQ-based error control. IEEE Int. Conf. Commun.5 (2005) 3329–3333. 
  13. [13] Y. Nazarathy and G. Weiss, Near optimal control of queueing networks over a finite time horizon. Annal. Oper. Res.170 (2009) 233–249. Zbl1169.90346MR2506284
  14. [14] V. Nitto Personè, Analysis of cyclic queueing networks with parallelism and vacation. Annal. Oper. Res.170 (2009) 95–112. Zbl1169.90341MR2506277
  15. [15] M. Pallabi and A. Choudhury, Aspects of impatience in a finite buffer queue. RAIRO-Oper. Res. 46 (2012) 189–209. Zbl1250.60037MR2989083
  16. [16] I.C. Paschalidis, C. Su and M.C. Caramanis, New scheduling policies for multiclass queueing networks: Applications to peer-to-peer systems, in proc. of 42nd IEEE Conf. Decision and Control, Maui, Hawau (2003) 1604–1609. 
  17. [17] I.C. Paschalidis, C. Su and M.C. Caramanis, Target-pursuing scheduling and routing policies for multiclass queueing networks. IEEE Trans. Automat. Contr.49 (2004) 1709–1722. MR2091321
  18. [18] B. Sikdar and D. Manjunath, Queueing analysis of scheduling policies in copy networks of space-based multicast packet switches. IEEE/ACM Trans. Netw. 8 (2000) 396–406. 
  19. [19] P. Tehrani and Q. Zhao, Multichannel scheduling and its connection to queueing network control problem, in proc. of The 2010 Military Communications Conference, San Jose, CA (2010) 482–486. 
  20. [20] X. Xu, and Z.G. Zhang, Analysis of multi-server queue with a single vacation (e,d)-policy. Performance Evaluation63 (2006) 825–838. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.