How Long Might We Wait at Random?
arxiv(2022)
Abstract
In discrete time, customers arrive at random. Each waits until one of three servers is available; each thereafter departs at random. We seek the distribution of maximum line length of idle customers. Algebraic expressions obtained for the two-server scenario do not appear feasible here. We also review well-known distributional results for maximum wait time associated with an M/M/1 queue and speculate about their generalization.
MoreTranslated text
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined