A numerical method to determine the waiting time and the idle time distributions of a GI/G/1 queue when inter-arrival times and/or service times have geometric tails.
Winfried K. GrassmannJavad TavakoliPublished in: INFOR Inf. Syst. Oper. Res. (2019)
Keyphrases
- arrival times
- single server
- service times
- waiting times
- numerical methods
- queue length
- independent and identically distributed
- arrival process
- special case
- queueing model
- queueing networks
- steady state
- queueing systems
- finite buffer
- state dependent
- stationary distribution
- loss probability
- random variables
- differential equations
- priority queue
- processor sharing
- single server queue
- markov chain
- parallel machines
- arrival processes
- poisson arrivals
- heavy traffic
- scheduling problem
- fluid model
- partial differential equations
- service rates
- traffic intensity
- arrival rate
- transition probabilities
- supply chain
- probability distribution
- reinforcement learning
- image segmentation