@BOOK{Farq69:Theory,
AUTHOR="R. Farquharson",
TITLE="Theory of voting",
PUBLISHER="University of Oxford",
ADDRESS="Oxford, England",
YEAR=1969,
KEYWORDS="voting; game theory",
}

@INPROCEEDINGS{Gust69:Model,
AUTHOR="H. W. Gustafson",
TITLE="Model for the analysis of talkspurt and silence durations in
conversational interaction",
BOOKTITLE="77th Annual Convention of the American Psychology
Association",
ORGANIZATION="APA",
VOLUME=44,
PAGES="43-44",
YEAR=1969,
KEYWORDS="talkspurt; silence detection; silence period; voice source
model",
ABSTRACT="distinguishes utterance from talkspurt; an utterance is a
sequence of talkspurts interspersed with silences; notes that silences
within utterances tend to be short while those between utterances are
much longer",
}

@BOOK{Pari69:Basic,
AUTHOR="Demetrius T. Paris and F. Kenneth Hurd",
TITLE="Basic Electromagnetic Theory",
PUBLISHER="McGraw-Hill Book Company",
ADDRESS="New York",
YEAR=1969,
}

@ARTICLE{Sobe69:Optimal,
AUTHOR="M. J. Sobel",
TITLE="Optimal average-cost policy for a queue with start-up and
shut-down costs",
JOURNAL=or,
VOLUME=17,
PAGES="145-162",
YEAR=1969,
REFERENCES=15,
KEYWORDS="GI/G/1; cost; startup cost; shut down cost",
ABSTRACT="This paper examines pure stationary policies for starting and
stopping service in a single-server queue with respect to the state
space consisting of queue length and whether or not the service facility
is operating.",
}

@ARTICLE{Stan69:Measurement,
AUTHOR="W. I. Stanley",
TITLE="Measurement of system operational statistics",
JOURNAL=ibmsj,
VOLUME=8,
NUMBER=4,
PAGES="299-308",
YEAR=1969,
REFERENCES=6,
KEYWORDS="Performance evaluation; software monitor; multiprogramming",
ABSTRACT="This paper discusses programming techniques for continously
gathering performance data in a complex multijobbing environment. The
program takes advantage of computing system and support program
characteristics to count and time data processing activities. The data
gathered by the program enables installation managers to measure the
effects of modifications to equipment and programming support
configurations and to define work loads.",
}

@ARTICLE{Subb69:Class,
AUTHOR="S. Subba-Rao and N. K. Jaiswal",
TITLE="On a class of queueing problems and discrete transforms",
JOURNAL=or,
VOLUME=17,
PAGES="1062-1076",
YEAR=1969,
REFERENCES=15,
KEYWORDS="Gi/m/1; m/g/1; transform; balking; reneging",
ABSTRACT="The main object of the paper is to demonstrate a method by
which a number of problems arising in the study of impatient customers
in queues can be solved. The main difficulty in analyzing such queueing
systems is the presence of variable coefficients in the
difference-differential equations describing the processes; the usual
generating function method fails in such cases. When there is a finite
number of states, it has been shown that at least",
}

@TECHREPORT{Wain69:Properties,
AUTHOR="S. Wainberg",
TITLE="Properties of subsequences of the pseudo-random sequences",
INSTITUTION="Polytechnic Institute of Brooklyn",
ADDRESS="New York, New York",
YEAR=1969,
KEYWORDS="Shift register sequences",
}

@ARTICLE{Whit69:Multidimensional,
AUTHOR="J. R. B. Whittlesey",
TITLE="On the multidimensional uniformity of pseudorandom generators",
JOURNAL=cacm,
VOLUME=12,
PAGES=247,
YEAR=1969,
REFERENCES=7,
KEYWORDS="Comparison; shift register sequences; tausworthe generator",
ABSTRACT={It would appear that george marsaglia's recent article proving
that all the pseudorandom points generated in the unit n-cube "will be
found to lie in a relatively small number of parallel hyperplanes" has
given the coup de grace, to the use of multiplica tive congruential
generators in all monte carlo applications, except those having the most
non-stringent requirements for multi dimensional uniformity.},
}

@ARTICLE{Zier69:Primitive,
AUTHOR="N. Zierler and J. Brillhart",
TITLE="On primitive trinomials (mod 2) {II}",
JOURNAL="Informatics Control",
VOLUME=14,
PAGES="566-569",
YEAR=1969,
KEYWORDS="Shift register sequences; tausworthe generator",
ABSTRACT="The present paper is a completion of a previous paper of the
same title.",
}

@ARTICLE{Adir69:Computer,
AUTHOR="I. Adiri",
TITLE="Computer Time-Sharing Queues with Priorities",
JOURNAL=jacm,
VOLUME=16,
NUMBER=4,
PAGES="631-645",
YEAR=1969,
REFERENCES=8,
KEYWORDS="Time sharing; queueing system; priority",
ABSTRACT="The paper deals with computer time-sharing disciplines in
which external priorities are introduced. For a computer system under a
time-sharing discipline, the following priority disciplines are
discussed: (a) head-of-the-line; (b) preemptive repeat; and (c) mixed
preemptive strategy. All models in question assume that customers arrive
according to homogeneous Poisson processes. Results are given in terms
of steady-state expectations.",
}

@INPROCEEDINGS{Adir69:Queueing,
AUTHOR="I. Adiri and B. Avi-Itzhak",
TITLE="Queueing Models for Time-sharing Service Systems",
BOOKTITLE="5th International Conference on Operations Research",
ADDRESS="Venice, Italy",
PAGES="205-222",
YEAR=1969,
REFERENCES=11,
KEYWORDS="Queueing system; model; time sharing; Round Robin",
ABSTRACT="This paper reviews some time-sharing queueing disciplines.
Especially several types of Round Robin are considered and compared with
other disciplines.",
}

@ARTICLE{Drum69:Perspective,
AUTHOR="M. E. Drummond",
TITLE="A perspective on system performance evaluation",
JOURNAL=ibmsj,
VOLUME=4,
PAGES="252-263",
YEAR=1969,
REFERENCES=6,
KEYWORDS="Computer system; performance evaluation",
ABSTRACT="A historical summary of the growing complexities in computing
sytems and the effect of these complexities on system performance
evaluation are presented. The paper outlines basic approaches. It
considers the application of test results and thetest data itself. Two
general approaches to gathering performance data are discussed.",
}

