Motivated by applications in computer networks, in this talk, we consider a tandem queue with feedback.In this model, both the interarrival time and the service time are exponential. Upon completion of the service at thesecond station, the customer either leaves the system with probability p or goes back together with all customersin the second queue to the first queue with probabil...

We consider a two dimensional time varying tandem queue with coupled processors. We assume that jobs arrive to the first station as a non-homogeneous Poisson process. When each queue is non-empty, jobs are processed separately like an ordinary tandem queue. However, if one of the processors is empty, then the total service capacity is given to the other processor. This problem has been analyzed...

Finding a versatile performance analysis model makes a way for anytime anywhere wireless access in heterogeneous network. The major challenges of handover failure during vertical handover process necessitates careful analysis of handover calls arriving to the candidate network. The motivation is to utilize the tandem queuing model for wireless next generation network and facilitate zero level f...

We present a geometric interpretation of a product form stationary distribution for a d-dimensional semimartingale reflecting Brownian motion (SRBM) that lives in the nonnegative orthant. The d-dimensional SRBM data can be equivalently specified by d + 1 geometric objects: an ellipse and d rays. Using these geometric objects, we establish necessary and sufficient conditions for characterizing p...

Size-based scheduling has proved to be effective in a lot of scenarios involving Internet traffic. In this work, we focus on the Least Attained Service Policy, a popular size-based scheduling policy. We tackle two issues that have not received much attention so far. First, the variance of the conditional response time. We prove that the classification proposed by Wierman et al. [11], which clas...

existence of capacity drop phenomenon, as the difference between pre-queue and queue discharge flow rates, has been one of the controversial concepts of traffic engineering. several researches have focused on capacity drop existence and also its estimation issues. this paper aims to estimate capacity drop based not only on a comparison between breakdown and queue discharge flow rates, but also ...

In this paper we investigate the performances of the EFCIbased (Explicit Forward Congestion Indication) and ER-based (Explicit Rate; EPRCA in particular) algorithms for the rate-based flow control of the ABR (Available Bit Rate) traffic in an ATM network. We consider the case of multiple switches in tandem. We present several definitions of a bottleneck, and provide conditions that determine wh...