A study on traffic control in high-speed multi-service networks

建立了多马尔可夫到达流排队模型的算法分析方法，该方法能够以任意精度表示任意平稳点过程。尽管这类排队在实际应用中非常重要，但它的分析一直是个难点。在这项研究中，我们证明了联合队长分布的逗留时间分布，并在此基础上，建立了算法的方法。这一结果被认为是定量评估的多业务网络的性能，它容纳可变长度的数据包的基础。此外，我们表明，它是可能的，以某种方式消除极端拥塞所造成的长距离相关的流量，如果长距离相关的流量在网络的边缘由峰值速率执行器进行调节。因此，通过对服务网络进行定量建模。多马尔可夫到达流的建模方法仍在研究中。此外，我们使用一个简单的排队模型，表明吞吐量和延迟都可以控制优先级排队和动态缓冲区管理。

We established the algorithmic method to analyze queues with multiple Markovian arrival streams, which can represent any stationary point process with any desired accuracy. Even though this class of queues is very important in applications, its analysis had been considered to by very hard. In this study, we showed that the joint queue length distribution is given in terms of the sojourn time distribution, and based on it, the algorithmic approach was established. This result is considered as a basis to evaluate the performance of multi-service networks quantitatively, which accommodate variable-length packets. Furthermore, we showed that it is possible to eliminate somehow extremal congestion caused by long-range dependent traffic if long-range dependent traffic is regulated at the edge of networks by a peak rate enforcer. Therefore, by modeling service networks quantitatively. The modeling method with multiple Markovian arrival streams is still being investigated. Moreover, using a simple queueing model, we showed that both the throughput and delay can be controlled by priority queueing and dynamic buffer management.