@ARTICLE{Ahre74:Computer,
AUTHOR="J. Ahrens and U. Dieter",
TITLE="Computer Methods for Sampling from Gamma, Beta, Poisson and
Binomial Distributions",
JOURNAL=comp,
VOLUME=12,
NUMBER=3,
PAGES="223-246",
YEAR=1974,
KEYWORDS="simulation",
}

@BOOK{Zuwa74:General,
AUTHOR="Fadil H. Zuwaylif",
TITLE="General Applied Statistics",
EDITION="2nd",
PUBLISHER="Addison-Wesley",
ADDRESS="Reading, Massachusetts",
YEAR=1974,
}

@ARTICLE{Stid74:Last,
AUTHOR="S. Stidham",
TITLE="A last word on $L=\lambda {W$}",
JOURNAL=or,
VOLUME=22,
NUMBER=1,
PAGES="417-421",
YEAR=1974,
REFERENCES=11,
KEYWORDS="Number of elements in system; time in system; traffic;
Little's law",
ABSTRACT="This note gives a rigorous proof of the queueing formula
$L=\lambda W$, using as hypotheses only that the limiting averages,
$\lambda$ and W, exist and are finite.  The proof is related to one
given in a previous paper by the author that used a discounted analogue
and tauberian theorems.  The proof in the present paper, however, is
direct and avoids the use of transforms.",
}

@ARTICLE{Suur74:Disjoint,
AUTHOR="J. W. Suurballe",
TITLE="Disjoint Paths in a Network",
JOURNAL=networks,
ADDRESS="New York, New York",
VOLUME=4,
PAGES="125-145",
YEAR=1974,
REFERENCES=10,
KEYWORDS="Graph theory; disjoint path; routing algorithm",
ANNOTE="Routes between two given nodes of a network are called
diversified if they are node-disjoint, except at the terminals.
Diversified routes are required for reliability in communication, and an
additional criterion is that their total cost, assumed to be the sum if
individual arc lengths or costs, is minimum. An algorithm and related
theory is described for a general number $K$ of node-disjoint paths with
minimum total length. The algorithm applies",
}

@ARTICLE{Taka74:Single,
AUTHOR="L. Takacs",
TITLE="A single-server queue with limited virtual waiting time",
JOURNAL=jap,
VOLUME=11,
PAGES="612-617",
YEAR=1974,
REFERENCES=4,
KEYWORDS="M/G/1; waiting time; virtual waiting time; distribution",
ANNOTE="The limiting distributions of the actual waiting time and the
virtual waiting time are determined for a single-server queue with
poisson input and general service times in the case where there are two
types of services and no customer can stay in the system longer than an
interval of length m.",
}

@INPROCEEDINGS{Talb74:New,
AUTHOR="A. Talbot",
TITLE="A new method for numerical inversion of Laplace transforms",
BOOKTITLE="IEEE ISCAS",
PAGES="130-133",
YEAR=1974,
REFERENCES=6,
KEYWORDS="Laplace transform; numeric calculation",
}

@ARTICLE{Temb74:Optimal,
AUTHOR="S. V. Tembe and R. W. Wolff",
TITLE="The optimal order of service in tandem queues",
JOURNAL=or,
VOLUME=22,
PAGES="824-832",
YEAR=1974,
REFERENCES=9,
KEYWORDS="Tandem queue; minimization; waiting time; service time",
ANNOTE="This paper considers tandem queues for which the order of
performing service tasks can be changed, the service times being
independent of this order. It determines the optimal order of service
when either the service times of different tasks are nonoverlapping or,
for two queues in tandem, the service time of one task is constant. For
the optimal ordering, the waiting time of every customer is
stochastically smaller than for any other.",
}

@INPROCEEDINGS{Thom74:Implications,
AUTHOR="G. B. Thompson",
TITLE="Network implications of intelligent peripherals",
BOOKTITLE=compcon,
PAGES="125-126",
YEAR=1974,
REFERENCES=3,
KEYWORDS="Communication network; special terminal; future outlook",
}

@ARTICLE{Tijm74:Control,
AUTHOR="H. Tijms",
TITLE="A control policy for a priority queue with removable server",
JOURNAL=or,
VOLUME=22,
PAGES="833-837",
YEAR=1974,
REFERENCES=10,
KEYWORDS="M/G/1; hol priority; removable server",
ANNOTE="This paper studies a control policy for an M/G/1
nonpreemptive-priority queueing system with removable server and two
priority classes. This policy turns off the server when the system is
empty and turns him on when a given linear combination of the numbers of
class 1 and class 2 customers in the system exceeds a certain value.
Expressions for the long-run average numbers of class 1 and class 2
customers in the system are derived.",
}

@ARTICLE{Wash74:Multiserver,
AUTHOR="A. Washburn",
TITLE="A multiserver queue with no passing",
JOURNAL=or,
VOLUME=22,
PAGES="428-434",
YEAR=1974,
REFERENCES=2,
KEYWORDS="M/M/S; arrival time dependent",
ANNOTE="This note deals with a queueing situation where customers must
leave the system in the same order in which they arrive, owing to a
physical constraint that prohibits passing. Poisson input and
(basically) exponential service times are assumed, and the mean waiting
time in the steady state is derived.",
}

@ARTICLE{Will74:Approximate,
AUTHOR="T. R. Willemain",
TITLE="Approximate analysis of a hierarchical queueing network",
JOURNAL=or,
VOLUME=22,
PAGES="522-544",
YEAR=1974,
REFERENCES=8,
KEYWORDS="Simulation; hierarchical network; M/G/1",
ANNOTE="A hierarchical queueing network is a layered network of queues
in which all arrivals receive initial service from a primary server, and
some customers receive additional service jointly from a primary and a
secondary server.",
}

@ARTICLE{Wu74:Rearrangeable,
AUTHOR="F. F. Wu",
TITLE="Rearrangeable connecting networks",
JOURNAL=iscas,
VOLUME=7,
PAGES="333-336",
YEAR=1974,
REFERENCES=3,
KEYWORDS="Switching network",
}

@ARTICLE{Elia74:Topological,
AUTHOR="D. Elias and M. J. Ferguson",
TITLE="Topological Design of Multipoint Teleprocessing Networks",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=11,
PAGES="1753-1762",
YEAR=1974,
REFERENCES=8,
KEYWORDS="Design; multipoint connection; network; multidrop; model",
ABSTRACT="This paper is concerned with the problem of designing a
minimum-cost network of acceptable performance that connects several
remote terminals to a central processor using multidrop lines. A simple
model of the network is used to derive performance con-straints for the
design procedure. A new heuristic design proce-dure is proposed and
compared to other heuristic methods and is found superior in some
cases.",
}

@INPROCEEDINGS{Herz74:Message,
AUTHOR="U. Herzog",
TITLE="Message-switching networks with alternate routing Netze mit
Speichervermittlungen und alternativer Leitweglenkung",
BOOKTITLE=itc7,
ADDRESS="Stockholm, Sweden",
PAGES="174-181",
YEAR=1974,
REFERENCES=20,
KEYWORDS="alternate routing; store-and-forward; network; overflow",
ANNOTE="This paper shows, how to dimension store-and-forward networks
with alternate routing, taking into account the special properties of
overflow traffic. Artificial traffic trials show the good accordance
between simulated and calculated traffic values.",
}

@TECHREPORT{Herz74:Optimal,
AUTHOR="U. Herzog",
TITLE="Optimal scheduling strategies for real-time computers",
INSTITUTION="IBM Research",
PAGES=38,
YEAR=1974,
REFERENCES=14,
KEYWORDS="analysis; real time; preemptive priority; computer system",
ANNOTE="In order to fulfil response-time constraints in real-time
systems, demands are often handled by means of sophisticated scheduling
strategies. This paper first shows how to describe and analyzearbitrary
combinations of preemptive and non-preemptive (head-of-the-line)
priority strategies. An algorithm is next presented which yields the
optimal priority strategy, taking into conside-ration constraints on the
response-time.",
}

@ARTICLE{Kers74:Unified,
AUTHOR="A. Kershenbaum and Wu Chou",
TITLE="A Unified Algorithm for Designing Multidrop Teleprocessing
Networks",
JOURNAL=ieeecom,
VOLUME="COM-22",
NUMBER=11,
PAGES="1762-1772",
YEAR=1974,
REFERENCES=18,
KEYWORDS="Algorithm; multidrop; network planning; design",
ANNOTE="The problem of designing minimum-cost multidrop lines which
con-nect remote terminals to a concentrator or a central data-pro-
cessing computer is studied. For the solution of this problem a unifying
modification of Kruskal's MST algorithm is developed. An extension of
the algorithm to the solution of an associated problem of partitioning
the terminals with respect to a predetermined set of hardware units
(central computer) is also derived.",
}

@ARTICLE{Ohba74:Packet,
AUTHOR="H. Ohba and Y. Yoshida and T. Nakajo and T. Nagata",
TITLE="On the Packet-Interleaved Interface Between Packet-Switched
Network and Computers",
JOURNAL=ieeecom,
VOLUME="COM",
PAGES="1671-1675",
YEAR=1974,
REFERENCES=6,
KEYWORDS="Control; packet switching; network; data link; HDLC",
ANNOTE="This paper describes a transmission control procedure for
computer-to-computer and computer-to-terminal communication through a
public packet-switched network. By introducing the concept of a data
link and a process number, a transmission control method and a call
control method between packet-switched network and computers are
proposed for the packet-interleaved communication on the basis of the
HDLC procedure.",
}

@ARTICLE{Papo74:Estimation,
AUTHOR="A. Papoulis",
TITLE="Estimation of the Average Density of a Nonuniform Poisson
Process",
JOURNAL=ieeecom,
VOLUME="COM-22",
NUMBER=2,
PAGES="162-167",
YEAR=1974,
REFERENCES=8,
KEYWORDS="Statistics; estimation; Poisson distribution; process",
ANNOTE="The average density $\Lambda(t)$ of a Poisson Process is
estimated by a nonstationary shot noise process $s(t)$. The process
$s(t)$ is generated by a time-varying system whose impulse response
$h(t,a)$ is so determined as to minimize the mean-square (MS) estimation
error. It is shown that under realistic assumptions, $h(t,a)$ is
atruncated parabola in the variable. The analysis is extended to
two-dimensional processes.",
}

@ARTICLE{Boss74:Inequality,
AUTHOR="J. van Bosse",
TITLE="On an Inequality for the Congestion in Switching Networks",
JOURNAL=ieeecom,
VOLUME="COM-20",
NUMBER=10,
PAGES="1675-1677",
YEAR=1974,
REFERENCES=5,
KEYWORDS="Congestion; inequality; switching network",
ANNOTE="A basic inequality of le Gall, involving the congestion in
four-stage switching networks, is generalized. The basic inequality
remains valid in the case of arbitrary occupancy distributions on all
link groups in the network.",
}

@ARTICLE{Hafn74:Digital,
AUTHOR="E. R. Hafner and Z. Nenadal and M. Tschanz",
TITLE="A Digital Loop Communication System",
JOURNAL=ieeecom,
VOLUME=22,
PAGES="877-881",
YEAR=1974,
REFERENCES=9,
KEYWORDS="Performance evaluation; loop system; communication system",
ANNOTE="The concept of a local loop communication system with
distributed control is described.",
}

@ARTICLE{Aber74:Precise,
AUTHOR="O. Aberth",
TITLE="A precise numerical analysis program",
JOURNAL=cacm,
VOLUME=17,
PAGES="509-513",
YEAR=1974,
REFERENCES=11,
KEYWORDS="Method; realization; numerical method; optimization;
information system; program construction; error control; interval
arithmetic",
ANNOTE="A description is given of a program for computing the solution
to a small number of standard numerical analysis problems to any
specified accuracy, up to a limit of 2000 correct decimal places. Each
computed number is bounded in an interval with a multiple precision
midpoint. Arithmetic operations involving these numbers are executed
according to interval arithmetic concepts, with non-significant digits
automatically discarded.",
}