@ARTICLE{Gern69:Mathematisches,
AUTHOR="D. Gernert and H. J. Linn and R. Marquardt",
TITLE="Ein mathematisches Verfahren zur Bestimmung der optimalen
Belegung von Verkehrs- und Nachrichtennetzen; A mathematical method to
determine optimal schedules for traffic and communication networks",
JOURNAL=er,
VOLUME=11,
NUMBER=5,
PAGES="272-275",
YEAR=1969,
LANGUAGE="German",
REFERENCES=3,
KEYWORDS="Communication network; scheduling; mathematical method",
ABSTRACT="The method described here, which particularly applies tools
fromgraph theory, determines a schedule which respects some conditions
mentioned in the article (especially chronological sequence or overlap
of schedule entries) and maximizes the number of fulfilled
requirements.",
}

@ARTICLE{Hell69:Principles,
AUTHOR="H. Hellerman",
TITLE="Some principles of time-sharing scheduler strategies",
JOURNAL=ibmsj,
VOLUME=2,
PAGES="94-117",
YEAR=1969,
REFERENCES=11,
KEYWORDS="Analysis; time sharing; scheduling; round robin; workload",
ABSTRACT="Fundamental considerations in time and space scheduling for
timesharing systems are reviewed. Workload components are classifiedas
trivial and nontrivial foreground, and background. A responsefigure of
merit is defined. Simulation results using a very simple workload and
system model are included in the discussion. A summary is given of some
major issues in scheduling for time-sharing and virtual systems.",
}

@ARTICLE{Naor69:Regulation,
AUTHOR="P. Naor",
TITLE="On the Regulation of Queue Size by Levying Tolls",
JOURNAL="Econometrica",
VOLUME=37,
PAGES="15-24",
YEAR=1969,
}

@ARTICLE{Adir69:Time,
AUTHOR="I. Adiri and B. Avi-Itzhak",
TITLE="A time-sharing model with many queues",
JOURNAL=or,
VOLUME=17,
PAGES="1077-1089",
YEAR=1969,
REFERENCES=3,
KEYWORDS="Time sharing; round robin; model; queueing discipline;
nonexhaustive service",
ABSTRACT="This paper presents a mathematical study of a time-sharing
system with a single server and many queues. In each queue a customer
receives one quantum of service and is then sent to the end of the next
queue, provided his service demand has not been completely satisfied.
When a quantum of service is completed, the server attends to the first
customer in the lowest-index nonempty queue. The discipline of the
highest indexed queue is 'round-robin'",
}

@ARTICLE{Bros69:Preemptive,
AUTHOR="I. Brosh",
TITLE="Preemptive priority assignment in multichannel systems",
JOURNAL=or,
VOLUME=17,
PAGES="527-535",
YEAR=1969,
REFERENCES=10,
KEYWORDS="PREHOL priority; M/M/N; waiting time; time in system; queue
length; upper bound; lower bound; preemptive priority",
ABSTRACT="Customers of different priorities arrive at a system in
accordance with a Poisson process. The customers are serviced by c
service stations using a preemptive priority discipline. When the
servicing times are exponentially distributed, this paper derives
expressions for the expected waiting time for inception of service, as
well as the lower and upper bounds for the expected staying time and
expected number of customers of each priority class",
}

@ARTICLE{Burk69:Dependence,
AUTHOR="P. J. Burke",
TITLE="The dependence of sojourn times in tandem {M/M/S} queues",
JOURNAL=or,
VOLUME=17,
PAGES="754-755",
YEAR=1969,
REFERENCES=2,
KEYWORDS="M/M/N; time in system; tandem queue; FIFO; independent random
variable",
ABSTRACT="It has been shown in previous work that a sufficient condition
for the sojourn times of a customer in a sequence of stationary M/M/S
queues in series to be mutually independent random variables is that all
queues except the first and last have single servers. An example is
considered which shows that, in general, the single-server condition is
also necessary.",
}

@ARTICLE{Chen69:Trace,
AUTHOR="P. S. Cheng",
TITLE="Trace-driven system modeling",
JOURNAL=ibmsj,
VOLUME=8,
NUMBER=4,
PAGES="280-289",
YEAR=1969,
REFERENCES=12,
KEYWORDS="Model; event sequencing; performance evaluation;
multiprocessing; multiprogramming; operating system",
ABSTRACT="A trace-driven modeling technique for computer system
evaluation is discussed. This approach intends to solve the inherent
dilemma in computer systems modeling of too many simplifying assumptions
or of too much detail. An experimental model based on this technique is
also discussed. The objective of the model is to study the effect on
performance of various multiprogramming and multiprocessing system
design choices. Model implementation is focu",
}

@ARTICLE{Coop69:Queues,
AUTHOR="R. B. Cooper and G. Murray",
TITLE="Queues served in cyclic order",
JOURNAL=bstj,
VOLUME=48,
PAGES="675-689",
YEAR=1969,
REFERENCES=12,
KEYWORDS="Queueing system; polling",
}

@ARTICLE{Davi69:Feedback,
AUTHOR="A. C. Davies",
TITLE="The design of feedback shift registers and other synchronous
counters",
JOURNAL="Radio and electronic engineer",
PAGES="213-",
YEAR=1969,
KEYWORDS="Shift register sequences",
}

@ARTICLE{Davi69:Probability,
AUTHOR="A. C. Davies",
TITLE="Probability-density functions of digitally filtered m-sequences",
JOURNAL=elet,
VOLUME=5,
PAGES="222-224",
YEAR=1969,
KEYWORDS="Shift register sequences",
}

@ARTICLE{Delb69:Multiserver,
AUTHOR="L. E. N. Delbrouck",
TITLE="A multiserver queue with enforced idle times",
JOURNAL=or,
VOLUME=17,
PAGES="506-518",
YEAR=1969,
REFERENCES=7,
KEYWORDS="FIFO; M/M/N; server vacation",
ABSTRACT="In this paper, exact, recursive, and asymptotic formulas are
derived for a queueing system in which access to the servers takes place
at regular intervals. Steady-state results, already know n, are extended
and utilized to construct delay distributions that are adaptable to
computer work.",
}

@ARTICLE{Durr69:Single,
AUTHOR="L. Durr",
TITLE="A single-server priority queueing system with general holding
times, Poisson input, and reverse-order-of-arrival queueing discipline",
JOURNAL=or,
VOLUME=17,
PAGES="351-358",
YEAR=1969,
REFERENCES=9,
KEYWORDS="LIFO; priority; M/G/1; single server",
ABSTRACT="This paper gives an explicit formula for the waiting-time
distribution in a single-server system with general holding times
subject to a Poisson input from any number of priority classes.  In the
general case, where the holding-time distributions of the demands in
each priority case are different, the Laplace-Stieltjes transform and
the moments of the distribution are found.  The queue discipline is
last-come first-served in each priority class.",
}

