Sojourn times in (discrete) time shared systems and their continuous time limits

@article{Kherani2008SojournTI,
  title={Sojourn times in (discrete) time shared systems and their continuous time limits},
  author={Arzad Alam Kherani},
  journal={Queueing Systems},
  year={2008},
  volume={60},
  pages={171-191}
}
We study the mean sojourn times in two M/G/1 weighted round-robin systems: the weight of a customer at any given point in time in the first system is a function of its age (imparted service), while in the second system the weight is a function of the customer’s remaining processing time (RPT). We provide a sufficient condition under which the sojourn time of a customer with large service requirement (say, x) and that arrives in the steady state is close to that of a customer which starts a busy… CONTINUE READING

Citations

Publications citing this paper.