Transient GI/MSP/1/N Queue.

A non-zero correlation between service times can be encountered in many real queueing systems. An attractive model for correlated service times is the Markovian service process, because it offers powerful fitting capabilities combined with analytical tractability. In this paper, a transient study of the queue length in a model with MSP services and a general distribution of interarrival times is performed.

On the Influence of AQM on Serialization of Packet Losses.

We study the influence of the active queue management mechanism based on the queue size on the serialization of packet losses, i.e., the occurrences of losses in long, consecutive series.

Non-Stationary Characteristics of AQM Based on the Queue Length.

We performed a non-stationary analysis of a class of buffer management schemes for TCP/IP networks, in which the arriving packets were rejected randomly, with probability depending on the queue length. In particular, we derived formulas for the packet waiting time (queuing delay) and the intensity of packet losses as functions of time. These results allow us to observe how the evolution of the waiting time and losses depend on initial conditions (e.

Impact of the Dropping Function on Clustering of Packet Losses.

The dropping function mechanism is known to improve the performance of TCP/IP networks by reducing queueing delays and desynchronizing flows. In this paper, we study yet another positive effect caused by this mechanism, i.e.

Burst ratio for a versatile traffic model.

We deal with a finite-buffer queue, in which arriving jobs are subject to loss due to buffer overflows. The burst ratio parameter, which reflects the tendency of losses to form long series, is studied in detail. Perhaps the most versatile model of the arrival stream is used, i.

AQM based on the queue length: A real-network study.

Active Queue Management (AQM) is recommended by Internet Engineering Task Force to mitigate the bufferbloat phenomenon in the Internet. In this paper, we show the results of comprehensive measurements carried out in our university network, in which a device with an AQM algorithm, designed and programmed for this purpose, was running. The implemented AQM algorithm was based on the dropping function, i.

On the stability of queues with the dropping function.

In this paper, the stability of the queueing system with the dropping function is studied. In such system, every incoming job may be dropped randomly, with the probability being a function of the queue length. The main objective of the work is to find an easy to use condition, sufficient for the instability of the system, under assumption of Poisson arrivals and general service time distribution.

On the Transient Queue with the Dropping Function.

We deal with a queueing system, in which arriving packets are being dropped with the probability depending on the queue size. Such a scheme is used in several active queue management schemes proposed for Internet routers. In this paper, we derive and analyze a selected transient characteristic of the model, i.

Queues with the dropping function and general service time.

We present an analysis of queueing systems with the dropping function, infinite buffer and general distribution of the service time. Firstly, a stability condition, more general than the well-known ρ < 1, is proven. Secondly, the formulas for the queue size distribution, loss ratio and mean duration of the busy period, are derived.

Queues with Dropping Functions and General Arrival Processes.

In a queueing system with the dropping function the arriving customer can be denied service (dropped) with the probability that is a function of the queue length at the time of arrival of this customer. The potential applicability of such mechanism is very wide due to the fact that by choosing the shape of this function one can easily manipulate several performance characteristics of the queueing system. In this paper we carry out analysis of the queueing system with the dropping function and a very general model of arrival process--the model which includes batch arrivals and the interarrival time autocorrelation, and allows for fitting the actual shape of the interarrival time distribution and its moments.

Achieving High Resolution Timer Events in Virtualized Environment.

Virtual Machine Monitors (VMM) have become popular in different application areas. Some applications may require to generate the timer events with high resolution and precision. This however may be challenging due to the complexity of VMMs.