@ARTICLE{Adir74:Optimal,
AUTHOR="I. Adiri and U. Yechiali",
TITLE="Optimal priority-purchasing and pricing decisions in nonmonopoly
and monopoly queues",
JOURNAL=or,
VOLUME=22,
PAGES="1051-1066",
YEAR=1974,
REFERENCES=8,
KEYWORDS="M/M/1; priority; cost; optimization; balking",
ABSTRACT="An M/M/1 service station (computer center) consists of m
separate queues.  The $i$-th $(i=1,2,\ldots,m)$ queue has priority over
the $j$-th iff $i<j$.  Upon arrival, a customer receives all the
information regarding the state of the system and accordingly makes an
irrevocable decision as to which queue to join, or rather to balk
(leave) and go to a competitor.",
}

@ARTICLE{Aign74:Parameter,
AUTHOR="D. J. Aigner",
TITLE="Parameter estimation from cross-sectional observations on an
elementary queueing system",
JOURNAL=or,
VOLUME=22,
PAGES="422-428",
YEAR=1974,
REFERENCES=5,
KEYWORDS="M/M/1; comparison; estimation",
ANNOTE="This note reports on and compares the asymptotic sampling
properties of several alternative estimators for the parameters of a
simple M/M/1 queueing system, assuming that data are available on a
random sample of identical systems.",
}

@ARTICLE{Albr74:Markov,
AUTHOR="S. C. Albright",
TITLE="A Markov-decision-chain approach to a stochastic assignment
problem",
JOURNAL=or,
VOLUME=22,
PAGES="61-64",
YEAR=1974,
REFERENCES=5,
KEYWORDS="G/M/N; cost",
ANNOTE="This paper discusses a problem where jobs of random quality, or
importance, arrive at random times and must be done by one of a fixed
set of men on hand. The men can all complete any job in an exponential
amount of time, with mean 1/my, but the men are of different known
qualities. The problem is set into the framework of a G/M/N queue with a
possibly limited waiting room, and the optimization is done by
techniques of Markov decision analys",
}

@ARTICLE{Ande74:Simulation,
AUTHOR="M. Anderberg",
TITLE="Simulation von Fernmeldeverkehrssystemen",
JOURNAL=ericssonr,
YEAR=1974,
KEYWORDS="Simulation; survey",
}

@ARTICLE{Bazl74:Parameters,
AUTHOR="D. Bazlen",
TITLE="Design parameters and loss calculation of link systems",
JOURNAL=ieeecom,
VOLUME="COM-22",
PAGES="1908-1920",
YEAR=1974,
KEYWORDS="Switching network; link system",
}

@ARTICLE{Bell74:Investigation,
AUTHOR="J. R. Bell",
TITLE="An investigation of alternative cache organizations",
JOURNAL=ieeetc,
VOLUME="C-23",
PAGES="346-351",
YEAR=1974,
KEYWORDS="Cache memory; discrete event simulation; evaluation; numerical
result; metrics; buffer memory",
ANNOTE="An investigation of the various cache schemes that are practical
for a minicopmuter has been found to provide considerable insight into
cache organization. Simulations are used to obtain data on the
performance and sensitivity of organizational parameters of various
writeback and lookahead schemes. Hardware considerations in the
construction of the actual cache-minicomputer are also noted and a
simple cost/performance analysis is presented.",
}

@ARTICLE{Bort74:Data,
AUTHOR="C. F. Borteck and G. N. Nomicos",
TITLE="Data processing system performance with arbitrary stochastic
processes",
JOURNAL="Information Processing",
PUBLISHER="North Holland",
VOLUME=74,
PAGES="276-280",
YEAR=1974,
REFERENCES=9,
KEYWORDS="GI/G/1; performance evaluation; waiting time; time in system;
idle period; interdeparture time",
ANNOTE={A comprehensive graphical picture of total data processing
system performance has been established. It shows system and subsystem
characteristics for a workload spectrum from zero to saturation. A
primary performance parameter called ``specific apparent power'' has
been defined corresponding to work divided by response time. A ``system
performance map" is established for the system queueing model indicating
the service/response and queue/response},
}

@BOOK{Brig74:Fast,
AUTHOR="E. O. Brigham",
TITLE="The Fast Fourier Transform",
PUBLISHER="Prentice-Hall Inc.",
YEAR=1974,
KEYWORDS="Mathematics",
}

@ARTICLE{Buze74:Optimal,
AUTHOR="J. P. Buzen and Pi-Chun Chen",
TITLE="Optimal Load Balancing in Memory Hierarchies",
JOURNAL="Information Processing",
PUBLISHER="North-Holland",
VOLUME=74,
PAGES="271-275",
YEAR=1974,
REFERENCES=11,
KEYWORDS="Load Sharing; Analysis",
}

@ARTICLE{Cant74:Optimal,
AUTHOR="D. G. Cantor and M. Gerla",
TITLE="Optimal routing in a packet-switched computer network",
JOURNAL=ieeetc,
VOLUME="C-23",
PAGES="1062-1069",
YEAR=1974,
REFERENCES=22,
KEYWORDS="Packet switching; routing algorithm; queueing network;
decomposition",
ANNOTE="The problem of finding optimal routes in a packet-switched com
puter network can be formulated as a nonlinear multicommodity flow
problem. The application of traditional mathematical programming
techniques to the solution of the routing problem for reasonably large
networks is computationally inefficient. Satisfactory results have been
recently obtained with various heuristic techniques; however, such
techniques are nonoptimal and subject to",
}

@ARTICLE{Chan74:Work,
AUTHOR="A. Chang and S. S. Lavenberg",
TITLE="Work rates in closed queueing networks with general independent
servers",
JOURNAL=or,
VOLUME=22,
PAGES="838-847",
YEAR=1974,
REFERENCES=11,
KEYWORDS="Queueing network; closed queueing network; throughput",
ANNOTE="Closed queueing networks are composed of interconnected service
stages serving a fixed number of customers. The work rate for a stage,
defined as the long-run time-average amount of service time rendered by
the stage, is shown to exist with probability one. Work rates are shown
to depend continuously on the service time distribution.",
}

@ARTICLE{Clin74:Scalar,
AUTHOR="A. K. Cline",
TITLE="Scalar-valued and planar-valued curve fitting using splines under
tension",
JOURNAL=cacm,
VOLUME=17,
PAGES="218-220",
YEAR=1974,
REFERENCES=3,
KEYWORDS="Realization; polynomial; approximation; method; interpolation;
FORTRAN; graphics; iterative method; information system; spline; curve
fitting",
ANNOTE="The spline under tension was introduced by schweikert in an
attempt to imitate cubic splines but avoid the spurious critical points
they induce. The defining equations are presented here, together with an
efficient method for determining the necessary parameters and computing
the resultant spline. The standard scalar-valued curve fitting problem
is discussed, as well as the fitting of open and closed curves in the
plane. The use of these curves",
}

@ARTICLE{Cohe74:Two,
AUTHOR="J. W. Cohen and C. Zuckerman",
TITLE="Two languages for estimating program efficiency",
JOURNAL=cacm,
VOLUME=17,
PAGES="301-308",
YEAR=1974,
REFERENCES=16,
KEYWORDS="Programming language; runtime/storage efficiency; analysis;
algorithm",
ANNOTE="Two languages enabling their users to estimate the efficiency of
computer programs are presented. The program whose efficiency one wishes
to estimate is when in the first language, a go-to-less programming
language which includes most of the features of ALGOL 60. The second
language consists of interactive commands enabling its user to provide
additional information about the program written in the first language
and to output results",
}

@INCOLLECTION{Cox74:Layout,
AUTHOR="Donald Cox and D. O. Reudink",
TITLE="Layout and control of high capacity systems",
BOOKTITLE="Microwave Mobile Communications",
EDITOR="William C. Jakes",
PUBLISHER="John Wiley",
ADDRESS="New York",
YEAR=1974,
LANGUAGE="English",
KEYWORDS="MAT; DCA; dynamic channel assignment; simulation",
ANNOTE="DCA without reassignment, hybrid methods",
}

@ARTICLE{Crab74:Optimal,
AUTHOR="T. B. Crabill",
TITLE="Optimal control of a maintenance system with variable service
rates",
JOURNAL=or,
VOLUME=22,
PAGES="736-745",
YEAR=1974,
REFERENCES=7,
KEYWORDS="Cost; Markov process; loop queue; repair; production system",
ANNOTE="This paper examines a production system with variable
repair-service rates. Considering costs dependent on the service rates
and costs due to lost production, it seeks to minimize the long-run
expected average cost of the system.",
}

@ARTICLE{ElDi74:Calculation,
AUTHOR="M. E. Din and L. Peiram",
TITLE="Calculation of the traffic capacity of a private data network",
JOURNAL=ericssont,
NUMBER=2,
YEAR=1974,
KEYWORDS="Computer network; simulation; FORTRAN",
}

@ARTICLE{Fisc74:Waiting,
AUTHOR="M. J. Fischer",
TITLE="The waiting time in the {EK/M/1} queueing system",
JOURNAL=or,
VOLUME=22,
PAGES="898-902",
YEAR=1974,
REFERENCES=3,
KEYWORDS="EK/M/1; waiting time; M/EK/1; comparison; FIFO",
ANNOTE="In a standard M/EK/1 queueing system, the average steady-state
waiting time of an arriving customer decreases monotonically in $k$ for
a fixed arrival and service rate. This note establishes the analogous
result for the dual system Ek/M/1.",
}

@ARTICLE{Fish74:Estimation,
AUTHOR="G. S. Fishman",
TITLE="Estimation in multiserver queueing simulations",
JOURNAL=or,
VOLUME=22,
NUMBER=1,
PAGES="72-78",
YEAR=1974,
REFERENCES=8,
KEYWORDS="Estimation; simulation; GI/G/N",
ANNOTE="This paper presents methods for computing point and interval
estimates of descriptors of simulated queueing systems. The methods,
which rely on the renewal process representation of certain processes,
extend the results of crane and iglehart, and the author. In particular,
the paper shows that computation of three sample quantities suffices to
generate point and interval estimates for twelve system descriptors.",
}

@ARTICLE{Fred74:Buffer,
AUTHOR="G. Fredrikson",
TITLE="Buffer behaviour for binomial input and constant service",
JOURNAL=ieeecom,
VOLUME="COM-22",
PAGES="1862-1866",
NOTE="also 7hth ITC",
YEAR=1974,
KEYWORDS="Queueing system; discrete time analysis",
}

@ARTICLE{Gebh74:Konfidenzintervalle,
AUTHOR="D. Gebhardt",
TITLE="Konfidenzintervalle bei der Warteschlangensimulation",
JOURNAL=aninf,
PAGES="54-",
YEAR=1974,
LANGUAGE="German",
KEYWORDS="Simulation; time series analysis; confidence interval",
}

@INPROCEEDINGS{Gerl74:Cut,
AUTHOR="M. Gerla and H. Frank and Wu Chou and J. Eckl",
TITLE="A Cut Saturation Algorithm for Topological Design of Packet
Switched Communication Networks",
BOOKTITLE=ntc,
PAGES="1074-1085",
YEAR=1974,
REFERENCES=8,
KEYWORDS="Network planning; routing",
ANNOTE="A cut is a set of lines whose removal will disconnect the
network. A cut is saturated if the traffic load in every line of the cut
equals the line's capacity. When traffic load grows, one of the many
cuts approaches to saturation. The only way the network's capacity can
be increased is to increase line capacity or add additional lines to the
cut. The cut saturation method is developed based on the above stated
principle. The problem addressed",
}

