Informatics and Applications
2015, Volume 9, Issue 3, pp 55-64
THE THRESHOLD STRATEGY FOR RESTRICTING ACCESS IN THE M/D/1 QUEUEING SYSTEM WITH PENALTY FUNCTION FOR LATE SERVICE
Abstract
The paper considers the problem of optimizing the access control on a set of dynamic threshold strategies in an M/D/1 system. If the number of concurrent requests in a system is more than the threshold, then the system stops accepting requests. If the number of requests is less or equal to this value, then the system resumes accepting requests. As a target function, the average value of the marginal revenue obtained per time unit in the stationary mode is used. It is assumed that the system receives a fixed fee for each accepted request and pays a fixed penalty for each overdue service of a request. The system does not receive a fee and does not pay a penalty for each rejected request. Estimates of the optimal value of the target function and the optimal threshold value are obtained.
[+] References (10)
- Floyd, S., and V. Jacobson. 1993. Random early detection gateways for congestion avoidance. IEEE ACM Trans. Network. 1(4):397-413.
- Welzl, M. 2005. Network congestion control. New York, NY: Wiley. 282 p.
- Agalarov, Ya. M., and I. A. Sokolov. 2008. Dinamicheskaya strategiya raspredeleniyabufernoy pamyati ATM kommu- tatora [Dynamic allocation strategy of buffer memory in ATM commutator]. Informatsionnye Tekhnologii i Vychis- litel'nye Sistemy [Information Technology and Computer Systems] 3:14-21.
- Hong, Y., C. Huang, and J. Yan. 2012. A comparative study of SIP overload control algorithms network and traffic engineering in emerging distributed computing applications. IGI Global. 20 p. Available at: http://arxiv.org/ftp/arxiv/papers/1210/1210.1505.pdf (accessed June 24, 2015).
- Pechinkin, A.V., and R.V. Razumchik. 2013. Statsionarnye kharakteristiki sistemy M 2|G|1|r s gisterezisnoy politikoyupravleniyaintensivnost'yuvkhodyashchegopo-
toka [Stationary characteristics of M2|G|1|r queue with hysteric control policy of arrival rate]. Informatsionnye Protsessy [Information Processes] 3(3):125-140.
- Konovalov, M. G. 2013. Ob odnoy zadache optimal'nogo upravleniya nagruzkoy na server [About one task of overload control]. Informatika i ee Primeneniya - Inform. Appl. 7(4):34-43.
- Grishunina, Ju. B. 2015. Optimal'noe upravlenie ochered'yu v sisteme M|G|1|to s vozmozhnost'yu ogranicheniya priema zayavok [Optimal control of queue in the M|G|1|to system with possibility of customer admission restriction]. Avtomatika i Telemekhanika [Automation and Remote Control] 3:79-93.
- Karlin, S. 1968. A first course in stochastic processes. New York and London: Academic Press. 502 p.
- Bocharov, P.P., and A.V. Pechinkin. 1995. Teoriya massovogo obsluzhivaniya [Queueing theory]. Moscow: RUDN. 529 p.
- Mine, H., and S. Osaki. 1970. Markovian decision processes. New York, NY: American Elsevier Publishing Co. 142 p
[+] About this article
Title
THE THRESHOLD STRATEGY FOR RESTRICTING ACCESS IN THE M/D/1 QUEUEING SYSTEM WITH PENALTY FUNCTION FOR LATE SERVICE
Journal
Informatics and Applications
2015, Volume 9, Issue 3, pp 55-64
Cover Date
2015-02-30
DOI
10.14357/19922264150306
Print ISSN
1992-2264
Publisher
Institute of Informatics Problems, Russian Academy of Sciences
Additional Links
Key words
queueing system; threshold strategy; optimization
Authors
Ya. M. Agalarov 
Author Affiliations
Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
|