@BOOK{Fell71:Probability,
AUTHOR="W. Feller",
TITLE="An Introduction to Probability Theory and its Applications,
Volume 1",
EDITION="second",
PUBLISHER="John Wiley and Sons",
ADDRESS="New York, New York",
VOLUME=2,
YEAR=1971,
KEYWORDS="probability theory",
}

@BOOK{Gned71:Bedienungstheorie,
AUTHOR="B. W. Gnedenko and I. N. Kowalenko",
TITLE="Einführung in die Bedienungstheorie",
PUBLISHER="R. Oldenbourg Verlag",
ADDRESS="München",
YEAR=1971,
KEYWORDS="queueing theory",
}

@ARTICLE{Heyd7103:Growth,
AUTHOR="C. C. Heyde",
TITLE="On the Growth of the Maximum Queue Length in a Stable Queue",
JOURNAL=or,
VOLUME=19,
NUMBER=2,
PAGES="447-452",
MONTH="March-April",
YEAR=1971,
KEYWORDS="queueing theory",
ABSTRACT="Even for a stable one-server queue with relative traffic
intensity less than unity, the maximum queue length observed will tend
to infinity in probability as the length of time for which the system
has been observed becomes large. It is important to have information on
the behavior of the maximum queue length to enable estimation of the
congestion likely to be encountered in a system operating over a long
period. The present paper studies the stable $GI/M/1$ system, and,
interpreting the results obtained rather loosely, one can say that the
maximum queue length attained by the time the $n$th customer has arrived
($n$ large) can be expected to be of the order $\log n$.",
}

@TECHREPORT{Dafe71:Single,
AUTHOR="Stella C. Dafermos and M. F. Neuts",
TITLE="A Single Server Queue in Discrete Time",
INSTITUTION="Centre d'etudes de Recherche Operationelle - Cahiers",
VOLUME=13,
PAGES="23-40",
YEAR=1971,
KEYWORDS="discrete time queue",
ANNOTE="Transient and stationary behavior of system with batch-Poisson
arrivals and general service time.",
}

@ARTICLE{Sahi7103:Stochastic,
AUTHOR="Izzet Sahin and U. Narayan Bhat",
TITLE="A Stochastic System with Scheduled Secondary Inputs",
JOURNAL=or,
VOLUME=19,
NUMBER=2,
PAGES="436-446",
MONTH="March-April",
YEAR=1971,
KEYWORDS="queueing theory",
ABSTRACT="Stochastic systems with multiple inputs are common in
practice. This paper investigates such a system with random and
scheduled inputs, and determines the equilibrium behavior of the basic
process (a waiting time process if the system is a queue, or a storage
process if it is a storage system) by reducing the problem to the
solution of an integral equation, which is solved by the method of
factorization.",
ANNOTE="superposition of virtual work arrival processes, one random, one
scheduled (deterministic); infinite queue.",
}

@ARTICLE{Ston71:Parallel,
AUTHOR="H. S. Stone",
TITLE="Parallel Processing with the Perfect Shuffle",
JOURNAL=ieeetc,
VOLUME="C-20",
NUMBER=2,
PAGES="153-161",
YEAR=1971,
REFERENCES=8,
KEYWORDS="Interconnection Network",
}

@ARTICLE{Toot71:Runs,
AUTHOR="J. P. R. Tootill and W. D. Robinson and A. G. Adams",
TITLE="The runs up-and-down performance of Tausworthe pseudo-random
number generators",
JOURNAL=jacm,
VOLUME=18,
PAGES="381-399",
YEAR=1971,
REFERENCES=10,
KEYWORDS="Tausworthe generator; shift register sequences; random number
generation; test",
ANNOTE="Any tausworthe generator based upon a primitive trinomial over
$gf(2)$, $x**p+x**q+1$, can be represented as a simple linear recurrence
in $gf(2**p)$. For a generator producing a sequence of p-bit
pseudorandom numbers, $(p,2**p-1)=1$, which is guaranteed by
Tausworthe's theory to be 1-distributed, the recurrence may reveal
combinatorial relationships implying a poor runs up-and-down
performance. This occurs when $q$ is small, too near $p/2$, or nearly
equal",
}

@ARTICLE{Tuck71:24th,
AUTHOR="B. Tuckerman",
TITLE="The 24th Mersenne prime",
JOURNAL="Proceedings National Academy of Sciences",
PAGES=2319,
YEAR=1971,
KEYWORDS="mathematics; prime number; Mersenne prime",
}

@ARTICLE{Walk71:Teilnehmerrechnersysteme,
AUTHOR="B. Walke and H. J. Küspert",
TITLE="Teilnehmerrechnersysteme: Mittlere Verweilzeiten bei optimaler
Rechenzeitzuteilung",
JOURNAL=er,
VOLUME=13,
NUMBER=5,
PAGES="193-199",
YEAR=1971,
LANGUAGE="German",
REFERENCES=9,
KEYWORDS="model; time sharing; service time; time in system",
ANNOTE="A model of a multi-access time sharing system with an infinite
large main memory is presented, for which the optimal policy to minimize
mean response time is known. The service time distribution function of
jobs of customers is approximated by a piecewise exponential
distribution function. Sensibility of mean response time is computed,
when there are deviations from the optimal policy in number and size of
time-slices",
}

@ARTICLE{Wend71:Zur,
AUTHOR="S. W. Wendt",
TITLE="Zur Systematik von Mikroprogrammwerksstrukturen",
JOURNAL=er,
VOLUME=13,
PAGES="22-26",
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Microprogramming",
}

@ARTICLE{Yage71:Minimum,
AUTHOR="B. Yaged",
TITLE="Minimum Cost Routing for Static Network Models",
JOURNAL=networks,
VOLUME=1,
PAGES="139-172",
YEAR=1971,
REFERENCES=17,
KEYWORDS="Routing algorithm; static routing",
ANNOTE="This paper develops techniques which can be applied to long
range planning studies for the domestic long haul communications
network. The problem studied is how to select a path through the network
for each point-to-point demand for communications channels, so that the
total network cost is minimized. The problem is to minimize total
network cost, subject to multicommodity flow requirements and concave
link cost functions. Finding an exact",
}

@ARTICLE{Avi71:Heavy,
AUTHOR="B. Avi-Itzhak",
TITLE="Heavy Traffic Characteristics of a Circular Data Network",
JOURNAL=bstj,
VOLUME=50,
NUMBER=8,
PAGES="2521-2549",
YEAR=1971,
REFERENCES=6,
KEYWORDS="Analysis; data network; mathematical model; traffic flow",
ANNOTE="Traffic behaviour in the Pierce loop for data transmission is
studied under assumptions of heavy loading. A deterministic mathematical
model for describing traffic flows is developed andanalyzed. The paper
includes two numerical examples.",
}

@ARTICLE{Bard71:Criteria,
AUTHOR="Y. Bard",
TITLE="Performance criteria and measurement for a time-sharing system",
JOURNAL=ibmsj,
VOLUME=3,
PAGES="193-216",
YEAR=1971,
KEYWORDS="Performance measurement; time sharing",
ANNOTE="The performance of a complex time-sharing system was monitored
under actual operating conditions during a period in which chan-ges in
system configuration (both hardware and software) took place. Various
techniques for assessing the impact of those changes on performance are
discussed.",
}

@INPROCEEDINGS{Bask71:Dependence,
AUTHOR="F. Baskett",
TITLE="The dependence of computer system queues upon processing time
distribution and central processor scheduling",
BOOKTITLE="3rd Symposium on Operating System Principles",
ADDRESS="Stanford, California",
PAGES="109-113",
YEAR=1971,
REFERENCES=13,
KEYWORDS="Processor sharing; central server; FIFO; dependency",
ANNOTE="The dependency of the stationary distribution of the number of
jobs being served by a processor-sharing central server from
thedisributions of service and interarrival times is investigated for
finite and unfinite source models. The processor-sharing is compared
with FIFO as queueing disipline. Experiments with data collected from
actual computer systems indicate that these results extend to more
general models and have practical applications",
}

@ARTICLE{Bazl71:Call,
AUTHOR="D. Bazlen",
TITLE="Call Congestion in Link Systems with Internal and External
Traffic",
JOURNAL=aeu,
VOLUME=25,
NUMBER="9/10",
PAGES="479-483",
YEAR=1971,
REFERENCES=8,
KEYWORDS="Approximation; calculation; congestion; link system",
ANNOTE="For the approximate calculation of the call congestion of
multi-stage link system with both-way traffic a method is presented for
Pure Chance Traffic of type 1.",
}