@ARTICLE{Gran74:Verkehrsberechnungen,
AUTHOR="C. Grandjean",
TITLE="Verkehrsberechnungen in Nachrichtennetzen mit Leitwegsuche durch
Rundfrage",
JOURNAL=en,
VOLUME=49,
NUMBER=1,
PAGES="18-25",
YEAR=1974,
LANGUAGE="German",
REFERENCES=3,
KEYWORDS="Switching; traffic flow analysis",
ANNOTE="Miltärische Nachrichtennetze bedürfen oft besonderer
Leistungs-merkmale: Teilnehmer mit häufig wechselndem Standort sollen
beiunveränderter Teilnehmernummer stets erreichbar sein; bestimmten
Teilnehmern sollen bevorzugt Verbindungswege geschaltet werden. Durch
diese Leistungsmerkmale bedingte verkehrstheoretische Be-
messungsprobleme werden analytisch gelöst und anhand numerischer
Beispiele diskutiert.",
}

@ARTICLE{Grin74:Queues,
AUTHOR="J. Grinstein and M. Rubinovitch",
TITLE="Queues with random service output: the case of Poisson arrivals",
JOURNAL=jap,
VOLUME=11,
NUMBER=2,
PAGES="771-781",
YEAR=1974,
REFERENCES=11,
KEYWORDS="M/G/1; queue length; waiting time; virtual waiting time; busy
period; variable server",
ANNOTE="A general class of single server queueing models is formulated.
They distinguish between two factors that may influence the duration of
service times: variability in the service requirements of customers, and
variability (over time) in the service output of the server.
Accordingly, we assume that the demands for service of successive
customers from a sequence of independent, identically distributed random
variables and that the amount of servic",
}

@ARTICLE{Groe74:Behaviour,
AUTHOR="Groenendaal and  others",
TITLE="The behaviour of a hold-and-forward concentrator for a type of
dependent interarrival statistics",
JOURNAL=ieeecom,
VOLUME="COM-22",
PAGES="273-",
YEAR=1974,
KEYWORDS="Overflow traffic",
}

@ARTICLE{Harr74:Expected,
AUTHOR="R. J. Harris",
TITLE="The expected number of idle servers in a queueing system",
JOURNAL=or,
VOLUME=22,
PAGES="1258-1259",
YEAR=1974,
REFERENCES=1,
KEYWORDS="GI/G/N; idle period",
ANNOTE="This note derives a simple expression for the expected number of
idle servers in a queue under very general conditions.",
}

@ARTICLE{Harv74:High,
AUTHOR="J. T. Harvey",
TITLE="High-speed m-sequence generation",
JOURNAL=elet,
VOLUME=10,
PAGES="480-481",
YEAR=1974,
KEYWORDS="Shift register sequences",
}

@MANUAL{Hear74:REDUCE,
AUTHOR="A. C. Hearn",
TITLE="{REDUCE} 2, Users manual",
PUBLISHER="University of Utah",
ADDRESS="Utah",
VOLUME="UCP-19",
YEAR=1974,
KEYWORDS="Formula manipulation; LISP; REDUCE",
}

@INPROCEEDINGS{Helm74:Statistical,
AUTHOR="M. Helm",
TITLE="Statistical analysis of simulation results by {UNISIAS}",
BOOKTITLE="COMPSTAT",
YEAR=1974,
KEYWORDS="Simulation; statistics; time series analysis; GPSS",
}

@ARTICLE{Henn74:Wiederholung,
AUTHOR="P. Henneberg",
TITLE="Die Wiederholung von Anrufversuchen als besondere Form der
Wechselwirkung zwischen Fernsprechteilnehmern und Fernmeldenetz",
JOURNAL=fernmelde,
VOLUME=28,
NUMBER=7,
PAGES="1-38",
YEAR=1974,
LANGUAGE="German",
KEYWORDS="Telephony; call reattempt",
}

@ARTICLE{Heym74:Approximation,
AUTHOR="D. P. Heyman",
TITLE="An approximation for the busy period of the {M/G/1} queue using a
diffusion model",
JOURNAL=jap,
VOLUME=11,
PAGES="159-169",
YEAR=1974,
REFERENCES=9,
KEYWORDS="M/G/1; busy period; diffusion approximation",
ANNOTE="A diffusion model for the M/G/1 queue due to d. P. Gaver is used
to obtain an approximation for the density function of the busy period.
The approximation has the same mean and variance as the exact density
function, and can be given explicitly when the service time is constant,
or has a negative exponential or gamma distribution, or is a mixture of
these types.",
}

@ARTICLE{Heym74:Conditional,
AUTHOR="D. P. Heyman and M. Segal",
TITLE="Conditional delays measured in events for the {M/M/C} queue",
JOURNAL=or,
VOLUME=22,
PAGES="575-581",
YEAR=1974,
REFERENCES=3,
KEYWORDS="M/M/N; time in system; conditional distribution",
ANNOTE="In this paper we develop, for the M/M/c queue, recursive
relations for calculating the conditional delays where $t$ is measured
in events rather than in units of time.",
}

@TECHREPORT{Irla74:Simulation,
AUTHOR="M. I. Irland",
TITLE="Simulation of {CIGALE} 1974",
INSTITUTION="CCNG, University of Waterloo",
ADDRESS="Waterloo",
PAGES="5.13-5.19",
YEAR=1974,
REFERENCES=7,
KEYWORDS="Simulation; communication network; CYCLADES; CCNG; computer
communication network group",
ANNOTE={Cigale is the packet-switching communications subnetwork of the
cyclades computer network. The objective of the simulation study was to
observe the behaviour of cigale under "realistic" traffic conditions.
for this purpose the simulation treated 34 hosts representing
time-sharing terminals and servers, as well as remote batch terminals
and servers. attached to seven cigale packet-switches. the traffic load
and its geographical distribution},
}

@BOOK{Klei74:Statistical,
AUTHOR="J. P. Kleijnen",
TITLE="Statistical techniques in simulation",
ISBN="0-8247-6157-X",
PUBLISHER="Marcel Dekker 2 volumes",
ADDRESS="New York",
PAGES="285 + 775",
YEAR=1974,
KEYWORDS="Simulation; random number generation; statistics; output
analysis; antithetic simulation",
}

@ARTICLE{Konh74:Waiting,
AUTHOR="A. G. Konheim and Bernd Meister",
TITLE="Waiting lines and times in a system with polling",
JOURNAL=jacm,
VOLUME=21,
PAGES="470-490",
YEAR=1974,
REFERENCES=4,
KEYWORDS="Queueing system; overhead time; polling; multidrop",
ANNOTE="A communication system consisting of a number of buffers input
terminals connected to a computer by a single channel is analyzed. The
terminals are polled in sequence and the data is removed from the
terminal's buffer. When the buffer has been emptied, the channel, for an
interval of randomly determined length, is used for system overhead
and/or to transmit data to the terminals. The system then continues with
a poll of the next terminal. The",
}

@PHDTHESIS{Lam74:Packet,
AUTHOR="S. S. Lam",
TITLE="Packet switching in a multi-access broadcast channel with
application to satellite communication in a computer network",
SCHOOL="University of California",
ADDRESS="Los Angeles",
PAGES="1-290",
YEAR=1974,
REFERENCES=80,
KEYWORDS="Computer network; packet switching; network stability; network
throughput; network delay; satellite radio; broadcast; communication;
access control; throughput performance; performance evaluation",
ABSTRACT="This dissertation considers a packet switching technique
applicable to packet communication using a satellite or ground radio
channel. The objective of this research is to develop analytic models
for the evaluation and optimization of the system performance in terms
of stability, throughput and delay.",
}

@ARTICLE{Lemo74:Two,
AUTHOR="A. J. Lemoine",
TITLE="On two stationary distributions for the stable {GI/G/1} queue",
JOURNAL=jap,
VOLUME=11,
PAGES="849-852",
YEAR=1974,
REFERENCES=4,
KEYWORDS="GI/G/1; waiting time; queue length; virtual waiting time",
ANNOTE="This paper provides simple proofs of two standard results for
the stable GI/G/1 queue on the structure of the distribution functions
of the stationary virtual waiting time and the stationary queue-length.
Our argument is applicable to more general single server systems than
the queue GI/G/1.",
}

@ARTICLE{Lotz74:DDD,
AUTHOR="A. Lotze",
TITLE="{DDD} network optimization in field engineering - from theory to
application",
JOURNAL=ieeecom,
VOLUME="COM-22",
PAGES="1921-1931",
NOTE="also Proc. 7th ITC, Stockholm, 1973",
YEAR=1974,
KEYWORDS="Circuit switching; network optimization; routing algorithm",
}

@ARTICLE{Low74:Optimal,
AUTHOR="D. W. Low",
TITLE="Optimal dynamic pricing policies for an {M/M/S} queue",
JOURNAL=or,
VOLUME=22,
PAGES="545-561",
YEAR=1974,
REFERENCES=32,
KEYWORDS="M/M/N; optimization; cost; dynamic priority; reward system",
ABSTRACT="We consider the problem of maximizing the long-run average
expected reward per unit time in a queueing-reward system, which we
formulate as a semi-Markov decision process.",
}

@PHDTHESIS{Mass74:Problematik,
AUTHOR="R. Massen",
TITLE="Zur Problematik des fluidischen Rauschens und seiner Anwendung in
der stochastischen Rechentechnik",
SCHOOL="RWTH Aachen",
ADDRESS="Aachen",
YEAR=1974,
LANGUAGE="German",
KEYWORDS="random number generation; stochastic computer",
}

@ARTICLE{Mohr74:Erzeugung,
AUTHOR="K. H. Möhrmann",
TITLE="Erzeugung von binären Quasi-Zufallsfolgen hoher Taktfrequenz
durch Multiplexen",
JOURNAL=siemensfe,
ADDRESS="München",
VOLUME=3,
YEAR=1974,
LANGUAGE="German",
KEYWORDS="random number generation; shift register sequences",
}

@ARTICLE{ODon74:Technical,
AUTHOR="T. M. O'Donovan",
TITLE="Technical notes",
JOURNAL=or,
VOLUME=22,
PAGES="570-575",
YEAR=1974,
REFERENCES=7,
KEYWORDS="M/G/1; service time; rest service time; distribution;
conservation law; SRPT; shortest remaining processing time",
ANNOTE="This paper obtains the distributions of attained and residual
service for a general class of queueing systems. The attained service of
an incompletely serviced job is the portion of its processing time that
it has already been allocated and its residual service is the portion to
be allocated. An expression is found for the average total unfinished
work in the system. Examples of these results are also given.",
}

@ARTICLE{Pack74:Optimum,
AUTHOR="C. D. Pack",
TITLE="The optimum design of a tandem computer buffer in a system for
remote data collection",
JOURNAL=ieeecom,
VOLUME="COM-22",
PAGES="1501-1506",
YEAR=1974,
REFERENCES=8,
KEYWORDS="Buffer memory; M/D/1; comparison; tandem queue; multiplexer",
ANNOTE="It is anticipated that computer-communications systems designed
for the purpose of transmitting data from geographically clustered
terminals to a remote computer will employ multiplexing techniques in
order to reduce transmission costs. A procedure is described for
determining, under three criteria, the optimum computer buffer size
assuming that the data traffic arriving at the multiplexer and data link
(transmission line) can, together, be represented",
}

@ARTICLE{Pang74:Pseudozufallsgenerator,
AUTHOR="H. Pangratz and H. Weinrichter",
TITLE="Pseudozufallsgenerator zur Simulation eines Poisson-Prozesses",
JOURNAL=ntz,
VOLUME=27,
PAGES="325-",
YEAR=1974,
LANGUAGE="German",
KEYWORDS="Shift register sequences; random variate generation",
}

