.png){kind=icon}
.png){kind=icon}
Return
A Restless Time-Fractional Multiclass Queue
.png){kind=icon}
PRE
AI
DOI：10.1007/s10959-026-01494-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study a single-server priority queue with a finite number of classes, in which the arrivals follow a fractional Poisson process of index alpha is an element of(0,1]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha \in (0,1]$$\end{document} and the service completions are triggered by an independent fractional Poisson process of index beta is an element of(0,1]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta \in (0,1]$$\end{document}. Each of the customers arriving is assigned at random to one of the priority classes. This assignment is independent of the rest of the system and follows a fixed probability distribution. Using a time-change representation of a fractional Poisson process, we first give a multinomial thinning decomposition: The total number of arrivals in each class are independent standard Poisson processes of appropriate intensities, time-changed by a common independent random clock that is the inverse of an alpha\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha $$\end{document}-stable subordinator. This yields a process-level law of large numbers and a functional central limit theorem for the process of arrivals. For the queueing system itself, we identify process-level scaling limits for the cumulative and individual queue lengths of the classes. We also prove that the queue gets empty infinitely often when alpha <=beta\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha \le \beta $$\end{document}, which does include the critical case alpha=beta\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha = \beta $$\end{document}. A final example shows how the model can be extended to a continuum of classes.
Keywords:
Mittag-Leffler queue
Multiclass queue
Fractional queue
Fractional Poisson process
Journal
J
IF:
0.6
Papers:
64
Citations:
0