@ARTICLE{Cour71:Single,
AUTHOR="P.-J. Courtois and J. Georges",
TITLE="On a single-server finite queueing model with state-dependent
arrival and service processes",
JOURNAL=or,
ADDRESS="Brussels, Belgium",
VOLUME=19,
NUMBER=1,
PAGES="424-435",
YEAR=1971,
REFERENCES=10,
KEYWORDS="M/G/1; single server; queueing system; model; imbedded",
ANNOTE="This paper generalizes the M/G/1 queueing process by
consideringboth the arrival and the service rates as being essentially
arbitrary functions of the current number of customers in the system.
Taking the imbedded Markov chain approach, the paper proposes a method
for calculating the limiting probability distribution of the congestion
and the expected value of the time needed to com-plete a service. An
expression for the distribution is given.",
}

@ARTICLE{Ferd71:Machine,
AUTHOR="A. E. Ferdinand",
TITLE="An analysis of the machine interference model",
JOURNAL=ibmsj,
VOLUME=2,
PAGES="129-142",
YEAR=1971,
REFERENCES=5,
KEYWORDS="Machine-Repair-Man model; M/M/1/N; approximation",
ANNOTE="Discussed in this paper are asymptotic properties of the
classical machine interference model, the simplest of queueing models.
In system analysis, the judicious use of such asymptotic proper-ties can
result in significant savings in time and effort. Included in the paper
is the solution of the generalized machineinterference model.
Handschriftlicher Kommentar: Wichtige Approximation für M/M/1/N.",
}

@ARTICLE{Gato71:Determination,
AUTHOR="E. Gatos and F. Kaiser",
TITLE="Determination of the Powers of Any Given Matrix and Application
on Discrete Markov Processes",
JOURNAL=aeu,
VOLUME=25,
NUMBER="9/10",
PAGES="431-435",
YEAR=1971,
REFERENCES=9,
KEYWORDS="Analysis; Markov process; discrete time process; Markov",
ANNOTE="The powers of a quadratic matrix are given as explicit
functionsof the exponent $s$ ($s\_k$ with $k$ number of rows). The
discovered formula is applied on discontinuous Markov processes with
discontinuous time. In this scope some theoretical applications,
especially a limit approach for discontinuous homogeneous processes with
continuous time are given.",
}

@ARTICLE{Grah71:Addressing,
AUTHOR="R. L. Graham and H. O. Pollak",
TITLE="On the Addressing Problem for Loop Switching",
JOURNAL=bstj,
VOLUME=50,
NUMBER=8,
PAGES="2495-2519",
YEAR=1971,
REFERENCES=2,
KEYWORDS="loop system; switching system; method; scheme",
ANNOTE="This paper proposes an addressing scheme for local loops in a
loop switching system.",
}

@ARTICLE{Haye71:Traffic,
AUTHOR="J. F. Hayes and D. N. Sherman",
TITLE="Traffic Analysis of a Ring Switched Data Transmission System",
JOURNAL=bstj,
VOLUME=50,
NUMBER=9,
PAGES="2947-2978",
NOTE="also in \cite[p. 118-149]{Chu79:Advances}",
YEAR=1971,
REFERENCES=14,
KEYWORDS="Ring network; data transmission; delay analysis",
ABSTRACT="This paper is concerned with a study of traffic and message
de- lay in a ring switched data transmission system. The system, by
asynchronous multiplexing and data storage, shares transmission
facilities among many users. It is the random component of message delay
due to buffering that is the focal point of the study. A mathematical
model for the ring is developed and formulas for the average message
delay are derived.",
}

@BOOK{Kost71:Stochastic,
AUTHOR="L. Kosten",
TITLE="Stochastic theory of service systems",
PUBLISHER="Pergamon Press",
PAGES="127-147",
YEAR=1971,
KEYWORDS="Simulation; stochastic theory; queueing system",
}

@ARTICLE{Vick71:Responsive,
AUTHOR="William Vickrey",
TITLE="Responsive Pricing of Public Utility Services",
JOURNAL="Bell Journal of Economics",
VOLUME=2,
PAGES="337-346",
YEAR=1971,
}

@ARTICLE{Adir71:Dynamic,
AUTHOR="I. Adiri",
TITLE="A dynamic time-sharing priority-queue",
JOURNAL=jacm,
VOLUME=18,
NUMBER=4,
PAGES="603-610",
YEAR=1971,
REFERENCES=10,
KEYWORDS="M/M/1; time sharing; priority; feedback; analytical model;
dynamic priority; single server; queueing system",
ANNOTE="In such a priority regime, long and unknown in advance service
requirements in all priority classes are dynamically penalized by
degrading their priority degree. This paper derives mathematical
expressions for calculating the expected total flow time of j-th
customer whose service requirement is known.",
}

@ARTICLE{Adir71:Note,
AUTHOR="I. Adiri",
TITLE="A note on some mathematical models of time-sharing systems",
JOURNAL=jacm,
VOLUME=18,
NUMBER=4,
PAGES="611-615",
YEAR=1971,
REFERENCES=7,
KEYWORDS="Analytical model; feedback; time sharing; M/M/1; round robin;
queueing approximation",
ANNOTE="This note deals with time-sharing disciplines where the arrival
process is homogeneous poisson and service requirements are
exponentially distributed. The investigated regimes are: (A) ordinary
round-robin, (B) round robin with the quantum allocated to a customer is
a function of the number of quanta he has already received.",
}

@ARTICLE{Bhat71:Busy,
AUTHOR="U. Narayan Bhat and R. E. Nance",
TITLE="Busy period analysis of a time-sharing system modeled as a
semi-Markov process",
JOURNAL=jacm,
VOLUME=18,
NUMBER=2,
PAGES="221-238",
YEAR=1971,
REFERENCES=13,
KEYWORDS="Busy period; feedback; time sharing; semi Markov process;
utilization; analytical model",
ANNOTE="working from the model of task completions as a semi-Markov
process, the busy period distribution of the central processor is
derived in terms of its Laplace-Stieltjes transforms. Limiting behavior
of the process describing the number of tasks in queue is developed for
arbitrary time points as well as task completion epochs. While the
latter has been given in earlier papers, the former represents a new
result.",
}

@BOOK{Buze71:Queueing,
AUTHOR="J. P. Buzen",
TITLE="Queueing network models for multiprogramming",
PUBLISHER="Garland Publishing",
ADDRESS="New York",
PAGES=258,
YEAR=1971,
KEYWORDS="Queueing network; multiprogramming; application; numerical
method; memory management; normalization constant",
ANNOTE="Central server queueing networks have achieved widespread
acceptance as models for evaluating computer system performance. This
work presents one of the earliest and most influential treatments of
such models, including their conceptual foundations, mathematical
properties, numerical evaluation and practical application. Basic
terminology is introduced, solutions are derived, and analyses are
presented for representative problems in",
}

@PHDTHESIS{Cole71:Computer,
AUTHOR="G. D. Cole",
TITLE="Computer network measurements: techniques and experiments",
SCHOOL="University of California",
ADDRESS="Los Angeles, California",
PAGES="1-350",
YEAR=1971,
REFERENCES=89,
KEYWORDS="Data network; message switching; packet switching; model;
measurement; ARPAnet; network design; service time dependent; priority;
data gathering; data reduction",
ANNOTE="The ARPA (Advanced Research Projects Agency) computer network
involves the interconnection of about twenty (as of 1971) different
research computers across the country by means of a store-and-forward
message switching network. The primary concern of this dissertation has
been with the development of a measurement capability and the
utilization of this capability to create (and iteratively improve)
analytic models of the network behavior as well",
}

@ARTICLE{Cumi71:Monitoring,
AUTHOR="C. B. Cuming",
TITLE="Monitoring the operation of system software",
JOURNAL=spe,
VOLUME=1,
NUMBER=4,
PAGES="383-389",
YEAR=1971,
KEYWORDS="Performance evaluation; software; compiler; operating system;
software monitor",
ANNOTE="To provide a picture of the operation of system software on the
University of Nottingham KDF9, a log of library, composer and compiler
usage has been created dynamically during normal use of the machine.
Analysis of the results points to one or two unexpected conclusions.",
}

@ARTICLE{Diet71:Exact,
AUTHOR="U. Dieter and J. Ahrens",
TITLE="An exact determination of serial correlations of pseudo-random
numbers",
JOURNAL="Numerical Mathematics",
VOLUME=17,
PAGES="101-",
YEAR=1971,
KEYWORDS="random number generation; correlation",
}

