In the reordering buffer problem (RBP), a server is asked to process a sequence of requests lying in a metric space. To process a request the server must move to the corresponding point in the metric. The requests can be processed slightly out of order; in particular, the server has a buffer of capacity k which can store up to k requests as it reads in the sequence. The goal is to reorder the r...

in this research, both resource allocation and reactive resource allocation problems in multi-server dynamic pert networks are analytically modeled, where new projects are expected to arrive according to a poisson process, and activity durations are also known as independent random variables with exponential distributions. such system is represented as a queuing network, where multi servers at ...

The buffer manager is integral to the performance, scalability, and reliability of Oracle’s Universal Dam Server, a high performance object-relational database manager that provides robust data-management services for a variety of applications and tools. The rich functionality of the Universal Data Server poses special challenges to the design of the buffer manager. Buffer management algorithms...

Since it is essentially impossible to write large-scale software without errors, any intrusion tolerant system must be able to tolerate rapid, repeated unknown attacks without exhausting its redundancy. Our system provides continued application services to critical users while under attack with a goal of less than 25% degradation of productivity. Initial experimental results are promising. It i...

We consider a system of two separate finite-buffer M/M/1 queues served by a single server, where the switching mechanism between the queues is thresholdbased, determined by the queue which is not being served. Applications may be found in data centers, smart traffic-light control and human behavior. Specifically, whenever the server attends queue i (Qi ) and the number of customers in the other...

We analyze and compare three (s,S) inventory systems with positive service time and retrial of customers. In all of these systems, arrivals of customers form a Poisson process and service times are exponentially distributed. When the inventory level depletes to s due to services, an order of replenishment is placed. The lead-time follows an exponential distribution. In model I, an arriving cust...

In this paper, we study a finite capacity queue where the arrival process is special case of discrete time Markov modulated Poisson process, service times are generally distributed, and server takes repeated vacations when system empty. The buffer acceptance strategy based on generalized push-out scheme: full, an arriving customer pushes out Nth in queue, N values between 2 system, joins end qu...

In this paper we consider the problem of allocating servers to maximize throughput for tandem queues with no buffers. We propose an allocation method that assigns servers to stations based on the mean service times and the current number of servers assigned to each station. A number of simulations are run on different configurations to refine and verify the algorithm. The algorithm is proposed ...

Multimedia streaming applications consume significant amounts of server and network resources due to the high bandwidth requirements and long durations of audio and video clips. For popular videos, periodic broadcast techniques exploit the client’s buffer space and network reception bandwidth capabilities to reduce server and network transmission bandwidth requirements. In this paper, we system...

This paper describes an approximation procedure for determining the throughput time distribution of material handling and service systems modeled as queuing networks. We consider finite buffer capacities and general distributed processing times in terms of discrete probability functions. In order to quantify the influence of blocking caused by finite buffers, we present a decomposition approach...