Approximate solution for the performability of Markovian queuing networks with a large number of servers.
Gemikonakli, Orhan and Sanei, Hadi and Ever, Enver (2007) Approximate solution for the performability of Markovian queuing networks with a large number of servers. In: 5th International Workshop on Signal Processing for Wireless Communication SPWC 2007,, 6th-8th June, 2007, London, UK.
Full text is not in this repository.
In this paper, a simple and flexible approximate technique, capable of overcoming the state space explosion problem in computing the performability of large Markov models is presented. To show the capability of the proposed technique, MQL results are computed for parallel processing systems for large numbers of homogeneous processors and presented. In order to show the accuracy of the method, some of these results are validated using existing techniques whenever possible, and results obtained using different approaches are shown to be in good agreement. It is shown that, this approach can handle large state spaces. A case study is presented for 64, 128, 256, and 512-processor parallel processing systems with break-downs and repairs. This method can be further extended to compute the performability of large and complex networks.
|Item Type:||Conference or Workshop Item (Paper)|
|Research Areas:||Middlesex University Schools and Centres > School of Science and Technology > Computer and Communications Engineering|
Middlesex University Schools and Centres > School of Science and Technology > Computer Science > SensoLab group
|Deposited On:||31 Mar 2009 08:09|
|Last Modified:||24 Oct 2014 15:33|
Repository staff only: item control page
Full text downloads (NB count will be zero if no full text documents are attached to the record)
Downloads per month over the past year