@BOOK{Cox66:Statistical,
AUTHOR="D. R. Cox and Pierre Lewis",
TITLE="The Statistical Analysis of Series of Events",
PUBLISHER="Methuen/Wiley",
ADDRESS="London/New York",
YEAR=1966,
KEYWORDS="statistics",
}

@BOOK{King66:Algebra,
AUTHOR="J. F. C. Kingman",
TITLE="On the Algebra of Queues",
SERIES="Methuen's Monographs on Applied Probability and Statistics",
PUBLISHER="Methuen",
ADDRESS="London",
YEAR=1966,
KEYWORDS="queueing theory; probability; statistics",
}

@ARTICLE{Lill6607:Confidence,
AUTHOR="Hubert W. Lilliefors",
TITLE="Some Confidence Intervals for Queues",
JOURNAL=or,
VOLUME=14,
NUMBER=4,
PAGES="723-727",
MONTH="July--August",
YEAR=1966,
KEYWORDS="queueing theory; confidence intervals",
ABSTRACT="It is possible to calculate for many queueing situations, in
the steady state, the state probabilities, the expected number of units
in the system or in the queue, the proportion of idle time per channel,
and other quantities of interest. These quantities are calculated as a
function of the number of channels, the queueing discipline, and the
parameters of the distributions of arrival and service times. If the
parameters of the distributions are known exactly, then the results are
exact. In many cases of interest, however, the parameters are not known
exactly and estimate must be used. In such situations one obtains
estimates rather than exact values for the state probabilities, expected
number of units in the queue, and the other quantities. In order to make
use of these estimates it is important to know the precision of the
estimates as measured by their respective confidence intervals. In this
paper confidence intervals are calculated for several cases of
interest.",
ANNOTE="provides bounds on expected number in system/queue and idle
probability for $M/M/1$, $M/M/2$, $M/E\_r/1$ given bounds on $\rho$",
}

@BOOK{Stor66:Verkehrstheorie,
AUTHOR="H. Störmer and  others",
TITLE="Verkehrstheorie",
PUBLISHER="Oldenburg Verlag",
ADDRESS="München, Germany",
PAGES=285,
YEAR=1966,
LANGUAGE="German",
REFERENCES=100,
KEYWORDS="Traffic engineering; queueing system",
}

@ARTICLE{Teic66:Computer,
AUTHOR="D. Teichrow and Jianghong Lubin",
TITLE="Computer simulation: discussion of the technique",
JOURNAL=cacm,
VOLUME=9,
YEAR=1966,
KEYWORDS="simulation",
}

@ARTICLE{Week66:Numerical,
AUTHOR="W. T. Weeks",
TITLE="Numerical inversion of Laplace transforms using Laguerre
functions",
JOURNAL=jacm,
VOLUME=13,
PAGES="419-426",
YEAR=1966,
REFERENCES=14,
KEYWORDS="Mathematics; Laplace transform; inversion",
}

@ARTICLE{Burk66:Random,
AUTHOR="P. J. Burke",
TITLE="Random service, finite-source delay distribution for one server
with constant holding time",
JOURNAL=or,
VOLUME=14,
PAGES="695-698",
YEAR=1966,
REFERENCES=4,
KEYWORDS="M/D/1/N; random; single server; calculation; finite source",
ABSTRACT="Formulas are derived suitable for calculating the stationary
waiting-time distribution for the model described in the titel.",
}

@ARTICLE{Gave66:Observing,
AUTHOR="D. P. Gaver",
TITLE="Observing stochastic processes, and approximate transform
inversion",
JOURNAL=or,
VOLUME=14,
NUMBER=3,
PAGES="444-459",
YEAR=1966,
REFERENCES=10,
KEYWORDS="Approximation; stochastic process; Laplace transform",
ABSTRACT="This paper describes a method for obtaining numerical
information concerning the time-dependent behaviour of stochastic
processes. The method leads to an approximate inverse of the Laplace
transform. Examples are given of applications to transform with known
inverses, and the evolution of expected waiting time at a simple
single-server queue is illustrated, both when there is a staionary
solution and in the saturated case.",
}

@BOOK{Schw66:Communication,
AUTHOR="M. Schwartz and William R. Bennett and Seymour Stein",
TITLE="Communication Systems and Techniques",
PUBLISHER="McGraw-Hill",
YEAR=1966,
KEYWORDS="communication theory; Q-function",
}

