Asymptotic properties of sojourn times in multiclass time-shared systems

  • Authors:
  • Arzad a. Kherani

  • Affiliations:
  • General motors india science labbangalore, india e-mail: arzad.kherani@gm.com

  • Venue:
  • Probability in the Engineering and Informational Sciences
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider two multiclass discriminatory process sharing (DPS)-like time-shared M/G/1 queuing systems in which the weight assigned to a customer is a function of its class as well as (1) the attained service of the customer in the first system and (2) the residual processing time of the customer in the second system. We study the asymptotic slowdown, the ratio of expected sojourn time to the service requirement, of customers with very large service requirements. We also provide various results dealing with ordering of conditional mean sojourn times of any two given classes. We also show that the sojourn time of an arbitrary customer of a particular class in the standard DPS system (static weights) with heavy-tailed service requirements has a tail behavior similar to that of a customer from the same class that starts a busy period.