Performance analysis of a fluid queue with random service rate in discrete time

Authors:
Onno J. Boxma;Vinod Sharma;D. K. Prasad
Affiliations:
Dept of Mathematics and Computer Science and EURANDOM, Eindhoven University of Technology, Eindhoven, The Netherlands;Dept Elect. Comm. Engg., Indian Istitute of Science, Bangalore, India;Dept Elect. Comm. Engg., Indian Istitute of Science, Bangalore, India
Venue:
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Year:
2007

Citing 11
Cited 0

Fluid queues and regular variation

Performance Evaluation
Discrete-Time Models for Communication Systems Including ATM

Discrete-Time Models for Communication Systems Including ATM
Asymptotics for transient and stationary probabilities for finite and infinite buffer discrete time queues

Queueing Systems: Theory and Applications
Some limit theorems for regenerative queues

Queueing Systems: Theory and Applications
Appendix: A primer on heavy-tailed distributions

Queueing Systems: Theory and Applications
Wi-Fi Handbook: Building 802.11b Wireless Networks

Wi-Fi Handbook: Building 802.11b Wireless Networks
Rate Performance Objectives of Multihop Wireless Networks

IEEE Transactions on Mobile Computing
Stable scheduling policies for fading wireless channels

IEEE/ACM Transactions on Networking (TON)
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks

Proceedings of the 11th annual international conference on Mobile computing and networking
Queueing networks with discrete time scale: explicit expressions for the steady state behavior of discrete time stochastic networks

Queueing networks with discrete time scale: explicit expressions for the steady state behavior of discrete time stochastic networks
Stability and capacity of regular wireless networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a fluid queue in discrete time with random service rate. Such a queue has been used in several recent studies on wireless networks where the packets can be arbitrarily fragmented. We provide conditions on finiteness of moments of stationary delay, its Laplace-Stieltjes transform and various approximations under heavy traffic. Results are extended to the case where the wireless link can transmit in only a few slots during a frame.