NDLI: A BMAP/SM/1 queue with service times depending on the arrival process

Content Provider	Springer Nature Link
Author	Machihara, Fumiaki
Copyright Year	1999
Abstract	We study a BMAP/>SM/1 queue with batch Markov arrival process input and semi‐Markov service. Service times may depend on arrival phase states, that is, there are many types of arrivals which have different service time distributions. The service process is a heterogeneous Markov renewal process, and so our model necessarily includes known models. At first, we consider the first passage time from level {κ+1} (the set of the states that the number of customers in the system is κ+1) to level {κ} when a batch arrival occurs at time 0 and then a customer service included in that batch simultaneously starts. The service descipline is considered as a LIFO (Last‐In First‐Out) with preemption. This discipline has the fundamental role for the analysis of the first passage time. Using this first passage time distribution, the busy period length distribution can be obtained. The busy period remains unaltered in any service disciplines if they are work‐conserving. Next, we analyze the stationary workload distribution (the stationary virtual waiting time distribution). The workload as well as the busy period remain unaltered in any service disciplines if they are work‐conserving. Based on this fact, we derive the Laplace–Stieltjes transform for the stationary distribution of the actual waiting time under a FIFO discipline. In addition, we refer to the Laplace–Stieltjes transforms for the distributions of the actual waiting times of the individual types of customers. Using the relationship between the stationary waiting time distribution and the stationary distribution of the number of customers in the system at departure epochs, we derive the generating function for the stationary joint distribution of the numbers of different types of customers at departures.
Starting Page	277
Ending Page	291
Page Count	15
File Format	PDF
ISSN	02570130
Journal	Queueing Systems
Volume Number	33
Issue Number	4
e-ISSN	15729443
Language	English
Publisher	Kluwer Academic Publishers
Publisher Date	1999-01-01
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Computer Communication Networks Systems Theory, Control Probability Theory and Stochastic Processes Operations Research/Decision Theory Production/Logistics
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

Single-Server Queue with Markov-Dependent Inter-Arrival and Service Times

Single-Server Queue with Markov-Dependent Inter-Arrival and Service Times : Errata

Ergodicity of the BMAP/PH/s/s+K retrial queue with PH-retrial times

Optimal multithreshold control for a BMAP/G/1 queue with N service modes

On queues with service and interarrival times depending on waiting times

The Periodic BMAP/PH/c Queue

Departure Process of the MAP/SM/1 Queue

A two-queue model with Bernoulli service schedule and switching times

A Tandem Queue with Blocking and Markovian Arrival Process

A BMAP/SM/1 queue with service times depending on the arrival process

Similar Documents

Single-Server Queue with Markov-Dependent Inter-Arrival and Service Times

Single-Server Queue with Markov-Dependent Inter-Arrival and Service Times : Errata

Ergodicity of the BMAP/PH/s/s+K retrial queue with PH-retrial times

Optimal multithreshold control for a BMAP/G/1 queue with N service modes

On queues with service and interarrival times depending on waiting times

The Periodic BMAP/PH/c Queue

Departure Process of the MAP/SM/1 Queue

A two-queue model with Bernoulli service schedule and switching times

A Tandem Queue with Blocking and Markovian Arrival Process

A BMAP/SM/1 queue with service times depending on the arrival process