arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.4114cs.PF
收藏

随机网络演算中的锐界

Sharp Bounds in Stochastic Network Calculus

Florin Ciucu, Felix Poloczek, Jens Schmitt

摘要:

随机网络演算(SNC)的实用性经常受到质疑,其性能界限的潜在松动的理由。在这篇论文中,它揭示了突发到达过程(特别是马尔可夫调制的开关(MMOO)),其服从\textit{per-flow}分析通常被宣布为SNC的亮点,不幸的是,边界确实是非常宽松的(例如,差几个数量级)。响应于SNC的该未被发现的弱点,本文通过使用基于鞅的技术导出通用采样路径界限来改进(标准)每流界限,其适应FIFO、SP、EDF和GPS调度。所得到的(鞅)界在流的数目$n$中获得指数衰减因子${\mathcal{O}}(e^{-αn})$。此外,对模拟的数值比较表明,鞅界是非常准确的FIFO,SP和EDF调度; GPS调度,虽然鞅界大大提高了标准的界限,他们在数值上是松散的,要求改进的核心SNC分析的GPS。

英文摘要:

The practicality of the stochastic network calculus (SNC) is often questioned on grounds of potential looseness of its performance bounds. In this paper it is uncovered that for bursty arrival processes (specifically Markov-Modulated On-Off (MMOO)), whose amenability to \textit{per-flow} analysis is typically proclaimed as a highlight of SNC, the bounds can unfortunately indeed be very loose (e.g., by several orders of magnitude off). In response to this uncovered weakness of SNC, the (Standard) per-flow bounds are herein improved by deriving a general sample-path bound, using martingale based techniques, which accommodates FIFO, SP, EDF, and GPS scheduling. The obtained (Martingale) bounds gain an exponential decay factor of ${\mathcal{O}}(e^{-αn})$ in the number of flows $n$. Moreover, numerical comparisons against simulations show that the Martingale bounds are remarkably accurate for FIFO, SP, and EDF scheduling; for GPS scheduling, although the Martingale bounds substantially improve the Standard bounds, they are numerically loose, demanding for improvements in the core SNC analysis of GPS.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