Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/84949
DC FieldValueLanguage
dc.contributor.advisor陸行zh_TW
dc.contributor.author莊依文zh_TW
dc.creator莊依文zh_TW
dc.date2001en_US
dc.date.accessioned2016-04-15T08:02:53Z-
dc.date.available2016-04-15T08:02:53Z-
dc.date.issued2016-04-15T08:02:53Z-
dc.identifierA2002001140en_US
dc.identifier.urihttp://nccur.lib.nccu.edu.tw/handle/140.119/84949-
dc.description碩士zh_TW
dc.description國立政治大學zh_TW
dc.description應用數學系zh_TW
dc.description.abstract在這一篇論文裡,我們討論兩個階段的封閉式等候線網路,其中服務時間的機率分配都是Phase type分配。我們猜測服務時間的機率分配和離開時間間隔的機率分配滿足一組聯立方程組。然後,我們推導出非邊界狀態的穩定機率可以被表示成 product-form的線性組合,而每個product-form可以用聯立方程組的根來構成。利用非邊界狀態的穩定機率, 我們可以求出邊界狀態的機率。最後我們建立一個求穩定機率的演算過程。利用這個演算方法,可以簡化求穩定機率的複雜度。zh_TW
dc.description.abstractIn this thesis, we are concerned with the property of a two-stage closed system in which the service times are identically of phase type. We first conjecture that the  Laplace-Stieltjes Transforms (LST) of service time distributions may satisfy a system of equations. Then we present that the stationary probabilities on the unboundary states can be written as a linear combination of product-forms. Each component of these products can be expressed in terms of roots of the system of equations. Finally, we establish an algorithm to obtain all the stationary probabilities. The algorithm is expected to work well for relatively large customers in the system.en_US
dc.description.abstract封面頁\r\n證明書\r\n致謝詞\r\n論文摘要\r\n目錄\r\n1 Introduction\r\n1.1 Background\r\n1.2 Literature Review\r\n1.3 Organization of the thesis\r\n2 The Model\r\n2.1 Phase type distribution\r\n2.2 Problem statement and assumptions\r\n2.3 Preliminaries results\r\n2.4 Propositions\r\n3 A two stage closed network with ρ1 ≧ ρ2\r\n3.1 Transition rate matrix\r\n3.2 Balance equation\r\n3.3 Product form solutions\r\n3.4 Algorithm for the boundary probabilities\r\n3.5 A summary of the algorithm\r\n4 A two stage closed network with ρ1 < ρ2\r\n4.1 Transition rate matrix\r\n4.2 Balance equation\r\n4.3 Product form solutions\r\n4.4 Algorithm for the unboundary probabilities\r\n4.5 A summary of the algorithm\r\n5 Examples\r\n5.1 Example for -/M/1 → /M/1 system\r\n5.2 Example for -/E2/1 → /E2/1 system\r\n6 Conclusions and future research\r\n6.1 Conclusion\r\n6.2 Future research\r\nReferences\r\nAppendix-
dc.description.tableofcontents封面頁\r\n證明書\r\n致謝詞\r\n論文摘要\r\n目錄\r\n1 Introduction\r\n1.1 Background\r\n1.2 Literature Review\r\n1.3 Organization of the thesis\r\n2 The Model\r\n2.1 Phase type distribution\r\n2.2 Problem statement and assumptions\r\n2.3 Preliminaries results\r\n2.4 Propositions\r\n3 A two stage closed network with ρ1 ≧ ρ2\r\n3.1 Transition rate matrix\r\n3.2 Balance equation\r\n3.3 Product form solutions\r\n3.4 Algorithm for the boundary probabilities\r\n3.5 A summary of the algorithm\r\n4 A two stage closed network with ρ1 < ρ2\r\n4.1 Transition rate matrix\r\n4.2 Balance equation\r\n4.3 Product form solutions\r\n4.4 Algorithm for the unboundary probabilities\r\n4.5 A summary of the algorithm\r\n5 Examples\r\n5.1 Example for -/M/1 → /M/1 system\r\n5.2 Example for -/E2/1 → /E2/1 system\r\n6 Conclusions and future research\r\n6.1 Conclusion\r\n6.2 Future research\r\nReferences\r\nAppendixzh_TW
dc.source.urihttp://thesis.lib.nccu.edu.tw/record/#A2002001140en_US
dc.subject封閉式等候線網路zh_TW
dc.subject穩定機率zh_TW
dc.subjectClosed queueing networksen_US
dc.subjectStationary probabilitiesen_US
dc.subjectProduct-formsen_US
dc.subjectPhase typeen_US
dc.title封閉式等候網路機率分配之估計與分析zh_TW
dc.titleEstimation of Probability Distributions on Closed Queueing Networksen_US
dc.typethesisen_US
dc.relation.reference1.Bellman R., Introduction to Matrix Analysis (MacGraw-Hill, London) (1960).\r\n2.Bertsimas D., An exact FCFS waiting time analysis for a class of G/G/s queueing systems. QUESTA, 3,(1988) 305-320.\r\n3.Bertsimas D., An analytic approach to a general class of G/G/s queueing systems. Operations Research, 38 (1990) 139-155.\r\n4.Buzen, J.P., Computational algorithms for the closed queueing networks with exponential servers. Commun. ACM, 16, 9(Sept.), (1973) 527-531.\r\n5.Conway, A.E., and Georganas, N.D., RECAL--A new efficient algorithm for the exact analysis of multiple-chain closed queuing networks ,Journal-of-the-Association-for-Computer-Machinery , 33, 4(Oct.), (1986) 768-791.\r\n6. Conway, A.E., and Georganas, N.D., Docomposition and arregation by class in closed queueing networks. IEEE Trans. Softw. Eng., 12, 1025-1040, (1986).\r\n7. Ganesh, A., and Anantharam, V., Stationary tail in probabilities in exponential server tandem queues with renewal arrivals. in Frank P. Kelly and Ruth J. Williams (eds.), Stochastic Networks, The IMA Volumes in Mathematics and Its Applications, 71, (Springer-Verlag, 1995), 367-385.\r\n8.Fujimoto, K., and Takahashi, Y., Tail behavior of the stationary distributions in two-stage tandem queues---numerical experiment and conjecture. Journal of the Operations Research Society of Japan, 39-4, (1996) 525-540.\r\n9. Fujimoto, K., Takahashi, Y., and Makimoto, N., Asymptotic Properties of Stationary Distributions in Two-Stage Tandem Queueing Systems. Journal of the Operations Research Society of Japan, 41-1, (1998) 118-141.\r\n10. Gordon, W.J., and Newell, G.F., Matrix-Geometric Solutions in Stochastic Models (The John Hopkins University Press, 1981).\r\n11. Golub, G.H., and Van Loan, C.F., Matrix--Computations (The John Hopkins University Press, 1989).\r\n12. Chao, X., A Queueing Network Model with Catastrophe and Product Form Solution, Operations Research Letters, 18, (1995) 75-79.\r\n13. Chao, X., Pinedo, M. and Shaw, D., An Assembly Network of Queues with Product Form Solution, Journal of Applied Probability, 33, (1996) 858-869.\r\n14. Chao, X., Miyazawa, M., Serfozo, R., and Takada. H., Necessary and sufficient conditions for product form queueing networks, Queueing Systems, 28, (1998),377-401.\r\n15. Chao, X., and Miyazawa. M., On quasi-reversibility and partial balance: An alternative approach to product form results, Operations Research, 46, (1998) 927-933.\r\n16. Neuts, M.F., Matrix-Geometric Solutions in Stochastic Models (The John Hopkins University Press, 1981).\r\n17. Neuts, M.F., and Takahashi, Y., Asymptotic behavior of the stationary distributions in the $GI/PH/c$ queue with heterogeneous servers, Z. Wahrscheinlichkeitstheorie verw. Gebiete, 57 (1988) 441-452.\r\n18. Le Boudec, J.Y., Steady-state probabilities of the PH/PH/1 queue. Queueing Systems, 3 (1988) 73-88.\r\n19. Luh, H., Matrix product-form solutions of stationary probabilities in tandem queues. Journal of the Operations Research, 42-4 (1999) 436-656.\r\n20. Reiser, M., and Kobayashi, H., Queueing networks with multiple closed chains, theory and computational algorithms. IBM J. Res. Dev. , 19,(1975) 283-294.\r\n21. Reiser, M., and Lavenberg, S. S., Mean value analysis of closed multichain queueing networks. Journal-of-the-Association-for-Computer-Machinery , 27, (1980) 313-322.\r\n22. Seneta, E., Non-negative Matrices and Markov Chains (Springer-Verlag, 1980).\r\n23. Takahashi, Y., Asymptotic exponentiality of the tail of the waiting-time distribution in a PH/PH/c queue. Advanced Applied Probability, 13 (1981) 619-630.zh_TW
item.grantfulltextopen-
item.openairetypethesis-
item.fulltextWith Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_46ec-
item.cerifentitytypePublications-
Appears in Collections:學位論文
Files in This Item:
File SizeFormat
index.html115 BHTML2View/Open
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.