queueing problem

queueing problem的基本解释

-

[计] 排队问题

与queueing problem相关的网络例句 [注：此内容来源于网络，仅供参考]

Due to the complexity of the cell jitter, the NonSynchronous Tining Recovery methods are currently not mature With the emphasis being given to the Class A CBR traffic, this paper analyzes the performance of the queueing delay and cell jitter at the source node and intermediate nodes, and discusses the Source Timing Recovery at the destination node in ATM networks Firstly, this paper presents a description of the cell jitter of CBR traffic, and gives the definitions of two kinds of cell jitter regarding the Source Timing Recovery for CBR traffic Then, by using exact mathematical models and analysis methods, this paper analyzes the impact of the factors, such as the capacity of the queueing buffer, the randomness, the deterministic nature and the correlation in cell arrivals of the background traffic sources, on the queueing delay and cell jitter performance of the CBR traffic through Statistical Multiplexitng To obtain an insight into the power spectral distribution and look for better schemes for the depression and filtering of the cell jitter, within the analyses we succeed deriving the power spectrum of the cell jitter for CBR traffic Hence, not only the power spectral distribution of the cell jitter can in the frequency domain be qualitatively understood, but also can the rms (root-meansquare) value of the cell jitter be quantitatively obtained so as to more accurately measure the amplitude of the jitter In the end-to-end performance analysis of the queueing delay and cell jitter, we propose a kind of quasi-periodic cell stream model to characterize the jittered CBR traffic, and present an initial queueing analysis of the CBR traffic following such a model at a generic intermediate node Additionally, we briefly discuss the buildout/playout and Source Timing Recovery functions of the destination node Finally, regarding the Source Timing Recovery of CBR traffic, this paper systematically discusses several important principles of the cell jitter filtering and depression reported in the literature, introduces several implementation schemes of the Source Timing Recovery e.

由于信元抖动的复杂性，非同步定时恢复方法目前还很不成熟。本文针对A类CBR业务流在ATM网络源节点和中间节点的排队时延和信元抖动性能，以及在目的节点的源定时恢复问题作了较为全面的研究。首先，文中描述了CBR业务流的信元抖动，并具体地给出了两种与CBR业务源定时恢复有关的信元抖动的定义。然后，采用了精确的数学模型和分析方法，有针对性地分析了业务背景中信元到达的纯随机性、确定性和相关性以及排队缓存器容量等因素对CBR业务流经过统计复用后的排队时延和信元抖动性能的影响。为了了解信元抖动的功率频谱分布和寻求更好的抑制和滤除抖动的方法，在性能分析中，我们成功地完成了CBR业务流信元抖动的功率谱分析，使得不但可以从频域定性地认识信元抖动的能量分布特性，而且还可以定量地求出信元抖动的均方根值(rms：root-mean-square)，以更为准确地衡量抖动的大小。在CBR业务流的多节点端-端排队时延和信元抖动性能分析中，我们提出了一种准周期性(quasi-periodic)信元流模型来描述感染了信元抖动的CBR业务流，并基于这一模型进行了CBR业务流中间节点的初步排队分析。

The Frac/G/1 queueing systems are new type of queueing modes among all the queueing systems.

本文目的是利用马尔可夫骨架过程的理论来处理这一类排队模型。

Based on the research, this dissertation has studied the M/G/1 and GI/GI/1 queueing systems, and drew the following conclusions: Firstly, we present the equation which satisfies the transient distribution of the lengthof L(T,θ1,θ2 for GI/G/1 queueing systems, and proves that the lengthL(t,θ1,θ2 for GI/G/1 queueing systems satisfy two types of equation, and aretheir minimal nonnegative solutions. Furthermore, we give out not only the expression of Laplace transformation, but also the expression of Laplace transformation of busy-idle period, as well as the equation that satisfies the waitingtime of W

第一，首先给出了GI／GI／1排队系统队长L(t，θ_1，θ_2的瞬时分布所满足的方程，证明了GI／GI／1排队系统队长L(t，θ_1，θ_2的概率分布满足二种不同方程，并且是这些方程的最小非负解，进一步给出了其拉氏变换的表达式，还给出了闲忙周期的拉氏变换的表达式，同时对等待时间W(t，θ也作了同样的处理。

与queueing problem相关的网络解释 [注：此内容来源于网络，仅供参考]

queueing process：排队过程

queueing problem 排队问题 | queueing process 排队过程 | queueing theory 排队论

queueing problem：排队问题

queueing condition 排队状态 | queueing problem 排队问题 | queueing process 排队过程

queueing condition：排队状态

queueing 排队 | queueing condition 排队状态 | queueing problem 排队问题