IEEE/ACM Transactions on Networking (TON)
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Maximal Effective Bandwidth of Constrained Traffic
Queueing Systems: Theory and Applications
A Calculus for End-to-end Statistical Service Guarantees
A Calculus for End-to-end Statistical Service Guarantees
Statistical Multiplexing Gain of Link Scheduling Algorithms in QoS Networks (Short Version)
Statistical Multiplexing Gain of Link Scheduling Algorithms in QoS Networks (Short Version)
A network service curve approach for the stochastic analysis of networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
| Hi-index | 0.00 |
The stochastic network calculus receives much attention as a new methodology for end-to-end performance evaluation of networks, taking account of the effect of statistical multiplexing. In our previous paper, we proposed a new stochastic network calculus for many flows from an approach like large deviations techniques, and obtained asymptotic end-to-end evaluation formulas for output burstiness and backlog. However, we could not obtain the asymptotic evaluation formula for end-to-end delay in this framework. In this paper, we enhance the calculation in the previous paper. Concretely we enlarge the domain of the deconvolution operator. Then in addition to for the backlog and the output burstiness in tandem networks, for the delay VL(t) of L flows at time t, using min-plus algebra, we obtain a function of d 0 by which lim supL → ∞ L-1 log P(VL(t) d) are bounded from above. We then discuss an application of the result to a tandem network with cross traffic and give a numerical result.