A Guide to the Stochastic Network Calculus

A Guide to the Stochastic Network Calculus
复制标题

DOI:
10.1109/comst.2014.2337060
复制
发表时间:
2015-01-01
影响因子:
35.6
通讯作者:
Rizk, Amr
Rizk, Amr
中科院分区:
计算机科学1区
文献类型:
--
作者:
Fidler, Markus;Rizk, Amr

文献摘要

被引文献

相似文献

随机网络演算的目的是在多节点网络的端到端分析框架中理解非平凡业务源的统计复用和调度。到目前为止,已经探索了几种模式,其中一些模式具有微妙但重要的差异,以实现这些目标。在前人工作的基础上,本文给出了一种直观的方法来研究随机网络演算,试图以最简单的方式得到它的基本结果。具体地说,这项工作中的方法使用矩母函数,从有效带宽理论中获知,来表征流量到达和网络服务。其中,推导出具有指数衰减溢出分布的仿射包络函数,以计算网络的统计端到端积压和延迟界。
The aim of the stochastic network calculus is to comprehend statistical multiplexing and scheduling of non-trivial traffic sources in a framework for end-to-end analysis of multinode networks. To date, several models, some of them with subtle yet important differences, have been explored to achieve these objectives. Capitalizing on previous works, this paper contributes an intuitive approach to the stochastic network calculus, where we seek to obtain its fundamental results in the possibly easiest way. In detail, the method that is assembled in this work uses moment generating functions, known from the theory of effective bandwidths, to characterize traffic arrivals and network service. Thereof, affine envelope functions with an exponentially decaying overflow profile are derived to compute statistical end-to-end backlog and delay bounds for networks.