queueing systems 中文意思是什麼
-
The gi / g / 1 queueing system is the most typical and the most important queueing model among all the queueing systems
Gi g 1排隊系統是排隊論中的一個最主要最典型的排隊模型。 -
3, 4, 5 and ? 6 of this chapter deal respectively with the transient distribution of the queue length of these four queueing systems. such results are obtained as follows : under the condition of the interarrival times distributions and service times distributions of these queueing models which have density function, their transient distribution of the queue length can be represented as an integral, and the integrated term of this integral can be recursively obtained
在這一章的誇3 、芬4 、縣5和號6中，分別針對這四個排隊模型，討論了瞬時隊長的分佈，最終得到了以下的結果:在這幾個模型的到達間隔分佈和服務時間分佈均具有密度函數的條件下，它們的瞬時隊長分佈可以表示為一個積分，該積分的被積項可以遞歸地求取。 -
We first consider the m / m / s queueing model with two priorities. through the analysis of state transition - rate equations of two priorities, the average queue length at the input or output of communications systems is derived
首先考慮帶有兩個優先權的m m s排隊模型，通過對兩個隊列的狀態轉移方程的分析，給出了通信系統輸入輸出線上的穩態隊長。 -
Additionally, provided that not all interarrival times distribution and ser - vice times distribution are of density function, the integral representation of the transient disribution of the queue length of these four queueing systems as indicated above is obtained by applying the theory of markov skeleton processes
此外，當到達間隔分佈和服務時間分佈不都有密度函數時，應用馬爾可夫骨架過程理論，亦可得到上述四個排隊系統的瞬時隊長分佈的積分表示。在處理上述這兩個內容截然不同的部分時，所使用的基本方法是一致的。
分享友人