LINE Solver
MATLAB API documentation
Loading...
Searching...
No Matches
line_citations.m
1function entries = line_citations(tokens)
2% ENTRIES = LINE_CITATIONS(TOKENS)
3%
4% Bibliographic references for the algorithms named by TOKENS, as a struct
5% array with fields:
6% .key - bibliography key, as used in doc/latex/biblio.bib
7% .ref - short reference, author-title-venue-year
8% .covers - one line saying which part of the solution process it covers
9%
10% TOKENS is a cell array of algorithm or feature names (solver methods such as
11% 'bs' or 'comom', transformations such as 'mmt', percentile methods such as
12% 'forktail'). Unknown tokens are ignored, so a caller may pass whatever it
13% knows about a run. The registry is the manual's method-to-citation table
14% (doc/latex/manual.tex) and its bibliography; keep the two in step.
15%
16% Attribution in LINE is pull-based: nothing is printed during a solve, and a
17% user asks for the references with solver.citations() when writing them up.
18%
19% Copyright (c) 2012-2026, Imperial College London
20% All rights reserved.
21
22if nargin < 1 || isempty(tokens)
23 tokens = {};
24end
25if ~iscell(tokens)
26 tokens = {tokens};
27end
28
29reg = registry();
30entries = struct('key', {}, 'ref', {}, 'covers', {});
31seen = {};
32for i = 1:numel(tokens)
33 t = lower(strtrim(char(tokens{i})));
34 if isempty(t)
35 continue
36 end
37 if isKey(reg, t)
38 e = reg(t);
39 else
40 % a family-qualified token falls back to the bare method name
41 dot = strfind(t, '.');
42 if ~isempty(dot) && isKey(reg, t(dot(1)+1:end))
43 e = reg(t(dot(1)+1:end));
44 else
45 continue
46 end
47 end
48 if any(strcmp(seen, e.key))
49 continue % same paper reached through two tokens
50 end
51 seen{end+1} = e.key; %#ok<AGROW>
52 entries(end+1) = e; %#ok<AGROW>
53end
54end
55
56function reg = registry()
57% Token -> reference. Sources: doc/latex/manual.tex (the solver/method summary
58% table and the per-solver method lists) and doc/latex/biblio.bib. A token may
59% be qualified by solver family ('nc.mva' is Reiser's convolution, 'mva.exact'
60% is Reiser-Lavenberg MVA); the lookup falls back to the bare method name when
61% the qualified one is absent.
62reg = containers.Map('KeyType','char','ValueType','any');
63
64 function add(tok, key, ref, covers)
65 reg(tok) = struct('key', key, 'ref', ref, 'covers', covers);
66 end
67
68add('mva.exact', 'reis.lave80', 'M. Reiser, S. Lavenberg, "Mean-Value Analysis of Closed Multichain Queuing Networks", J. ACM 27(2), 1980', 'exact mean queue lengths of the product-form network');
69add('exact', 'reis.lave80', 'M. Reiser, S. Lavenberg, "Mean-Value Analysis of Closed Multichain Queuing Networks", J. ACM 27(2), 1980', 'exact mean queue lengths of the product-form network');
70add('mva.mva', 'reis.lave80', 'M. Reiser, S. Lavenberg, "Mean-Value Analysis of Closed Multichain Queuing Networks", J. ACM 27(2), 1980', 'exact mean queue lengths of the product-form network');
71add('reiser', 'reis.lave80', 'M. Reiser, S. Lavenberg, "Mean-Value Analysis of Closed Multichain Queuing Networks", J. ACM 27(2), 1980', 'exact mean queue lengths of the product-form network');
72add('bs', 'Sch79', 'P. J. Schweitzer, "Approximate Analysis of Multiclass Closed Networks of Queues", Int. Conf. Stoch. Control Optim., 1979', 'Bard-Schweitzer fixed point for the mean queue lengths');
73add('amva.bs', 'Sch79', 'P. J. Schweitzer, "Approximate Analysis of Multiclass Closed Networks of Queues", Int. Conf. Stoch. Control Optim., 1979', 'Bard-Schweitzer fixed point for the mean queue lengths');
74add('aql', 'ZahES88', 'J. Zahorjan, D. L. Eager, H. M. Sweillam, "Accuracy, Speed, and Convergence of Approximate Mean Value Analysis", Perform. Eval. 8, 1988', 'aggregate queue-length AMVA iteration');
75add('amva.aql', 'ZahES88', 'J. Zahorjan, D. L. Eager, H. M. Sweillam, "Accuracy, Speed, and Convergence of Approximate Mean Value Analysis", Perform. Eval. 8, 1988', 'aggregate queue-length AMVA iteration');
76add('lin', 'ChaN82', 'K. M. Chandy, D. Neuse, "Linearizer: A Heuristic Algorithm for Queuing Network Models of Computing Systems", Commun. ACM 25(2), 1982', 'Linearizer correction of the arrival-instant queue lengths');
77add('amva.lin', 'ChaN82', 'K. M. Chandy, D. Neuse, "Linearizer: A Heuristic Algorithm for Queuing Network Models of Computing Systems", Commun. ACM 25(2), 1982', 'Linearizer correction of the arrival-instant queue lengths');
78add('gflin', 'ChaN82', 'K. M. Chandy, D. Neuse, "Linearizer: A Heuristic Algorithm for Queuing Network Models of Computing Systems", Commun. ACM 25(2), 1982', 'Linearizer correction of the arrival-instant queue lengths');
79add('egflin', 'ChaN82', 'K. M. Chandy, D. Neuse, "Linearizer: A Heuristic Algorithm for Queuing Network Models of Computing Systems", Commun. ACM 25(2), 1982', 'Linearizer correction of the arrival-instant queue lengths');
80add('dmlin', 'SilvaM90', 'E. de Souza e Silva, R. R. Muntz, "A Note on the Computational Cost of the Linearizer Algorithm for Queueing Networks", IEEE TC 39(6), 1990', 'de Souza e Silva-Muntz cost reduction of Linearizer');
81add('qd', 'casale2015qdamva', 'G. Casale, J. F. Perez, W. Wang, "QD-AMVA: Evaluating Systems with Queue-Dependent Service Requirements", IFIP PERFORMANCE, 2015', 'queue-dependent AMVA for load-dependent stations');
82add('amva.qd', 'casale2015qdamva', 'G. Casale, J. F. Perez, W. Wang, "QD-AMVA: Evaluating Systems with Queue-Dependent Service Requirements", IFIP PERFORMANCE, 2015', 'queue-dependent AMVA for load-dependent stations');
83add('qdlin', 'casale2015qdamva', 'G. Casale, J. F. Perez, W. Wang, "QD-AMVA: Evaluating Systems with Queue-Dependent Service Requirements", IFIP PERFORMANCE, 2015', 'queue-dependent AMVA for load-dependent stations');
84add('softmin', 'casale2015qdamva', 'G. Casale, J. F. Perez, W. Wang, "QD-AMVA: Evaluating Systems with Queue-Dependent Service Requirements", IFIP PERFORMANCE, 2015', 'queue-dependent AMVA for load-dependent stations');
85add('qd.oi', 'casale2015qdamva', 'G. Casale, J. F. Perez, W. Wang, "QD-AMVA: Evaluating Systems with Queue-Dependent Service Requirements", IFIP PERFORMANCE, 2015', 'first-order Taylor and Schweitzer steps of the queue-dependent AMVA specialized to order-independent stations');
86add('amva.qdoi', 'casale2015qdamva', 'G. Casale, J. F. Perez, W. Wang, "QD-AMVA: Evaluating Systems with Queue-Dependent Service Requirements", IFIP PERFORMANCE, 2015', 'first-order Taylor and Schweitzer steps of the queue-dependent AMVA specialized to order-independent stations');
87add('oi', 'BonP03', 'T. Bonald, A. Proutiere, "Insensitive bandwidth sharing in data networks", Queueing Systems 44(1), 2003', 'balanced-fairness balance function of the order-independent station');
88add('balancedfairness', 'BonP03', 'T. Bonald, A. Proutiere, "Insensitive bandwidth sharing in data networks", Queueing Systems 44(1), 2003', 'balanced-fairness balance function of the order-independent station');
89add('aumannshapley', 'BilH82', 'L. J. Billera, D. C. Heath, "Allocation of Shared Costs: A Set of Axioms Yielding a Unique Procedure", Mathematics of Operations Research 7(1), 1982', 'ray decomposition splitting the order-independent station rate among the job classes');
90add('fli', 'WangS00', 'H. Wang, K. C. Sevcik, "Experiments with improved approximate mean value analysis algorithms", Perform. Eval. 39, 2000', 'improved AMVA arrival-instant estimators');
91add('amva.fli', 'WangS00', 'H. Wang, K. C. Sevcik, "Experiments with improved approximate mean value analysis algorithms", Perform. Eval. 39, 2000', 'improved AMVA arrival-instant estimators');
92add('qli', 'WangS00', 'H. Wang, K. C. Sevcik, "Experiments with improved approximate mean value analysis algorithms", Perform. Eval. 39, 2000', 'improved AMVA arrival-instant estimators');
93add('amva.qli', 'WangS00', 'H. Wang, K. C. Sevcik, "Experiments with improved approximate mean value analysis algorithms", Perform. Eval. 39, 2000', 'improved AMVA arrival-instant estimators');
94add('conway', 'Con89', 'A. E. Conway, "Fast Approximate Solution of Queueing Networks with Multi-Server Chain-Dependent FCFS Queues", 1989', 'multi-server chain-dependent AMVA');
95add('linearizerms', 'Con89', 'A. E. Conway, "Fast Approximate Solution of Queueing Networks with Multi-Server Chain-Dependent FCFS Queues", 1989', 'multi-server chain-dependent AMVA');
96add('suri', 'suri2007approximate', 'R. Suri, S. K. Sahu, M. Vernon, "Approximate Mean Value Analysis for Closed Queuing Networks with Multiple-Server Stations", IERC, 2007', 'multi-server station correction in AMVA');
97add('schmidt', 'suri2007approximate', 'R. Suri, S. K. Sahu, M. Vernon, "Approximate Mean Value Analysis for Closed Queuing Networks with Multiple-Server Stations", IERC, 2007', 'multi-server station correction in AMVA');
98add('schmidt-ext', 'suri2007approximate', 'R. Suri, S. K. Sahu, M. Vernon, "Approximate Mean Value Analysis for Closed Queuing Networks with Multiple-Server Stations", IERC, 2007', 'multi-server station correction in AMVA');
99add('schmidtext', 'suri2007approximate', 'R. Suri, S. K. Sahu, M. Vernon, "Approximate Mean Value Analysis for Closed Queuing Networks with Multiple-Server Stations", IERC, 2007', 'multi-server station correction in AMVA');
100add('seidmann', 'seidmann1987computerized', 'A. Seidmann, P. J. Schweitzer, S. Shalev-Oren, "Computerized closed queueing network models of flexible manufacturing systems", Large Scale Systems 12, 1987', 'multi-server to single-server flow-equivalent reduction');
101add('cl', 'EagL88', 'D. L. Eager, J. N. Lipscomb, "The AMVA priority approximation", Perform. Eval. 8, 1988', 'priority approximation inside AMVA');
102add('chandy-lakshmi', 'EagL88', 'D. L. Eager, J. N. Lipscomb, "The AMVA priority approximation", Perform. Eval. 8, 1988', 'priority approximation inside AMVA');
103add('amva.cl', 'EagL88', 'D. L. Eager, J. N. Lipscomb, "The AMVA priority approximation", Perform. Eval. 8, 1988', 'priority approximation inside AMVA');
104add('shadow', 'Sev77', 'K. Sevcik, "Priority Scheduling Disciplines in Queuing Network Models of Computer Systems", IFIP Congress, 1977', 'shadow-server treatment of priority scheduling');
105add('zhou', 'Woo22', 'S. Zhou, M. Woodside, "A Multiserver Approximation for Cloud Scaling Analysis", ICPE Companion, 2022', 'multiserver scaling approximation');
106add('qna', 'whitt1983qna', 'W. Whitt, "The Queueing Network Analyzer", Bell Syst. Tech. J. 62, 1983', 'two-moment decomposition of the open network');
107add('rqna', 'whittyou2018rqna', 'W. Whitt, W. You, "A Robust Queueing Network Analyzer Based on Indices of Dispersion", Naval Research Logistics 69, 2022', 'index-of-dispersion decomposition and robust queueing bounds');
108add('highvar', 'BonW86', 'A. B. Bondi, W. Whitt, "The influence of service-time variability in a closed network of queues", Perform. Eval. 6, 1986', 'high-variability service correction of the demands');
109add('interp', 'BonW86', 'A. B. Bondi, W. Whitt, "The influence of service-time variability in a closed network of queues", Perform. Eval. 6, 1986', 'high-variability service correction of the demands');
110add('kraemer', 'KraLB78', 'W. Kraemer, M. Langenbach-Belz, "Approximate Formulae for General Single Server Systems with Single and Batch Arrivals", Angewandte Informatik 9, 1978', 'G/G/1 waiting time approximation');
111add('klb', 'KraLB78', 'W. Kraemer, M. Langenbach-Belz, "Approximate Formulae for General Single Server Systems with Single and Batch Arrivals", Angewandte Informatik 9, 1978', 'G/G/1 waiting time approximation');
112add('nc.ca', 'Cas09', 'G. Casale, "CoMoM: Efficient Class-Oriented Evaluation of Multiclass Performance Models", IEEE TSE 35(2), 2009', 'class-oriented recursion for the normalizing constant');
113add('ca', 'Cas09', 'G. Casale, "CoMoM: Efficient Class-Oriented Evaluation of Multiclass Performance Models", IEEE TSE 35(2), 2009', 'class-oriented recursion for the normalizing constant');
114add('comom', 'Cas09', 'G. Casale, "CoMoM: Efficient Class-Oriented Evaluation of Multiclass Performance Models", IEEE TSE 35(2), 2009', 'class-oriented recursion for the normalizing constant');
115add('nc.comom', 'Cas09', 'G. Casale, "CoMoM: Efficient Class-Oriented Evaluation of Multiclass Performance Models", IEEE TSE 35(2), 2009', 'class-oriented recursion for the normalizing constant');
116add('clw', 'ChoLW95', 'G. L. Choudhury, K. K. Leung, W. Whitt, "Calculating Normalization Constants of Closed Queuing Networks by Numerically Inverting Their Generating Functions", J. ACM 42, 1995', 'numerical inversion of the generating function');
117add('nc.clw', 'ChoLW95', 'G. L. Choudhury, K. K. Leung, W. Whitt, "Calculating Normalization Constants of Closed Queuing Networks by Numerically Inverting Their Generating Functions", J. ACM 42, 1995', 'numerical inversion of the generating function');
118add('nc.mva', 'Rei81', 'M. Reiser, "Mean-Value Analysis and Convolution Method for Queue-Dependent Servers in Closed Queueing Networks", Perform. Eval. 1, 1981', 'convolution and MVA with queue-dependent servers');
119add('le', 'Cas17', 'G. Casale, "Accelerating Performance Inference over Closed Systems by Asymptotic Methods", ACM SIGMETRICS, 2017', 'asymptotic expansion of the normalizing constant integral');
120add('ls', 'Cas17', 'G. Casale, "Accelerating Performance Inference over Closed Systems by Asymptotic Methods", ACM SIGMETRICS, 2017', 'asymptotic expansion of the normalizing constant integral');
121add('cub', 'Cas17', 'G. Casale, "Accelerating Performance Inference over Closed Systems by Asymptotic Methods", ACM SIGMETRICS, 2017', 'asymptotic expansion of the normalizing constant integral');
122add('nc.le', 'Cas17', 'G. Casale, "Accelerating Performance Inference over Closed Systems by Asymptotic Methods", ACM SIGMETRICS, 2017', 'asymptotic expansion of the normalizing constant integral');
123add('nc.ls', 'Cas17', 'G. Casale, "Accelerating Performance Inference over Closed Systems by Asymptotic Methods", ACM SIGMETRICS, 2017', 'asymptotic expansion of the normalizing constant integral');
124add('nc.cub', 'Cas17', 'G. Casale, "Accelerating Performance Inference over Closed Systems by Asymptotic Methods", ACM SIGMETRICS, 2017', 'asymptotic expansion of the normalizing constant integral');
125add('rd', 'CasHH21', 'G. Casale, P. G. Harrison, O. W. Hong, "Facilitating Load-Dependent Queueing Analysis Through Factorization", Perform. Eval., 2021', 'factorization of the load-dependent normalizing constant');
126add('nrp', 'CasHH21', 'G. Casale, P. G. Harrison, O. W. Hong, "Facilitating Load-Dependent Queueing Analysis Through Factorization", Perform. Eval., 2021', 'factorization of the load-dependent normalizing constant');
127add('nrl', 'CasHH21', 'G. Casale, P. G. Harrison, O. W. Hong, "Facilitating Load-Dependent Queueing Analysis Through Factorization", Perform. Eval., 2021', 'factorization of the load-dependent normalizing constant');
128add('comomld', 'CasHH21', 'G. Casale, P. G. Harrison, O. W. Hong, "Facilitating Load-Dependent Queueing Analysis Through Factorization", Perform. Eval., 2021', 'factorization of the load-dependent normalizing constant');
129add('kt', 'KneT92', 'C. Knessl, C. Tier, "Asymptotic Expansions for Large Closed Queueing Networks with Multiple Job Classes", IEEE TC 41(4), 1992', 'asymptotic expansion for large populations');
130add('panacea', 'McKM84', 'J. McKenna, D. Mitra, "Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks", J. ACM 31, 1984', 'integral representation of the queue-length moments');
131add('mem', 'Kou94', 'D. D. Kouvatsos, "Entropy Maximisation and Queueing Network Models", Annals of Operations Research 48, 1994', 'maximum-entropy approximation of the network');
132add('mem.blocking', 'TahMB99', 'H. Tahilramani, D. Manjunath, S. K. Bose, "Approximate Analysis of Open Network of GE/GE/m/N Queues with Transfer Blocking", MASCOTS, 1999', 'holding-node expansion that makes transfer blocking work conserving');
133add('recal', 'ConG86', 'A. E. Conway, N. D. Georganas, "RECAL: A New Efficient Algorithm for the Exact Analysis of Multiple-Chain Closed Queueing Networks", J. ACM 33, 1986', 'recursive exact evaluation by chain');
134add('mvac', 'CSL89', 'A. E. Conway, E. de Souza e Silva, S. S. Lavenberg, "Mean Value Analysis by Chain of Product Form Queueing Networks", IEEE Trans. Computers 38(3), 1989', 'exact mean value analysis by chain (SolverMVA method mvac)');
135add('conv', 'Sau83', 'C. H. Sauer, "Computational Algorithms for State-Dependent Queueing Networks", ACM TOCS 1(1), 1983', 'convolution with chain-dependent service rates');
136add('nc.conv', 'Sau83', 'C. H. Sauer, "Computational Algorithms for State-Dependent Queueing Networks", ACM TOCS 1(1), 1983', 'convolution with chain-dependent service rates');
137add('aba', 'BolGMT06', 'G. Bolch, S. Greiner, H. de Meer, K. S. Trivedi, "Queueing Networks and Markov Chains", Wiley, 2006', 'asymptotic bounds on throughput and response time');
138add('aba.upper', 'BolGMT06', 'G. Bolch, S. Greiner, H. de Meer, K. S. Trivedi, "Queueing Networks and Markov Chains", Wiley, 2006', 'asymptotic bounds on throughput and response time');
139add('aba.lower', 'BolGMT06', 'G. Bolch, S. Greiner, H. de Meer, K. S. Trivedi, "Queueing Networks and Markov Chains", Wiley, 2006', 'asymptotic bounds on throughput and response time');
140add('bjb', 'CasMS08', 'G. Casale, R. R. Muntz, G. Serazzi, "Geometric Bounds: A Noniterative Analysis Technique for Closed Queueing Networks", IEEE TC 57(6), 2008', 'geometric and balanced-job bounds');
141add('gb', 'CasMS08', 'G. Casale, R. R. Muntz, G. Serazzi, "Geometric Bounds: A Noniterative Analysis Technique for Closed Queueing Networks", IEEE TC 57(6), 2008', 'geometric and balanced-job bounds');
142add('pb', 'CasMS08', 'G. Casale, R. R. Muntz, G. Serazzi, "Geometric Bounds: A Noniterative Analysis Technique for Closed Queueing Networks", IEEE TC 57(6), 2008', 'geometric and balanced-job bounds');
143add('bjb.upper', 'CasMS08', 'G. Casale, R. R. Muntz, G. Serazzi, "Geometric Bounds: A Noniterative Analysis Technique for Closed Queueing Networks", IEEE TC 57(6), 2008', 'geometric and balanced-job bounds');
144add('bjb.lower', 'CasMS08', 'G. Casale, R. R. Muntz, G. Serazzi, "Geometric Bounds: A Noniterative Analysis Technique for Closed Queueing Networks", IEEE TC 57(6), 2008', 'geometric and balanced-job bounds');
145add('gb.upper', 'CasMS08', 'G. Casale, R. R. Muntz, G. Serazzi, "Geometric Bounds: A Noniterative Analysis Technique for Closed Queueing Networks", IEEE TC 57(6), 2008', 'geometric and balanced-job bounds');
146add('gb.lower', 'CasMS08', 'G. Casale, R. R. Muntz, G. Serazzi, "Geometric Bounds: A Noniterative Analysis Technique for Closed Queueing Networks", IEEE TC 57(6), 2008', 'geometric and balanced-job bounds');
147add('pb.upper', 'CasMS08', 'G. Casale, R. R. Muntz, G. Serazzi, "Geometric Bounds: A Noniterative Analysis Technique for Closed Queueing Networks", IEEE TC 57(6), 2008', 'geometric and balanced-job bounds');
148add('pb.lower', 'CasMS08', 'G. Casale, R. R. Muntz, G. Serazzi, "Geometric Bounds: A Noniterative Analysis Technique for Closed Queueing Networks", IEEE TC 57(6), 2008', 'geometric and balanced-job bounds');
149add('sb', 'Harel1999', 'A. Harel, S. Namn, J. Sturm, "Simple bounds for closed queueing networks", Queueing Systems 31, 1999', 'simple closed-network bounds');
150add('sb.upper', 'Harel1999', 'A. Harel, S. Namn, J. Sturm, "Simple bounds for closed queueing networks", Queueing Systems 31, 1999', 'simple closed-network bounds');
151add('sb.lower', 'Harel1999', 'A. Harel, S. Namn, J. Sturm, "Simple bounds for closed queueing networks", Queueing Systems 31, 1999', 'simple closed-network bounds');
152add('mwba', 'MajW98', 'S. Majumdar, C. M. Woodside, "Robust bounds and throughput guarantees for closed multiclass queueing networks", Perform. Eval. 32, 1998', 'robust throughput bounds');
153add('mwba.upper', 'MajW98', 'S. Majumdar, C. M. Woodside, "Robust bounds and throughput guarantees for closed multiclass queueing networks", Perform. Eval. 32, 1998', 'robust throughput bounds');
154add('mwba.lower', 'MajW98', 'S. Majumdar, C. M. Woodside, "Robust bounds and throughput guarantees for closed multiclass queueing networks", Perform. Eval. 32, 1998', 'robust throughput bounds');
155add('balanced', 'LazZGS84', 'E. D. Lazowska, J. Zahorjan, G. S. Graham, K. C. Sevcik, "Quantitative System Performance", Prentice-Hall, 1984', 'operational analysis and balanced-system bounds');
156add('mna', 'ZhuC24', 'Z. Li, G. Casale, "Matrix Network Analyzer: A New Decomposition Algorithm for Phase-type Queueing Networks", ICPE Companion, 2024', 'phase-type network decomposition');
157add('inap', 'CasH13', 'G. Casale, P. G. Harrison, "AutoCAT: Automated Product-Form Solution of Stochastic Models", MAM in Stochastic Models 27, 2013', 'RCAT product-form solution of the cooperating processes');
158add('inapplus', 'CasH13', 'G. Casale, P. G. Harrison, "AutoCAT: Automated Product-Form Solution of Stochastic Models", MAM in Stochastic Models 27, 2013', 'RCAT product-form solution of the cooperating processes');
159add('inapinf', 'MarinRB12', 'A. Marin, S. Rota Bulo, S. Balsamo, "A numerical algorithm for the decomposition of cooperating structured Markov processes", IEEE MASCOTS, 2012', 'matrix-geometric decomposition on the infinite state space');
160add('qbd', 'Hor17', 'G. Horvath, M. Telek, "BuTools 2: A Rich Toolbox for Markovian Performance Evaluation", VALUETOOLS, 2017', 'quasi-birth-death and matrix-analytic routines');
161add('mam.qbd', 'Hor17', 'G. Horvath, M. Telek, "BuTools 2: A Rich Toolbox for Markovian Performance Evaluation", VALUETOOLS, 2017', 'quasi-birth-death and matrix-analytic routines');
162add('mg1.fb', 'WieH03', 'A. Wierman, M. Harchol-Balter, "Classifying scheduling policies with respect to unfairness in an M/GI/1", ACM SIGMETRICS, 2003', 'size-based M/G/1 scheduling response times');
163add('mg1.lrpt', 'WieH03', 'A. Wierman, M. Harchol-Balter, "Classifying scheduling policies with respect to unfairness in an M/GI/1", ACM SIGMETRICS, 2003', 'size-based M/G/1 scheduling response times');
164add('mg1.psjf', 'WieH03', 'A. Wierman, M. Harchol-Balter, "Classifying scheduling policies with respect to unfairness in an M/GI/1", ACM SIGMETRICS, 2003', 'size-based M/G/1 scheduling response times');
165add('mg1.srpt', 'WieH03', 'A. Wierman, M. Harchol-Balter, "Classifying scheduling policies with respect to unfairness in an M/GI/1", ACM SIGMETRICS, 2003', 'size-based M/G/1 scheduling response times');
166add('fb', 'WieH03', 'A. Wierman, M. Harchol-Balter, "Classifying scheduling policies with respect to unfairness in an M/GI/1", ACM SIGMETRICS, 2003', 'size-based M/G/1 scheduling response times');
167add('lrpt', 'WieH03', 'A. Wierman, M. Harchol-Balter, "Classifying scheduling policies with respect to unfairness in an M/GI/1", ACM SIGMETRICS, 2003', 'size-based M/G/1 scheduling response times');
168add('psjf', 'WieH03', 'A. Wierman, M. Harchol-Balter, "Classifying scheduling policies with respect to unfairness in an M/GI/1", ACM SIGMETRICS, 2003', 'size-based M/G/1 scheduling response times');
169add('srpt', 'WieH03', 'A. Wierman, M. Harchol-Balter, "Classifying scheduling policies with respect to unfairness in an M/GI/1", ACM SIGMETRICS, 2003', 'size-based M/G/1 scheduling response times');
170add('mg1.setf', 'NuyW08', 'M. Nuyens, A. Wierman, "The Foreground-Background queue: A survey", Perform. Eval. 65, 2008', 'foreground-background M/G/1 response times');
171add('setf', 'NuyW08', 'M. Nuyens, A. Wierman, "The Foreground-Background queue: A survey", Perform. Eval. 65, 2008', 'foreground-background M/G/1 response times');
172add('mapm1ps', 'MasuyamaTakine2003', 'H. Masuyama, T. Takine, "Sojourn time distribution in a MAP/M/1 processor-sharing queue", Oper. Res. Lett. 31, 2003', 'MAP/M/1-PS sojourn time distribution');
173add('mmt', 'dobre24', 'R.-A. Dobre, Z. Niu, G. Casale, "Approximating Fork-Join Systems via Mixed Model Transformations", ICPE Companion, 2024', 'mixed model transformation of the fork-join network');
174add('fjt', 'dobre24', 'R.-A. Dobre, Z. Niu, G. Casale, "Approximating Fork-Join Systems via Mixed Model Transformations", ICPE Companion, 2024', 'mixed model transformation of the fork-join network');
175add('ht', 'heidelberger1982queueing', 'P. Heidelberger, K. Trivedi, "Queueing network models for parallel processing with asynchronous tasks", IEEE TC C-31(11), 1982', 'fork-join transformation with auxiliary asynchronous tasks');
176add('heidelberger-trivedi', 'heidelberger1982queueing', 'P. Heidelberger, K. Trivedi, "Queueing network models for parallel processing with asynchronous tasks", IEEE TC C-31(11), 1982', 'fork-join transformation with auxiliary asynchronous tasks');
177add('forktail', 'NguALCJ18', 'M. Nguyen, S. Alesawi, N. Li, H. Che, H. Jiang, "ForkTail: A Black-Box Fork-Join Tail Latency Prediction Model", ACM HPDC, 2018', 'response time tail of the fork-join request from the branch moments');
178add('qiu', 'QiuPH15', 'Z. Qiu, J. F. Perez, P. G. Harrison, "Beyond the Mean in Fork-Join Queues: Efficient Approximation for Response-Time Tails", IFIP PERFORMANCE, 2015', 'response time tail of a homogeneous fork-join network');
179add('ctmc', 'BolGMT06', 'G. Bolch, S. Greiner, H. de Meer, K. S. Trivedi, "Queueing Networks and Markov Chains", Wiley, 2006', 'CTMC formulation, uniformization and its stationary solution');
180add('uniformization', 'BolGMT06', 'G. Bolch, S. Greiner, H. de Meer, K. S. Trivedi, "Queueing Networks and Markov Chains", Wiley, 2006', 'CTMC formulation, uniformization and its stationary solution');
181add('courtois', 'courtois1977decomposability', 'P. J. Courtois, "Decomposability: Queueing and Computer System Applications", Academic Press, 1977', 'nearly-completely-decomposable aggregation of the chain');
182add('kms', 'koury1984iterative', 'J. R. Koury, D. F. McAllister, W. J. Stewart, "Iterative methods for computing stationary distributions of nearly completely decomposable Markov chains", SIAM J. Alg. Disc. Meth. 5, 1984', 'iterative aggregation-disaggregation of the chain');
183add('takahashi', 'takahashi1975iterative', 'Y. Takahashi, "A lumping method for numerical calculations of stationary distributions of Markov chains", 1975', 'lumping-based iterative solution of the chain');
184add('qrf', 'CasNPS16', 'G. Casale, V. De Nitto Persone, E. Smirni, "QRF: An Optimization-Based Framework for Evaluating Complex Stochastic Networks", ACM TOMACS 26, 2016', 'quadratic reduction bounds on the chain');
185add('qrf.mmi', 'CasNPS16', 'G. Casale, V. De Nitto Persone, E. Smirni, "QRF: An Optimization-Based Framework for Evaluating Complex Stochastic Networks", ACM TOMACS 26, 2016', 'quadratic reduction bounds on the chain');
186add('qrf.mem', 'CasNPS16', 'G. Casale, V. De Nitto Persone, E. Smirni, "QRF: An Optimization-Based Framework for Evaluating Complex Stochastic Networks", ACM TOMACS 26, 2016', 'quadratic reduction bounds on the chain');
187add('qrf.bas', 'CasNPS16', 'G. Casale, V. De Nitto Persone, E. Smirni, "QRF: An Optimization-Based Framework for Evaluating Complex Stochastic Networks", ACM TOMACS 26, 2016', 'quadratic reduction bounds on the chain');
188add('qrf.rsrd', 'CasNPS16', 'G. Casale, V. De Nitto Persone, E. Smirni, "QRF: An Optimization-Based Framework for Evaluating Complex Stochastic Networks", ACM TOMACS 26, 2016', 'quadratic reduction bounds on the chain');
189add('ssa', 'Gill77', 'D. T. Gillespie, "Exact stochastic simulation of coupled chemical reactions", J. Phys. Chem. 81(25), 1977', 'stochastic simulation of the Markov process sample path');
190add('firingdep', 'mars.ea84', 'M. Ajmone Marsan, G. Conte, G. Balbo, "A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems", ACM TOCS 2(2), 1984', 'marking-dependent transition firing rates (setFiringRateDependence)');
191add('oi', 'BonP03', 'T. Bonald, A. Proutiere, "Insensitive bandwidth sharing in data networks", Queueing Systems 44(1), 2003', 'balanced-fairness balance function of the order-independent station');
192add('nc.oi', 'BonP03', 'T. Bonald, A. Proutiere, "Insensitive bandwidth sharing in data networks", Queueing Systems 44(1), 2003', 'balanced-fairness balance function of the order-independent station');
193add('mva.oi', 'BonP03', 'T. Bonald, A. Proutiere, "Insensitive bandwidth sharing in data networks", Queueing Systems 44(1), 2003', 'balanced-fairness balance function of the order-independent station');
194add('pas', 'ComD21', 'C. Comte, J.-P. Dorsman, "Pass-and-swap queues", Queueing Systems, 2021 (arXiv:2009.12299)', 'per-communicating-class product form of the pass-and-swap network');
195add('nrm', 'And07', 'D. F. Anderson, "A modified next reaction method for simulating chemical systems with time dependent propensities and delays", J. Chem. Phys. 127, 2007', 'next-reaction method for the simulation');
196add('fld', 'PerC17', 'J. F. Perez, G. Casale, "LINE: Evaluating Software Applications in Unreliable Environments", IEEE Trans. Reliability 66(3), 2017', 'mean-field fluid ODEs for the queueing network');
197add('fluid', 'PerC17', 'J. F. Perez, G. Casale, "LINE: Evaluating Software Applications in Unreliable Environments", IEEE Trans. Reliability 66(3), 2017', 'mean-field fluid ODEs for the queueing network');
198add('statedep', 'PerC17', 'J. F. Perez, G. Casale, "LINE: Evaluating Software Applications in Unreliable Environments", IEEE Trans. Reliability 66(3), 2017', 'mean-field fluid ODEs for the queueing network');
199add('closing', 'PerC17', 'J. F. Perez, G. Casale, "LINE: Evaluating Software Applications in Unreliable Environments", IEEE Trans. Reliability 66(3), 2017', 'mean-field fluid ODEs for the queueing network');
200add('matrix', 'RuuskanenBAC21', 'J. Ruuskanen, T. Berner, K.-E. Arzen, A. Cervin, "Improving the mean-field fluid model of processor sharing queueing networks", Perform. Eval. 151, 2021', 'matrix form of the processor-sharing fluid model');
201add('rmf', 'GastH16', 'N. Gast, B. Van Houdt, "Transient and steady-state regime of a family of list-based cache replacement algorithms", Queueing Syst. 83, 2016', 'refined mean-field approximation');
202add('fluid.rmf', 'GastH16', 'N. Gast, B. Van Houdt, "Transient and steady-state regime of a family of list-based cache replacement algorithms", Queueing Syst. 83, 2016', 'refined mean-field approximation');
203add('sfifo.rmf', 'GastH16', 'N. Gast, B. Van Houdt, "Transient and steady-state regime of a family of list-based cache replacement algorithms", Queueing Syst. 83, 2016', 'position-resolved mean field for the strict FIFO(m) replacement variant');
204add('fifo.rmf.tran', 'GastH16', 'N. Gast, B. Van Houdt, "Transient and steady-state regime of a family of list-based cache replacement algorithms", Queueing Syst. 83, 2016', 'position-resolved mean-field transient for FIFO(m) (steady state equals RANDOM(m))');
205add('diffusion', 'BolGMT06', 'G. Bolch, S. Greiner, H. de Meer, K. S. Trivedi, "Queueing Networks and Markov Chains", Wiley, 2006', 'diffusion approximation of the queue-length process');
206add('jmt', 'BerCS07', 'M. Bertoli, G. Casale, G. Serazzi, "The JMT Simulator for Performance Evaluation of Non-Product-Form Queueing Networks", ANSS, 2007', 'discrete-event simulation and JMVA analysis');
207add('jsim', 'BerCS07', 'M. Bertoli, G. Casale, G. Serazzi, "The JMT Simulator for Performance Evaluation of Non-Product-Form Queueing Networks", ANSS, 2007', 'discrete-event simulation and JMVA analysis');
208add('jmva', 'BerCS07', 'M. Bertoli, G. Casale, G. Serazzi, "The JMT Simulator for Performance Evaluation of Non-Product-Form Queueing Networks", ANSS, 2007', 'discrete-event simulation and JMVA analysis');
209add('ln', 'roli.sevc95', 'J. A. Rolia, K. C. Sevcik, "The Method of Layers", IEEE TSE 21(8), 1995', 'layer decomposition of the layered queueing network');
210add('layers', 'roli.sevc95', 'J. A. Rolia, K. C. Sevcik, "The Method of Layers", IEEE TSE 21(8), 1995', 'layer decomposition of the layered queueing network');
211add('lqns', 'lqns12', 'G. Franks, P. Maly, M. Woodside, D. C. Petriu, A. Hubbard, M. Mroz, "Layered Queueing Network Solver and Simulator User Manual", Carleton University, 2012', 'layered queueing solver and simulator');
212add('ln.dec', 'fran.ea09', 'G. Franks, T. Al-Omari, M. Woodside, O. Das, S. Derisavi, "Enhanced Modeling and Solution of Layered Queueing Networks", IEEE TSE 35(2), 2009', 'enhanced decomposition of the layers');
213add('enhanced', 'fran.ea09', 'G. Franks, T. Al-Omari, M. Woodside, O. Das, S. Derisavi, "Enhanced Modeling and Solution of Layered Queueing Networks", IEEE TSE 35(2), 2009', 'enhanced decomposition of the layers');
214add('ln.fluid', 'trib13', 'M. Tribastone, "A Fluid Model for Layered Queueing Networks", IEEE TSE 39(6), 2013', 'fluid model of the layered network');
215add('env', 'casa.trib11', 'G. Casale, M. Tribastone, "Fluid Analysis of Queueing in Two-Stage Random Environments", QEST, 2011', 'queueing in a random environment');
216add('env.blend', 'pere.casa13', 'J. F. Perez, G. Casale, "Assessing SLA Compliance from Palladio Component Models", MICAS, 2013', 'environment-stage blending of the metrics');
217end