@ARTICLE{Eilo69:Simpler,
AUTHOR="S. Eilon",
TITLE="A simpler proof of {L=} {Lambda*W}",
JOURNAL=or,
VOLUME=17,
PAGES="915-917",
YEAR=1969,
REFERENCES=3,
KEYWORDS="Number of elements in system; time in system; traffic
intensity; little's formula",
ABSTRACT="This note presents a simple proof that does not depend on
arrival time or service time distributions, on the number of servers in
the system, or on the queueing discipline.",
}

@ARTICLE{Enns69:Waiting,
AUTHOR="E. G. Enns",
TITLE="Some waiting-time distributions for queues with multiple feedback
and priorities",
JOURNAL=or,
VOLUME=17,
PAGES="519-525",
YEAR=1969,
REFERENCES=4,
KEYWORDS="Queueing system; M/G/1; feedback; waiting time; priority",
ABSTRACT="This paper considers a single-server queue where incoming
calls require exactly $N$ services before leaving the system. Each
service has a certain priority in relation to all other services, the
server always accepting for service the call at the head of the nonempty
queue with highest priority whenever he completes a service. Originating
calls arrive according to a Poisson process and the service times for
each type of service are independent random variables.",
}

@INPROCEEDINGS{Hart69:Development,
AUTHOR="M. G. Hartley",
TITLE="Development, design and test procedures for random generators
using chaincodes",
BOOKTITLE="IEE",
VOLUME=116,
PAGES="22-",
YEAR=1969,
KEYWORDS="random number generation; test",
}

@INPROCEEDINGS{Hart69:Random,
AUTHOR="M. G. Hartley",
TITLE="Evaluation of performance of random generators employing
chaincodes",
BOOKTITLE="IEE",
VOLUME=116,
PAGES="27-",
YEAR=1969,
KEYWORDS="random number generation; shift register sequences",
}

@ARTICLE{Heat69:Approximation,
AUTHOR="C. R. Heathcote and P. Winer",
TITLE="An approximation for the moments of waiting times",
JOURNAL=or,
VOLUME=17,
PAGES="175-186",
YEAR=1969,
REFERENCES=7,
KEYWORDS="EK/EM/1; GI/G/1; M/D/1; M/M/1; queueing approximation; moment;
waiting time; time dependent queueing system",
ABSTRACT="Methods are available for computing properties of the waiting
time associated with a variety of single-server queueing models in the
equilibrium state. Since these calculations are more difficult in the
time-dependent case, this paper develops an approximation procedure
applicable to a wide class of single-server queues.",
}

@ARTICLE{Hend69:GI,
AUTHOR="W. Henderson",
TITLE="{GI/M/1} priority queue",
JOURNAL=or,
VOLUME=17,
PAGES="907-910",
YEAR=1969,
REFERENCES=10,
KEYWORDS="GI/M/1; PREHOL priority; queue length",
}

@TECHREPORT{Kivi69:Digital,
AUTHOR="P. J. Kiviat",
TITLE="Digital computer simulation: computer programming languages",
INSTITUTION="RAND Corp., AD 684 124",
ADDRESS="Santa Monica, CA",
PAGES=58,
YEAR=1969,
KEYWORDS="Simulation",
}

@BOOK{Knut69:Art,
AUTHOR="D. E. Knuth",
TITLE="The art of computer programming",
PUBLISHER="Addison Wesley",
ADDRESS="Reading, Mass",
VOLUME="1--3",
YEAR=1969,
KEYWORDS="Programming language; statistics; random number generation;
sorting",
}

@ARTICLE{Kumm69:Vorschlag,
AUTHOR="K. Kümmerle",
TITLE="Ein Vorschlag zur Berechnung der Vertrauensintervalle bei
Verkehrstests",
JOURNAL=aeu,
VOLUME=23,
PAGES="507-511",
YEAR=1969,
LANGUAGE="German",
KEYWORDS="time series analysis; simulation; method; runtime/storage
efficiency; loss system; regression analysis; statistical test;
confidence interval",
ABSTRACT="To check the accuracy of approximate methods for calculating
switching arrangements simulations with artificial traffic are used. Up
to now the statistical evaluation has been effected by means of the
student or t-test and yielded confidence limits for the unknown
quantity, for instance for the probability of loss. However, it was not
taken into account that not only the random sample values of loss vary,
but also those of traffic offered. In",
}

@ARTICLE{McKi69:Analytical,
AUTHOR="J. M. McKinney",
TITLE="A survey of analytical time-sharing models",
JOURNAL=acmcs,
VOLUME=1,
NUMBER=2,
PAGES="105-116",
YEAR=1969,
REFERENCES=35,
KEYWORDS="survey; research problem; bibliography; feedback; round robin;
priority; time sharing",
ABSTRACT="Queueing models of time-sharing algorithms have been appearing
in the literature with increasing frequency. This survey delineates the
parameters which distinguish the different analytic models and presents
the research results of most of the papers to date. The techniques used
in analyzing various round-robin models and multiple-level queue models
both with and without priorities are emphasized. The results indicate
provide the system designer",
}

@ARTICLE{Nair69:Priority,
AUTHOR="S. S. Nair and M. F. Neuts",
TITLE="A priority rule based on the ranking of the service times for the
{M/G/1} queue",
JOURNAL=or,
VOLUME=17,
PAGES="466-477",
YEAR=1969,
REFERENCES=8,
KEYWORDS="Fifo; m/g/1; lpt; spt",
ABSTRACT="This paper studies the virtual waiting time for the m/g/1
queue under this priority rule: within each generation, customers are
served in the order of shortest (or longest) service times. It also
considers the limiting behavior of the virtual waiting time, and
compares the asymptotic means with those of the first-come, first-served
discipline.",
}

@ARTICLE{Pake69:Conditions,
AUTHOR="A. G. Pakes",
TITLE="Some conditions for ergodicity and recurrence of Markov chains",
JOURNAL=or,
VOLUME=17,
PAGES="1058-1061",
YEAR=1969,
REFERENCES=4,
KEYWORDS="Markov process; recurrent process; ergodicity; state dependent
service",
ABSTRACT="This paper finds sufficient conditions for the ergodicity and
recurrence of irreducible and aperiodic Markov chains. They extend some
of the ones commonly used. The paper also indicates their use in
discussing a certain class of queueing problem with state dependent
service times.",
}

@INPROCEEDINGS{Saka69:Processor,
AUTHOR="M. Sakata and S. Noguchi and J. Oizumi",
TITLE="Analysis of a processor shared queueing model for time sharing
systems",
BOOKTITLE="2nd Hawaii International Conference on Systems Science",
PAGES="625-628",
YEAR=1969,
REFERENCES=2,
KEYWORDS="M/G/1; processor sharing; time sharing; multiprocessor
system",
ABSTRACT="If the total processing capacity is constant, then it is
effective to decrease the number of processors, that is, to increase the
capacity of each processor as much as possible. The multi-processor
system of which all processors are centralized is more powerfull with
respect to the response time than the system in wh ich each processor is
operated independently.",
}

