Tail-Limited Phase-Type Burstiness Bounds for Network Traffic

Tail-Limited Phase-Type Burstiness Bounds for Network Traffic
复制标题

DOI:
10.1109/ciss.2019.8692817
复制
发表时间:
2019-03
期刊:
2019 53rd Annual Conference on Information Sciences and Systems (CISS)
影响因子:
--
通讯作者:
Massieh Kordi Boroujeny;B. L. Mark;Y. Ephraim
Massieh Kordi Boroujeny;B. L. Mark;Y. Ephraim
中科院分区:
其他
文献类型:
--
作者:
Massieh Kordi Boroujeny;B. L. Mark;Y. Ephraim

文献摘要

被引文献

相似文献

网络流量的突发性使其难以准确表征,并且可能导致网络内出现重尾队列分布。基于随机网络演算方面的先前工作,我们提出了基于相位类型分布类别的流量突发边界,并开发了一种使用期望最大化(EM)算法来估计此类边界参数的方法。通过限制突发边界的尾部,我们的方法实现了阶段类型分布与来自重尾流量的经验数据的更好拟合。所提出的尾部限制阶段型突发界限属于基于广义随机有界突发的随机网络演算的框架。我们通过涉及重尾 M/G/1 队列的数值示例证明了所提出方法的有效性。1
The bursty nature of network traffic makes it difficult to characterize accurately, and may give rise to heavy-tailed queue distributions within the network. Building on prior work in stochastic network calculus, we propose traffic burstiness bounds based on the class of phase-type distributions and develop an approach to estimate the parameter of such bounds using the expectation-maximization (EM) algorithm. By limiting the tail of the burstiness bound, our approach achieves a better fit of the phase-type distribution to the empirical data from heavy-tailed traffic. The proposed tail-limited phase-type burstiness bounds fall within the framework for stochastic network calculus based on generalized stochastically bounded burstiness. We demonstrate the effectiveness of the proposed methodology with a numerical example involving a heavy-tailed M/G/1 queue.1