scholarly journals Times until service completion and abandonment in an M/M/\begin{document}$ m$\end{document} preemptive-resume LCFS queue with impatient customers

2018 ◽  
Vol 14 (4) ◽  
pp. 1701-1726
Author(s):  
Hideaki Takagi ◽  
Keyword(s):  
Impatient Customers ◽  
Preemptive Resume ◽  
Service Completion

scholarly journals Diffusion Model of Preemptive-Resume Priority Systems and Its Application to Performance Evaluation of SDN Switches

Sensors ◽  
2021 ◽  
Vol 21 (15) ◽  
pp. 5042
Author(s):  
Tomasz Nycz ◽  
Tadeusz Czachórski ◽  
Monika Nycz
Keyword(s):  
Diffusion Approximation ◽  
Numerical Models ◽  
Software Defined Networks ◽  
Detailed Model ◽  
Preemptive Resume ◽  
Central Controller ◽  
Priority Systems ◽  
Primary Element ◽  
Preemptive Resume Priority ◽  
General Distributions

The increasing use of Software-Defined Networks brings the need for their performance analysis and detailed analytical and numerical models of them. The primary element of such research is a model of a SDN switch. This model should take into account non-Poisson traffic and general distributions of service times. Because of frequent changes in SDN flows, it should also analyze transient states of the queues. The method of diffusion approximation can meet these requirements. We present here a diffusion approximation of priority queues and apply it to build a more detailed model of SDN switch where packets returned by the central controller have higher priority than other packets.

The single-server queue with service depending on queue size and with the preemptive-resume last-come–first-served queue discipline

1987 ◽  
Vol 24 (03) ◽  
pp. 758-767
Author(s):  
D. Fakinos
Keyword(s):  
Queueing System ◽  
Limiting Distribution ◽  
Single Server ◽  
Queue Size ◽  
Single Server Queue ◽  
Preemptive Resume ◽  
Server Queue ◽  
Queue Discipline ◽  
Service Times

This paper studies theGI/G/1 queueing system assuming that customers have service times depending on the queue size and also that they are served in accordance with the preemptive-resume last-come–first-served queue discipline. Expressions are given for the limiting distribution of the queue size and the remaining durations of the corresponding services, when the system is considered at arrival epochs, at departure epochs and continuously in time. Also these results are applied to some particular cases of the above queueing system.

scholarly journals Optimum cost analysis for an Geo/Geo/c/N feedback queue under synchronous working vacations and impatient customers

2019 ◽  
Vol 10 (2) ◽  
pp. 211-226
Author(s):  
Lahcene Yahiaoui ◽  
◽  
Amina Angelika Bouchentouf ◽  
Mokhtar Kadi ◽  
◽  
...  
Keyword(s):  
Cost Analysis ◽  
Impatient Customers ◽  
Working Vacations ◽  
Optimum Cost ◽  
Feedback Queue

Discrete‐time multiserver queue with impatient customers

2013 ◽  
Vol 49 (1) ◽  
pp. 38-39 ◽  
Author(s):  
Jeongsim Kim ◽  
Bara Kim ◽  
Jangha Kang
Keyword(s):  
Discrete Time ◽  
Impatient Customers
Sign in / Sign up

Export Citation Format

Share Document