@ARTICLE{Purd74:Queue,
AUTHOR="P. Purdue",
TITLE="The {M/M/1} queue in a Markovian environment",
JOURNAL=or,
VOLUME=22,
PAGES="562-569",
YEAR=1974,
REFERENCES=11,
KEYWORDS="M/M/1; busy period; idle period; Markov process; arrival
process; equilibrium distribution; Markovian queueing system",
ANNOTE="This paper discusses the M/M/1 queue embedded in a Markovian
environment (or, subject to extraneous phase changes). It studies the
busy period, equilibrium conditions, and emptiness probabilities by
using analytic matrix functions, and makes comparisons with the work of
Neuts and of Naor and Yechiali.",
}

@ARTICLE{Ramb74:Approximate,
AUTHOR="J. S. Ramberg and B. W. Schmeiser",
TITLE="An approximate method for generating asymmetric random variates",
JOURNAL=cacm,
VOLUME=17,
YEAR=1974,
KEYWORDS="random number generation",
}

@ARTICLE{Reis74:Accuracy,
AUTHOR="M. Reiser and H. Kobayashi",
TITLE="Accuracy of the diffusion approximation for some queueing
systems",
JOURNAL=ibmjrd,
PAGES="110-",
YEAR=1974,
KEYWORDS="Queueing system",
}

@ARTICLE{Ross74:Bounds,
AUTHOR="S. M. Ross",
TITLE="Bounds on the delay distribution in {GI/G/1} queues",
JOURNAL=jap,
VOLUME=11,
PAGES="417-421",
YEAR=1974,
REFERENCES=5,
KEYWORDS="GI/G/1; inequality; time in system",
ANNOTE="Bounds are obtained for the limiting distribution of the delay
in queue for a GI/G/1 system via martingale theory. These bounds are
somewhat stronger than similar bounds recently obtained by Kingman.",
}

@INPROCEEDINGS{Rudi74:Digital,
AUTHOR="Harry Rudin",
TITLE="The design of digital communication systems: Can traffic theory
help?",
BOOKTITLE="Zürich Seminar",
ADDRESS="Zürich",
YEAR=1974,
KEYWORDS="Data communication; traffic engineering",
}

@PHDTHESIS{Rung74:Berechnung,
AUTHOR="W. Runge",
TITLE="Berechnung und Deutung des stationären und dynamischen Verhaltens
von Bleiakkumulatoren",
SCHOOL="RWTH-Aachen",
ADDRESS="Aachen",
YEAR=1974,
LANGUAGE="German",
KEYWORDS="Hardware device",
ANNOTE="Doktorand Prof. Wasserab, jetzt BBC Mannheim",
}

@ARTICLE{Sahi74:Message,
AUTHOR="K. E. Sahin",
TITLE="Message-based response routing with selcuk networks",
JOURNAL=ieeetc,
VOLUME="C-23",
PAGES="1250-1257",
YEAR=1974,
REFERENCES=6,
KEYWORDS="Message switching; routing algorithm",
ANNOTE={Computer-to-computer communication in a very large net, parallel
processing, and content-based in retrieval associative memories all can
be viewed in a broader context as the broadcast of a
"to-whom-it-may-concern" type message and the subsequent routing of the
response messages to the broadcast source. Simplicity and economies in
logic and memory can be obtained if the routing does not require site
information and is as decentralized as possi},
}

@ARTICLE{Samu74:Characterization,
AUTHOR="S. M. Samuels",
TITLE="A characterization of the Poisson process",
JOURNAL=jap,
VOLUME=11,
PAGES="72-85",
YEAR=1974,
REFERENCES=7,
KEYWORDS="Poisson distribution; renewal process; superposition",
ANNOTE="A necessary and sufficient condition for the superposition of
two ordinary renewal processes to again be renewal process is that they
be poisson processes. A complete proof of this theorem is given; also it
is shown how the theorem follows from the corresponding one for the
superposition of two stationary renewal processes.",
}

@ARTICLE{Sche74:Integriertes,
AUTHOR="K. D. Schenkel",
TITLE="Ein integriertes 300 Mbit/s {ZMX-Nachrichtensystem} mit
dezentraler Vermittlung",
JOURNAL=ntz,
VOLUME=27,
PAGES="283-291",
YEAR=1974,
LANGUAGE="German",
KEYWORDS="LAN",
}

@ARTICLE{Schn74:Struktogramme,
AUTHOR="P. Schnupp",
TITLE="Struktogramme - eine neue Methode der Systemplanung",
JOURNAL="Online",
VOLUME=12,
PAGES="736-743",
YEAR=1974,
LANGUAGE="German",
REFERENCES=14,
KEYWORDS="Software engineering; Top-down design",
}

@ARTICLE{Schw74:Queueing,
AUTHOR="B. L. Schwartz",
TITLE="Queueing models with lane selection: a new class of problems",
JOURNAL=or,
VOLUME=22,
PAGES="331-339",
YEAR=1974,
REFERENCES=3,
KEYWORDS="Queue length; waiting time; GI/G/N; lane selection",
ANNOTE="This paper presents a new class of queueing models. There are N
distinct types of customers and $N$ distinct types of service
facilities. Some customers can be processed at any service facility, but
other customer types can only use selected ones among the
service-facility types.",
}

@ARTICLE{Shan74:Extensions,
AUTHOR="D. N. Shanbhag",
TITLE="Some extensions of Takacs's limit theorems",
JOURNAL=jap,
VOLUME=11,
PAGES="752-761",
YEAR=1974,
REFERENCES=14,
KEYWORDS="GI/G/1; GI/G/N; Takacs; queue length; limited waiting time;
rest service time; limiting distribution",
ANNOTE="In this paper, we establish that if an interarrival time exceeds
a service time with a positive probability then the queueing system
GI/G/S with a finite waiting room always has proper limiting
distributions for its characteristics such as queue length, waiting time
and the remaining service times of the customers being served. The
result remains valid if we consider a GI/G/S system with bounded waiting
times.",
}

@ARTICLE{Walk74:Entwicklung,
AUTHOR="B. Walke",
TITLE="Entwicklung optimaler Zuteilungsstrategien für Rechner-Modelle
durch Simulation und Rechnung",
JOURNAL=er,
VOLUME=16,
NUMBER=1,
PAGES="9-17",
YEAR=1974,
LANGUAGE="German",
REFERENCES=13,
KEYWORDS="Simulation; process management; round robin; exponential
distribution; main memory; overhead time; service time; optimization;
piecewise exponential distribution",
ANNOTE={Die zwei Hauptaufgaben der Betriebsmittelverwaltung sind
Rechnerkernzuteilung und Arbeitsspeicherzuteilung. Es wird fuer ein
Teilnehmerrechensystem gezeigt, wie man Simulation und Rechnung
einsetzen kann, um berechenbare wirklichkeitsnahe Modelle zu entwickeln.
Die Programmbearbeitung ist eine Folge von Transportzeiten und
Rechenzeiten fuer "Teilaufgaben". Von grosser Bedeutung ist die
statistische Verteilung der Rechenzeiten von Teilaufgaben. messkurven},
}

@PHDTHESIS{Weig74:Beitrag,
AUTHOR="W.-D. Weigel",
TITLE="Beitrag zur optimalen Gestaltung des Antriebssystems für ein
Elektrostadtauto",
SCHOOL="RWTH Aachen, Institut für Stromrichtertechnik Prof. Wasserab",
ADDRESS="Aachen",
YEAR=1974,
LANGUAGE="German",
KEYWORDS="Electrotechnics",
}

@MASTERSTHESIS{Witt74:Aufbau,
AUTHOR="K. Witthauer",
TITLE="Aufbau eines Simulationsgerätes zur Darstellung und Untersuchung
von Zufallsnetzwerken",
SCHOOL="RWTH-AC-DFV",
ADDRESS="Aachen",
YEAR=1974,
LANGUAGE="German",
KEYWORDS="Hardware simulator",
}

@ARTICLE{Dirl74:Nicht,
AUTHOR="W. Dirlewanger",
TITLE="Nicht genäherte Berechnung von Verkehrsgrößen für ein
Vermittlungsstellen-Modell ohne Lösung der Gesamtzustandsgleichungen",
JOURNAL=ntz,
VOLUME=27,
NUMBER=4,
PAGES="129-133",
YEAR=1974,
LANGUAGE="German",
REFERENCES=2,
KEYWORDS="Mathematical model; traffic parameter; traffic analysis;
calculation",
ANNOTE="Für ein mathematisches Modell einer Klasse von Vermittlungs-
stellen werden die Verkehrsgrößen ohne Verwendung der Lösungder
Gesamtzustandsgleichungen exakt berechnet.",
}

@TECHREPORT{Kost74:Stochastic,
AUTHOR="L. Kosten",
TITLE="Stochastic theory of a multi-entry buffer I",
TYPE="Delft Progress Report, Series F",
INSTITUTION="University of Delft",
ADDRESS="Delft, Holland",
VOLUME=1,
PAGES="10-18",
YEAR=1974,
REFERENCES=7,
KEYWORDS="Stochastic theory; traffic source model; Poisson process;
M/D/1; statistical multiplexing; buffer dimensioning; eigenvalue;
overflow; asymptotic analysis",
}

@ARTICLE{Burs74:Marking,
AUTHOR="F. Bursik",
TITLE="Marking Processes in the Space Division Switching Network of a
Program Controlled Switching System",
JOURNAL="TESLA Electronics",
VOLUME=1,
PAGES="10-14",
YEAR=1974,
KEYWORDS="Link system",
}

@ARTICLE{Jage74:Properties,
AUTHOR="D. L. Jagerman",
TITLE="Some Properties of the {Erlang} Loss Function",
JOURNAL=bstj,
VOLUME=53,
NUMBER=3,
PAGES="525-551",
YEAR=1974,
KEYWORDS="Loss system",
ANNOTE="Erlang'sche Verlustfunktion, zwei Komplexe Variable,
Poisson-Charlier-Polynom, Fernsprechverkehrstechnik",
}

@ARTICLE{Szyb74:Zur,
AUTHOR="E. Szybicki",
TITLE="Eine Näherungsmethode zur Berechnung der Überlastungsfähigkeit
von Fernsprech-Ortsvermittlungsstellen",
JOURNAL=en,
VOLUME=49,
NUMBER=2,
PAGES="153-160",
YEAR=1974,
LANGUAGE="German",
KEYWORDS="Link system",
ANNOTE="Inhalt: Mathematische Näherungsmethode, Teilnehmerverhalten,
Überlastungsart, analytische Berechnungsmethode",
}

@ARTICLE{Wike74:Subscriber,
AUTHOR="G. Wikell",
TITLE="Subscriber aspects of telex communications",
JOURNAL=tele,
NUMBER=2,
PAGES="29-34",
YEAR=1974,
KEYWORDS="Measurement",
}

@ARTICLE{Abol7401:Class,
AUTHOR="L. M. Abol'nikov and R. M. Yasnogorodskiy",
TITLE="A class of queueing problems with priorities when there are
urgent orders",
JOURNAL=ec,
VOLUME=12,
NUMBER=1,
PAGES="62-72",
MONTH="January/February",
YEAR=1974,
KEYWORDS="Queueing system; priority; analysis",
}

@INPROCEEDINGS{Arna74:Computer,
AUTHOR="A. N. Arnason",
TITLE="Computer generation of Cauchy variates",
BOOKTITLE="4th Manitoba Conference on Numerical Mathematics",
EDITOR="B. L. Hartnell and H. C. Williams",
ADDRESS="Manitoba",
PAGES="171-175",
YEAR=1974,
KEYWORDS="random variate generation",
}

