Operations Research · 1996 · 59 citations · 14 references
BusinessComputer ScienceProbability TheoryQueuing TheoryStochastic ProcessesQueue Length DistributionsQueueing AnalysisQueueing ProcessesQueueing SystemsQueueing TheoryQueuing AnalysisHeavy Traffic TheoryHeavy-traffic LimitsHeavy-traffic Queue Length DistributionPoisson ArrivalsProcessor Sharing DisciplineProcessor Sharing QueuesQueue Length AsymptoticsQueue Length Probability Distribution
In this paper, we study a multiple class discriminatory processor-sharing queue. The queue is assumed to have Poisson input and exponentially distributed service times. In this discipline there are K classes of customers. When there are n i customers present in the system of class i(i = 1, …, K), each member of class j receives a fraction of the server's capacity given by α j /∑ i=1 K n i α i . Thus, associated with class i customers is a weight α i which determines the level of service discrimination. For this problem, we find the moments of the queue-length distribution as a solution of linear simultaneous equations. We also prove a heavy traffic limit theorem for the joint queue-length distribution for this queue.
14
Leonard Kleinrock · Journal of the ACM · 1967 · 368 citations · Full text
Sharing a Processor Among Many Job Classes
Guy Fayolle, Isi Mitrani, Roudolf Iasnogorodski · Journal of the ACM · 1980 · 178 citations · Full text