@PHDTHESIS{Sche69:Uber,
AUTHOR="R. Schehrer",
TITLE="Über die exakte Berechnung von Überlaufsystemen der
Wählvermittlungstechnik",
SCHOOL="Universität Stuttgart",
ADDRESS="Stuttgart",
YEAR=1969,
LANGUAGE="German",
KEYWORDS="Switching system; overflow traffic",
}

@ARTICLE{Schl69:Prinzipien,
AUTHOR="M. Schlichte",
TITLE="Prinzipien und Probleme der {PCM-Vermittlungstechnik}",
JOURNAL="Siemens Informationen Fernsprech-Vermittlungstechnik",
VOLUME=5,
PAGES="48-",
YEAR=1969,
LANGUAGE="German",
KEYWORDS="Switching system; PCM; circuit switching",
}

@ARTICLE{Schr69:Optimization,
AUTHOR="L. Schrage",
TITLE="Analysis and optimization of a queueing model of a real-time
computer control system",
JOURNAL=ieeetc,
VOLUME="C-18",
PAGES="997-1003",
YEAR=1969,
REFERENCES=2,
KEYWORDS="Model; optimization; M/G/1; priority; feedback; overhead
time",
ABSTRACT="A single processor provides service to jobs of several
different priority classes. The priority ordering remains constant over
time; however, the type of priority, i.e., preemptive or nonpreemptive,
may depend upon the stage of processing of the job occupying the
processor. We allow these preemptive and nonpreemptive intervals to be
specified in a relatively arbitrary fashion. If a job is interrupted, a
setup time must be incurred before proc",
}

@ARTICLE{Schr69:Mixed,
AUTHOR="L. Schrage",
TITLE="A mixed-priority queue with applications to the analysis of
real-time systems",
JOURNAL=or,
VOLUME=17,
PAGES="728-742",
YEAR=1969,
REFERENCES=10,
KEYWORDS="M/G/1; priority; moment; Laplace transform",
ABSTRACT="Jobs arrive in a Poisson stream to a single processor.
Associated with each job is a priority $j=1,2,\ldots$. The processing
time requested by a job can be partitioned into an arbitrary number of
intervals of two types, (1) noninterruptible portions and (2)
interruptible portions. Type 2 intervals can further be classified as
preemptive-resume intervals and preemptive-repeat intervals that, in
turn, can be further classified as being repeat with",
}

@ARTICLE{Schr69:Zeichenproduktion,
AUTHOR="F. Schreiber",
TITLE="Zeichenproduktion mit Datensichtgerät und Rechner",
JOURNAL=er,
YEAR=1969,
LANGUAGE="German",
KEYWORDS="Terminal; graphics",
}

@ARTICLE{Seam69:Simulating,
AUTHOR="P. H. Seaman and R. C. Soucy",
TITLE="Simulating operating systems",
JOURNAL=ibmsj,
VOLUME=8,
NUMBER=4,
PAGES="264-279",
YEAR=1969,
REFERENCES=6,
KEYWORDS="Simulation; operating system; model; GPSS",
ABSTRACT="A simulator is discussed that provides a language and a
structure specifically designed for modeling computer systems to
evaluate their performance. The simulator provides general equipment
models, and the authors discuss their experience in developing a general
submodel of a multiprogramming operating system. The user assembles a
system from the equipment models, specifies parameters to allow
simulation of his operating system functions, and",
}

@ARTICLE{Coff69:Drum,
AUTHOR="E. G. Coffman",
TITLE="Analysis of a Drum Input/Output Queue Under Scheduled Operation
in a Paged Computer System",
JOURNAL=jacm,
VOLUME=16,
NUMBER=1,
PAGES="73-90",
YEAR=1969,
REFERENCES=11,
KEYWORDS="Analysis; scheduling; mathematical model; generating function;
queue length; waiting time",
ABSTRACT="In this paper magnetic drums in the role of auxiliary memories
are studied in the context of multiprogramming systems featuring a paged
environment. Mathematical models are defined such that two extremes in
scheduling disciplines are represented in a system in which page
requests are assumed to arrive singly and at random. The analysis leads
to results for a measure of drum utilization and a generating function
for the queue length probability.",
}

@ARTICLE{Krus69:Work,
AUTHOR="J. B. Kruskal",
TITLE="Work-Scheduling Algorithms: A Nonprobabilistic Queuing Study
(with Possible Application to No. 1 {ESS)}",
JOURNAL=bstj,
PAGES="2963-2974",
YEAR=1969,
REFERENCES=3,
KEYWORDS="Priority; model; algorithm; evaluation; approximation;
method",
ABSTRACT="This paper provides an approximate method for evaluating
different cycles.  Using the evaluation method and some approximations,
we obtain a formula for the optimum relative frequency with which
different queues should be visited.  The model used is
non-probabilistic, and treats requests as continuous rather than
discrete.  The model also ignores certain interdependencies between
queues.",
}

@ARTICLE{Cono69:Correlated,
AUTHOR="B. W. Conolly and N. Hadidi",
TITLE="A correlated Queue",
JOURNAL=jap,
VOLUME=6,
PAGES="122-136",
YEAR=1969,
KEYWORDS="Delay system",
}

@ARTICLE{Ekbe69:Verkehrsverhalten,
AUTHOR="S. Ekberg and M. Gruszecki",
TITLE="Verkehrsverhalten einer dreistufigen Zwischenleitungsanordnung
mit Umordnungs- und Verlust / Wartemöglichkeiten (Verkehrssimulation des
Systems Pentaconta 32)",
JOURNAL="Elektrisches Nachrichtenwesen",
VOLUME=44,
NUMBER=1,
YEAR=1969,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Herz69:Berechnung,
AUTHOR="U. Herzog and A. Lotze and R. Schehrer",
TITLE="Die Berechnung von Leitungsbündeln hinter vereinfachten
Mischungstypen",
JOURNAL=ntz,
VOLUME=22,
NUMBER=12,
YEAR=1969,
LANGUAGE="German",
KEYWORDS="Grading",
}

@ARTICLE{Klei69:Auswirkungen,
AUTHOR="K.-H. Kleinau",
TITLE="Auswirkungen der Durchwahltechnik in Nebenstellenanlagen",
JOURNAL=fernmeldetechnik,
VOLUME=9,
NUMBER=12,
PAGES="357-362",
YEAR=1969,
LANGUAGE="German",
KEYWORDS="Gos",
}