@ARTICLE{Dona71:Probability,
AUTHOR="D. P. Gaver and Pierre Lewis",
TITLE="Probability models for buffer storage allocation problems",
JOURNAL=jacm,
VOLUME=18,
PAGES="186-198",
YEAR=1971,
KEYWORDS="computer system; buffer; blocking; memory",
ANNOTE="This paper considers some of the issues that arise when messages
or jobs inbound to a computer facility are buffered prior to being
processed. Models are developed that describe (a) the results of
blocking a single memory unit for the use of diverse messages, (b) the
occupancy behavior of a buffer that is tied to a single message, and (c)
the occupancy of a buffer dynamically shared among many independent
sources.",
}

@ARTICLE{Eise71:Two,
AUTHOR="M. Eisenberg",
TITLE="Two queues with changeover times",
JOURNAL=bstj,
PAGES="386-401",
YEAR=1971,
REFERENCES=14,
KEYWORDS="Queueing system; polling; changeover time; M/G/1; waiting
time",
ANNOTE="A single server attends to two seperate queues. Each queue has
poisson arrivals and a general service time distribution. A changeover
time, with a general distribution, is required whenever the server
crosses from one queue to the other. This paper investigates two queue
disciplines: alternating priority and strict priority. In each case, it
obtains the Laplace-Stieltjes transforms of the waiting-time
distributions for a stationary process",
}

@ARTICLE{Eise71:Queues,
AUTHOR="M. Eisenberg",
TITLE="Queues with periodic service and changeover time",
JOURNAL=bstj,
PAGES="440-451",
YEAR=1971,
REFERENCES=16,
KEYWORDS="Queueing system; polling; changeover time",
}

@ARTICLE{Fish71:Estimating,
AUTHOR="G. S. Fishman",
TITLE="Estimating sample size in computing simulation experiments",
JOURNAL=ms,
VOLUME=18,
YEAR=1971,
KEYWORDS="Simulation; time series analysis; simulation model; confidence
interval; sample size; Chebyshev's inequality",
ANNOTE="A method is described for estimating and collecting the sample
size needed to estimate the mean of a process (with a specified level of
statistical precision) in a simulation experiment. Steps are also
discussed for incorporating the determination and collection of the
sample size into a computer library routine that can be called by the
ongoing simulation program.",
}

@ARTICLE{Fran71:Routing,
AUTHOR="H. Frank and Wu Chou",
TITLE="Routing in Computer Networks",
JOURNAL=networks,
VOLUME=1,
PAGES="99-112",
YEAR=1971,
REFERENCES=5,
KEYWORDS="Routing algorithm; computer network",
ANNOTE="The problem of routing flow in a network of computers is
extremely complex. This is especially formidable when routing is to be
incorporated in iterative analysis and design. Among the properties of
desirable flow patterns is low average delay from message inception to
arrival. In this paper, we discuss procedures for minimizing average
delay subject to a set of flow constraints. Heuristic routing procedures
are presented and compared to optim",
}

@INPROCEEDINGS{Fult71:Adaptive,
AUTHOR="G. L. Fultz and L. Kleinrock",
TITLE="Adaptive Routing Techniques for Store-And-Forward
Computer-Communication Networks",
BOOKTITLE=icc,
ADDRESS="Montreal",
VOLUME="N1",
PAGES="39-1-39-8",
YEAR=1971,
REFERENCES=17,
KEYWORDS="Routing algorithm; packet switching; adaptive routing",
ANNOTE="A study is made of routing techniques applicable to
store-and-forward computer networks (e.g., the ARPA Network) in order to
show their importance in relation to the theoretical design of these
networks and to the performance of existing networks. The major attempt
has been to classify routing techniques and to specify their parameters
as well as a means for evaluating their performance. Using average
message delay as a measure of network perfo",
}

@ARTICLE{Gave71:Remote,
AUTHOR="D. P. Gaver",
TITLE="Analysis of remote terminal backlogs under heavy demand
conditions",
JOURNAL=jacm,
VOLUME=18,
NUMBER=3,
PAGES="405-415",
YEAR=1971,
REFERENCES=6,
KEYWORDS="Data network; network delay; diffusion approximation; time in
system; carried traffic; performance evaluation; model; normal
distribution; heavy load",
ANNOTE="Models are developed to describe delays and backlogs at remote
terminals polled in turn by a single computer. The effects modeled
include transmission delays caused by line noise, and the number and
types of terminals (passive input, and active or two-way response). Use
is made of the diffusion appoximation to state variables, the latter
being especially relevant when the system is heavily loaded. A limited
amount of mathematical and stimul",
}

@ARTICLE{Hori71:Schnelle,
AUTHOR="H. C. Höring",
TITLE="Die schnelle Fourier-Transformation",
JOURNAL="Frequenz",
VOLUME=25,
PAGES="267-",
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Mathematics; FFT; fast Fourier transform",
}

@ARTICLE{Jung71:Calculation,
AUTHOR="M. M. Jung",
TITLE="Calculation of the blocking proba. at small {PABXs} having full
available connecting circuits and exchange line relay sets",
JOURNAL=ptr,
VOLUME=29,
NUMBER=3,
PAGES="103-113",
YEAR=1971,
REFERENCES=1,
KEYWORDS="Queueing system; blocking",
}

@BOOK{Kamp71:SIMSCRIPT,
AUTHOR="G. Kampe",
TITLE="{SIMSCRIPT}",
PUBLISHER="Vieweg-Verlag",
ADDRESS="Braunschweig",
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Simulation",
}

@ARTICLE{Knob71:Verluste,
AUTHOR="G. Knoblich",
TITLE="Verluste in einer Nebenstellenanlage bei ungleicher Belastung",
JOURNAL=ntz,
VOLUME=24,
PAGES="440-443",
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Loss system; PABX",
}

@ARTICLE{Kumm71:Point,
AUTHOR="K. Kümmerle",
TITLE="Point to point loss in link systems",
JOURNAL=ieeecom,
VOLUME="COM-19",
PAGES="261-267",
YEAR=1971,
KEYWORDS="Switching system; switching network; link system",
}

@ARTICLE{Lewi71:Cyclic,
AUTHOR="Pierre Lewis and G. S. Shedler",
TITLE="A cyclic-queue model of system overhead in multiprogrammed
computer systems",
JOURNAL=jacm,
VOLUME=18,
PAGES="199-220",
YEAR=1971,
REFERENCES=13,
KEYWORDS="Memory management; multiprogramming; overhead time;
utilization; numerical method; heuristics; loop queue; channel
utilization",
ANNOTE="A probabilistic model is presented of a multiprogrammed computer
system operating under demand paging. The model contains an explicit
representation of system overhead, the cpu requirements and paging
characteristics of the program load being described statistically.
Expressions for steady-state cpu problem program time, cpu overhead
time, and channel utilization are obtained. Some numerical results are
which quantify the gains in cpu utiliza",
}

@ARTICLE{Luca71:Monitoring,
AUTHOR="H. C. Lucas",
TITLE="Performance evaluation and monitoring",
JOURNAL=acmcs,
VOLUME=3,
NUMBER=3,
PAGES="79-91",
YEAR=1971,
REFERENCES=59,
KEYWORDS="Performance evaluation; simulation; monitoring; performance
projection; computer selection; benchmark; test tool",
ANNOTE="Three major purposes for evaluating the hardware and software
performance of computer systems - selection evaluation, performance
projection, and performance monitoring - are described. Eight techniques
that have been used or suggested for evaluating performance are
discussed.",
}

@ARTICLE{Nanc71:Time,
AUTHOR="R. E. Nance",
TITLE="On the time flow mechanisms for discrete system simulation",
JOURNAL=ms,
VOLUME=18,
PAGES="59-73",
YEAR=1971,
REFERENCES=15,
KEYWORDS="method; discrete event simulation; time flow mechanism",
ABSTRACT="Three algorithms for time flow in the patrolling model are
offered. Theoretical development is provided for the two more
sophisticated algorithms, the variable increment (VIA) and the minimum
increment comparison (MICA). Comparison of execution times for the three
algorithms shows the constant increment (CI) to be generally more
efficient. The concept of a continuum of algorithms for representing the
passage of time is advanced. Fixed time met",
}

