Document Details

Document Type : Article In Journal 
Document Title :
Aggregation/Disaggregation Methods for Computing the Stationary Distribution of Markov Chains with Application to Multiprogramming System
الطرق التبسيطية والتجميعية لحساب التوزيع الاحتمالي المتقر لسلاسل ماركوف مع التطبيق على حاسب آلي متعدد البرامج
 
Subject : Original Works 
Document Language : English 
Abstract : This paper studies the aggregation/disaggregation of nearly completely decomposable Markov chains that have many applications in queueing networks and packet switched networks. A general class of similarity transformation that transforms the stochastic transition probability matrix into a reduced order aggregated matrix is presented. This transformation is used to develop an aggregation algorithm to compute the exact stationary probability distribution, as weB as O( ek ) approximation of it. The proposed aggregation method is applied to a multiprogramming computer system with six active terminals and the capacity of the CPU and the secondary memory is 3. This example is used to compare our algorithm with three well-known algorithms. The simulation studies showed that our algorithm usually converges in less number of iterations and CPU time. Moreover, it is shown that the other algorithms do not converge in some cases while our algorithm usually converges. 
ISSN : 1319-1047 
Journal Name : Engineering Sciences Journal 
Volume : 6 
Issue Number : 1 
Publishing Year : 1414 AH
1994 AD 
Number Of Pages : 20 
Article Type : Article 
Added Date : Sunday, October 11, 2009 

Researchers

Researcher Name (Arabic)Researcher Name (English)Researcher TypeDr GradeEmail
رباح واصل الظاهريRABAH W. ALDHAHERIResearcher  

Files

File NameTypeDescription
 22889.pdf pdf 

Back To Researches Page