Over the last decade, importance sampling has been a popular technique for the efficient estimation of rare event probabilities. This paper presents an approach for applying balanced likelihood ratio importance sampling to the problem of quantifying the probability that the content of the second buffer in a two node tandem Jackson network reaches some high level before it becomes empty. Heurist...

We study a service facility modelled as a single server queueing system with Poisson arrivals and limited or unlimited buffer size. In systems with unlimited buffer size, the service times have general distributions, whereas in finite buffered systems service times are exponentially distributed. Arriving customers enter if there is room in the facility and if they are willing to pay the posted ...

We consider a discrete-time single-server queue with arrivals governed by a stationary Markov chain, where no arrivals are assumed to occur only when the Markov chain is in a particular state. This assumption implies that off-periods in the arrival process are i.i.d. and geometrically distributed. For this queue, we establish the exact relationship between queue length distributions in a finite...

The paper proposes local and global optimization schemes for efficient TCP buffer allocation in an HTTP server. The proposed local optimization scheme dynamically adjusts the TCP send-buffer size to the connection and server characteristics. The global optimization scheme divides a certain amount of buffer space among all active TCP connections. These schemes are of increasing importance due to...

We not only present an alternative and simpler approach to find steady-state distributions of the number jobs for finite-space queueing model Geo/Ga,Y/1/N using roots inherent characteristic equation, but also correct errors in some published papers. The server has a random service capacity Y, it processes when system is at least ‘a’, threshold value. main advantage this process that gives unif...

Recently, there has been a trend toward designing video-on-demand systems using parallel-server architectures. By exploiting server-level parallelism, researchers can break through the performance limit of a single server, while keeping the system cost low by leveraging on commodity hardware platforms. A number of studies have demonstrated the feasibility of building parallel video servers arou...

The combined control problem of connection admission, flow rate, and bandwidth allocation (capacity, service-rate) in ATM based networks under nonstationary conditions has recently attained considerable importance. In an earlier paper we adopted a nonlinear control approach to derive an integrated control strategy (for the finite buffer and finite server case) that is insensitive to any propaga...

We investigate the control problem of the optimal choice of idle server (if any) for arriving customer in order to minimize the mean system time (waiting time + service time). The considered MAP/MAP/N queue consists of a common infinite buffer and multiple identical servers with MAP service processes whose phases (internal states) are known. Customers arrive according to a MAP (whose phase is a...

A video server allows to deliver multiple video streams to different clients. To provide the required amount of storage and bandwidth, a video server must contain a large number of disks. Since the retrieval rate of the disk and the consumption rate of the clients differ, the data retrieved from disk need to be temporarily stored in main memory, which is an important cost factor in a video serv...