Dependence in packet queues
Dependence in packet queues
复制标题
DOI：
10.1109/26.46511
复制
发表时间：
1989-11
期刊：
影响因子：
--
通讯作者：
K. Fendick;V. Saksena;W. Whitt
中科院分区：
文献类型：
--
作者：
K. Fendick;V. Saksena;W. Whitt
在分组网络性能模型中，总到达过程的突发性已经通过连续到达间隔时间之间的依赖性来表征。结果表明，连续服务时间之间以及服务时间和到达间隔时间之间的相关依赖关系对于包含可变数据包长度的数据包队列也很重要。通过考虑具有批处理泊松到达过程的多类单服务器队列，分析了这些依赖效应。对于这个模型和更现实的数据包队列模型，可以从大流量限制定理中获得洞察力。研究表明，在分析和测量包含可变数据包长度的数据包队列时，应考虑这三种依赖关系。针对实际系统和仿真，提出了具体的测量方法。该研究还指出了如何在高负载下预测预期的数据包延迟。最后，本研究对于理解排队网络分析器（QNA）等程序的局限性具有重要意义，这些程序使用聚合和分解技术来近似描述排队网络的性能。>
The burstiness of the total arrival process has been previously characterized in packet network performance models by the dependence among successive interarrival times. It is shown that associated dependence among successive service times and between service times and interarrival times also can be important for packet queues involving variable packet lengths. These dependence effects are demonstrated analytically by considering a multiclass single-server queue with batch-Poisson arrival processes. For this model and more realistic models of packet queues, insight is gained from heavy-traffic limit theorems. This study indicates that all three kinds of dependence should be considered in the analysis and measurement of packet queues involving variables packet lengths. Specific measurements are proposed for real systems and simulations. This study also indicates how to predict expected packet delays under heavy loads. Finally, this study is important for understanding the limitations of procedures such as the queuing network analyzer (QNA) for approximately describing the performance of queuing networks using the techniques of aggregation and decomposition. >