@ARTICLE{Korb69:Serien,
AUTHOR="U. Körber",
TITLE="Die Serien-Wegesuche im praktischen Einsatz bei
zentralgesteuerten Vermittlungssystemen",
JOURNAL=ntz,
VOLUME=22,
NUMBER=1,
PAGES="36-40",
YEAR=1969,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Gall69:Theory,
AUTHOR="P. Le Gall",
TITLE="On the theory of the repetition of telephone calls",
JOURNAL=atele,
VOLUME=24,
NUMBER="7-8",
YEAR=1969,
KEYWORDS="Gos",
}

@ARTICLE{Gall69:Sur,
AUTHOR="P. Le Gall",
TITLE="Sur une theorie des repetitions des appels telephoniques",
JOURNAL=atele,
VOLUME=24,
NUMBER="7-8",
YEAR=1969,
LANGUAGE="French",
KEYWORDS="Gos",
}

@ARTICLE{Lonn69:Theory,
AUTHOR="I. Lönnqvist",
TITLE="Theory and Methods for Traffic Forecasting",
JOURNAL=tele,
VOLUME=21,
NUMBER=1,
PAGES="19-26",
YEAR=1969,
KEYWORDS="Gos",
}

@ARTICLE{Neim69:Structure,
AUTHOR="V. I. Neiman",
TITLE="Structure et Commande optimales de Réseaux de Connexion sans
Blocage",
JOURNAL=atele,
VOLUME=24,
NUMBER="7-8",
YEAR=1969,
LANGUAGE="French",
KEYWORDS="Link system",
}

@ARTICLE{Pfab69:Wie,
AUTHOR="G. Pfab",
TITLE="Wie verhalten sich Fernsprechteilnehmer bei besonderen
Anlässen?",
JOURNAL=ingdbp,
NUMBER=6,
YEAR=1969,
LANGUAGE="German",
KEYWORDS="Measurement",
}

@ARTICLE{Rans69:Measuring,
AUTHOR="V. L. Ransom and C. O. Riddleberger",
TITLE="Measuring Traffic in {PBX's}",
JOURNAL=attr,
VOLUME="Januar",
YEAR=1969,
KEYWORDS="Measurement",
}

@ARTICLE{Rege69:Simulationsprogramme,
AUTHOR="J. Reger and M. Schmöller",
TITLE="Simulationsprogramme in der Programmiersprache Fortran zur
Bestimmung der Leistungsfähigkeit von Koppelanordnungen",
JOURNAL="Informationen Fernsprech-Vermittlungstechnik",
VOLUME=5,
NUMBER=1,
YEAR=1969,
LANGUAGE="German",
KEYWORDS="Simulation",
}

@TECHREPORT{Ruba69:Table,
AUTHOR="J. Rubas",
TITLE="Table of the Engset loss formula",
INSTITUTION="Fundamental Planning Section Traffic Engineering Report",
ADDRESS="Melbourne",
NUMBER=12,
YEAR=1969,
KEYWORDS="Loss system",
}

@ARTICLE{Ryte69:Berechnung,
AUTHOR="F. Ryter",
TITLE="Einführung in die Berechnung mehrstufiger Koppelnetzwerke",
JOURNAL="PTT Technische Mitteilung",
VOLUME=47,
NUMBER=11,
YEAR=1969,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Taka69:Multi,
AUTHOR="K. Takagi",
TITLE="Design of Multi-Stage Link Systems with Optimum Channel Graph",
JOURNAL=recl,
VOLUME=17,
NUMBER=10,
YEAR=1969,
KEYWORDS="Link system",
}

@ARTICLE{Thie69:Wartesysteme,
AUTHOR="M. H. Thierer",
TITLE="Wartesysteme und gemischte Verlust-Wartesysteme mit
unvollkommener Erreichbarkeit",
JOURNAL=aeu,
VOLUME=23,
NUMBER=5,
PAGES="261-267",
YEAR=1969,
LANGUAGE="German",
KEYWORDS="Delay system",
}

@ARTICLE{Fuji69:Conditional,
AUTHOR="M. Fujiki and E. Gambe",
TITLE="Conditional waiting time in a multi-level feedback priority
queueing model",
JOURNAL=ecij,
VOLUME="52-C",
NUMBER=1,
PAGES="129-136",
YEAR=1969,
KEYWORDS="Queueing system; priority; analysis",
}

@ARTICLE{Hufn69:Simple,
AUTHOR="R. E. Hufnagel and E. L. Kerr",
TITLE="A simple algorithm for fast real-time generation of pseudorandom
Poisson integers with rapidly varying means",
JOURNAL=ieeeproc,
VOLUME=57,
NUMBER=11,
PAGES=2088,
YEAR=1969,
KEYWORDS="random number generation",
}

@ARTICLE{Meye69:Methods,
AUTHOR="D. L. Meyer",
TITLE="Methods of generating random normal numbers",
JOURNAL="Educational and Psychological Measurement",
VOLUME=29,
NUMBER=1,
PAGES="193-198",
YEAR=1969,
KEYWORDS="random number generation",
}

@ARTICLE{Nada69:Extension,
AUTHOR="B. Nadas",
TITLE="An extension of a theorem of Chow and Robbins on sequential
confidence intervals for the mean",
JOURNAL=ams,
VOLUME=40,
NUMBER=2,
PAGES="667-671",
YEAR=1969,
KEYWORDS="Simulation; statistical technique; confidence interval",
}

@PHDTHESIS{Kumm69:Berechnungsverfahren,
AUTHOR="K. Kümmerle",
TITLE="Berechnungsverfahren für mehrstufige Koppelanordnungen mit
konjugierter Durchschaltung; Systematik und Analyse",
SCHOOL="Institut für Nachrichtenvermittlung und Datenverarbeitung der
Universität Stuttgart",
ADDRESS="Stuttgart, Germany",
YEAR=1969,
LANGUAGE="German",
KEYWORDS="Link system",
}

@PHDTHESIS{Mont69:Ein,
AUTHOR="F.-K. von Montigny",
TITLE="Ein Beitrag zur Untersuchung der Verkehrsstruktur in
Groß-Wählnebenstellenanlagen",
SCHOOL="Fakultät für Elektrotechnik, RWTH",
ADDRESS="Aachen, Germany",
YEAR=1969,
LANGUAGE="German",
KEYWORDS="PABX; queueing theory",
}

@INPROCEEDINGS{Chu69:Study,
AUTHOR="Wesley W. Chu",
TITLE="A study of asynchronous time division multiplexing for
time-sharing computers",
BOOKTITLE="AFIPS Fall Joint Computer Conference",
ADDRESS="Montvale, NJ, USA",
VOLUME=35,
PAGES="669-678",
NOTE="also in \cite[p. 38-47]{Chu74:Advances}",
YEAR=1969,
KEYWORDS="Queueing system; batch arrival",
ANNOTE="see also \cite{Chu70:Buffer}; multiple servers with limited
waiting room; first part analyzes batch arrivals with
Poisson-distributed batch size (D^{[M]}/D/c/K), second part treats
discrete-time system with geometrically distributed burst length
arrivals, where number of bursts per service interval is Poisson
distributed (M^{[Geo]}/D/c/K).",
}

