On the stationary LCFS-PR single-server queue: A characterization via stochastic intensity | Zendy

Naoto Miyoshi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the stationary LCFS-PR single-server queue: A characterization via stochastic intensity

Author(s) -

Naoto Miyoshi

Publication year - 2011

Publication title -

numerical algebra control and optimization

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.303

H-Index - 20

eISSN - 2155-3289

pISSN - 2155-3297

DOI - 10.3934/naco.2011.1.713

Subject(s) - queue , martingale (probability theory) , mathematics , computer science , intensity (physics) , computer network , physics , quantum mechanics

We consider a stationary single-server queue with preemptive-resume last-come, first-served (LCFS-PR) queueing discipline. The LCFS-PR single-server queue has some interesting properties and has been studied in the literature. In this paper, we generalize the previous results such that the input process to the queue is given as a general stationary marked point process and derive some formulas concerning the joint distribution of queue length and remaining service times of respective customers in the system at arbitrary time instances as well as at arrival instances. The tool for derivation is the Palm-martingale calculus; that is, the connection between the notion of Palm probability and that of stochastic intensity.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research