@ARTICLE{Bric66:Teleprocessing,
AUTHOR="J. P. Bricault and I. Delgalvis",
TITLE="On teleprocessing system design part {III:} an analysis of a
request-queued buffer pool",
JOURNAL=ibmsj,
VOLUME=5,
NUMBER=3,
PAGES="148-157",
YEAR=1966,
REFERENCES=5,
KEYWORDS="Buffer memory; evaluation; queueing system; queueing
approximation; simulation",
ABSTRACT="The problem of allocating main storage for a message-segment
bu ffer pool is considered. A queueing model that approximates the most
typical mode of operation is formulated. Solutions for the number of
buffers required by the pool are obtained. Although the solutions
require iterative computational methods, they are not difficult to
program.",
}

@ARTICLE{Chan66:Queueing,
AUTHOR="W. Chang",
TITLE="A queueing model for a simple case of time sharing",
JOURNAL=ibmsj,
VOLUME=5,
NUMBER=2,
PAGES="115-125",
YEAR=1966,
REFERENCES=7,
KEYWORDS="M/g/1; feedback",
ABSTRACT="This paper discusses a queueing model for a nonpriority time-s
haring environment in which all active tasks fit in a homogeneous main
storage. Design parameters such as queue length and response time, as
well as their distributions, can be estimated with the aid of the model.
The model provides a basic frame of reference for the development of
more complicated models.",
}

@ARTICLE{Dahl66:SIMULA,
AUTHOR="Joachim Dahl and J. Nygaard",
TITLE="{SIMULA,} an {ALGOL-based} simulation language",
JOURNAL=cacm,
VOLUME=9,
PAGES="671-",
YEAR=1966,
KEYWORDS="Discrete event simulation; SIMULA",
ABSTRACT="First article!",
}

@ARTICLE{Davi66:Waiting,
AUTHOR="R. H. Davis",
TITLE="Waiting-time distribution of a multiserver, priority queuing
system",
JOURNAL=or,
VOLUME=14,
PAGES="133-136",
YEAR=1966,
REFERENCES=2,
KEYWORDS="Evaluation; analytical model; M/M/N; HOL priority; waiting
time",
ABSTRACT="An explicit formula is given for the waiting-time distribution
of any number of parallel, negative-exponential servers subject to
Poisson demands from any number of priority classes. The demand rates
may be different for the priority classes, but the service rate is the
same for all classes. The queue discipline is first-come-within-priority
class sequence.",
}

@ARTICLE{Esau66:Teleprocessing,
AUTHOR="L. R. Esau and K. C. Williams",
TITLE="On teleprocessing system design Part {II:} a method for
approximating the optimal network",
JOURNAL=ibmsj,
VOLUME=5,
NUMBER=3,
PAGES="142-147",
YEAR=1966,
KEYWORDS="Communication network; approximation; method; cost;
configuration analysis",
ABSTRACT="A teleprocessing system may include many low-speed terminals
at great distance from the computing center. Specification of a
communication network for connecting the remote terminals to the central
computer constitutes an important design problem.",
}

@ARTICLE{Ever66:Periodic,
AUTHOR="D. Everett",
TITLE="Periodic digital sequences with pseudo-noise properties",
JOURNAL="GEC journal",
VOLUME=33,
NUMBER=3,
PAGES="115-",
YEAR=1966,
KEYWORDS="Shift register sequences",
}

@ARTICLE{Gay66:Teleprocessing,
AUTHOR="T. W. Gay",
TITLE="On teleprocessing system design, part {V:} a technique for
estimating channel interference",
JOURNAL=ibmsj,
VOLUME=5,
NUMBER=3,
PAGES="171-174",
YEAR=1966,
REFERENCES=2,
KEYWORDS="I/O channel; performance evaluation; model; queueing system",
ABSTRACT="In typical teleprocessing applications, a large number of
terminals communicate with the main-storage unit of a centrally locat ed
computer. The communication activities may reduce the processing
capacity of the computer by claiming a significant number of
main-storage access cycles. Using a simple queueing model as a starting
point, a usefully accurate solution method is developed. The system/360
multiplexor channel is analyzed as an examp",
}

@ARTICLE{Gils66:Results,
AUTHOR="R. P. Gilson",
TITLE="Some results of amplitude distribution experiments on shift
register generated pseudo-random noise",
JOURNAL=ieeetc,
VOLUME="C-",
PAGES="926-",
YEAR=1966,
KEYWORDS="Shift register sequences",
}

@ARTICLE{Gree66:Number,
AUTHOR="H. Greenberg and I. Greenberg",
TITLE="The number served in a queue",
JOURNAL=or,
VOLUME=14,
PAGES="137-144",
YEAR=1966,
REFERENCES=2,
KEYWORDS="M/M/1; number of elements in system",
ABSTRACT="A single-server queue with Poisson arrivals and exponential
service is studied to obtain the joint probability distribution of the
number in the system at time $t$ and the cumulative number already
served at time $t$. The probability that $k$ are served in time $t$ is
then determined.",
}

