Science Explorer Back to mapMap

Most cited papers in Advanced Queuing Theory Analysis

What are the most cited papers in Advanced Queuing Theory Analysis?

The most cited paper in Advanced Queuing Theory Analysis is "Wide area traffic: the failure of Poisson modeling" (Vern Paxson, Sally Floyd, 1995), with 3,729 citations. Next come "Charging and rate control for elastic traffic" (2,979) and "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks" (2,929).

Showing 50 of 99 papers. Every paper with more than 517 citations is listed.

Most cited papers, sortable by citations and release date
#Paper
1 Wide area traffic: the failure of Poisson modeling Vern Paxson, Sally Floyd · IEEE/ACM Transactions on Networking Open access Jun 1995 3,729
2 Charging and rate control for elastic traffic Frank P. Kelly · European Transactions on Telecommunications 1997 2,979
3 Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks Leandros Tassiulas, Anthony Ephremides · IEEE Transactions on Automatic Control 1992 2,929
4 Open, Closed, and Mixed Networks of Queues with Different Classes of Customers Forest Baskett, K. Mani Chandy, Richard R. Muntz et al. · Journal of the ACM Open access Apr 1975 2,457
5 A calculus for network delay. I. Network elements in isolation R.L. Cruz · IEEE Transactions on Information Theory 1991 1,916
6 Probability and computing: randomized algorithms and probabilistic analysis Michael Mitzenmacher, Eli Upfal · CERN Document Server (European Organization for Nuclear Research) 2005 1,914
7 Supply Chain Inventory Management and the Value of Shared Information Gérard P. Cachon, Marshall L. Fisher · Management Science Aug 2000 1,866
8 Analysis and simulation of a fair queueing algorithm Alan J. Demers, Srinivasan Keshav, Scott J. Shenker Conference paper Aug 1989 1,731
9 A tutorial on decomposition methods for network utility maximization Daniel Pérez Palomar, Mung Chiang · IEEE Journal on Selected Areas in Communications Aug 2006 1,688
10 How bad is selfish routing? Tim Roughgarden, Éva Tardos · Journal of the ACM Mar 2002 1,633
11 Input Versus Output Queueing on a Space-Division Packet Switch M.J. Karol, Michael G. Hluchyj, Samuel Morgan · IRE Transactions on Communications Systems Dec 1987 1,483
12 Numerical Methods for Stochastic Control Problems in Continuous Time Harold J. Kushner · SIAM Journal on Control and Optimization Sep 1990 1,457
13 The power of two choices in randomized load balancing Michael Mitzenmacher · IEEE Transactions on Parallel and Distributed Systems 2001 1,434
14 Telephone Call Centers: Tutorial, Review, and Research Prospects Noah Gans, Ger M. Koole, Avishai Mandelbaum · Manufacturing & Service Operations Management Open access Apr 2003 1,407
15 Efficient fair queuing using deficit round-robin M. Shreedhar, George Varghese · IEEE/ACM Transactions on Networking Jun 1996 1,394
16 A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems Marco Ajmone Marsan, G. Conte, Gianfranco Balbo · ACM Transactions on Computer Systems May 1984 1,357
17 Simulation Run Length Control in the Presence of an Initial Transient Philip Heidelberger, Peter D. Welch · Operations Research Dec 1983 1,328
18 Equivalent capacity and its application to bandwidth allocation in high-speed networks Roch A. Guérin, H. Ahmadi, M. Naghshineh · IEEE Journal on Selected Areas in Communications 1991 1,316
19 Stochastic Theory of a Data-Handling System with Multiple Sources David J. Anick, Debasis Mitra, M. M. Sondhi · Bell System Technical Journal Oct 1982 1,303
20 Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED Vishal Misra, Weibo Gong, Don Towsley · ACM SIGCOMM Computer Communication Review Open access 28 Aug 2000 1,278
21 Networks of Waiting Lines James R. Jackson · Operations Research Aug 1957 1,264
22 A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer Performance Harry Heffes, David M. Lucantoni · IEEE Journal on Selected Areas in Communications Sep 1986 1,255
23 Poisson Arrivals See Time Averages Ronald W. Wolff · Operations Research Apr 1982 1,255
24 Queueing systems with vacations ? A survey Bharat T. Doshi · Queueing Systems Jun 1986 1,193
25 Mean-Value Analysis of Closed Multichain Queuing Networks M. Reiser, Stephen S. Lavenberg · Journal of the ACM Open access Apr 1980 1,166
26 Revenue Management Under a General Discrete Choice Model of Consumer Behavior Kalyan T. Talluri, Garrett van Ryzin · Management Science Open access 2004 1,163
27 Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications Douglas G. Down, Gunter Bolch, Stefan Greiner et al. · Journal of the American Statistical Association Mar 2000 1,162
28 Piecewise-Deterministic Markov Processes: A General Class of Non-Diffusion Stochastic Models Mark H. Davis · Journal of the Royal Statistical Society Series B (Statistical Methodology) Jul 1984 1,157
29 Solving Linear Rational Expectations Models Christopher A. Sims · Computational Economics Oct 2002 1,141
30 New results on the single server queue with a batch markovian arrival process David M. Lucantoni · Stochastic Models 1991 1,094
31 Optimal Estimation of Executive Compensation by Linear Programming A. Charnes, William White Cooper, Robert O. Ferguson · Management Science 1955 1,087
32 WF/sup 2/Q: worst-case fair weighted fair queueing Jon C. R. Bennett, Hui Zhang Conference paper 23 Dec 2002 1,084
33 Performance Analysis Using Stochastic Petri Nets Molloy · IEEE Transactions on Computers Sep 1982 1,073
34 The Queueing Network Analyzer Ward Whitt · Bell System Technical Journal Nov 1983 1,039
35 A state-of-the-art survey of dispatching rules for manufacturing job shop operations John H. Blackstone, Don T. Phillips, Gary L. Hogg · International Journal of Production Research 1982 1,015
36 REM: active queue management S. Athuraliya, Steven H. Low, V.H. Li et al. · IEEE Network 2001 1,013
37 Blocking in a Shared Resource Environment Joseph S. Kaufman · IRE Transactions on Communications Systems Oct 1981 1,006
38 A calculus for network delay. II. Network analysis R.L. Cruz · IEEE Transactions on Information Theory 1991 974
39 Metric: A Multi-Echelon Technique for Recoverable Item Control Craig C. Sherbrooke · Operations Research Feb 1968 964
40 On designing improved controllers for AQM routers supporting TCP flows C.V. Hollot, Vishal Misra, Don Towsley et al. Conference paperOpen access 13 Nov 2002 960
41 The performance of TCP/IP for networks with high bandwidth-delay products and random loss T. V. Lakshman, Upamanyu Madhow · IEEE/ACM Transactions on Networking Jun 1997 932
42 TCP westwood Saverio Mascolo, Claudio Casetti, Mário Gerla et al. Conference paper 16 Jul 2001 925
43 A control theoretic analysis of RED C.V. Hollot, Vishal Misra, Don Towsley et al. Conference paper 13 Nov 2002 924
44 Jobshop-Like Queueing Systems James R. Jackson · Management Science Oct 1963 904
45 Value of Information in Capacitated Supply Chains Srinagesh Gavirneni, Roman Kapuściński, SRIDHAR R. TAYUR · Management Science 1999 902
46 The Markov-modulated Poisson process (MMPP) cookbook Wolfgang M. Fischer, Kathleen S. Meier-Hellstern · Performance Evaluation Sep 1993 894
47 Virtual cut-through: A new computer communication switching technique Parviz Kermani, Leonard Kleinrock · Computer Networks (1976) Sep 1979 884
48 Computational algorithms for closed queueing networks with exponential servers Jeffrey P. Buzen · Communications of the ACM Open access Sep 1973 872
49 Analysis and design of controllers for AQM routers supporting TCP flows C.V. Hollot, Vishal Misra, Don Towsley et al. · IEEE Transactions on Automatic Control Open access Jun 2002 863
50 Statistical Analysis of a Telephone Call Center Lawrence Brown, Noah Gans, Avishai Mandelbaum et al. · Journal of the American Statistical Association 9 Feb 2005 842

Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.