Randomized parallel communications on an extension of the omega network
Journal of the ACM (JACM)
A histogram-based model for video traffic behavior in an ATM multiplexer
IEEE/ACM Transactions on Networking (TON)
A central-limit-theorem-based approach for analyzing queue behavior in high-speed networks
IEEE/ACM Transactions on Networking (TON)
On the modeling of voice sources regulated by dual leaky buckets
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Two different approaches for providing QoS in the Internet backbone
Computer Communications
A network calculus with effective bandwidth
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scaling properties of statistical end-to-end bounds in the network calculus
IEEE Transactions on Information Theory
Characterizing Superposition Arrival Processes in Packet Multiplexers for Voice and Data
IEEE Journal on Selected Areas in Communications
Proceedings of the 5th ACM symposium on QoS and security for wireless and mobile networks
QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms
Journal of Network and Computer Applications
An analytical expression for service curves of fading channels
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
| Hi-index | 0.24 |
This paper develops a method for using traffic sources modelled as a Markov-modulated Poisson process (MMPP) and Markov-modulated fluid process (MMFP) in the framework of the bounded-variance network calculus, a novel stochastic network calculus framework for the approximated analysis of end-to-end network delay. The bounded-variance network calculus is an extension to multi-hop end-to-end paths of the Choe's and Shroff's Central-Limit-Theorem-based analysis of isolated network nodes. The input of the analysis is the statistical traffic envelope of sources, which is not available for generic MMPP and MMFP sources. The paper provides two statistical traffic envelopes, named two-moment and linear envelope, for general MMPP and MMFP sources, which can be used as an input of Central-Limit-Theorem-based frameworks for the analysis of network delay and, in turn, make it possible to use the rich collection of MMPP and MMFP models of voice, audio, data and video sources available in the literature. In this way, it is possible to avoid the computational complexity of traditional Markov analysis of end-to-end delay with MMPP and MMFP sources. With the linear envelope we can use simple analytical closed-form solutions for many important schedulers.