@BOOK{Heng66:Mathematische,
AUTHOR="M. Hengst",
TITLE="Einführung in die mathematische Statistik",
PUBLISHER="BI Hochschultaschenbücher",
ADDRESS="Mannheim",
VOLUME="BI 42/42a",
PAGES=252,
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Statistics",
}

@BOOK{Jann66:Random,
AUTHOR="Jannson and  Birger",
TITLE="Random number generators",
PUBLISHER="Victor Pettersons",
ADDRESS="Stockholm",
YEAR=1966,
KEYWORDS="random number generator",
}

@ARTICLE{Jenk66:Stationary,
AUTHOR="J. H. Jenkins",
TITLE="Stationary joint distributions arising in the analysis of the
{M/G/1} queue by the method of the imbedded Markov chain",
JOURNAL=jap,
VOLUME=3,
PAGES="512-520",
YEAR=1966,
REFERENCES=3,
KEYWORDS="M/G/1; imbedded Markov chain; compound distribution",
ABSTRACT="Probability generating functions are used to relate the joint
distribution of the numbers of customers left behind by two successive
departing customers to the marginal distribution of the number left
behind each departing customer. A probability generating function is
then found for the joint distribution of the numbers of customers
arriving in two successive departure intervals using the joint
distribution of the numbers of customers left beh",
}

@ARTICLE{Kamm66:Vollelektronische,
AUTHOR="A. Kammerl",
TITLE="Eine vollelektronische Fernschreib- und Datenwählvermittlung",
JOURNAL=ntz,
PAGES="322-330",
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Switching system; EDS",
ABSTRACT="Die erste Veröffentlichung über EDS vom Erfinder.",
}

@ARTICLE{Marg66:Part,
AUTHOR="W. P. Margopoulos and R. J. Williams",
TITLE="Part {I:} characteristic problems on teleprocessing system
design",
JOURNAL=ibmsj,
VOLUME=5,
NUMBER=3,
PAGES="134-141",
YEAR=1966,
REFERENCES=2,
KEYWORDS="Queueing system; survey; communication network; simulation;
design; performance evaluation",
ABSTRACT="For analytical purposes, a teleprocessing system can be
characterized as a digital computer with unscheduled inputs from a
number of remote points. In the design of such a system, various
queueing problems arise as a consequence of the unscheduled inputs, and
the necessity of linking remote points to the central computer leads to
a problem in combinatorial mathematics.",
}

@TECHREPORT{Mech66:Confidence,
AUTHOR="H. Mechanic and W. McKay",
TITLE="Confidence intervals for averages of dependent data in
{simulations-II}",
INSTITUTION="IBM-report no. ASDD 17-202",
ADDRESS="Yorktown Heights",
YEAR=1966,
KEYWORDS="simulation; output analysis; time series analysis;
correlation; confidence interval; expectation; fundamentals in
statistics; variance; mechanic McKay sampling",
ABSTRACT="A method is described for the iterative calculation of
confidence intervals for averages of autocorrelated data which are gene
rated in a stationary stochastic process. Singular emphasis is placed on
the method to monte carlo computer simulation data. The approach is
non-parametric and uses the central limit theorem with batch means
instead of original data. The convergence criterion for the iterative
scheme utilizes an indirect formulation fo",
}

@ARTICLE{Namn66:Vergleich,
AUTHOR="P. Namneck",
TITLE="Vergleich von Zufallszahlen-Generatoren",
JOURNAL=er,
VOLUME=8,
NUMBER=1,
PAGES="28-",
YEAR=1966,
LANGUAGE="German",
KEYWORDS="random number generation",
}

@ARTICLE{Neut66:Alternative,
AUTHOR="M. F. Neuts",
TITLE="An alternative proof of a theorem of Takacs on the {GI/M/1}
queue",
JOURNAL=or,
VOLUME=14,
PAGES="313-316",
YEAR=1966,
REFERENCES=4,
KEYWORDS="GI/M/1; Takacs; transition matrix; Z-transform; geometric
distribution",
ABSTRACT="An analytic proof is given of the fact that the stationary
distribution for the imbedded Markov chain in a GI/M/1 queue is
geometric. A generating function for the stationary transition
probabilities is obtained as the unique solution to an integro-differ
ential equation, which may be solved by reduction to a Wiener-Hopf
equation.",
}

