穩定狀態機率是讓我們了解各種排隊網路性能的基礎。在擬生死過程(Quasi-Birth-and-Death) Phase-type 分配中求得穩定狀態機率，通常是依賴排隊網路的結構。在這篇論文中，我們提出了一種計算方法-LU分解，可以求得在排隊網路中有多台服務器的穩定狀態機率。此計算方法提供了一種通用的方法，使得複雜的大矩陣變成小矩陣，並減低計算的複雜性。當需要計算一個複雜的大矩陣，這個成果變得更加重要。文末，我們提到了離開時間間隔，並用兩種方法 (Matlab 和 Promodel) 去計算期望值和變異數，我們發現兩種方法算出的數據相近，接著計算離開顧客的時間間隔相關係數。最後，我們提供數值實驗以計算不同服務器個數產生的離去過程和相關係數，用來說明我們的方法。 / Stationary probabilities are fundamental in response to various measures of performance in queueing networks. Solving stationary probabilities in Quasi-Birth-and-Death(QBD) with phase-type distribution normally are dependent on the structure of the queueing network. In this thesis, a new computing scheme is developed for attaining stationary probabilities in queueing networks with multiple servers. This scheme provides a general approach of consindering the
complexity of computing algorithm. The result becomes more
significant when a large matrix is involved in computation. After determining the stationary probability, we study the departure process and the moments of inter-departure times. We can obtain the moment of inter-departure times. We compute the moments of inter-departure times and the variance by applying two numerical methods (Matlab and Promodel). The lag-k correlation of inter-departure times is also introduced in the thesis. The proposed approach is proved theoretically and verifieded with illustrative examples.
| Identifer | oai:union.ndltd.org:CHENGCHI/G0097972004 |
| Creators | 顏源亨, Yen, Yuan Heng |
| Publisher | 國立政治大學 |
| Source Sets | National Chengchi University Libraries |
| Language | 英文 |
| Detected Language | English |
| Type | text |
| Rights | Copyright © nccu library on behalf of the copyright holders |
Page generated in 0.0023 seconds