Paper detail

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 $α$-stable Lévy motions.

preprint2016arXivOpen access

Signal facts

What is known right now

Open access4 authors1 topic

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.