Stochastic Arrival Processes
Stochastic Arrival Processes is a mathematical model used in queuing theory and stochastic processes that describes the random timing and sequence of events arriving over time, distinguished by its probabilistic characterization of inter-arrival times and its foundational role in analyzing systems subject to random demand.
757
Publications
37.7K
Citations
1.2K
Authors
556
Institutions
Publications per year
2017–2026
78
Parents
757
Applied Probability and Queues.
Upendra Dave, Søren Asmussen · Journal of the Operational Research Society · 1987 · 2.8K citations
A Proof for the Queuing Formula: <i>L</i> = λ<i>W</i>
John D. C. Little · Operations Research · 1961 · 2.7K citations
A versatile Markovian point process
Marcel F. Neuts · Journal of Applied Probability · 1979 · 797 citations
1–5 of 757
1.2K
19
h-index
11
h-index
10
h-index
8
h-index
7
h-index
1–5 of 1.2K
556
University of California, Berkeley
Berkeley, United States
21 h-index
41 publications
2.2K citations
AT&T (United States)
Bedminster, United States
20 h-index
36 publications
3.2K citations
Massachusetts Institute of Technology
Cambridge, United States
19 h-index
30 publications
3K citations
Columbia University
New York, United States
18 h-index
36 publications
1.6K citations
Nokia (United States)
Coppell, United States
14 h-index
24 publications
2.4K citations

Cornell University
Ithaca, United States
12 h-index
18 publications
1K citations

Ghent University
Ghent, Belgium
11 h-index
24 publications
420 citations
North Carolina State University
Raleigh, United States
10 h-index
12 publications
465 citations
1–8 of 556
57 publications · 5.9K citations
33
h-index
JAP · 68 publications · 3.4K citations
28
h-index
AAP · 18 publications · 1.3K citations
17
h-index
20 publications · 1.4K citations
17
h-index
17 publications · 1.1K citations
15
h-index
1–5