@ARTICLE{Neme71:User,
AUTHOR="A. G. Nemeth and P. D. Rovner",
TITLE="User program measurement in a time-shared environment",
JOURNAL=cacm,
VOLUME=14,
PAGES="661-666",
YEAR=1971,
REFERENCES=11,
KEYWORDS="Performance evaluation; software monitor; time sharing;
operating system; multiprogramming; measurement; technology; virtual
computer; performance improvement",
ANNOTE="A general discussion of the measurement of software systems is
followed by a description of a hardware and software scheme for
measuring user programs in a time-shared environment.",
}

@ARTICLE{Puen71:Demand,
AUTHOR="J. G. Puente and A. M. Werth",
TITLE="Demand-assigned service for the {INTELSAT} global network",
JOURNAL=ieeespec,
VOLUME=8,
PAGES="59-69",
YEAR=1971,
REFERENCES=15,
KEYWORDS="Satellite radio; access protocol; multiple access; demand
assignment",
ANNOTE="This article traces the development of the multi-access
techniques employed with Intelsat from the two access methods associated
with Early Bird to the demand-assignment technique planned for INTELSAT
IV. This latter method, SPADE, is to be the first operational
demand-assignment multiple-access system and is scheduled for use in
1971. Details of SPADE system and its use for other applications are
reviewed.",
}

@BOOK{Rohl71:SIMULA,
AUTHOR="H. Rohlfing",
TITLE="{SIMULA}",
PUBLISHER="BI Hochschultaschenbuch",
VOLUME=747,
PAGES=241,
YEAR=1971,
LANGUAGE="German",
REFERENCES=6,
KEYWORDS="Simulation; SIMULA",
}

@ARTICLE{Saka71:Queue,
AUTHOR="M. Sakata and S. Noguchi and J. Oizumi",
TITLE="An analysis of the {M/G/1} queue under round-robin scheduling",
JOURNAL=or,
VOLUME=19,
PAGES="370-385",
YEAR=1971,
REFERENCES=9,
KEYWORDS="M/G/1; feedback; processor sharing; time sharing; overhead
time",
ANNOTE="This paper analyzes the M/G/1 queue under the well known
round-robin (RR) discipline. Three models are considered: the
constant-quantum rr model, the processor-shared (or zero-quantum RR)
model, and the variable-quantum RR model.",
}

@INPROCEEDINGS{Samm71:Problems,
AUTHOR="J. E. Sammet",
TITLE="Problems in, and a pragmatic approach to, programming language
measurement",
BOOKTITLE=fjcc,
PAGES="243-251",
YEAR=1971,
REFERENCES=3,
KEYWORDS="Performance evaluation; programming language; comparison;
reliability; measurement",
ANNOTE="Nothing has been done about measurement of languages. This is
not an empty issue, because there are a number of relevant and
significant questions pertaining to programming languages for which we
would like to have (quantitative) answers. Probably the most important
practical question is ``for a given application or set of applications,
which language is best?''",
}

@MANUAL{Anon71:Queueing,
AUTHOR="Anonymous",
TITLE="Analysis of Some Queueing Models in Real-Time Systems",
PUBLISHER="IBM",
ADDRESS="New York",
PAGES="1-75",
YEAR=1971,
REFERENCES=13,
KEYWORDS="Queueing system; computer system; real time; single server;
multiserver",
ANNOTE="This manual presents basic theory which describes relationships
among the principal elements in a queueing situation.  Several queueing
models are discussed, and the theory is applied to 32 short examples of
problems encountered in real-time systems; numerical solutions are given
for these problems.  The manual concerns single-server and multi-server
queues, machine interference, networks of queues, and combinations of
random variables encountered in queueing analysis.",
}

@TECHREPORT{Ever71:Verhalten1,
AUTHOR="R. Evers",
TITLE="Das Verhalten der Teilnehmer einer Nebenstellenanlage. Teil 1:
Die Häufigkeit von Wiederholungen nach erfolglosen Anrufversuchen",
INSTITUTION="Heinrich-Hertz-Institut für Schwingungsforschung",
ADDRESS="Berlin",
VOLUME=143,
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Measurement",
}

@TECHREPORT{Ever71:Verhalten2,
AUTHOR="R. Evers",
TITLE="Das Verhalten der Teilnehmer einer Nebenstellenanlage. Teil 2:
Zeitintervalle innerhalb der Belegungen",
INSTITUTION="Heinrich-Hertz-Institut für Schwingungsforschung",
ADDRESS="Berlin",
VOLUME=146,
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Measurement",
}

@ARTICLE{Herz71:Berechnung,
AUTHOR="U. Herzog",
TITLE="Berechnung doppelt gerichteter Bündel mit Verkehrsangeboten
verschiedener Art",
JOURNAL=aeu,
VOLUME=25,
NUMBER="9/10",
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Loss system",
}

@ARTICLE{Herz71:Calculation,
AUTHOR="U. Herzog",
TITLE="Calculation of Fully Available Groups and Gradings for Mixed Pure
Chance Traffic",
JOURNAL=ntz,
NUMBER=12,
YEAR=1971,
KEYWORDS="Loss system",
}

@ARTICLE{Hieb71:Computing,
AUTHOR="L. Hieber",
TITLE="On Computing the Probability of Loss of Two-stage Link systems
with Preselection (Zur Berechnung der Verlustwahrscheinlichkeit
zweiskeit zweistufiger Linksysteme für Mischwahl)",
JOURNAL=ntz,
VOLUME=24,
NUMBER=10,
YEAR=1971,
KEYWORDS="Link system",
}

@ARTICLE{Hofs71:Verkerhsverhalten,
AUTHOR="H. Hofstetter and W. Rohrbach",
TITLE="Das Verkerhsverhalten der Umkehrgruppierung für
Fernsprech-Ortsvermittlungen",
JOURNAL="Siemens Informationen Fernsprech-Vermittlungstechnik",
ADDRESS="München",
VOLUME=7,
NUMBER=1,
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Holt71:Dependence,
AUTHOR="J. M. Holtzmann",
TITLE="Analysis of Dependence Effects in Telephone Trunking Networks",
JOURNAL=bstj,
VOLUME=50,
NUMBER=8,
YEAR=1971,
KEYWORDS="Link system",
}

@ARTICLE{Hwan71:Benes,
AUTHOR="F. K. Hwang",
TITLE="On Benes Rearrangeable Networks",
JOURNAL=bstj,
VOLUME=50,
NUMBER=1,
YEAR=1971,
KEYWORDS="Link system",
}

@TECHREPORT{Joys71:Comments,
AUTHOR="L. A. Joys",
TITLE="Comments on the Engset and {Erlang} formulae for telephone
traffic losses",
INSTITUTION="Research Establishment, The Norwegian Telecommunications
Administration",
VOLUME="jun",
NUMBER="TF 25/71",
PAGES="3-127",
YEAR=1971,
KEYWORDS="Loss system",
}

@ARTICLE{Kuhn71:Kombinierte,
AUTHOR="P. J. Kühn",
TITLE="Kombinierte Wartesysteme und Verlustsysteme mit mehreren
Eingangs-Warteschlangen, vollkommener und unvollkommener
Erreichbarkeit",
JOURNAL=aeu,
VOLUME=25,
NUMBER="9/10",
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Delay system",
}

@ARTICLE{Kumm71:Analyse,
AUTHOR="K. K mmerle",
TITLE="Analyse der Approximationsverfahren zur Berechnung des Verlustes
bei Linksystemen",
JOURNAL=aeu,
VOLUME=25,
NUMBER="9/10",
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Kumm71:Punkt,
AUTHOR="K. K mmerle",
TITLE="Punkt-Punkt-Verlust in Linksystemen - Modell und
Berechnungsmethoden",
JOURNAL=aeu,
VOLUME=25,
NUMBER=10,
YEAR=1971,
KEYWORDS="Link system",
ANNOTE="engl. ? Point-to-Point Loss in Link Systems: Model and
Calculation Methods",
}

@ARTICLE{Gall71:Efficiency,
AUTHOR="P. Le Gall",
TITLE="Efficiency rate and stationary nature of telephone traffic",
JOURNAL="Commutation and Electronique",
PUBLISHER="Socotel",
ADDRESS="Paris",
VOLUME=35,
PAGES="7-36",
YEAR=1971,
KEYWORDS="Loss system",
}

@ARTICLE{Lorc71:Exakte,
AUTHOR="W. Lörcher",
TITLE="Exakte Berechnung der Verlustwahrscheinlichkeit bei Linksystemen
mit zwei Stufen für Richtungswahl",
JOURNAL=aeu,
VOLUME=25,
NUMBER="9/10",
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Lotz71:Nachrichtenverkehrstheorie,
AUTHOR="A. Lotze",
TITLE="Nachrichtenverkehrstheorie (Bericht über den 6. {ITC,} München
1970)",
JOURNAL=ntz,
NUMBER=6,
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Loss system",
}

