|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
Forest Baskett , K. Mani Chandy , Richard R. Muntz , Fernando G. Palacios, Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, Journal of the ACM (JACM), v.22 n.2, p.248-260, April 1975
[doi> 10.1145/321879.321887]
|
| |
2
|
BILLINGSLEY, P Convergence of Probab:hty Measures Wiley, New York, 1968
|
| |
3
|
B tJZEN, J Queuing network models ofmulttprogrammmg Ph D Th, Dlv Eng and Appl Phys, Harvard U, Cambridge, Mass, 1971
|
| |
4
|
(~INLAR, E Introduction to Stochasoc Processes Prentice-Hall, Englewood Chffs, N J, 1975
|
| |
5
|
(~INLAR, E Markov renewal theory A survey Manage Sc: 21 (1975), 727-752
|
| |
6
|
Cox, D R A use of complex probabthtles m the theory of stochastic processes Proc Camb Phd Soc 51 (1955), 313-319
|
| |
7
|
CRANE, M, AND IGLEHART, n L Simulating stable stochastic systems Ill, Regenerative processes and discrete event simulation Oper Res 23 (1975), 33-45
|
| |
8
|
|
| |
9
|
HORDIJK, A., IGLEHART, D L, AND SCHASSBERGER, R Discrete time methods for simulating contmuous time Markov chains Adv Appl Prob. 8 (1976), 772-778
|
| |
10
|
IGLEHART, D L S~mulatlng stable stochastic systems. V Comparison of ratio estimators Naval Res Loglst Quart 22 (1975), 553-565
|
| |
11
|
IGLEHART, n L The regenerative method for simulation analysts in Current Trends m Programming Methodology, Vol IH Software Modelhng, K M Chandy and R T Yeh, Eds, Prentice-Hall, Englewood ChiTs, N J, 1978, pp 52-71
|
| |
12
|
|
| |
13
|
IGLEHART, D L, AND SHEDLER, G S. Estimation via regenerative simulation of response times m networks of queues IBM Res Rep RJ 1740, IBM Res Lab, San Jose, Cahf, 1976 (an earher version of this paper)
|
| |
14
|
JACKSON, J R Job shop-hke queuing systems. Manage Scl 10 (1963), 131-142
|
| |
15
|
LAVENBERG, S S, AND SHEDLER, G S Stochastic modehng of processor scheduhng with apphcatton to data base management systems IBM J Res Devel 20 (1976), 437-448
|
| |
16
|
LEWIS, P A W., GOODMAN, A S, AND MILLER, J M A pseudo-random number generator for the System/360 1BM Syst J 8 (1969), 136-146
|
| |
17
|
|
| |
18
|
MOORE, C G III Network models for large-scale ttme-sharmg systems Tech Rep No 7 i-1, Dept lndust Eng, U of Michigan, Ann Arbor, Mtch, 1971
|
| |
19
|
RElSER, M, A~D KOBAYASHI, H Queuemg networks with multiple closed chains Theory and computational algorithms IBM J Res. Devel 19 (1975), 283-294
|
| |
20
|
SMrrH, W L. Renewal theory and its ramifications J Roy Stat Soc B, 20 (1958), 243-302
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
G.3