Analysis of preemptive loss priority queues with preemption distance

DOI10.1007/BF01149179MaRDI QIDQ2564192zbMATH OpenFDO

Authors Hideaki Takagi, Yoshio Kodera

Publication date 7 January 1997

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01149179

zbMATH Keywords

busy periodcompletion timepreemption distancepreemptive loss priority disciplinepriority queuesqueue sizequeuesserver vacation modelsojourn timewaiting time

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• scientific article; zbMATH DE number 6747326
• Sojourn Time and Waiting Time Distributions for M/GI/1 Queues with Preemption-Distance Priorities
• A preemptive priority queue with balking
• (N, n)-preemptive-priority M/G/1 queues with finite and infinite buffers
• Queuing with preemptive priorities or with breakdown

Cites work

• A Single Server Queueing System Working under Mixed Priority Disciplines
• scientific article; zbMATH DE number 4041013 (Why is no real title available?)
• scientific article; zbMATH DE number 3177123 (Why is no real title available?)
• scientific article; zbMATH DE number 3764811 (Why is no real title available?)
• scientific article; zbMATH DE number 49989 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• Sojourn Time and Waiting Time Distributions for M/GI/1 Queues with Preemption-Distance Priorities

Cited in

(4)

• (N, n)-preemptive-priority M/G/1 queues with finite and infinite buffers
• A semi-preemptive priority scheduling discipline: performance analysis
• Performance analysis of voice over internet protocol via non Markovian loss system with preemptive priority and server break down
• Preemptive queueing system with randomized push-out mechanism

This page was built for publication: Analysis of preemptive loss priority queues with preemption distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2564192)