@ARTICLE{Mysk71:Recording,
AUTHOR="A. Myskja",
TITLE="A Recording and Processing System for Accounting and Traffic
Analysis on a Large {PABX}",
JOURNAL=ieeecom,
VOLUME="COM-19",
NUMBER=5,
YEAR=1971,
KEYWORDS="Measurement",
}

@MISC{Anon71:Vermittlungstechnik,
AUTHOR="Anonymous",
TITLE="Vermittlungstechnik und Verkehrstheorie Begriffe {NTG} 0903,
Entwurf",
PUBLISHER="ntz",
VOLUME=24,
NUMBER=4,
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Loss system",
}

@ARTICLE{Opfe71:Class,
AUTHOR="D. C. Opfermann and N. T. Tsao-Wu",
TITLE="On a Class of Rearrangeable Switching Networks Part {I:} Control
Algorithm Part {II:} Enumeration Studies and Fault Diagnosis",
JOURNAL=bstj,
VOLUME=50,
NUMBER=5,
YEAR=1971,
KEYWORDS="Link system",
}

@ARTICLE{Rodr71:Moderne,
AUTHOR="A. Rodriguez and J. de Villacian",
TITLE="Moderne Methoden zur Untersuchung der Verkehrseigenschaften von
Fernmeldenetzen",
JOURNAL="Elektrisches Nachrichtenwesen",
VOLUME=46,
NUMBER=3,
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Loss system",
}

@ARTICLE{Sche71:Exact,
AUTHOR="R. Schehrer",
TITLE="Exact Calculation of Overflow Systems with One Non-Ideal Grading
and One Ideal Grading or Full Available Group",
JOURNAL=ntz,
VOLUME=24,
NUMBER=10,
YEAR=1971,
KEYWORDS="Overload control; flow control; communication network",
ANNOTE="Die exakte Berechnung von Überlaufsystemen mit einem nichtideal
gemischten und einem ideal gemischten (oder vollkommen erreichbaren)
Leitungsbündel)",
}

@ARTICLE{Schw71:Sequentialtests,
AUTHOR="H. Schwärtzel",
TITLE="Sequentialtests zur Beobachtung des Fernsprechverkehrs",
JOURNAL=aeu,
VOLUME=25,
NUMBER=2,
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Measurement",
}

@ARTICLE{Souk71:Berechnung,
AUTHOR="R. Soukup",
TITLE="Berechnung der Verkehrsleistung von Vermittlungseinrichtungen mit
Hilfe einer Datenverarbeitungsanlage",
JOURNAL="Elektrotechnik und Maschinenbau",
ADDRESS="Wien",
VOLUME=88,
NUMBER=3,
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Simulation",
}

@ARTICLE{Brum71:Relation,
AUTHOR="S. L. Brumelle",
TITLE="On the relation between customer and time averages in queues",
JOURNAL=jap,
VOLUME=8,
NUMBER=4,
PAGES="508-520",
YEAR=1971,
KEYWORDS="Queueing theory; number of elements in system",
}

@ARTICLE{Chen71:Random,
AUTHOR="E. H. Chen",
TITLE="A random normal number generator for 32-bit-word computers",
JOURNAL="Journal of the American Statistical Association",
VOLUME=66,
NUMBER=334,
PAGES="400-403",
YEAR=1971,
KEYWORDS="random number generation",
}

@ARTICLE{Durr71:Priority,
AUTHOR="L. Durr",
TITLE="Priority queues with random order of service",
JOURNAL=or,
VOLUME=19,
NUMBER=2,
PAGES="453-460",
YEAR=1971,
KEYWORDS="Queueing system; priority; analysis",
}

@ARTICLE{Hook71:Priority,
AUTHOR="J. A. Hooke and Narahari Umanath Prabhu",
TITLE="Priority queues in heavy traffic",
JOURNAL="Opsearch",
VOLUME=8,
NUMBER=1,
PAGES="1-9",
YEAR=1971,
KEYWORDS="Queueing system; priority; analysis",
}

@ARTICLE{Mars71:Customer,
AUTHOR="K. T. Marshall and R. W. Wolff",
TITLE="Customer average and time average queue lengths and waiting
times",
JOURNAL=jap,
VOLUME=8,
NUMBER=3,
PAGES="535-542",
YEAR=1971,
KEYWORDS="Queueing theory; number of elements in system",
}

@BOOK{Newm71:Generation,
AUTHOR="T. G. Newman and P. L. Odell",
TITLE="The Generation of Random Variates",
PUBLISHER="Charles Griffin and Company Limited",
ADDRESS="London",
YEAR=1971,
KEYWORDS="Rng",
}

@ARTICLE{Olsz71:Przeksztalcanie,
AUTHOR="T. Olszewski",
TITLE="Przeksztalcanie na emc liczb pseodolosowych z rozkladem
rewnomiernym na liczby z dowolnym rozkladem zadanym",
JOURNAL="Prace Przemyslowego Instytutu Telecomunikacji",
VOLUME=21,
NUMBER=72,
PAGES="51-55",
YEAR=1971,
LANGUAGE="English?",
KEYWORDS="random number generation",
}

@INPROCEEDINGS{Tyme71:TYMNET,
AUTHOR="L. Tymes",
TITLE="{TYMNET:} A terminal-oriented communication network",
BOOKTITLE=sjcc,
VOLUME=38,
PAGES="211-216",
YEAR=1971,
}

@ARTICLE{Fair71:Natural,
AUTHOR="M. C. Fairhurst and I Aleksander",
TITLE="Natural pattern clustering in digital learning nets",
JOURNAL=elet,
VOLUME=7,
NUMBER=24,
PAGES="724-726",
YEAR=1971,
ABSTRACT={This letter reports the results of experiments in which an
unsupervised net is found to perform a natural clustering operation. An
{"}aging{"} process is introduced during learning, and the net is
randomly connected withh outputs feeding back to inputs.},
}

@ARTICLE{Kell71:Edge,
AUTHOR="M. D. Kelly",
TITLE="Edge detection in pictures by computer using planning",
EDITOR="B. Michie and Meltze D.",
JOURNAL=machine,
PUBLISHER="Edinburgh University Press",
VOLUME=6,
PAGES="397-409",
YEAR=1971,
ABSTRACT="This paper describes a program for extracting an accurate
outline of a man's head from a digital picture. The program accepts as
input grey scale pictures containing people standing in front of various
backgrounds. The output of the program is an ordered list of the points
which form the outline of the head. The edges of background objects and
the interior details of the head have been supressed. The program is
successful because of an improved method for edge detection which uses
heuristic planning, a technique drawn from AI research in problem
solving. In brief, edge detection using planning consists of 3 steps. A
new digital picture is prepared from the original; the new picture is
smaller and has less detail. Edges of objects are located in the reduced
picture. The edges found in the reduced picture are used as a plan for
finding edges in the original picture. This paper describes the computer
solution of a problem in picture analysis and description. It is
suggested that a very similar concept, here called planning can be of
general value in similar tasks. In basic terms, planning consists of
tentative scene description in a picture of greatly reduced size and
detail.",
}

@ARTICLE{Welc7101:Context,
AUTHOR="J. R. Welch and K. G. Slater",
TITLE="A context algorithm for pattern recognition in image
interpretation",
JOURNAL=ieeesmc,
VOLUME=1,
NUMBER=1,
PAGES="24-30",
YEAR=1971,
}

@ARTICLE{Knut71:Optimum,
AUTHOR="D. E. Knuth",
TITLE="Optimum Binary Search Trees",
JOURNAL=acta,
VOLUME=1,
YEAR=1971,
REFERENCES=12,
ABSTRACT="One of the popular methods for retrieving information
information by its 'name' is to store names in a binary tree. To find if
a given name is in the tree, we compare it to the name at the root and
four cases arise. ...",
}

@ARTICLE{Kmme71:Point,
AUTHOR="K. K mmerle",
TITLE="Point to point loss in link systems ...",
JOURNAL=ieeecom,
VOLUME="COM-19",
PAGES="261-267",
YEAR=1971,
KEYWORDS="Switching system; switching network; link system",
}