@ARTICLE{Prab66:Results,
AUTHOR="Narahari Umanath Prabhu",
TITLE="Some results for the queue with Poisson arrivals",
JOURNAL=jrss,
VOLUME=22,
PAGES="104-107",
YEAR=1966,
REFERENCES=8,
KEYWORDS="M/g/1; busy period; served elements per busy period",
ABSTRACT="This paper concerned with the queueing system in which (1)
there is only one counter, (2) the customers arrive at random and are
served in the order of arrival, and (3) the service-time distribution
has a general form. The distribution of the time taken for a
waiting-time x to reduce to zero for the first time is obtained, and
from this are deduced the explicit expressions for the distributions of
(i) the length of the busy period, (ii) the num",
}

@INPROCEEDINGS{Robe66:Statistical,
AUTHOR="P. D. Roberts and R. H. Davies",
TITLE="Statistical properties of smoothed maximal-length linear binary
sequences",
BOOKTITLE="IEE",
VOLUME=113,
PAGES="190-",
YEAR=1966,
KEYWORDS="Shift register sequences",
}

@ARTICLE{Saat66:Seven,
AUTHOR="T. L. Saaty",
TITLE="Seven more years of queues",
JOURNAL=navres,
VOLUME=13,
NUMBER=4,
PAGES="447-476",
YEAR=1966,
KEYWORDS="Queueing system; bibliography",
ABSTRACT="Literaturverzeichnis zum Thema Warteschlangentheorie.",
}

@ARTICLE{Schr66:Queue,
AUTHOR="L. Schrage and L. W. Miller",
TITLE="The queue {M/G/1} with the shortest remaining processing time
discipline",
JOURNAL=or,
VOLUME=14,
PAGES="670-684",
YEAR=1966,
REFERENCES=11,
KEYWORDS="M/G/1; comparison; Laplace transform; waiting time; time in
system; SRPT; shortest remaining processing time",
ABSTRACT="A priority queueing model in which the processing times of
jobs are known upon arrival and preemption without loss of time or
processing already accomplished is studied. Priority is assigned to jobs
according to the length of processing remaining with highest priority
going to the job with least processing left. A preemption will occur
whenever the time of a newly arriving job is less than the remaining
processing time of the job then in servic",
}

@ARTICLE{Seam66:Teleprocessing,
AUTHOR="P. H. Seaman and R. A. Lind and T. L. Wilson",
TITLE="On teleprocessing system design, part {IV:} An analysis of
auxiliary-storage activity",
JOURNAL=ibmsj,
VOLUME=5,
NUMBER=3,
PAGES="158-170",
YEAR=1966,
REFERENCES=5,
KEYWORDS="DISK; I/O channel; queueing system; simulation; performance
evaluation",
ABSTRACT="Queues of requests for access to auxiliary storage play a
major role in every teleprocessing application. Assuming that access
requests are randomly distributed, a queueing model is formulated;
formulas are obtained for the mean and variance of the response-time
distribution, as well as for the utilization factors of the access
channel and the storage modules. Samples of analytical and simulation
results are given.",
}

@ARTICLE{Dais66:Zur,
AUTHOR="G. Daisenberger and H. Schwärtzel",
TITLE="Zur Dimensionierung zentralgesteuerter mehrstufiger
Koppelanordnungen in Durchgangsvermittlungsstellen für den
Fernsprechverkehr erkehr",
JOURNAL=ntz,
NUMBER=8,
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Drik66:Engset,
AUTHOR="V. V. Driksna and E. G. Wormald",
TITLE="Engset Traffic Tables",
JOURNAL="The Telecommunication Journal of Australia",
VOLUME="jun",
YEAR=1966,
KEYWORDS="Loss system",
}

@ARTICLE{Herz66:Exakte,
AUTHOR="U. Herzog",
TITLE="Die exakte Berechnung des Streuwertes von Überlaufverkehr hinter
Koppelanordnungen beliebiger Stufenzahl mit vollkommener bzw.
unvollkommener Erreichbarkeit",
JOURNAL=aeu,
VOLUME=20,
NUMBER=3,
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Overload control; flow control; communication network",
}

@ARTICLE{Herz66:RDA,
AUTHOR="U. Herzog and A. Lotze",
TITLE="Das {RDA-Verfahren,} ein Streuwertverfahren für unvollkommene
Bündel",
JOURNAL=ntz,
NUMBER=11,
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Overload control; flow control; communication network",
}

@ARTICLE{Kroc66:Vermittlungssysteme,
AUTHOR="E. Krocker",
TITLE="Vermittlungssysteme nach dem Prinzip der Zeitteilung",
JOURNAL=nte,
NUMBER=3,
YEAR=1966,
LANGUAGE="German",
KEYWORDS="TDM; time division multiplex",
}

@ARTICLE{Krui66:Verteilungsfunktionen,
AUTHOR="J. Kruithof",
TITLE="Die Verteilungsfunktionen der Fernsprechverkehrstheorie",
JOURNAL="Elektrisches Nachrichtenwesen",
VOLUME=41,
NUMBER=3,
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Loss system",
}

