1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
|
@c This file has been automatically generated from references.txi
@c by proc.m. Do not edit this file, all changes will be lost
@c -*- texinfo -*-
@c Copyright (C) 2012, 2016 Moreno Marzolla
@c
@c This file is part of the queueing package.
@c
@c The queueing package is free software; you can redistribute it
@c and/or modify it under the terms of the GNU General Public License
@c as published by the Free Software Foundation; either version 3 of
@c the License, or (at your option) any later version.
@c
@c The queueing package is distributed in the hope that it will be
@c useful, but WITHOUT ANY WARRANTY; without even the implied warranty
@c of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
@c GNU General Public License for more details.
@c
@c You should have received a copy of the GNU General Public License
@c along with the queueing package; see the file COPYING. If not, see
@c <http://www.gnu.org/licenses/>.
@node References
@chapter References
@table @asis
@item [Aky88]
Ian F. Akyildiz, @cite{Mean Value Analysis for Blocking Queueing
Networks}, IEEE Transactions on Software Engineering, vol. 14, n. 2,
april 1988, pp. 418--428. DOI @uref{http://dx.doi.org/10.1109/32.4663, 10.1109/32.4663}
@item [Bar79]
Y. Bard, @cite{Some Extensions to Multiclass Queueing Network Analysis},
proc. 4th Int. Symp. on Modelling and Performance Evaluation of
Computer Systems, feb. 1979, pp. 51--62.
@item [BCMP75]
F. Baskett, K. Mani Chandy, R. R. Muntz, and F. G. Palacios. 1975. @cite{Open, Closed, and Mixed Networks of Queues with Different Classes of Customers}. J. ACM 22, 2 (April 1975), 248—260, DOI @uref{http://doi.acm.org/10.1145/321879.321887, 10.1145/321879.321887}
@item [BGMT98]
G. Bolch, S. Greiner, H. de Meer and
K. Trivedi, @cite{Queueing Networks and Markov Chains: Modeling and
Performance Evaluation with Computer Science Applications}, Wiley,
1998.
@item [Buz73]
J. P. Buzen, @cite{Computational Algorithms for Closed Queueing
Networks with Exponential Servers}, Communications of the ACM, volume
16, number 9, september 1973,
pp. 527--531. DOI @uref{http://doi.acm.org/10.1145/362342.362345, 10.1145/362342.362345}
@item [C08]
G. Casale, @cite{A note on stable flow-equivalent aggregation in
closed networks}. Queueing Syst. Theory Appl., 60:193–-202, December
2008, DOI @uref{http://dx.doi.org/10.1007/s11134-008-9093-6,
10.1007/s11134-008-9093-6}
@item [CMS08]
G. Casale, R. R. Muntz, G. Serazzi,
@cite{Geometric Bounds: a Non-Iterative Analysis Technique for Closed
Queueing Networks}, IEEE Transactions on Computers, 57(6):780-794,
June 2008. DOI @uref{http://doi.ieeecomputersociety.org/10.1109/TC.2008.37, 10.1109/TC.2008.37}
@item @anchor{GrSn97}[GrSn97]
C. M. Grinstead, J. L. Snell, (July 1997). @cite{Introduction
to Probability}. American Mathematical Society. ISBN 978-0821807491;
this excellent textbook is @uref{http://www.dartmouth.edu/~chance/teaching_aids/books_articles/probability_book/amsbook.mac.pdf, available in PDF format}
and can be used under the terms of the @uref{http://www.gnu.org/copyleft/fdl.html, GNU Free Documentation License (FDL)}
@item [Jac04]
J. R. Jackson, @cite{Jobshop-Like Queueing Systems}, Vol. 50, No. 12, Ten Most Influential Titles of "Management Science's" First Fifty Years (Dec., 2004), pp. 1796-1802, @uref{http://www.jstor.org/stable/30046149, available online}
@item [Jai91]
R. Jain, @cite{The Art of Computer Systems Performance Analysis},
Wiley, 1991, p. 577.
@item [HsLa87]
C. H. Hsieh and S. Lam,
@cite{Two classes of performance bounds for closed queueing networks},
PEVA, vol. 7, n. 1, pp. 3--30, 1987
@item [Ker84]
T. Kerola, @cite{The Composite Bound Method (CBM) for Computing
Throughput Bounds in Multiple Class Environments},
Performance Evaluation, Vol. 6 Isue 1, March 1986, DOI
@uref{http://dx.doi.org/10.1016/0166-5316(86)90002-7, 10.1016/0166-5316(86)90002-7}; also available as
@uref{http://docs.lib.purdue.edu/cstech/395/,
Technical Report CSD-TR-475}, Department of Computer Sciences, Purdue
University, mar 13, 1984 (Revised aug 27, 1984).
@item [LZGS84]
E. D. Lazowska, J. Zahorjan, G. Scott Graham, and K. C.
Sevcik, @cite{Quantitative System Performance: Computer System
Analysis Using Queueing Network Models}, Prentice Hall,
1984. @uref{http://www.cs.washington.edu/homes/lazowska/qsp/, available online}.
@item [ReKo76]
M. Reiser, H. Kobayashi, @cite{On The Convolution Algorithm for
Separable Queueing Networks}, In Proceedings of the 1976 ACM
SIGMETRICS Conference on Computer Performance Modeling Measurement and
Evaluation (Cambridge, Massachusetts, United States, March 29--31,
1976). SIGMETRICS '76. ACM, New York, NY,
pp. 109--117. DOI @uref{http://doi.acm.org/10.1145/800200.806187, 10.1145/800200.806187}
@item [ReLa80]
M. Reiser and S. S. Lavenberg, @cite{Mean-Value Analysis of Closed
Multichain Queuing Networks}, Journal of the ACM, vol. 27, n. 2, April
1980, pp. 313--322. DOI
@uref{http://doi.acm.org/10.1145/322186.322195, 10.1145/322186.322195}
@item [Sch79]
P. Schweitzer, @cite{Approximate Analysis of Multiclass Closed Networks of
Queues}, Proc. Int. Conf. on Stochastic Control and Optimization, jun
1979, pp. 25—29
@item [Sch80]
H. D. Schwetman, @cite{Testing Network-of-Queues Software},
@uref{http://docs.lib.purdue.edu/cstech/259/, Technical Report CSD-TR
330}, Department of computer Sciences, Purdue University, 1980
@item [Sch81]
H. D. Schwetman, @cite{Some Computational Aspects of Queueing Network
Models}, @uref{http://docs.lib.purdue.edu/cstech/285/, Technical
Report CSD-TR-354}, Department of Computer Sciences, Purdue
University, feb, 1981 (revised).
@item @anchor{Sch82}[Sch82]
H. D. Schwetman, @cite{Implementing the Mean Value Algorithm for the
Solution of Queueing Network Models},
@uref{http://docs.lib.purdue.edu/cstech/286/, Technical Report
CSD-TR-355}, Department of Computer Sciences, Purdue University, feb
15, 1982.
@item [Sch84]
T. Kerola, H. D. Schwetman, @cite{Performance Bounds for
Multiclass Models}, @uref{http://docs.lib.purdue.edu/cstech/399/,
Technical Report CSD-TR-479}, Department of Computer Sciences, Purdue
University, 1984.
@item [Tij03]
H. C. Tijms, @cite{A first course in stochastic models},
John Wiley and Sons, 2003, ISBN 0471498807, ISBN 9780471498803,
DOI @uref{http://dx.doi.org/10.1002/047001363X, 10.1002/047001363X}
@item [ZaWo81]
J. Zahorjan and E. Wong, @cite{The solution of separable queueing
network models using mean value analysis}. SIGMETRICS
Perform. Eval. Rev. 10, 3 (Sep. 1981), 80-85.
DOI @uref{http://doi.acm.org/10.1145/1010629.805477, 10.1145/1010629.805477}
@item [Zeng03]
G. Zeng, @cite{Two common properties of the erlang-B function, erlang-C function, and Engset blocking function}, Mathematical and Computer Modelling, Volume 37, Issues 12-13, June 2003, Pages 1287-1296 DOI
@uref{http://dx.doi.org/10.1016/S0895-7177(03)90040-9, 10.1016/S0895-7177(03)90040-9}
@end table
|