@ARTICLE{Bazl7109:Verlustwahrscheinlichkeit,
AUTHOR="D. Bazlen",
TITLE="Verlustwahrscheinlichkeit in Linksystemen mit Intern- und
Externverkehr",
JOURNAL=aeu,
ADDRESS="Germany",
VOLUME=25,
NUMBER="9/10",
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Bene7103:Telephone,
AUTHOR="V. E. Benes",
TITLE="A Telephone Traffic Model Based on Randomly Closing Croisspoints,
and its Relationship to other models",
JOURNAL=bstj,
VOLUME=50,
NUMBER=3,
YEAR=1971,
KEYWORDS="Loss system",
}

@PHDTHESIS{Bohm71:Modelle,
AUTHOR="E. Böhm",
TITLE="Modelle für Entwicklungsprognosen im Fernsprechwesen",
SCHOOL="Institut für Nachrichtenvermittlung und Datenverarbeitung,
Universität Stuttgart",
ADDRESS="Stuttgart, Germany",
VOLUME=13,
PAGES=141,
NOTE="Bericht über verkehrstheoretische Arbeiten",
YEAR=1971,
LANGUAGE="German",
KEYWORDS="forecasting; development; telephony; grade of service",
}

@PHDTHESIS{Bran71:Preemptive,
AUTHOR="G. J. Brandt",
TITLE="Das preemptive Warteverlustsystem",
SCHOOL="Institut für Nachrichtenvermittlung und Datenverarbeitung,
Universität Stuttgart",
ADDRESS="Stuttgart, Germany",
VOLUME=14,
NOTE="Bericht über verkehrstheoretische Arbeiten",
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Delay system",
}

@ARTICLE{Bret7109:Anrufwiederholung,
AUTHOR="G. Bretschneider",
TITLE="Anrufwiederholung mit begrenzter
Wiederholungswahrscheinlichkeit",
JOURNAL=aeu,
ADDRESS="München, Germany",
VOLUME=25,
NUMBER="9/10",
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Loss system",
}

@ARTICLE{Kühn7109:Kombinierte,
AUTHOR="P. J. Kühn",
TITLE="Kombinierte Warte- und Verlustsysteme mit mehreren
Eingangs-Warteschlangen, vollkommener und unvollkommener
Erreichbarkeit",
JOURNAL=aeu,
ADDRESS="Germany",
VOLUME=25,
NUMBER="9/10",
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Delay system",
}

@ARTICLE{Anon7104:Vermittlungstechnik,
AUTHOR="Anonymous",
TITLE="Vermittlungstechnik und Verkehrstheorie Begriffe {NTG} 0903",
JOURNAL=ntz,
ADDRESS="Germany",
VOLUME=24,
NUMBER=4,
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Loss system",
}

@ARTICLE{Thie7109:Wartesysteme,
AUTHOR="M. H. Thierer",
TITLE="Wartesysteme mit unvollkommener Erreichbarkeit und konstanter
Belegungsdauer",
JOURNAL=aeu,
ADDRESS="Germany",
VOLUME=25,
NUMBER="9/10",
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Delay system",
}

@TECHREPORT{Bazl71:Literatur,
AUTHOR="D. Bazlen",
TITLE="Literatur über Nachrichtenverkehrstheorie",
INSTITUTION="NVDV, Universität Stuttgart",
ADDRESS="Stuttgart, Germany",
PAGES=27,
YEAR=1971,
LANGUAGE="German",
KEYWORDS="traffic theory",
}

@TECHREPORT{Berg71:Verkehrsmessungen,
AUTHOR="E. R. Berger",
TITLE="Verkehrsmessungen. Laborübungen zur Fernmeldetechnik, Aufgabe F
18",
INSTITUTION="Technische Universität Berlin",
ADDRESS="Berlin, Germany",
PAGES=33,
YEAR=1971,
LANGUAGE="German",
KEYWORDS="traffic measurement",
}

@ARTICLE{Berr71:Simulation,
AUTHOR="L. T. M. Berry",
TITLE="A Simulation Investigation of an Alternate Routing Model",
JOURNAL=atr,
VOLUME=5,
NUMBER=2,
PAGES="3-11",
YEAR=1971,
KEYWORDS="Routing algorithm; alternate routing; simulation",
}

@PHDTHESIS{Berr71:Mathematical,
AUTHOR="L. T. M. Berry",
TITLE="A Mathematical Model for Optimizing Telephone Networks",
SCHOOL="University of Adelaide",
YEAR=1971,
KEYWORDS="Mathematical model; optimization; network; telephony",
}

@ARTICLE{Buch7101:Inherent,
AUTHOR="M. M. Buchner and S. R. Neal",
TITLE="Inherent Load-Balancing in Step-by-Step Switching Systems",
JOURNAL=bstj,
VOLUME=50,
NUMBER=1,
PAGES="135-165",
YEAR=1971,
KEYWORDS="Load Balancing; Switching System",
}

@TECHREPORT{Die71:Modelos,
AUTHOR="G. Die",
TITLE="Modelos Matematicos de Trafico Telefonico",
INSTITUTION="ITT Laboratories de Espania",
ADDRESS="Madrid, Spain",
NUMBER="71-TM-60.18",
PAGES=63,
YEAR=1971,
LANGUAGE="Spanish",
KEYWORDS="traffic theory; tutorial",
ABSTRACT="Lecture notes",
}

@ARTICLE{Flei7104:Zur,
AUTHOR="K. Fleischmann",
TITLE="Zur Stationarität eines modifizierten Erlangschen
Bedienungsprozesses",
JOURNAL="Mathematische Operationsforschung und Statistik",
ADDRESS="Germany",
VOLUME=2,
NUMBER=4,
PAGES="283-289",
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Service Characterization; Theory; Stationary Process; Erlang
Distribution",
}

@TECHREPORT{Geus71:Om,
AUTHOR="C.-F. Geust",
TITLE="Om simulering av Länksystem",
INSTITUTION="Helsinki University of Technology, Telecommunication
Laboratory",
PAGES=43,
YEAR=1971,
KEYWORDS="simulation; link system",
}

@ARTICLE{Jens71:Denumerable,
AUTHOR="A. Jensen and D. G. Kendall",
TITLE="Denumerable Markov Processes with Bounded Generators: A Routine
for Calculating pij(oo)",
JOURNAL=jap,
VOLUME=8,
PAGES="423-427",
YEAR=1971,
KEYWORDS="Markov process",
}

@MISC{Laur71:Offentligt,
AUTHOR="T. Lauritzen",
TITLE="Offentligt Datakommunikationsnet",
PUBLISHER="Foredrag ved Telefoningeni rm det",
ADDRESS="Nyborg, Denmark",
PAGES=10,
NOTE="slides",
YEAR=1971,
LANGUAGE="Danish",
KEYWORDS="Data network",
}

@ARTICLE{Lipp71:Sprech,
AUTHOR="H. M. Lipp",
TITLE="Sprech- und Suchanlagen",
JOURNAL="NTZ-Report",
PUBLISHER="VDE-Verlag",
ADDRESS="Berlin, Germany",
VOLUME=10,
PAGES=31,
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Pabx",
}

@ARTICLE{Malt7103:Service,
AUTHOR="N. I. Mal'tseva",
TITLE="Service Systems with a Hyper-Erlang Source, Exponential Servicing
Law, and a Bounded Expectation Space",
JOURNAL="Problems of Information Transmission",
VOLUME=7,
NUMBER=3,
PAGES="249-256",
YEAR=1971,
KEYWORDS="Queueing system; limited waiting time",
}

@BOOK{Nils71:Generalisering,
AUTHOR="A. Nilsson",
TITLE="Generalisering av Erlang's Formel för Upptagetsystem",
PUBLISHER="Överkurs i Teletrafikteori",
ADDRESS="Lund, Sweden",
PAGES=11,
YEAR=1971,
LANGUAGE="Swedish",
KEYWORDS="Erlang B formula; loss system",
ABSTRACT="Insensitivity",
}

@BOOK{Nils71:Overflow,
AUTHOR="A. Nilsson",
TITLE="Overflow teori",
SERIES="Överkurs i Teletrafikteori",
PUBLISHER="Lunds tekniska Högskola",
ADDRESS="Lund, Sweden",
PAGES=22,
YEAR=1971,
LANGUAGE="Swedish",
KEYWORDS="overflow",
}

@BOOK{Nils71:Exponentielle,
AUTHOR="A. Nilsson",
TITLE="Exponentielle Etapper",
SERIES="Överkurs i Teletrafikteori",
PUBLISHER="Lund Institute of Technology",
ADDRESS="Lund, Sweden",
PAGES=6,
YEAR=1971,
LANGUAGE="Swedish",
KEYWORDS="Probability theory",
}