@ARTICLE{Lee66:Approximate,
AUTHOR="L. Lee and J. A. Brzozowski",
TITLE="An Approximate method for computing blocking probability in
switching",
JOURNAL=ieeecom,
VOLUME="COM-14",
NUMBER=2,
YEAR=1966,
KEYWORDS="Link system",
}

@MISC{Lenn66:Berechnungsunterlagen,
AUTHOR="J. Lennertz",
TITLE="Berechnungsunterlagen für die Planung von Fernmeldeanlagen",
PUBLISHER="Telefonbau und Normalzeit GmbH",
ADDRESS="Frankfurt/M",
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Loss system",
ABSTRACT="graues Tabellenbuch",
}

@ARTICLE{Lewa66:Zur,
AUTHOR="R. Lewandowski",
TITLE="Zur Theorie der Warteschlangen. Teil 1, 2, 3",
JOURNAL="Elektronische Datenverarbeitung",
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Delay system",
}

@ARTICLE{Lotz66:Verkehrstheoretische,
AUTHOR="A. Lotze",
TITLE="Verkehrstheoretische Fragen bei der Gestaltung internationaler
Fernwählnetze",
JOURNAL=ntz,
NUMBER=11,
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Overload control; flow control; communication network",
}

@ARTICLE{Lotz66:Streuwertgerechte,
AUTHOR="A. Lotze and R. Schehrer",
TITLE="Die streuwertgerechte Bemessung von Leitungsbündeln in Wählnetzen
mit Leitweglenkung",
JOURNAL=ntz,
NUMBER=12,
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Overload control; flow control; communication network",
}

@ARTICLE{Oehm66:Uber,
AUTHOR="F. Oehme",
TITLE="Über die Bedeutung der Hauptverkehrsstunde im Fernsprechverkehr",
JOURNAL=ntz,
NUMBER=12,
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Loss system",
}

@BOOK{Fell66:Probability,
AUTHOR="W. Feller",
TITLE="An Introduction to Probability Theory and its Applications",
PUBLISHER="John Wiley and Sons Inc.",
ADDRESS="New York",
VOLUME="1+2",
YEAR=1966,
KEYWORDS="Queueing theory",
}

@ARTICLE{Gafa66:Mean,
AUTHOR="A. V. Gafarian and C. J. Ancker",
TITLE="Mean value estimation from digital computer simulation",
JOURNAL=or,
VOLUME=14,
NUMBER=1,
PAGES="25-44",
YEAR=1966,
KEYWORDS="Simulation; statistical technique",
}

@ARTICLE{Gree66:Priority,
AUTHOR="M. Greenberger",
TITLE="The priority problem and computer time sharing",
JOURNAL="Management Science, Series A (Theory)",
VOLUME=12,
NUMBER=11,
PAGES="888-906",
YEAR=1966,
KEYWORDS="Queueing system; priority; analysis",
}

@INPROCEEDINGS{Jais66:Discussion,
AUTHOR="N. K. Jaiswal and R. V. Evans",
TITLE="Discussion of [Kleinrock 1966]",
BOOKTITLE="4th International Conference on Operational Research",
ADDRESS="Boston",
PAGES="935 (K-I, paper 5)",
YEAR=1966,
KEYWORDS="Queueing system; priority; analysis",
}

@MASTERSTHESIS{Bots66:Untersuchung,
AUTHOR="D. Botsch",
TITLE="Untersuchung einer Koppelstufe mit Extern- und Internverkehr",
SCHOOL="TH Stuttgart",
ADDRESS="Stuttgart",
VOLUME="B 240",
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Switching network",
}

@MASTERSTHESIS{Bouc66:Simulationsprogramm,
AUTHOR="W. Bouchard",
TITLE="Simulationsprogramm für 2-stufige Linksysteme und Programm zur
Verlustberechnung nach der Methode {CIRB}",
TYPE="Diplomarbeit",
SCHOOL="Institut  für  Nachrichtenvermittlung und Datenverarbeitung der
TH Stuttgart",
ADDRESS="Stuttgart, Germany",
NUMBER=153,
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Link system",
}

@BOOK{Heng66:Hrung,
AUTHOR="M. Hengst",
TITLE="Einf hrung in die mathematische Statistik",
PUBLISHER="BI Hochschultaschenb cher",
ADDRESS="Mannheim, Germany",
VOLUME="BI 42/42a",
PAGES=252,
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Statistics",
}

