Queueing mạng lưới và chuỗi Markov P4

In this section we introduce an efficient method for the steady-state analysis of Markov chains. Whereas direct and iterative techniques can be used for the exact analysis of Markov chains as previously discussed, the method computations of Courtois [Cour75, Cour77] is mainly applied to approximate u NN the desired state probability vector u. Courtois’s approach is based of on decomposability properties of the models under consideration. Queueing Networks and Markov Chains Gunter Bolch, Stefan G

Thể loại Tài liệu miễn phí Kĩ thuật Viễn thông

Số trang 24

Ngày tạo 8/29/2018 6:13:31 PM +00:00

Loại tệp PDF

Kích thước

Tên tệp