@TECHREPORT{Nyga71:Forelæsninger,
AUTHOR="J. Nygaard",
TITLE="Forelæsninger over Teletrafikteori",
INSTITUTION="Norges Tekniske Hþjskole forår",
ADDRESS="Oslo, Norway",
PAGES=22,
YEAR=1971,
LANGUAGE="Norwegian",
KEYWORDS="tutorial",
}

@ARTICLE{Poly7101:One,
AUTHOR="D. G. Polyak",
TITLE="One Queueing System with Nonstationary Incoming Flow",
JOURNAL="Problems of Information Transmission",
VOLUME=7,
NUMBER=1,
PAGES="88-90",
YEAR=1971,
KEYWORDS="Queueing system; instationary arrival",
}

@TECHREPORT{Rahk71:Study,
AUTHOR="K. Rahko",
TITLE="a. A Study of the Traffic Process Based on Measurements. b. {PCM}
ja yhdistetty puhelinverko. c. Aikamme puhelin. d. Maailmanlaajuinen
tietoliikenneverkko. e. Telekommunikaatio ja yhdyskuntasuunnittel",
INSTITUTION="Helsinki University of Technology, Telecommunication
Laboratory",
ADDRESS="Helsinki, Finland",
PAGES=4,
YEAR=1971,
KEYWORDS="traffic measurement",
}

@ARTICLE{Rodr7103:Present,
AUTHOR="A. Rodriguez and J. de Villacian",
TITLE="Present methods for the Investigation of Traffic Properties in
Telecommunication Networks",
JOURNAL=ec,
ADDRESS="France",
VOLUME=46,
NUMBER=3,
PAGES="182-187",
YEAR=1971,
KEYWORDS="Traffic measurement; modeling",
}

@ARTICLE{Rose7104:Nachrichtensatelliten,
AUTHOR="J. Rosenblatt and D. Stroh",
TITLE="Nachrichtensatelliten und ihre Möglichkeiten im internationalen
Fernsprechnetz",
JOURNAL="Informationen Fernsprech-Vermittlungstechnik",
ADDRESS="Germany",
VOLUME=7,
NUMBER=4,
PAGES="105-110",
YEAR=1971,
LANGUAGE="German",
KEYWORDS="satellite radio",
}

@TECHREPORT{Wall71:Beräkning,
AUTHOR="B. Wallström",
TITLE="Beräkning av Moment för Avverkade och Avvisade Deltrafiker",
TYPE="Internal Report",
INSTITUTION="L M Ericsson",
ADDRESS="Lund, Sweden",
NUMBER="Dtg 1155",
PAGES=13,
NOTE="överkurs i Teletrafikteori",
YEAR=1971,
LANGUAGE="Swedish",
KEYWORDS="moment",
}

@ARTICLE{Anon7106:Nachrichtenverkehrstheorie,
AUTHOR="Anonymous",
TITLE="Nachrichtenverkehrstheorie. Bericht über den 6. International
Teletraffic Congress, München 1970",
JOURNAL=ntz,
ADDRESS="Germany",
NUMBER=6,
PAGES="344-348",
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Traffic engineering; survey",
}

@ARTICLE{Brad7101:Effects,
AUTHOR="Paul T. Brady",
TITLE="Effects of Transmission Delay on Conversational Behavior on
Echo-Free Telephone Circuits",
JOURNAL=bstj,
VOLUME=50,
NUMBER=1,
PAGES="115-134",
MONTH=jan,
YEAR=1971,
KEYWORDS="packet voice",
ANNOTE="Delays of 0.6 s and 1.2 s caused more confusion and double
talking.",
}

@TECHREPORT{Clar7101:Classroom,
AUTHOR="D. D. Clark and R. L. Graham and J. H. Saltzer and M. D.
Schroeder",
TITLE="The Classroom Information and Computing Service",
INSTITUTION="Massachusetts Institute of Technology",
ADDRESS="Cambridge, Massachusetts",
NUMBER="TR-80",
MONTH=jan,
YEAR=1971,
}

@ARTICLE{Whit7103:Weak,
AUTHOR="W. Whitt",
TITLE="Weak convergence theorems for priority queues: Preemptive-resume
discipline",
JOURNAL=jap,
VOLUME=8,
NUMBER=1,
PAGES="74-94",
MONTH=mar,
YEAR=1971,
KEYWORDS="Queueing system; priority; analysis",
}

@ARTICLE{Vart7103:Design,
AUTHOR="A. G. Vartabedian",
TITLE="The Design of Visual Displays",
JOURNAL=ccr,
VOLUME=1,
NUMBER=2,
MONTH=mar,
YEAR=1971,
}

@ARTICLE{Anon7103:Summation,
AUTHOR="Anonymous",
TITLE="Summation of Important Communication Issues from {ACM70}",
JOURNAL=ccr,
VOLUME=1,
NUMBER=2,
MONTH=mar,
YEAR=1971,
}

@TECHREPORT{Woll7103:Mathematisches,
AUTHOR="E. Wollner",
TITLE="Mathematisches Modell für den Konzentrator des Elektronischen
Datenvermittlungssystems bei Verwendung von Zeitvielfachtechnik",
INSTITUTION="Forschungsinstituts des FTZ, Deutsche Bundespost",
ADDRESS="Darmstadt, Germany",
NUMBER="A 442 TBr 34",
PAGES=17,
MONTH=mar,
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Concentrator; multiplexing; TDM",
}

@ARTICLE{Rudi7104:Simple,
AUTHOR="Harry Rudin",
TITLE="Performance of Simple Multiplexer-Concentrators for Data
Communication",
JOURNAL=ieeecomt,
VOLUME="COM-19",
NUMBER=2,
PAGES="178-187",
MONTH=apr,
YEAR=1971,
ABSTRACT="Multiplexer-concentrators (or asynchronous multiplexers) are
devices used to increase the efficiency of telecommunication systems
into which the flow of information is erratic. In the analysis of such
systems, many assumptions about the statistical nature of the input
traffic can be made. The assumptions made here are constant message
length, constrained buffer size, and finite number of message sources.
The numerical technique given copes with the case of multiple output
trunks, and the complete statistical behavior of the system is revealed
in transient as well as steady-state form. Results are given graphically
which show the effect of various statistical assumptions, the transient
response of the system, the behavior of the tail of the distribution of
queue states, and the effect of message clustering.",
ANNOTE="Discrete-time queueing theory. Synchronous arrivals with $R$
output channels, fixed-length messages, generated by finite population
$N$ and served FCFS; number of arrivals per slot is binomial; buffer
size $Q$; provides transient state probability, message loss and
overflow probability; compares with asynchronous systems with infinite
buffer and exponential service time",
}

@TECHREPORT{Andr7105:Integrert,
AUTHOR="S. Andresen",
TITLE="Integrert Bedriftskommunikasjon: 'Tjeneste/Funktionsrepertoar'",
TYPE="Teknisk notat",
INSTITUTION="Elektronikklaboratoriet ved NTH, Norges tekniske H gskole",
ADDRESS="Oslo, Norway",
NUMBER="T-36",
PAGES=18,
MONTH=may,
YEAR=1971,
LANGUAGE="Norwegian",
KEYWORDS="Pabx",
ABSTRACT="PABC",
}

@INPROCEEDINGS{Forc7105:How,
AUTHOR="N. Forchhammer",
TITLE="How fo Traffic Interruptions affect Level of Service ?",
BOOKTITLE="5th International Symposium on Traffic Flow Theory and
Transportation. 24.",
PAGES=6,
MONTH=may,
YEAR=1971,
KEYWORDS="Analysis; Interrupted Service; Theory; QOS",
}

@ARTICLE{Sahi7106:Equilibrium,
AUTHOR="Izzet Sahin",
TITLE="Equilibrium Behavior of a Stochastic System with Secondary
Input",
JOURNAL=jap,
VOLUME=8,
NUMBER=2,
PAGES="252-260",
MONTH=jun,
YEAR=1971,
KEYWORDS="queueing theory",
ABSTRACT="Equilibrium behavior of a stochastic system with two types of
input of different statistical nature and with linear continuous output
is investigated. The results have applications in queueing theory,
storage theory and insurance-risk theory.",
ANNOTE="superposition of virtual work arrival processes, both with
random interarrival times.",
}

