@BOOK{Bril75:Time,
AUTHOR="D. R. Brillinger",
TITLE="Time Series: Data Analysis and Theory",
PUBLISHER="Holt, Rinehart and Winston",
ADDRESS="New York, New York",
YEAR=1975,
}

@ARTICLE{Burk7507:Delays,
AUTHOR="P. J. Burke",
TITLE="Delays in Single-Server Queues with Batch Input",
JOURNAL=or,
VOLUME=23,
NUMBER=4,
PAGES="830-833",
MONTH="July--August",
YEAR=1975,
KEYWORDS="queueing theory; Laplace transform",
ANNOTE="Laplace transform of delay due to customers in same batch served
prior to randomly selected customer. For first customer in batch, delay
equals that of non-batch queue with service time equal to total service
demand of a batch.",
}

@BOOK{Karl75:First,
AUTHOR="Samuel Karlin and Howard M. Taylor",
TITLE="A First Course in Stochastic Processes",
EDITION="2nd",
PUBLISHER="Academic Press",
ADDRESS="San Diego, California",
YEAR=1975,
KEYWORDS="stochastic processes; probability theory",
}

@BOOK{Klei75:Queueing,
AUTHOR="L. Kleinrock",
TITLE="Queueing Systems --- Theory",
PUBLISHER="Wiley-Interscience",
ADDRESS="New York, New York",
VOLUME=1,
YEAR=1975,
KEYWORDS="queueing theory",
}

@ARTICLE{Mill7511:Note,
AUTHOR="L. W. Miller",
TITLE="A Note on the Busy Period of an {$M/G/1$} Finite Queue",
JOURNAL=or,
VOLUME=23,
NUMBER=6,
PAGES="1179-1182",
MONTH="November--December",
YEAR=1975,
KEYWORDS="queueing theory",
}

@BOOK{Nije75:Combinatorial,
AUTHOR="Albert Nijenhuis and Herbert S. Wilf",
TITLE="Combinatorial Algorithms",
PUBLISHER="Academic Press",
ADDRESS="New York, New York",
YEAR=1975,
}

@BOOK{Spie75:Theory,
AUTHOR="Murray R. Spiegel",
TITLE="Theory and Problems of Probability and Statistics",
PUBLISHER="McGraw-Hill",
ADDRESS="New York, New York",
YEAR=1975,
KEYWORDS="probability theory; statistics",
}

@BOOK{Whit75:Queueing,
AUTHOR="J. A. White and J. W. Schmidt and G. K. Bennett",
TITLE="Analysis of Queueing Systems",
PUBLISHER="Academic Press",
ADDRESS="New York, New York",
YEAR=1975,
KEYWORDS="queueing theory",
}

@ARTICLE{Kell75:Networks,
AUTHOR="F. P. Kelly",
TITLE="Networks of Queues with Customers of Different Types",
JOURNAL=jap,
VOLUME=12,
PAGES="542-554",
YEAR=1975,
}

@INPROCEEDINGS{Forg75:Speech,
AUTHOR="James W. Forgie",
TITLE="Speech transmission in packet-switched store-and-forward
networks",
BOOKTITLE=ncc,
ORGANIZATION="afips",
PAGES="137-142",
YEAR=1975,
KEYWORDS="packet voice",
ABSTRACT="The purpose of this paper is to discuss the technical problems
which must be overcome if satisfactory speech communication is to be
achieved in a packet-switched network. The paper is semi-tutorial in
nature and attempts to provide some background for those who may be
unfamiliar with the nature of the speech communication process and/or
the characteristics of packet-switched networks. In addition to a
statement of the problem, the paper concludes with some requirements
which the author feels must be met by networks if they are to support
speech communication.",
}

@BOOK{Lins75:Delphi,
TITLE="The Delphi Method: Techniques and Applications",
EDITOR="H. A. Linstone and M. Turoff",
PUBLISHER="Addison-Wesley",
ADDRESS="Reading, Massachusetts",
YEAR=1975,
KEYWORDS="Delphi method; computer conferencing",
}

@BOOK{Mosc75:Linear,
AUTHOR="George S. Moschytz",
TITLE="Linear Integrated Networks Design",
PUBLISHER="Van Nostrand Reinhold",
ADDRESS="New York",
YEAR=1975,
}

@INPROCEEDINGS{Shol75:Software,
AUTHOR="H. A. Sholl and T. L. Booth",
TITLE="Software performance modelling using computation structures",
BOOKTITLE="1st National Conference on Software Engineering",
ADDRESS="Washington, DC",
PAGES="82-88",
YEAR=1975,
REFERENCES=8,
KEYWORDS="Performance evaluation; software; model; multiprocessing",
ANNOTE="An engineering-oriented performance model of a computation is
developed by extending the concept of a computation structure to cover
the performance costs appropriate to software modelling. The model
allows both serial and parallel (multiprocessor) configurations, and the
evaluation of both time and space parameters for alternate realizations.
A brief discussion on the use of the model as a mechanism to guide the
performance optimization of pro",
}

@ARTICLE{Taka75:Combinatorial,
AUTHOR="L. Takacs",
TITLE="Combinatorial and analytic methods in the theory of queues",
JOURNAL=aap,
VOLUME=7,
PAGES="607-635",
YEAR=1975,
REFERENCES=85,
KEYWORDS="Method; survey; bibliography; combinatorial method; first",
ANNOTE="The paper is a survey of the solutions of various first-passage
time problems in the theory of queues.",
}