@ARTICLE{Barn74:Note,
AUTHOR="D. R. Barnard and M. N. Cawdery",
TITLE="A note on a new method of histogram sampling",
JOURNAL="Operational Research Quarterly",
VOLUME=25,
NUMBER=2,
PAGES="319-320",
YEAR=1974,
KEYWORDS="random variate generation",
}

@ARTICLE{Chen74:Generating,
AUTHOR="H.-C. Chen and Y. Asau",
TITLE="On generating random variates from an empirical distribution",
JOURNAL="AIIE Transactions",
VOLUME=6,
NUMBER=2,
PAGES="163-166",
YEAR=1974,
KEYWORDS="random variate generation",
}

@ARTICLE{Cran74:Simulating1,
AUTHOR="M. A. Crane and D. L. Iglehart",
TITLE="Simulating stable stochastic systems, {I:} General multiserver
queues",
JOURNAL=jacm,
VOLUME=21,
NUMBER=1,
PAGES="103-113",
YEAR=1974,
KEYWORDS="Simulation; statistical technique",
}

@ARTICLE{Cran74:Simulating2,
AUTHOR="M. A. Crane and D. L. Iglehart",
TITLE="Simulating stable stochastic systems, {II:} Markov chains",
JOURNAL=jacm,
VOLUME=21,
NUMBER=1,
PAGES="114-123",
YEAR=1974,
KEYWORDS="Simulation; statistical technique",
}

@INPROCEEDINGS{Gree74:Fast,
AUTHOR="A. J. Greenwood",
TITLE="A fast generator for gamma-distributed random variables",
BOOKTITLE=compstat,
PUBLISHER="Physica-Verlag",
ADDRESS="Wien",
PAGES="19-27",
YEAR=1974,
KEYWORDS="Random number generation",
}

@ARTICLE{Klim74:Time,
AUTHOR="G. P. Klimov",
TITLE="Time-sharing service systems I",
JOURNAL="Theory of Probability and its Applications",
VOLUME=19,
NUMBER=3,
PAGES="532-551",
YEAR=1974,
KEYWORDS="Queueing system; priority; analysis",
}

@ARTICLE{Koba7402:Application,
AUTHOR="H. Kobayashi",
TITLE="Application of the diffusion approximation to queueing networks
1: Equilibrium queue distributions",
JOURNAL=jacm,
VOLUME=21,
NUMBER=2,
PAGES="316-328",
YEAR=1974,
KEYWORDS="Queueing network; analysis",
}

@ARTICLE{Koba7403:Application,
AUTHOR="H. Kobayashi",
TITLE="Application of the diffusion approximation to queueing networks
2: Nonequilibrium distributions and applications to computer modeling",
JOURNAL=jacm,
VOLUME=21,
NUMBER=3,
PAGES="459-469",
YEAR=1974,
KEYWORDS="Queueing network; analysis",
}

@ARTICLE{Ling74:Comparison,
AUTHOR="R. F. Ling",
TITLE="Comparison of several algorithms for computing sample means and
variances",
JOURNAL="Journal of the American Statistical Association",
VOLUME=69,
NUMBER=348,
PAGES="859-866",
YEAR=1974,
KEYWORDS="Simulation; statistics; numeric calculation",
}

@ARTICLE{Swic74:Letter,
AUTHOR="D. A. Swick",
TITLE="Letter to the Editors concerning [Neave] 1973]",
JOURNAL=as,
VOLUME=23,
NUMBER=2,
PAGES=233,
YEAR=1974,
}

@ARTICLE{Walk74:New,
AUTHOR="A. J. Walker",
TITLE="New fast method for generating discrete random numbers with
arbitrary frequency distributions",
JOURNAL=elet,
VOLUME=10,
NUMBER=8,
PAGES="127-128",
YEAR=1974,
KEYWORDS="random variate generation",
}

@ARTICLE{Whit74:Generating,
AUTHOR="J. Whittaker",
TITLE="Generating gamma and beta random variables with non-integral
shape parameters",
JOURNAL=as,
VOLUME=23,
NUMBER=2,
PAGES="210-214",
YEAR=1974,
KEYWORDS="random variate generation",
}

@INCOLLECTION{Cott74:Computer,
AUTHOR="I. W. Cotton",
TITLE="Computer networks: capabilities and limitations",
BOOKTITLE="Structural Mechanics Computer Programs",
EDITOR="Pilkey and Kurt Rothermel",
PUBLISHER="University Press of Virginia",
ADDRESS="Charlottesville",
PAGES="1043-1056",
NOTE="also in \cite{Abra80:Computer}",
YEAR=1974,
}

@INPROCEEDINGS{Elov74:Computer,
AUTHOR="H. S. Elovitz and C. L. Heitmeyer",
TITLE="What Is a Computer Network?",
BOOKTITLE=ntc,
PAGES="100-1014",
NOTE="also in \cite{Abra80:Computer}",
YEAR=1974,
}

@INCOLLECTION{Fayo74:Stability,
AUTHOR="G. Fayollz and  others",
TITLE="The stability problem of broadcast packet switching computer
networks",
BOOKTITLE="Computer Architectures and Networks",
EDITOR="E. Gelenbe and R. Mahl",
PUBLISHER="North-Holland",
PAGES="135-140",
YEAR=1974,
}

@ARTICLE{Fran74:Properties,
AUTHOR="M. Frank and Wu Chou",
TITLE="Network properties of the {ARPA} computer network",
JOURNAL=networks,
VOLUME=4,
PAGES="213-240",
YEAR=1974,
}

@INPROCEEDINGS{Fras74:Spider,
AUTHOR="A. G. Fraser",
TITLE="Spider-An Experimental Data Communications System",
BOOKTITLE=icc,
PAGES="21F1-21F10",
NOTE="also in \cite{Thur81:Tutorial}",
YEAR=1974,
}

@INCOLLECTION{Frat74:Analytical,
AUTHOR="L. Fratta and U. Montanari",
TITLE="Analytical techniques for computer networks analysis and design",
BOOKTITLE="Computer Architectures and Networks",
EDITOR="E. Gelenbe and R. Mahl",
PUBLISHER="North Holland",
PAGES="155-186",
YEAR=1974,
}

@INCOLLECTION{Kuo74:ALOHA,
AUTHOR="F. F. Kuo",
TITLE="The {ALOHA} broadcast packet communications system",
BOOKTITLE="Computer Architecture and Networks",
EDITOR="E. Gelenbe and R. Mahl",
PUBLISHER="North Holland",
PAGES="275-284",
YEAR=1974,
}

@INCOLLECTION{Mann74:Homogeneous,
AUTHOR="E. Manning",
TITLE="A homogeneous network for data sharing",
BOOKTITLE="Computer Architecture and Networks",
EDITOR="E. Gelenbe and R. Mahl",
PUBLISHER="North Holland",
PAGES="345-354",
YEAR=1974,
}

@INPROCEEDINGS{Opde74:Influence,
AUTHOR="H. Opderbeck and L. Kleinrock",
TITLE="The influence of control procedures on the performance of
packet-switched networks",
BOOKTITLE=ntc,
PAGES="810-817",
NOTE="also in \cite{Abra80:Computer}",
YEAR=1974,
}

@BOOK{Chu74:Advances,
TITLE="Advances in Computer Communication",
EDITOR="Wesley W. Chu",
PUBLISHER="Artech House",
ADDRESS="Boston, Massachusetts",
YEAR=1974,
KEYWORDS="tutorial; computer networks",
}

@BOOK{Gele74:Computer,
TITLE="Computer Architectures and Networks",
EDITOR="E. Gelenbe and R. Mahl",
PUBLISHER="North-Holland",
YEAR=1974,
KEYWORDS="computer networks",
}

@ARTICLE{Pape74:Efficiency,
AUTHOR="U. Pape",
TITLE="Implementation and Efficiency of Moore -- Algorithms for the
Shortest Route Problem",
JOURNAL="Mathematical Programming",
VOLUME=7,
PAGES="212-222",
YEAR=1974,
}

@MISC{Sund74:Review,
AUTHOR="Sundry",
TITLE="Review of Research on Legibility in Childrens Books",
PUBLISHER="National Foundation for Educational Research",
YEAR=1974,
}

@ARTICLE{Besa74:Spatial,
AUTHOR="J. Besag",
TITLE="Spatial interaction and the statistical analysis of lattice
systems",
JOURNAL=jrss,
VOLUME=36,
PAGES="192-236",
YEAR=1974,
ABSTRACT="The formulation of conditional probibility models for finite
systems of spatially interacting random variables is examined. A simple
alternative proof of the Hammersley-Clifford theorem is presented and
the theorem is then used to construct specific spatial schemes on and
off the lattice. Particular emphasis is placed upon practical
amplications of the models in plant ecology when the variates are binary
or Gaussian. Some aspects of infinite lattice Gaussian processes are
discussed. Methods of statistical analysis for lattice schemes are
proposed, including a very flexible coding technique. The methods are
illustrated by 2 numerical examples. It is maintained throughout that
the conditional probability approach to the specification and analysis
of spatial interaction is more attractive than thje alternative joint
probability approach.",
}

@ARTICLE{Feld7404:Decision,
AUTHOR="J. A. Feldman and Y. Yakimovsky",
TITLE="Decision theory and artifical intelligence: a semantic-based
region analyser",
JOURNAL=ai,
VOLUME=5,
NUMBER=4,
PAGES="349-371",
YEAR=1974,
}

@BOOK{Tou74:Pattern,
AUTHOR="J. T. Tou and R. C. Gonzalez",
TITLE="Pattern recognition principles",
PUBLISHER="Addison-Wesley",
YEAR=1974,
}

@ARTICLE{Rubi74:Path,
AUTHOR="I. Rubin",
TITLE="Path Delays in Communication Networks",
JOURNAL="Applied Mathematics and Optimization",
VOLUME=1,
NUMBER=3,
PAGES="193-221",
YEAR=1974,
KEYWORDS="queueing theory",
ABSTRACT="A communication network is modelled by a weighted graph. The
vertices of the graph represent stations with storage capabilities,
while the edges of the graph represent communication channels (or other
information processing media). Channel capacity weights are assigned to
the edges of the network. The network is assumed to operate in a
store-and-forward manner, so that when a channel is busy the messages
directed into it are stored at the station, joining there a queue which
is governed by a first-come, first-served service discipline. Assuming
messages, with fixed length, to arrive at random at the network,
following the statistics of a Poisson point process, we calculate the
statistical characteristics of the message time-delays along a path in a
communication network. We solve for the steady-state distribution of the
message waiting-times along the path, for the distribution of the
overall message-delay, for the average memory size requirements at the
stations, as well as for other statistical characteristics of the
message flow and the queueing process along a communication path.",
}

@BOOK{Dahl74:Numerical,
AUTHOR="Germund Dahlquist and Ake Bjorck",
TITLE="Numerical Methods",
PUBLISHER="Prentice Hall",
PAGES="249-254",
YEAR=1974,
}

@ARTICLE{Ande7403:Simulationsprogramme,
AUTHOR="M. Anderberg and K. M. Olsson",
TITLE="Simulationsprogramme, Simulationsmethode, analytische Methode,
Zufallszahlen",
JOURNAL=ericssonr,
ADDRESS="Sweden",
VOLUME=51,
NUMBER=3,
PAGES="88-97",
YEAR=1974,
LANGUAGE="German",
KEYWORDS="Simulation",
}

@ARTICLE{Szyb7402:Näherungsmethode,
AUTHOR="E. Szybicki",
TITLE="Eine Näherungsmethode zur Berechnung der Überlastungsfähigkeit
vonFernsprech-Ortsvermittlungsstellen",
JOURNAL=en,
ADDRESS="Germany",
VOLUME=49,
NUMBER=2,
PAGES="153-160",
YEAR=1974,
LANGUAGE="German",
KEYWORDS="Mathematische Näherungsmethode; Teilnehmerverhalten;
Überlastungsart; analytische Berechnungsmethode; Link system",
}