@ARTICLE{Akim66:Power,
AUTHOR="H. Akimaru and H. Shikota",
TITLE="Power Consumption of Crossbar Switching Systems",
JOURNAL=recl,
ADDRESS="Japan",
VOLUME=14,
NUMBER="Nr1-2",
YEAR=1966,
KEYWORDS="Gos",
}

@ARTICLE{Akim6603:Optimum,
AUTHOR="H. Akimaru and K. Shimizu",
TITLE="Optimum Assignment of Waiting Times in Common Control Systems",
JOURNAL=recl,
ADDRESS="Japan",
VOLUME=14,
NUMBER="3-4",
YEAR=1966,
KEYWORDS="Delay system",
}

@ARTICLE{Allm66:Bemessung,
AUTHOR="D. Allmendinger",
TITLE="Die Bemessung der Querleitungsb ndel im Leitungsnetz des {SWFD}",
JOURNAL=fernmeldepraxis,
ADDRESS="Germany",
VOLUME=43,
NUMBER=18,
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Overload control; flow control; communication network",
}

@TECHREPORT{Bear66:Trunking,
AUTHOR="D. B. Bear and J. A. Burgess",
TITLE="The Trunking Traffic Principles of a Generalised {R.E.X.}
System",
INSTITUTION="A.E.I. Ltd. Telecommunications  Group, United Kingdom",
ADDRESS="Great Britain",
YEAR=1966,
KEYWORDS="Link system",
}

@ARTICLE{Bene6609:Programming,
AUTHOR="V. E. Benes",
TITLE="Programming and Control Problems Arising from Optimal Routing in
Telephone Networks",
JOURNAL=bstj,
VOLUME=45,
NUMBER=9,
YEAR=1966,
KEYWORDS="Link system",
}

@ARTICLE{Bene6610:Example,
AUTHOR="V. E. Benes",
TITLE="Some Example of Comparisons of Connect-Networks",
JOURNAL=bstj,
VOLUME=45,
NUMBER=10,
YEAR=1966,
KEYWORDS="Link system",
}

@ARTICLE{Bini6609:Verlustberechnung,
AUTHOR="N. Bininda and G. Daisenberger",
TITLE="Verlustberechnung bei Zwischenleitungsanordnungen der
Vermittlungstechnik",
JOURNAL=ntz,
ADDRESS="Germany",
NUMBER=9,
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Bini6605:Aufwand,
AUTHOR="N. Bininda and E. Hoffmann",
TITLE="Aufwand und Leistungsmerkmale bei Zwischenleitungsanordnungen der
Fernsprech-Vermittlungstechnik",
JOURNAL="Siemens-Zeitschrift",
ADDRESS="Germany",
NUMBER=5,
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Gos",
}

@PHDTHESIS{Bots66:Verlustwahrscheinlichkeit,
AUTHOR="D. Botsch",
TITLE="Die Verlustwahrscheinlichkeit einstufiger Koppelanordnungen der
Vermittlungstechnik mit Extern- und Internverkehr",
SCHOOL="TH Stuttgart",
ADDRESS="Stuttgart, Germany",
NOTE="AEÜ 22, 3, 1968 (extract)",
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Loss system",
}

@ARTICLE{Bret66:Moderne,
AUTHOR="G. Bretschneider",
TITLE="Moderne Erkenntnisse für ein- und zweistufige Koppelanordnungen
aufgrund exakter Verlustberechnungen",
JOURNAL="Informationen Fernsprech-Vermittlungstechnik Siemens",
ADDRESS="Germany",
VOLUME=2,
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Link system",
}

@BOOK{Nayl66:Computer,
AUTHOR="T. H. Naylor and J. L. Balintfy and D. S. Burdick and K. Chu",
TITLE="Computer Simulation Techniques",
PUBLISHER="John Wiley \& Sons Inc.",
ADDRESS="New York",
YEAR=1966,
KEYWORDS="Simulation",
}

@ARTICLE{Ahls66:Samtalstiden,
AUTHOR="B. V. M. Ahlstedt",
TITLE="Samtalstiden i telefontrafik",
JOURNAL="Sähko - Electricity in Finland",
ADDRESS="Finland",
PAGES=3,
YEAR=1966,
LANGUAGE="Finnish",
KEYWORDS="traffic analysis",
}

@MASTERSTHESIS{Brat66:Undersökning,
AUTHOR="I. Bratt",
TITLE="Undersökning av vissa Betjänings- og Beläggningstider i Större
Abonnentväxel",
TYPE="Examensarbete",
SCHOOL="KTH",
ADDRESS="Hösten, Denmark",
PAGES=37,
YEAR=1966,
LANGUAGE="Danish",
KEYWORDS="service time; distribution; traffic measurement",
}