@INPROCEEDINGS{Jack69:Study,
AUTHOR="PE Jackson and CD Stubbs",
TITLE="A Study of Multi-Access Computer Communications",
BOOKTITLE="AFIPS Spring Joint Computer Conference",
VOLUME=34,
PAGES="491-504",
YEAR=1969,
}

@INCOLLECTION{Vajd69:Contribution,
AUTHOR="Igor Vajda",
TITLE="A contribution to the informational analysis of patterns",
BOOKTITLE="Mehtodologies of Pattern Recognition",
EDITOR="S Watanabe",
PUBLISHER="Academic Press",
PAGES="509-519",
YEAR=1969,
ABSTRACT="Relationship between conditional entropy and classification
errror (loss). Talks about upper and lower bounds.",
}

@BOOK{Gord69:System,
AUTHOR="G. Gordon",
TITLE="System simulation",
PUBLISHER="Prentice Hall",
ADDRESS="Englewood Cliffs, New Jersey",
YEAR=1969,
KEYWORDS="Simulation; GPSS",
}

@ARTICLE{Davi69:Principles,
AUTHOR="Donald W. Davies",
TITLE="The principles of a data communication network for computers and
remote peripherals",
JOURNAL="Information Processing",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Netherlands",
VOLUME=68,
PAGES="709-715",
YEAR=1969,
REFERENCES=4,
KEYWORDS="Design; data network; communication network; computer system",
ABSTRACT="In this paper, the design of a data network for computers and
terminals is outlined. Further details of parts of the system are given
in companion papers. The new design seems, on the evidence available, to
be economic and adeptable to future changes both in users requirements
and in the technologies of transmission, logic and storage.",
}

@ARTICLE{Buer6910:Optimale,
AUTHOR="R. Bäuerle and W. Wagner",
TITLE="Eine optimale lineare Lernregel zur empirischen Bestimmung eines
Erwartungswertes",
JOURNAL=aeu,
ADDRESS="Germany",
VOLUME=23,
NUMBER=10,
PAGES="502-506",
YEAR=1969,
KEYWORDS="Data traffic; computer network",
}

@TECHREPORT{Berg6909:Simulationsprogramm,
AUTHOR="K. Berger",
TITLE="Ein Simulationsprogramm für Vermittlungseinrichtungen mit
zeitgeteilter Steuerung",
INSTITUTION="Fernmeldetechnik der TU Dresden",
ADDRESS="Dresden, Germany",
VOLUME=9,
NUMBER=9,
YEAR=1969,
KEYWORDS="Simulation",
}

@ARTICLE{Bern6904:Simulation,
AUTHOR="R. Bernard and C. Grandjean",
TITLE="Simulation von Wartesystemen der Fernsprechtechnik - Anwendung
derProgrammiersprache {GPSS}",
JOURNAL="Elektrisches Nachrichtenwesen",
ADDRESS="Germany",
VOLUME=44,
NUMBER=4,
PAGES="362-373",
YEAR=1969,
LANGUAGE="German",
KEYWORDS="Simulation",
}

@ARTICLE{Bini6910:Umkehrgruppierung,
AUTHOR="N. Bininda and H. Hofstetter",
TITLE="Die Umkehrgruppierung, eine Gruppierung für moderne, elektronisch
gesteuerte Vermittlungssysteme",
JOURNAL=ntz,
ADDRESS="Germany",
VOLUME=22,
NUMBER=10,
YEAR=1969,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Krbe6901:Serien,
AUTHOR="U. Körber",
TITLE="Die Serien-Wegesuche im praktischen Einsatz bei
zentralgesteuertenVermittlungssystemen",
JOURNAL=ntz,
ADDRESS="Germany",
VOLUME=22,
NUMBER=1,
PAGES="36-40",
YEAR=1969,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Barn69:Negative,
AUTHOR="O. Barndorff-Niels and G. F. Yeo",
TITLE="Negative Binomial Processes",
JOURNAL=jap,
VOLUME=6,
PAGES="633-647",
YEAR=1969,
KEYWORDS="poisson process; binomial coefficient; process algebra;
binomial distribution",
ABSTRACT="This paper is concerned with negative binomial processes which
are essentially mixed Poisson processes whose intensity parameter is
given by the sum of squares of a finite number of independently and
identically distributed Gaussian Processes.  A study is made of the
distribution of the number of points of a k-dimensional negative
binomial process in a compact subset of R^k, and in particular in the
case where the underlying",
}

@ARTICLE{Bhat6906:Sixty,
AUTHOR="U. Narayan Bhat",
TITLE="Sixty Years of Queueing Theory",
JOURNAL=ms,
VOLUME=15,
NUMBER=6,
PAGES="280-294",
YEAR=1969,
KEYWORDS="Queueing theory; history",
ABSTRACT="Review paper",
}

@INPROCEEDINGS{Case69:Electronic,
AUTHOR="L. Casella and A. Perna and G. Valbonesi",
TITLE="Electronic Equipment for Telephone Traffic Analysis",
BOOKTITLE="ISS 2, Conference on Switching Techn. for Telecomm. Networks,
London. IEE Conf. Pub. 52",
ADDRESS="London, Great Britain",
PAGES="276-279",
YEAR=1969,
KEYWORDS="Telephony; Traffic Analysis; Measurement Tool",
}

@TECHREPORT{Doms69:Fernmeldenetz,
AUTHOR="M. Doms",
TITLE="Das Fernmeldenetz der Steinkohlen-Elektrizität
Aktiengesellschaft",
INSTITUTION="NTZ-Report",
PUBLISHER="VDE-Verlag",
ADDRESS="Berlin, Germany",
NUMBER=3,
PAGES=14,
YEAR=1969,
LANGUAGE="German",
KEYWORDS="Private Network; telephony; network characteristics",
}

@TECHREPORT{Elld69:Switch,
AUTHOR="A. Elldin",
TITLE="Switch Calculations. General Survey. Automatic Telephone
Exchanges Based on the Link Connection Principle",
INSTITUTION="L M Ericsson AB, Stockholm",
PAGES=47,
YEAR=1969,
KEYWORDS="link system",
}

@TECHREPORT{Eric69:Verksamhetsberättelse,
AUTHOR="L. M. Ericsson",
TITLE="Verksamhetsberättelse och Årsöversikt 1969",
INSTITUTION="Telefonaktiebolaget L M Ericsson",
ADDRESS="Stockholm, Sweden",
PAGES=44,
YEAR=1969,
LANGUAGE="Swedish",
}