@ARTICLE{Alek74:Queueing,
AUTHOR="A. M. Aleksandrov",
TITLE="A Queueing System with Repeated Orders",
JOURNAL=ec,
VOLUME=12,
NUMBER=3,
PAGES="1-4",
YEAR=1974,
KEYWORDS="Queueing system; traffic offered; traffic source",
}

@ARTICLE{Alle7404:Elements,
AUTHOR="A. O. Allen",
TITLE="Elements of Probability for System Design, Part 1",
JOURNAL=ibmsj,
VOLUME=13,
NUMBER=4,
PAGES="325-348",
YEAR=1974,
KEYWORDS="Queueing theory",
}

@ARTICLE{Berr74:Explicit,
AUTHOR="L. T. M. Berry",
TITLE="An Explicit Formula for Dimensioning Links Offered Overflow
Traffic",
JOURNAL=atr,
VOLUME=8,
NUMBER=1,
PAGES="13-17",
YEAR=1974,
KEYWORDS="mathematical analysis; calculation; link system; overflow
traffic",
}

@TECHREPORT{Beye74:Exact,
AUTHOR="J. E. Beyer and N. Keiding and W. Simonsen",
TITLE="The Exact Behaviour of the Maximum Likelihood Estimator in the
Pure Birth Process and the Pure Death Process",
INSTITUTION="Institute of mathematical Statistics, University of
Copenhagen",
PAGES=46,
YEAR=1974,
KEYWORDS="Birth-death process; maximum likelihood estimation",
}

@ARTICLE{Brod7402:Queueing,
AUTHOR="S. M. Brodi and N. D. Shvab",
TITLE="A Queueing System with Different levels of Restrictions on the
Waiting Time",
JOURNAL=ec,
ADDRESS="SU",
VOLUME=12,
NUMBER=2,
PAGES="55-61",
YEAR=1974,
KEYWORDS="Queueing system; waiting time",
ABSTRACT="Time-out",
}

@ARTICLE{Brun74:Scheduling,
AUTHOR="J. Bruno and E. G. Coffman and R. Sethi",
TITLE="Scheduling Independent Tasks to Reduce Mean Finishing Time",
JOURNAL=cacm,
VOLUME=17,
NUMBER=7,
PAGES="382-387",
YEAR=1974,
KEYWORDS="Scheduling; Finish Time",
}

@TECHREPORT{Butt74:Renewal,
AUTHOR="R. W. Butterworth and K. T. Marshall",
TITLE="A Survey of Renewal Theory with Emphasis on Approximations,
Bounds, and Applications",
INSTITUTION="Naval Postgraduate School",
ADDRESS="Monterey, California",
NUMBER="NPS-55BD74051",
PAGES=59,
YEAR=1974,
KEYWORDS="Renewal Process; Approximation; Application",
}

@ARTICLE{Vill74:Roulette,
AUTHOR="J. de Villacian and J. de los",
TITLE="Roulette Model to Simulate Dependent Flows of Speech and
Signalling Traffic",
JOURNAL=ec,
VOLUME=49,
NUMBER=4,
PAGES="424-430",
YEAR=1974,
KEYWORDS="roulette method",
ABSTRACT="Dimensioning a modern telephone system and determining its
traffic handling capacity are amongst the most important problems
confronting the telephone engineer. use of the roulette model to meet
and solve these problems was reported in a previous article but without
reference to preselection and register traffic. Now a fuller use of the
model is considered.",
}

@TECHREPORT{Ever74:Über,
AUTHOR="R. Evers",
TITLE="Über das Verhalten des Fernsprechteilnehmers bei erfolglosen
Anrufversuchen und den Einfluss dieses Verhaltens auf den
Fernsprechverkehr",
INSTITUTION="Heinrich Hertz Institut",
ADDRESS="Berlin, Germany",
NUMBER=171,
PAGES=101,
NOTE="Thesis",
YEAR=1974,
LANGUAGE="German",
KEYWORDS="Traffic source model; call reattempt; subscriber behavior",
}

@ARTICLE{Fred74:Channel,
AUTHOR="G. Fredrikson",
TITLE="Analysis of Channel Utilization in Traffic Concentrators",
JOURNAL=ieeecom,
VOLUME="COM-22",
NUMBER=8,
PAGES="1122-1129",
YEAR=1974,
KEYWORDS="multiserver",
ABSTRACT="The behaviour of line concentrators in a data communication
system has been analyzed for different channel allocation strategies.
The users (terminals) are divided into classes according to their
transmission rate requirements.  The different bit rate classes (BRC)
can be separated by dividing the network into subnets or, alternatively,
they can share one concentrator which forms outgoing channels from a
common quantity of",
}

@ARTICLE{Gers74:Peak,
AUTHOR="S. B. Gershwinm and R. V. Laue and E. Wolman",
TITLE="Peak-Load Traffic Administration of a Rural Multiplexer with
Concentration",
JOURNAL=bstj,
VOLUME=53,
NUMBER=2,
PAGES="261-281",
YEAR=1974,
KEYWORDS="Multiplexer; traffic engineering; peak load; concentrator;
network management",
}

@INCOLLECTION{Gosz74:Stochastic,
AUTHOR="G. Gosztony",
TITLE="Stochastic Service Systems with Two Input Processes and Repeated
Calls (Traffic Engineering of Telex Stations)",
BOOKTITLE="Colloquia Mathematica Societatis János Bolyai",
PUBLISHER="North-Holland",
PAGES="467-492",
YEAR=1974,
KEYWORDS="Communication Network; planning; feedback queue; Telex
network",
}

@ARTICLE{Gosz74:Megismételt,
AUTHOR="G. Gosztony and M. gostházi",
TITLE="A megismételt telefonhivások jellemzö vonásai. (Characteristics
of repeated telephone calls)",
JOURNAL="Beérkezett",
ADDRESS="H",
PAGES="109-119",
YEAR=1974,
LANGUAGE="Hungarian",
KEYWORDS="Arrival Process; Telephony; call reattempt",
}

@ARTICLE{Hans74:Improvements,
AUTHOR="K. H. Hansen and J. Krarup",
TITLE="Improvements of the Keld-Karp Algorithm for the Symmetric
Travelling-Salesman Problem",
JOURNAL="Mathematical Programming",
VOLUME=7,
NUMBER=1,
PAGES="87-96",
YEAR=1974,
KEYWORDS="Optimization; Algorithm",
}

@ARTICLE{Hawk7402:Note,
AUTHOR="D. M. Hawkins",
TITLE="A Note on the Distribution of Times Reported by a Low Resolution
Interval Timer",
JOURNAL="The American Statistician",
VOLUME=28,
NUMBER=2,
PAGES="56-57",
YEAR=1974,
KEYWORDS="Time series analysis",
ABSTRACT="Scanning principle",
}

@ARTICLE{Haye7402:Models,
AUTHOR="J. F. Hayes",
TITLE="Performance Models of an Experimental Computer Communication
Network",
JOURNAL=bstj,
VOLUME=53,
NUMBER=2,
PAGES="225-259",
YEAR=1974,
KEYWORDS="Computer communication; performance evaluation",
ABSTRACT="T1 carrier line",
}

@ARTICLE{Karn7403:Loss,
AUTHOR="M. Karnaugh",
TITLE="Loss of Point-to-Point Traffic in Three-Stage Circuit Switches",
JOURNAL=ibmjrd,
VOLUME=18,
NUMBER=3,
PAGES="204-216",
YEAR=1974,
KEYWORDS="Switching network",
}

@ARTICLE{Kott7408:Begriffe,
AUTHOR="P. Kottik",
TITLE="Begriffe der Kybernetik",
JOURNAL="Österreichische Ingenieur-Zeitschrift",
ADDRESS="Austria",
VOLUME=17,
NUMBER=8,
PAGES="253-261",
YEAR=1974,
LANGUAGE="German",
}

@TECHREPORT{Laur74:General,
AUTHOR="S. L. Lauritzen",
TITLE="General Exponential Models for Discrete Observations",
TYPE="Preprint",
INSTITUTION="Institute of Mathematical Statistics, University of
Copenhagen",
ADDRESS="Copenhagen, Denmark",
NUMBER=10,
PAGES=36,
YEAR=1974,
KEYWORDS="Model",
}

@ARTICLE{LeGa74:Stochastic,
AUTHOR="P. Le Gall",
TITLE="Stochastic Integral Equations Applied to Telecommunications
Traffic without Delay",
JOURNAL="Stochastic Processes and their Applications",
VOLUME=2,
PAGES="261-280",
NOTE="Corrigendum in 6 (1978) 337-338",
YEAR=1974,
KEYWORDS="network; Fortet's equation; GI; Symmetrical networks",
ABSTRACT="Modern telecommunication techniques cast the problem of
traffic handling in the framework of fairly general networks, as applied
to traffic without delay but with virtually arbitrary service-time
distributions.  In this paper we use stochastic integral equations to
deal with the case involving the most general input process and lost
calls.",
}

@ARTICLE{Morg74:Measurement,
AUTHOR="D. E. Morgan and W. Banks and W. Colvin and D. Sutton",
TITLE="A Performance Measurement System for Computer Systems",
JOURNAL="Information Processing",
PUBLISHER="North-Holland",
ADDRESS="Netherlands",
PAGES="29-33",
YEAR=1974,
KEYWORDS="Computer system; performance measurement",
}

@ARTICLE{Naho7402:Stabilization,
AUTHOR="Z. Nahorski and V. V. Vidal",
TITLE="Stabilization of a Linear Discrete-Time System Using Simultaneous
Identification and Control",
JOURNAL="International Journal Control",
VOLUME=19,
NUMBER=2,
PAGES="353-364",
YEAR=1974,
KEYWORDS="Bayes statistics",
ABSTRACT="This paper presents a method for stabilizing a
linear-discrete-time system with unknown constant parameters.
Simultaneous identification and control of the system are considered.
The optimal control strategy is obtained by using the Bayes approach.
Some numerical results are also included.",
}

@TECHREPORT{Nils74:Väntetider,
AUTHOR="A. Nilsson",
TITLE="Väntetider i {G/G/1} System",
INSTITUTION="Tekniska Högskolan i Lund",
ADDRESS="Lund, Sweden",
PAGES=21,
YEAR=1974,
LANGUAGE="Swedish",
KEYWORDS="G/G/1",
}

@TECHREPORT{Nils74:Approximationer,
AUTHOR="A. Nilsson",
TITLE="Approximationer av Väntsystem",
INSTITUTION="Tekniska Högskolan i Lund",
ADDRESS="Lund, Sweden",
PAGES=53,
YEAR=1974,
LANGUAGE="Swedish",
KEYWORDS="Queueing system; approximation",
}

@ARTICLE{Pau74:Applications,
AUTHOR="L. F. Pau",
TITLE="Applications of pattern Recognition to the Diagnosis of Equipment
Failures",
JOURNAL=pattern,
VOLUME=6,
PAGES="3-11",
YEAR=1974,
KEYWORDS="Reliability",
}

@INPROCEEDINGS{Pohl74:Multicyclic,
AUTHOR="P. Pohl",
TITLE="The Multicyclic Vector Method of Generating Pseudo-Random
Numbers. {III.} Optimizing the Generating Process",
BOOKTITLE="Royal Inst. of Tech., Dep. of Inf. Stockholm. Rep.
TRITA-NA-7407. 37",
PAGES=35,
YEAR=1974,
KEYWORDS="random number",
ABSTRACT="KTH",
}