@ARTICLE{Ehre66:Statistical,
AUTHOR="J. Ehrenborg and G. Elofsson",
TITLE="Statistical Analysis of the Times of Non-Repeated Tasks. A Study
of the Ratio of Two Normally Distributed Variables",
JOURNAL=ericssont,
NUMBER=1,
PAGES="81-108",
YEAR=1966,
KEYWORDS="Statistics; analysis; time random variable; stochastic
theory",
}

@ARTICLE{Feen66:Generalization,
AUTHOR="G. J. Feeney and C. C. Sherbrooke",
TITLE="Generalization of a Queueing Theorem of Palm to finite
Populations",
JOURNAL=ms,
VOLUME=12,
NUMBER=11,
PAGES="907-908",
YEAR=1966,
KEYWORDS="Analysis; queueing theory; finite source",
}

@ARTICLE{Krar66:Om,
AUTHOR="J. Krarup",
TITLE="Om L sning af Lineære Cirkulationsproblemer",
JOURNAL="Erhvervs konomisk Tidsskrift",
ADDRESS="Denmark",
NUMBER=3,
PAGES="149-180",
YEAR=1966,
LANGUAGE="Danish",
}

@ARTICLE{Lewi6604:Computer,
AUTHOR="Pierre Lewis",
TITLE="A Computer Program for the Statistical Analysis of Series of
Events",
JOURNAL="IBM System Journal",
VOLUME=5,
NUMBER=4,
PAGES="202-225",
YEAR=1966,
KEYWORDS="Time series analysis",
}

@TECHREPORT{Lotz66:Grundbegriffe,
AUTHOR="A. Lotze",
TITLE="Grundbegriffe der Vermittlungstechnik nach den
Nomenklatur-Vorschlägen des International Teletraffic Congress 1964 in
London {(ITC-4)}",
INSTITUTION="NVDV, Universität Stuttgart",
ADDRESS="Stuttgart, Germany",
PAGES=42,
YEAR=1966,
LANGUAGE="German",
KEYWORDS="Classification; traffic engineering",
}

@INCOLLECTION{Mage66:Guides,
AUTHOR="J. F. Magee",
TITLE="Guides to Inventory Policy",
BOOKTITLE="Readings in Production and Operations Management",
EDITOR="Elwood S. Buffa",
PUBLISHER="John Wiley \& Sons",
PAGES="392-441",
YEAR=1966,
KEYWORDS="Manufacturing system",
ABSTRACT="Lagerstyring",
}

@ARTICLE{Newe6601:Queue,
AUTHOR="G. F. Newell",
TITLE="The M/G/infinite Queue",
JOURNAL=siapp,
VOLUME=14,
NUMBER=1,
PAGES="86-88",
YEAR=1966,
KEYWORDS="M/g/oo",
}

@ARTICLE{Pruz66:Measures,
AUTHOR="P. M. Pruzan",
TITLE={Measures of Performance for "Significant" Planning Problems},
JOURNAL="Erhvervs konomisk Tidsskrift",
NUMBER=2,
PAGES="91-100",
YEAR=1966,
KEYWORDS="Network planning",
}

@ARTICLE{Flyn66:Very,
AUTHOR="M. J. Flynn",
TITLE="Very High-Speed Computing Systems",
JOURNAL=ieeeproc,
VOLUME=54,
NUMBER=12,
PAGES="1901-1909",
YEAR=1966,
REFERENCES=23,
KEYWORDS="Classification; distributed computing system; distributed
processing; multiprocessing; multiprocessor system; parallel computing",
ABSTRACT="Very high-speed computers may be classified as follows: 1)
Single Instruction Stream-Single Data Stream (SISD) 2) Single
Instruction Stream-Multiple Data Stream (SIMD) 3) Multiple Instruction
Stream-Single Data Stream (MISD) 4) Multiple Instruction Stream-Multiple
Data Stream (MIMD) ...",
}

@BOOK{Stan66:Teletraffic,
AUTHOR="Standard Electrik Lorenz",
TITLE="Teletraffic Engineering Manual",
PUBLISHER="{Standard Electrik Lorenz}",
ADDRESS="Stuttgart, Germany",
YEAR=1966,
KEYWORDS="teletraffic; Erlang",
ANNOTE="Traffic measurements revealed the following mean holding times:
PABX, 1 minute; local switching center, 1.5 to 2.5 minutes; and
long-distance center, 2.0 to 4.0 minutes.",
}

@ARTICLE{Star6602:Sequential,
AUTHOR="N. Starr",
TITLE="The performance of a sequential procedure for the fixed-width
interval estimation of the mean",
JOURNAL=ams,
VOLUME=37,
NUMBER=1,
PAGES="36-50",
MONTH=feb,
YEAR=1966,
KEYWORDS="Simulation; statistical technique",
}

