The total overflow during a busy cycle in a markov-additive finite buffer system

Authors:
Lothar Breuer
Affiliations:
Institute of Mathematics and Statistics, University of Kent, Canterbury, UK
Venue:
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Year:
2010

Citing 4
Cited 0

Exact Buffer Overflow Calculations for Queues via Martingales

Queueing Systems: Theory and Applications
Time dependent analysis of finite buffer fluid flows and risk models with a dividend barrier

Queueing Systems: Theory and Applications
Continuity of the M/G/c queue

Queueing Systems: Theory and Applications
Hitting probabilities and hitting times for stochastic fluid flows: The bounded model

Probability in the Engineering and Informational Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a finite buffer system where the buffer content moves in a Markov-additive way while it is strictly between the buffer boundaries. Upon reaching the upper boundary of the buffer the content is not allowed to go higher and for every additional input into the system a penalty must be paid (to negotiate buffer overflow). At the lower boundary (empty buffer) the process terminates. For this system we determine the joint distribution of the total overflow and the last time of being at the upper boundary. The analysis is performed using excursion theory for Markov-additive processes.