@ARTICLE{Anon71:International,
AUTHOR="Anonymous",
TITLE="International Conference on Computer Communication
(ICCC)--Preview",
JOURNAL=ccr,
VOLUME=1,
NUMBER=3,
MONTH=jun,
YEAR=1971,
}

@ARTICLE{Sher7108:Storage,
AUTHOR="D. N. Sherman",
TITLE="Storage and Delay Estimates for Asynchronous Multiplexing of Data
in Speech",
JOURNAL=ieeecom,
VOLUME="COM-19",
NUMBER=4,
PAGES="551-555",
MONTH=aug,
YEAR=1971,
KEYWORDS="packet voice; vacation system",
ABSTRACT="The communication system considered here interpolates data in
the pauses in speech. Speech is gated on and off by comparing its own
envelope to a threshold. At the same time a source is generating data at
a fixed rate. The data are stored in a buffer, awaiting transmission
during one of the gaps in speech. This paper presents a theoretical
analysis of a model in which successive speech durations are assumed to
be independent exponentially distributed random variables. The
successive durations of silence are modeled by independent random
variables that are obtained by forming the mixture distribution of two
independent exponentially distributed random variables. On the basis of
this model for alternating speech and silences, and an infinite buffer
that is assumed to take a continuum of states, we solve for the
stationary probability density of nonzero states of the peak buffer
allocation as well as the average delay using typical speech
parameters.",
}

@ARTICLE{Youn7108:Results,
AUTHOR="E. A. Youngs and E. M. Cramer",
TITLE="Some results relevant to choice of sum and sum-of-product
algorithms",
JOURNAL="Technometrics",
VOLUME=13,
NUMBER=3,
PAGES="657-665",
MONTH=aug,
YEAR=1971,
KEYWORDS="Simulation; statistics; numeric calculation",
}

@INPROCEEDINGS{Chu7108:Optimal,
AUTHOR="Wesley W. Chu",
TITLE="Optimal fixed message block size for computer communications",
BOOKTITLE="IFIP",
NOTE="also in \cite[p. 238-245]{Chu74:Advances}",
MONTH=aug,
YEAR=1971,
}

@TECHREPORT{Pete7108:Zeitreihen,
AUTHOR="H. Petersen",
TITLE="Zeitreihen und Wachstumskurven. Teil {I:} Überblick über
Zeitreihenanalysen",
TYPE="Technischer Bericht",
INSTITUTION="Forschungsinstituts des FTZ, Deutsche Bundespost",
ADDRESS="Darmstadt, Germany",
NUMBER="A 11 TBr2",
PAGES=23,
MONTH=aug,
YEAR=1971,
LANGUAGE="German",
KEYWORDS="Time series analysis; forecasting",
}

@INPROCEEDINGS{Kuhn7109:Combined,
AUTHOR="P. J. Kühn",
TITLE="On a combined delay and loss system with different queue
disciplines",
BOOKTITLE="6th Prague conference on information theory, statistical
deision functions and random processes",
ADDRESS="Prague",
MONTH=sep,
YEAR=1971,
KEYWORDS="Queueing system",
}

@INPROCEEDINGS{Lorc7109:Exact,
AUTHOR="W. Lörcher",
TITLE="On the Exact Calculation of Link Systems with Internal Overflow",
BOOKTITLE="6th Prague Conference",
PAGES="1-25",
MONTH=sep,
YEAR=1971,
KEYWORDS="Link system",
}

@ARTICLE{Phil7109:Generation,
AUTHOR="D. T. Phillips",
TITLE="Generation of random gamma variates from the two-parameter
gamma",
JOURNAL="AIIE Transactions",
VOLUME=3,
NUMBER=3,
PAGES="191-198",
MONTH=sep,
YEAR=1971,
KEYWORDS="random number generation",
}

@ARTICLE{Morr7109:Efficient,
AUTHOR="R. M. Morris",
TITLE="An Efficient Bit Table Technique for Dynamic Storage Allocation
of $2^n$-words Blocks",
JOURNAL=cacm,
VOLUME=14,
NUMBER=9,
MONTH=sep,
YEAR=1971,
REFERENCES=3,
ABSTRACT="An efficient bit table technique for dynamic storage
allocation of $2^n$-word blocks, which requires a minimized amount of
memory for bookkeeping purposes, is described. The technique has been
tested in an implementation of the list processing language L. A number
of ideas incorporated in the processor are also described.",
}

@ARTICLE{Wong7109:Canonical,
AUTHOR="Eugene Wong and T. C. Chiang",
TITLE="Canonical Structure in Attribute Based File Organization",
JOURNAL=cacm,
VOLUME=14,
NUMBER=9,
MONTH=sep,
YEAR=1971,
REFERENCES=5,
ABSTRACT="A new file structure for attribute based retrieval is proposed
in this paper. It allows queries involving arbitrary Boolean functions
of the attribute-value pairs to be processed without taking
intersections of lists. The structure is highly dependent on the way in
which the file is to be used and is uniquely determined by the
specification of the allowed queries. Thus, for example, the structure
of retrieval on the basis of ranges of values of a given attribute would
be very different from one where only retrieval on the basis of a single
value is permitted. The file organization being proposed is based on the
atoms of a Boolean algebra generated by the queries. The desirable
properties claimed for this structure are proved, and file maintainance
questions are discussed.",
}

@ARTICLE{Rasc7109:Objectivity,
AUTHOR="G. Rasch",
TITLE="On Objectivity and Specificity of the Probabilistic Basis for
Testing",
JOURNAL="Dansk Selskab for Teoretisk Statistik",
ADDRESS="Denmark",
PAGES=19,
MONTH=sep,
YEAR=1971,
KEYWORDS="Statistics",
}

@ARTICLE{Sing7110:Finite,
AUTHOR="V. P. Singh",
TITLE="Finite Waiting Space Bulk Service System",
JOURNAL=jem,
VOLUME=5,
NUMBER=4,
PAGES="241-248",
MONTH=oct,
YEAR=1971,
KEYWORDS="queueing theory",
ABSTRACT="This paper discusses the ergodic queue length distribution of
a bulk service system with finite waiting space by the method of the
imbedded Markov chain. The system under consideration is a queueing
system with Poisson arrivals, general service times, single server and
where service is performed on batches of random size.",
ANNOTE="see also \cite{Sing72:Finite}",
}

@ARTICLE{Watk7110:Partial,
AUTHOR="Bruce O. Watkins",
TITLE="A Partial Fraction Algorithm",
JOURNAL=ieeeac,
VOLUME="AC-16",
PAGES="489-491",
MONTH=oct,
YEAR=1971,
KEYWORDS="partial fraction expansion; numerical methods; polynomial;
roots",
ABSTRACT="A computer program has been developed to find the partial
fraction expansion of a ratio of two polynomials with real coefficients.
The program is based on a method suggested by P. Henrici (Eidgenössische
Technische Hochschule, Zürich, Switzerland) and utilizes real numbers
only, thus dispensing with complex arithmetic. The program assumes
non-repeated roots for the denominator polynomial. Henrici's technique
may be extended to other situations.",
}

@ARTICLE{LeGa7110:Le,
AUTHOR="P. Le Gall",
TITLE="Sur le taus d'efficacité et la stationnarité du trafic
téléphonique",
JOURNAL="Commutation and Electronique",
ADDRESS="France",
NUMBER=35,
PAGES="7-36",
MONTH=oct,
YEAR=1971,
LANGUAGE="French",
}

@ARTICLE{Cohe7111:Formula,
AUTHOR="J. W. Cohen",
TITLE="On A Formula Dual to Erlang's Loss Formula",
JOURNAL=or,
PAGES="1759-1760",
MONTH=nov,
YEAR=1971,
KEYWORDS="Erlang B Formula",
}

@TECHREPORT{Lewi7111:Statistical,
AUTHOR="Pierre Lewis and P. C. Yue",
TITLE="Statistical Analysis of Series of Events in Computer Systems",
TYPE="IBM Research Report",
INSTITUTION="IBM",
NUMBER="RC 3606",
PAGES=19,
MONTH=nov,
YEAR=1971,
KEYWORDS="stochastic process",
ABSTRACT="Stochastic point process",
}

@MISC{Sten71:Utvelgelse,
AUTHOR="J. Stene",
TITLE="Utvelgelse av familier med nedarvete kjennetegn",
ADDRESS="Copenhagen, Denmark",
PAGES=34,
NOTE="Foredrag i Dansk Selskab for Teoretisk Statistik",
MONTH=dec,
YEAR=1971,
LANGUAGE="Danish",
}