@ARTICLE{Maki6606:Study,
AUTHOR="T. Makino",
TITLE="On a Study of Output Distribution",
JOURNAL=jorsj,
VOLUME=8,
NUMBER=3,
PAGES="109-133",
MONTH=jun,
YEAR=1966,
REFERENCES=11,
KEYWORDS="Queueing system",
}

@ARTICLE{Neel6607:Comparison,
AUTHOR="P. M. Neely",
TITLE="Comparison of several algorithms for computation of means,
standard deviations and correlation coefficients",
JOURNAL=cacm,
VOLUME=9,
NUMBER=7,
PAGES="496-499",
MONTH=jul,
YEAR=1966,
KEYWORDS="Simulation; statistics; numeric calculation",
}

@INPROCEEDINGS{Klei6608:Queuing,
AUTHOR="L. Kleinrock",
TITLE="Queuing with strict and lag priority mixtures",
BOOKTITLE="4th International Conference on Operational Research",
EDITOR="D. B. Hertz and J. Melese",
ADDRESS="Boston",
PAGES="921-934",
MONTH=aug,
YEAR=1966,
KEYWORDS="Queueing system; priority; analysis",
}

@ARTICLE{Held6609:Customer,
AUTHOR="George K. Helder",
TITLE="Customer evaluation of telephone circuits with delay",
JOURNAL=bstj,
VOLUME=45,
NUMBER=7,
PAGES="1157-1191",
MONTH=sep,
YEAR=1966,
REFERENCES=3,
KEYWORDS="delay; echo; telephony",
ABSTRACT="In 1964 tests were begun in which customers making
transatlantic calls, to which varying amounts of delay had been added,
were interviewed after call completion to determine the circuit quality.
These tests were continued in 1965 using the Early Bird satellite which
some customers used extensively before being interviewed. During this
period a number of different echo suppressors were also tested. Results
show that the quality of telephone circuits with echo suppressors
decreases with increasing delay, that previous satellite calls have no
effect on the customer's opinion on his present call, and that no echo
suppressor was superior for all delays although some appear to be better
for longer delays.",
}

@ARTICLE{Lehm6610:Concepts,
AUTHOR="E. L. Lehmann",
TITLE="Some Concepts of Dependence",
JOURNAL=ams,
VOLUME=37,
NUMBER=5,
PAGES="1137-1153",
MONTH=oct,
YEAR=1966,
KEYWORDS="statistics",
ABSTRACT="The purpose of this paper is to give three successively
stronger definitions of positive dependence, to investigate their
consequences, explore the strength of each definition through a number
of examples, and to give some statistical applications.",
}

@ARTICLE{Skou66:Simulationsmodellens,
AUTHOR="T. F. Skousen",
TITLE="Simulationsmodellens Muligheder",
JOURNAL="Forskning",
ADDRESS="Denmark",
NUMBER=7,
PAGES="181-185",
MONTH=oct,
YEAR=1966,
LANGUAGE="Danish",
KEYWORDS="Simulation method",
}

@INPROCEEDINGS{Mars6611:General,
AUTHOR="G. Marsaglia",
TITLE="A general method for producing random variables in a computer",
BOOKTITLE="Fall Joint Computer Conference",
ADDRESS="San Francisco",
PAGES="169-173",
MONTH=nov,
YEAR=1966,
KEYWORDS="random number generation",
}

@ARTICLE{Vart6612:Effects,
AUTHOR="A. G. Vartabedian",
TITLE="The effects of transmission delay in four-wire teleconferencing",
JOURNAL=bstj,
VOLUME=45,
NUMBER=10,
PAGES="1673-1688",
MONTH=dec,
YEAR=1966,
REFERENCES=14,
KEYWORDS="delay; telephony; quality of service",
ABSTRACT="The effects of transmission delay upon the performance of a
three-party teleconference were investigated using a problem-oriented
task. The teleconference was simulated in a laboratory using 4-wire
telephone sets interconnected to form a three-party conference network
without echo sources or echo control devices. The two experimental
conditions were characterized by (a) a network whose three legs provided
transmission delays of 600 milliseconds, 300 milliseconds and no delay,
and (b) a network each of whose three legs provided no transmission
delay. It was found that: (i) time to complete the experimental task was
28 percent greater in the delay condition than in the no-delay
condition, (ii) the error rate was less in the delay condition than in
the no-delay condition, (iii) time per-trial was less in the no-delay
condition than in the delay condition, and (iv) no chairmanship pattern
developed as a result of time delay in the network. Moreover, not one of
the subjects reported having observed the existence of delay in the
voice path. There were, however, more complaints of ``talking together''
in the delay condition.",
}