Performance and stability of communication networks via robust exponential bounds
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)
HSDPA/HSUPA for UMTS: High Speed Radio Access for Mobile Communications
HSDPA/HSUPA for UMTS: High Speed Radio Access for Mobile Communications
Scaling properties of statistical end-to-end bounds in the network calculus
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Fundamentals of WiMAX: Understanding Broadband Wireless Networking (Prentice Hall Communications Engineering and Emerging Technologies Series)
Closed-form analysis of end-to-end network delay with Markov-modulated Poisson and fluid traffic
Computer Communications
WiMAX: Technology for Broadband Wireless Access
WiMAX: Technology for Broadband Wireless Access
LTE for UMTS - OFDMA and SC-FDMA Based Radio Access
LTE for UMTS - OFDMA and SC-FDMA Based Radio Access
Queuing with adaptive modulation and coding over wireless links: cross-Layer analysis and design
IEEE Transactions on Wireless Communications
Statistical service assurances for traffic scheduling algorithms
IEEE Journal on Selected Areas in Communications
Proceedings of the 5th ACM symposium on QoS and security for wireless and mobile networks
| Hi-index | 0.00 |
In this paper, we develop a method for analyzing time-varying wireless channels in the context of the modern theory of the stochastic network calculus. In particular, our technique is applicable to channels that can be modeled as Markov chains, which is the case of channels subject to Rayleigh fading. Our approach relies on theoretical results on the convergence time of reversible Markov processes and is applicable to chains with an arbitrary number of states. We provide two expressions for the delay tail distribution of traffic transmitted over a fading channel fed by a Markov source. The first expression is tighter and only requires a simple numerical minimization, the second expression is looser, but is in closed form.