| OVERLOAD ANALYSIS OF MARKOVIAN MODELS |
| |
| 作者姓名： | Yiqiang Q. ZHAO |
| |
| 作者单位： | Department of Mathematics Mathematics and Statistics University of Winnipeg，Winnipeg，Manitoba，Canada R3B2E9 |
| |
| 摘 要： | 1.IntroductionandMotivationsInavarietyofapplications,oneneedstofindthesteady-statedistributionsoffiniteMarkovchainswithalargenumberofstates,forexample,aqueuingsystemwithalargebiberorabigwaitingroom.Forsuchasystem,thesteady-statedistributionalwaysedestsnomatterhowlargethebibersizeisandnomatterwhetherornotthesystemisoverloaded.Whenthesystemisnotoverloaded,onemayusethecorrespolldingmodelwithaninfinitebufferforanapproximation.Thismethodoftentakestheadvantageofasimplersollltionstructureoftheindnit…
|
OVERLOAD ANALYSIS OF MARKOVIAN MODELS |
| |
| Yiqiang Q. ZHAO.OVERLOAD ANALYSIS OF MARKOVIAN MODELS[J].Journal of Systems Science and Complexity,1999(3). |
| |
| Authors: | Yiqiang Q ZHAO |
| |
| Abstract: | A new procedure for computing stationary probabilities for an overloadedMarkovian model is proposed in terms of the rotated Markov chain. There are two advantages to use this procedure: i) This procedure allows us to approximate an overloadedfinite model by using a stable infinite Markov chain. This will make the study easier whenthe infinite model has a simpler solution. ii) Numerically) this procedure often significantlyreduces the number of computations and the requirement of computer memory. By usingdifferent examples, we specifically demonstrate the process of implementing this rotatingprocedure. |
| |
| Keywords: | Markov processes queues overload |
| 本文献已被 CNKI 等数据库收录！ |
