8、排队系统与马尔可夫链的分析方法

排队系统与马尔可夫链的分析方法

1. 排队系统的延迟分析

1.1 矩阵关系推导

在排队系统中，对于$Z(s)$，利用克罗内克积的性质，可以得到如下关系：
[
\begin{align }
Z(s) &= \sum_{i = 2}^{\infty} \left[ F_{\otimes k = 0}(s, i)^T \otimes \left( I \otimes \hat{\pi} i(1) \right) \right]\
&= \sum {i = 2}^{\infty} \left[ F_{\otimes k = 0}(s, i - 1)^T L(s)^T \otimes \left( I \otimes \hat{\pi} i(1) \right) \right]\
&= \sum {i = 1}^{\infty} \left[ F_{\otimes k = 0}(s, i)^T L(s)^T \otimes \left( I \otimes \hat{\pi} i(1)R(1) \right) \right]\
&= \sum {i = 1}^{\infty} \left[ F_{\otimes k = 0}(s, i)^T L(s)^T \otimes \left( I \otimes \hat{\pi} i(1) \right) \left( I \otimes R(1) \right) \right]\
&= \sum {i = 1}^{\infty} \left[ F_{\ot