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

Chia sẻ: Va Line Line | Ngày: | Loại File: PDF | Số trang:68

0
44
lượt xem
7

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

Mô tả tài liệu

Algorithms for Product-Form Networks Although product-form solutions can be expressed very easily as formulae, the computation of state probabilities in a closed queueing network is very time consuming if a straightforward computation of the normalization constant using Eq. (7.3.5) is carried out. As seen in Example 7.7, considerable computation is needed to analyze even a single class network with a small number of jobs, primarily because the formula makes a pass through all the states of the underlying CTMC. Therefore we need to develop efficient algorithms to reduce the computation time [Buze71]....

Chủ đề:

Bình luận(0)

Lưu