M/m/1 Queues
M/M/1 Queues is a continuous-time queueing model characterized by a single server, Poisson arrival process, and exponentially distributed service times, belonging to the class of Markovian queueing systems distinguished by its specific (M/M/1) notation indicating memoryless interarrival and service times with one service channel.
527
Publications
18.6K
Citations
750
Authors
374
Institutions
Publications per year
2017–2026
62
Variants
M/m/1 Queue
Parents
527
Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue
Haim Mendelson, Seungjin Whang · Operations Research · 1990 · 571 citations
Business, Economics, Microeconomics +16
M/M/1 queues with working vacations (M/M/1/WV)
L. D. Servi, S.G. Finn · Performance Evaluation · 2002 · 502 citations
1–5 of 527
750
10
h-index
9
h-index
National Taichung University of Science and Technology, Taiwan
9 publications · 271 citations
9
h-index
8
h-index
8
h-index
1–5 of 750
374
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
13 h-index
25 publications
603 citations
University of California, Berkeley
Berkeley, United States
12 h-index
15 publications
658 citations
AT&T (United States)
Bedminster, United States
12 h-index
18 publications
874 citations

Yanshan University
Qinhuangdao, China
12 h-index
37 publications
1.4K citations

Tel Aviv University
Tel Aviv, Israel
11 h-index
18 publications
1.3K citations

National Chung Hsing University
Taichung, Taiwan
11 h-index
18 publications
698 citations
Georgia Institute of Technology
Atlanta, United States
10 h-index
14 publications
337 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
10 h-index
17 publications
386 citations
1–8 of 374
JAP · 55 publications · 1.4K citations
21
h-index
AAP · 30 publications · 1.4K citations
20
h-index
19 publications · 1.5K citations
17
h-index
30 publications · 1.1K citations
16
h-index
14 publications · 1.6K citations
14
h-index
1–5