This paper considers a multiclass Markovian fluid queue with a buffer of infinite capacity. Input rates of fluid flows in respective classes and the drain rate from the buffer are modulated by a continuous-time Markov chain with finite states. We derive the joint Laplace-Stieltjes transform for the stationary buffer contents in respective classes, assuming the FIFO service discipline. Further w...

We study the problem of buffer management in QoS-enabled network switches in the bounded delay model where each packet is associated with a weight and a deadline. We consider the more realistic situation where the network switch has a finite buffer size. A 9.82-competitive algorithm is known for the case of multiple buffers (Azar and Levy, SWAT’06). Recently, for the case of a single buffer, a ...

In this paper, it is studied about finite buffer bulk service queue M/G (a,b) /1 with multiple vacations and some analytical results, relations among queue length distributions, computations of state probabilities at various epochs are included.

In this paper we study a multiserver finite buffer queue in which customers have an stochastic deadline of phase-type until the beginning of their service. The following service disciplines are considered: FCFS (First-Come First-Served), LCFS (Last-Come First-Served) and SIRO (Service In Random Order) along with a parameterizable probabilistic push-out mechanism. Although this model has many ap...

We consider M/G/1 queues with workload-dependent arrival rate, service speed, and restricted accessibility. The admittance of customers typically depends on the amount of work found upon arrival in addition to its own service requirement. Typical examples are the finite dam, systems with customer impatience and queues regulated by the complete rejection discipline. Our study is motivated by que...

We consider a feedback finite fluid queue (FFFQ, for short) with downward jumps, where the fluid flow rate and the jump size are controlled by a background Markov chain with a finite state space. The ”feedback” means that the background process may change according to the level of the buffer, which is used for modeling TCP/IP flow. The matrix analytic technique has been successsfully applied to...

We obtain equivalencies between closed queueing networks with blocking with respect to buffer capacities and the number of customers in the network. These results can be used in approximations, in the buffer allocation problem as well as to explain the behavior of closed queueing networks with finite buffers. We also present exact efficient solutions for special cases.

We consider an AWGN channel with a transmitter powered by an energy harvesting source. The node is equipped with a finite energy buffer. Such a system can be modelled as a channel with side information (about energy in the energy buffer) causally known at the transmitter. The receiver may or may not have the side information. We prove that Markov energy management policies are sufficient to ach...

We consider the continuous model of a two machines with finite intermediary buffer production line. The behavior of the machines is controlled by finite homogeneous Markov chains. We study a numerical algorithm for the integration of the system of partial differential equations describing the transient behavior. Stochastic fluid models are used for performance evaluation of high-speed computer ...