Coupled processors with regularly varying service times

Abstract
Consider two queues that are coupled in the follow- ing way. Whenever both queues are non-empty, each server serves its own queue at unit speed. However, if server has no work in its own queue, then it assists server , resulting in an increased service speed in the first queue. This kind of coupling is related to generalized processor sharing. We assume that the service request distributions at both queues are regularly varying at infinity of index and , viz., they are heavy-tailed. Under this assumption, we present a detailed analysis of the tail behaviour of the workload distribution at each queue. If the guaranteed unit speed of server is already sufficient to handle its offered traffic, then the w orkload distri- bution at the first queue is shown to be regularly varying at in finity of index . But if it is not sufficient, then the workload distribution a t the first queue is shown to be regularly varying at infinity of index

This publication has 10 references indexed in Scilit: