摘要
The problem of state space explosion is still ran outstanding challenge in Markovian performance analysis for multiserver multiqueue (MSMQ) systems. The system behavior of a MSMQ system is described using stochastic high-level Petri net (SHLPN) models, and an approximate performance analysis technique is proposed based on decomposition and refinement methods as well as iteration technique. A real MSMQ system, Web-server cluster, is investigated. The performance of an integrated scheme of request dispatching and scheduling is analyzed with both Poisson and self-similar request arrivals. The study shows that the approximate analysis technique significantly reduces the complexity of the model solution and is also efficient for accuracy of numerical results.
The problem of state space explosion is still ran outstanding challenge in Markovian performance analysis for multiserver multiqueue (MSMQ) systems. The system behavior of a MSMQ system is described using stochastic high-level Petri net (SHLPN) models, and an approximate performance analysis technique is proposed based on decomposition and refinement methods as well as iteration technique. A real MSMQ system, Web-server cluster, is investigated. The performance of an integrated scheme of request dispatching and scheduling is analyzed with both Poisson and self-similar request arrivals. The study shows that the approximate analysis technique significantly reduces the complexity of the model solution and is also efficient for accuracy of numerical results.
