The diffusion approximation of the Multiclass Processor Sharing queue

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ghazali, Mohamed, Tahar, Abdelghani Ben, Ezzidani, Amal
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866908341932916736
author Ghazali, Mohamed
Tahar, Abdelghani Ben
Ezzidani, Amal
author_facet Ghazali, Mohamed
Tahar, Abdelghani Ben
Ezzidani, Amal
contents This paper considers a multiclass processor-sharing queue with feedback. Jobs arrive according to renewal processes, and service times follow general distributions. Upon service completion, jobs may either depart the system or re-enter as a different class according to a probabilistic, Jackson-like routing mechanism. Under heavy-traffic conditions, we establish a diffusion approximation for a measure-valued process tracking the residual service times of jobs.
format Preprint
id arxiv_https___arxiv_org_abs_2502_12824
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle The diffusion approximation of the Multiclass Processor Sharing queue
Ghazali, Mohamed
Tahar, Abdelghani Ben
Ezzidani, Amal
Probability
60K25, 68M20, 90B22
This paper considers a multiclass processor-sharing queue with feedback. Jobs arrive according to renewal processes, and service times follow general distributions. Upon service completion, jobs may either depart the system or re-enter as a different class according to a probabilistic, Jackson-like routing mechanism. Under heavy-traffic conditions, we establish a diffusion approximation for a measure-valued process tracking the residual service times of jobs.
title The diffusion approximation of the Multiclass Processor Sharing queue
topic Probability
60K25, 68M20, 90B22
url https://arxiv.org/abs/2502.12824