Many real systems such as production lines are modeled as queueing networks with finite buffers. In such a queueing model, blocking occurs if a customer attempts to enter the next queue whose buffer is full and not available. In this case, the customer is forced to wait until the next queue can be entered. General queueing networks with blocking do not have a product-form solution. Therefore, i...

We consider a d-node tandem queue with arrival process and light-tailed service processes at all queues i.i.d. and independent of each other. We consider three variations of the probability that the number of customers in the system reaches some high level N , namely during a busy cycle, in steady state, and upon arrival of a new customer. We show that their decay rates for large N have the sam...

We first describe an approximation method for fitting a two-state MMBP to the departure process of a two-state MMBP/Geo/l/K queue. The fitted MMBP is shown to have a good accuracy. The model for fitting a two-state MMBP is then used in a simple decomposition algorithm to analyze a tandem conflguration of finite capacity queues with customer 108s. The decomposition algorithm is validated by comp...

Recently, a state-dependent change of measure for simulating overflows in the two-node tandem queue was proposed by Dupuis et al. (Ann. Appl. Probab. 17(4):1306– 1346, 2007), together with a proof of its asymptotic optimality. In the present paper, we present an alternative, shorter and simpler proof. As a side result, we obtain interpretations for several of the quantities involved in the chan...

active queue management (aqm) plays an important role in the internet congestion control. it tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. random early detection (red) is the most popular active queue management algorithm that has been implemented in the in internet routers and is trying to supply low delay and low packet loss. red algori...