Lévy-driven GPS queues with heavy-tailed input

In this paper, we derive exact large buffer asymptotics for a two-class generalized processor sharing (GPS) model, under the assumption that the input traffic streams generated by both classes correspond to heavy-tailed Lévy processes. Four scenarios need to be distinguished, which differ in terms of (i) the level of heavy-tailedness of the driving Lévy processes as well as (ii) the values of the corresponding mean rates relative to the GPS weights. The derived results are illustrated by two important special cases, in which the queues’ inputs are modeled by heavy-tailed compound Poisson processes and by α\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 Lévy motions.