NDLI: Tandem queues with subexponential service times and finite buffers

Content Provider	Springer Nature Link
Author	Kim, Jung Kyung Ayhan, Hayriye
Copyright Year	2010
Abstract	We focus on tandem queues with subexponential service time distributions. We assume that number of customers in front of the first station is infinite and there is infinite room for finished customers after the last station but the size of the buffer between two consecutive stations is finite. Using (max, +) linear recursions, we investigate the tail asymptotics of transient response times and waiting times under both communication blocking and manufacturing blocking schemes. We also discuss under which conditions these results can be generalized to the tail asymptotics of stationary response times and waiting times.
Ending Page	209
Page Count	15
Starting Page	195
File Format	PDF
ISSN	02570130
e-ISSN	15729443
Journal	Queueing Systems
Issue Number	2
Volume Number	66
Language	English
Publisher	Springer US
Publisher Date	2010-07-09
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Queues and service Systems Theory, Control Manufacturing blocking Probability Theory and Stochastic Processes Waiting time Communication blocking Response time Tail asymptotics Performance evaluation; queueing; scheduling Operations Research/Decision Theory Subexponential distribution Production/Logistics 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

Tail asymptotics of the waiting time and the busy period for the $${{\varvec{M/G/1/K}}}$$ queues with subexponential service times

Cyclic Queueing Networks With Subexponential Service Times and Finite Buffers

The impact of scheduling policies on the waiting-time distributions in polling systems

Waiting times in classical priority queues via elementary lattice path counting

Queues with waiting time dependent service

On a generic class of two-node queueing systems

Waiting times in queueing networks with a single shared server

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

Fluid polling systems

Tandem queues with subexponential service times and finite buffers

Similar Documents

Tail asymptotics of the waiting time and the busy period for the $${{\varvec{M/G/1/K}}}$$ queues with subexponential service times

Cyclic Queueing Networks With Subexponential Service Times and Finite Buffers

The impact of scheduling policies on the waiting-time distributions in polling systems

Waiting times in classical priority queues via elementary lattice path counting

Queues with waiting time dependent service

On a generic class of two-node queueing systems

Waiting times in queueing networks with a single shared server

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

Fluid polling systems

Tandem queues with subexponential service times and finite buffers