Performance evaluation of distributed systems and service-oriented architectures is often based on stochasticmodels, such as closed queueing networkswhich are commonly solved by theMean Value Analysis (MVA) algorithm. However, the MVA is unable to solve models with hundreds or thousands of users accessing services of multiple classes, a configuration that is often useful to predict the performa...

Abstract: This paper examines the steady state behavior of an M/G/1 queue with repeated attempts in which the server may provide an additional second phase of service. This model generalizes both the classical M/G/1 retrial queue and the M/G/1 queue with classical waiting line and second optional service. We carry out an extensive stationary analysis of the system, including existence of statio...

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 ...

In this paper a closed formula to estimate the mean waiting time in the M/H2/s queue is presented. The proposed formula takes into account the first three moments of the H2 holding time distribution and is extremely easy to compute, while the accuracy is similar to other more complex approximations. The results presented here can be extended to calculate the mean waiting time in the M/G/s queue...

The expected wait in the Gi/G/1 queue is related to the mean and variance of the idle time. For arrival distributions which are 1FR or have mean residual life bounded by r-, simple bounds are obtained which A. give, for example, the expected number in queue to within at most one customer. By equating input with output, relations between random variables are used to obtain expressions foi the mo...

In this paper we compare the queue performances of three different traces with gaussian marginals generated using the discrete-time Fractional Gaussian Noise algorithm [1]. We have introduced some additional features in one out of the three traces generation process to have less dependence on very large time scale (as it is the case in video traffic). We highlight the issues at stake when we lo...

in this paper, a state feedback h¥ controller is proposed in order to design an active queue management (aqm) system based on congestion control algorithm for networks supporting tcp protocols. in this approach, the available link bandwidth is modeled as a time-variant disturbance. the purpose of this paper is to design a controller which is capable of achieving the queue size and can guarantee...