@ARTICLE{Toba75:Packet,
AUTHOR="F. A. Tobagi and L. Kleinrock",
TITLE="Packet switching in radio channels: part {II} the hidden terminal
problem in carrier sense multiple-access and the busy-tone solution",
JOURNAL=ieeecom,
VOLUME="COM-23",
PAGES="1417-1433",
YEAR=1975,
REFERENCES=6,
KEYWORDS="broadcast; communication; packet switching; busy sense",
ANNOTE={We consider a population of terminals communicating with a
central station over a packet-switched multiple-access radio channel.
The performance of carrier sense multiple access (CSMA) used as a method
for multiplexing these terminals is highly dependent on the ability of
each terminal to sense the carrier of any other transmission on the
channel. Many situations exist in which some terminals are "hidden" from
each other (either because they are},
}

@ARTICLE{Vauc75:Comparison,
AUTHOR="J. G. Vaucher and P. Duval",
TITLE="A comparison of simulation event list algorithms",
JOURNAL=cacm,
VOLUME=18,
YEAR=1975,
KEYWORDS="simulation; event list control; time control",
}

@ARTICLE{Wu75:Loop,
AUTHOR="R. M. Wu and Yunfei Chen",
TITLE="Analysis of a loop transmission system with round-robin schedulin
g of services",
JOURNAL=ibmjrd,
VOLUME=19,
PAGES="486-493",
YEAR=1975,
REFERENCES=6,
KEYWORDS="M/M/1; cyclic; round robin; ring network",
ANNOTE="A finite population, multi-queue model is developed for a loop
transmission system. Approximate expressions for the state transition
matrix and other system variables are derived in recursive forms. It is
also shown that a number of useful system parameters such as average
message response time, average cycle time, and average response time
conditioned on message length, can be obtained. The analytical results
have been validated by simulation.",
}

@ARTICLE{Wyma75:Improved,
AUTHOR="F. P. Wyman",
TITLE="Improved event-scanning mecahnisms for discrete event
simulation",
JOURNAL=cacm,
VOLUME=18,
YEAR=1975,
KEYWORDS="Simulation; time control",
}

@ARTICLE{Yuva75:Gathering,
AUTHOR="G. Yuval",
TITLE="Gathering run-time statistics without black magic",
JOURNAL=spe,
VOLUME=5,
PAGES="105-108",
YEAR=1975,
REFERENCES=6,
KEYWORDS="Performance evaluation; fundamentals in statistics",
ANNOTE="It is shown that it is possible to gather run-time statistics
from a program without either slowing it down too much, or changing
things such as the hardware or the operating-system kernel.",
}

@ARTICLE{Chow75:Central,
AUTHOR="W.-M. Chow",
TITLE="Central Server Model for Multiprogrammed Computer Systems with
Different Classes of Jobs",
JOURNAL=ibmjrd,
ADDRESS="New York, New York",
PAGES="314-320",
YEAR=1975,
REFERENCES=6,
KEYWORDS="Central server; model; imbedded Markov chain",
ABSTRACT="This paper investigates the stationary behaviour of a single
server queue with different classes of jobs. It is assumed that theinput
process has state-dependent exponential inter-arrival times and
preemptions at the server are not allowed. The exact solution is
obtained by finding the relationship between the time average and the
departure average probability distribution. The latter can be derived,
based upon an imbedded Markov chain.",
}

@ARTICLE{ORei75:Series,
AUTHOR="J. J. O'Reilly",
TITLE="Series-parallel generation of m-sequences",
JOURNAL="The Radio and Electronic Engineer",
VOLUME=45,
NUMBER=4,
PAGES="171-176",
YEAR=1975,
REFERENCES=9,
KEYWORDS="M-sequence",
ANNOTE="An equivalence class of machines is identified which generate
maximal length sequences as a non-overlapping series of k-bit words.
This is achieved at the expense of a k-fold increase in combinational
logic but with no increase in the number of storage elements required.",
}

@ARTICLE{Piep75:Optimal,
AUTHOR="W. F. Piepmeier",
TITLE="Optimal Balancing of {I/O} Requests to Disks",
JOURNAL=cacm,
VOLUME=18,
NUMBER=9,
PAGES="524-527",
YEAR=1975,
REFERENCES=5,
KEYWORDS="Analysis; queueing theory; queueing system; model; disk",
}

@ARTICLE{Reis75:Horner,
AUTHOR="M. Reiser and H. Kobayashi",
TITLE="Horner's Rule for the Evaluation of General Closed Queueing
Networks",
JOURNAL=cacm,
VOLUME=18,
NUMBER=10,
PAGES="592-593",
YEAR=1975,
REFERENCES=8,
KEYWORDS="Closed queueing network; algorithm; evaluation",
ANNOTE="An algorithm is given which makes it possible to solve
separableclosed queueing networks independent from the size of the
network. The algorithm does not show a combinatorial operation count, it
is based on a generalization of horner's rule for polynomials. Also is
shown how mean queue size and throughput can be obtained at negligible
extra cost once the normalization constant is evaluated.",
}

@ARTICLE{Aldi75:Spektrale,
AUTHOR="M. Aldinger and D. Herold and W. Krick",
TITLE="Spektrale Spreizung als Multiplex-Verfahren",
JOURNAL=ntz,
VOLUME=28,
PAGES="379-",
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Spread spectrum",
}

@ARTICLE{Ball75:High,
AUTHOR="E. Ball and  Spittle and Chun-Hung Richard Lin",
TITLE="High-speed m-sequence generation",
JOURNAL=elet,
VOLUME=11,
PAGES="107-",
YEAR=1975,
KEYWORDS="Shift register sequences; high speed",
}

@ARTICLE{Beja75:Optimal,
AUTHOR="A. Beja and E. Sid",
TITLE="Optimal priority assignment with heterogeneous waiting costs",
JOURNAL=or,
VOLUME=23,
PAGES="107-117",
YEAR=1975,
REFERENCES=9,
KEYWORDS="Queueing system; priority; HOL priority; M/G/1; cost
function",
}

@ARTICLE{Bene75:Group,
AUTHOR="V. E. Benes",
TITLE="Toward a group-theoretic proof of the rearrangeability theorem
for Clos' network",
JOURNAL=bstj,
PAGES="797-805",
YEAR=1975,
REFERENCES=7,
KEYWORDS="Switching network",
}

@ARTICLE{Bene75:Queues,
AUTHOR="V. E. Benes",
TITLE="On queues with Poisson arrivals",
JOURNAL=ams,
VOLUME=28,
PAGES="670-677",
YEAR=1975,
REFERENCES=16,
KEYWORDS="M/G/1; fifo",
ANNOTE="The system to be studied consists of a service unit and a queue
of customers waiting to be served. Service-times of customers are
independent, non-negative variates with the common distributi on $b(ny)$
having a finite first moment $b\_1$. Customers arrive in a poisson
process (see Feller (4), p.364) of intensity $\lambda$; they form a
queue and are served in order of arrival, with no defections from the
queue.",
}

@ARTICLE{Berg75:Technique,
AUTHOR="R. D. Bergeron and H. R. Bulterman",
TITLE="A technique for evaluation of user systems of an {IBM} {S/370}",
JOURNAL=spe,
VOLUME=5,
PAGES="83-92",
YEAR=1975,
REFERENCES=9,
KEYWORDS="Tuning; software; resource; performance measurement;
optimization",
ANNOTE="The analysis and optimization of user systems can be simplified
considerably by identifying commonly required evaluation facilities and
implementing these facilities in a system-independent manner. This paper
examines existing techniques and describes a system, the ssd evaluation
system, designed and implemented by the authors of an IBM System/370 for
the purpose of monitoring the performance of applications systems.",
}

@ARTICLE{Cegr75:Routing,
AUTHOR="T. Cegrell",
TITLE="A Routing Procedure for the {TIDAS} Message-Switching Network",
JOURNAL=ieeecom,
VOLUME="COM-23",
PAGES="575-585",
YEAR=1975,
REFERENCES=11,
KEYWORDS="Packet switching; network; routing algorithm",
ANNOTE="In this paper an investigation of some routing methods suitable
for a special computer communication network called TIDAS-T, in which
the traffic exchange is done according to the store and forward
message-switching technique, is elucidated.",
}

@ARTICLE{Chan75:Parametric,
AUTHOR="K. M. Chandy and U. Herzog and L. Woo",
TITLE="Parametric analysis of queueing networks",
JOURNAL=ibmjrd,
PAGES="36-42",
YEAR=1975,
KEYWORDS="Queueing system; exponential queueing network",
ANNOTE={We consider a queueing network with $M$ exponential service
stations and with $N$ customers. We study the behavior of a subsystem
delta, which has a single node as input and a single node as output,
when the subsystem parameters are varied. An "equivalent" network is
constructed in which all queues except those in subsystem delta are
replaced by a single composite queue. We show that for certain classes
of system parameters, the behavior of subsyst},
}

@ARTICLE{Chan75:Approximate,
AUTHOR="K. M. Chandy and U. Herzog and L. Woo",
TITLE="Approximate analysis of general queueing networks",
JOURNAL=ibmjrd,
VOLUME=19,
PAGES="43-49",
YEAR=1975,
REFERENCES=9,
KEYWORDS="Queueing network; performance evaluation",
ANNOTE="An approximate iterative technique for the analysis of complex
queueing networks with general service times is presented. The technique
is based on an application of norton's theorem from electrical circuit
theory to queueing networks which obey local balance. The technique
determines approximations of the queue length and waiting time
distributions for each queue in the network. Comparisons of results
obtained by the approxhmate meod with simu",
}

@ARTICLE{Chyu75:Routing,
AUTHOR="D. H. Chyung and M. R. Sudhakar",
TITLE="A routing algorithm for computer communication networks",
JOURNAL=ieeecom,
VOLUME="COM-23",
PAGES="1371-1373",
YEAR=1975,
REFERENCES=7,
KEYWORDS="computer network; routing algorithm; packet switching",
ANNOTE="A new algorithm for routing data packets in networks of
computers connected by communication links is given. It is shown that
considerable savings in required storage capacity can be obtained by
adopting the proposed algorithm as compared to earlier known
algorithms.",
}

@ARTICLE{Diet75:Verkehrsmodell,
AUTHOR="G. Dietrich",
TITLE="Verkehrsmodell für zentralgesteuerte Vermittlungssysteme",
JOURNAL=en,
VOLUME=50,
NUMBER=1,
PAGES="30-36",
YEAR=1975,
LANGUAGE="German",
REFERENCES=9,
KEYWORDS="Switching system; modeling; queueing theory",
}

@ARTICLE{Dirl75:Schnelle,
AUTHOR="W. Dirlewanger",
TITLE="Schnelle Berechnung von Verkehrsgrößen für Vermittlungsstellen
anhand eines Modells",
JOURNAL=ntz,
VOLUME=28,
PAGES="381-",
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Queueing system; circuit switching; SPC; switching system",
}

@ARTICLE{Eier75:Anwendung,
AUTHOR="R. Eier and H. Malleck",
TITLE="Anwendung von Multiplextechniken bei der Erzeugung von schnellen
Pseudozufallsfolgen",
JOURNAL=ntz,
VOLUME=28,
PAGES="227-231",
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Shift register sequences",
}

@ARTICLE{Ferg75:Control,
AUTHOR="M. J. Ferguson",
TITLE="On the control, stability, and waiting time in a slotted {ALOHA}
random-access system",
JOURNAL=ieeecom,
VOLUME="COM-23",
PAGES="1306-1311",
YEAR=1975,
REFERENCES=12,
KEYWORDS="ALOHA; broadcast; communication; network stability; waiting
time; random multiple access",
ANNOTE="This concise paper explores some of the boundaries in
performance of slotted ALOHA systems by analyzing a simple and almost
optimal centrally supervised control. Our control results in a very
simple Markov chain model and allows an examination of stability,
conditional waiting time distribution of transmitting terminals, and
many other system measures. The key to the simplicity is to have a
probability of successful packet transmission that is",
}

@ARTICLE{Ferr75:General,
AUTHOR="D. Ferrari and Minkui Liu",
TITLE="A general-purpose software measurement tool",
JOURNAL=spe,
VOLUME=5,
PAGES="181-192",
YEAR=1975,
REFERENCES=6,
KEYWORDS="Performance evaluation; interactive mode; software monitor;
measurement tool; measurement; checkpointing technique",
ANNOTE="A software measurement tool designed for the users of prime, an
interactive system being developed, is presented. The tool, called smt,
allows its user to instrument a program, modify by a pre-existing
instrumentation and specify how the collected data are to be reduced by
typing in a few simple commands. The user can also write his own
measurement routines, which specify the actions to be taken at event
detection time, and submit them to the",
}

@ARTICLE{Fred75:Pseudo,
AUTHOR="S. A. Fredricsson",
TITLE="Pseudo-random properties of binary shift register sequences",
JOURNAL=ieeeit,
PAGES="115-",
YEAR=1975,
KEYWORDS="Shift register sequences",
}

@ARTICLE{Hart75:Digitale,
AUTHOR="H. L. Hartmann",
TITLE="Digitale Kommunikationsnetze",
JOURNAL="Mitteilungen der Technischen Universität Carolo-Wilhelmina zu
Braunschweig",
ADDRESS="Braunschweig",
VOLUME=10,
NUMBER=1,
PAGES="30-42",
YEAR=1975,
LANGUAGE="German",
REFERENCES=23,
KEYWORDS="digital network; survey; communication network; TDMA; time
division multiple access; space division multiplex; Telex network",
ANNOTE="übersichtsaufsatz über verschiedene digitalnetze.",
}

@ARTICLE{Hube75:Simple,
AUTHOR="J. Huber and A. Shoch",
TITLE="Simple ansynchronous multiplex system for unidirectional low data
rate transmission",
JOURNAL=ieeecom,
VOLUME="COM-23",
PAGES="675-679",
YEAR=1975,
KEYWORDS="LAN",
}

@ARTICLE{Ille75:Struktur,
AUTHOR="K. Illenberger and P. Salminger",
TITLE="Struktur und Wirkungsweise einer programmierten Steuerung in
Datenstationen",
JOURNAL=ntz,
VOLUME=28,
PAGES="K214-",
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Microcontroller; terminal",
}

@INPROCEEDINGS{Irla75:Queueing,
AUTHOR="M. I. Irland",
TITLE="Queueing analysis of a buffer allocation scheme for a packet
switch",
BOOKTITLE=ntc,
ADDRESS="New Orleans",
PAGES="1-6",
YEAR=1975,
REFERENCES=7,
KEYWORDS="Packet switching; queueing system; buffer length; loss system;
ccng=computer communication network group",
ANNOTE="A finite storage, loss discipline, model for a single packet
switch with restricted buffer sharing is introduced. The stable state
solution is obtained using the local balance approach (in z-transform
form in the general case, and explicitly in the case of only two output
links).",
}

@TECHREPORT{Irla75:Simulation,
AUTHOR="M. I. Irland",
TITLE="Simulation of {CIGALE} - report on assumptions and results",
INSTITUTION="Computer communication network group, University of
Waterloo",
ADDRESS="Waterloo, Canada",
NUMBER="E-32",
PAGES="1-54",
YEAR=1975,
REFERENCES=7,
KEYWORDS="Cyclades; simulation; performance evaluation",
ABSTRACT="1.  introduction, 2.  cigale network, 3.  simulation
description, 4.  simulation results, 5.  observations and conclusions",
}

@TECHREPORT{Irla75:Cigale,
AUTHOR="M. I. Irland",
TITLE="Simulation of cigale --- 1975 progress report: phase I",
INSTITUTION="Computer Communication Network Group, University of
Waterloo",
ADDRESS="Waterloo, Canada",
PAGES="1-27",
YEAR=1975,
KEYWORDS="Simulation; Cigale",
}

@INPROCEEDINGS{Kay75:GPSS,
AUTHOR="I. M. Kay and T. M. Kisko and D. E. Van Houweling",
TITLE="{GPSS/SIMSCRIPT} - the dominant simulation languages",
BOOKTITLE="8th annual simulation symposium",
ADDRESS="Tampa, Florida",
YEAR=1975,
KEYWORDS="Simulation; GPSS; Simscript",
}

@BOOK{Keil75:Green,
AUTHOR="Julian Keilson",
TITLE="Green's function methods in probability theory",
SERIES="Griffin's statistical monographs and courses",
PUBLISHER="Charles Griffin",
ADDRESS="London",
VOLUME=17,
PAGES="1-220",
YEAR=1975,
REFERENCES=70,
KEYWORDS="Probability; statistics; Markov process; Green function;
lattice process",
}

@ARTICLE{Kern75:System,
AUTHOR="B. W. Kernighan and L. L. Cherry",
TITLE="A system for typesetting mathematics",
JOURNAL=cacm,
VOLUME=18,
PAGES="151-157",
YEAR=1975,
REFERENCES=7,
KEYWORDS="Design; realization; command language; graphics language; text
processing; graphics; interactive mode",
ANNOTE="This paper describes the design and implementation of a system
for typesetting mathematics. The language has been designed to be easy
to learn and to use by people (for example, secretaries and mathematical
typists)who know neither mathematics nor typesetting. Experience
indicates that the language can be learned in an hour or so, for it has
few rules and fewer exceptions. For typical expressions, the size and
font changes, positioning, line",
}

@TECHREPORT{Klar75:Mikroprogrammierung,
AUTHOR="R. Klar and H. Wichmann",
TITLE="Mikroprogrammierung",
INSTITUTION="Arbeitsbericht des IMMD",
ADDRESS="Erlangen",
VOLUME=8,
NUMBER=3,
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Microprogramming",
}

@ARTICLE{Klau75:Wie,
AUTHOR="J. Klaus",
TITLE="Wie funktioniert der {IEC-Bus?}",
JOURNAL="Elektronik",
NUMBER="4/5",
PAGES="72-",
YEAR=1975,
LANGUAGE="German",
KEYWORDS="IEC bus",
}

@ARTICLE{Klei75:Packet,
AUTHOR="L. Kleinrock and S. S. Lam",
TITLE="Packet switching in a multiaccess broadcast channel: performance
evaluation",
JOURNAL=ieeecom,
VOLUME="COM-23",
PAGES="410-422",
YEAR=1975,
REFERENCES=31,
KEYWORDS="Packet switching; busy sense multiple access; broadcast;
communication; performance evaluation",
ANNOTE={In this paper, the rationale and some advantages for
multi-access broadcast packet communication using satellite and ground
radio channels are discussed. A mathematical model is formulated for a
"slotted aloha" random access system. Using this model, a theory is put
forth which gives a coherent qualitative interpretation of the system
stability behavior which leads to the definition of a stability measure.
Quantitative estimates for the relativ},
}

@ARTICLE{Klei75:PacketSwitching,
AUTHOR="L. Kleinrock and F. A. Tobagi",
TITLE="Packet switching in radio channels: part I carrier sense
multiple-access modes and their throughput-delay characteristics",
JOURNAL=ieeecom,
VOLUME="COM-23",
PAGES="1400-1416",
YEAR=1975,
REFERENCES=19,
KEYWORDS="broadcast; communication; packet switching; network
throughput; network delay; busy sense multiple access",
ANNOTE="Radio communication is considered as a method for providing
remote terminal access to computers. Digital byte streams from each
terminal are partitioned into packets (blocks) and transmitted in a
burst mode over a shared radio channel. When many terminals operate in
this fashion, transmission may conflict with and destroy each other. A
means for controlling this is for the terminal to sense the presence of
other transmissions; this leads to",
}

@TECHREPORT{Kram75:Untersuchung,
AUTHOR="W. Krämer",
TITLE="Untersuchung von Systemen mit seriellem Warten",
TYPE="UniS-IND-Bericht",
INSTITUTION="University of Stuttgart",
ADDRESS="Stuttgart, Germany",
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Queueing system",
}

@BOOK{Krug75:Simulation,
AUTHOR="S. Kr ger",
TITLE="Simulation",
PUBLISHER="W. de Gruyter Verlag",
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Simulation",
}

@MISC{Kuhn75:Approximationsverfahren,
AUTHOR="P. J. Kühn",
TITLE="Approximationsverfahren für {VF} mit Hilfe der ersten Momente",
ADDRESS="Stuttgart",
NOTE="Personal communication to FSchr 06.08.75",
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Queueing system; RNG",
}

@ARTICLE{Kuhn75:Multi,
AUTHOR="P. J. Kühn",
TITLE="On multi-queue delay systems with gradings",
JOURNAL=aeu,
VOLUME=29,
PAGES="53-",
YEAR=1975,
KEYWORDS="Queueing system",
ANNOTE="also ITC 7, Stockholm, 1973",
}

@ARTICLE{Lam75:Packet,
AUTHOR="S. S. Lam and L. Kleinrock",
TITLE="Packet switching in a multiaccess broadcast channel: dynamic
control procedures",
JOURNAL=ieeecom,
VOLUME="COM-23",
PAGES="891-904",
YEAR=1975,
REFERENCES=16,
KEYWORDS="broadcast; communication; packet switching; dynamic resource
allocation",
ANNOTE="In this paper, a Markovian decision model is formulated for the
dynamic control of unstable slotted aloha systems and optimum decision
rules are found. Numerical results on the performance of controlled
channels are shown for three specific dynamic channel control
procedures. Several practical control schemes are also proposed and
their performance compared through simulation. These dynamic control
procedures have been found to be not only",
}

@ARTICLE{Lang75:Two,
AUTHOR="M. Langenbach-Belz",
TITLE="Two-stage queuing system with sampled parallel input queues",
JOURNAL=er,
VOLUME=17,
PAGES="71-",
YEAR=1975,
KEYWORDS="Queueing system",
ANNOTE="also ITC 7, Stockholm",
}

@ARTICLE{Lars75:Approximating,
AUTHOR="R. E. Larson",
TITLE="Approximating the performance of urban emergency service
systems",
JOURNAL=or,
VOLUME=23,
PAGES="845-868",
YEAR=1975,
REFERENCES=23,
KEYWORDS="Queueing system; M/M/N; random choice; server hunting
strategy",
}

@ARTICLE{Lave75:Regenerative,
AUTHOR="S. S. Lavenberg and D. R. Slutz",
TITLE="Regenerative simulation of a queueing model of an automated tap
library",
JOURNAL=ibmjrd,
VOLUME=19,
PAGES="463-475",
YEAR=1975,
REFERENCES=15,
KEYWORDS="Simulation; survey; M/G/1; two-sample problem; independent
cycles",
ANNOTE="Recently, techniques have been developed for estimating
confidence intervals when simulating stochastic systems having a
regenerative structure. These techniques are applied to the simulation
of a queueing model of a computer system's automated tape library.
Theoretical and practical issues related to the application of these
techniques are addressed. An interesting feature of the automated tape
library represented in the queueing model is that",
}

@ARTICLE{Lave75:IntroductionRegenerative,
AUTHOR="S. S. Lavenberg and D. R. Lut",
TITLE="Introduction to regenerative simulation",
JOURNAL=ibmjrd,
VOLUME=19,
PAGES="458-463",
YEAR=1975,
REFERENCES=18,
KEYWORDS="Simulation; two-sample problem; independent cycles; Queueing
network",
ANNOTE="A recently developed method for estimating confidence intervals
when simulating stochastic systems having a regenerative structure is
reviewed. The paper is basically tutorial, but also considers the
pragmatic issue of the simulation duration required to obtain valid
estimates. The method is illustrated in terms of simulating the M/G/1
queue. Analytic results for the M/G/1 queue are used to determine the
validity of the simulation results.",
}

@ARTICLE{Law75:Efficient,
AUTHOR="A. M. Law",
TITLE="Efficient estimators for simulated queueing systems",
JOURNAL=ms,
VOLUME=22,
YEAR=1975,
KEYWORDS="Regenerative simulation; statistics; time series analysis;
independent cycles; interdependence; moment estimation; variance;
method; comparison; M/M/2; M/G/1; GI/G/1; GI/G/2; tandem queue; variance
reduction",
ABSTRACT="In this paper we consider efficient estimators for simulated
queueing systems. It is shown to be more efficient to estimate all of
the usual first moment measures of performance from an estimate of mean
delay in queue than to estimate them directly. For single-server queues
an estimator is introduced which is more efficient than the normal
estimator of mean delay in queue.",
}

@ARTICLE{Lawr75:Access,
AUTHOR="D. H. Lawrie",
TITLE="Access and Alignment of Data in an Array Processor",
JOURNAL=ieeetc,
VOLUME="C-24",
NUMBER=12,
PAGES="1145-1155",
YEAR=1975,
REFERENCES=25,
KEYWORDS="Interconnection Network",
}

@ARTICLE{Malc75:Local,
AUTHOR="M. A. Malcolm and R. B. Simpson",
TITLE="Local versus global strategies for adaptive quadrature",
JOURNAL=toms,
VOLUME=1,
PAGES="126-146",
YEAR=1975,
REFERENCES=12,
KEYWORDS="Numerical integration; algorithm",
ANNOTE="A study has been made for two alternative subinterval selection
strategies for adaptive quadrature. The more commonly used is termed a
local acceptance criterion (as in SQUANK), and the other is termed a
global acceptance criterion (as in AIND). An efficient programming
technique for the global alternative is given, and an analytic model for
predicting the subinterval distributions selected by classes of adaptive
algorithms is developed.",
}

@ARTICLE{Mark75:Preemptive,
AUTHOR="B. I. Marks and R. V. Janc and N. T. Thomopoulus",
TITLE="A preemptive priority radio net queueing model",
JOURNAL=ieeecom,
VOLUME="COM-23",
PAGES="1311-1315",
YEAR=1975,
REFERENCES=6,
KEYWORDS="broadcast; communication; PREHOL priority; queueing system",
ANNOTE="A single-frequency radio net system having two-level preemptive
priority is analyzed in the steady state. Negative exponential traffic
statistics are assumed and unlimited queue length allowed. Closed-form
solutions are obtained for a number of performance measures which
characterize the operation from the system, and station points of
view.",
}

@ARTICLE{Moor75:Approximating,
AUTHOR="S. C. Moore",
TITLE="Approximating the behavior of nonstationary single-server
queues",
JOURNAL=or,
VOLUME=23,
PAGES="1011-1032",
YEAR=1975,
REFERENCES=24,
KEYWORDS="Queueing theory; M/Ek/1; instationary process; queueing
approximation; MX/Ek/1; simulation; single server",
ANNOTE="This paper presents computationally efficient techniques for
approximating several behavioral aspects of the MX(T)/EGAMMA/1 qu eue.
The non-stationary arrival stream allows demands for servi ce to follow
different distributions over different time intervals.",
}

@ARTICLE{Nest75:Erzeugung,
AUTHOR="S. Nestel",
TITLE="Die Erzeugung von Pseudozufallsprozessen zur Simulation von
Nachrichtensignalen",
JOURNAL="Frequenz",
VOLUME=29,
PAGES="268-",
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Rng",
}

@ARTICLE{Pack75:Output,
AUTHOR="C. D. Pack",
TITLE="The output of an {M/D/1} queue",
JOURNAL=or,
VOLUME=23,
PAGES="750-760",
YEAR=1975,
REFERENCES=13,
KEYWORDS="Queueing theory; M/D/1; interdeparture time; output process",
ABSTRACT="In this paper we investigate the output process of the M/D/1
queueing system.  We derive expressions for the distributions and first
two moments, in both steady-state and transient conditions, of the
following random variables: (1) The time until the $N$th departure
measured from a departure epoch, $T\_0$, (2) The time between the
$N-1$st and $N$th departures after $T\_0$, and (3) The number of
departures in $(T\_0,T\_0+T]$.",
}

@PHDTHESIS{Pang75:Aufbau,
AUTHOR="H. Pangratz",
TITLE="Aufbau von genauen Zufallsereignisgeneratoren durch die
Zusammenschaltung elementarer Zufallselemente",
SCHOOL="TU Wien",
ADDRESS="Vienna, Austria",
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Shift register sequences; random number generator",
}

@TECHREPORT{Pang75:Schneller,
AUTHOR="H. Pangratz and H. Weinrichter",
TITLE="Schneller dezimaler Pseudozufallsgenerator mit guten
Korrelationseigenschaften",
INSTITUTION="Institut für Datenverarbeitung und NF-Technik Wien",
ADDRESS="Wien",
YEAR=1975,
LANGUAGE="German",
REFERENCES=8139,
KEYWORDS="Shift register sequences; RNG",
}

@ARTICLE{Reyn75:Queue,
AUTHOR="G. H. Reynolds",
TITLE="An M/M/m/n queue for the shortest distance priority machine
interference problem",
JOURNAL=or,
VOLUME=23,
PAGES="325-341",
YEAR=1975,
KEYWORDS="Queueing system; M/M/N/S",
}

@ARTICLE{Rose75:Approximate,
AUTHOR="M. Rosenshine and Madhavi Chandra",
TITLE="Approximate solutions for some two-stage tandem queues, part 1:
individual arrivals at the second stage",
JOURNAL=or,
VOLUME=23,
NUMBER=6,
PAGES="1155-1166",
YEAR=1975,
REFERENCES=10,
KEYWORDS="Tandem queue; queueing approximation; simulation",
ANNOTE="The analysis of tandem queues in which the output of each stage
immediately becomes the input to the next is quite difficult. Although
the analytic solution for the steady-state departure distribution from
an M/M/N queue is well-known and that of an M/G/1 queue can be obtained
if the analyst is willing to view it through a 'Laplacian curtain', the
list of existing analytic solutions is not long. Approximation
techniques are beginning to emerge.",
}

@TECHREPORT{Savi75:Preemptive,
AUTHOR="D. Savir",
TITLE="Preemptive-resume priority queues with overhead",
TYPE="IBM technical report",
INSTITUTION="IBM system communications division",
ADDRESS="Research Triangle Park, North Carolina",
NUMBER="TR 29.0142",
PAGES="1-85",
YEAR=1975,
REFERENCES=9,
KEYWORDS="Overhead time; priority; PREHOL priority; waiting time; number
of elements in system; preemptive resume queue; changeover time",
ANNOTE="Effects of supervisor overhead in preemptive-resume queues are
studied. Characteristics distinguishing it from preemptive-resume are:
if a customer is preempted during service, an overhead period $m$
follows during which his functions are put away. Before resumption of
his service, an overhead period $w$ occurs during which his functions
are restored; if a priority level is preempted during overhead, the $m$
or $w$ period terminates normally without",
}

@ARTICLE{Sche75:Queueing,
AUTHOR="R. Schehrer",
TITLE="On a queueing problem in {TDMA} networks",
JOURNAL=aeu,
VOLUME=29,
PAGES="62-",
YEAR=1975,
KEYWORDS="circuit switching; queueing system; TDMA; time division
multiple access",
ANNOTE="also ITC 7, 1973",
}

@BOOK{Shan75:Systems,
AUTHOR="R. E. Shannon",
TITLE="Systems simulation, the art and science",
ISBN="0-13-881839-8",
PUBLISHER="Prentice-Hall, Inc.",
ADDRESS="Englewood Cliffs, New Jersey",
YEAR=1975,
KEYWORDS="Simulation; random number generation; output analysis",
ANNOTE="1. Fundamentals of modeling 2. Systems investigation 3. Model
translation 4. Design of computer simulation experiments 5. Tactical
planning 6. Validation and analysis 7. Management aspects",
}

@ARTICLE{Surb75:Verschachtelte,
AUTHOR="F. Surböck and H. Weinrichter",
TITLE="Verschachtelte Struktur periodischer Binärfolgen mit irreduziblen
Generatorpolynomen",
JOURNAL=aeu,
VOLUME=29,
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Shift register sequences",
}

@ARTICLE{Walk75:Verdr,
AUTHOR="B. Walke",
TITLE="Verdrängende Arbeitsspeicher-Belegungsstrategie zur
Durchsatzsteigerung von Rechenanlagen",
JOURNAL=er,
VOLUME=17,
PAGES="171-176",
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Queueing system; performance evaluation; preemptive priority",
}

@ARTICLE{Wein75:Verw,
AUTHOR="H. Weinrichter",
TITLE="Verwürfelung binärer Projektionen von Markoff-Ketten in
rückgekoppelten linearen Schieberegistern",
JOURNAL=aeu,
VOLUME=29,
PAGES="349-",
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Shift register sequences",
}

@BOOK{Kuhn75:Wirksamkeit,
AUTHOR="P. J. Kühn and M. Langenbach-Belz",
TITLE="Über die Wirksamkeit zyklischer Abfertigungsstrategien in
Realzeitsystemen",
SERIES="Lecture Notes in Mathematics and Computer Science",
PUBLISHER="Springer-Verlag",
YEAR=1975,
LANGUAGE="German",
REFERENCES=13,
KEYWORDS="Cyclic service; queueing system; delay time; analysis; loss
probability; real time; computer system",
ANNOTE="Es werden 3 verschiedene zyklische Abfertigungsstrategien bzgl.
ihrer Wirksamkeit untersucht und anderen bekannten Strategien
vergleichend gegenübergestellt. Es wird auf prakt.
Anwendungs-möglichkeiten sowie auf exakte und approximative
Lösungsverfah-ren hingewiesen.",
}

@BOOK{Cinl75:Stochastic,
AUTHOR="E. Cinlar",
TITLE="Introduction to stochastic processes",
ISBN="0-13-498089-1",
PUBLISHER="Prentice Hall, Englewood Cliffs, New Jersey",
PAGES=402,
YEAR=1975,
REFERENCES=37,
KEYWORDS="Stochastic process; poisson process; Markov chain; Markov
process; renewal process",
}

@ARTICLE{Bhan75:Memory,
AUTHOR="D. P. Bhandarkar",
TITLE="Analysis of Memory Interference in Multiprocessors",
JOURNAL=ieeetc,
VOLUME="C-24",
NUMBER=9,
PAGES="897-908",
YEAR=1975,
KEYWORDS="Multiprocessor system; memory interference; analysis;
performance evaluation",
}

@ARTICLE{Fory75:Trunk,
AUTHOR="L. J. Forys and E. J. Messerli",
TITLE="Analysis of Trunk Groups Containing Short-Holding-Time Trunks",
JOURNAL=bstj,
VOLUME=54,
NUMBER=6,
PAGES="1127-1153",
YEAR=1975,
KEYWORDS="Loss system",
ANNOTE="Verkehrstheorie, Leitungsgruppen, fehlerhafte Leitungen,
Auswahlverfahren, Blockierung",
}

@ARTICLE{Half75:Approximate,
AUTHOR="S. Halfin",
TITLE="An Approximate Method for Calculating Delays for a Family of
Cyclic-Type Queues",
JOURNAL=bstj,
VOLUME=54,
NUMBER=10,
PAGES="1733-1754",
YEAR=1975,
KEYWORDS="Delay system",
ANNOTE="Verkehrstheorie, Warteschlangen, Wartezeit, Tastenwahl",
}

@ARTICLE{Heym75:Diffusion,
AUTHOR="D. P. Heyman",
TITLE="A Diffusion Model Approximation for the {GI/G/1} Queue in Heavy
Traffic",
JOURNAL=bstj,
VOLUME=54,
NUMBER=9,
YEAR=1975,
KEYWORDS="Delay system",
}

@ARTICLE{Honi75:Macro,
AUTHOR="G. Honi",
TITLE="Some Macro-Models for Discussung Repeated Call Attempts",
JOURNAL="Budavox Telecommunication Review",
VOLUME=2,
PAGES="21-39",
YEAR=1975,
KEYWORDS="Loss system",
ANNOTE="Verkehrstheorie-Modell, Dämpfungskoeffizient, nicht zustande
gekommene Verbindungen, Zustan dsgleichungsmethode,",
}

@ARTICLE{Peir75:Note,
AUTHOR="L. Peiram",
TITLE="A Note on the Distribution of the Number of Scans between
Successive Calls when Scanning a Poisson Call Arrival Process",
JOURNAL=ericssont,
NUMBER=4,
PAGES="210-215",
YEAR=1975,
KEYWORDS="Gos",
}

@ARTICLE{Ruba75:Gradings,
AUTHOR="J. Rubas",
TITLE="Survey of gradings and interconnecting schemes",
JOURNAL="The Telecommunication Journal of Australia",
VOLUME="jun",
YEAR=1975,
KEYWORDS="Grading",
}

@ARTICLE{Sche75:Elementare,
AUTHOR="R. Schehrer",
TITLE="Elementare Herleitung des Streuwertes von Überlaufverkehr hinter
Koppelanordnungen mit Poisson-Angebot",
JOURNAL=aeg,
ADDRESS="Ulm",
VOLUME=48,
NUMBER="2/3",
PAGES="95-99",
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Overload control; flow control; communication network",
ANNOTE="Inhalt: Vollkommene Erreichbarkeit, Unvollkommene
Erreichbarkeit, Wartesystem, keine Transformation",
}

@ARTICLE{West75:Distribution,
AUTHOR="S. Westerberg",
TITLE="The Distribution of the Number of Scans Between Successive Calls
when Scanning a Poisson Call Arrival Process",
JOURNAL=ericssont,
VOLUME=31,
NUMBER=1,
PAGES="37-53",
YEAR=1975,
KEYWORDS="Measurement",
ANNOTE="Inhalt: Abtastanzahlverteilung, aufeinanderfolgende Anrufe,
Poissonverteilung, ankommende Anrufe",
}

@ARTICLE{Baba75:Generalized,
AUTHOR="J. M. Babad",
TITLE="A generalized multi-entrance time-sharing priority queue",
JOURNAL=jacm,
VOLUME=22,
NUMBER=2,
PAGES="231-247",
YEAR=1975,
KEYWORDS="Queueing system; priority; analysis",
}

@ARTICLE{Bowm75:Pitfalls,
AUTHOR="K. O. Bowman and J. J. Beauchamp",
TITLE="Pitfalls with some gamma variate simulation routines",
JOURNAL="Journal of Statistical Computation and Simulation",
VOLUME=4,
NUMBER=2,
PAGES="141-154",
YEAR=1975,
KEYWORDS="random variate generation",
}

@ARTICLE{Chay75:Using,
AUTHOR="S. C. Chay and R. D. Fardo and M. Mazumdar",
TITLE="On using the Box-Muller transformation with multiplicative
congruential pseudo-random number generators",
JOURNAL=as,
VOLUME=24,
NUMBER=1,
PAGES="132-135",
YEAR=1975,
KEYWORDS="random variate generation",
}

@ARTICLE{Chen75:Queueing,
AUTHOR="Pi-Chun Chen",
TITLE="Queueing network model of interactive computing systems",
JOURNAL=ieeeproc,
VOLUME=63,
NUMBER=6,
PAGES="954-957",
YEAR=1975,
}

@ARTICLE{Cour75:Error,
AUTHOR="P.-J. Courtois",
TITLE="Error analysis in nearly-completely decomposable stochastic
systems",
JOURNAL="Econometrica",
VOLUME=43,
NUMBER=4,
PAGES="691-709",
YEAR=1975,
KEYWORDS="Decomposition; stochastic system",
}

@ARTICLE{Cran7501:Simulating,
AUTHOR="M. A. Crane and D. L. Iglehart",
TITLE="Simulating stable stochastic systems, {III:} Regenerative
processes and discrete-event simulations",
JOURNAL=or,
VOLUME=23,
NUMBER=1,
PAGES="33-45",
YEAR=1975,
KEYWORDS="Simulation; statistical technique",
}

@ARTICLE{Cran7511:Simulating,
AUTHOR="M. A. Crane and D. L. Iglehart",
TITLE="Simulating stable stochastic systems, {IV:} Approximation
techniques",
JOURNAL="Management Science, Series A (Theory)",
VOLUME=21,
NUMBER=11,
PAGES="1215-1224",
YEAR=1975,
KEYWORDS="Simulation; statistical technique",
}

@ARTICLE{Fran75:Comparison,
AUTHOR="M. A. Franklin and A. Sen",
TITLE="Comparison of exact and approximate variate generation methods
for the {Erlang} distribution",
JOURNAL="Journal of Statistical Computation and Simulation",
VOLUME=4,
NUMBER=1,
PAGES="1-18",
YEAR=1975,
KEYWORDS="random variate generation",
}

@ARTICLE{Gay75:Composite,
AUTHOR="T. W. Gay and P. H. Seaman",
TITLE="Composite priority queue",
JOURNAL=ibmjrd,
VOLUME=19,
NUMBER=1,
PAGES="78-81",
YEAR=1975,
KEYWORDS="Queueing system; priority; analysis",
}

@ARTICLE{Jona75:Algorithm,
AUTHOR="A. Jonassen and O.-J. Dahl",
TITLE="Analysis of an algorithm for priority queue administration",
JOURNAL="BIT",
VOLUME=15,
NUMBER=4,
PAGES="409-422",
YEAR=1975,
KEYWORDS="Simulation; event set",
}

@INPROCEEDINGS{Kind75:Computer,
AUTHOR="A. J. Kinderman and J. F. Monahan and J. G. Ramage",
TITLE="Computer generation of random variables with normal and Student's
t distributions",
BOOKTITLE="Annual Meeting of the American Statistical Association",
ADDRESS="Atlanta",
PAGES="128-131",
YEAR=1975,
KEYWORDS="random variate generation",
}

@ARTICLE{Leta75:Building,
AUTHOR="G. Letac",
TITLE="On building random variables of a given distribution",
JOURNAL=aap,
VOLUME=3,
NUMBER=2,
PAGES="298-306",
YEAR=1975,
KEYWORDS="random variate generation",
}

@ARTICLE{Munt75:Analytic,
AUTHOR="R. R. Muntz",
TITLE="Analytic modeling of interactive systems",
JOURNAL=ieeeproc,
VOLUME=63,
NUMBER=6,
PAGES="946-953",
YEAR=1975,
KEYWORDS="Queueing network; analysis",
}

@INPROCEEDINGS{Pati75:Chance,
AUTHOR="G. P. Patil and M. T. Boswell and D. S. Friday",
TITLE="Chance mechanisms in computer generation of random variables",
BOOKTITLE="NATO Advanced Study Institute",
EDITOR="G. P. Patil and S. Kotz and J. K. Ord",
ADDRESS="Calgary",
VOLUME=2,
PAGES="37-50",
YEAR=1975,
KEYWORDS="random variate generation",
}

@ARTICLE{Port75:Random,
AUTHOR="T. Porter and I. Simon",
TITLE="Random insertion into a priority queue structure",
JOURNAL=ieeese,
VOLUME="SE-1",
NUMBER=3,
PAGES="292-298",
YEAR=1975,
KEYWORDS="Simulation; event set",
}

@ARTICLE{Tadi75:Approximate,
AUTHOR="P. R. Tadikamalla and J. S. Ramberg",
TITLE="An approximate method for generating gamma and other variates",
JOURNAL="Journal of Statistical Computation and Simulation",
VOLUME=3,
NUMBER=3,
PAGES="275-282",
YEAR=1975,
KEYWORDS="random variate generation",
}

@ARTICLE{Whee75:Approximation,
AUTHOR="D. J. Wheeler",
TITLE="An approximation for simulation of gamma distributions",
JOURNAL="Journal of Statistical Computation and Simulation",
VOLUME=3,
NUMBER=3,
PAGES="225-232",
YEAR=1975,
KEYWORDS="random variate generation",
}

@ARTICLE{Kuck75:Anwendung,
AUTHOR="C. Kuck",
TITLE="Anwendung wahrscheinlichkeitstheoretischer Verfahren bei der
Strukturplanung für Betriebssysteme",
JOURNAL=aninf,
VOLUME=5,
NUMBER=75,
PAGES="179-188",
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Operating system",
ANNOTE="Gesamthochschule Paderborn.",
}

@INCOLLECTION{Cerf75:Assessment,
AUTHOR="V. G. Cerf",
TITLE="An assessment of {ARPANET} protocols",
BOOKTITLE="Network systems and software",
SERIES="Infotech State of the Art Reports",
PUBLISHER="Infotech",
ADDRESS="Maidenhead, England",
PAGES="461-478",
YEAR=1975,
}

@INPROCEEDINGS{Chou75:Unified,
AUTHOR="Wu Chou and P. V. McGregoe",
TITLE="A unified simulation model for communication processors",
BOOKTITLE="Symposium on Computer Networks",
PAGES="40-46",
YEAR=1975,
}

@INPROCEEDINGS{Fuch75:Two,
AUTHOR="K. Fuchal and S. Heller",
TITLE="Two dissimilar networks - is marriage possible?",
BOOKTITLE="Symposium on Computer Networks",
PAGES="19-24",
YEAR=1975,
}

@ARTICLE{IBM75:IBM,
AUTHOR="I. B. M",
TITLE="{IBM} System/360 Operating System Telecommunications Access
Method {(TCAM):} Concepts and Facilities",
EDITOR="P. E. Green and R. W. Lucky",
JOURNAL=comcom,
INSTITUTION="IBM Report",
PAGES="304-317",
NOTE="also IBM Manual Program No. 3605-CQ-548",
YEAR=1975,
}

@INCOLLECTION{Kirs75:Present,
AUTHOR="P. T. Kirstein",
TITLE="A survey of present and planned general purpose European data and
computer networks",
BOOKTITLE="Computer Communication Networks",
EDITOR="R. L. Grimsdale and F. F. Kuo",
PUBLISHER="Noordhoof",
YEAR=1975,
}

@INPROCEEDINGS{Livi75:Self,
AUTHOR="H. E. Livings and U. W. Pooch",
TITLE="Self adaptive teleprocessing network design",
BOOKTITLE="Symposium on Computer Networks",
VOLUME=5,
PAGES="55-60",
YEAR=1975,
}

@INPROCEEDINGS{Mora75:Hybrid,
AUTHOR="D. M. Moran and O. Starkson",
TITLE="A Hybrid Communications Switching System",
BOOKTITLE="Electronics Components Conference",
PAGES="30-36",
NOTE="also in \cite{Thur81:Tutorial}",
YEAR=1975,
}

@INPROCEEDINGS{Pouz75:CYCLADES,
AUTHOR="L. Pouzin",
TITLE="The {CYCLADES} network-present state and development trends",
BOOKTITLE="Symposium on Computer Networks",
PAGES="8-13",
YEAR=1975,
}

@INPROCEEDINGS{Robe75:TELENET,
AUTHOR="L. G. Roberts",
TITLE="{TELENET:} Principles and Practice",
BOOKTITLE="European Conference on Communication Networks",
PAGES="315-329",
YEAR=1975,
}

@INPROCEEDINGS{Wood75:Capabilities,
AUTHOR="D. C. Wood",
TITLE="A survey of the capabilities of 8 packet switching networks",
BOOKTITLE="Symposium on Computer Networks",
PAGES="1-7",
NOTE="also in \cite{Abra80:Computer}",
YEAR=1975,
}

@BOOK{Gree75:Computer,
AUTHOR="P. E. Green and R. W. Lucky",
TITLE="Computer Communications",
PUBLISHER="IEEE Press",
ADDRESS="New York, New York",
YEAR=1975,
KEYWORDS="computer networks; survey",
}

@INPROCEEDINGS{Maxe75:Dispersity,
AUTHOR="N. F. Maxemchuk",
TITLE="Dispersity Routing",
BOOKTITLE=icc,
YEAR=1975,
}

@INPROCEEDINGS{Stok75:Problems,
AUTHOR="A. Stokes and P. Higginson",
TITLE="The Problems of Connecting Hosts into the {ARPANET}",
BOOKTITLE="European Computer Conference on Communication Networks",
PUBLISHER="Online",
ADDRESS="London",
YEAR=1975,
KEYWORDS="arpanet",
}

@ARTICLE{Davi75:Edge,
AUTHOR="L. S. Davies",
TITLE="A survey of edge detection techniques",
JOURNAL="CGIP",
VOLUME=4,
PAGES="248-270",
YEAR=1975,
ABSTRACT="The discussion is mathematical throughout, does not talk in
terms of convolutions but implies them.",
}

@MISC{Pear75:Transmission,
AUTHOR="Don Pearson",
TITLE="Transmission and Display of Pictorial Information",
YEAR=1975,
KEYWORDS="subjective quality testing",
ABSTRACT="Old book on digital tv, but with useful intro to psychometrics
for testing of quality",
}

@ARTICLE{Larm75:Scheduling,
AUTHOR="J Larmouth",
TITLE="Scheduling for a Share opf the Machine",
JOURNAL=spe,
PUBLISHER="Wiley",
VOLUME=5,
PAGES="29-49",
YEAR=1975,
KEYWORDS="scheduling",
}

@INPROCEEDINGS{Levi75:Policy,
AUTHOR="Roy Levin and  others",
TITLE="Policy/Mechanism Separation in {HYDRA}",
BOOKTITLE="5th Symposium on Operating Systems Principles",
PAGES="132-140",
YEAR=1975,
}

@TECHREPORT{Kühn75:Kurzabriß,
AUTHOR="P. J. Kühn",
TITLE="Kurzabriß von Approximationsverfahren für Verteilungsfunktionen
mit Hilfe der ersten Momente",
INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung,
Universität Stuttgart",
ADDRESS="Stuttgart, Germany",
PAGES="1-15",
YEAR=1975,
LANGUAGE="German",
REFERENCES=10,
KEYWORDS="Approximation; method; hyper distribution; Gamma distribution;
Weibull distribution",
ABSTRACT="Approximation of measured distributions by various methods
matching up to four moments.",
}

@INCOLLECTION{Pouz75:Network,
AUTHOR="L. Pouzin",
TITLE="Network protocols",
BOOKTITLE="Infotech state of the art report 24: network systems and
software",
SERIES="Infotech State of the Art Reports",
PUBLISHER="Infotech",
ADDRESS="Maidenhead, England",
PAGES="599-627",
YEAR=1975,
KEYWORDS="Communication protocol; communication network; design;
survey",
}

@INCOLLECTION{Kühn75:Über,
AUTHOR="P. J. Kühn and M. Langenbach-Belz",
TITLE="Über die Wirksamkeit zyklischer Abfertigungsstrategien in
Realzeitsystemen",
BOOKTITLE="Lecture Notes in Mathematics and Computer Science",
PUBLISHER="Springer-Verlag",
ADDRESS="Germany",
YEAR=1975,
LANGUAGE="German",
REFERENCES=13,
KEYWORDS="Cyclic service; queueing system; delay time; analysis; loss
probability; real time; computer system",
ABSTRACT="Es werden 3 verschiedene zyklische Abfertigungsstrategien
bzgl. ihrer Wirksamkeit untersucht und anderen bekannten Strategien
vergleichend gegen bergestellt. Es wird auf prakt. Anwendungs-
möglichkeiten sowie auf exakte und approximative Lösungsverfah- ren
hingewiesen.",
}

@ARTICLE{Alle7502:Elements,
AUTHOR="A. O. Allen",
TITLE="Elements of Queueing Theory for System Design, Part 2",
JOURNAL=ibmsj,
VOLUME=14,
NUMBER=2,
PAGES="161-187",
YEAR=1975,
KEYWORDS="Queueing theory",
}

@ARTICLE{Beck75:Classification,
AUTHOR="D. Becker and G. E. Willibald",
TITLE="Classification and Assessment of Telecommunication Services in
Broad-Band Networks",
JOURNAL=ieeecom,
VOLUME="COM-23",
PAGES="63-69",
YEAR=1975,
KEYWORDS="broadband; network; classification; service degradation;
service characterization; service integration",
}

@ARTICLE{Berr75:Solution,
AUTHOR="L. T. M. Berry",
TITLE="On the Solution of a Structured Nonlinear Programme",
JOURNAL=jams,
VOLUME=19,
PAGES="242-248",
YEAR=1975,
KEYWORDS="structure; programming; program construction; program
restructuring; program",
}

@ARTICLE{Berr7501:Gradient,
AUTHOR="L. T. M. Berry",
TITLE="The Gradient Projection Vector for Multicommodity Network
Problems",
JOURNAL=atr,
ADDRESS="Australia",
VOLUME=9,
NUMBER=1,
PAGES="18-27",
YEAR=1975,
KEYWORDS="Network planning; optimization; routing",
}

@ARTICLE{Berr75:Simulation,
AUTHOR="L. T. M. Berry and R. J. Harris",
TITLE="A Simulation Study of the Accuracy of a Telephone Network
Dimensioning Model",
JOURNAL=atr,
VOLUME=9,
NUMBER=2,
PAGES="50-59",
YEAR=1975,
KEYWORDS="Simulation; design; network design; network planning; model;
model verification",
}

@ARTICLE{Boys75:Straightforward,
AUTHOR="J. W. Boyse and D. R. Warn",
TITLE="A Straightforward Model for Computer Performance Prediction",
JOURNAL=acmcs,
VOLUME=7,
NUMBER=2,
PAGES="73-93",
YEAR=1975,
KEYWORDS="model; computer performance; performance prediction",
}

@ARTICLE{Bret7511:Verwendbarkeit,
AUTHOR="G. Bretschneider",
TITLE="Die Verwendbarkeit programmierbarer Taschenrechner für die
Verkehrsplanung von Nachrichtenvermittlungssystemen",
JOURNAL=ntz,
ADDRESS="Germany",
VOLUME=28,
NUMBER=11,
PAGES="386-388",
YEAR=1975,
LANGUAGE="German",
KEYWORDS="numerical method",
ABSTRACT="Pocket calculators",
}

@ARTICLE{Cole75:Development,
AUTHOR="A. C. Cole",
TITLE="The Development of some Aspects of Teletraffic Theory",
JOURNAL="The bulletin of the Institute of Mathematics and its
applications",
VOLUME=11,
NUMBER=5,
PAGES="85-92",
YEAR=1975,
KEYWORDS="history",
}

@ARTICLE{Desc75:Variance,
AUTHOR="A. Descloux",
TITLE="Variance of Load Measurements in Markovian Service Systems",
JOURNAL=bstj,
VOLUME=54,
NUMBER=7,
PAGES="1277-1300",
YEAR=1975,
KEYWORDS="traffic measurement",
}

@ARTICLE{Disn75:Random,
AUTHOR="R. L. Disney",
TITLE="Random Flow in Queueing Networks: A Review and Critique",
JOURNAL="AIIE Transactions",
VOLUME=7,
NUMBER=3,
PAGES="268-288",
YEAR=1975,
KEYWORDS="Queueing Network; Queueing Theory; Survey",
ABSTRACT="This paper introduces basic properties of queueing networks.
Networks are classified by their queue length vector processes as being
Markov processes or not. In each case the relevant problems are exposed
and the literature of each problem is surveyed. The paper concludes with
a discussion of the results and some points in need of further research
is established.",
}

@ARTICLE{Dunl75:Stochastic,
AUTHOR="W. J. Dunlay",
TITLE="Stochastic Properties of Total Air Traffic Control Voice
Communication Time",
JOURNAL="Transportation Research",
VOLUME=9,
PAGES="275-278",
YEAR=1975,
KEYWORDS="air traffic control; stochastic sum",
ABSTRACT="Past studies of air traffic controller communication workload
have considered stochastic properties of individual communication
transmissions or sets of transmissions.  This paper assets that most of
the stochastic variation in total communication workload is due to
fluctuations in the number of required communication transmissions
rather than fluctuations in the transmission lengths",
}

@TECHREPORT{Ever75:Untersuchung,
AUTHOR="R. Evers and K. E. Anders",
TITLE="Untersuchung des Verhaltens der Teilnehmer am öffentlichen
Fernsprechverkehr",
INSTITUTION="Heinrich Hertz Institut",
ADDRESS="Berlin, Germany",
VOLUME=185,
PAGES=36,
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Traffic source model; traffic measurement; telephony",
ABSTRACT="Subscriber behaviour",
}

@TECHREPORT{Ever75:Teilnehmerabhängige,
AUTHOR="R. Evers and K. E. Anders",
TITLE="Teilnehmerabhängige Zeitintervalle innerhalb von Belegungen im
öffentlichen Fernsprechnetz",
INSTITUTION="Heinrich Hertz Institut",
ADDRESS="Berlin, Germany",
VOLUME=186,
PAGES=37,
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Traffic source model; traffic measurement; telephony",
ABSTRACT="Subscriber behaviour",
}

@TECHREPORT{Ever75:Belegungsdauern,
AUTHOR="R. Evers and K. E. Anders",
TITLE="Belegungsdauern und Wiederholungsabstände bei Anrufversuchen im
öffentlichen Fernsprechverkehr",
INSTITUTION="Heinrich Hertz Institut",
ADDRESS="Berlin, Germany",
VOLUME=187,
PAGES=34,
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Traffic source model; traffic measurement; telephony",
ABSTRACT="Subscriber behaviour",
}

@TECHREPORT{Fors75:Ett,
AUTHOR="J. Forssblad",
TITLE="Ett Statistiskt Test för att i Samband med Trafikstyrkemätning
Upptäcka Förekomsten av Blockerade Organ i Graderinger och Länksystem",
TYPE="Internal Report",
INSTITUTION="L M Ericsson AB",
ADDRESS="Stockholm, Sweden",
NUMBER="Dtm 5107-07-11",
PAGES=8,
YEAR=1975,
LANGUAGE="Swedish",
KEYWORDS="Ccitt",
ABSTRACT="Busy circuit; ITU; Maintenance",
}

@ARTICLE{Free75:VEZIR,
AUTHOR="J. Freese",
TITLE="{VEZIR} - ein Gerät zur Datenerfassung für Untersuchungen im
Fernsprechverkehr",
JOURNAL="TN Nachrichten, Telefonbau und Normalzeit",
ADDRESS="Frankfurt am Main",
VOLUME=76,
PAGES="39-42",
YEAR=1975,
LANGUAGE="German",
KEYWORDS="traffic measurement",
}

@ARTICLE{Fuji75:Single,
AUTHOR="T. Fujisawa",
TITLE="On the single-Server Queueing System with Two Types of Customers
and a Feedback Mechanism",
JOURNAL="Studies in Queueing Systems with Multiplicity and Their
Applications",
PAGES="51-64",
YEAR=1975,
KEYWORDS="Queueing System; Single Server; Feedback; Feedback Queue;
analysis; Job Class",
}

@ARTICLE{Gele75:Approximate,
AUTHOR="E. Gelenbe",
TITLE="On Approximate Computer System Models",
JOURNAL=jacm,
VOLUME=22,
NUMBER=2,
PAGES="261-269",
YEAR=1975,
KEYWORDS="Computer System; Modeling; Approximation",
}

@ARTICLE{Hash7503:Repeated,
AUTHOR="O. Hashida and K. Kodaira",
TITLE="Repeated Calls Resulting from Data Terminal Busy and Delayed
Delivery Service",
JOURNAL=ecij1,
ADDRESS="Japan",
VOLUME="58A",
NUMBER=3,
PAGES="1-9",
YEAR=1975,
KEYWORDS="Traffic source model; call reattempt",
ABSTRACT="B-Busy; Subscriber behaviour",
}

@ARTICLE{Hend75:Two,
AUTHOR="W. Henderson and C. Pearce",
TITLE="Two-Server Priority Queue with Unequal Service Rates",
JOURNAL=atr,
VOLUME=9,
NUMBER=2,
PAGES="44-49",
YEAR=1975,
KEYWORDS="Queueing System; Priority; Queueing Theory",
}

@TECHREPORT{Hert75:Jämförelse,
AUTHOR="S. Hertzberg",
TITLE="Jämförelse av Dimensioneringsmetoder Baserade på Telefontrafikens
Medelvärde och Varians",
INSTITUTION="Helsinki University of Technology, Telecommunication
Laboratory",
ADDRESS="Helsinki, Finland",
NUMBER=1,
PAGES=18,
YEAR=1975,
LANGUAGE="Swedish",
KEYWORDS="Variance; planning; telephony",
}

@ARTICLE{Jage7503:Nonstationary,
AUTHOR="D. L. Jagerman",
TITLE="Nonstationary Blocking in Telephone Traffic",
JOURNAL=bstj,
VOLUME=54,
NUMBER=3,
PAGES="625-661",
YEAR=1975,
KEYWORDS="Blocking; instationary process; intensity variations",
ABSTRACT="Blocking is considered for an N-trunk group of exponential
servers with Poisson-offered load whose rate parameter varies with time.
The infinite trunk case is solved by means of a rapidly convergent
series of Poisson-Charlier polynomials.  This solution is used to obtain
practical approximations of blocking probability, transition
probabilities, and recovery function for general time-variable offered",
}

@ARTICLE{Kauf7506:Faulty,
AUTHOR="J. S. Kaufman",
TITLE="Faulty-Trunk Detection Algorithms Using {EADAS/ICUR} Traffic
Data",
JOURNAL=bstj,
VOLUME=56,
NUMBER=6,
PAGES="919-976",
YEAR=1975,
KEYWORDS="Traffic measurement",
ABSTRACT="Killer trunks",
}

@BOOK{Knob75:Tabellen,
AUTHOR="G. Knoblich",
TITLE="Tabellen für Wartesysteme",
SERIES="Fachberichte der Telefonbau und Normalzeit",
PUBLISHER="Telefonbau und Normalzeit",
ADDRESS="Frankfurt/Main, Germany",
VOLUME=1,
PAGES=74,
YEAR=1975,
LANGUAGE="German",
KEYWORDS="table",
}

@ARTICLE{Kort7503:Usikkerheten,
AUTHOR="H. Kortner",
TITLE="Usikkerheten ved trafikkmålinger med gjenoms kningsmetoden",
JOURNAL="Teletronikk",
ADDRESS="Sweden",
NUMBER="3-4",
PAGES="279-284",
YEAR=1975,
LANGUAGE="Swedish",
KEYWORDS="Traffic measurement",
ABSTRACT="Scanning principle or method; Scan",
}

@ARTICLE{Lave7502:Derivation,
AUTHOR="S. S. Lavenberg and G. S. Shedler",
TITLE="Derivation of Confidence Intervals for Work Rate Estimators in a
Closed Queueing Network",
JOURNAL=sicomp,
ADDRESS="Philadephia, USA",
VOLUME=4,
NUMBER=2,
PAGES="108-124",
YEAR=1975,
KEYWORDS="Closed queueing network; confidence interval",
}

@INCOLLECTION{Neut75:Probability,
AUTHOR="M. F. Neuts",
TITLE="Probability Distributions of Phase Type",
BOOKTITLE="Liber Amicorum Prof. Emeritus H. Florin, University of
Louvain",
PUBLISHER="Dept. of Mathematics, University of Louvain",
ADDRESS="Louvain, Belgium",
PAGES="173-206",
YEAR=1975,
KEYWORDS="Phase-type model",
}

@ARTICLE{Neut75:Computational,
AUTHOR="M. F. Neuts",
TITLE="Computational Uses of the Method of Phases in the Theory of
Queues",
JOURNAL="Computers and Mathematics with Applications",
VOLUME=1,
PAGES="151-166",
YEAR=1975,
KEYWORDS="Queueing theory",
}

@ARTICLE{Pipp7506:Crossbar,
AUTHOR="N. Pippenger",
TITLE="On Crossbar Switching Networks",
JOURNAL=ieeecom,
VOLUME="COM-23",
NUMBER=6,
PAGES="646-659",
YEAR=1975,
KEYWORDS="Switching network",
}

@TECHREPORT{Pohl75:Octiple,
AUTHOR="P. Pohl",
TITLE="The Non-Existence of Octiple-Dependent Digits in the Multicyclic
Vector Method",
INSTITUTION="Department of Information Processing at the Royal Institute
of Technology",
ADDRESS="Stockholm, Sweden",
NUMBER="Report TRITA-NA-7510",
PAGES=14,
YEAR=1975,
ABSTRACT="KTH",
}

@PHDTHESIS{Pohl75:MCV,
AUTHOR="P. Pohl",
TITLE="{MCV} - A Fast Pseudo-Random Number Generator with Extremely Good
Statistical Properties",
SCHOOL="The Royal Institute of Technology",
ADDRESS="Stockholm",
PAGES=17,
YEAR=1975,
KEYWORDS="random number",
ABSTRACT="KTH",
}

@ARTICLE{Rahk75:Comparison,
AUTHOR="K. Rahko",
TITLE="Comparison of Different Connecting Networks - The Grid Connecting
Network and its Control by Microprocessor",
JOURNAL="Eripainos Sähkö-lehdestä",
ADDRESS="Finland",
NUMBER=10,
PAGES=5,
YEAR=1975,
KEYWORDS="Interconnection network",
}

@ARTICLE{Rao7502:Mean,
AUTHOR="N. P. Rao",
TITLE="On the Mean Production Rate of a Two-Stage Production System of
the Tandem Type",
JOURNAL=ijpr,
VOLUME=13,
NUMBER=2,
PAGES="207-217",
YEAR=1975,
KEYWORDS="Manufacturing system; tandem queue",
}

@ARTICLE{Rao7504:Two,
AUTHOR="N. P. Rao",
TITLE="Two Stage Production Systems with Intermediate Storage",
JOURNAL="AIIE Transactions",
VOLUME=7,
NUMBER=4,
PAGES="414-421",
YEAR=1975,
KEYWORDS="Manufacturing system",
}

@ARTICLE{Rose7503:Queueing,
AUTHOR="M. Rosenshine",
TITLE="Queueing Theory: The State-of-the-Art",
JOURNAL="AIIE Transactions",
VOLUME=7,
NUMBER=3,
PAGES="257-267",
YEAR=1975,
KEYWORDS="Queueing theory; survey",
ABSTRACT="Review",
}

@ARTICLE{Saue75:Approximate,
AUTHOR="C. H. Sauer and K. M. Chandy",
TITLE="Approximate Analysis of Central Server Models",
JOURNAL=ibmjrd,
VOLUME=19,
PAGES="301-313",
YEAR=1975,
KEYWORDS="Central server",
}

@ARTICLE{Shan7503:Simulation,
AUTHOR="R. E. Shannon",
TITLE="Simulation: A Survey with Research Suggestions",
JOURNAL="AIIE Transactions",
VOLUME=7,
NUMBER=3,
PAGES="289-301",
YEAR=1975,
KEYWORDS="Simulation method; survey",
}

@TECHREPORT{Sole75:Bessel,
AUTHOR="R. R. Solem",
TITLE="Bessel-Fordelingene. En ny klasse fordelinger innen
teletrafikteorien",
INSTITUTION="Televerkets Forskningsinstitutt (TF)",
ADDRESS="Kjeller, Norway",
NUMBER=11,
PAGES=19,
YEAR=1975,
LANGUAGE="Norwegian",
KEYWORDS="Arrival process",
}

@INPROCEEDINGS{Vale75:Seleccion,
AUTHOR="J. G. Valenzuela and B. Elguézaba",
TITLE="Seleccion de un Sistema control de mensajes Telefonicos.
Caracteristícas generales del Software utilizado en sistemas de control
telefónico por programa almacenado",
BOOKTITLE="CIEA del IPN",
ADDRESS="Mexico",
PAGES=29,
YEAR=1975,
LANGUAGE="Spanish",
KEYWORDS="Spc",
}

@ARTICLE{Hale75:Telephone,
AUTHOR="R. van Halen and H. Schreur",
TITLE="A Telephone Traffic Measuring System",
JOURNAL=ptr,
ADDRESS="Netherlands",
VOLUME=33,
NUMBER=4,
PAGES="204-210",
YEAR=1975,
KEYWORDS="Traffic measurement",
}

@ARTICLE{Stre75:Heuristische,
AUTHOR="H. Streim",
TITLE="Heuristische Lösungsverfahren - Versuch einer Begriffserklärung",
JOURNAL=zor,
PUBLISHER="Physica-Verlag",
ADDRESS="Würzburg, Germany",
VOLUME="Band 19",
PAGES="143-162",
YEAR=1975,
LANGUAGE="German",
REFERENCES=49,
KEYWORDS="heuristics",
ABSTRACT={Im Beitrag wird der Versuch unternommen, den Begriff
"heuristisches Lösungsverfahren" zu präzisieren. Es werden drei
konstituierende und drei akzessorische Merkmale herausgearbeitet.
Schließlich werden einige ausgewählte heuristische Verfahren auf ihre
charakteristischen Eigenschaften hin untersucht.},
}

@ARTICLE{Pier75:Bibliography,
AUTHOR="A. R. Pierce",
TITLE="Bibliography on Algorithms for Shortest Path, Shortest Spanning
Tree, and Related Circuit Routing Problems (1956-1974)",
JOURNAL=networks,
VOLUME=5,
PAGES="129-149",
YEAR=1975,
KEYWORDS="Shortest Path; Routing",
ABSTRACT="This bibliography contains 431 references on algorithms and
machine calculation techniques for solving the shortest path, k-th
shortest path, and the shortest spanning tree problems.",
}

@ARTICLE{Makh75:Linear,
AUTHOR="J. Makhoul",
TITLE="Linear Prediction: A Tutorial Review",
JOURNAL=ieeeproc,
VOLUME=63,
NUMBER=4,
PAGES="561-580",
YEAR=1975,
KEYWORDS="speech compression; linear prediction; signal processing",
}

@INCOLLECTION{Wagn75:Computer,
AUTHOR="H. Wagner",
TITLE="Computer Simulation of Management Systems",
BOOKTITLE="Principles of Operations Research with Applications to
managerial decisions",
PUBLISHER="Prentice Hall",
PAGES="902-939",
YEAR=1975,
KEYWORDS="Simulation",
}

@ARTICLE{Bind75:ALOHA,
AUTHOR="R. Binder and N. Abramson and F. F. Kuo and A. Okinaka and D.
Wax",
TITLE="{ALOHA} packet broadcasting - a retrospect",
JOURNAL=afips,
VOLUME=44,
PAGES="203-215",
NOTE="also in \cite{Thur81:Tutorial}",
YEAR=1975,
REFERENCES=15,
KEYWORDS="ALOHA; packet switching; survey",
}

@ARTICLE{Burc75:Functions,
AUTHOR="Jerry Burchfiel and Raymond Tomlinson and M. Beeler",
TITLE="Functions and structure of a packet radio station",
JOURNAL=afips,
VOLUME=44,
PAGES="245-251",
YEAR=1975,
REFERENCES=10,
KEYWORDS="Packet switching; switching system; broadcast; design;
operating system; hardware device; communication",
ANNOTE="A packet radio network is a digital broadcast channel, fixed and
mobile digital terminals which are sources and sinks of information,
stations which provide centralized routing control and interconnections
to other networks, and repeaters which provide a rea couverage for
mobile terminals by performing a store-and-forward function on the radio
broadcast channel. An experimental testbed for these concepts is now
under construction at the stanfo",
}

@ARTICLE{Crow75:Packet,
AUTHOR="William R. Crowther and F. E. Heart and  others",
TITLE="Issues in packet switching network design",
JOURNAL=afips,
VOLUME=44,
PAGES="161-175",
YEAR=1975,
REFERENCES=33,
KEYWORDS="ARPAnet; packet switching; design; computer network",
ANNOTE="The goals of this paper are to identify several of the key
design choices that must be made in specifying a packet-switching
network and to provide some insight in each area.",
}

@ARTICLE{Fral75:Technological,
AUTHOR="S. C. Fralick and J. C. Garett",
TITLE="Technological considerations for packet radio networks",
JOURNAL=afips,
VOLUME=44,
PAGES="233-243",
YEAR=1975,
REFERENCES=13,
KEYWORDS="Packet switching; broadcast; communication; repeater",
ANNOTE="We focus on the impact of rf channel, network design, and
technology on the repeater because it is the critical communications
element in a packet radio network. It can be converted to a station by
adding a mini-computer, and to a terminal by adding appropriate i/o
components. Since a repeater has been successfully implemented, it is
reasonable to conclude that a packet radio network is technically
feasible.",
}

@ARTICLE{Fran75:PACKET,
AUTHOR="H. Frank and I. Gitman and R. van Slyke",
TITLE="Packet radio system - network considerations",
JOURNAL=afips,
VOLUME=44,
PAGES="217-231",
YEAR=1975,
REFERENCES=20,
KEYWORDS="Packet switching; broadcast; communication; network
throughput; network delay; routing algorithm",
}

@ARTICLE{Klei75:Random,
AUTHOR="L. Kleinrock and F. A. Tobagi",
TITLE="Random access techniques for data transmission over
packet-switched radio channels",
JOURNAL=afips,
VOLUME=44,
PAGES="187-201",
YEAR=1975,
REFERENCES=17,
KEYWORDS="Packet switching; broadcast; communication; multiple access",
ANNOTE="In this set of papers, we suggest another solution to the
terminal access problem, namely that of packet switching over radio
channels.",
}

@ARTICLE{Lam75:Dynamic,
AUTHOR="S. S. Lam and L. Kleinrock",
TITLE="Dynamic control schemes for a packet switched multi-access
broadcast channel",
JOURNAL=afips,
VOLUME=44,
PAGES="143-153",
YEAR=1975,
REFERENCES=15,
KEYWORDS="broadcast; communication; packet switching; dynamic resource
allocation",
ANNOTE="In this paper we have studied dynamic channel control algorithms
(contest algorithms) which implement the theoretical control policies by
using a heuristic scheme to estimate the instantaneous channel state. A
heuristic retransmission control algorithm has also been studied which
circumvents the state estimation problem. Simulation results indicate
that these control algorithms are capable of achieving a channel
throughput-delay performance clo",
}

@ARTICLE{Retz75:Operating,
AUTHOR="D. L. Retz",
TITLE="Operating system design considerations for the packet-switching
environment",
JOURNAL=afips,
VOLUME=44,
PAGES="155-160",
YEAR=1975,
REFERENCES=22,
KEYWORDS="Packet switching; operating system; HOST",
ANNOTE="This paper is concerned with the design requirements of host
operating systems: those systems whose primary business is the
management of computing resources rather than communication resources.",
}

@ARTICLE{Chan7501:Approximate,
AUTHOR="K. M. Chandy and U. Herzog and L. Woo",
TITLE="Approximate analysis of general queueing networks by
decomposition",
JOURNAL=ibmjrd,
VOLUME=19,
NUMBER=1,
PAGES="43-49",
MONTH=jan,
YEAR=1975,
}

@ARTICLE{Chan7501:Parametric,
AUTHOR="K. M. Chandy and U. Herzog and L. Woo",
TITLE="Parametric Analysis of Queuing Networks",
JOURNAL=ibmjrd,
VOLUME=19,
NUMBER=1,
PAGES="36-42",
MONTH=jan,
YEAR=1975,
}

@ARTICLE{Hans7501:Stably,
AUTHOR="R. J. Hanson",
TITLE="Stably updating mean and standard deviation of data",
JOURNAL=cacm,
VOLUME=18,
NUMBER=1,
PAGES="57-58",
MONTH=jan,
YEAR=1975,
KEYWORDS="Simulation; statistics; numeric calculation",
}

@ARTICLE{Fran7501:Computer,
AUTHOR="M. Frank",
TITLE="Computer networks: art to science to art",
JOURNAL=networks,
VOLUME=5,
PAGES="7-32",
MONTH=jan,
YEAR=1975,
}

@ARTICLE{Pouz7501:Basic,
AUTHOR="L. Pouzin",
TITLE="Basic Elements of a Network Data Link Control Procedure
{(NDLC)}",
JOURNAL=ccr,
VOLUME=5,
NUMBER=1,
MONTH=jan,
YEAR=1975,
}

@ARTICLE{Metc7501:Steady,
AUTHOR="B. Metcalfe",
TITLE="Steady State Analysis of a Slotted and Controlled Aloha System
with Blocking",
JOURNAL=ccr,
VOLUME=5,
NUMBER=1,
MONTH=jan,
YEAR=1975,
}

@ARTICLE{Kuo7501:Political,
AUTHOR="F. F. Kuo",
TITLE="Political and Economic Issues for Internetwork Connections",
JOURNAL=ccr,
VOLUME=5,
NUMBER=1,
MONTH=jan,
YEAR=1975,
}

@ARTICLE{Turn7501:Security,
AUTHOR="R. Turn",
TITLE="Security Problems in Computer Communications Systems",
JOURNAL=ccr,
VOLUME=5,
NUMBER=1,
MONTH=jan,
YEAR=1975,
}

@ARTICLE{Rubi7502:Message,
AUTHOR="I. Rubin",
TITLE="Message Path Delays in Packet Switching Communication Networks",
JOURNAL=ieeecom,
VOLUME="COM-23",
NUMBER=2,
PAGES="186-192",
MONTH=feb,
YEAR=1975,
KEYWORDS="queueing theory",
ABSTRACT="A communication path (in isolation) in a packet-switching
store-and-forward communication network, such as a
computer-communication or satellite-communication network, is
considered. Messages are assumed to arrive according to a Poisson
stream, and message lengths are considered to be random variables
governed by an arbitrary distribution. Message lengths are divided into
fixed-length packets which are sent independently over the $N$-channel
communication path in a store-and forward manner and are reassembled at
the destination terminal. Expressions for the distributions of the
message waiting and delay times over the path are derived. Also, we
obtain the limiting average message waiting times and required buffer
sizes at the individual channels. The overall message waiting time is
observed to depend only on the minimal channel capacity. The case of
exponentially distributed message lengths serves as an illustrating
example.",
}

@ARTICLE{Rabi7502:Algorithm,
AUTHOR="L. R. Rabiner and M. R. Sambur",
TITLE="An algorithm for determining the endpoints of isolated
utterances",
JOURNAL=bstj,
VOLUME=54,
NUMBER=2,
PAGES="297-315",
MONTH=feb,
YEAR=1975,
KEYWORDS="silence detection",
ABSTRACT="An important problem in speech processing is to detect the
presence of speech in a background of noise. This problem is often
referred to as the endpoint location problem. By accurately detecting
the beginning and end of an utterance, the amount of processing of
speech data can be kept to a minimum. The algorithm proposed for
locating the endpoints of an utterance is based on two measures of the
signal, zero crossing rate and energy. The algorithm is inherently
capable of performing in any reasonable acoustic environment in which
the signal-to-noise ratio is on the order of 30 dB or better. The
algorithm has been tested over a variety of recording conditions and for
a large number of speakers and has been found to perform well across all
tested conditions.",
}

@ARTICLE{Ashe7502:Hierarchical,
AUTHOR="R. L. Ashenhurst and R. H. Vonderohe",
TITLE="A Hierarchical Network",
JOURNAL=datamation,
VOLUME=21,
PAGES="40-44",
NOTE="also in \cite{Thur81:Tutorial}",
MONTH=feb,
YEAR=1975,
}

@ARTICLE{Farb7502:Ring,
AUTHOR="D. Farber",
TITLE="A Ring Network",
JOURNAL=datamation,
VOLUME=21,
PAGES="44-46",
NOTE="also in \cite{Thur81:Tutorial}",
MONTH=feb,
YEAR=1975,
}

@ARTICLE{Pack7503:Comparison,
AUTHOR="C. D. Pack",
TITLE="A Comparison of the Output Process of an {$M/D/1$} queue as
Measured from an Arbitrary Departure Epoch to that Measured from an
Arbitrary Instant in Time",
JOURNAL=siapp,
VOLUME=28,
NUMBER=2,
PAGES="367-375",
MONTH=mar,
YEAR=1975,
KEYWORDS="queueing theory",
ABSTRACT="The major result of this paper is the following for the
stationary $M/D/1$ queue with $c$-second service times: If $P\_n(z)$ is
the cumulative distribution of the time until the $n$th departure
measured from an arbitrary departure epoch and $\hat{P}\_n(z)$ is the
cumulative distribution of the time until the $n$th departure measured
from an arbitrary instant in time, then $P\_n(z) = \hat{P}\_n(z)$ for $z
\geq nc$.",
}

@TECHREPORT{McGr7503:Techniques1,
AUTHOR="E. J. McGrath and S. L. Basin and R. W. Burton and D. C. Irving
and  others",
TITLE="Techniques for Efficient Monte Carlo Simulation, Volume {I:}
Selecting Probability Distributions",
INSTITUTION="Science Applications Inc.",
ADDRESS="La Jolla, California",
NUMBER="SAI-27-590-LJ",
MONTH=mar,
YEAR=1975,
KEYWORDS="Random number generation",
}

@TECHREPORT{McGr7503:Techniques2,
AUTHOR="E. J. McGrath and D. C. Irving and S. C. Jaquette and W. R.
Ketler and  others",
TITLE="Techniques for Efficient Monte Carlo Simulation, Volume {II:}
Selecting Probability Distributions",
INSTITUTION="Science Applications Inc.",
ADDRESS="La Jolla, California",
NUMBER="SAI-27-590-LJ",
MONTH=mar,
YEAR=1975,
KEYWORDS="Random number generation",
}

@ARTICLE{Gitm7503:Capacity,
AUTHOR="I. Gitman",
TITLE="On the capacity of slotted {ALOHA} networks and some design
problems",
JOURNAL=ieeecom,
VOLUME="COM-23",
PAGES="305-317",
MONTH=mar,
YEAR=1975,
}

@ARTICLE{Bask7504:Open,
AUTHOR="F. Baskett and K. M. Chandy and R. R. Muntz and F. Palacios",
TITLE="Open Closed and Mixed Networks of Queues with Different Classes
of Customers",
JOURNAL=jacm,
VOLUME=22,
NUMBER=2,
PAGES="248-260",
MONTH=apr,
YEAR=1975,
}

@ARTICLE{Carl7504:Bistable,
AUTHOR="A. B. Carlerial and M. E. Hellman",
TITLE="Bistable behavior of {ALOHA-type} systems",
JOURNAL=ieeecom,
VOLUME="COM-23",
PAGES="401-410",
MONTH=apr,
YEAR=1975,
}

@ARTICLE{Opde7504:Problems,
AUTHOR="H. Opderbeck",
TITLE="Problems in the Design of Control Procedures for Computer
Networks",
JOURNAL=ccr,
VOLUME=5,
NUMBER=2,
MONTH=apr,
YEAR=1975,
}

@ARTICLE{Both7504:CCITT,
AUTHOR="H. Bothner-By",
TITLE="The {CCITT} Studies Packet Switching as Part of Public Data
Network Development",
JOURNAL=ccr,
VOLUME=5,
NUMBER=2,
MONTH=apr,
YEAR=1975,
}

@ARTICLE{Curr7504:Work,
AUTHOR="A. Curran and V. G. Cerf",
TITLE="The Work of {IFIP} Working Group 6.1",
JOURNAL=ccr,
VOLUME=5,
NUMBER=2,
MONTH=apr,
YEAR=1975,
}

@ARTICLE{Robe7504:ALOHA,
AUTHOR="L. G. Roberts",
TITLE="{ALOHA} Packet System with and without Slots and Capture",
JOURNAL=ccr,
VOLUME=5,
NUMBER=2,
MONTH=apr,
YEAR=1975,
}

@ARTICLE{Herb7505:Note,
AUTHOR="H. G. Herbert",
TITLE="A Note on First Emptiness in a Discrete Storage System with
Markovian Inputs",
JOURNAL=siapp,
VOLUME=28,
NUMBER=3,
PAGES="657-661",
MONTH=may,
YEAR=1975,
KEYWORDS="discrete time queues",
ABSTRACT="The distribution of the time to first emptiness for an
infinite capacity storage system with a denumerable Markov chain input
and subject to unit outflow is discussed in this paper. The method
employed involves the use of generating functions. A functional equation
whose solution leads to a generating function for the time to first
emptiness is derived. Also considered are the probability that the dam
ever empties and the mean time to first emptiness.",
}

@ARTICLE{Herz7505:Solution,
AUTHOR="U. Herzog and L. Woo and K. M. Chandy",
TITLE="Solution of Queueing Problems by a Recursive Technique",
JOURNAL=ibmjrd,
PAGES="295-300",
MONTH=may,
YEAR=1975,
REFERENCES=9,
KEYWORDS="Queueing system; Analysis; Mathematics",
}

@ARTICLE{Reis7505:Queuing,
AUTHOR="M. Reiser and H. Kobayashi",
TITLE="Queuing networks with multiple closed chains: Theory and
computational algorithms",
JOURNAL=ibmjrd,
VOLUME=19,
NUMBER=3,
PAGES="283-294",
MONTH=may,
YEAR=1975,
KEYWORDS="Queueing network; product form; analysis",
}

@ARTICLE{Chiu7505:Multiprogrammed,
AUTHOR="W. Chiu and D. Dumont and R. Wood",
TITLE="Performance Analysis of a Multiprogrammed Computer System",
JOURNAL=ibmjrd,
PAGES="263-271",
MONTH=may,
YEAR=1975,
KEYWORDS="Performance Evaluation; Computer",
}

@ARTICLE{Cave7506:Cutset,
AUTHOR="J. K. Cavers",
TITLE="Cutset manipulations for communication network reliability
estimation",
JOURNAL=ieeecom,
VOLUME="COM-23",
PAGES="569-575",
MONTH=jun,
YEAR=1975,
}

@INPROCEEDINGS{Cott7506:Appearance,
AUTHOR="I. W. Cotton and P. Meissner",
TITLE="Appearance to Controlling Personnel Access to Computer
Terminals",
BOOKTITLE="Computer Networks Symposium",
PUBLISHER="NBS and IEEE Computer Society",
PAGES="32-39",
NOTE="also in \cite{Abra80:Computer}",
MONTH=jun,
YEAR=1975,
}

@TECHREPORT{Jarv7506:Optimization,
AUTHOR="J. P. Jarvis",
TITLE="Optimization in Stochastic Service Systems with Distinguishable
Servers",
INSTITUTION="Operations Research Center, Massachusetts Institute of
Technology",
PAGES=197,
MONTH=jun,
YEAR=1975,
KEYWORDS="Stochastic system; queueing system",
}

@ARTICLE{Mess7506:Faulty,
AUTHOR="E. J. Messerli",
TITLE="Faulty Trunks: A New Look at an Old Problem",
JOURNAL=blr,
PAGES="278-283",
MONTH=jun,
YEAR=1975,
KEYWORDS="Traffic measurement",
ABSTRACT="Killer trunks",
}

@ARTICLE{Eric7507:Economics,
AUTHOR="M. J. Eric",
TITLE="The economics and performance of satellite packet switching",
JOURNAL=ieeecom,
VOLUME="COM-23",
PAGES="732-741",
MONTH=jul,
YEAR=1975,
}

@ARTICLE{Broo7507:Experimental,
AUTHOR="C. F. Broomfield",
TITLE="The Experimental Packet Switched Service",
JOURNAL=ccr,
VOLUME=5,
NUMBER=3,
MONTH=jul,
YEAR=1975,
}

@ARTICLE{Barb7507:European,
AUTHOR="D. Barber",
TITLE="A European Informatics Network",
JOURNAL=ccr,
VOLUME=5,
NUMBER=3,
MONTH=jul,
YEAR=1975,
}

@ARTICLE{Cott7508:Remark,
AUTHOR="I. W. Cotton",
TITLE="Remark on stably updating mean and standard deviation of data",
JOURNAL=cacm,
VOLUME=18,
NUMBER=8,
PAGES=458,
MONTH=aug,
YEAR=1975,
KEYWORDS="Simulation; statistics; numeric calculation",
}

@ARTICLE{Rosn7508:High,
AUTHOR="R. A. Rosner and  others",
TITLE="A high throughput packet-switched network technique without
message reassembly",
JOURNAL=ieeecom,
VOLUME="COM-23",
PAGES="819-828",
MONTH=aug,
YEAR=1975,
}

@INPROCEEDINGS{Wald7508:Experiences,
AUTHOR="D. C. Walden",
TITLE="Experiences in building, operating and using the {ARPA} Network",
BOOKTITLE="2nd USA-Japan Computer Conference",
ADDRESS="Tokyo",
MONTH=aug,
YEAR=1975,
}

@INPROCEEDINGS{Wilk7508:Communication,
AUTHOR="M. V. Wilkes",
TITLE="Communication using a Digital Ring",
BOOKTITLE="PACNET Conference",
ADDRESS="Sendai, Japan",
PAGES="47-55",
MONTH=aug,
YEAR=1975,
}

@ARTICLE{Abra7509:Satellites,
AUTHOR="N. Abramson and E. R. Cacciamami",
TITLE="Satellites, not just a big cable in the sky",
JOURNAL=ieeespec,
VOLUME=12,
PAGES="36-40",
MONTH=sep,
YEAR=1975,
}

@ARTICLE{Chou7509:Simulation,
AUTHOR="Wu Chou and H. Frank and R. Vanslyke",
TITLE="Simulation of centralized computer communication systems",
JOURNAL=ieeecom,
VOLUME="COM-23",
PAGES="994-1001",
MONTH=sep,
YEAR=1975,
}

@ARTICLE{Grub7509:Rating,
AUTHOR="D. S. Grubb and I. W. Cotton",
TITLE="Rating Performance",
JOURNAL=datacommunications,
PAGES="41-47",
NOTE="also in \cite{Abra80:Computer}",
MONTH=sep,
YEAR=1975,
}

@ARTICLE{Kimb7509:Computer,
AUTHOR="S. R. Kimbleton and G. M. Schneider",
TITLE="Computer communication networks: approaches, objectives and
performance considerations",
JOURNAL=acmcs,
VOLUME=7,
PAGES="129-173",
MONTH=sep,
YEAR=1975,
}

@TECHREPORT{MacF7509:Statistical,
AUTHOR="N. W. MacFadyen",
TITLE="The Statistical Observation of Repeat Attempts",
INSTITUTION="British Post Office",
ADDRESS="Great Britain",
NUMBER="TTM 204",
PAGES=16,
MONTH=sep,
YEAR=1975,
KEYWORDS="Call reattempt",
ABSTRACT="Refer to later ITC-paper.",
}

@TECHREPORT{Jeff75:Computer,
AUTHOR="S. Jeffery and T. L. Bell and B. W. Boehm",
TITLE="Computer Performance Evaluation: Report of the 1973 {NBS/ACM}
Workshop",
INSTITUTION="DTB",
ADDRESS="Copenhagen, Denmark",
NUMBER="COM-75-11438",
MONTH=sep,
YEAR=1975,
KEYWORDS="Computer performance; performance evaluation",
}

@INPROCEEDINGS{Kuhn75:Optimalen,
AUTHOR="P. J. Kühn",
TITLE="Zur optimalen Steuerung des Multiprogramminggrades in
Rechnersystemen mit virtuellem Speicher und Paging",
BOOKTITLE="Beitrag zur GI, 5. Jahrestagung der GI",
ADDRESS="Dortmund",
PAGES="1-14",
MONTH=oct,
YEAR=1975,
LANGUAGE="German",
REFERENCES=12,
KEYWORDS="Multiprogramming; memory management; optimization",
ANNOTE={Ziel der Untersuchungen ist es, Bedingungen für eine
Durchsatz-optimale Steuerung des Multiprogramminggrades anzugeben, wobei
die wesentlichsten Einflussgrössen beruecksichtigt werden. Dies erfolgt
anhand einer exakten Analyse eines geschlossenen Warteschlangenmodells,
in welches neben realistischen "Bedienungszeiten" wesentliche Merkmale
realer Programme und Betriebssyst eme einbezogen werden. Als Ergebnisse
werden gewonnen:},
}

@INPROCEEDINGS{Bran7510:Encryption,
AUTHOR="D. K. Branstad",
TITLE="Encryption Protection in Computer Data Communications.",
BOOKTITLE="4th Data Communication Symposium",
PAGES="8.1-8.7",
NOTE="also in \cite{Abra80:Computer}",
MONTH=oct,
YEAR=1975,
}

@INPROCEEDINGS{McKe7510:ARPA,
AUTHOR="A. A. McKenzie",
TITLE="The {ARPA} network control center",
BOOKTITLE="4th Data Communication Symposium IEEE",
NOTE="also in \cite{Abra80:Computer}",
MONTH=oct,
YEAR=1975,
}

@ARTICLE{Schn7510:Structural,
AUTHOR="G. M. Schneider and William R. Franta",
TITLE="A Structural Simulation Model for Computer Networks",
JOURNAL=ccr,
VOLUME=5,
NUMBER=4,
MONTH=oct,
YEAR=1975,
}

@ARTICLE{Schr7510:Linguistical,
AUTHOR="F. Schreiber",
TITLE="Some Linguistical Problems about Colloquies",
JOURNAL=ccr,
VOLUME=5,
NUMBER=4,
MONTH=oct,
YEAR=1975,
}

@ARTICLE{Math7510:Telenet,
AUTHOR="S. L. Mathison",
TITLE="Telenet Inaugurates Service",
JOURNAL=ccr,
VOLUME=5,
NUMBER=4,
MONTH=oct,
YEAR=1975,
}

@ARTICLE{Anon7510:Activities,
AUTHOR="Anonymous",
TITLE="Activities in Public Packet Switched Communications",
JOURNAL=ccr,
VOLUME=5,
NUMBER=4,
MONTH=oct,
YEAR=1975,
}

@ARTICLE{Anon7510:Government,
AUTHOR="Anonymous",
TITLE="{U.S.} Government Communications Network Activities",
JOURNAL=ccr,
VOLUME=5,
NUMBER=4,
MONTH=oct,
YEAR=1975,
}

@PHDTHESIS{Mall75:Beschreibung,
AUTHOR="H. Malleck",
TITLE="Beschreibung der Ausgangsprozesse von kaskadierten,
rückgekoppelten Schieberegistern",
SCHOOL="TU Wien",
ADDRESS="Vienna, Austria",
MONTH=nov,
YEAR=1975,
LANGUAGE="German",
KEYWORDS="Random number generator; shift register sequences",
}

@ARTICLE{Penn7512:Congestion,
AUTHOR="M. Pennotti and M. Schwartz",
TITLE="Congestion Control in Store and Forward Tandem Links",
JOURNAL=ieeecom,
VOLUME="COM-23",
NUMBER=12,
PAGES="1434-1443",
MONTH=dec,
YEAR=1975,
KEYWORDS="congestion control",
ABSTRACT="This paper discusses the problem of congestion in
message-switched data communication networks. This condition occurs when
more traffic enters the network than can reasonable be served. Two types
of techniques employed to control congestion in already existing
national networks are identified. A queueing model which can be used to
analyze and compare these control schemes for a simple tandem link
network is developed. Finally, analytic results are presented which
describe the behavior of the simple network using the two control
schemes, and which would be useful in the design of more general
networks as well.",
ANNOTE="$M$ tandem unbounded $M/M/1$ links with link and external
customers; end-to-end control admits messages only if less than $N$
customers in system (window flow control); for local control, link
messages that reach server $i$ wait until less than $N\_{i+1}$ customers
at next downstream server $i+1$ (external customers served while link
customers blocked, with preemptive resume); for end-to-end control,
external customers can be represented by reducing service rate; local
control model ignores external traffic. Analysis for end-to-end control
solves equivalent closed queueing network with $M+1$ nodes and $N$
customers.",
}

@ARTICLE{Klei7512:Packet,
AUTHOR="L. Kleinrock and F. A. Tobagi",
TITLE="Packet switching in radio channels",
JOURNAL=ieeecom,
VOLUME="COM-23",
PAGES="Part I, 1400-1416; Part II, 1417-1433",
MONTH=dec,
YEAR=1975,
}

@TECHREPORT{Suns7512:Interprocess,
AUTHOR="C. A. Sunshine",
TITLE="Interprocess Communication Protocols for Computer Networks",
INSTITUTION="Digital Systems Laboratory, Stanford University",
NUMBER="TR 105",
MONTH=dec,
YEAR=1975,
}