@TECHREPORT{Rahk74:Role,
AUTHOR="K. Rahko",
TITLE="The Role of Telecommunications from the Human Point of View",
INSTITUTION="Helsinki University of Technology, Telecommunication
Laboratory",
ADDRESS="Helsinki, Finland",
NUMBER="4/74",
PAGES=21,
YEAR=1974,
KEYWORDS="Communication",
}

@INCOLLECTION{Reis74:Effects,
AUTHOR="M. Reiser and H. Kobayashi",
TITLE="The Effects of Service Time Distributions on System performance",
BOOKTITLE="Information Processing",
PUBLISHER="North Holland Publishing Company",
ADDRESS="Netherlands",
PAGES="230-234",
YEAR=1974,
KEYWORDS="Queueing system; service time",
}

@ARTICLE{Sole74:Datamaskinsystemer,
AUTHOR="R. R. Solem",
TITLE="Datamaskinsystemer for Trafikk- og Driftskontroll i Telenettet",
JOURNAL="Teletronikk",
ADDRESS="Denmark",
VOLUME=4,
PAGES="323-329",
YEAR=1974,
LANGUAGE="Danish",
KEYWORDS="Network management",
}

@ARTICLE{Sond74:Formulas,
AUTHOR="M. M. Sondhi and B. Gopinath and D. Mitra",
TITLE="Formulas on Queues in Burst Processes - {II}",
JOURNAL=bstj,
VOLUME=53,
NUMBER=3,
PAGES="425-448",
YEAR=1974,
KEYWORDS="video coding",
ABSTRACT="Queues arising in buffers due to either random interruptions
of the channel or variable source rates are analyzed in the framework of
a single digital system.  Two motivating applications are:  (i)
multiplexing of data with speech on telephone channels and (ii)
buffering of data generated by the coding of moving images in
Picturephone service.  In the model a source feeds data to a buffer at a
uniform rate.  The buffer's acce",
}

@ARTICLE{Szyb7402:Determination,
AUTHOR="E. Szybicki",
TITLE="Determination of the Overload Capability of Local Telephone
Systems",
JOURNAL=ec,
ADDRESS="France",
VOLUME=49,
NUMBER=2,
PAGES="170-176",
YEAR=1974,
KEYWORDS="Switching system; overload control",
ABSTRACT="Traffic overloads can seriously impair the traffic handling
capacity of a telephone system, inconveniencing subscribers and cutting
revenue. A mathematical model describing this effect and taking into
account subscriber behavior, type of overload, and system design has now
been devloped. This model enables the most efficient network management
scheme for the system to be determined.",
}

@MISC{Tele74:Sampled,
AUTHOR="I. Telesciences",
TITLE="Sampled Individual Circuit Usage and {PEG} Count {(SICUP),}
Another Autrax Feature",
PUBLISHER="Telesciences",
PAGES=9,
YEAR=1974,
KEYWORDS="traffic measurement",
}

@ARTICLE{Thyr7402:Bayesian,
AUTHOR="P. Thyregod",
TITLE="Bayesian Single Sampling Acceptance Plans for Finite Lot Sizes",
JOURNAL=jrss,
ADDRESS="Great Britain",
VOLUME=36,
NUMBER=2,
PAGES="305-319",
YEAR=1974,
KEYWORDS="Bayes statistics",
}

@TECHREPORT{West74:FRAES,
AUTHOR="J. Wested",
TITLE="{FRAES} - Beskrivelse af Avancerede Algoritmer for Udjævning,
Styring og Interpolation",
INSTITUTION="Elektronikcentralen",
ADDRESS="Denmark",
NUMBER="ECR-39",
PAGES=39,
YEAR=1974,
LANGUAGE="Danish",
}

@ARTICLE{Jage74:Thinning,
AUTHOR="P. Jagers and T. Lindvall",
TITLE="Thinning and Rare Events in Point Processes",
JOURNAL="Zeitschrift Wahrscheinlichkeitstheorie verwandte Gebiete",
ADDRESS="Germany",
VOLUME=28,
PAGES="89-98",
YEAR=1974,
KEYWORDS="Stochastic process",
}

@BOOK{Kram74:Bedienungsmodelle,
AUTHOR="H. Krampe and J. Kubát and W. Runge",
TITLE="Bedienungsmodelle",
PUBLISHER="Verlag Die Wirtschaft Berlin",
ADDRESS="Berlin, Germany",
PAGES=512,
YEAR=1974,
LANGUAGE="German",
REFERENCES=115,
KEYWORDS="Model; queueing system; queueing theory",
ABSTRACT="Grundlagen und Problemstellungen; Analytische Modelle;
Simulationsmodelle; Anwendungen; Erzeugung von Zufallszahlen; VOPS
SIMDIS",
}

@ARTICLE{Klei74:Measured,
AUTHOR="L. Kleinrock and W. E. Naylor",
TITLE="On measured behavior of the {ARPA} network",
JOURNAL=afips,
VOLUME=43,
PAGES="767-780",
YEAR=1974,
REFERENCES=18,
KEYWORDS="ARPAnet; packet switching; performance evaluation;
measurement",
ANNOTE="The purpose of this paper is to present and evaluate the results
of recent measurements of the arpa network.",
}

@ARTICLE{Russ74:Microprocessor,
AUTHOR="P. A. Russo and M. D. Lippman",
TITLE="A microprocessor implementation of a dedicated store-and-forward
data communication network",
JOURNAL=afips,
VOLUME=43,
PAGES="439-445",
YEAR=1974,
KEYWORDS="Microprocessor; store-and-forward; realization",
ANNOTE="In this paper we will describe a dedicated store-and-forward sy
stem that may prove suitable for international data communications. The
system is configured around the rca cosmac lsi microprocessor and the
century data systems cds-110 floppy disc, with suitable disc, keyboard,
display and communications interfaces. The system architecture, disc
interface organization, cosmac microprocessor, data structure and the
system functional capability",
}

@PHDTHESIS{Clar7401:Input,
AUTHOR="D. D. Clark",
TITLE="An Input/Output Architecture for Virtual Memory Computer
Systems",
SCHOOL="Massachusetts Institute of Technology",
ADDRESS="Cambridge, Massachusetts",
MONTH=jan,
YEAR=1974,
}

@ARTICLE{Wilk7401:Problems,
AUTHOR="R. S. Wilkov",
TITLE="Problems in the Design of Remote Terminal Computing Networks",
JOURNAL=ccr,
VOLUME=4,
NUMBER=1,
MONTH=jan,
YEAR=1974,
}

@ARTICLE{Kuo7401:ALOHA,
AUTHOR="F. F. Kuo",
TITLE="The {ALOHA} System",
JOURNAL=ccr,
VOLUME=4,
NUMBER=1,
MONTH=jan,
YEAR=1974,
}

@ARTICLE{Robe7402:Data,
AUTHOR="L. G. Roberts",
TITLE="Data by the Packet",
JOURNAL=ieeespec,
VOLUME="XX",
PAGES="46-51",
MONTH=feb,
YEAR=1974,
}

@ARTICLE{Wink7402:Data,
AUTHOR="S. Winkler and D. Danner",
TITLE="Data Security in the Computer Communication Environment.",
JOURNAL=ieeecomp,
VOLUME=7,
PAGES="23-31",
NOTE="also in \cite{Abra80:Computer}",
MONTH=feb,
YEAR=1974,
}

@TECHREPORT{Koba7402:Bounds,
AUTHOR="H. Kobayashi",
TITLE="Bounds for the Waiting time in Queueing Systems",
INSTITUTION="IBM Research",
ADDRESS="Yorktown Heights, New York",
NUMBER="RC 4718",
PAGES="36 (paper 5)",
DAYS=8,
MONTH=feb,
YEAR=1974,
KEYWORDS="Queueing system; waiting time",
}

@INPROCEEDINGS{Herz74:Analyse,
AUTHOR="U. Herzog and W. Krämer and P. J. Kühn and M. Wizgall",
TITLE="Analyse v. Betriebssystem-Modellen für Rechnersysteme mit
Multiprogramming und Paging",
BOOKTITLE="GI-NTG Fachtagung: Struktur und Betrieb von Rechensystemen'",
ADDRESS="Braunschweig",
PAGES="266-288",
MONTH=mar,
YEAR=1974,
LANGUAGE="German",
KEYWORDS="Data traffic; computer network",
}

@ARTICLE{Mill7404:Jackknife,
AUTHOR="R. G. Miller",
TITLE="The Jackknife - a Review",
JOURNAL=biometrika,
VOLUME=61,
NUMBER=1,
PAGES="1-15",
MONTH=apr,
YEAR=1974,
KEYWORDS="statistics",
ANNOTE="surview of jackknife for bias reduction and interval
estimation.",
}

@ARTICLE{Chou7404:Problems,
AUTHOR="Wu Chou",
TITLE="Problems in the Design of Data Communications Networks",
JOURNAL=ccr,
VOLUME=4,
NUMBER=2,
MONTH=apr,
YEAR=1974,
}

@TECHREPORT{Keid7404:Branching,
AUTHOR="N. Keiding and J. E. Nielsen",
TITLE="Branching Processes with Varying and Random Geometric Offspring
Distributions",
INSTITUTION="Institute of Mathematical Statistics, University of
Copenhagen",
ADDRESS="Copenhagen, Denmark",
NUMBER="Preprint/3",
PAGES=12,
MONTH=apr,
YEAR=1974,
KEYWORDS="Stochastic process",
}

@ARTICLE{Cerf7405:Protocol,
AUTHOR="V. G. Cerf and R. E. Kahn",
TITLE="A Protocol for Packet Network Intercommunication",
JOURNAL=ieeecom,
VOLUME="COM-22",
NUMBER=5,
PAGES="637-648",
NOTE="also in \cite{Abra80:Computer}",
MONTH=may,
YEAR=1974,
}

@ARTICLE{Donn7405:Synchronous,
AUTHOR="R. A. Donnan and J. R. Kersey",
TITLE="Synchronous data link control: a perspective",
JOURNAL=ibmsj,
PAGES="140-162",
NOTE="also in \cite[p. 224-246]{Gree75:Computer}",
MONTH=may,
YEAR=1974,
}

@ARTICLE{Whee7406:Simulation,
AUTHOR="D. J. Wheeler",
TITLE="Simulation of arbitrary gamma distributions",
JOURNAL="AIIE Transactions",
VOLUME=6,
NUMBER=2,
PAGES="167-169",
MONTH=jun,
YEAR=1974,
KEYWORDS="random variate generation",
}

@TECHREPORT{Post7406:Control,
AUTHOR="J. B. Postel",
TITLE="Survey of Network in Control Program in the {ARPA} Computer
Network",
INSTITUTION="MITRE Corporation",
NUMBER="MTR-6722",
MONTH=jun,
YEAR=1974,
}

@INPROCEEDINGS{Jain7406:Models,
AUTHOR="Raj Jain",
TITLE="Models of {LD} Converter for its Automation",
BOOKTITLE="Symposium on Industrial Automation",
ADDRESS="Bangalore",
NOTE="REPORTS (Released for External Distribution)",
MONTH=jun,
YEAR=1974,
}

@ARTICLE{Koba7407:Application,
AUTHOR="H. Kobayashi",
TITLE="Application of the Diffusion Approximation to Queueing Networks
{II:} Nonequilibrium Distributions and Applications to Computer
Modeling",
JOURNAL=jacm,
VOLUME=21,
NUMBER=3,
PAGES="459-469",
MONTH=jul,
YEAR=1974,
KEYWORDS="queueing theory",
ANNOTE="by graphical example, shows that after five time-constants, a
G/G/1 queue has reached steady state",
}

