Two-buffer fluid models with multiple ON-OFF inputs and threshold assistance

Authors:
Guy Latouche;Giang T. Nguyen;Zbigniew Palmowski
Affiliations:
Université Libre de Bruxelles, Brussels, Belgium;Université Libre de Bruxelles, Brussels, Belgium;University of Wrocław, Wrocław, Poland
Venue:
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Year:
2011

Citing 7
Cited 0

Effective bandwidth of general Markovian traffic sources and admission control of high speed networks

IEEE/ACM Transactions on Networking (TON)
Analysis, approximations and admission control of a multi-service multiplexing system with priorities

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
First Passage Times in Fluid Models with an Application to Two Priority Fluid Systems

IPDS '96 Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96)
BOUNDS FOR FLUID MODELS DRIVEN BY SEMI-MARKOV INPUTS

Probability in the Engineering and Informational Sciences
Matrix-analytic methods for fluid queues with finite buffers

Performance Evaluation
Hitting probabilities and hitting times for stochastic fluid flows: The bounded model

Probability in the Engineering and Informational Sciences
Resource-Sharing Queueing Systems with Fluid-Flow Traffic

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a two-buffer fluid model with N ON-OFF inputs and threshold assistance, which is an extension of the same model with N = 1 in [18]. While the rates of change of both buffers are piecewise constant and dependent on the underlying Markovian phase of the model, the rates of change for Buffer 2 are also dependent on the specific level of Buffer 1. This is because both buffers share a fixed output capacity, the precise proportion of which depends on Buffer 1. The generalization of the number of ON-OFF inputs necessitates slight modifications in the original rules of output-capacity sharing from [18], and considerably complicates both the theoretical analysis and numerical computation of various performance measures. Here, we give a short explanation on how to derive the marginal probability distribution of Buffer 1, and bounds for that of Buffer 2. In an upcoming paper, we describe the procedures in more details. Furthermore, restricting Buffer 1 to a finite size, we determine its marginal probability distribution in the specific case of N = 1, thus providing numerical comparisons to the corresponding results in [18] where Buffer 1 is assumed to be infinite. We also demonstrate how this imposed restriction effects the bounds of marginal probabilities for Buffer 2.