Please use this identifier to cite or link to this item:

Title: 不耐煩顧客的M/M/S再嘗試模型中邊際機率與條件變異數的關係
Relations between marginal probabilities and conditonal variances for the M/M/S retrial queueing models with impatient customers
Authors: 宋沛峻
Song, Pei-Chun
Contributors: 陸行
Luh, Hsing
Song, Pei-Chun
Keywords: M/M/S再嘗試模型
M/M/S retrial queues
Impatient customers
Conditional variance
Mean queue length
Idle probability
Date: 2022
Issue Date: 2022-05-02 15:02:47 (UTC+8)
Abstract: 在現實生活中,等候模型被廣泛地使用於許多領域之中。在網路的問題中,我們可以將服務員視為伺服器,顧客則視為連接至伺服器的使用者。在實際的情形中,當使用者連不上伺服器時,通常會選擇重新連接伺服器,當使用者連續失敗幾次則可能選擇離開。這時候顧客便具有再嘗試且不耐煩的特性,所以我們便可以將不耐煩顧客的 M/M/S 再嘗試模型套用到網路的問題當中。在本文中,我們基於不耐煩顧客的 M/M/S 再嘗試模型的矩陣解來描述模型,並且導入條件機率及條件期望值的概念進行運算。最後我們給出幾條有關排隊人數或服務員忙碌人數的期望值及條件變異數的關係式和系統閒置機率的上下界,以利更好地刻畫整個網路的使用情形。
Queueing models has been widely used in many applications. In the communication network , we consider the user who tries to connect to a website or a server as a customer. Users in real world may retry to connect to a server when their connection failed. Moreover, when they failed to connect to a server several times, they will give up retrying to connect. Therefore, we can apply the M/M/S retrial queues with impatient customers to this problem. In the thesis, we describe the M/ M/S retrial queues with impatient customers by its infinitesemial generator. Then we apply the geometric form for this model and consider the conditional probability and the conditional expectation to provide some relations between the expectation of the queue length, the expectation of number of busy servers, and the variance of the queue length when all servers are occupied. Also, we provide bounds for the probability that the system is idle. If we want to estimate some system performance, these relations can let us easily to transform some ariables to other variables we needed.
Reference: [1] J. Kim, B. Kim. Exact tail asymptotics for the M/M/m retrial queue with nonpersistent customers. Operations Research Letters, 40:537– 540, 11 2012.
[2] Q. Zhao, B. Liu, X. Wang. Tail asymptotics for M/M/c retrial queues with non-persistent
customers. Operational Research, 12:173–188, 2012.
[3] N. K. Boots, H. Tijms. An M/M/c queue with impatient customers. Top, 7:213–220, 1999.
[4] N. K. Boots, H. Tijms. A multiserver queueing system with impatient customers. Management Science, 45(3):444–448, 1999.
[5] B.D. Choi, Y.C. Kim, Y.W. Lee. The M/M/c retrial queue with geometric loss and feedback. Computers & Mathematics with Applications, 36(6):41–52, 1998.
[6] D. Christian. Stationary queueing models with aspects of customer impatience and retrial behaviour. diploma thesis, Vienna University of Technology, January 2008.
[7] M. Jose, D. Benlloch. Generalized truncated methods for an efficient solution of retrial systems. Mathematical Problems in Engineering, 2008.
[8] G.I. Falin, J.G.C. Templeton. Retrial Queues. Chapman & Hall, 1997.
[9] H. Luh, P.C. Song. Matrix analytic solutions for M/M/S retrial queues with impatient customers. In Queueing Theory and Network Applications: 14th International Conference, QTNA 2019, Ghent, Belgium, August 27– 29, 2019, Proceedings, page 16– 33, Berlin,
Heidelberg, 2019. Springer-Verlag.
[10] J. Kim, J. Kim. Waiting time distribution in the M/M/m retrial queue. Bulletin of the Korean Mathematical Society, 50(5):1659– 1671, 2013.
[11] J. Zhang, T. V. Do, N. H. Do. An enhanced algorithm to solve multiserver retrial queueing systems with impatient customers. Computers & Industrial Engineering, 65(4):719–728,
Description: 碩士
Source URI:
Data Type: thesis
Appears in Collections:[應用數學系] 學位論文

Files in This Item:

File Description SizeFormat
100101.pdf523KbAdobe PDF6View/Open

All items in 學術集成 are protected by copyright, with all rights reserved.

社群 sharing