@TECHREPORT{Erke69:Liikenneprosessin,
AUTHOR="T. Erke",
TITLE="Liikenneprosessin mittauslaite",
INSTITUTION="Research Institute of the Helsinki Telephone Company",
ADDRESS="Helsinki, Finland",
NUMBER=62,
PAGES=27,
YEAR=1969,
LANGUAGE="Finnish",
}

@ARTICLE{Gold69:Extension,
AUTHOR="D. Goldfarb",
TITLE="Extension of Davidon's Variable Metric method to Maximization
under Linear Inequality and Equality Constraints",
JOURNAL=siapp,
VOLUME=17,
NUMBER=4,
PAGES="739-764",
YEAR=1969,
KEYWORDS="Optimization; theory",
}

@TECHREPORT{Hert69:Topptrafikfaktorn,
AUTHOR="S. Hertzberg",
TITLE="Topptrafikfaktorn Dz",
INSTITUTION="Research Institute of the Helsinki Telephone Company",
ADDRESS="Helsinki, Finland",
NUMBER=58,
PAGES=24,
NOTE="Helsinki University of Technology, Telecommunication Laboratory
Report 12/79",
YEAR=1969,
LANGUAGE="Swedish",
}

@ARTICLE{Jung6908:Risk,
AUTHOR="J. Jung and O. Lundberg",
TITLE="Risk Processes Connected with the Compound Poisson Process",
JOURNAL="Skandinavisk Aktuarietidsskrift",
ADDRESS="Denmark",
VOLUME=52,
NUMBER=8,
PAGES="118-132",
YEAR=1969,
KEYWORDS="Poisson process",
}

@ARTICLE{King69:Markov,
AUTHOR="J. F. C. Kingman",
TITLE="Markov Population Processes",
JOURNAL=jap,
VOLUME=6,
PAGES="1-18",
YEAR=1969,
KEYWORDS="Markov process",
}

@ARTICLE{Kmme69:Aufbau,
AUTHOR="K. K mmerle",
TITLE="Aufbau und Wirkungsweise von Teilnehmer-Rechensystemen",
JOURNAL="ETZ-B",
ADDRESS="Germany",
VOLUME=21,
NUMBER=22,
PAGES="511-515",
YEAR=1969,
LANGUAGE="German",
KEYWORDS="time sharing",
}

@ARTICLE{Hunt69:Two,
AUTHOR="J. J. Hunter",
TITLE="Two Queues in Parallel",
JOURNAL=jrss,
ADDRESS="Great Britain",
VOLUME=31,
PAGES="432-445",
YEAR=1969,
KEYWORDS="Queueing system",
}

@INPROCEEDINGS{Loyn69:International,
AUTHOR="D. H. Loynes",
TITLE="International Telephone Switching: Accounting and Traffic
Analysis Equipment",
BOOKTITLE="ISS 2, Conference on Switching Techn. for Telecomm.
networks",
ADDRESS="London, Great Britain",
PAGES="272-275",
YEAR=1969,
KEYWORDS="Traffic measurement; charging",
}

@TECHREPORT{Rahk69:Olika,
AUTHOR="K. Rahko",
TITLE="Olika livslängdsfördelningar, deras användbarhet och relevans i
några exempelfall",
INSTITUTION="Helsingfors Teleförenings Forskningsanstalt",
ADDRESS="Helsingfors, Finland",
NUMBER=57,
PAGES=19,
YEAR=1969,
LANGUAGE="Finnish",
KEYWORDS="mean lifetime; distribution; Weibull distribution; life-time
distributions",
}

@TECHREPORT{Rahk69:Control,
AUTHOR="K. Rahko",
TITLE="A Control Method Based on Different Distribution Models of
Telephone Traffic",
INSTITUTION="Research Institute of the Helsinki Telephone Company",
ADDRESS="Helsinki, Finland",
NUMBER=54,
PAGES=20,
YEAR=1969,
KEYWORDS="Traffic source model",
}

@TECHREPORT{Rahk69:Traffic,
AUTHOR="K. Rahko",
TITLE="Traffic Measurements Made on Several Traffic Routes with Various
Measuring Devices",
INSTITUTION="Research Institute of the Helsinki Telephone Company",
ADDRESS="Helsinki, Finland",
NUMBER=56,
PAGES=56,
YEAR=1969,
KEYWORDS="Traffic measurement",
}

@TECHREPORT{Rahk69:Telephone,
AUTHOR="K. Rahko",
TITLE="Telephone Call Charging",
INSTITUTION="Research Institute of the Helsinki Telephone Company",
ADDRESS="Helsinki, Finland",
NUMBER=59,
PAGES=56,
YEAR=1969,
KEYWORDS="Charging",
}

@TECHREPORT{Rahk69:Professor,
AUTHOR="K. Rahko and S. Hertzberg",
TITLE="Professor {S.A.} Karlssons Publikationer",
TYPE="Indholdsfortegnelse fra Rapport No. 60",
INSTITUTION="Helsingfors Telefonforenings Forskningsanstalt",
ADDRESS="Finland",
PAGES=27,
YEAR=1969,
LANGUAGE="Finnish",
KEYWORDS="Bibliography",
}

@ARTICLE{Rapp69:Användning,
AUTHOR="Y. Rapp",
TITLE="Användning av Dynamisk Programmering för Planering av Utbyggnader
för Kanalisation och Primärnät i ett Lokalt Stationsområde",
JOURNAL=ericssonr,
ADDRESS="Stockholm, Sweden",
PAGES="102-112",
YEAR=1969,
LANGUAGE="Swedish",
KEYWORDS="Network planning",
}

@ARTICLE{Takc69:Erlang,
AUTHOR="Lajos Takács",
TITLE="On Erlang's Formula",
JOURNAL=ams,
VOLUME=40,
PAGES="71-78",
YEAR=1969,
KEYWORDS="Erlang B formula",
}

@ARTICLE{Sand69:Datenverkehr,
AUTHOR="D. von Sanden",
TITLE="Datenverkehr über Fernsprech-Nebenstellenanlagen",
JOURNAL=ingdbp,
ADDRESS="Germany",
VOLUME=3,
PAGES="114-119",
YEAR=1969,
LANGUAGE="German",
KEYWORDS="PABX; data traffic",
}

@ARTICLE{Adir6902:Time,
AUTHOR="I. Adiri and B. Avi-Itzhak",
TITLE="A Time-Sharing Queue with a Finite Number of Customers",
JOURNAL=jacm,
VOLUME=16,
NUMBER=2,
PAGES="315-323",
MONTH=feb,
YEAR=1969,
REFERENCES=8,
KEYWORDS="Analysis; time sharing; queueing system; Markov process",
ABSTRACT="A time-sharing queue serving a finite number of customers is
described. It is assumed that the service time and the time elapsing
between termination of service and the next arrival of the same customer
at the queue (service station) are exponential. Some results are
presented in terms of steady-state expectations",
}

