NDLI: Queues with Equally Heavy Sojourn Time and Service Requirement Distributions

Content Provider	Springer Nature Link
Author	Núñez Queija, Rudesindo
Copyright Year	2002
Abstract	For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time distribution is heavier than the tail of the service requirement distribution when the latter has a regularly varying tail. In contrast, for the M/G/1 queue with Processor Sharing, Zwart and Boxma [26] showed that under the same assumptions on the service requirement distribution, the two tails are “equally heavy”. By means of a probabilistic analysis we provide a new insightful proof of this result, allowing for the slightly weaker assumption of service requirement distributions with a tail of intermediate regular variation. The new approach allows us to also establish the “tail equivalence” for two other service disciplines: Foreground–Background Processor Sharing and Shortest Remaining Processing Time. The method can also be applied to more complicated models, for which no explicit formulas exist for (transforms of) the sojourn time distribution. One such model is the M/G/1 Processor Sharing queue with service that is subject to random interruptions. The latter model is of particular interest for the performance analysis of communication networks.
Starting Page	101
Ending Page	117
Page Count	17
File Format	PDF
ISSN	02545330
Journal	Annals of Operations Research
Volume Number	113
Issue Number	1-4
e-ISSN	15729338
Language	English
Publisher	Kluwer Academic Publishers
Publisher Date	2002-01-01
Publisher Place	Dordrecht
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Theory of Computation Combinatorics Operation Research/Decision Theory
Content Type	Text
Resource Type	Article
Subject	Management Science and Operations Research

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

Large deviations of the sojourn time for queues in series

Analysis of discrete-time queues with general service demands and finite-support service capacities

Discrete-time queues with variable service capacity: a basic model and its analysis

Location–Allocation of Multiple-Server Service Centers with Constrained Queues or Waiting Times

Tandem queues in bulk port operations

Computation of the steady state distribution for multi-server retrial queues with phase type service process

Queues with switchover - A review and critique

Randomly Interrupted GI-G-1 Queues: Service Strategies and Stability Issues

Diffusion Approximations for Queues with Markovian Bases

Queues with Equally Heavy Sojourn Time and Service Requirement Distributions

Similar Documents

Large deviations of the sojourn time for queues in series

Analysis of discrete-time queues with general service demands and finite-support service capacities

Discrete-time queues with variable service capacity: a basic model and its analysis

Location–Allocation of Multiple-Server Service Centers with Constrained Queues or Waiting Times

Tandem queues in bulk port operations

Computation of the steady state distribution for multi-server retrial queues with phase type service process

Queues with switchover - A review and critique

Randomly Interrupted GI-G-1 Queues: Service Strategies and Stability Issues

Diffusion Approximations for Queues with Markovian Bases

Queues with Equally Heavy Sojourn Time and Service Requirement Distributions