@ARTICLE{Ritc7407:UNIX,
AUTHOR="Dennis M. Ritchie and Ken Thompson",
TITLE="The {UNIX} time-sharing system",
JOURNAL=cacm,
VOLUME=17,
NUMBER=7,
PAGES="365-375",
MONTH=jul,
YEAR=1974,
REFERENCES=10,
KEYWORDS="time-sharing; operating system; file system; command language;
PDP-11; UNIX",
ABSTRACT="UNIX is a general-purpose, multi-user, interactive operating
system for the Digital Equipment Corporation PDP-11/40 and 11/45
computers. It offers a number of features seldom found even in larger
operating systems, including: (1) a hierarchical file system
incorporating demountable volumes; (2) compatible file, device, and
inter-process I/O; (3) the ability to initiate asynchronous processes;
(4) system command language selectable on a per-user basis; (5) over 100
subsystems including a dozen languages. This paper discusses the nature
and implementation of the file system and of the user command
interface.",
}

@ARTICLE{Klei7407:Research,
AUTHOR="L. Kleinrock",
TITLE="Research Areas in Computer Communication",
JOURNAL=ccr,
VOLUME=4,
NUMBER=3,
MONTH=jul,
YEAR=1974,
}

@INCOLLECTION{Voge7407:Automatische,
AUTHOR="Herbert Vogeler",
TITLE="Die automatische Nummernprüfung in der Praxis",
BOOKTITLE="Handbuch der maschinellen Datenverarbeitung (HMD)",
PUBLISHER="Forkel Verlag",
ADDRESS="Stuttgart",
MONTH=jul,
YEAR=1974,
LANGUAGE="German",
REFERENCES=9,
KEYWORDS="checksum; redundancy; zip codes; error detection",
}

@INPROCEEDINGS{Zafi7408:Flexible,
AUTHOR="P. Zafiropulo",
TITLE="Flexible multiplexing for networks supporting line-switched and
packet-switched data traffic",
BOOKTITLE="2nd International Conference on Computer Communications",
ORGANIZATION="IEEE",
ADDRESS="Stockholm, Sweden",
PAGES="517-523",
MONTH=aug,
YEAR=1974,
KEYWORDS="TDMA; integrated services",
ABSTRACT="A data network environment which supports both line-switched
and packet-switched traffic is assumed. The object of this paper is to
describe a novel multiplexing scheme which integrates both traffic types
onto a single line on trunk. A stored program control approach is used
to achieve maximum flexibility in channel speeds, trunk (or line) speeds
and channel combinations. The multiplexor/demultiplexor-hardware
approach is designed to match the flexibility offered by the control.
The integration of line-switched and packet-switched traffic generates a
fundamental synchronization problem. Namely, how does the demultiplexor
detect when a bit changes the type of traffic it carries. The problem is
dealt with. In our opinion, implementation of a solution to this problem
represents the main additional complexity needed to achieve integration
of both traffic types at the multiplexor level. Finally, the impact of
different control configurations on signalling protocols between
multiplexor/demultiplexor pairs (full duplex) is investigated. A
comparison shows which configuration is the most advisable.",
}

@INPROCEEDINGS{Pouz7408:CIGALE,
AUTHOR="L. Pouzin",
TITLE="{CIGALE,} the packet switching machine of the {CYCLADES} computer
network",
BOOKTITLE="IFIP",
ADDRESS="Stockholm",
PAGES="155-159",
MONTH=aug,
YEAR=1974,
}

@TECHREPORT{Herz7408:Remarks,
AUTHOR="U. Herzog",
TITLE="Some Remarks Concerning the Extended Analytic Models for System
Evaluation (X-Model)",
TYPE="Research Report",
INSTITUTION="IBM",
NUMBER="RC 4975",
PAGES=10,
MONTH=aug,
YEAR=1974,
KEYWORDS="Approximation; Queueing Theory; Queueing Network",
ABSTRACT="X-model is a heuristic method which can be used to determine
approximately important system performance parameters of complex
queueing networks, particularly those with nearly exponential servers.
It is shown that certain known results in queueing theory are applicable
(directly, or with some modifications), to this model, resulting in a
better theoretical foundation as well as a broader applicability of the
method.",
}

@ARTICLE{Lygh7409:Speech,
AUTHOR="Evangelo Lyghounis and Isidoro Poretti and Giancarlo Monti",
TITLE="Speech interpolation in digital transmission systems",
JOURNAL=ieeecom,
VOLUME="COM-22",
NUMBER=9,
PAGES="1179-1189",
MONTH=sep,
YEAR=1974,
KEYWORDS="packet voice; digital speech interpolation; DSI; silence
detection; speech transmission",
ABSTRACT="In a telephone conversation a channel is activated by the
voice only 25 percent of the time. It is therefore possible to provide a
number of $m$ connections with a number of $n$ channels, where $n$ is
less than $m$. When the number of connections is large, $m/n$ (gains)
tends to the inverse of the activity. The interpolation procedures used
in overload conditions and the resulting degradations, as well as the
typical circuits of voice interpolation apparatus, are examined. Also,
two very highly interesting developments are herein illustrated, the
ATIC equipment and a single-channel digital speech interpolation (DSI)
developed only for measurement purposes. The results obtained from
measurement studies carried out with the aforementioned apparatus have
enabled the determination of the criteria which must be followed in the
selection of the most suitable interpolation procedures. Besides
examining the complexity and the reliability which the DSI equipment
calls for, it has been possible to analyze the precise working
characteristics under normal operating conditions. The speech detector
should be sensitive to low voice levels, reject Gaussian, impulsive and
low-level tone noise and be simple to implement. Speech activity is
indicated when either the rms value or the number of zero crossings
exceed thresholds (-40 dBm0 for 5 ms or one in 20 ms, respectively). The
zero-crossing detector is activated by an integrator.",
}

@INPROCEEDINGS{Bazl7409:Data,
AUTHOR="D. Bazlen and L. Katzschner and W. Lörcher and H. Weisschuh",
TITLE="Data Switching in an Experimental {PCM} Switching System",
BOOKTITLE=iss,
ADDRESS="München, Germany",
PAGES="233/1-233/9",
MONTH=sep,
YEAR=1974,
REFERENCES=18,
KEYWORDS="Switching network; PCM; multiplexing",
ABSTRACT="This paper proposes a new structure of a patially integrated
digital switching network for data and telephone traffic (PINDATE). A
hierarchical network is considered as an example. The structure regards
the fact that even in the 1980's the number of data subscribers will be
only some percent of the number of telphone subscribers. This
communications network is based on the CCITT 30/32 PCM-systems.",
}

@ARTICLE{Ramb7409:Algorithm,
AUTHOR="J. S. Ramberg and P. R. Tadikamalla",
TITLE="An algorithm for generating gamma variates based on the Weibull
distribution",
JOURNAL="AIIE Transactions",
VOLUME=6,
NUMBER=3,
PAGES="257-260",
MONTH=sep,
YEAR=1974,
}

@INPROCEEDINGS{Vadu7409:Computer,
AUTHOR="I. Vaduva",
TITLE="On computer generation of gamma random variables by rejection and
composition procedures",
BOOKTITLE="5th Conference on Probability Theory",
EDITOR="B. Bereanu and M. Iosifescu and P. Popescu",
ADDRESS="Brasov",
PAGES="131-142",
MONTH=sep,
YEAR=1974,
KEYWORDS="random variate generation",
}

@ARTICLE{Gave7409:Exception,
AUTHOR="D. P. Gaver and Pierre Lewis and G. S. Shedler",
TITLE="Analysis of Exception Data in a Staging Hierarchy",
JOURNAL=ibmjrd,
PAGES="423-435",
MONTH=sep,
YEAR=1974,
KEYWORDS="Computer performance; modeling",
ABSTRACT="Paging",
}

@ARTICLE{Chu7410:Optimal,
AUTHOR="Wesley W. Chu",
TITLE="Optimal Message Block Size for Computer Communications with Error
Detection and Retransmission Strategies",
JOURNAL=ieeecom,
VOLUME="COM-22",
NUMBER=10,
PAGES="1516-1525",
MONTH=oct,
YEAR=1974,
REFERENCES=9,
KEYWORDS="Queueing theory",
ABSTRACT="Error detection and retransmission are used as error control
in many computer communication systems. In these systems, random length
messages are partitioned into fixed size blocks for ease in data
handling and memory management. A mathematical model is developed in
this paper to determine the optimal message block size that minimizes
the expected waiting time in retransmission and acknowledgement delay
and thus maximizes channel efficiency. The model considers two classes
of error detection and retransmission strategies: 1) stop-and-wait and
2) continuous transmissions. Using the relationships among
acknowledgement time, channel transmission rate, channel error
characteristics (random error or burst error), average message length,
optimal block size are computed from the model and presented in graphs.
The model and the graphs should be useful as a guide in the selection of
the optimal fixed message block size for computer communication
systems.",
}

@ARTICLE{Fras7410:Loop,
AUTHOR="A. G. Fraser",
TITLE="Loop Transmission Systems for Data",
JOURNAL=ccr,
VOLUME=4,
NUMBER=4,
MONTH=oct,
YEAR=1974,
}

@ARTICLE{Rubi7411:Communication,
AUTHOR="I. Rubin",
TITLE="Communication Networks: Message Path Delays",
JOURNAL=ieeeit,
VOLUME="IT-20",
NUMBER=6,
PAGES="738-745",
MONTH=nov,
YEAR=1974,
KEYWORDS="queueing theory",
ABSTRACT="A communication network is modeled by a weighted graph. The
vertices of the graph represent stations with storage capabilities,
while the edges of the graph represent communication channels (or other
information processing media). Channel capacity weights are assigned to
the edges of the network. The network is assumed to operate in a
store-and-forward manner, so that when a channel is busy the messages
directed into it are stored at the station, where it joins a queue that
is governed by a first-come first-served (FIFO, FCFS) service
discipline. Assuming that fixed-length messages arrive at random at the
network, following the statistics of a Poisson point process, we solve
for the steady-state distributions of the message overall delay time,
for the average message waiting times at the individual stations, for
the average memory size requirements at the stations, as well as for
other statistical characteristics of the message flow along a
communication path.",
}

@ARTICLE{Bran7411:Model,
AUTHOR="A. Brandwajn",
TITLE="A model of a time sharing virtual memory system solved using
equivalence and decomposition methods",
JOURNAL=acta,
VOLUME=4,
PAGES="11-47",
MONTH=nov,
YEAR=1974,
}

@ARTICLE{Hsu7412:Buffer,
AUTHOR="J. Hsu",
TITLE="Buffer Behavior with Poisson Arrival and Geometric Output
Processes",
JOURNAL=ieeecom,
VOLUME="COM-22",
NUMBER=12,
PAGES="1940-1941",
MONTH=dec,
YEAR=1974,
KEYWORDS="discrete time queues",
ABSTRACT="A discrete buffered system with infinite buffer size, Poisson
arrival process, and the output channel available only periodically
according to a geometric density function is analyzed. Under the
assumption that a stochastic equilibrium is reached, the $Z$ transform
of the density function of the buffer occupancy is obtained as the
result of this study.",
}

@ARTICLE{Bren7412:Algorithm,
AUTHOR="R. P. Brent",
TITLE="Algorithm 488: A {Gaussian} pseudo-random number generator
{[G5]}",
JOURNAL=cacm,
VOLUME=17,
NUMBER=12,
PAGES="704-706",
MONTH=dec,
YEAR=1974,
KEYWORDS="random variate generation",
}

@ARTICLE{Wall7412:Computer,
AUTHOR="N. D. Wallace",
TITLE="Computer generation of gamma random variates with non-integral
shape parameters",
JOURNAL=cacm,
VOLUME=17,
NUMBER=12,
PAGES="691-695",
MONTH=dec,
YEAR=1974,
KEYWORDS="random variate generation",
}