In this contribution, we investigate the performance of the output buffer of an ‘ondemand’ video streaming server. The server maintains a local database of stored video clips and movies which can be streamed to the users upon request. We assume that the stored video is encoded in a scalable way, which means that the data streams contain a base layer ensuring a minimum of guaranteed quality and ...

This paper deals with the joint optimization of the number of buffers and servers, an important issue since buffers and servers represent a significant amount of investment for many companies. The joint buffer and server optimization problem (BCAP) is a non-linear optimization problem with integer decision variables. The performance of the BCAP is evaluated by a combination of a two-moment appr...

In a client-server system, when LRU or its variant buffer replacement strategy is used on both the client and the server, the cache performance on the server side is very poor mainly because of pages duplicated in both systems. This paper introduces a server buffer replacement strategy which uses a replaced page-id than a request page-id, for the primary information for its operations. The impo...

For a Markovian queueing network with two stations in tandem, finite intermediate buffer, and M flexible servers, we study how the servers should be assigned dynamically to stations in order to obtain optimal long-run average throughput. We assume that each server can work on only one job at a time, that several servers can work together on a single job, and that the travel times between statio...

We consider a finite-buffer single server queueing system with queue-length dependent vacations where arrivals occur according to a batch Markovian arrival process (BMAP). The service discipline is P-limited service, also called E-limited with limit variation (ELV) where the server serves until either the system is emptied or a randomly chosen limit of L customers has been served. Depending on ...

In this paper, we consider a discrete-time single-server finite-buffer batch arrival queue in which customers are served in batches according to a general bulk-service rule, that is, at least ‘a’ customers are needed to start a service with a maximum serving capacity of ‘b’ customers. The server takes a (single and multiple) vacation as soon as the queue length falls below ‘a’ at the completion...

Keywords: Fluid queue Markov process Buffer occupancy distribution IEEE 802.11 wireless networks Performance measures a b s t r a c t We present a fluid queue model driven by two independent finite state birth–death processes with the objective to study the buffer occupancy distribution in any intermediate node in a communication network. In a communication network, at any node, the arrival and...

In this paper we study two echelon multi-server tandom queueing systems where customers arrive according to a poisson process with two different rates. The service rates at both echelons are independent of each other. The service times of customers is assumed to be completed in two stages. The service times at each stage are exponentially distributed. At the first stage, the customers may balk ...

In this paper we describe an approximate method for the analysis of an open network of finite capacity queues. Finite buffer capacities at the nodes introduce blocking of jobs that finish service at a node and find that the destination node is full at that time. When this happens, we assume that the blocked job is held at the server of the queue where it just completed service, blocking that se...

In this paper, a finite-source retrial queueing system with twoway communication is investigated the help of simulation program own. If randomly arriving request from finds single server idle its service starts immediately, otherwise it joins an orbit where generates retrial/repeated calls after random time. To increase utilization when becomes time outgoing called for infinity source. Upon arr...