This paper analyzes a finite-buffer queueing system, where customers arrive in batches and the accepted are served by single server. The service is assumed to be dependent on batch-size follows general bulk rule. inter-arrival times of correlated they represented through batch Markovian arrival process (BMAP). Computation procedure queue-length distributions at post-batch-service completion, an...

The phenomena are balking can be said to have been observed when a customer who has arrived into queuing system decides not join it. Reverse is particular type of wherein the probability that will balk goes down as size up and vice versa. Such behavior in investment firms (insurance company, Mutual Fund Company, banks etc.). As number customers firm up, it creates trust among potential investor...

The paper studies approximations and control of a processor sharing (PS) server where the service rate depends on number jobs occupying server. such system is implemented by imposing limit that can share concurrently, with rest waiting in first-in-first-out (FIFO) buffer. A desirable scheme should strike right balance between efficiency (operating at high rate) parallelism (preventing small fro...

This paper analyses a multiple class single server M/M/1/K queue with finite capacity under weighted fair queuing (WFQ) discipline. The Poisson process has been used to model the multiple classes of arrival streams. The service times have exponential distribution. We assume each class is assigned a virtual queue and incoming jobs enter the virtual queue related to their class and served in FIFO...

Realistic source models reflecting the main characteristics of traffic sources such as their correlation structure are necessary to investigate the performance of ATM network components. In this paper we study a discrete-time single server queueing system with a non-renewal input process which fulfills the above requirements while still being analytically tractable. An exact analysis of the inf...

Bandwidth smoothing techniques for stored video perform end to end workahead transmission of frames into the client playback buffer, in advance of their display times. Such techniques are very effective in reducing the burstiness of the bandwidth requirements for transmitting compressed, stored video. This paper addresses online bandwidth smoothing for a growing number of streaming video applic...

This paper proposes a new concurrent data structure, called parallel hash table, for synchronizing the access of multiple threads to resources stored in a shared buffer. We prove theoretically the complexity of the operations and the upper limit on the thread conflict probability of the parallel hash table. To empirically evaluate the proposed concurrent data structure, we compare the performan...

We study the problem of using proxy servers to stream video stored at a geographically separate location. The separation of the server and the storage introduces a nonnegligible delay in retrieving video frames in real time. To ensure network stability, we use an additive-increase and multiplicative-decrease transport protocol to support the streaming process. We develop an effective scheme to ...

This paper studies load balancing for many-server (N servers) systems. Each server has a buffer of size b − 1, and can have at most one job in service 1 jobs the buffer. The time follows Coxian-2 distribution. We focus on steady-state performance policies heavy traffic regime such that normalized system is λ = N−α 0 < α 0.5. identify set achieve asymptotic zero waiting. include several classica...