NDLI: Analysis of an $$M/M/1+G$$ queue operated under the FCFS policy with exact admission control

Content Provider	Springer Nature Link
Author	Das, Sudipta Sengupta, Debasis Jenkins, Lawrence
Copyright Year	2013
Abstract	In this article, we present an exact theoretical analysis of an $$M/M/1$$ system, with arbitrary distribution of relative deadline for the end of service, operated under the first come first served scheduling policy with exact admission control. We provide an explicit solution to the functional equation that must be satisfied by the workload distribution, when the system reaches steady state. We use this solution to derive explicit expressions for the loss ratio and the sojourn time distribution. Finally, we compare this loss ratio with that of a similar system operating without admission control, in the cases of some common distributions of the relative deadline.
Ending Page	188
Page Count	20
Starting Page	169
File Format	PDF
ISSN	02570130
e-ISSN	15729443
Journal	Queueing Systems
Issue Number	2-4
Volume Number	75
Language	English
Publisher	Springer US
Publisher Date	2013-06-14
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Queues and service Systems Theory, Control Real-time queue Probability Theory and Stochastic Processes Service time-dependent scheduling Firm real-time system Loss ratio Performance evaluation; queueing; scheduling Operations Research/Decision Theory Production/Logistics/Supply Chain Scheduling theory, stochastic Bounded sojourn time Exact admission control Queueing theory Computer Communication Networks
Content Type	Text
Resource Type	Article
Subject	Statistics and Probability Management Science and Operations Research Computational Theory and Mathematics Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Approximately optimal scheduling of an M/G/1 queue with heavy tails

Sojourn time tails in the single server queue with heavy-tailed service times

Asymptotic expansions for the conditional sojourn time distribution in the M/M/1-PS queue

The cyclic queue and the tandem queue

Waiting and sojourn times in a multi-server queue with mixed priorities

Sojourn times in the M/G/1 FB queue with light-tailed service times

Exact waiting time and queue size distributions for equilibrium M/G/1 queues with Pareto service

On priority queues with impatient customers

The M/G/1+G queue revisited

Analysis of an $$M/M/1+G$$ queue operated under the FCFS policy with exact admission control

Similar Documents

Approximately optimal scheduling of an M/G/1 queue with heavy tails

Sojourn time tails in the single server queue with heavy-tailed service times

Asymptotic expansions for the conditional sojourn time distribution in the M/M/1-PS queue

The cyclic queue and the tandem queue

Waiting and sojourn times in a multi-server queue with mixed priorities

Sojourn times in the M/G/1 FB queue with light-tailed service times

Exact waiting time and queue size distributions for equilibrium M/G/1 queues with Pareto service

On priority queues with impatient customers

The M/G/1+G queue revisited

Analysis of an $$M/M/1+G$$ queue operated under the FCFS policy with exact admission control