Abstract
A queueing system with a single server is considered. There are a finite number of types of customers, and the types of successive arrivals form a Markov chain. Further, the nth interarrival time has a distribution function which may depend on the types of the nth and the n–1th arrivals. The queue size, waiting time, and busy period processes are investigated. Both transient and limiting results are given.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Cited by
78 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Ultra-Sharp Queueing Bounds;IEEE INFOCOM 2024 - IEEE Conference on Computer Communications;2024-05-20
2. On a Continuous-Time Martingale and Two Applications;Proceedings of the Twenty-fourth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing;2023-10-16
3. SCALING PROPERTIES OF QUEUES WITH TIME-VARYING LOAD PROCESSES: EXTENSIONS AND APPLICATIONS;Probability in the Engineering and Informational Sciences;2021-03-03
4. Asymptotic Analysis of the Queueing Network $$SM-(GI/\infty )^K$$ S M - ( G I / ∞ ) K;Communications in Computer and Information Science;2015
5. Bibliography;Introduction to Stochastic Models;2013-04-23