Stream tapping–also known as patching–can reduce the bandwidth requirements of video-on-demand services by allowing new customer requests to “tap” the data streams of other requests for the same video. Previous studies have shown that stream tapping works best when the request arrival rate does not exceed ten to twenty requests per hour for a two-hour video. At higher arrival rates, it performs...

We consider a class of stochastic processing networks. Assume that the networks satisfy a complete resource pooling condition. We prove that each maximum pressure policy asymptotically minimizes the workload process in a stochastic processing network in heavy traffic. We also show that, under each quadratic holding cost structure, there is a maximum pressure policy that asymptotically minimizes...

when a person joins in an organization, he becomes authorize to take some decisions on behalf of that organization; means he is given some authority to exercise. After some time, on the basis of his performance in the organization, he is given promotion and he becomes eligible to exercise to some higher authorities. And further, he may get some higher promotion or he may leave the organization....

Based on queuing theory we develop an analytical approximation for low and high priority packet delays in a Spatial Reuse Protocol (SRP) ring.

One of two simple hypotheses is correct about the unknown arrival rate and jump distribution of a compound Poisson process. We start observing the process, and the problem is to decide on the correct hypothesis as soon as possible and with the smallest probability of wrong decision. We find a Bayes-optimal sequential decision rule and describe completely how to calculate its parameters without ...

We analyze a discrete-time queue with variable service capacity, such that the total amount of work that can be performed during each time slot is a stochastic variable that is geometrically distributed. We study the buffer occupancy by constructing an analogous model with fixed service capacity. In contrast with classical discrete-time queueing models, however, the service times in the fixed-c...

In this work, the fluid limit approach is applied to find stability conditions of two models of queueing networks with interacting servers. We first consider a two-station queueing model with two customer classes in which customers that are awaiting service at any queue can move to the other station, whenever it is free, to be served there immediately. Then we consider a cascade-type three-stat...