Explicit formulas for the moments of the sojourn time in the M/G/1 processor sharing queue with permanent jobs

2005/12/13 by S. F. Yashkov, Yashkov, S. F.
Business, Management and Accounting · Computer Science · Engineering · #60K25 (Primary) 90B22 (Secondary) #Advanced Queuing Theory Analysis #FOS: Mathematics #Network Traffic and Congestion Control #Probability (math.PR) #Urban Transport Systems Analysis

paper · pdf · doi:10.48550/arxiv.math/0512281

openalex publication_date 2005/12/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We give some representation about recent achievements in analysis of the M/G/1 queue with egalitarian processor sharing discipline (EPS). The new formmulas are derived for the j-th moments (j=1,2,...) of the (conditional) stationary sojourn time in the M/G/1--EPS queue with K (K=0,1,2,...) permanent jobs of infinite size. We discuss also how to simplify the computations of the moments.

Related

• Asymptotic analysis of the sojourn time of a batch in an M^[X]/M/1 Processor Sharing Queue
• Stationary Performance Analysis of Grishechkin Processor-Sharing Queues: An Integral Equation Approach
• On the sojourn time of a batch in the M^[X]/M/1 Processor Sharing\n Queue
• On the sojourn of an arbitrary customer in an M/M/1 Processor Sharing Queue
• On the Sojourn Time Distribution in a Finite Population Markovian Processor Sharing Queue