@INCOLLECTION{Sche69:Kontrolle,
AUTHOR="Hans Schechinger",
TITLE="Kontrolle mit Hilfe von Prüfziffern",
BOOKTITLE="BTS Systematisch",
PUBLISHER="Verlag Joachim Schilling",
MONTH=mar,
YEAR=1969,
LANGUAGE="German",
KEYWORDS="parity; redundancy; checksum",
ANNOTE="Loose-leaf collection",
}

@INPROCEEDINGS{Rahk6903:Disturbance,
AUTHOR="K. Rahko",
TITLE="Disturbance Measurements on Different Kinds of Telephone Lines
and Treatment of Results by Means of the Weibull Distribution",
BOOKTITLE="International Conference on Remote Data Processing",
ADDRESS="Paris, France",
PAGES=12,
NOTE="Research Institute of the Helsinki Telephone Company, Report No.
55",
DAYS=24,
MONTH=mar,
YEAR=1969,
KEYWORDS="Traffic measurement",
}

@TECHREPORT{Elld6904:Några,
AUTHOR="A. Elldin",
TITLE="Några Synspunkter på Trafikmätning",
TYPE="Internal Report",
INSTITUTION="L M Erisccson AB",
ADDRESS="Stockholm, Sweden",
NUMBER="DtG 54051-1",
PAGES=13,
MONTH=apr,
YEAR=1969,
LANGUAGE="Swedish",
KEYWORDS="traffic measurement",
}

@MISC{Herz6904:Problems,
AUTHOR="U. Herzog",
TITLE="Problems of Teletraffic Theory",
INSTITUTION="Iranian-German Scientific Seminar, NVDV, Universität
Stuttgart",
ADDRESS="Stuttgart, Germany",
PAGES=22,
NOTE="slides",
MONTH=apr,
YEAR=1969,
KEYWORDS="Survey; overview; communication network",
}

@ARTICLE{Bart6905:Note,
AUTHOR="K. A. Bartlett and R. A. Scantlebury",
TITLE="A note on reliable full-duplex transmission over half-duplex
links",
JOURNAL=cacm,
VOLUME=12,
NUMBER=5,
PAGES="260-265",
MONTH=may,
YEAR=1969,
KEYWORDS="data transmission; error correction; full-duplex; half-duplex;
transmission control; communications; ARQ; stop-and-wait;
alternating-bit protocol; transport protocols",
ABSTRACT="A simple procedure for achieving reliable full-duplex
transmission over half-duplex links is proposed. The scheme is compared
with another of the same type, which has recently been described in the
literature. Finally, some comments are made on another group of related
transmission procedures which have been shown to be unreliable under
some circumstances.",
}

@ARTICLE{Knop6905:Remark,
AUTHOR="R. Knop",
TITLE="Remark on algorithm 334 {[G5]:} Normal random deviates",
JOURNAL=cacm,
VOLUME=12,
NUMBER=5,
PAGES=281,
MONTH=may,
YEAR=1969,
KEYWORDS="random number generation",
}

@ARTICLE{Boeh6906:Adaptive,
AUTHOR="B. W. Boehm and R. L. Mobley",
TITLE="Adaptive Routing Techniques for Distributed Communications
Systems",
JOURNAL=ieeecom,
VOLUME="COM-17",
PAGES="340-349",
MONTH=jun,
YEAR=1969,
}

@ARTICLE{Brad6909:Model,
AUTHOR="Paul T. Brady",
TITLE="A Model for Generating On-Off Speech Patterns in Two-Way
Conversation",
JOURNAL=bstj,
VOLUME=48,
NUMBER=9,
PAGES="2445-2472",
MONTH=sep,
YEAR=1969,
KEYWORDS="packet voice; talkspurt",
ABSTRACT="compares talker model to actual conversations, measuring
statistics of mutual silence, either partner talking and double talk; p.
2467f. finds that while talkspurts can be modeled well by an exponential
distribution, silences do not follow a constant-plus-exponential
distribution.",
}

@ARTICLE{Roth6909:IEEE,
AUTHOR="E. H. Rothauser and W. D. Chapman and N. Guttman and H. R.
Silbiger and H. H. L. Hecker and G. E. Urbanek and K. S. Nordby and M.
Weinstock",
TITLE="{IEEE} Recommended Practice for Speech Quality Measurements",
JOURNAL="IEEE Transactions on Audio and Electroacoustics",
VOLUME="AU-17",
NUMBER=3,
PAGES="225-238",
MONTH=sep,
YEAR=1969,
KEYWORDS="speech quality; mean opinion score; Harvard sentences; speech
coding",
ABSTRACT="Speech quality is based on the subjective appraisal of speech.
Speech may be appraised on the basis of preference, loudness,
intelligibility, and recognizability of properties of the original
speaker's voice, of the transmission channel, and/or in the case of
artificial speech, of the speech synthesizer. The IEEE Subcommittee on
Subjective Measurements, charged with writing an engineering practice
for the measurement of speech quality, has concluded that a single
method should not now be recommended. The present Recommended Practice
is concerned only with preference measurements for which three methods
will be tentatively outlined. These are the Isopreference Method, the
Relative Preference Method, and the Category-Judgment Method.",
}

@ARTICLE{Cohe6910:Single,
AUTHOR="J. W. Cohen",
TITLE="Single Server Queues with Restricted Accessibility",
JOURNAL=jem,
VOLUME=3,
NUMBER=4,
PAGES="265-284",
MONTH=oct,
YEAR=1969,
KEYWORDS="queueing theory",
}

@INPROCEEDINGS{Chu6911:Study,
AUTHOR="Wesley W. Chu",
TITLE="A study of asynchronous time division multiplexing for
time-sharing computer systems",
BOOKTITLE="AFIPS Conference Fall Joint Computer Conference",
ORGANIZATION="afips",
PUBLISHER="AFIPS Press, Montvale, New Jersey",
ADDRESS="Las Vegas, Nevada",
PAGES="669-678",
MONTH=nov,
YEAR=1969,
KEYWORDS="multiplexer",
ABSTRACT="see also \cite{Chu70:Buffer}; multiple servers with limited
waiting room; first part analyzes batch arrivals with
Poisson-distributed batch size ($D^{[M]}/D/c/K$), second part treats
discrete-time system with geometrically distributed burst length
arrivals, where number of bursts per service interval is Poisson
distributed ($M^{[Geo]}/D/c/K$)",
}