@ARTICLE{Rath7911:Approximations,
AUTHOR="John H. Rath and Diane Sheng",
TITLE="Approximations for Overflow from Queues with a Finite Waiting
Room",
JOURNAL=or,
VOLUME=27,
NUMBER=6,
PAGES="1208-1216",
MONTH="November--December",
YEAR=1979,
KEYWORDS="queueing theory; M/M/c/K; IPP",
ABSTRACT="The note reports a study of the use of the interrupted Poisson
process (IPP) as an approximation to the overflow process from a
$M/M/c/K$ queue (a queue with Poisson arrival process, $c$ servers each
with exponentially distributed service times, and a maximum of $K$
customers in the system). The IPP has been used successfully by Kuczura
to approximate the overflow from a $M/M/c/c$ queue. Numerical
comparisons are made for a number of examples and both the maximum
absolute errors and percent errors are plotted.",
ANNOTE="approximation of $M/M/C/K$ overflow process by IPP",
}

@BOOK{Boro79:Computer,
AUTHOR="Israel Borovits",
TITLE="Computer systems performance evaluation: criteria, measurement,
techniques, and costs",
PUBLISHER="Lexington Books",
YEAR=1979,
}

@BOOK{Kell79:Reversibility,
AUTHOR="F. P. Kelly",
TITLE="Reversibility and Stochastic Networks",
PUBLISHER="John Wiley and Sons",
ADDRESS="New York",
YEAR=1979,
}

@ARTICLE{Kerm79:Virtual,
AUTHOR="Parviz Kermani and L. Kleinrock",
TITLE="Virtual Cut Through: A New Computer Communication Switching
Technique",
JOURNAL=cn,
VOLUME=3,
PAGES="267-286",
YEAR=1979,
}

@ARTICLE{Neut79:Versatile,
AUTHOR="M. F. Neuts",
TITLE="A versatile Markovian point process",
JOURNAL=jap,
VOLUME=16,
PAGES="764-779",
YEAR=1979,
KEYWORDS="point processes; probability distributions of phase type;
cumulative processes; computational probability; queueing theory;
Markov-modelated Poisson process",
ABSTRACT="We introduce a versatile class of point processes on the real
line, which are closely related to finite-state Markov processes. Many
relevant probability distributions, moment and correlation formulas are
given in forms which are computationally tractable. Several point
processes, such as renewal processes of phase type, Markov-modulated
Poisson processes and certain semi-Markov point processes appear as
particular cases. The treatment of a substantial number of existing
probability models can be generalized in a systematic manner to arrival
processes of the type discussed in this paper. Several qualitative
features of point processes, such as certain types of fluctuations,
grouping, interruptions and the inhibition of arrivals by bunch inputs
can be modelled in a way which remains computationally tractable.",
}

@ARTICLE{Ober79:Time,
AUTHOR="H. S. Oberai and H. M. Shrivastav",
TITLE="Time assignment speech interpolation system --- a microprocessor
based design",
JOURNAL="Computers and Electrical Engineering",
VOLUME=6,
PAGES="259-266",
YEAR=1979,
KEYWORDS="TASI; implementation",
ABSTRACT="A normal synchronous time multiplexed system has low capacity
utilization of a trunk channel owing to the on-off nature of speech in
human conversation. A time assignment speech interpolation (TASI) nearly
doubles this efficiency, at relatively small increase in hardware cost.
In TASI, during the silent period of speech, the channel is alloted to
some other 'active' subscriber on a first-come, first-serve basis. A
microprocessor based system offers a very cost-effective solution from
hardware count. Intel 8085 A has been selected for the purpose. The
microprocessor functions in a distributed processing mode together with
the main CPU controlling the stored program exchange. The system uses
digital dynamic speech detectors for detecting transitions in speech
over a channel, as they show considerably superior performance over
amplitude detectors. An assembly language program for the system has
been developed.",
}

@BOOK{Joha79:Electronic,
AUTHOR="Robert Johansen and Jacques Vallee and Kathleen Spangler",
TITLE="Electronic Meetings: Technical Alternatives and Social Choices",
PUBLISHER="Addison Wesley",
ADDRESS="Reading, Massachusetts",
PAGES=244,
YEAR=1979,
KEYWORDS="computer conferencing; video conferencing",
ABSTRACT="An early book from key players in the field (Institute for the
Future, Menlo Park, California).  Some of the key conclusions are a bit
dated by changes in technology, but the book provides a good overview of
several types of electronic communication (video, audio, and computer
conferencing).  Develops effective and ineffective uses of each type by
using a case history.  Provides suggestions for organizing electronic
meetings and a comparison (strengths and weaknesses) of the key features
of each.  Organizational and social impacts are discussed.  General
conclusions: 1) the system is NOT the solution (consider the uses and
not just the technology); 2) Face-to-face is not always best (while they
are familiar territory, they should be evaluated as critically as
electronic meetings); 3) First uses are not likely to be future uses
(new uses AND new users will emerge); and 4) More communication is not
always better (information overload may be a real problem).",
}

@ARTICLE{Cric79:Citizen,
AUTHOR="M. Kochen and R. Crickman",
TITLE="Citizen Participation Through Computer Conferencing",
JOURNAL="Technological Forecasting and Social Change",
VOLUME=14,
NUMBER=1,
PAGES="47-64",
YEAR=1979,
KEYWORDS="computer conferencing",
ABSTRACT="Describes a computer conference on recombinant DNA among four
lay people; they had no previous training on computer conferencing.
Results indicate topic was successfully discussed and conferencing was
actually preferred by some. Lists some suggestions for managing computer
conferences involving inexperienced users.",
}

@INPROCEEDINGS{Nati79:Information,
AUTHOR="{National Commission on Libraries} and Information Science",
TITLE="Information for the 1980's: Final Report of White House
Conference on Library and Information Services",
BOOKTITLE="White House Conference on Library and Information Services",
PUBLISHER="White House",
PAGES=808,
YEAR=1979,
KEYWORDS="computer conferencing; information systems",
ABSTRACT="This conference was organized/managed by the EIES computer
conferencing system. A special chapter (pages 767-805) by Elaine Kerr
summarizes the experience. The conference was held November 1979 but the
preceding seven months of planning were largely run by EIES, with 41
committee members from 17 states as follows: Advisory Committee (21
members), Staff (8 members), and Observers (12 of whom 5 were EIES and 7
consultants to the conference). Ten conferences were established (e.g.,
logistics, information center, program committee, evalua- tion). This
was an example of a short duration, specific goals, distributed
membership conference. It took 2 of the 7 months to ``get acquainted''
with the EIES system and acquiring equipment. During the conference,
EIES was used in several ways in conjunction with the Information Center
(e.g., continuous reporting of conference activities, allow delegates to
monitor all groups even though meetings were concurrent, allowing remote
sites to be involved, and allowing contact with the ``home'' groups and
the delegates). Pre-use and post-use questionnaires were used to
evaluate the experience (copy is in the book). In general, EIES had a
positive impact on the quality and quantity of work, and decreased most
participants use of telephone, travel, and mail. Responses to open-ended
questionnaire items are also included. Several tables list actual use
statistics for each conference.",
}

@BOOK{Bron79:Taschenbuch,
AUTHOR="I. N. Bronstein and K. A. Semendjajew",
TITLE="Taschenbuch der Mathematik",
PUBLISHER="Verlag Harri Deutsch",
ADDRESS="Thun and Frankfurt/Main",
YEAR=1979,
}

@ARTICLE{Shiv79:Computer,
AUTHOR="S. G. Shiva",
TITLE="Computer hardware description languages -- a tutorial",
JOURNAL=ieeeproc,
VOLUME=67,
NUMBER=12,
PAGES="1605-1615",
YEAR=1979,
REFERENCES=88,
KEYWORDS="Survey; programming language; language processor; hardware
element; bibliography; hardware design language",
ANNOTE="Just as software designers use high level languages (HLL) to
express the algorithms in terms of language statements to express the
algorithms in terms of language statements digital hardware designers
use hardware description languages (HDL) to describe the system they are
designing. Languages (HDL) to describe the system they are designing.
Although hdl's were originated as a medium of precise yet concise
description of digital hardware, they have found a variety of
applications such as generating user manuals, teaching logic design,
acting as an input medi",
}

@ARTICLE{Shoc79:ETHERNET,
AUTHOR="John F. Shoch and J. A. Hupp",
TITLE="Performance of an {ETHERNET} local network",
JOURNAL=cacm,
VOLUME=23,
PAGES="711-720",
YEAR=1979,
KEYWORDS="LAN",
}

@ARTICLE{Silb79:Management,
AUTHOR="V. Silbey",
TITLE="Management oriented documentation of simulation",
JOURNAL=simuletter,
VOLUME=10,
NUMBER=3,
PAGES="29-34",
YEAR=1979,
REFERENCES=16,
KEYWORDS="Documentation; simulation",
ANNOTE="Simulation documentation for management is the written report
that describes what a simulation does. It acts as a communications
medium between the simulation modeller and the recipient of the
report.",
}

@ARTICLE{Sloa79:Limiting,
AUTHOR="L. J. Sloan",
TITLE="Limiting the lifetime of packets in computer networks",
JOURNAL=cn,
VOLUME=3,
NUMBER=6,
PAGES="435-446",
YEAR=1979,
REFERENCES=16,
KEYWORDS="Computer network; packet switching; reliability; transport",
ANNOTE="This paper describes a method to ensure that a packet is
delivered only if its age does not exceed the maximum packet lifetime.",
}

@ARTICLE{Span79:Modelling,
AUTHOR="O. Spaniol",
TITLE="Modelling of local computer networks",
JOURNAL=cn,
VOLUME=3,
PAGES="315-326",
YEAR=1979,
REFERENCES=12,
KEYWORDS="model; computer network; comparison; performance",
ANNOTE="This paper presents a new concept for local computer networks.
Main features of the new model are: automatic reservations for colliding
packets (thus avoiding repeated collisions); near optimum throughput;
finite maximum waiting times even for priority scheduling policies. The
performance of the system is analyzed by means of a semi-Markov
process.",
}

@ARTICLE{Spee79:Simple,
AUTHOR="B. Speelpenning and Jurg Nievergelt",
TITLE="A simple model of processor-resource utilization in networks of
communication modules",
JOURNAL=ieeetc,
VOLUME="C-28",
PAGES="927-929",
YEAR=1979,
REFERENCES=4,
KEYWORDS="Resource; performance evaluation; multiprocessing",
ANNOTE="A simple model of a system of processors competing for resources
is presented. It permits the derivation of upper bounds for the
utilization of the system components that are surprisingly close to
those previously obtained from far more complicated analyses of
simulations.",
}

@MISC{Spie79:Skriptum,
AUTHOR="P. P. Spies",
TITLE="Skriptum Betriebssysteme",
ADDRESS="Bonn, Germany",
NOTE="Vorlesungsskript Universität Bonn",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Operating system; simulation; simula; model; survey; M/M/1",
ANNOTE="Inhalt: 1. Einleitung 2. Parallele prozesse 3. Koprogramme und
quasiparallele systeme in simula 4. Realisierungen paralleler prozesse
5. Elementare modelle der prozessorverwaltung 6. Speicherverwaltung 7.
Modelle der prozessorverwaltung.",
}

@ARTICLE{Spir79:Queueing,
AUTHOR="J. R. Spirn",
TITLE="Queueing networks with random selection for service",
JOURNAL=ieeese,
VOLUME="SE-5",
PAGES="287-289",
YEAR=1979,
REFERENCES=7,
KEYWORDS="Queueing network; random; resource management; bcmp",
ANNOTE="To the class of queueing networks analyzable by the method of
Baskett, Chandy, Muntz, and Palacios, we add service centers whose
scheduling is random. We show that for purposes of this analysis, the
results are identically to fcfs queueing. Example applications for
random selection scheduling in computer system modeling are provided.",
}

@INPROCEEDINGS{Stas79:Method,
AUTHOR="M. Stastny",
TITLE="The method of loss calculation in the class of eight-stage link
systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos, Italy",
PAGES="1-7",
YEAR=1979,
REFERENCES=5,
KEYWORDS="Communication network; loss system",
ANNOTE="The paper deals with the problem of calculation of the loss
probability between one idle inlet and one or more idle outlets in the
class of eight-stage networks. Various applications of the cirb method
based on the principle of the effective accessibility are examined and
the new method referred to as the method of partial accessibilities is
proposed. This more laborious method takes into account the
stage-dependent accessibilities and to a",
}

@ARTICLE{Stei79:Anwendung,
AUTHOR="K. H. Steinhardt",
TITLE="Anwendung von Wachstumsmodellen zur langfristigen Voraussage von
Fernsprechdichten",
JOURNAL="Frequenz",
VOLUME=33,
PAGES="327-332",
YEAR=1979,
LANGUAGE="German",
REFERENCES=6,
KEYWORDS="Communication network; future outlook; design; telephone",
ANNOTE="In zwei vorhergehenen arbeiten wurde auf die mathematischen
zusammenhänge bei der anwendung von wachstumsmodellen fuer langfris tige
prognosen eingegangen und ein neues prognosesystem zur vo raussage der
zukuenftigen entwicklung vorhandener oder einzufu ehrender
fernmeldedienste beschrieben. In der vorliegenden arb eit sollen diese
allgemeinen ausfuehrungen nunmehr anhand eines speziellen
voraussagefalles erläutert werden.",
}

@ARTICLE{Ster79:Approximation,
AUTHOR="T. E. Stern",
TITLE="Approximation of queue dynamics and their application to adaptive
routing in computer communication networks",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="1331-1335",
YEAR=1979,
REFERENCES=10,
KEYWORDS="Computer network; packet switching; network flow; routing",
ANNOTE="Various adaptive algorithms have been proposed for routing, flow
and congestion control in packet-switched computer communicat ion
networks. In most of them, information on queue lengths, or
equivalently, time delays, at various points in the network is required
for proper adaption. Since up-to-date information is not always
available, these quantities must be estimated based on prior
information. This paper presents approximations for the dyn",
}

@TECHREPORT{Stof79:Hilfsmittel,
AUTHOR="C. Stoffel and J. F. H. Winkler",
TITLE="Hilfsmittel zur Beschreibung der Struktur und Funktion von
Rechensystemen - Ein Überblick über den Stand der Technik",
TYPE="Interner Bericht",
INSTITUTION="Institut für Informatik 3",
ADDRESS="Karlsruhe, Germany",
NUMBER="4/79",
PAGES=49,
YEAR=1979,
LANGUAGE="German",
REFERENCES=14,
KEYWORDS="Survey; comparison; reliability; programming language",
ANNOTE="For the development of hardware-oriented programs a
comprehensive knowledge of the hardware and its properties is necessary.
For the construction of programs, which are independent from special
computer systems, i.e., are to a large degree automatically adaptable, a
system description is required, which can be processed algorithmically.
This paper reviews a number of methods describing the structure and
functional properties of computer systems.",
}

@INPROCEEDINGS{Stra79:Measures,
AUTHOR="K. Strandberg",
TITLE="Measures of effectiveness performance applied to
telecommunication",
BOOKTITLE=itc9,
ADDRESS="Torremolinos, Italy",
PAGES="1-6",
YEAR=1979,
REFERENCES=18,
KEYWORDS="Communication network; performance measure; performance",
ANNOTE="Various measures combining the aspects of the reliability,
maintainability and maintance support performances with the
trafficability and operability performances have been proposed and
applied during the years. It is shown that the measures of these
combined aspects are suitably arranged under one performance concept,
effectiveness performance, defined as the ability of an item.",
}

@ARTICLE{Suns79:Formal,
AUTHOR="C. A. Sunshine",
TITLE="Formal techniques for protocol specification and verification",
JOURNAL=ieeecomp,
VOLUME=12,
NUMBER=9,
PAGES="20-27",
YEAR=1979,
REFERENCES=36,
KEYWORDS="communication protocol; reliability; method; formal",
ANNOTE="Communication protocols play an important role in computer
networks and distributed systems. The increasing variety and complexity
of such protocols demand more powerful techniques to procede sucessful
systems. This article describes some of the more formal techniques which
have been brought to bear on this requirement. We focus on two key
problem areas: protocol specification andverification of logical
correctness.",
}

@ARTICLE{Swar79:Routing,
AUTHOR="E. E. Swartzlander and D. C. Heath",
TITLE="A routing algorithm for signal processing networks",
JOURNAL=ieeetc,
VOLUME="C-28",
PAGES="567-572",
YEAR=1979,
REFERENCES=11,
KEYWORDS="method; routing algorithm; data network; signal processing",
ANNOTE="This paper focuses attention on the information structures
required to implement the signal processing network. Specifically, there
are two key steps in creating a path between two processors: path matrix
construction and path selection. The first operation, path matrix
construction, relates to each processor's view of the network, while
path selection denotes the algorithm that is used to determine candidate
paths between processors. Both",
}

@ARTICLE{Sysk79:Energy,
AUTHOR="R. Syski",
TITLE="Energy of Markov chains",
JOURNAL=aap,
VOLUME=11,
NUMBER=3,
PAGES="542-575",
YEAR=1979,
REFERENCES=19,
KEYWORDS="Markov process; energy of a Markov chain; balayage",
ANNOTE="After preliminaries on Markov chains, super-martingales and pot
ential theory (section 1), the energy of a potential supermartingales
generated by an increasing process is defined. The paper examines some
properties of the energy of potentials of the $ut=p(xt)$ where $p$ is a
purely excessive function (which is also a potential of a charge) for a
Markov chain $(xt)$. Also, the mutual energy of two potentials
associated with the same Markov chain is",
}

@INPROCEEDINGS{Sysk79:Perturbed,
AUTHOR="R. Syski",
TITLE="Perturbed Markovian queues in teletraffic theory",
BOOKTITLE=itc9,
ADDRESS="Torremolinos, Italy",
PAGES=5,
YEAR=1979,
REFERENCES=18,
KEYWORDS="Solved exercise; research problem; Markov process; $M/M/1$",
ANNOTE="A Markovian queue describing a system is perturbed by a
structural change of the system. The perturbed Markov chain is analysed
in terms of its modified matrix of intensities. Two basic methods are
considered, namely compensation method with replacement mechanism, and
the random time change. A concept of energy for Markovian queues is also
introduced. The paper contains several new examples of these techniques
which have not been published befo",
}

@ARTICLE{Tan79:Another,
AUTHOR="H. H. Tan",
TITLE="Another martingale bound of the waiting-time distribution in
{GI/G/1} queues",
JOURNAL=jap,
VOLUME=16,
PAGES="454-457",
YEAR=1979,
REFERENCES=4,
KEYWORDS="Time random variable; evaluation; comparison; GI/G/1; upper
bound; waiting time; Martingale",
ABSTRACT="A new upper bound on the stationary waiting-time distribution
of a GI/G/1 queue is derived following Kingman's martingale approach.
This bound is generally stronger than Kingman's upper bound and is
sometimes stronger than an upper bound derived by Ross.",
}

@ARTICLE{Terp79:Leistungsmessung,
AUTHOR="K. Terplan",
TITLE="Leistungsmessung von Computernetzen",
JOURNAL=aninf,
VOLUME=8,
PAGES="329-333",
YEAR=1979,
LANGUAGE="German",
REFERENCES=9,
KEYWORDS="performance evaluation; communication network; monitoring",
ANNOTE="In order to ensure that computing networks operate efectively at
all times measurements are needed. After discussing the factors
requiring measurement networks design criteria will be discussed in
greater detail. The major focus of the article is on measurement
capabilities of tesdata based measurement networks using ms 88 and ms
58. Also measurement results are included.",
}

@ARTICLE{Tiet79:Was,
AUTHOR="W. Tietz",
TITLE="Was ist {X.25?}",
JOURNAL=er,
VOLUME=21,
PAGES=139,
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Packet switching; X.25",
}

@ARTICLE{Tows79:Stutter,
AUTHOR="Donald F. Towsley",
TITLE="The stutter go back-n {ARQ} protocol",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="869-875",
YEAR=1979,
REFERENCES=7,
KEYWORDS="Transmission principle; packet switching; arq",
ANNOTE="In this paper we consider the problem of designing a good arq
protocol for a message transmission environment characterized by high
error rates and/or long propagation delays. We derive the average queue
length for an idealized arq protocol for such an environment. We also
describe a modification that can be made to existing arq protocols which
can significantly decrease queue lengths in such an environment. We show
that for the case of low mes",
}

@ARTICLE{Triv79:Decision,
AUTHOR="K. S. Trivedi and R. A. Wagner",
TITLE="A decision model for closed queueing networks",
JOURNAL=ieeese,
VOLUME="SE-5",
PAGES="328-332",
YEAR=1979,
REFERENCES=22,
KEYWORDS="Model; closed queueing network; performance evaluation",
ANNOTE="This paper considers a computer configuration design problem.
The computer system is modeled by a closed queueing network. The system
throughput is the objective function to be maximized and the speed of
the devices are the decision variables. A rich class of nonlinear cost
functions is considered. It is shown that any local optimum of the
optimization problem is also a global optimum. It is also shown that the
cost constraint is active and tha",
}

@ARTICLE{Turn79:Investigation,
AUTHOR="R. Turner",
TITLE="An investigation of several mathematical models of queueing
systems",
JOURNAL=per,
VOLUME=8,
NUMBER="1-2",
PAGES="37-44",
YEAR=1979,
REFERENCES=5,
KEYWORDS="Event sequencing; computer reaction time; time sharing",
ANNOTE="A number of simple mathematical models were used to predict
average response time of a timesharing system. The target system was a
very simple trace driven simulation model, but the workloads were trace
obtained from a real system in normal operation. As such, the workloads
were characterized by very high coefficients of variation in resource
demands and think times. Mathematical models of the system included
independent arrival models (M/M/1",
}

@ARTICLE{Unge79:Operating,
AUTHOR="B. W. Unger and James Parker",
TITLE="An operating system implementation and simulation language
{(OASIS)}",
JOURNAL=simuletter,
VOLUME=11,
PAGES="151-161",
YEAR=1979,
REFERENCES=12,
KEYWORDS="model; application; event sequencing; SIMULA; simulation",
ANNOTE="An approach to the implementation and simulation of system
software for multicomputer architectures is described. OASIS, a variant
of the SIMULA language, provides tools for both hardware modeling and
system software development. hardware is characterized at the
processor/memory level so that system software resource control and
allocation policies can be implemented at a functional level. Concurrent
module execution by multiple processors, wit",
}

@INPROCEEDINGS{Urmo79:Reduction,
AUTHOR="W. Urmoneit",
TITLE="Reduction of the rank of the system of linear equations to be
solved for the exact calculation of the loss probability of link
systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos, Italy",
PAGES="1-8",
YEAR=1979,
REFERENCES=7,
KEYWORDS="Communication network; loss system",
ANNOTE="This paper deals with a special problem -the reduction of the
rank of the system of equations for the state of probability-, which
occurs by exactly determining the loss probability. The essential result
of this paper is that the simple reduction of the number of unknowns has
made it possible to vary the structure of the link system within wider
limits than before.",
}

@BOOK{Vite79:Principles,
AUTHOR="Andrew J. Viterbi and J. K. Omura",
TITLE="Principles of digital communication and coding",
PUBLISHER="McGraw Hill",
ADDRESS="New York, New York",
YEAR=1979,
KEYWORDS="Coding theory",
}

@INPROCEEDINGS{Vran79:Results,
AUTHOR="C. Vrana",
TITLE="Some results from a simulation of queueing networks with
dependent service times",
BOOKTITLE=itc9,
ADDRESS="Torremolinos, Italy",
PAGES="1-9",
YEAR=1979,
REFERENCES=6,
KEYWORDS="Computer network; store-and-forward; simulation; queueing",
ANNOTE="In store and foreward data-communication networks it is not
unusual that a message keeps its length while transmitted through the
network. This causes the interdeparture times to be dependent on service
times. In such a case exact mathematical analysis is difficult or may be
impossible. In the first part of this paper some results from a
simulation of simple nets of single servers are presented. In the second
part an approximative numerical",
}

@INPROCEEDINGS{Walk79:Statistic,
AUTHOR="B. Walke",
TITLE="A statistic-priority queue with time slicing",
BOOKTITLE=itc9,
ADDRESS="Torremolinos, Italy",
PAGES="519/1-7",
YEAR=1979,
REFERENCES=10,
KEYWORDS="M/G/1; prehol priority; feedback; two-stage discipline",
ANNOTE="An infinite queue single-server model with $n$ external
preemptive-resume priorities is analysed. In each priority level the
service discipline may be either FCFS or MLFCFS (multi-level FCFS). In
the mlfcfs discipline service requests are assigned to different
sublevels within a priority level, dependent on the amount of attained
service. Between such sublevels the feedback discipline fb-infinite is
applied.",
}

@ARTICLE{Walk79:Zur,
AUTHOR="B. Walke",
TITLE="Zur Anwendung optimaler Bedienstrategien in Rechnern",
JOURNAL="Informatik Fachberichte",
PUBLISHER="Springer-Verlag",
VOLUME=19,
PAGES="352-367",
YEAR=1979,
LANGUAGE="German",
REFERENCES=7,
KEYWORDS="Application; performance evaluation; priority; hol",
ANNOTE="Es wird die anwendung eines bekannten kriteriums zur
kostenminimalen bedienung wartender aufgaben anhand von beispielen
erläute rt. Das kriterium ist vor allem bei stark streuenden
bediendauerverteilungen der aufgaben nuetzlich. Fuer diesen fall wird
gezeigt wie, durch geschickte modellierung, eine einfache praktikable
bedienstategie entsteht, deren mittlere wartezeit analytisch berechenbar
ist.",
}

@ARTICLE{Wats79:Simulation,
AUTHOR="B. W. Watson",
TITLE="Simulation study of the traffic dependent performance of a
prioritized {CSMA} broadcast network",
JOURNAL=cn,
VOLUME=3,
NUMBER=6,
PAGES="427-434",
YEAR=1979,
REFERENCES=10,
KEYWORDS="simulation; priority; broadcast; communication",
ANNOTE="A csma broadcast network engaged in short to very long message
transmission has been studied via a discrete event simulation. These
studies imply that no advantage is to be obtained in a two trunk network
by dedicating one trunk to long message transmission and the other to
short message transmission.",
}

@ARTICLE{Weck79:Computer,
AUTHOR="S. Wecker",
TITLE="Computer network architecture",
JOURNAL=ieeecomp,
VOLUME=12,
NUMBER=9,
PAGES="58-72",
YEAR=1979,
KEYWORDS="survey; communication network",
ANNOTE="On balance, however, this paper is a reasonable introduction to
the topic area.",
}

@ARTICLE{West79:Updating,
AUTHOR="D. West",
TITLE="Updating mean and variance estimates: an improved method",
JOURNAL=cacm,
VOLUME=22,
PAGES="532-535",
YEAR=1979,
REFERENCES=7,
KEYWORDS="Expectation; standard deviation; moment estimation; numerical
method; comparison; runtime/storage efficiency; variance",
ABSTRACT="A method of improved efficiency is given for updating the mean
and variance of weighted sampled data when an additional data value is
included in the set. Evidence is presented that the method is stable and
at least accurate as the best existing updating method.",
}

@INPROCEEDINGS{Wiec79:Simulation,
AUTHOR="C. A. Wiecek and S. C. Stelly",
TITLE="Performance simulation as a tool in {CPU} design",
BOOKTITLE="Conference on simulation measurement and modeling of",
YEAR=1979,
KEYWORDS="Simulation; performance evaluation",
}

@ARTICLE{Will79:Techniques,
AUTHOR="R. Willis",
TITLE="Techniques in simulation which enhance software reliability",
JOURNAL=per,
VOLUME=8,
PAGES="102-115",
YEAR=1979,
REFERENCES=9,
KEYWORDS="Simulation; reliability; software; model; programming",
ANNOTE="A simplified simulation study of an actual software development
effort is presented. A model is developed and exercised through various
stages of modifications to an originally unreliable software design
until a viable software design result. Techniques in model development,
simulaion analysis and language capability which lead to enhanced
software reliability are discussed. Uniquenesses in the approach
presented are contrasted to simulation",
}

@ARTICLE{Wink79:Prozesskonzept2,
AUTHOR="J. F. H. Winkler",
TITLE="Das Prozesskonzept in Betriebssystemen und Programmiersprachen
I",
JOURNAL=infspec,
VOLUME=2,
PAGES="219-229",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Process management; operating system; programming language",
ANNOTE="In der vorliegenden arbeit werden eine reihe verschiedener
prozesskonzepte mit einem einheitlichen begriffsschema beschrieben. In
einer übersicht werden die prozesskonzepte von 7 algorith mischen und 6
echtzeitsprachen anhand von 25 merkmalen charakterisiert und einander
gegenübergestellt.",
}

@TECHREPORT{Wink79:Prozesskonzept1,
AUTHOR="J. F. H. Winkler",
TITLE="Das Prozesskonzept in Betriebssystemen und Programmiersprachen
I",
TYPE="Interner Bericht",
INSTITUTION="Institut für informatik 3",
ADDRESS="Karlsruhe, Germany",
NUMBER="3/79",
PAGES="1-52",
YEAR=1979,
LANGUAGE="German",
REFERENCES=51,
KEYWORDS="survey; bibliography; programming language; PL/1; pascal;
language; Algol; concurrent Pascal; Pearl; Modula-2",
ANNOTE="The concept of process is used in operating systems, command and
programming languages. Using this concept simplifies the construction of
operating systems considerably. The concept of process is an essential
feature of real-time languages. This paper describes several different
realizations of this concept by means of a uniform framework. The
process concepts of six algorithmic and six real-time languages are
characterized by 23 features.",
}

@ARTICLE{Witt79:Entwicklungslinien,
AUTHOR="E. Witte",
TITLE="Entwicklungslinien der Telekommunikation",
JOURNAL=infspec,
VOLUME=2,
NUMBER=1,
PAGES="37-41",
YEAR=1979,
LANGUAGE="German",
REFERENCES=8,
KEYWORDS="Survey; future outlook; application; human factors",
ANNOTE="Computer and telecommunication systems develop towards each
other. Especially the new forms of telecommunication, viewdata,
telecommunication typewriter service, facsimile transmission, electronic
mail, cable tv, and cable text require a combined design of computer
elements and telecommunication systems. From this co mbination may arise
new functions and tasks for informatics.",
}

@ARTICLE{Wong79:Response,
AUTHOR="J. W. Wong",
TITLE="Response time distribution of the {M/M/M/N} queueing model",
JOURNAL=or,
VOLUME=27,
PAGES="1196-1202",
YEAR=1979,
REFERENCES=7,
KEYWORDS="M/M/s/*/n; time in system; normal distribution",
ANNOTE="We analyze the M/M/M/N queueing model with a first-come,
first-served discipline and show that the distribution of the response
time (i.e., queueing time + service time) is asymptotically normal as
$n$ increases. The mean and variance of this normal distribution are
both simple functions of the model parameters.",
}

@ARTICLE{Wong79:Self,
AUTHOR="J. W. Wong and G. Scott",
TITLE="Self-assessment procedure 6",
JOURNAL=cacm,
VOLUME=22,
PAGES="449-454",
YEAR=1979,
REFERENCES=34,
KEYWORDS="Queueing system; simulation; measurement; communication",
ANNOTE="A self-assessment procedure dealing with queueing network models
of computer systems.",
}

@ARTICLE{Wong79:Distributed,
AUTHOR="J. K. Peacock and J. W. Wong and E. Manning",
TITLE="Distributed simulation using a network of processors",
JOURNAL=cn,
VOLUME=3,
PAGES="44-56",
YEAR=1979,
REFERENCES=22,
KEYWORDS="Distributed simulation; discrete event simulation",
ANNOTE="Simulation, particulary of networks of queues, is an application
with a high degree of inherent parallelism and is of great practical
interest. We hope to exploit this parallelism by performing simulations
using a network of cheap, but slow, micro-processors. We define a
taxonomy by which we classify a number of parameters of a distributed
simulation method, and seek solutions to problems of synchronization,
deadlock prevention, and inter-pro",
}

@ARTICLE{Yeh79:Simulation,
AUTHOR="J. W. Yeh",
TITLE="Simulation of local computer networks - a case study",
JOURNAL=cn,
VOLUME=3,
PAGES="401-417",
YEAR=1979,
KEYWORDS="Simulation; incremental modeling; LAN; computer network model;
validation; communication protocol",
ABSTRACT="This paper is a report on the modeling technique employed in
simulating several local networks that use network systems corporation
hyper channel products. The technique involves incremental modeling
based on systematic model construction and validation. Three levels of
incrementation were used, with each level systematically constructed and
validated according to the hypernet protocol corresponding to it. The
detailed tasks of model construction \ldots",
}

@ARTICLE{Yu79:One,
AUTHOR="Lige Yu and J. C. Majithia",
TITLE="An analysis of one direction of window mechanism",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="778-788",
YEAR=1979,
REFERENCES=9,
KEYWORDS="Communication protocol; HDLC; X.25; window mechanism",
ABSTRACT="A queueing model is presented for the analysis of one
direction of window mechanism as used in numerous data communication
control procedures, e.g., X.25, HDLC and SDLC. Two models of message
length are considered viz. Fixed length and exponential distribution. A
novel approach is used to determine an effective service time to account
for possible inserted idle time while waiting for the window to reopen.
A set of delay characteristics is determined.",
}

@INBOOK{Zeig79:Methodology,
AUTHOR="B. P. Zeigler and M. S. Elzas and  others",
TITLE="Methodology in systems modelling and simulation",
PUBLISHER="North Holland",
ADDRESS="Amsterdam, Holland",
PAGES=529,
YEAR=1979,
KEYWORDS="Survey; bibliography; method; model; fundamentals",
ANNOTE="Section 1: conceptual bases section 2: multifacted modelling:
approaches and issue section 3: software tools for model construction
section 4: structure identification and model calibration section 5:
modelling methodology in design section 6: theory in modelling and
simulation.",
}

@TECHREPORT{Zorn79:Messungen,
AUTHOR="W. Zorn",
TITLE="Messungen im {BS} 2000",
TYPE="Interner Bericht",
INSTITUTION="Universität Karlsruhe",
NUMBER="10/79",
PAGES="1-25",
YEAR=1979,
LANGUAGE="German",
REFERENCES=19,
KEYWORDS="Operating system; memory management; tuning",
ANNOTE={Anlagenvergleich während eines Auswahlverfahrens; Leistung
sabnahme während des Probebetriebs; Auslastungsermittlung im Betrieb;
Abrechnung von Rechenleistung (Accounting); Schwachstellenanalyse;
systemoptimierungen; langfristplanung; "Wie effizient werden
Siemens-anlagen unter BS2000 betrieben?"},
}

@INPROCEEDINGS{Fory79:Characterization,
AUTHOR="L. J. Forys and H. Zucker",
TITLE="A Characterization of Traffic Variability for {SPC} Systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos, Italy",
YEAR=1979,
REFERENCES=4,
KEYWORDS="Circuit switching; traffic model; instationary arrival",
ANNOTE={Recent data indicates that the traffic offered to a local SPC
switching system may not be adequately characterized by a stationary
Poisson process, even for intervals as short as 15 minutes. Using a
simple model of an SPC system, a traffic pattern is determined which
upper bounds the real time capacity of such systems. A good
approximation th this "worst case" pattern is a two level Poisson
process.},
}

@ARTICLE{Chen79:Associative,
AUTHOR="I. Chen and Pi-Chun Chen and T. Feng",
TITLE="Associative processing of network flow problems",
JOURNAL=ieeetc,
VOLUME="C-28",
NUMBER=3,
PAGES="184-190",
YEAR=1979,
KEYWORDS="Network flow; parallel computing; simulation",
ANNOTE="Application of associative processors to the solution of the
maximal flow problem is investigated. To take maximum advantage ofthe
capability of associative processors, a new algorithm based on matrix
representation is developed. The new algorithm is thencompared with the
associative version of the Ford and Fulkerson labeling method. The
comparison is made on the total associative memory access time required
for problem solution by each algo.",
}

@ARTICLE{Chow79:Models,
AUTHOR="Y. S. Chow and W. Kohler",
TITLE="Models for Dynamic Load Balancing in a Heterogeneous Multiple
Processor System",
JOURNAL=ieeetc,
VOLUME="C-28",
NUMBER=5,
PAGES="354-361",
YEAR=1979,
KEYWORDS="Multiprocessor system; load balancing; queueing system",
ANNOTE="The models with nodeterministic policies are analyzed using
standard queueing network techniques. An approximate numerical meth od
is introduced for analyzing two-processor heterogeneous mode ls with
deterministic routing policies and the performance of sample
two-processor systems is compared. The comparison shows th at a
deterministic strategy that maximizes the expected throughput during the
next interarrival gives the best performance.",
}

@BOOK{Davi79:Computer,
AUTHOR="Donald W. Davies and D. Barber and C. Solomonides",
TITLE="Computer Networks and Their Protocols",
PUBLISHER="John Wiley",
ADDRESS="New York, New York",
YEAR=1979,
KEYWORDS="Computer network; routing algorithm; flow control",
ANNOTE="1. Computer networks 2. Packet switching 3. Routing 4. Flow
control and congestion avoidance 5. Packet broadcast systems 6.
Communication protocols and interfaces 7. High Level protocols",
}

@ARTICLE{Mino79:Analytical,
AUTHOR="Daniel Minoli and I. Gitman and D. Walters",
TITLE="Analytical Model for Initialization of Single Hop Packet Radio
Networks",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=12,
PAGES="1959-1964",
YEAR=1979,
KEYWORDS="Packet radio; performance evaluation; analysis",
ANNOTE="Reccent studies have that PRNET can easily be saturated and
become unstable unless efficient routing and flow control algorithms are
used. To enable point-to-point packet transportation, network stations
assign a code to each repeater; the process of assigning such labels is
referred to as network initialization. The initialization procedure
assumes that the network topology is not known a priori and is changing
with time.",
}

@ARTICLE{Schu79:Distributed,
AUTHOR="D. M. Schutzer",
TITLE="An Analysis of a Distributed Switching Network with Integrated
Voice and Data in Support of Command and Control",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=7,
PAGES="1124-1130",
YEAR=1979,
KEYWORDS="Switching system; voice/data integration; performance",
ANNOTE="This paper explores the potential for increased transmission
efficiency of military tactical command and control data links through
voice/data integration. The relationship between voice and data
communication as they are employed in support of Military Command is
examined, and operation advantages to the integrati on of voice and data
are enumerated. A message processing/handling paradigm of the command
and control process is introduced.",
}

@BOOK{Welc79:Signalling,
AUTHOR="S. Welch",
TITLE="Signalling in Telecommunications Networks",
ISBN="0 906048-04-4",
PUBLISHER="Institution of Electrical Engineers Peregrinus P. LTD",
YEAR=1979,
KEYWORDS="Signalling; communication network",
ANNOTE="1. Signalling function; 2. Subscriber line signalling; 3.
Junction network signalling; 4. Pulse repetition and pulse distortion;
5. Long-distance DC signalling 6; PCM signalling 7; Influence of
transmission on signalling",
}

@INPROCEEDINGS{Aage79:Traffic,
AUTHOR="F. A. Aagesen",
TITLE="A traffic study on the satellite channel access algorithm
{CPODA}",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-8",
YEAR=1979,
REFERENCES=17,
KEYWORDS="Satellite radio; packet switching; multiple access; access
protocol",
ANNOTE="A general discussion of satellite channel access algorithms is
performed and a summary of existing algorithms is given. The main topic
of this paper is, however, to present results from a traffic study on
the satellite channel access algorithm CPODA. The parameters involved
are the framelength, the reservation subframe minimum, the packet
length, the packet intensity, the number of ground stations and the
round trip time.",
}

@INPROCEEDINGS{Akiy79:Variable,
AUTHOR="M. Akiyama",
TITLE="Variable communication network design",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-9",
YEAR=1979,
REFERENCES=4,
KEYWORDS="Computer network; channel capacity; rearrangement; user
fluctuation",
ANNOTE="This paper studies on the means to give network an adaptability
to withstand extraordinary traffic variation. It proposes a ``variable
communication network''. The network has an ability to rearrange channel
configuration effectively when an extraordinary traffic arises, using a
semipermanent switching equipment at each switching node. The procedures
to design and to rearrange the variable communication network are
discussed.",
}

@BOOK{Albr79:Numerische,
AUTHOR="P. Albrecht",
TITLE="Die numerische Behandlung gewöhnlicher Differentialgleichungen",
PUBLISHER="Carl Hanser Verlag",
ADDRESS="München",
PAGES="1-208",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Numerical method; differential equation",
}

@ARTICLE{Alfo79:FAST,
AUTHOR="C. Alford and B. Bechdolt and D. Ferris and S. T. Goodspeed and
P. Griffith",
TITLE="{FAST-Schottky-TTL:} Schnell und ``Energiebewusst''",
JOURNAL="Elektronik",
VOLUME=26,
PAGES="45-51",
YEAR=1979,
LANGUAGE="German",
REFERENCES=1,
KEYWORDS="Design; hardware element; digital; TTL; logic element",
ANNOTE="Beschreibung einer neuen TTL-Logikfamilie, die schneller als
standard (bzw. LS) ist und erheblich weniger Leistung verbraucht.",
}

@INPROCEEDINGS{Alme79:Behavior,
AUTHOR="G. T. Almes and E. D. Lazowska",
TITLE="The behavior of Ethernet-like computer communications networks",
BOOKTITLE="ACM Operating System Review (SIGOPS), 7th symposium on
operating system principles",
PAGES="66-81",
YEAR=1979,
REFERENCES=14,
KEYWORDS="Communication network; packet switching; LAN; simulation;
comparison; communication protocol; broadcast; Ethernet; low level
protocol",
ANNOTE="We begin by describing the policies common to Ethernet-like
systems and by using an analytic model to study their behavior. We then
precisely describe the mechanisms used in Ethernet itself, exploring its
detailed behavior by means of a simulation model. Results from the two
models, and particulary from their comparison, provide insight into the
nature of low-level protocols in local area broadcast networks.",
}

@ARTICLE{Ande79:Serial,
AUTHOR="S. C. Andersen",
TITLE="A serial data bus control method",
JOURNAL=cn,
VOLUME=3,
PAGES="361-372",
YEAR=1979,
KEYWORDS="Computer network; bus",
}

@ARTICLE{Arth79:Single,
AUTHOR="E. Arthurs and B. W. Stuck",
TITLE="Analysis of a single-buffer loss-delay system",
JOURNAL=or,
VOLUME=27,
PAGES="65-79",
YEAR=1979,
KEYWORDS="Queueing system",
}

@ARTICLE{Arvi79:Toggle,
AUTHOR="A. C. Arvillias and D. G. Maritsas",
TITLE="Toggle registers generating in parallel $k$ $k$th decimations",
JOURNAL=ieeetc,
VOLUME="C-28",
YEAR=1979,
REFERENCES=13,
KEYWORDS="Design; realization; application; method; Tausworthe
generator; shift register sequences",
ANNOTE="For the class of primitive trinomials $x^p+x^k+1$ with
$(k,2**p-1)=1$, shift register constructions are presented which are
designed to produce in parallel consecutive patterns, of $k$-consecutive
bits each, of the corresponding m-sequences.  The resultant class of
register structures preserves the function of equivalent feedback shift
registers (FSR's) with composite feedback logic while allowing a saving
in the physical implementation which amounts",
}

@INCOLLECTION{Balb79:Homogeneous,
AUTHOR="G. Balbo and P. J. Denning",
TITLE="Homogeneous approximations of general queueing networks",
BOOKTITLE="Performance of computer systems",
PUBLISHER="North Holland",
ADDRESS="New York",
PAGES="353-374",
YEAR=1979,
KEYWORDS="Queueing approximation; queueing network; queue length",
ANNOTE="We will show that, corresponding to any given general queueing
network, there exists a product-form queueing network of the same
topology whose queue length distributions are identical to those of the
given network",
}

@INPROCEEDINGS{Bard79:Extensions,
AUTHOR="Y. Bard",
TITLE="Some extensions to multiclass queueing network analysis",
BOOKTITLE="Performance of Computer Systems",
PUBLISHER="Elsevier North Holland",
ADDRESS="Vienna, Austria",
PAGES="51-62",
YEAR=1979,
KEYWORDS="Performance evaluation; queueing network; queueing
approximation; MVA",
ANNOTE="Heuristic approximations are an attractive alternative to
simulation for computer system models without tractable solutions. Mean
value analysis is a new algorithm for the exact solution of computer
system queueing models, and a basis for approximation techniques. This
paper gives a comprehensive and unified treatment of approximations
based on and similar to mean value analysis, including approximations
the author proposed prior to the discove",
}

@INPROCEEDINGS{Bast79:Call,
AUTHOR="S. Bastiani and P. G. Kubanski",
TITLE="Specific call congestion of multi-flow bulk traffic in loss
systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-4",
YEAR=1979,
REFERENCES=1,
KEYWORDS="Communication network; network congestion; loss system",
ANNOTE="The object of this paper is to determine the call-congestion in
loss systems characterised by an offered traffic of superimposed streams
of bulk-events. The compound, input process is represe nted by the
z-transforms of each component streams, and a simple recursive method
calculates the single state-occupancy terms of the trunkated
distribution from which the individual losses of each stream are
determined.",
}

@INPROCEEDINGS{Batc79:Massively,
AUTHOR="K. E. Batcher",
TITLE="The massively parallel processor",
BOOKTITLE="AIAA conference",
PAGES="93-97",
YEAR=1979,
KEYWORDS="Parallel computing; multiprocessor system",
ANNOTE="16384 PEs; custom LSI microprocessors, 1 bit, pixel processor",
}

@BOOK{Baue79:Program,
AUTHOR="F. L. Bauer and M. Ed. Broy",
TITLE="Program construction",
PUBLISHER="Springer Verlag",
ADDRESS="Berlin",
VOLUME=69,
PAGES="1-617",
NOTE="Lecture notes in computer science",
YEAR=1979,
KEYWORDS="Design; reliability; programming language; program
construction; graph marking algorithm; program transformation; abstract
data type",
ANNOTE="1. The thinking programmer; 2. Program verification; 3. Program
development by transformation; 4. Special language considerations and
formal tools",
}

@INCOLLECTION{Baum79:End,
AUTHOR="D. Baum and W. Lehmann-Bauerfeld and R. Popescu-Zeletin and K.
Ullmann",
TITLE="End-to-End Level Data Flow Analysis for Communication Networks",
BOOKTITLE="Flow control in computer networks",
EDITOR="Jean-Louis Grange and Michel Gien",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam",
PAGES="321-333",
YEAR=1979,
KEYWORDS="Communication network; end-to-end flow control",
}

@INPROCEEDINGS{Bear79:Approximation,
AUTHOR="D. B. Bear",
TITLE="An approximation for the delay distribution of the {M/G/N} queue
and an exact analysis for the {M/E.2/N} queue with random service",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-6",
YEAR=1979,
REFERENCES=16,
KEYWORDS="Waiting time; queueing approximation; M/G/N; M/Ek/N; random;
IFO",
ANNOTE="An approximation to the delay distribution for a multi-trunk
system with Poisson input, general holding time distribution, and FIFO
or random order of service is described. The results are compared with
those of an exact analysis of the case of random service and 2-stage
Erlangian holding time distribution.",
}

@INPROCEEDINGS{Benn79:Simulation,
AUTHOR="D. A. Bennett",
TITLE="Simulation of a distributed system for performance modelling",
BOOKTITLE="winter simulation conference",
PAGES="49-56",
YEAR=1979,
KEYWORDS="Simulation",
}

@ARTICLE{Bera79:Zur,
AUTHOR="G. Berauer",
TITLE="Zur Berechnung der Verbundverteilungsdichten beliebig
verarbeiteter endlicher Zufallsprozesse",
JOURNAL=aeu,
VOLUME=33,
NUMBER=3,
PAGES="125-129",
YEAR=1979,
LANGUAGE="German",
REFERENCES=5,
KEYWORDS="Transform; joint density function",
ANNOTE="The joint probability density function $f$ the random variables
of process $y$, being the output process of an arbitrary mapping applied
to an input process $x$, is equal to the expectation of a
multidimensional delta-function.  It is shown that this holds exactly
under very general assumptions.  A special statement is given for the
case that the output process contains more variables than the input
process.",
}

@ARTICLE{Berg79:Quantitative,
AUTHOR="R. Bergmann",
TITLE="Quantitative properties and bounds for the serial covariances of
waiting times in single-server queues",
JOURNAL=or,
VOLUME=27,
PAGES="1168-1178",
YEAR=1979,
REFERENCES=4,
KEYWORDS="GI/G/1; covariance; waiting time; simulation",
ANNOTE="For the stationary waiting time process of a GI/G/1 queue we
prove the empirically obvious fact that if the service times are
increased and the interarrival times decreased, the the correlation of
waiting times of successeive customers is increased. If the service and
interarrival times are respectively larger or smaller than for given
exponential service or interarrival times, then the serial covariances
of waiting times are bounded by the",
}

@BOOK{Bert79:Algorithms,
AUTHOR="D. P. Bertsekas",
TITLE="Algorithms for Nonlinear Multicommodity Network Flow Problems",
PUBLISHER="International Symposium on System Optimization and Analysis,
Bensoussan and Lions, Springer-Verlag",
PAGES="210-224",
YEAR=1979,
REFERENCES=9,
KEYWORDS="Routing algorithm; optimization; distributed routing; network
flow",
ANNOTE="This paper presents a class of algorithms for optimization of
convex multicommodity flow problems. The algorithms are based on the
ideas of Gallager's methods for distributed optimization of delay in
data communication networks and gradient projection ideas from nonlinear
programming.",
}

@ARTICLE{Bhat79:CPU,
AUTHOR="U. Narayan Bhat and R. E. Nance",
TITLE="An evaluation of {CPU} efficiency under dynamic quantum
allocation",
JOURNAL=jacm,
VOLUME=26,
PAGES="761-778",
YEAR=1979,
REFERENCES=23,
KEYWORDS="Model; time sharing; performance evaluation; CPU; feedback;
overhead time; semi Markov process; operating system",
ANNOTE="A model for a time-sharing operating system is developed in
order to assess the effects of dynamic quantum allocation and overhead
variability on central processing unit (CPU) efficiency. CPU efficiency
is determined by the proportion of time devoted to user-oriented
(problem state) tasks within a busy period. Computational results
indicate that a dynamic quantum allocation strategy produces significant
differences in CPU efficiency compared",
}

@ARTICLE{Bish79:Implementing,
AUTHOR="J. M. Bishop",
TITLE="Implementing strings in {PASCAL}",
JOURNAL="Software",
VOLUME=9,
NUMBER=9,
PAGES="779-788",
YEAR=1979,
REFERENCES=4,
KEYWORDS="PASCAL; programming language",
ANNOTE="Sale has proposed that strings be realized in pascal using the
existing sequence abstraction. This short note supports this proposal
and shows how strings can be efficiently implemented in standard pascal.
The implementation is done in such a way as to leave existing programs
undisturbed should strings be subsequently incorporated in the language
and/or compiler.",
}

@ARTICLE{Boch79:Development,
AUTHOR="Gregor V. Bochmann and T. Joachim",
TITLE="Development and structure of an {X.25} implementation",
JOURNAL=ieeese,
VOLUME="SE-5",
PAGES="429-439",
YEAR=1979,
REFERENCES=13,
KEYWORDS="X.25; realization; program construction; communication
network; software; concurrent PASCAL; specification",
ANNOTE="This paper describes experience with an implementation of the
X.25 communication protocols for accessing public data networks. The
implementation effort is characterized by: 1) the development of a
formalized protocol specification on which all further implementation
work is based, and 2) the use of concurrent PASCAL as the implementation
language.",
}

@INPROCEEDINGS{Boec79:Simulation,
AUTHOR="G. Boeckle",
TITLE="Simulation and performance analysis of an {X.25} network",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
ADDRESS="Washington, DC",
PAGES="3.3.1-3.3.7",
YEAR=1979,
REFERENCES=4,
KEYWORDS="X.25; simulation; model; flow optimization; performance
evaluation; GASP; virtual channel; network flow; indow mechanism; X.75",
ANNOTE="In this paper, a model is described which was used for
simulating the X.25 packet level in a network consisting of three nodes,
each linked with six hosts. The working principles of the nodes are
described, as well as the input and output of the simulation program.",
}

@PROCEEDINGS{Boll79:Surveys,
TITLE="Surveys in combinatorics",
EDITOR="B. Bollobas",
SERIES="London Mathematical Society Lecture Note Series",
PUBLISHER="Cambridge University Press",
VOLUME=38,
PAGES="1-200",
NOTE="Proc. 7th British Combinatorial Conference",
YEAR=1979,
KEYWORDS="Survey; combinatorial method; graph theory; special issue",
ANNOTE="The topics covered reflect the breadth of the subject and
include graph theory, matroids, combinatorial set theory, projective
geometry and combinatorial group theory.",
}

@INPROCEEDINGS{Bolo79:Characterizing,
AUTHOR="V. A. Bolotin and V. S. Prokopovich",
TITLE="Characterizing traffic variations",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-5",
YEAR=1979,
REFERENCES=9,
KEYWORDS="Traffic intensity; distribution; loss system; variance",
ANNOTE="Many important results have been obtained by authors studying
the problem of traffic variation among time periods.  However, there is
much to be done, and therefore we suggest some ideas related to the
problem.  Let us consider traffic (offered load) on a certain trunk
group for all hours of the year.  We assume that for every hour traffic
is a random variable with some distribution function.  A subset of hours
with identical distribution functions may be called a set of homogeneous
hours",
}

@ARTICLE{Bowk79:Minimizing,
AUTHOR="T. G. Bowker",
TITLE="Minimizing curve-plotting calculation",
JOURNAL=byte,
VOLUME=4,
NUMBER=12,
PAGES="134-182",
YEAR=1979,
KEYWORDS="diagram manipulation; graphics",
ANNOTE="The article discusses the problem of plotting a curve of a
defined continuous function when either the slope of part of the curve
is steep or the curvature is large.",
}

@ARTICLE{Boxm79:Approximations,
AUTHOR="O. J. Boxma and J. W. Cohen and N. Huffels",
TITLE="Approximations of the mean waiting time in an M/G/s queueing
system",
JOURNAL=or,
VOLUME=27,
PAGES="1115-1127",
YEAR=1979,
KEYWORDS="Queueing system; approximation; mean waiting time; M/G/N;
queueing approximation; multiserver",
ANNOTE="This paper considers the problem of obtaining approximate
expressions for the first moment $w\_{gs}$ of the stationary waiting
time distribution in an M/G/S queueing system. Special attention is paid
to the case $G=D$, i.e. constant service times. Most known
approximations are in fact heavy traffic approximations which have
rather large relative errors in the light traffic case. In the present
study both the light traffic and heavy traffic behavior.",
}

@INPROCEEDINGS{Boxm79:Two,
AUTHOR="O. J. Boxma",
TITLE="Two queues in series with non-overlapping service times",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-6",
YEAR=1979,
REFERENCES=9,
KEYWORDS="Tandem queue; exponential distribution; waiting time",
ANNOTE="This paper considers a queueing system consisting of two single
server queues in series, in which the service time of an arbitrary
customer at the second queue is always longer than any service time at
the first queue. Customers arrive at the first queue according to a
poisson process",
}

@BOOK{Bray79:Data,
AUTHOR="O. H. Bray and H. A. Freeman",
TITLE="Data base computers",
PUBLISHER="Lexington Books, D. C. Heath and Company",
ADDRESS="Lexington, Massachusetts",
PAGES="1-179",
YEAR=1979,
REFERENCES=189,
KEYWORDS="Information system; computer system; cost; Performance
evaluation; database",
ANNOTE="Contents: 1. Introduction 2. Data base system requirements 3. An
example data base 4. Evaluation criteria for data base computers 5. Data
base computer architectures 6. Conclusions.",
}

@ARTICLE{Brig79:Quasi,
AUTHOR="H. S. Bright and R. L. Enison",
TITLE="Quasi-random number sequences from a long-period tlp generator
with remarks on application to cryptography",
JOURNAL=acmcs,
VOLUME=11,
PAGES="357-370",
YEAR=1979,
REFERENCES=41,
KEYWORDS="Survey; bibliography; random number generation; shift register
sequences; Tausworthe generator; cryptology",
ANNOTE="The background of the Lehmer linear congruential algorithms that
are in almost universal use for random sequence generation is reviewed;
the reasoning is given for choosing the somewhat different Tausworthe
linear recurrence (mod 2) type. Using the bit selection algorithm of
Lewis and Payne; and the initial statistical evaluation is reported
on.",
}

@ARTICLE{Broe79:Tandems,
AUTHOR="J. Broeker",
TITLE="Tandems nonstop {TM} Netzwerke {GUARDIAN/EXPAND.} extrem hohe
Verfügbarkeit",
JOURNAL="Computer Magazine",
VOLUME=8,
NUMBER=1,
PAGES="58-62",
YEAR=1979,
LANGUAGE="German",
REFERENCES=5,
KEYWORDS="Communication network; operating system; data transmission;
cost",
ANNOTE="Rechnernetzwerke entwickeln sich aus zwei im einsatz
befindlichen methoden, mit denen bisher die probleme der unternehmen mit
räumlich auseinanderliegendem computerbedarf gelöst wurden . Da jedoch
die computer immer billiger werden, ist es sinnvoll, an den
erforderlichen stellen rechner zu installieren und diese miteinander zu
einem rechnernetz zu verbinden. Dadurch erhöhen sich leistung und
systemverfuegbarkeit, und die datenübertragu",
}

@ARTICLE{Brow79:Round,
AUTHOR="T. Brown",
TITLE="{M/G/1} round robin discipline",
JOURNAL=comp,
VOLUME=22,
NUMBER=3,
PAGES="225-242",
YEAR=1979,
REFERENCES=11,
KEYWORDS="M/G/1; round robin",
ANNOTE="This paper analyzes a round robin M/G/1 queueing discipline with
quantum sizes that depend on the number of circuits a job has made.
Tight bounds on the steady state mean response conditionals for job size
are found. Results show that the round robin discipline is relatively
insensitive to change in workload and follows the processor-sharing
response curves surprisingly closely, even for large quantum sizes. The
analysis allows determination",
}

@ARTICLE{Burf79:Additive,
AUTHOR="R. L. Burford",
TITLE="Additive vs multiplicative uniform pseudo-random number
generators in the generation of {Erlang} variates",
JOURNAL=simuletter,
VOLUME=10,
NUMBER=3,
PAGES="75-82",
YEAR=1979,
REFERENCES=21,
KEYWORDS="Linear congruential generator; Erlang distribution;
comparison",
ANNOTE="This paper presents the comparative results of several test runs
involving the use of several unit uniform random numbers generators with
an inverse transform to generate Erlang random variates with lambda=1
and $k=3,4,5$ and 6. The results show that two commonly used generators
(a multiplicative and a mixed one) produce unacceptable results. Two
others (an additive one and a multiplicative one) produce acceptable
results. The computer system use",
}

@ARTICLE{Burk79:Queuing,
AUTHOR="P. J. Burke",
TITLE="A queuing theoretic anomaly",
JOURNAL=jap,
VOLUME=16,
PAGES="373-383",
YEAR=1979,
REFERENCES=2,
KEYWORDS="Evaluation; method; G/D/N/S; time in system; Markov process;
finite source; delay distribution; multiserver; constant service time",
ANNOTE="The equilibrium delay distribution for a system with finite
source input, constant service time, and $S>1$ servers, as determined by
simulation, showed the existence of values of $T$ such that the
probability of delay greater than $T$ is a non-monotone function of the
input intensity. Since repeated efforts to remove this counter-intuitive
result by debugging failed, a simple case was attacked by analytical and
numerical methods; and the same anomaly",
}

@INPROCEEDINGS{Bux79:Single,
AUTHOR="W. Bux",
TITLE="Single server queues with general interarrival and phase-type
service time distributions-computational algorithms",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-6",
YEAR=1979,
REFERENCES=17,
KEYWORDS="phase concept; approximation; method; queueing approximation;
waiting time; service time; interarrival time",
ANNOTE="This paper presents a method for the numerical analysis of
single server queues with generally distributed interarrival times and a
service time distribution of the special phase-type with uniform mean of
the phases. Since it was demonstrated in a recent paper that a broad
class of distribution functions can be approximated with sufficient
accuracy by special phase-type distributions the developed approach
represents a widely applicable tool",
}

@ARTICLE{Bux79:Throughput,
AUTHOR="W. Bux and P. J. Kühn and K. Kümmerle",
TITLE="Throughput considerations in a multiprocessor packet switching
node",
JOURNAL=ieeecom,
VOLUME="COM-27",
YEAR=1979,
KEYWORDS="Packet switching; throughput; simulation; evaluation; network
throughput; multiprocessor system",
ANNOTE="The prime objective of the present paper is to analyze the
throughput characteristics of a multi -processor configuration for
packet switching -suggested in the context of an integrated network for
circuit and packet switching- and to identify the major parameters on
which it depends. The results provide a fundamental insight into how the
most relevant system and traffic parameters determine throughput as a
function of the number of packet-ha",
}

@INPROCEEDINGS{Bux79:Queueing,
AUTHOR="W. Bux and H. L. Truong",
TITLE="A queueing model for {HDLC-controlled} data links",
BOOKTITLE="International Symposium on flow control in computer
networks",
ADDRESS="Paris",
PAGES="1-20",
YEAR=1979,
REFERENCES=10,
KEYWORDS="Model; queueing system; HDLC; simulation; comparison;
performance evaluation; link layer",
ANNOTE={In this paper it is shown that the performance of the balanced
class of hdlc procedures can be evaluated for a wide range of
applications by using a rather simple queueing model. The key idea to
our approach is the use of the so-called "virtual transmission time"
which comprises the real transmission time of a message well as the
duration of possible recovery actions performed in case of transmission
errors.},
}

@INPROCEEDINGS{Bux79:High,
AUTHOR="W. Bux and H. L. Truong",
TITLE="High level data link control traffic considerations",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-8",
YEAR=1979,
REFERENCES=11,
KEYWORDS="Time in system; network throughput; hdlc",
ANNOTE={This paper addresses the performance evaluation of the balanced
class of dlc procedures. The analysis is based on the notion of a
"virtual transmission time". The present paper extends the analysis to
those cases where processing and propagation delays cannot be neglected.
The derived analytic results for maximum throughput and mean transfer
time allow a fast and accurate performance evaluation of hdlc-controlled
links.},
}

@INPROCEEDINGS{Came79:Results,
AUTHOR="P. M. Camerini and L. Fratta and F. Maffioli",
TITLE="Some results on the design of tree-structured communication
networks",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-4",
YEAR=1979,
REFERENCES=6,
KEYWORDS="Communication network; tree network; cost",
ANNOTE="A heuristic method is presented for solving the optimum
communication spanning tree problem, i.e., the problem of finding a tree
connection $n$ given centers which minimizes the sum of fixed
(construction) and traffic dependent costs. The two phases constituting
the algorithm have been carefully designed in order to keep the
computational complexity as low as possible.",
}

@ARTICLE{Case79:Throughput,
AUTHOR="P. Caseau and",
TITLE="Throughput capacity of a sequence of queues with blocking due to
finite waiting room",
JOURNAL=ieeese,
VOLUME="SE-5",
PAGES="631-642",
YEAR=1979,
REFERENCES=27,
KEYWORDS="Tandem queue; queueing approximation; memory management;
communication network; network throughput; blocking",
ANNOTE="A tandem queueing system with blocking due to finite waiting
room is considered. Maximum throughput is studied by an approximation
for several cases. The service time can depend on the number of
customers; intermediate arrivals can also be allowed. Some special
models with two stations in sequence and blocking are examined. These
models are used for the performance evaluation of computer systems. In
particular, the maximum throughput for a virt",
}

@ARTICLE{Chan79:Dimensioning,
AUTHOR="J. Chan and Nicolaos D. Georganas",
TITLE="Dimensioning of Message-Switched Computer Communication Networks
with End-to-End Flow Control",
JOURNAL=comcom,
VOLUME=2,
PAGES="161-164",
YEAR=1979,
KEYWORDS="message switching; computer network; end-to-end flow control",
}

@ARTICLE{Chan79:Distributed,
AUTHOR="K. M. Chandy and Victor Holmes and J. Misra",
TITLE="Distributed simulation of networks",
JOURNAL=cn,
VOLUME=3,
PAGES="105-113",
YEAR=1979,
KEYWORDS="Distributed simulation; event sequencing",
}

@ARTICLE{Chan79:DistributedSimulation,
AUTHOR="K. M. Chandy and J. Misra",
TITLE="Distributed simulation: a case study in design and verification
of distributed programs",
JOURNAL=ieeese,
VOLUME="SE-5",
PAGES="440-452",
YEAR=1979,
REFERENCES=17,
KEYWORDS="Distributed simulation; performance evaluation; reliability;
arallel computing; concurrency",
ANNOTE="The problem of system simulation is typically solved in a
sequential manner due to the wide and intensive sharing of variables by
all parts of the system. We propose a distributed solution where
processes communicate only through messages with their neighbours; there
are no shared variables and there is no central process for message
routing or process scheduling. The paper presents formal, detailed
proofs of correctness.",
}

@ARTICLE{Chla79:BRAM,
AUTHOR="I. Chlamtac and William R. Franta and K. Dan Levin",
TITLE="{BRAM:} the broadcast recognizing access method",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="1183-1190",
YEAR=1979,
REFERENCES=8,
KEYWORDS="Busy sense multiple access; communication protocol;
store-and-forward",
ANNOTE="In this paper, we first present the broadcast recognizing access
method (BRAM), an access protocol suitable for regulating intermode
communication in either a radio or (coaxial or fiber) cable based
communication system. The method avoids collisions, imposes negligible
computational requirements on the nodes attempting to transmit, and is
fair in the sense that no node will be find indefinitely prevented from
transmitting. Next we introduce par",
}

@ARTICLE{Clar79:Computer,
AUTHOR="J. D. Clark and T. J. Reynolds and M. J. Intille",
TITLE="Computer performance evaluation - an empirical approach",
JOURNAL=per,
VOLUME=8,
NUMBER="1-2",
PAGES="97-101",
YEAR=1979,
REFERENCES=18,
KEYWORDS="Comparison; fundamentals in statistics; regression analysis;
erformance evaluation; multiprocessor system; application",
ANNOTE="Computer performance evaluation can be delineated into the areas
of selection; projection and monitoring. The tuning of existing systems
for efficient performance may be viewed as a special case of the
projection activity involving modeling, statistics collection and
analysis. Most tools available today are expensive to use and overly
complicated. This paper presents the comparison of two, relatively
simple and cost-effective, statistical techn",
}

@INPROCEEDINGS{Cohe79:Networks,
AUTHOR="J. W. Cohen",
TITLE="On networks with generalized processor sharing (and a new
property of Erlang's B formula)",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-7",
YEAR=1979,
REFERENCES=14,
KEYWORDS="Communication network; Erlang B formula; routing; processor;
SRPT; shortest remaining processing time",
ANNOTE="A review is given of the teletraffic results for a multiple
phase service facility of which teletraffic networks are special models
for the case of ``generalized processor'' service discipline. Under this
discipline requests are served simultaneously with a rate depending on
the phase and the number of requests present at a phase. Results about
stationary distributions and average sojourn time of a request in the
system are presented. The routing",
}

@ARTICLE{Cool79:Documenting,
AUTHOR="B. J. Cooley",
TITLE="Documenting simulation studies for management",
JOURNAL=simuletter,
VOLUME=10,
NUMBER=3,
PAGES="24-27",
YEAR=1979,
REFERENCES=13,
KEYWORDS="Documentation; simulation",
ANNOTE="This paper provides a discussion of the purposes of simulation
documentation and the role of documentation in gaining management
acceptance and approach is suggested which is directed toward providing
management with an end-product, documentation, which will be useful in
decision making. Guidelines are given for writing simulation
documentations which are aimed at several levels of management
audiences.",
}

@TECHREPORT{Corb79:Simulation,
AUTHOR="H. Corbelin and M. Jobmann",
TITLE="Simulation mit adaptiven Modellen",
INSTITUTION="Institut für Informatik, Universität Hamburg",
ADDRESS="Hamburg, Germany",
NUMBER=58,
PAGES="1-201",
YEAR=1979,
LANGUAGE="German",
REFERENCES=55,
KEYWORDS="Time series analysis; difference equation; moment estimation;
confidence interval; expectation; discrete state process; stationary
process; regression analysis; discrete event simulation; autoregressive
process; model adaption",
ANNOTE="This work offers a method of reducing the costs of discrete
event simulation experiments. Methods and concepts of time series
analysis of stochastic processes by means of stochastic difference
equations (autoregressive models) are incorporated into an estimation
procedure which traces successively the statistical reliability of the
data. This is done by a stepwise checking of the confidence interval of
the sample mean. Once a sufficient sample",
}

@ARTICLE{Dal79:Availablility,
AUTHOR="M. Dal-Cin",
TITLE="Availablility of coherent structures with several repair units -
an application of queueing network theory",
JOURNAL=or,
VOLUME=33,
PAGES="95-104",
YEAR=1979,
REFERENCES=7,
KEYWORDS="Round robin; queueing network; processor sharing;
multiprocessing; allocation; availability; fault tolerance; repair",
ANNOTE="This paper is concerned with generalizations of the classical
machine-repairman problem. The generalizations comprise serval repair
units with round-robin processor-sharing service disciplines and general
coherent systems. Queueing network theory is applied in order to
determine the availability of these systems and the optimal allocation
of spare units. As illustrative examples we discuss a model of a
multiprocessing computer system.",
}

@ARTICLE{Dale79:SIMBAS,
AUTHOR="J. Daley",
TITLE="{SIMBAS:} a process-oriented simulation language",
JOURNAL=simuletter,
PAGES="14-",
YEAR=1979,
KEYWORDS="discrete event simulation; BASIC",
}

@TECHREPORT{Davi79:Enhanced,
AUTHOR="C. K. Davies",
TITLE="The enhanced performance of unbalanced queueing systems",
TYPE="Report",
INSTITUTION="Philips Research Laboratories",
ADDRESS="Redhill",
NUMBER=3145,
YEAR=1979,
KEYWORDS="Queueing system; M/M/N",
}

@INPROCEEDINGS{Debi79:Comparison,
AUTHOR="J. L. Debiesse and G. Matignon",
TITLE="Comparison of different methods of traffic matrices",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-8",
YEAR=1979,
REFERENCES=21,
KEYWORDS="comparison; method; network planning; flow optimization;
traffic matrix; forecasting; Kruithof's projection method",
ANNOTE="Various methods allowing traffic matrices forecasting from total
row and column forecasts are reviewed and compared from the points of
view of performance, properties and adequation to a real case network.
Some new or little known results relative to the kruithof method (or
double factor method) are proved. An application to traffic matrices
apportionment is also given.",
}

@ARTICLE{Ditt79:Methodenbanksysteme,
AUTHOR="K. R. Dittrich and R. Hüber and P. C. Lockemann",
TITLE="Methodenbanksysteme: Ein Werkzeug zum Maß-Schneidern von
Anwendersoftware",
JOURNAL=infspec,
VOLUME=2,
NUMBER=4,
PAGES="194-203",
YEAR=1979,
LANGUAGE="German",
REFERENCES=56,
KEYWORDS="Method; software",
ANNOTE=". Ein Ziel von Methodenbanksystemen ist es, dem DV-Fachmann
Werkzeuge in die Hand zu geben, mit denen er im Bedarfsfall ohne grossen
Aufwand massgeschneiderte Rechendienstleistungen anbieten kann. Der
Aufsatz geht daher von einer Systemarchitektur mit einem
anwendungsneutralen Grundsystem und Hilfmitteln fuer das hinzufuegen
anwendungsspezifischer Bestandteile aus. Nach einer Diskussion der
wesentlichen Bauteile von Methodenbanksystemen",
}

@ARTICLE{Doll79:IBM,
AUTHOR="D. R. Doll",
TITLE="{IBM} further strengthens its architecture for the coming
decade",
JOURNAL=datacommunications,
VOLUME=8,
PAGES="56-67",
YEAR=1979,
KEYWORDS="Computer network; SNA",
ANNOTE="This article summarizes the mayor enhancements to its systems
network architecture (SNA) announced by IBM during 1979.",
}

@TECHREPORT{Duer79:Interaktive,
AUTHOR="K. Duerre and U. Lindenthal and H. C. Mayr and H. Thoma",
TITLE="Interaktive soziometrische Dienstleistungen - Ein Beispiel für
die Anwendung des Methodenbankrahmens",
TYPE="Interner Bericht",
INSTITUTION="Universität Karlsruhe, Fakultät für Informatik",
NUMBER="16/79",
PAGES="1-59",
YEAR=1979,
LANGUAGE="German",
REFERENCES=38,
KEYWORDS="Method; bibliography; command language; graphics; interactive
mode; information system; graph theory; higher algebra",
}

@ARTICLE{Eave79:ALOHA,
AUTHOR="R. E. Eaves",
TITLE="{ALOHA/TDM} systems with multiple downlink capacity",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="537-541",
YEAR=1979,
REFERENCES=11,
KEYWORDS="TDM; time division multiplex; ALOHA",
ANNOTE="The concept of a processing satellite with multiple slotted
aloha uplinks to efficiently fill a TDM downlink is extended to include
multiple downlinks. Throughput is derived for a general configuration
with $n$ ALOHA uplinks and $m$ TDM downlinks. An optimization procedure
is described to select the $n$ and $m$ which maximize throughput for a
given bandwidth constraint.",
}

@ARTICLE{Efro79:Computers,
AUTHOR="B. Efron",
TITLE="Computers and the theory of statistics: thinking the
unthinkable",
JOURNAL="SIAM Review",
VOLUME=21,
NUMBER=4,
PAGES="460-480",
YEAR=1979,
KEYWORDS="Probability; statistics",
ANNOTE="This is a survey article concerning recent advances in certain
areas of statistical theory, written for a mathematical audience with no
background in statistics. The topics are chosen to illustrate a special
point: how the advent of the high-speed computer has affected the
development of statistical theory.",
}

@ARTICLE{Eier79:Nachbildung,
AUTHOR="R. Eier",
TITLE="Nachbildung kontinuierlicher Verteilungen mit Hilfe von diskreten
Zufallsprozessen",
JOURNAL="Frequenz",
VOLUME=33,
PAGES="195-",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="random number generation; simulation; chi-square distribution;
normal distribution; discrete time process; continuous time process;
approximation; method",
ANNOTE="In view of modern technology it is occasionally convenient to
substitute continous stochastic processes by discrete processes with
only a finite number of amplitude steps. For a useful approximation it
is proposed to match the moments of the two distributions in question up
to a certain order. Thus the actual problem reduces to determining the
amplitude and propability values of an r-valued discrete distribution
from given moments of order 1 up.",
}

@INPROCEEDINGS{Eklu79:Transform,
AUTHOR="B. Eklundh and B. Stavenow",
TITLE="Some transform approaches to the computation of the normalization
constant in queueing networks",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-5",
YEAR=1979,
REFERENCES=7,
KEYWORDS="queueing network; transform; method; normalization constant",
ANNOTE="Some basic and wellknown results for queueing networks are
given. The fact that computation of the normalization constant can be
viewed as a discrete case convolution is observed and the use of a
transform approach to this is suggested. Some transform methods for
computation of digital convolution are investigated and applied to the
problem of computing $g(n)$, the normalization constant.",
}

@INPROCEEDINGS{Elld79:Traffic,
AUTHOR="A. Elldin",
TITLE="Traffic capacity of highly loaded link systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-7",
YEAR=1979,
REFERENCES=8,
KEYWORDS="communication network; loss system; heavy traffic
approximation",
ANNOTE="A method is presented for the calculation of a highly loaded
two-stage link system by the introduction of deformed full availability
distributions. The degree of deformation increases with the congestion.
The method is also extended to a special type of three-stage link
system. The method seems well motivated whenever the congestion exceeds
the 10 per cent level.",
}

@ARTICLE{Elmq79:Standard,
AUTHOR="K. A. Elmquist and H. Fulner and D. B. Gustavson",
TITLE="Standard specification for {S100} bus interface devices",
JOURNAL=ieeecomp,
PAGES="28-52",
YEAR=1979,
KEYWORDS="Microprocessor; microcomputer; standard; bus",
}

@INPROCEEDINGS{Ever79:Output,
AUTHOR="David Everitt and T. Downs",
TITLE="The output of multiserver queueing systems with Poisson input",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-6",
YEAR=1979,
REFERENCES=8,
KEYWORDS="M/M/N; output process; instationary process; transient
condition",
ANNOTE="This paper considers an M/M/s queueing system for which a simple
recursive differential equation relating the input and output streams
under transient conditions is derived. The method is also applied to a
system of two M/M/s queues which have a different number of servers and
different service rates but which are supplied by the same input stream
(i.e., each poisson arrival supplies two customers, one of each
queue).",
}

@MISC{Fehe79:Special,
AUTHOR="K. Ed. Feher",
TITLE="Special issue on digital radio",
PUBLISHER="ieeecom",
VOLUME="COM-27",
YEAR=1979,
KEYWORDS="Broadcast; communication; special issue; survey; mobile
radio",
ANNOTE="A survey on various aspects of digital radio (modulation
performance etc.) is given.",
}

@ARTICLE{Finn79:Resynch,
AUTHOR="S. G. Finn",
TITLE="Resynch procedures and a fail-safe network protocol",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="840-845",
YEAR=1979,
REFERENCES=14,
KEYWORDS="Packet switching; communication protocol; fail safe",
ANNOTE="A resynch procedure is a mechanism for effectively bringing all
nodes of a distributed network to a known state simultaneously, despite
arbitrary finite delays between nodes. The procedures presented have the
interesting property that no time-outs are required. One use of a
resynch procedure is to implement a network protocol that can guarantee
that no packets will be lost and no duplicate packets will be
inadvertently received, despite arb",
}

@ARTICLE{Fish79:Estimating,
AUTHOR="G. S. Fishman and L. R. Moore",
TITLE="Estimating the mean of a correlated binary sequence with an
application to discrete event simulation",
JOURNAL=jacm,
VOLUME=26,
PAGES="82-94",
YEAR=1979,
KEYWORDS="Simulation; time series analysis; correlation; M/M/1",
}

@ARTICLE{Folt79:Status,
AUTHOR="H. C. Folts",
TITLE="Status report on new standards for {DTE/DCE} interface
protocols",
JOURNAL=ieeecomp,
VOLUME=12,
NUMBER=9,
PAGES="12-20",
YEAR=1979,
KEYWORDS="Survey; communication protocol; standard",
ANNOTE="This tutorial article appears in a special issue of computer
devoted to network protocols. The standards discussed in the paper
concern the interface to public data networks which provide data
transmission services using leased circuits, circuit switching.",
}

@ARTICLE{Fran79:Model,
AUTHOR="R. L. Franks and H. Heffes and J. M. Holtzman and S. Horing and
E. J. Messerli",
TITLE="A Model Relating Measurements and Forecast Errors to the
Provisioning of Direct Final Trunk Groups",
JOURNAL=bstj,
VOLUME=58,
NUMBER=2,
PAGES="351-377",
YEAR=1979,
REFERENCES=9,
KEYWORDS="Circuit switching",
ANNOTE="This paper describes a mathematical model of the provisioning of
direct final trunk groups with forecasting and measurements errors. This
model can be used to study the effects of applying standard trunking
formulas to possibly inaccurate load forecasts. An important
consideration in the process is the degree to which the trunk forecast
is actually followed. This so-called provisioning policy is modeled
parametrically to allow consideration of",
}

@ARTICLE{Gave79:Diffusion,
AUTHOR="D. P. Gaver and J. P. Lehoczky",
TITLE="A diffusion approximation model for a communication system
allowing message interference",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="1190-1199",
YEAR=1979,
REFERENCES=8,
KEYWORDS="Random multiple access; diffusion approximation",
ANNOTE={Probabilistic models are presented and investigated to describe
the service furnished to messages sent via communications channels on
which messages in progress may be "destroyed" by a new message demand.
Retries by destroyed messages are modeled. The general approach utilizes
diffusion approximations. The quality of the numerical results is
evaluated by comparison with simulations, and is found to be
satisfactory.},
}

@INPROCEEDINGS{Gech79:Mathematical,
AUTHOR="V. Gechtman and D. Biran",
TITLE="Mathematical model of telephone subscriber",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-5",
YEAR=1979,
REFERENCES=1,
KEYWORDS="Analytical model; man-machine interaction; communication
network",
ANNOTE="In this paper an attempt has been made to present the telephone
subscriber as a man - machine interactive system and to investigate it
in all its interrelated aspects: socio-economic, psychological, traffic,
technical and commercial. The aim of the study is statistical analysis
of the factors characterizing the subscriber and the setting up of
mathematical models which interconnect them. Development of such models
enables us to forecast the tra",
}

@BOOK{Geis79:ANS,
AUTHOR="R. Geissler and K. Geissler",
TITLE="{ANS} {COBOL} Band 2: Datei-Organisationsformen und
Zugriffsmethoden",
PUBLISHER="Carl Hanser Verlag",
ADDRESS="München",
PAGES="1-208",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Programming language; COBOL",
}

@INPROCEEDINGS{Gepr79:Renewal,
AUTHOR="H. Geprägs and U. Höfle-Isphording",
TITLE="A renewal theoretic approach to the solution of traffic and
reliability problems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-5",
YEAR=1979,
REFERENCES=4,
KEYWORDS="Renewal process; Poisson distribution; expectation;
application; IPP; interrupted Poisson process",
ANNOTE="This paper discusses a model consisting of a renewal process
(RP) and an alternating Poisson process (PP) with two possible states (0
and 1). Both processes commence at the origin with PP in state 1. RP
terminates if a renewal epoch finds PP in state 0. The distribution of
the number of this epoch is given. If the distribution of the
interarrival times is unknown, bounds for the mean value and the
survivor function of the epoch of termination .",
}

@INCOLLECTION{Gies79:Throughput,
AUTHOR="A. Giessler",
TITLE="Throughput guarantee in {X.25} networks",
BOOKTITLE="Flow control in computer networks",
EDITOR="Gien Grange",
PUBLISHER="North Holland",
PAGES="1-14",
YEAR=1979,
REFERENCES=15,
KEYWORDS="Communication network; X.25; network throughput; simulation;
acket switching; model; network design; virtual channel; throughput
guarantee; gmdnet; VL; virtual line; control; multiplexer",
ANNOTE="The problem of throughput guarantees in public packet switched
networks is considered in three steps and correspondingly three
different levels of detail.",
}

@ARTICLE{Gomb79:Study,
AUTHOR="G. R. A. Gomberg and I. Kerr and  others",
TITLE="A design study of a hierarchically connected packet-switching
network using simulation techniques",
JOURNAL=cn,
VOLUME=3,
NUMBER=2,
PAGES="114-135",
YEAR=1979,
KEYWORDS="simulation; packet switching; design; routing algorithm;
network congestion",
ANNOTE="An account is given of a simulation study of a hierarchically
connected packet switched data communication network; particular
attention is given to problems of routing and congestion avoidance. The
means adopted to solve these problems are somewhat different from those
used in single-level packet switched networks. An attempt is made to
apply routing techniques similar to those used in circuit switched
telephone networks.",
}

@ARTICLE{Gona79:Microprocessing,
AUTHOR="E. Gonauser and K. D. Müller-Glaser and A. Glasl",
TITLE="Microprocessing application of subnanosecond masterslice arrays",
JOURNAL=siemensfe,
VOLUME=8,
NUMBER=5,
PAGES="251-255",
YEAR=1979,
REFERENCES=15,
KEYWORDS="Hardware device; bit-slice family; CPU; application",
ANNOTE="High-speed masterslice arrays are presented. An application to
bit-slice microprocessors is given.",
}

@ARTICLE{Gonn79:Closed,
AUTHOR="G. H. Gonnet and D. E. Morgan",
TITLE="Analysis of closed queueing networks with periodic servers",
JOURNAL=ieeese,
VOLUME="SE-5",
PAGES="653-659",
YEAR=1979,
REFERENCES=16,
KEYWORDS="Closed queueing network; time sharing; Eigenvalue; model;
periodic service",
ANNOTE="A periodic network is a queueing network whose steady-state
behavior is not constant in time, but repeats itself in a cycle. This
behavior may be caused by the introduction of periodic servers, e.g.,
paging drums. The model presented is a generalization of some other
models of queueing networks, and provides a more general definition of
steady-state behavior. A theoretical solution is presented. Examples of
theoretical and approximate solutions",
}

@INPROCEEDINGS{Gons79:Interconnection,
AUTHOR="Timothy A. Gonsalves and B. Kumar",
TITLE="Analysis of interconnection structures for distributed computer
sytems",
BOOKTITLE="Conference on simulation, measurement and modelling of
computer systems",
PAGES="89-98",
YEAR=1979,
KEYWORDS="Parallel computing; computer network; interconnection",
}

@ARTICLE{Gonz79:Note,
AUTHOR="T. F. Gonzalez",
TITLE="A note on open shop preemptive schedules",
JOURNAL=ieeetc,
VOLUME="C-28",
PAGES="782-786",
YEAR=1979,
REFERENCES=6,
KEYWORDS="Process management; finish time; polynomial complexity;
preemptive scheduling",
ANNOTE="The problem of preemptively scheduling a set of $n$ independent
jobs on an $m$ processor open shop is discussed. An algorithm to
construct preemptive schedules with minimum-maximum finishing time is
presented. The worst case time complexity is $o(r+min(m^4,n^4,r^2))$,
where $r$ is the number of nonzero tasks. The maximum number of
preemptions introduced is $o(min(r*n,r*m,n^3,m^3))$. The algorithm is
best possible for open shops with a fixed number",
}

@ARTICLE{Gord79:RINGNET,
AUTHOR="R. L. Gordon and W. W. Farr and P. Levire",
TITLE="{RINGNET:} a packet-switched local network with decentralized
control",
JOURNAL=cn,
VOLUME=3,
PAGES="373-379",
YEAR=1979,
KEYWORDS="LAN; token ring",
}

@ARTICLE{Gorn7904:Queueing,
AUTHOR="L. Gorney",
TITLE="Queueing theory, the science of wait control",
JOURNAL=byte,
VOLUME=4,
NUMBER="4-5",
MONTH="April/May",
YEAR=1979,
REFERENCES=7,
KEYWORDS="Queueing system; simulation; BASIC",
}

@PROCEEDINGS{Gran79:Flow,
TITLE="Flow control in computer networks",
EDITOR="J.-L. Grange and M. Gien",
ADDRESS="Versailles",
PAGES="1-430",
NOTE="Proc. International Symposium on Flow Control in Computer
Networks",
YEAR=1979,
KEYWORDS="network flow; routing algorithm; network congestion; special
issue",
}

@INPROCEEDINGS{Gril79:Telephone,
AUTHOR="D. Grillo",
TITLE="Telephone network behaviour in repeated attempts environment - a
simulation analysis",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-5",
YEAR=1979,
REFERENCES=20,
KEYWORDS="Performance evaluation; simulation; communication network;
model; man-machine interaction",
ANNOTE="Due to the wide diffusion of DDD service and SPC switching,
to-day national and international telephone networks are very sens itive
to situations arising from departure from normal conditions (overloads).
In order to ensure maximum network call carrying capacity under these
conditions network management actions have to be taken. The paper
describes a model for investigating the effectiveness of a restrictive
network management action",
}

@ARTICLE{Gupt79:Optimal,
AUTHOR="U. C. Gupta and D. Lee and J. Y.-T. Leung",
TITLE="An optimal solution for the channel-assignment problem",
JOURNAL=ieeetc,
VOLUME="C-28",
PAGES="807-810",
YEAR=1979,
REFERENCES=8,
KEYWORDS="Method; process management; scheduling; channel assignment;
design",
ANNOTE="Given a set of intervals (pairs of real number), we look at the
problem of finding a minimal partition of this set such that no element
of the partition contains two overlapping intervals. We exhibit a
$\theta(n*\log n)$ algorithm which is optimal. The problem has
applications in LSI layout design and job scheduling.",
}

@ARTICLE{Gutz79:Schnelldrucker,
AUTHOR="T. Gutzmann",
TITLE="Das Schnelldrucker-Setzprogramm {SCRIPTOR}",
JOURNAL=aninf,
VOLUME=6,
PAGES="256-258",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Text processing; FORTRAN",
ANNOTE="SCRIPTOR ist ein Programm zum formatierten Druck
wissenschaftlicher Texte auf Schnelldruckern und anderen Ausgabegeräten
mit festen Druckpositionen.  Von anderen Programmen ähnlicher
Zielrichtung unterscheidet es sich in folgenden Punkten: -
Systemunabhängigkeit durch ausschliessliche Verwendung von FORTRAN IV.",
}

@ARTICLE{Hack79:Erschliessung,
AUTHOR="R. Hackstein and K. Uttendorf",
TITLE="Erschliessung mathematischer Planungsverfahren für die Praxis
durch Mensch-Computer-Dialog",
JOURNAL=aninf,
VOLUME=8,
PAGES="340-349",
YEAR=1979,
LANGUAGE="German",
REFERENCES=11,
KEYWORDS="Application; human factors; mathematical method; optimization;
simulation; interactive mode",
ANNOTE="Die anwendung mathematischer planungsverfahren, wie simulations-
und optimierungsverfahren, verlangt auch heute noch neben der
sachkenntnis der zu lösenden planungsaufgabe spezielle mathematische und
programmtechnische kentnisse. Da diese bei dem gegenwärtig mit planung
betrauten personenkreis nicht vorausgesetzt werden können, sind solche
planungsverfahren in der praxis nur vereinzelt anzutreffen.",
}

@ARTICLE{Hans79:Assigned,
AUTHOR="L. W. Hansen and M. Schwartz",
TITLE="An assigned-slot listen before-transmission protocol for a
multiaccess data channel",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="846-857",
YEAR=1979,
REFERENCES=14,
KEYWORDS="busy sense multiple access; broadcast; communication; Packet
switching; communication protocol",
ANNOTE="In the multiaccess protocol described in this paper, users are
each assigned specific slots of time in which to listen to the channel
and determine is busy or idle. If the channel is idle, a ready user may
transmit a fixed length message, or packet; otherwise he must wait a
random time and try again. When two or more users transmit
simultaneously, none are successful and each must retry after a random
time. Delay-throughput performance curve",
}

@TECHREPORT{Hatz79:Description,
AUTHOR="B. Hatz",
TITLE="Description of the Siemens {BS2000} allocator",
INSTITUTION="Interner Bericht 2/79, Universität Karlsruhe",
ADDRESS="Karlsruhe",
YEAR=1979,
KEYWORDS="BS2000; memory management; information system; disk; file
management; operating system",
ANNOTE="The BS2000 allocator is part of the data management system DMS
and is responsible for the disk space management. It maintains the link
between the logical space in a file and the physical space on a device.
The description shows the various allocation/ deallocation functions in
an algorithmic way. Its structure is such that readers of different
interests will find a satisfying information about the subject.",
}

@ARTICLE{Heid79:Comparing,
AUTHOR="P. Heidelberger and D. L. Iglehart",
TITLE="Comparing stochastic systems using regenerative simulation with
common random numbers",
JOURNAL=aap,
PAGES="804-819",
YEAR=1979,
KEYWORDS="Simulation; variance reduction; random number generation;
regenerative simulation; independent cycles; comparison; two-sample
problem; sampling; limit theorem; estimation",
ANNOTE="Suppose two alternative designs for a stochastic system are to
be compared. These two systems can be simulated independently or
dependently. This paper presents a method for comparing two regenerative
stochastic processes in a dependent fashion using common random numbers.
A set of sufficient conditions is given that guarantees that the
dependent simulations will produce a variance reduction over independent
simulations. Numerical examples for",
}

@ARTICLE{Hein79:Buffer,
AUTHOR="T. S. Heines",
TITLE="Buffer behavior in computer communication systems",
JOURNAL=ieeetc,
VOLUME="C-28",
PAGES="573-576",
YEAR=1979,
REFERENCES=6,
KEYWORDS="Queueing theory; communication network; data transmission;
queue length; FIFO; blocking; M/GEO/1; buffer; periodic service",
ANNOTE="A buffer has been analyzed in a computer communication system
with Poisson arrival, periodic opportunities for service, and random
blocking of service. The solution obtained reflects the waiting a
customer must do until a service opportunity arises. Compared to
previous solutions for this problem, the average queue length and the
variance of queue length are larger by a factor which depends on the
arrival rate.",
}

@ARTICLE{Henr79:Fast,
AUTHOR="P. Henrici",
TITLE="Fast Fourier Methods in Computational Complex Analysis",
JOURNAL="SIAM Review (Society for Industrial and Applied Mathematics)",
VOLUME=21,
PAGES="481-527",
YEAR=1979,
REFERENCES=70,
KEYWORDS="Mathematics",
}

@ARTICLE{Hent79:Uberlagerung,
AUTHOR="S. Hentschke",
TITLE="Überlagerung, Berechnung und Auswertbarkeit höherer Momente von
Zufallsverkehr",
JOURNAL="Frequenz",
VOLUME=33,
PAGES="78-",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Traffic source; queueing system; overflow traffic",
}

@INPROCEEDINGS{Herz79:Characteristics,
AUTHOR="U. Herzog",
TITLE="Performance characteristics for hierarchically organized
multiprocessor computer systems with generally distributed processing
times",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-7",
YEAR=1979,
REFERENCES=14,
KEYWORDS="Multiprocessor system; hierarchical network; M/G/1",
ANNOTE="We briefly discuss the modeling technique and attack the problem
of generally distributed processing times. For this we compare various
solution techniques and show that the socalled piecewise solution is
very attractive with regard to approximating measured data and numerical
evaluation, as well.",
}

@ARTICLE{Herz79:Modellierung,
AUTHOR="U. Herzog",
TITLE="Modellierung des Ablaufgeschehens in Netzen",
JOURNAL="Fachberichte und Referate",
PUBLISHER="Oldenbourg Verlag",
VOLUME=8,
PAGES="176-208",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Queueing system; modeling",
}

@ARTICLE{High79:Taxonomy,
AUTHOR="H. J. Highland",
TITLE="A taxonomy approach to simulation model documentation",
JOURNAL=simuletter,
VOLUME=10,
NUMBER=3,
PAGES="19-23",
YEAR=1979,
KEYWORDS="Documentation; classification; simulation",
}

@ARTICLE{Hine79:Control,
AUTHOR="J. H. Hine and I. Mitrani and S. Tsur",
TITLE="The control of response times in multi-class systems by memory
allocation",
JOURNAL=cacm,
VOLUME=22,
PAGES="415-424",
YEAR=1979,
REFERENCES=13,
KEYWORDS="Queueing network; response time; memory management; priority;
performance evaluation; memory organization; operating system",
ANNOTE="The possibility of giving different quality of service to jobs
of different classes by regulating their memory allocation is examined
in the context of a paged computer system.",
}

@INPROCEEDINGS{Hofs79:Traffic,
AUTHOR="H. Hofstetter and D. Weber",
TITLE="Traffic behaviour of reversed link systems with short path
possibilities",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-7",
YEAR=1979,
REFERENCES=5,
KEYWORDS="Communication network; loss system",
ANNOTE="The point-to-point loss of a reversed switching network with
possiblity of connecting via short paths depends not only on the
external traffic load but also on the short path traffic portion. It is
necessary to calculate this portion for determining the traffic handling
capacity of such a switching network. An approximation method using is
derived. Calculation and simulation results are compared on the basic of
a special example for a pabx swit",
}

@INPROCEEDINGS{Holt79:Estimating,
AUTHOR="J. M. Holtzman and D. L. Jagerman",
TITLE="Estimating peakedness from arrival counts",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-4",
YEAR=1979,
REFERENCES=7,
KEYWORDS="parameter estimation; renewal process; arrival process;
peakedness",
ANNOTE="An estimate of peakedness $z$ of a stationary renewal process
can be obtained from the variance-mean ratio of the number of arrivals,
$n(t)$, over a sufficiently long time interval $t$. It is shown that
when the traffic stream is nonstationary, inflated values of the
$z$-estimate can occur which may be misleading for engineering
procedures. For example, if one assumes the variability of $n(t)$ is due
to $z$ while it is actually due to nonstationarity",
}

@ARTICLE{Hopp79:Binary,
AUTHOR="Andrew Hopper and D. J. Wheeler",
TITLE="Binary routing networks",
JOURNAL=ieeetc,
VOLUME="C-28",
NUMBER=10,
PAGES="699-703",
YEAR=1979,
REFERENCES=12,
KEYWORDS="Communication network; digital network; packet switching;
routing; network flow; performance evaluation",
ANNOTE="The design of a communications network based on simple routing
of packets through the network and suitable for use in local systems is
presented. Several network topologies are considered using differing
node structures. Generation of routing information is discussed together
with flow control. It is shown that high performance is easily obtained
and the system drawbacks do not affect the design for local networks.",
}

@ARTICLE{Hopp79:Abstract,
AUTHOR="K. Hopper and H. J. Kugler and C. Unger",
TITLE="Abstract machines modelling network control systems",
JOURNAL=acmosrev,
VOLUME=13,
NUMBER=1,
PAGES="10-24",
YEAR=1979,
REFERENCES=7,
KEYWORDS="Resource; communication network; standard; computer system;
network control system",
ANNOTE="A major problem in designing computer systems is to match the
needs of all types of computer users with the real resources available.
The concept of an abstract machine working for the user is introduced to
overcome this problem. The applicability of this concept in a wide
variety of practical environments leads to the development of a proposed
standard architecture for network control systems.",
}

@INPROCEEDINGS{Horn79:End,
AUTHOR="R. A. Horn",
TITLE="End-to-end connection probability - the next major engeneering
issue?",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-8",
YEAR=1979,
REFERENCES=23,
KEYWORDS="communication network; design; future outlook",
ANNOTE="Studies have shown that, if the current engeneering methods are
used, traffic growth combined with modularization and concentration will
lead to networks with large trunk groups and large sw itches, all
operating at high occupancy levels in the busy hours. In terms of the
end-to-end connection probability, the vulnerability of these networks,
due to traffic fluctuations and component failures, will increase. In
order to quantify the magnitude",
}

@BOOK{Hous79:Data,
AUTHOR="T. Hously",
TITLE="Data communications and teleprocessing systems",
PUBLISHER="Prentice Hall International",
ADDRESS="Hemel Hempstead",
PAGES=262,
YEAR=1979,
KEYWORDS="Communication network",
}

@ARTICLE{Hues79:Inversion,
AUTHOR="Ö. Hueseyin and B. Oezgueler",
TITLE="Inversion of multidimensional polynomial matrices",
JOURNAL=aeu,
VOLUME=33,
PAGES="457-462",
YEAR=1979,
REFERENCES=15,
KEYWORDS="Matrix; polynomial",
ANNOTE="In dieser arbeit wird die inversion einer polynommatrix mit p
unabhängigen variablen betrachtet. Es wird ein algorithmus entwickelt,
bei dem nur operationen mit konstanten matrizen vorkommen. Weiterhin ist
ein test auf invertierbarkeit einer p-dimensionalen polynommatrix
zusammenfassend dargestellt.",
}

@ARTICLE{Hues79:Partial,
AUTHOR="Ö. Hueseyin and B. Oezgueler",
TITLE="Partial fraction expansion of multidimensional rational
matrices",
JOURNAL=aeu,
VOLUME=33,
PAGES="491-497",
YEAR=1979,
REFERENCES=7,
KEYWORDS="Matrix; partial fraction",
ANNOTE="A necessary and sufficient condition is given for the existence
of a partial fraction expansion for a two dimensional rational matrix of
arbitrary size and degree, along with an algorithm to determine the
expansion. The algorithm is suitable for an efficient computer program
and can be extended to multidimension easi ly.",
}

@ARTICLE{Hwan79:Three,
AUTHOR="F. K. Hwang",
TITLE="Three-stage multiconnection networks which are nonblocking in the
wide sense",
JOURNAL=bstj,
PAGES="2183-2187",
YEAR=1979,
REFERENCES=6,
KEYWORDS="Switching network; Clos",
}

@ARTICLE{Igle79:RegenerativeControls,
AUTHOR="D. L. Iglehart and A. W. Lewis",
TITLE="Regenerative simulation with internal controls",
JOURNAL=jacm,
VOLUME=26,
PAGES="271-282",
YEAR=1979,
REFERENCES=15,
KEYWORDS="Simulation; control variable; independent cycles; M/M/1;
Markov process",
ANNOTE="A new variance reduction technique called internal control
variables is introduced. This technique is to be used in regenerative
simulations. The idea is to identify a sequence of control random
variables, each one defined within a regenerative cycle, whose mean can
be calculated analytically. These controls should be highly correlated
with the usual quantities observed in a regenerative simulation. This
correlation reduces the variance of the",
}

@ARTICLE{Igle79:RegenerativeTypes,
AUTHOR="D. L. Iglehart and G. S. Shedler",
TITLE="Regenerative simulation of response times in networks of queues
with multiple job types",
JOURNAL=acta,
VOLUME=12,
PAGES="159-176",
YEAR=1979,
KEYWORDS="Simulation; response time; queueing network; priority; time in
system; independent cycles",
ANNOTE="The authors consider passage time simulation in closed networks
of queues having multiple job types. The results provide a means of
obtaining, from a single replication, point and interval estimates for
passage times of the several job types. They also yield a statistically
more efficient estimation procedure for passage times of a single job
type.",
}

@ARTICLE{Igle79:Regenerative,
AUTHOR="D. L. Iglehart and G. S. Shedler",
TITLE="Regenerative simulation of response times in networks of queues",
JOURNAL=jacm,
VOLUME=25,
PAGES="449-460",
YEAR=1979,
REFERENCES=1,
KEYWORDS="Simulation; response time; distribution; queueing network;
independent cycles; model",
ANNOTE="Although much progress has been made in obtaining solutions for
queueing network models of computer systems, relatively little has been
made in determining the response time distributions in such models. The
authors extend the regenerative method to response time processes by
marking a job and using an expanded state space to assure that one can
obtain regeneration points for the marked job's response time process.",
}

@ARTICLE{Inos79:ICCC,
AUTHOR="H. Inose",
TITLE="{ICCC} 78: a retrospection",
JOURNAL=cn,
VOLUME=3,
NUMBER=4,
PAGES="243-258",
YEAR=1979,
REFERENCES=125,
KEYWORDS="survey; bibliography",
ANNOTE="This paper summarizes the program planning activities of iccc-78
and presents the major highlights of the technical program.",
}

@INPROCEEDINGS{Jack79:High,
AUTHOR="L. Jack and P. Mitchell",
TITLE="A high performance microcomputer for space applications",
BOOKTITLE="AIAA conference",
PAGES="77-86 (79-1922)",
YEAR=1979,
KEYWORDS="Microprocessor",
}

@ARTICLE{Jain79:Guideline,
AUTHOR="A. K. Jain",
TITLE="A guideline to statistical approaches in compxuter performance
evaluation studies",
JOURNAL=per,
VOLUME=8,
PAGES="63-",
YEAR=1979,
REFERENCES=50,
KEYWORDS="bibliography; survey; performance evaluation; fundamentals in
statistics; model; validation; regression analysis; comparison; cluster
analysis",
ANNOTE="1. Introduction 2. Review of past cpe studies 3. Statistical
steps in a cpe study 4. Statistical background for use by cpe analysis
5. Suggestions for future work 6. Acknowledgments",
}

@PHDTHESIS{Jask79:Beitrag,
AUTHOR="G. Jaskulke",
TITLE="Beitrag zur Einsatzplanung teilnehmernaher
Konzentratoreinrichtungen in Fernsprechortsnetzen",
SCHOOL="Universität Braunschweig",
ADDRESS="Braunschweig, Germany",
PAGES=169,
YEAR=1979,
LANGUAGE="German",
REFERENCES=105,
KEYWORDS="Network planning",
}

@PHDTHESIS{Jobm79:Beitrag,
AUTHOR="K. Jobmann",
TITLE="Ein Beitrag zur Monte-Carlo-Simulationstechnik in der
Fernsprechverkehrstheorie",
SCHOOL="Universität Hannover",
ADDRESS="Hannover, Germany",
PAGES=111,
YEAR=1979,
LANGUAGE="German",
REFERENCES=34,
KEYWORDS="Markov chain; Monte Carlo simulation",
}

@INPROCEEDINGS{Joll79:Delays,
AUTHOR="W. M. Jolley",
TITLE="Analysis of delays by counting events",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-10",
YEAR=1979,
REFERENCES=21,
KEYWORDS="Markov process; method; waiting time; difference equation;
kolmogorov differential equation; event counting",
ANNOTE={This paper discusses a new "event counting" method for the
analysis of waiting time problems in Markovian queueing systems. The
approach, which is quite similar to the simulation technique of gambe,
Suzuki and Itoh (1967) for their study of a two stage link system with
delay, is essentially to express the waiting time distribution function
as an infinite convex linear combination of terms from the poisson
probability distribution.},
}

@INPROCEEDINGS{Joll79:Post,
AUTHOR="W. M. Jolley and R. J. Harris",
TITLE="Analysis of post-call activity in queueing systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-9",
YEAR=1979,
REFERENCES=10,
KEYWORDS="M/G/N; service time; ACD; automatic call distribution; post
call activity; two phase service time",
ANNOTE="In this paper a model of a particular queueing system is
considered in which the service time of an operator is divided into two
distinct components. This model has been used to analyse the performance
of automatic call distribution (ACD) systems operated by organisations
such as taxi companies, airline booking agencies and public utilities.",
}

@INPROCEEDINGS{Kahn79:Semantics,
AUTHOR="G. Ed. Kahn",
TITLE="Semantics of concurrent computation",
BOOKTITLE="EVIAN",
PUBLISHER="Springer-Verlag",
ADDRESS="France",
PAGES="1-348",
NOTE="Lecture notes in computer science 70",
YEAR=1979,
KEYWORDS="Process management; special issue; Petri net",
ANNOTE="The temporal semantics of concurrent programs (Pnueli, A.);
Modal logic of concurrent nondeterministic programs (Abrahamson, K.); On
properties preserved by contractions of concurrent systems (Gourlay, J.
S., Rounds, W. C., Statman, R.); Nondeterministic system specification
(Abrial, J. R., Schuman, S. A.); Static analysis of concurrent processes
for dynamic properties using petri nets (Herzog, O.); Notion de dualite
et de symetrie dans les reseaux",
}

@ARTICLE{Kama79:Study,
AUTHOR="S. S. Kamal and S. A. Mahmoud",
TITLE="A study of users' buffer variations in random access satellite
channels",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="857-868",
YEAR=1979,
REFERENCES=15,
KEYWORDS="satellite radio; ALOHA; random multiple access; buffer
memory",
ANNOTE="A novel approach to modeling the slotted ALOHA random access
channel is presented. The objectives of the model are threefold: (1) to
identify the channel's stability boundaries and analytically as a
function of the system's independent input parameters; (2) to
investigate the impact of buffer-control on the channel's behavior; and
(3) to facilitate the structuring of individual users' buffer-control as
the focus of a dynamic control scheme.",
}

@INPROCEEDINGS{Kamo79:Drop,
AUTHOR="F. Kamoun",
TITLE="A drop and throttle flow control {(DTFC)} policy for computer
networks",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-8",
YEAR=1979,
REFERENCES=15,
KEYWORDS="Computer network; network flow; network throughput; loss
system",
ANNOTE={Store-and-forward packet switched networks are subject to
congestion under heavy load conditions. In this paper a distributed flow
control policy (DTFC) based on a nodal buffer management scheme is
proposed. Two classes of traffic are identified: "new" and "transit"
traffic. At a given node if the number of allocated buffers is higher
than a limit value then incoming new traffic is rejected whereas transit
traffic is accepted. This policy is th},
}

@ARTICLE{Kamo79:Stochastic,
AUTHOR="F. Kamoun and L. Kleinrock",
TITLE="Stochastic performance evaluation of hierarchical routing for
large networks",
JOURNAL=cn,
VOLUME=3,
PAGES="337-353",
YEAR=1979,
REFERENCES=14,
KEYWORDS="Queueing system; model; communication network; network
throughput; network delay; routing algorithm; Performance evaluation;
hierarchical routing",
ANNOTE="In this paper, we evaluate the tradeoff between the reduction in
routing table length and the increase in network path length in terms of
the more meaningful network performance measures of delay and
throughput. Extended queueing models are developed to exhibit the
interrelationships which exist between network variables such as delay,
throughput, channel capacity, nodal storage, network path length,
routing table length, etc. These models",
}

@BOOK{Keil79:Markov,
AUTHOR="Julian Keilson",
TITLE="Markov chain models - rarity and exponentiality",
PUBLISHER="APPL. MATH. SCI. Springer-Verlag",
ADDRESS="Berlin",
VOLUME=28,
PAGES="1-184",
YEAR=1979,
REFERENCES=66,
KEYWORDS="Markov process; Markov chain; analysis; error bound",
}

@INPROCEEDINGS{Kien79:Analytic,
AUTHOR="M. G. Kienzle and K. C. Sevcik",
TITLE="Survey of analytic queueing network models of computer systems",
BOOKTITLE="conference on simulation, measurement and modeling of
computer systems",
YEAR=1979,
KEYWORDS="Queueing system; queueing network; simulation; classification;
survey; bibliography",
ANNOTE="A number of case studies involving the use of queueing network
models to investigate actual computer systems are surveyed. After
suggesting a framework by which case studies can be classified, we
contrast various parameter estimation methods for specifying model
parameters based on measurement data. A tabular summary indicates the
relationships among nineteen case studies.",
}

@ARTICLE{Kien79:Systematical,
AUTHOR="M. G. Kienzle and K. C. Sevcik",
TITLE="A systematical approach to the performance modeling of computer
systems",
JOURNAL="Performance of Computer Systems",
PUBLISHER="North Holland",
ADDRESS="New York",
PAGES="3-28",
YEAR=1979,
KEYWORDS="Performance evaluation; model; queueing system; measurement",
ANNOTE="This paper presents a design methodoloy for generating computer
system performance models. The modeling process is subdivided into three
stages.",
}

@ARTICLE{Klei79:Role,
AUTHOR="J. P. Kleijnen",
TITLE="The role of statistical methodology in simulation",
JOURNAL=simuletter,
PAGES="51-",
YEAR=1979,
KEYWORDS="Simulation; time series analysis; statistics; bibliography;
method; regression analysis; sampling; realization",
ANNOTE="Contents: 1. Strategic problems in simulation 2. Tactical
problems in stochastic simulation 3. Formal metamodels: regression
analysis 4. Experimental design 5. Summary of strategic problem 6.
Tactical problems in stochastic simulation: variance reduction 7.
Tactical problems: runlength 8. Miscellaneous statistical problems 9.
Conclusion",
}

@ARTICLE{Klei79:Note,
AUTHOR="J. P. Kleijnen",
TITLE="A note on computer system data gathering",
JOURNAL=per,
VOLUME=8,
PAGES="56-62",
YEAR=1979,
REFERENCES=2,
KEYWORDS="Sampling",
}

@INPROCEEDINGS{Klei79:New,
AUTHOR="L. Kleinrock",
TITLE="On a new class of queueing models for distributed environments",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-5",
YEAR=1979,
REFERENCES=16,
KEYWORDS="Packet switching; model; satellite radio; broadcast; lower
bound; time in system; research problem; network throughput; network
delay; computer network; TDMA; time division multiple access",
ABSTRACT="In this paper, we study these problems associated with
geographically distributed access to a common broadcast communication
channel in a packet switching environment. We present some solutions to
this multi-access broadcast problem, giving the throughput-delay profile
both for long-range communication systems (such as satellite packet
switching) and for local access in a ground radio packet switching
environment. Of interest is the optimum",
}

@ARTICLE{Koel79:Heavy,
AUTHOR="J. Koellerstroem",
TITLE="Heavy traffic theory for queues with several servers",
JOURNAL=jap,
VOLUME=16,
PAGES="393-401",
YEAR=1979,
REFERENCES=24,
KEYWORDS="Evaluation; method; model; bibliography; GI/G/N; waiting time;
queueing approximation; transform; steady state analysis; error bound",
ANNOTE="The queues being studied here are of the type GI/G/K in
statistical equilibrium (with traffic intensity less than one). The
exponential limiting formula for the waiting time distribution function
in heavy traffic, conjectured by Kingman (1965) and established by
Koellerstroem (1974), is extended here. The asymptotic properties of the
moments are investigated as well as further approximations for the
characteristic function and error bounds for",
}

@INPROCEEDINGS{Korn79:Shared,
AUTHOR="U. Körner",
TITLE="Analysis of shared storage in a computer communication network",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-6",
YEAR=1979,
REFERENCES=15,
KEYWORDS="Computer network; packet switching; buffer memory; network
throughput; comparison; model; switching system; CS=complete sharing",
ANNOTE={Consider a node in a packet switching computer communication
network with a finite number of buffers in the output queue system. The
paper deals with a restricted buffer sharing policy called "sharing with
minimum allocation". The SMA policy also increases the total throughput
and consequently decreases the number of lost packets per time unit.},
}

@ARTICLE{Kohl79:Einsatz,
AUTHOR="N. Köhler and H. Schumacher",
TITLE="Einsatz von Software zur diskreten Simulation an einem Problem
aus der Praxis; {GPSS-V,} {GPSS-F} und {SIMULA} im Vergleich",
JOURNAL=infspec,
VOLUME=2,
NUMBER=3,
PAGES="140-149",
YEAR=1979,
LANGUAGE="German",
REFERENCES=11,
KEYWORDS="comparison; solved exercise; discrete event simulation;
SIMULA; GPSS",
ANNOTE="In the last 20 years a great number of simulation languages have
been developed, which can be classified and evaluated according to
varions points of view. Among the classical simulation languages are
numbered GPSS, a development of IBM, and SIMULA, a package from the
norwegian computing center. One of the newer systems is GPSS-F, a
simulation language developed at Erlangen university. Subject of this
treatise are the results of a comparative",
}

@ARTICLE{Koni79:Erfahrungen,
AUTHOR="D. König and R. Fröning",
TITLE="Erfahrungen mit rechnergestützter Dokumentation",
JOURNAL=er,
VOLUME=21,
NUMBER=5,
PAGES="234-240",
YEAR=1979,
LANGUAGE="German",
REFERENCES=2,
KEYWORDS="Documentation; classification; retrieval system",
}

@INPROCEEDINGS{Kost79:Accuracy,
AUTHOR="L. Kosten",
TITLE="Accuracy of estimating congestion quantities from simulation
results",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-6",
YEAR=1979,
REFERENCES=13,
KEYWORDS="Parameter estimation; network congestion; simulation; M/M/N",
ANNOTE="The analytical determination of congestion quantities in large
service systems mostly is impossible owing to complexity of the system.
Mostly, simulation is used. Determination of the accuracy of the
measurement from variance in results of consecutive ru ns may result in
too optimistic results owing to correlation (the so-called
``cluster-effect''). In the past this effect has been analysed for the
standard M/M/c cases.",
}

@INPROCEEDINGS{Krae79:Frequency,
AUTHOR="H. Y. Kraepelien",
TITLE="Frequency distribution of subscribers by their monthly local
traffic",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-7",
YEAR=1979,
REFERENCES=8,
KEYWORDS="Communication network; man-machine interaction; traffic
intensity; distribution",
ANNOTE="Telephone traffic during peak-load periods has been extensively
researched with a view of improving service and limiting investment and
cost of operation. Equally important, but less researched, is how total
(around-the-clock) traffic is generated. Such research is of special
interest for the purpose of selecting local telephone tariffs which - in
addition to serving the three mentioned goals - also best serve the
communications need of the",
}

@INPROCEEDINGS{Kram79:Warte,
AUTHOR="M. Kramer",
TITLE="Warte-Verlust-Systeme vom Typ {M/G/1} mit unterbrechenden
Prioritäten",
BOOKTITLE="3. GI-Jahrestagung",
ADDRESS="Bonn",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Queueing theory; M/G/1; preemptive priority; method; Laplace
transform; M/G/1/S; FIFO; PREHOL priority",
ANNOTE="Für das Wartesystem M/G/1/N und das zugehörige k-stufige
Prioritätenmodell MK/GK/1/NK mit der Prioritätsregel preemptive resume
werden die Verteilungen der betriebsperioden und der stationären
warteschlangenlängen unter der voraussetzung endlicher Warteräume
hergeleitet. Die stationären zustandswahrscheinlichkeiten sind durch
Reihenentwicklung erzeugender funktionen exakt berechenbar.",
}

@ARTICLE{Kreu79:Computer,
AUTHOR="W. Kreutzer",
TITLE="Computer system modelling and simulation",
JOURNAL=per,
VOLUME=8,
PAGES="9-35",
YEAR=1979,
KEYWORDS="Simulation; SIMULA; model; survey; bibliography",
ANNOTE="To evaluate the suitability and limitations of software for
computer systems modelling, a basic comprehension of the structure of
such tools must be provided. A brief discussion of conceptual
requirements for the description of discrete models, and computer system
models in particular, is followed by a survey of commercially available
computer simulation packages. Special and general purpose discrete event
simulation and general purpose program",
}

@INPROCEEDINGS{Kron79:Alias,
AUTHOR="R. Kronmal and A. V. Peterson",
TITLE="The alias and alias-rejection mixture methods for generating
random variables",
BOOKTITLE="winter simulation conference",
PAGES="269-280",
YEAR=1979,
KEYWORDS="random number generation",
}

@ARTICLE{Krup79:Properties,
AUTHOR="R. S. Krupp",
TITLE="Properties of Kruithof's projection method",
JOURNAL=bstj,
VOLUME="feb",
PAGES="517-538",
YEAR=1979,
REFERENCES=12,
KEYWORDS="Network planning; traffic matrix; forecasting; Kruithof's
projection method; estimation",
ABSTRACT="In 1937, J. Kruithof introduced a scheme for projecting from
measured point-to-point teletraffic data to some future values",
}

@INPROCEEDINGS{Kuhn79:Switching,
AUTHOR="P. J. Kühn",
TITLE="Analysis of switching system control structures by
decomposition",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-8",
YEAR=1979,
REFERENCES=22,
KEYWORDS="Queueing network; CX/G/1; GI/CX/N; cyclic; decomposition",
ANNOTE="This paper describes an approximate method for the traffic
analysis of switching system control structures with centralized
control. Modeling of such structures leads to complex queueing networks
including queueing stations with cyclic service, clocked operation of
switches, synchronous batch arrivals, priorities, and I/O-overhead. The
interaction among the various subsystems is described by their interface
traffic processes through assumptions",
}

@ARTICLE{Kuhn79:Multiqueue,
AUTHOR="P. J. Kühn",
TITLE="Multiqueue systems with nonexhaustive cyclic service",
JOURNAL=bstj,
VOLUME=58,
PAGES="671-697",
YEAR=1979,
KEYWORDS="Queueing system; queueing network; polling; method;
simulation; M/G/1; GI/G/1; cyclic service",
ANNOTE="Queueing models with cyclic-type service are applicable for
performance studies of polling mechanisms in data communication and
switching systems or cyclic scheduling algorithms in real time
computers. This paper provides an approximate analysis of the multiqueue
system M(x)/G/1 with batch Poisson input, general service times, general
overhead (switchover) times, and a single server operating under a
cyclic strategy with nonexhaustive service",
}

@ARTICLE{Kunf79:Pilotprojekt,
AUTHOR="W. Kunft",
TITLE="Pilotprojekt für ein paketschaltendes Rechnernetzwerk",
JOURNAL="Elektrotechnik und Maschinenbau",
VOLUME=96,
NUMBER=6,
PAGES="268-272",
YEAR=1979,
LANGUAGE="German",
REFERENCES=2,
KEYWORDS="Communication network; packet switching; standard; X.25; X.3;
X.28; X.29",
ANNOTE="Als Vorstudie zur Errichtung eines experimentellen
X.25-Paketvermittlungs-Datennetzes der österreichischen Post- und
Telegraphenverwaltung wird das Modell eines solchen Rechnernetzwerkes an
der Prozessrechenanlage der TU Wien vorgestellt.",
}

@INCOLLECTION{Labe79:Modelling,
AUTHOR="J. Labetoulle and",
TITLE="Modelling and performance evaluation of the protocol {HDLC}",
BOOKTITLE="Flow control in computer networks",
EDITOR="J.-L. Grange and M. Gien",
ORGANIZATION="IFIP",
PUBLISHER="North Holland",
PAGES="307-320",
YEAR=1979,
REFERENCES=9,
KEYWORDS="HDLC; network throughput; analytical model; waiting time;
window mechanism; modeling; prediction; overhead time; measurement;
propagation delay",
ANNOTE="In a recent paper, we have studied the maximum throughput of a
link conducted with an hdlc protocol (high-level data link control),
neglecting the effect of the propagation delays in the link. In this new
study we take into account these delays and we build an analytic model
which allows to calculate the maximum throughput and the mean waiting
time of a packet in such a link. We especially study the effect of the
window width of the hdlc protoc",
}

@ARTICLE{Lave79:Concomitant,
AUTHOR="S. S. Lavenberg and T. L. Moeller and C. H. Sauer",
TITLE="Concomitant control variables applied to the regenerative
simulation of queueing systems",
JOURNAL=or,
VOLUME=27,
PAGES="134-160",
YEAR=1979,
REFERENCES=22,
KEYWORDS="Control variable; queueing system; independent cycles;
simulation",
ANNOTE="We investigate using multiple concomitant control variables to
reduce the width of confidence intervals when estimating steady-state
response variables via the regenerative method of simulation. A
concomitant control variable is an estimator of a known quantity,
defined with respect to the system being simulated, that is believed to
be correlated with the response variable estimator. We give examples of
such control variables for two regenerati",
}

@ARTICLE{Law79:Sequential,
AUTHOR="A. M. Law and J. S. Carson",
TITLE="A sequential procedure for determining the length of a
steady-state simulation",
JOURNAL=or,
VOLUME=27,
NUMBER=5,
PAGES="1011-1025",
YEAR=1979,
KEYWORDS="Simulation; statistics; time series analysis",
}

@ARTICLE{Laza79:User,
AUTHOR="D. Lazak",
TITLE="User-oriented optimal packet sizes with packet switching
systems",
JOURNAL=aninf,
VOLUME=6,
PAGES="259-265",
YEAR=1979,
REFERENCES=22,
KEYWORDS="Packet switching; optimization; physical layer; space-time
diagram",
ABSTRACT="Within rapidly growing applications and the wordwide spreading
of packet-switching systems the question of optimal packet sizes is
studied from the point of view of the space- and time-like behaviour of
line protocols.  Using these considerations and under certain boundary
conditions the optimal packet size can be determined as follows: ps-opt=
$\sqrt((po*ms)/(lt-1))$ with $li$ being the number of physical
transmission channels for the",
}

@INPROCEEDINGS{Lazo79:Benchmarking,
AUTHOR="E. D. Lazowska",
TITLE="The benchmarking, tuning and analytic modelling of {VAX/VMS}",
BOOKTITLE="Conference on simulation, measurement and modelling of
computer systems",
YEAR=1979,
KEYWORDS="Performance evaluation; VAX/VMS",
}

@ARTICLE{Lazo79:Exploiting,
AUTHOR="E. D. Lazowska and K. C. Sevcik",
TITLE="Exploiting decomposability to approximate quantiles of response
times in queueing networks",
EDITOR="D. Lanciaux",
JOURNAL="Operating system theory and practice",
PUBLISHER="Elsevier North Holland",
PAGES="149-166",
YEAR=1979,
KEYWORDS="Queueing approximation; response time; model; closed queueing
network",
ANNOTE="A simple analytic approximation to the distribution of response
times in queueing network models of computer systems is derived.",
}

@INPROCEEDINGS{Lehn79:Special,
AUTHOR="R. Lehnert",
TITLE="A special processor for fast simulation of queueing networks",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-7",
YEAR=1979,
REFERENCES=12,
KEYWORDS="design; comparison; application; hardware simulator; future
outlook; mechanic mckay sampling; bayes statistics; time sequencing;
event sequencing; programming language; shift register sequences",
ANNOTE="This paper describes a special processor for the simulation of
queueing networks, which is easy to program, fast, very economic with
respect to the operating costs and self-contained-completely independent
of a host computer. The simulation rate (simulated entities per time
unit) is of about the same order of magnitude as with a simulation
language mentioned above running on a modern large computer. The
operating costs, however, are at least by",
}

@INPROCEEDINGS{Leon79:New,
AUTHOR="W. B. Leonard and D. Roth",
TITLE="A new architecture for reduced software costs",
BOOKTITLE="AIAA conference",
PAGES="111-117",
YEAR=1979,
KEYWORDS="Microprocessor; bit-slice family",
}

@INPROCEEDINGS{Lera79:Treatment,
AUTHOR="E. Lera and E. A. Smith",
TITLE="Treatment of some important aspects of data network planning",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-8",
YEAR=1979,
REFERENCES=5,
KEYWORDS="Network planning; hierarchical network; design",
ANNOTE="Network planning is the analysis and design of a network to
achieve the optimum use of resources while providing the desired
services at acceptable quality and cost. Major aspects treated in this
paper include optimizations of nodal hierarchy, network topology and
configuration. A special algorithm was designed to carry out the
optimization process based on heuristic considerations. This algorithm
is used to cover a wide range of applications",
}

@INPROCEEDINGS{Lind79:Response,
AUTHOR="G. E. Lindzey and J. C. Browne",
TITLE="Response analysis of a multi-function system",
BOOKTITLE="conference on simulation, measurement and modeling of
computer systems",
YEAR=1979,
KEYWORDS="Performance evaluation; queueing system",
}

@ARTICLE{Lips79:Closed,
AUTHOR="L. Lipsky and J. Caroll",
TITLE="A closed queueing loop with one non-exonential server",
JOURNAL=simuletter,
VOLUME=11,
NUMBER=1,
PAGES="99-106",
YEAR=1979,
REFERENCES=2,
KEYWORDS="Queueing network; service time; moment; hyper distribution;
closed queueing network",
ANNOTE="This paper discusses the effects of higher moments of service
time distributions on performance in closed queueing network models. The
major points made are: 1) throughput decreases as service time
distribution variance increases, and 2) among hyperexponential
distributions with the mean and variance, throughput can vary greatly
depending on the third moment of the distribution. Both these points
have been made previously by price and lazowska",
}

@TECHREPORT{Lore79:Theoretische,
AUTHOR="R. W. Lorenz",
TITLE="Theoretische Verteilungsfunktion von Mehrwegschwundprozessen im
beweglichen Funk und die Bestimmung ihrer Parameter aus Messungen",
INSTITUTION="Forschungsinstitut beim FTZ, Technischer Bericht FI 455,
TBr 66",
ADDRESS="Darmstadt",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="MAT; Rayleigh fading; Lognormal fading; Suzuki fading",
}

@ARTICLE{Lotz79:TDM,
AUTHOR="A. Lotze and K. Rothmaier and R. Scheller",
TITLE="{TDM} versus {SDM} switching arrays - a comparison",
JOURNAL=ieeecom,
VOLUME="COM-29",
PAGES="1455-1464",
NOTE="also in Proc. 9th International Teletraffic Congress",
YEAR=1979,
REFERENCES=9,
KEYWORDS="Communication network; space division multiplex; TDM; time
division multiplex; comparison",
ANNOTE="These paper completes studies by comparisons between pcm
switching arrays and their equivalent sdm switching arrays. Handy
formulae for the best possible economic design of PCM and SDM arrays,
resp., are presented and derived. The loss versus the carried traffic of
pcm arrays are compared with each other and with equivalent sdm link
systems. Furthermore, the relative costs per termination are calculated
for these PCM and SDM array-structures an",
}

@ARTICLE{Magn79:Terminal,
AUTHOR="F. Magnee and A. Endrizzi and John Day",
TITLE="A survey of terminal protocols",
JOURNAL=cn,
VOLUME=3,
PAGES="299-314",
YEAR=1979,
REFERENCES=21,
KEYWORDS="Survey; communication protocol; virtual terminal protocol",
ANNOTE="The aim of this paper is to compare different protocols. It is
divided into four main parts: 1. Presentation of the relationships
between virtual terminal protocol and network architecture. 2. Analysis
of the different virtual terminal model. 3. Analysis of the set of
primitives intended to data structure definition and management. 4.
Introduction to the synchronization mechanisms of the protocol.",
}

@ARTICLE{Maie79:Packet,
AUTHOR="H. Maier",
TITLE="Analysis of packet switching communication networks with finite
buffers",
JOURNAL="Frequenz",
VOLUME=33,
PAGES="211-",
YEAR=1979,
KEYWORDS="Packet switching; performance evaluation; tandem queue; buffer
memory",
ANNOTE="The method of the imbedded Markov chain is used to analyze
queueing network models for packet switching communication networks with
finite storage capacity. The limitations of the method are discussed and
as an example joint and marginal equilibrium distributions for the
tandem queue are derived. These distributions are used to find the delay
time and the blocking probability of the system, to discuss their
dependence on the system parameters",
}

@TECHREPORT{Maji79:Experiments,
AUTHOR="J. C. Majithia and M. I. Irland and J.-L. Grange and C.
O'Donell",
TITLE="Experiments in congestion control techniques",
INSTITUTION="CCNG, University of Waterloo",
ADDRESS="Waterloo",
PAGES="1-30",
YEAR=1979,
KEYWORDS="Network congestion; simulation; evaluation; CCNG; computer
communication network group",
ANNOTE="Congestion controls in a computer network can be functionally
subdivided into: load measurement, informing the users, user reaction
and network reaction if users do not respond properly. A proposed
implementation of congestion control mechanisms (CCMS) in the cigale
network is described. Simulation results dealing with the behaviour of
these ccms under normal and various adverse load conditions are
described. Results show that the proposed ccms",
}

@ARTICLE{Mall79:Einstellen,
AUTHOR="H. Malleck",
TITLE="Einstellen der Anfangswerte in rückgekoppelten Schieberegistern
durch serielle Ansteuerung",
JOURNAL="Frequenz",
VOLUME=33,
PAGES="300-",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="random number generation; shift register sequences",
}

@ARTICLE{Mart79:Standard,
AUTHOR="J. Marti and A. C. Hearn and M. L. Griss and C. Griss",
TITLE="Standard {LISP} report",
JOURNAL=sigplan,
VOLUME=14,
NUMBER=10,
PAGES="48-68",
YEAR=1979,
REFERENCES=12,
KEYWORDS="Programming language; design; lisp",
ANNOTE="A definition of standard LISP is given.",
}

@INPROCEEDINGS{Mate79:PASCAL,
AUTHOR="P. Mateti",
TITLE="{PASCAL} versus {C:} a subjective comparison",
BOOKTITLE="Symposium on language design",
ADDRESS="Heidelberg",
PAGES="37-69",
YEAR=1979,
REFERENCES=44,
KEYWORDS="comparison; PASCAL; bibliography; C programming language",
}

@INPROCEEDINGS{Mats79:Congestion,
AUTHOR="J. Matsumoto and H. Mori",
TITLE="Congestion control in packet switched networks by gradual
restriction of virtual calls",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-8",
YEAR=1979,
REFERENCES=7,
ANNOTE="A congestion control technique for international packet switched
networks, with strengthens packet flow restrictions of virtual calls in
a congested outgoing route in a switch graduallly, is proposed. Basic
traffic characteristics of the system under the proposed congestion
control are analyzed theoretically. A simple queueing model is developed
and state probabilities of the system under the congestion control are
obtained analytically.",
}

@ARTICLE{Matt79:Simple,
AUTHOR="D. E. Matthews",
TITLE="A simple method for reducing queueing times in {M/G/1}",
JOURNAL=or,
VOLUME=27,
PAGES="318-323",
YEAR=1979,
REFERENCES=7,
KEYWORDS="M/G/1; waiting time; service time dependent; HOL priority",
ANNOTE={In many queueing situations customers are served in order of
arrival; yet if customers with shorter service times were served first,
it is well known that the mean queueing time could be reduced
considerably. In a comparison with the "optimal" shortest service-time
rule, a simple queue discipline involving only two non-preemptive
priority classes fares very well. Numerical results illustrate the
practical effects of implementing this simple alt},
}

@ARTICLE{Mehl79:Semi,
AUTHOR="A. Mehlmann",
TITLE="Semi-Markovian manpower models in continuous time",
JOURNAL=jap,
VOLUME=16,
PAGES="416-422",
YEAR=1979,
REFERENCES=6,
KEYWORDS="Semi Markov process; model; Poisson distribution; steady state
probability; Markov process; comparison; Laplace transform",
ANNOTE="This paper presents the general properties of the semi-Markovian
manpower model in continuous time. The asymptotic relation for the
population numbers in various grades is based on the forces of
transition $z\_ij(\mu)$ from state $i$ to state $j$ at duration $\mu$.",
}

@ARTICLE{Mela79:Effect,
AUTHOR="C. M. Melas and M. A. Milewski",
TITLE="The effect of call routing rules in non-blocking three-stage
switching networks",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="150-152",
YEAR=1979,
REFERENCES=2,
KEYWORDS="Switching network; Clos",
}

@ARTICLE{Merl79:Failsafe,
AUTHOR="Philip M. Merlin and A. Segall",
TITLE="A failsafe distributed routing protocol {THE} {BYTE} {BOOK} {OF}
{PASCAL}",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="1280-1287",
YEAR=1979,
REFERENCES=12,
KEYWORDS="message switching; Circuit switching; routing algorithm;
communication protocol",
ANNOTE="An algorithm for constructing and adaptively maintaining routing
tables in communication networks is presented. The algorithm can be
employed in message as well as circuit switching networks, uses
distributed computation, provides routing tables that are loop-free for
each destination at all times, adapts to changes in network flows, and
is completely failsafe.",
}

@ARTICLE{Metc79:Documentation,
AUTHOR="M. A. Metcalfe",
TITLE="Documentation: a growing need for a new tool",
JOURNAL="Simuletter",
VOLUME=10,
PAGES="35-45",
YEAR=1979,
REFERENCES=8,
KEYWORDS="Documentation; software",
ANNOTE="The software design and documentation language (SDDL) has proven
to be an effective, automated documentation tool. This paper presents
the purpose, timing, and components of documentation. SDDL is introduced
and related to the different timing scenarios; its capability to provide
reasonable documentation is discussed and demonstrated by the use of
several examples.",
}

@ARTICLE{Moha79:Models,
AUTHOR="S. G. Mohanty",
TITLE="Models and measurements for quality assessment of software",
JOURNAL=acmcs,
VOLUME=11,
NUMBER=3,
PAGES="251-275",
YEAR=1979,
REFERENCES=65,
KEYWORDS="Software; design; software engineering; reliability;
measurement; model; fundamentals in statistics; performance evaluation",
ANNOTE="Several software quality assessment methods which span the
software life cycle are discussed. The quality of a system design can be
estimated by measuring the system entropy function or the system work
function. The quality improvement due to reconfiguration can be
determined by calculating system entropy loading measures. Software
science and Zipf's law are shown to be useful for estimating program
length and implementation time.",
}

@ARTICLE{Mok79:Distributed,
AUTHOR="A. K. Mok and S. A. Ward",
TITLE="Distributed broadcast channel access",
JOURNAL=cn,
VOLUME=3,
PAGES="327-335",
YEAR=1979,
REFERENCES=8,
KEYWORDS="Broadcast; communication; existing network; LAN; Ethernet;
process management; resource management; priority; multiprocessor
system; ring network; dynamic priority; shared resource",
ABSTRACT="This paper presents a general approach to sharing a broadcast
channel among multiple processors. There are two components to the
problem of sharing a single resource: (1) how to specify the usage
pattern of the resource; and (2) how to restrict access to the resource
so that the specified usage pattern can be realized. One way to solve
both of these problems is to use dynamically assigned priorities.",
}

@BOOK{Moor79:Principles,
AUTHOR="P. G. Moore",
TITLE="Principles of statistical techniques",
PUBLISHER="Cambridge University Press",
ADDRESS="Cambridge",
PAGES="1-288",
YEAR=1979,
KEYWORDS="Survey; exercise; fundamentals in statistics",
}

@ARTICLE{Morr79:Optimal,
AUTHOR="Joel Morris",
TITLE="Optimal blocklengths for {ARQ} error control schemes",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="488-493",
YEAR=1979,
REFERENCES=10,
KEYWORDS="Data retransmission; ARQ; protocol",
ANNOTE="Optimal blocklenghts are investigated for various arq schemes
used for error control in data transmission systems in
independent-bit-error and poisson-distributed block-error channels.",
}

@INPROCEEDINGS{Mysk79:Modelling,
AUTHOR="A. Myskja",
TITLE="Modelling of non-stationary traffic processes",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-8",
YEAR=1979,
REFERENCES=5,
KEYWORDS="Instationary process; arrival process; loss system; Poisson
distribution; expectation; approximation; method; moment; slow
fluctuation; loss calculation; moment matching",
ANNOTE={In the present paper it is assumed that any observed sample is
taken from a process where the memoryless property applies, whereas the
intensity may vary with time. The only limitation is that these
variations are "slow". The arrival process is studied in terms of
interarrival intervals (continuous distributions) and call arrivals
during fixed intervals (discrete distributions). Formulas for
calculation of the distributions and their moment},
}

@ARTICLE{Nass79:Siemens,
AUTHOR="R. Nässl and B. Schaffer",
TITLE="Das Siemens-System {EDS} in synchronen Datennetzen",
JOURNAL=siemenstr,
VOLUME=2,
NUMBER=2,
PAGES="111-115",
YEAR=1979,
LANGUAGE="German",
REFERENCES=4,
KEYWORDS="Computer network; IDN; DATEX-L",
ANNOTE="Mit dem Wachstum der Datenfernverarbeitung entsteht in vielen
Laendern ein Bedarf nach der Einfuehrung oder dem Ausbau öffentlicher
Netze fuer den Datenverkehr. Dabei ist es vorteilhaft, sich auf bereits
vorhandene digitale Dienste, zum Beispiel Telex, abzustuetzen und die
fuer diese Dienste aufgebauten Netze mit neuen Datennetzen zu
integrieren.",
}

@ARTICLE{Necu79:Algorithm,
AUTHOR="M.-A. Necula",
TITLE="An algorithm for fast evaluation of time functions",
JOURNAL=ieeetc,
VOLUME="C-28",
PAGES="506-513",
YEAR=1979,
REFERENCES=6,
KEYWORDS="Method; runtime/storage efficiency; simulation; differential
equation; Laplace transform; reliability; numerical integration;
recurrence formula; error analysis",
ANNOTE="Linear ordinary differential equations with constant
coefficients (LODECC'S) represent the mathematical model of a class of
dynamic systems. The solutions of LODECC, often used in digital
simulation of continous systems, belong to a class of functions with
certain properties. In this paper it is proved that for any function in
this class there exists a recurrence formula for generating the values
of the function at equally spaced values of the",
}

@INPROCEEDINGS{Need79:Aspects,
AUTHOR="R. M. Needham",
TITLE="Some aspects of the Cambridge ring",
BOOKTITLE="ACM operating system review (SIGOPS) --- 7th symposium on
operating system principles",
PAGES="82-85",
YEAR=1979,
REFERENCES=3,
KEYWORDS="LAN; ring network; packet switching; Ethernet; Cambridge ring;
low level protocol",
ANNOTE="The Cambridge ring is a local communication system developed in
the computer laboratory of the University of Cambridge. It differs in
various respects from some other local communication mechanisms such as
Ethernet systems (Metcalfe and Boggs, 1976), and the purpose of the
present paper is to describe the way in which the properties of the ring
affect the general systems aspects of its exploitation.",
}

@ARTICLE{Nels79:Further,
AUTHOR="L. S. Nelson",
TITLE="Further remark on stably updating mean and standard deviation
estimates",
JOURNAL=cacm,
VOLUME=22,
PAGES="483-483",
YEAR=1979,
REFERENCES=3,
KEYWORDS="expectation; standard deviation; moment estimation; numerical
method",
}

@ARTICLE{Nett79:Dynamic,
AUTHOR="A. Netterman and I. Adiri",
TITLE="A dynamic priority queue with general concave priority
functions",
JOURNAL=or,
VOLUME=27,
PAGES="1088-1100",
YEAR=1979,
REFERENCES=8,
KEYWORDS="HOL priority; M/G/1; inequality; dynamic priority",
ANNOTE="This paper analyzes mathematically a queueing model where a
single server dispenses service to several, M, non-preemptive priority
classes. It is assumed that the arrival process of customers who belong
to the $k$ class ($k$ customers) is Poisson, and their service times are
independent, identical, arbitrarily distributed random variables. The
priority degree of a customer at a certain moment is not only a function
of his class, but is also",
}

@MISC{ISO79:Reference,
AUTHOR="I. S. O",
TITLE="Reference model of open systems interconnection",
PUBLISHER="ISO/TC97/SC16 in conjunction with its working groups",
PAGES="1-181",
YEAR=1979,
REFERENCES=6,
KEYWORDS="Reference; standard; communication protocol; OSI; ISO
reference model; physical layer; link layer; network layer; transport
layer; session layer; presentation layer; application layer",
ANNOTE="Purpose of the document; Introduction to open systems
interconnection; Concepts of a layered architecture; Introduction to the
layering concept; Detailed description of the resulting architecture of
OSI.",
}

@ARTICLE{Noet79:Generalized,
AUTHOR="A. S. Noetzel",
TITLE="A generalized queueing discipline for product form network
solutions",
JOURNAL=jacm,
VOLUME=26,
PAGES="779-793",
YEAR=1979,
REFERENCES=14,
KEYWORDS="Queueing network; processor sharing; Markov process; product
form; network; local balance",
ANNOTE="Certain queueing disciplines, such as processor sharing, the
preemptive last-come-first-served discipline, and the infinite server
queue, are known to result in network equilibrium state probabilities
that have a convenient product form. A generalization of the above
disciplines is introduced. The general class is presented in the form of
a parameterized discipline, called the last-batch-processor-sharing
(LBPS) discipline. The equilibrium",
}

@INPROCEEDINGS{Noet79:Reduction,
AUTHOR="A. S. Noetzel and E. J. Weyuker",
TITLE="The reduction of a discrete event simulation to a Markov chain",
BOOKTITLE=wsc,
YEAR=1979,
KEYWORDS="Simulation",
}

@ARTICLE{Numm79:Conservation,
AUTHOR="E. Nummelin",
TITLE="A conservation property for general {GI/G/1} queues with an
application to tandem queues",
JOURNAL=aap,
VOLUME=11,
PAGES="660-672",
YEAR=1979,
REFERENCES=19,
KEYWORDS="Application; evaluation; tandem queue; recurrent process;
Markov process; renewal process; GI/G/1; Harris recurrent",
ANNOTE="We show that, if the input process of a general GI/G/1 queue is
a positive recurrent Markov renewal then the output process, too, is a
positive recurrent Markov renewal process (the conservation property).
As an application we consider a general tandem queue and proove a total
variation limit theorem for the associatedwaiting and service time.",
}

@ARTICLE{Nuss79:Special,
AUTHOR="E. Nussbaum",
TITLE="Special issue on digital switching",
JOURNAL=ieeecom,
VOLUME="COM-27",
YEAR=1979,
KEYWORDS="digital network; data network; PABX; PCM; future outlook;
survey; special issue",
ANNOTE="A survey is given on various aspects of digital switching in PCM
networks.",
}

@INPROCEEDINGS{Okad79:New,
AUTHOR="Kazunori Okada and M. Imase and H. Ichikawa",
TITLE="New architecture and the traffic aspects of switching network
using microprocessors",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-6",
YEAR=1979,
REFERENCES=6,
KEYWORDS="Digital network; microprocessor",
ANNOTE="We propose a new digital switching network element, speech-path
processor (SPP), which realizes switching function by program operation
of micro-processor, and which can dynamically assign traffic to
individual links. It is further mentioned that SPP can have 92 channels
of switching capacity by a current myp commercially available. We also
propose a new building block type switching system, Phenix, which can
have $n$ times so much traffic.",
}

@ARTICLE{Pagu79:Sum,
AUTHOR="B. Pagurek and C. M. Woodside",
TITLE="The sum of serial correlations of waiting and system times in
{GI/G/1} queues",
JOURNAL=or,
VOLUME=27,
PAGES="755-766",
YEAR=1979,
REFERENCES=9,
KEYWORDS="GI/G/1; time in system; waiting time; analysis; correlation;
estimation; serial correlation",
ANNOTE="We develop an expression for the sum of the serial correlation
coefficients for time in system or waiting time for successive customers
in a GI/G/1 queue. In our approach the interarrival time distribution is
represented in terms of a class k, distribution with a rational
Laplace-Stieltjes transform. Thus Erlang, hyperexponential, and weighted
sum-of-Erlang arrivals are treated exactly and approximate results can
be found for other distribution",
}

@ARTICLE{Pang79:Elektronischer,
AUTHOR="H. Pangratz",
TITLE="Elektronischer Generator zur Nachbildung der Poisson-Statistik",
JOURNAL="Frequenz",
VOLUME=33,
PAGES="204-",
YEAR=1979,
LANGUAGE="German",
REFERENCES=2309,
KEYWORDS="Shift register sequences; random variate generation; Poisson
distribution",
}

@ARTICLE{Pang79:Pseudo,
AUTHOR="H. Pangratz and H. Weinrichter",
TITLE="Pseudo-random number generator based on binary and quinary
maximal-length sequences",
JOURNAL=ieeetc,
VOLUME="C-28",
YEAR=1979,
KEYWORDS="random number generation; Shift register sequences; design",
ANNOTE="A new pseudo-random generator for decimal numbers is presented.
A sequence of decimal digits is obtained by combining a binary and a
quinary sequence generated by feedback shift-register circuits. The
autocorrelation sequence (ACS) of the resulting decimal sequence is
calculated; it shows that linear dependencies are extremely small.
Finally, guidelines are developed for choosing feedback polynomials
which yield low cross correlation between",
}

@INPROCEEDINGS{Pawl79:Comparison,
AUTHOR="P. F. Pawlita",
TITLE="Evaluation and comparison of dialogue traffic characteristics in
teleprocessing systems based on measurement results",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-8",
YEAR=1979,
REFERENCES=12,
KEYWORDS="man-machine interaction; performance measure; measurement;
Performance evaluation; comparison; data network; traffic parameter;
time random variable",
ANNOTE="Planning and design of economic teleprocessing (TP) systems and
communications networks has become a difficult task. One main reason is
the uncertainly about structure and intensity of the expected traffic.
Particularly the performance of random behaviour of terminals rresp.
Users. This paper summarizes recent data traffic measurements in four
dialogue tp-systems labeled a to d. Mostly with medium-speed terminals
of 1200 bps - 4800 bps.",
}

@INPROCEEDINGS{Pede79:Link,
AUTHOR="O. A. Pedersen",
TITLE="Link system effective availabilities for point-to-point
selection",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-8",
YEAR=1979,
REFERENCES=4,
KEYWORDS="Communication network; loss system; switching network; link
system",
ANNOTE="The concept of effective availability generally has been applied
to link systems providing point-to group selection. Effective
availability has been defined in terms of the access provided by a link
system to a group of devices connected to its outlet terminals. In this
paper, the blocking characteristics of a link system providing
point-to-point selection are considered in terms of the effective
availability of a group of $k$ devices, links or",
}

@ARTICLE{Pope79:Encryption,
AUTHOR="G. J. Popek and C. S. Kline",
TITLE="Encryption and secure computer networks",
JOURNAL=acmcs,
VOLUME=11,
PAGES="331-356",
YEAR=1979,
REFERENCES=48,
KEYWORDS="Survey; reliability; communication network; ARPAnet;
bibliography; computer security; encryption; communication protocol",
ANNOTE="There is increasing growth in the number of computer networks in
use and in the kinds of distributed computing applications available on
these networks. This increase, together with concern about privacy,
security, and integrity of information exchange, has created
considerable interest in the use of encryption to protect information in
the networks.",
}

@BOOK{Prin79:Starke,
AUTHOR="R. Prinoth",
TITLE="Starke Färbbarkeit in Petri-Netzen",
SERIES="GMD-Bericht",
PUBLISHER="Oldenbourg Verlag",
ADDRESS="Bonn, Germany",
NUMBER=117,
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Graph theory; Petri net",
ABSTRACT="Diese Arbeit fuehrt in die Klasse der färbbaren Petri-Netze
ein.  Färbbare netze sind von Zustandsmaschinen und/oder synchron
isationsgraphen überdeckt.  Die modellierung von betriebssyste
mstrukturen (zum Beispiel das ``Philosophenproblem'') fuehrt auf
färbbare netze, jedoch beschäftigt sich diese Arbeit nicht mit
Anwendungsfällen, sondern zeigt wesentliche eigenschaften der
betrachteten Netzfluesse auf, unter anderem werden
Lebendigkeitskriterien",
}

@ARTICLE{Pujo79:Influence,
AUTHOR="Guy Pujolle",
TITLE="The influence of protocols on the stability conditions in
packet-switching networks",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="611-619",
YEAR=1979,
LANGUAGE="English",
REFERENCES=32,
KEYWORDS="Packet switching; tandem queue; communication protocol;
bibliography",
ANNOTE="A packet-switching network is considered as a tandem system of
store-and-forward links. In this paper, it is shown that the maximum
input traffic, with finite intermediate buffer size, is very sensitive
to the distribution of the transmission time. The performance of two
different protocols is compared under various distributions of
transmission times.",
}

@ARTICLE{Raei79:Optimal,
AUTHOR="K.-J. Raeihae and S. H. Zweben",
TITLE="An optimal insertion algorithm for one-sided height-balanced
binary search trees",
JOURNAL=cacm,
VOLUME=22,
PAGES="508-512",
YEAR=1979,
REFERENCES=13,
KEYWORDS="Method; information system; search tree; graph theory",
ANNOTE="An algorithm for inserting an element into a one-sided height-b
alanced (OSHB) binary search tree is presented.  The algorithm operates
in time $O(log N)$, where $N$ is the number of nodes in the tree.  This
represents an improvement over the best previously known insertion
algorithms of Hirschberg and Kosaraju, which require time $O(\log N\log
N)$.",
}

@ARTICLE{Raja79:Prediction,
AUTHOR="M. K. Rajaraman",
TITLE="Performance prediction of a virtual machine",
JOURNAL=per,
VOLUME=8,
NUMBER="1-2",
PAGES="57-62",
YEAR=1979,
REFERENCES=11,
KEYWORDS="Model; simulation; modeling; prediction; memory management;
performance measure",
ANNOTE="Modeling and simulation of computer systems have two main
objectives. First, to evaluate the performance of a given configuration
of a machine and second, to derive a mechanism for prediction of
performance when configuration parameters change. This paper addresses
the second issue and reports the result of a virtual memory computer.
The results indicate which variables or combination of variables have
significant effect on the performance and",
}

@ARTICLE{Rapp79:Demand,
AUTHOR="S. S. Rappaport",
TITLE="Demand assigned multiple access systems using collision type
request channels: traffic capacity comparisons",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="1325-1331",
YEAR=1979,
REFERENCES=10,
KEYWORDS="random multiple access; ALOHA; channel capacity; FDMA;
frequency division multiple access; TDMA; time division multiple
access",
ANNOTE="The traffic carrying capabilities of demand assigned multiple
access (DAMA) systems in which requests for communication circuits are
transmitted over shared collision type channels to a master controller
are investigated.",
}

@ARTICLE{Raub79:Flow,
AUTHOR="E. Raubold",
TITLE="Flow control in the {GMD-network}",
EDITOR="Kenneth G. Beauchamp",
JOURNAL="Interlinking of Computer Networks",
PAGES="431-468",
YEAR=1979,
REFERENCES=8,
KEYWORDS="Network flow; simulation; packet switching; communication
network; network design; method; evaluation; model; GMDnet; vl; virtual
line; deadlock prevention; interface; network behaviour",
ANNOTE="One of the goals of the gmd-network development was the design,
analysis and implementation of a fully recursive set of transport
protocols applying the 'virtual line switching' technique. This work
resulted in some insights into: - deadlock prevention - flow control and
- interface design problems, which are of general interest. The paper
examines the gmd-net protocols from the flow control point-of-view and
presents simulation results for",
}

@PROCEEDINGS{Raul79:Workshop,
TITLE="Workshop on reliable software",
EDITOR="P. Raulefs",
PUBLISHER="Carl Hanser Verlag",
ADDRESS="München",
PAGES="1-269",
YEAR=1979,
KEYWORDS="Reliability; program construction; PASCAL; PEARL",
ANNOTE="Program analysis techniques for software reliability; towards
more advanced testing techniques; dynamic analysis and test data
generation in an automatic test system; a method for treating errors in
programs and its integration into the concept of sequential modular
systems; medee: a type of language for the deductive programming method;
design and implementation of a programming system to support the
development of reliable",
}

@ARTICLE{Redw79:Using,
AUTHOR="S. T. Redwine",
TITLE="Using {COBOL} macroprocessing for reliable parameter passing",
JOURNAL=sigplan,
VOLUME=14,
NUMBER=9,
PAGES="59-60",
YEAR=1979,
REFERENCES=2,
KEYWORDS="COBOL; reliability",
ANNOTE="Insuring that linkages between programs and subprograms are co
rrect is a problem when using cobol since the language lacks facilities
to perform automatic checking or conversion of the arguments being
passed. However, techniques using the cobol macroprocessor facility with
its copy verb can greatly reduce the problem.",
}

@ARTICLE{Ricc79:Control,
AUTHOR="F. J. Ricci",
TITLE="Control of satellite-packet switched telecommunications
networks",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="438-440",
YEAR=1979,
REFERENCES=4,
KEYWORDS="Packet switching; satellite radio; TDMA; time division
multiple access",
ANNOTE="This paper discusses the results of an investigation of control
techniques for packet switching networks utilizing satellite
transmission under stressed conditions. Emphasis is placed on
controlling tdm satellite networks to enhance traffic carrying capacity
and maintain performance under stressed conditions.",
}

@TECHREPORT{Rich79:Communications,
AUTHOR="I. Richer and P. A. Bernstein and A. A Mc Kenzie and  others",
TITLE="Communications technology forecast",
INSTITUTION="NTIS, US Department of Commerce",
ADDRESS="5285 Port Royal Road, Springfield, VA 22161",
PAGES="1-349",
YEAR=1979,
KEYWORDS="Future outlook; communication network; data transmission;
communication protocol; reliability; microprocessor; small computer;
information system; facsimile; multimedia; teleconference",
ANNOTE="Topics covered include network architectures; transmission
media; communication protocols; internetworking; security; software;
microprocessor; minicomputers and terminals; digital transmis sion of
analog signals; facsimile and ocr; audiovisual techniques;
teleconferencing; and distributed data base systems.",
}

@INPROCEEDINGS{Rode79:Loss,
AUTHOR="A. Röder",
TITLE="The loss of one-sided link systems with short path connections",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-7",
YEAR=1979,
REFERENCES=5,
KEYWORDS="Communication network; loss system; link system",
ANNOTE="In one-sided link systems, the use of short path connections
leads to an increase of the grade of service. Hereby the two different
selection modes point-to-point selection as well as point-to-group
selection are considered.",
}

@ARTICLE{Rose79:Special,
AUTHOR="P. Rosen",
TITLE="Special issue on satellite communications",
JOURNAL=ieeecom,
VOLUME="COM-27",
YEAR=1979,
KEYWORDS="Satellite radio; packet switching; FDMA; frequency division
multiple access; TDMA; time division multiple access",
ANNOTE="A survey of the present development in satellite communications
including packet transmission is given.",
}

@ARTICLE{Roth79:Was,
AUTHOR="W. Roth and W. Tietz",
TITLE="Was ist Euronet?",
JOURNAL=er,
PAGES="288-",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Packet switching",
ANNOTE="Euronet ist die Gesamtheit aus Datenbanken,
Datenverarbeitungsanlagen (hosts) und Fernmeldenetz. Wenn das
Übertragungs- und Vermittlungsnetzwerk getrennt angesprochen werden
soll, so ist es zutreffender, von dem Euronet-datennetz zu sprechen.",
}

@INPROCEEDINGS{Roth79:Economic,
AUTHOR="K. Rothmaier and R. Scheller",
TITLE="Design of economic {PCM-arrays} with a prescribed grade of
service",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-10",
NOTE="\cite{Roth8107:Design}",
YEAR=1979,
REFERENCES=22,
KEYWORDS="Communication network; PCM; circuit switching; reference;
blocking; switching network",
ANNOTE={This paper deals with the design of economically structured PCM
switching arrays for traffic distribution. The paper concludes comparing
the traffic behaviour and cost of the various PCM switching arrays.
Finally new "PCM charts" are developed as useful means for the design of
economic PCM switching arrays.},
}

@ARTICLE{Rubi79:Message,
AUTHOR="I. Rubin",
TITLE="Message delays in {FDMA} and {TDMA} communication channels",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="769-777",
YEAR=1979,
REFERENCES=17,
KEYWORDS="Satellite radio; time in system; FDMA; frequency division
multiple access; TDMA; time division multiple access",
ANNOTE="The distribution of the message delay difference under the
corresponding tdma and fdma schemes, for any message arrival stream, any
service ordering discipline and at any time, is derived. This
distribution is shown to be equal to that of a simple random variable
associated with the message arrival stream. Message delays under a tdma
scheme are shown to be always lower than those under the corresponding
fdma scheme, but the difference value",
}

@ARTICLE{Rugg79:TELETEX,
AUTHOR="R. R ggeberg",
TITLE="{TELETEX} - ein neuer Textkommunikationsdienst",
JOURNAL=fernmelde,
VOLUME=33,
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Teletex; traffic model",
}

@TECHREPORT{Sama79:Distributed,
AUTHOR="N. K. Samari and G. M. Schneider",
TITLE="The analysis of distributed computer networks using {M/D/R} and
{M/M/1} queues",
INSTITUTION="Computer science department, University of Minnesota,
NUMBER=",
PAGES="1-43",
YEAR=1979,
REFERENCES=17,
KEYWORDS="Communication network; M/D/N; M/M/1; evaluation",
ANNOTE="This paper describes the development of a new analytic model for
distributed computer networks. The model factors each node of a network
into processing and channel components and models each separately using
M/D/R and M/M/1 queues. The model also includes a correction factor for
the nonexponential nature of the input under heavy utilization. Results
produced by the new model are compared with results previously reported
in the literature to",
}

@ARTICLE{Saue79:Confidence,
AUTHOR="C. H. Sauer",
TITLE="Confidence intervals for queueing simulations of computer
systems",
JOURNAL=per,
VOLUME=8,
PAGES="45-55",
YEAR=1979,
REFERENCES=27,
KEYWORDS="Simulation; Queueing network; confidence interval; estimation;
bibliography",
ANNOTE="Simulation models of computer systems may be formulated as
queueing networks. Several methods for confidence interval estimation
for queueing simulations are discussed. Empirical studies of these
methods are presented.",
}

@ARTICLE{Saue79:Queueing,
AUTHOR="C. H. Sauer and E. A. Mac Nair",
TITLE="Queueing network software for systems modelling",
JOURNAL="Software",
VOLUME=9,
PAGES="369-380",
YEAR=1979,
REFERENCES=26,
KEYWORDS="Performance evaluation; Queueing network; simulation;
independent cycles; program construction; RESQ; research queueing
package",
ANNOTE="We survey the characteristics of mayor pieces of queueing
software. Based on this survey we synthesize a set of design objectives
for queueing software. Finally, we discuss our own queueing network
software, the research queueing package (RESQ), in light of these
objectives.",
}

@TECHREPORT{Saue79:Hybrid,
AUTHOR="C. H. Sauer and Seung-Chul Woo and Chi-He Chang",
TITLE="Hybrid analysis/simulation",
INSTITUTION="IBM report RC 6341",
ADDRESS="Yorktown Heights",
YEAR=1979,
KEYWORDS="Simulation; APLOMB",
}

@INPROCEEDINGS{Sche79:Calculation,
AUTHOR="R. Schehrer",
TITLE="On the calculation of full access groups for internal and
external traffic with two types of sources",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-8",
NOTE="also AEÜ 34 (7-8), (1980) pp. 279-287",
YEAR=1979,
REFERENCES=11,
KEYWORDS="Communication network; loss system",
ANNOTE="In this paper, loss probabilities of switching systems with full
access groups for internal and external traffic and with two types of
traffic sources are investigated. Results are presented by means of
examples and diagrams.",
}

@INPROCEEDINGS{Sche79:Local,
AUTHOR="R. Scheller and M. Wizgall",
TITLE="A local {PCM} switching system for voice and data",
BOOKTITLE=iss,
ADDRESS="Paris",
PAGES="1-8",
YEAR=1979,
REFERENCES=7,
KEYWORDS="design; realization; performance evaluation; PCM; process
management; microprocessor software; switching network",
ANNOTE="The architecture and operating mode of a combined switching
system for the switching of telephone connections (voice) and data
connections (line switching principle) is presented. This switching
system uses time division techniques. For voice a pcm switching array
and for data a special data switching array is provided. Data switching
makes use of envelopes and subchannel multiplexing. The control
structure of the system is characterized by",
}

@ARTICLE{Schm79:Methods,
AUTHOR="B. W. Schmeiser",
TITLE="Methods for modelling and generating probabilistic components in
digital computer simulation where the standard distributions are not
adequate: a survey",
JOURNAL=simuletter,
PAGES="38-",
YEAR=1979,
KEYWORDS="Simulation; random number generation; random variate
generation",
}

@ARTICLE{Schm79:Simulation,
AUTHOR="B. Schmidt",
TITLE="Die Simulation zeitdiskreter Systeme",
JOURNAL=infspec,
VOLUME=2,
PAGES="78-83",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Simulation",
}

@MISC{Schn79:Analytic,
AUTHOR="G. M. Schneider and N. K. Samari",
TITLE="An analytic model of a user-resource computer network",
INSTITUTION="Computer science Department, University of Minnesota",
NUMBER="79-30",
PAGES="1-19",
YEAR=1979,
REFERENCES=11,
KEYWORDS="Queueing network; evaluation; communication network; model;
M/D/N; M/M/1; M/H2/1",
ANNOTE="This paper describes a queueing-theory based analytic model of a
user-resource computer network. These networks are composed of two
distinct components - the host subnetwork providing end-user services
and the communications subnetwork providing transport services. Our
modelling approach factors the network into these two parts and develops
separate solutions for the delays within each component based on M/D/r,
M/M/1, and M/H2/1 queueing syste",
}

@ARTICLE{Schr79:Offenes,
AUTHOR="H. F. W. Schramm",
TITLE="Ein offenes Netzwerk für die Kommunikation zwischen Systemen
verschiedener Herkunft",
JOURNAL="Online",
VOLUME=10,
PAGES="790-794",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="realization; computer network; packet switching; X.25;
interface processor",
ANNOTE="Mit mehreren projekten haben verschiedene deutsche
comput.-anwender die konzeption, planung oder bereits pilotanwendung von
netzwerk-lösungen fuer den freizuegigen datenverkehr zwischen sys temen
unterschiedlicher hersteller begonnen. Eines der juengst en projekte
geht nun bei der dfvlr-deutsche forschungs- und versuchsanstalt fuer
luft- und raumfahrt der realisation entgegen. Mit snatch (SNA and
Transdata coupling of hosts) wird hier",
}

@INPROCEEDINGS{Schr79:Improved,
AUTHOR="F. Schreiber",
TITLE="Improved simulation by application of the objective
Bayes-statistics",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-7",
NOTE="also in AEÜ 34, 6 (1980), pp. 243-249",
YEAR=1979,
REFERENCES=19,
KEYWORDS="Simulation; error measure; bayes statistics; variance;
confidence interval; comparison",
ANNOTE="An alternative measure for error can be derived from bayesian
methods in statistics. The relatve error can be used as a criterion to
stop simulation when this error falls below a prescribed value. It is
further shown how the absolute and relative error can be graphically
expressed in diagrams of a simulated distribution function with
logarithmically scaled ordinate.",
}

@INPROCEEDINGS{Schr79:Interactive,
AUTHOR="T. J. Schriber and R. W. Andrews",
TITLE="Interactive analysis of simulation output by the method of batch
means",
BOOKTITLE="winter simulation conference",
PAGES="513-525",
YEAR=1979,
KEYWORDS="Simulation; output analysis; statistics",
}

@ARTICLE{Schw79:Development,
AUTHOR="E. Schwartz",
TITLE="Development of credible computer system simulation models",
JOURNAL=per,
VOLUME=8,
PAGES="78-95",
YEAR=1979,
REFERENCES=5,
KEYWORDS="Simulation; model; validation; reliability",
ANNOTE="The problems encountered during a simulation effort are
influenced by the objectives of the simulation. Verification and
validation of the simulation model are two such problems which affect
the credibility (and usability) of the model.",
}

@ARTICLE{Schw79:Throughput,
AUTHOR="M. Schwartz",
TITLE="Throughput and time delay analysis for a common queue
configuration in a multiprocessor environment",
JOURNAL=ieeetc,
VOLUME="C-28",
PAGES="939-943",
YEAR=1979,
REFERENCES=5,
KEYWORDS="M/G/2; comparison; waiting time; multiprocessor system;
analysis",
ANNOTE="The time delay-throughput characteristic of a two-processor sys
tem serving two poisson-arriving job classes through a common queue
configuration is investigated and compared to that of a two-processor
system, with each processor dedicated to one of the job classes. To
carry out the queueing analysis of the common queue scheme an
approximate yet accurate expression for the waiting time is introduced.
Considerable throughput improvement is found",
}

@MISC{Schw79:Congestion,
AUTHOR="M. Schwartz and S. Saad",
TITLE="Analysis of Congestion Control Techniques in Computer
communication Networks",
EDITOR="Xavier Lagrange",
PUBLISHER="North-Holland Publishing Company",
PAGES="113-130",
YEAR=1979,
KEYWORDS="computer network; flow control; congestion control",
ANNOTE="In this paper we summarize briefly various models and approaches
that have been used previously to analyze a variety of congestion
control mechanisms. These include virtual circuit and small network
models, as well as a single node model appropriate to a large,
homogeneous, symmetric network. The control mechanisms that have been
modeled include end-to-end or window control, localcontrol, link buffer
assignment, and input buffer limiting.",
}

@ARTICLE{Schw79:Mikroprozessoren,
AUTHOR="H. Schwärtzel",
TITLE="Mikroprozessoren in distribuierten Informationssystemen.- Stand
und Entwicklung-",
JOURNAL=aninf,
VOLUME=7,
PAGES="294-302",
YEAR=1979,
LANGUAGE="German",
REFERENCES=14,
KEYWORDS="Parallel computing; information system; microprocessor",
ANNOTE="Microprocessors have an influence on the organization as well as
on the structure of distributed information systems. They promote -by
their cost-effectiveness -the changing to information ne tworks and they
back up the implementation of multiprocessor structures within the
different subsystems. Starting with a survey of the technological state
of the art, followed by a short forecast the above mentioned influences
are discussed in detail, divi",
}

@ARTICLE{Schw79:Berechnung,
AUTHOR="M. Schwindt",
TITLE="Berechnung der Verbundwahrscheinlichkeit beliebiger Ordnung
schwach korrelierter Signale",
JOURNAL=aeu,
VOLUME=33,
PAGES="407-",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Statistics",
}

@ARTICLE{Scot79:Software,
AUTHOR="A. W. Scott",
TITLE="Network software requirements and practice",
JOURNAL="Small Systems Software",
VOLUME=1,
NUMBER=3,
PAGES="2-14",
YEAR=1979,
KEYWORDS="Computer network; realization; message switching;
communication protocol",
ANNOTE="Informativer artikel über die software- implementation des
decnet.",
}

@INPROCEEDINGS{Sega79:Delay,
AUTHOR="M. Segal",
TITLE="On the delay-ratio queue discipline",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="1-4",
YEAR=1979,
REFERENCES=6,
KEYWORDS="M/M/N; queueing discipline; priority",
ANNOTE="We consider a service system with two classes of customers
having different grade-of-service requirements. We develop a Markovian
model for delay-ratio control, a queue discipline recently proposed by
C. A. Lapadula, which attempts to keep the ratio of the expected delays
of the classes near a given constant.",
}

@ARTICLE{Sega79:Optimal,
AUTHOR="A. Segall",
TITLE="Optimal distributed routing for virtual line-switched data netwo
rks",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="201-209",
YEAR=1979,
REFERENCES=16,
KEYWORDS="Virtual channel; routing algorithm",
ANNOTE="An algorithm that provides minimum delay routing in a data
communication network using virtual line-switching is presented. Th e
algorithm uses distributed computation in the sense that the nodes of
the network update their information in an orderly fashion based on
messages received from their neighbors.",
}

@ARTICLE{Shap79:Stochastic,
AUTHOR="Susan Shapiro",
TITLE="Stochastic Petri net with applications to modelling occupancy
times for concurrent task systems",
JOURNAL=networks,
ISBN="0028-3045",
ADDRESS="Hoboken, New Jersey",
VOLUME=9,
NUMBER=4,
PAGES="375-379",
YEAR=1979,
REFERENCES=4,
KEYWORDS="Computer system; fault tolerance; Petri net",
ANNOTE="A random Petri net model is presented and analyzed. The model
has application to systems involving concurrence.",
}

@ARTICLE{Trib79:Comments,
AUTHOR="M. Tribus and A. Kandel",
TITLE={Comments on "fuzzy sets, fuzzy algebra, and fuzzy statistics"},
JOURNAL=ieeeproc,
VOLUME=67,
PAGES="1168-1169",
YEAR=1979,
REFERENCES=15,
KEYWORDS="Fundamentals in statistics; fuzzy statistics",
ANNOTE="Critical review of fuzzy statistics. Comparison to subjective
bayes statistics.",
}

@ARTICLE{Rens79:Centralize,
AUTHOR="C. van Rensselaer",
TITLE="Centralize? decentralize? distribute?",
JOURNAL=datamation,
VOLUME=25,
NUMBER=4,
PAGES="88-97",
YEAR=1979,
KEYWORDS="Communication network; realization; application",
ANNOTE="Der Autor berichtet über die zwanzigjährige Erfahrung der Fa.
Hewlett Packard auf dem Gebiet der verteilten Da tenverarbeitung.",
}

@ARTICLE{Walk79:Vergabe,
AUTHOR="B. Walke",
TITLE="Vergabe von Prioritäten und Einsatz von Betriebsmitteln in
Realzeitrechnern - Übersicht und Entwurf einer
Projektierungsrichtlinie",
JOURNAL=aeg,
ADDRESS="Ulm",
VOLUME=52,
NUMBER="3-4",
PAGES="157-171",
NOTE="also in Informatik-Spektrum 4, 2 (1981) 101-121",
YEAR=1979,
LANGUAGE="German",
REFERENCES=6,
KEYWORDS="survey; process control; resource; HOL priority; PREHOL
priority; FIFO; queueing discipline; priority",
ANNOTE="Diese richtlinie stellt optimierungsziele beim real-zeitrechner
und bekannte strategien zu ihrer erreichung dar. Ziel der ric htlinie
ist es, die folgen fuer das zeitverhalten von anforderungen an einen
realzeitrechner vorzustellen, wie sie sich bei unterschiedlicher vergabe
von prioritäten ergeben.",
}

@ARTICLE{Wein79:Beschreibung,
AUTHOR="H. Weinrichter",
TITLE="Beschreibung der Verwürfelung stochastisch unabhängiger
Binärfolgen in rückgekoppelten Schieberegistern",
JOURNAL="Frequenz",
VOLUME=33,
PAGES="207-",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Shift register sequences; Walsh-transform",
}

@TECHREPORT{Wink79:Prozesskonzept,
AUTHOR="J. F. H. Winkler",
TITLE="Das Prozesskonzept in Betriebssystemen und Programmiersprachen",
INSTITUTION="Institut für informatik 3, Universität Karlsruhe",
ADDRESS="Karlsruhe",
NUMBER="3/79",
PAGES="1-52",
YEAR=1979,
LANGUAGE="German",
REFERENCES=51,
KEYWORDS="Survey; bibliography; programming language; PL/1; PASCAL;
FORTRAN; operating system; process management; command language; ALGOL;
concurrent PASCAL; PEARL; MODULA-2",
ANNOTE="The concept of process is used in operating systems, command and
programming languages. Using this concept simplifies the construction of
operating systems considerably. The concept of process is an essential
feature of real-time languages. This paper describes several different
realizations of this concept by means of a uniform framework. The
process concepts of six algorithmic and six real-time languages are
characterized by 23 features.",
}

@ARTICLE{Thom79:Study,
AUTHOR="A. Thomasian and H. Kanakia",
TITLE="Performance Study of Loop Networks Using Buffer Insertion",
JOURNAL=cn,
VOLUME=3,
PAGES="419-425",
YEAR=1979,
REFERENCES=10,
KEYWORDS="Queueing network; access control; priority; waiting time;
performance evaluation",
ANNOTE="In the paper a Modified DLCN (MDLCN) access control mechanism
which assumes an infinite buffer size for message arriving from the ring
is considered. It is shown that the ATDM and MDLCN schemes have the same
mean end-to-end transmission delay.",
}

@INPROCEEDINGS{Cham79:Large,
AUTHOR="M. D. Chambers and A. Stockert and J. G. Kappel",
TITLE="Large {ESS} Traffic Engineering Methods",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="522 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Chan79:Economic,
AUTHOR="W. C. Chan",
TITLE="An Economic Method for Improving Telephone Network
Serviceability",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="613 N",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@ARTICLE{Chem79:Metamorphosis,
AUTHOR="A. Chemarin",
TITLE="The metamorphosis of histograms 'subscribers/telephone traffic'",
JOURNAL="Telecommunication Journal",
VOLUME=46,
NUMBER=5,
YEAR=1979,
KEYWORDS="Measurement",
}

@ARTICLE{Chun79:Concentrators,
AUTHOR="F. R. K. Chung",
TITLE="On Concentrators, Superconcentrators, Generalizers, and
Nonblocking Networks",
JOURNAL=bstj,
YEAR=1979,
KEYWORDS="Link system",
}

@INPROCEEDINGS{Clos79:Study,
AUTHOR="C. Closs",
TITLE="A Study of Non-Blocking Rearrangeable Switching Networks",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES=341,
YEAR=1979,
KEYWORDS="Link system",
}

@ARTICLE{Comb79:Optimal,
AUTHOR="J.-P. Combot and L. G. Mason",
TITLE="Optimal Switch-Concentrator Location for a Telephone Network",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=1,
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Conn79:Traffic,
AUTHOR="J. Connel",
TITLE="Traffic Data Acquisition systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="210 I",
YEAR=1979,
KEYWORDS="Data traffic; computer network",
}

@INPROCEEDINGS{Dahl79:Measurements,
AUTHOR="P. Dahlström and K. Nivert and L. E. Siöström",
TITLE="Some Measurements of the Traffic between Subscribers in Small
Geographical Areas",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="122 N",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Dais79:Reliability,
AUTHOR="G. Daisenberger",
TITLE="Reliability of Combined Measurement of Mean Holding Time and
Traffic load Based on Counting Calls and Sampling Seizures States ates",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="231 N",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Dams79:Tim,
AUTHOR="E. Damsleth and B. H. Sollie and T. Bakken",
TITLE="A Tim-Series Transfer Model for the Relationships between
Registers and Junctors in a Telephone Exchange, with Applocations to
Traf-s to Traf-fic Control",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="533 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Das79:Various,
AUTHOR="P. K. Das and D. G. Smith",
TITLE="The Performance of Various Gradings under Severe Load Unbalance",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="542 R",
YEAR=1979,
KEYWORDS="Grading",
}

@INPROCEEDINGS{Davi79:Sequential,
AUTHOR="A. J. David and C. D. Pack",
TITLE="The Sequential Projection Algorithm: A New and Improved Traffic
Forecasting Procedure",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="113 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Boer79:Maintnance,
AUTHOR="J. de Boer",
TITLE="Maintnance Interval for a full Availability Group of Devices in a
Loss System",
BOOKTITLE=itc9,
PAGES="541 N",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Hert79:Traffic,
AUTHOR="E. de Hert",
TITLE="Traffic distribution for a Base Unit Remote Switching Unit
Entity",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="124 N",
YEAR=1979,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Desc79:Stochastic,
AUTHOR="A. Descloux",
TITLE="Stochastic Models for Service Evaluation Systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="222 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Elsn79:Dimensioning,
AUTHOR="W. B. Elsner",
TITLE="Dimensioning Trunk Groups for Digital Networks",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="421 R",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Engv79:International,
AUTHOR="L. Engvall",
TITLE="International Network Optimization Methods",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="623 N",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Ever79:Index,
AUTHOR="R. Evers and G. Mrozynski",
TITLE="Performance Index Describing the Degradation of the Grade of
Service in Service-Integrated System with Overload",
BOOKTITLE=itc9,
ADDRESS="Torromolinos",
PAGES="312 R",
YEAR=1979,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Farr79:Observations,
AUTHOR="J. P. Farr and E. H. J. Waldrom",
TITLE="Observations of user behaviour and service quality for a long
distance Telecommunications network under sustained traffic overload
overload",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="142 R",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Fern79:Observation,
AUTHOR="F. Fernandez and M. S. Aquilar",
TITLE="Observation of the Effect of Killer Trunks on Grade of Service",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="543 R",
YEAR=1979,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Flem79:TrafficSet,
AUTHOR="P. Fleming",
TITLE="Traffic Considerations of a new Generation of Telephone set",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="422 N",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Flem79:TrafficOffices,
AUTHOR="P. Fleming",
TITLE="Traffic Consideration of Digital Class 5 Offices",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="423 N",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Fran79:Traffic,
AUTHOR="H. Frank",
TITLE="Traffic Problems in Computer Networks",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="430 I",
YEAR=1979,
KEYWORDS="Data traffic; computer network",
}

@INPROCEEDINGS{Frie79:Extreme,
AUTHOR="K. A. Friedman",
TITLE="Extreme Value Analysis Techniques",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="313 R",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Fuji79:Traffic,
AUTHOR="C. Fujihashi and E. Gambe",
TITLE="Traffic Properties of Multi-Stage Waiting Systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="511 R",
YEAR=1979,
KEYWORDS="Delay system",
}

@INPROCEEDINGS{Gaba79:Sapart,
AUTHOR="S. Gabarda and J. L. Garcia and F. J. Gimeno",
TITLE="The Sapart Network Auxiliary System Engineering for Planning and
Analysis of Telephone Networks",
BOOKTITLE=itc,
ADDRESS="Torremolinos",
PAGES="212 N",
YEAR=1979,
KEYWORDS="QOS",
}

@INPROCEEDINGS{Gall79:Blocking,
AUTHOR="Giorgio Gallassi",
TITLE="Blocking in Three-Stage Digital Switching Networks",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="332 N",
YEAR=1979,
KEYWORDS="Link system",
}

@INPROCEEDINGS{Garc79:Progressive,
AUTHOR="H. Garcia and D. C. Berzosa",
TITLE="Progressive Method of overload Control for Processors",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="534 N",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Gava79:Distribution,
AUTHOR="M. Gavassuti and G. Giacobbo Scavo",
TITLE="Distribution of the Grade of Loss in a Long Distance network",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="624 N",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Giro79:Analise,
AUTHOR="A. Girolami",
TITLE="Analise de Trafego",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="223 N",
YEAR=1979,
LANGUAGE="Spanish",
KEYWORDS="Gos",
}

@ARTICLE{Goel79:Queue,
AUTHOR="L. F. Goeller",
TITLE="To Queue or not to Queue ?",
JOURNAL=bcr,
VOLUME=9,
NUMBER=2,
YEAR=1979,
KEYWORDS="Delay system",
}

@ARTICLE{Goel79:Programs,
AUTHOR="L. F. Goeller",
TITLE="Programs for Traffic Calculation",
JOURNAL=bcr,
VOLUME="May-Juni",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Gonz79:Appproach,
AUTHOR="O. Gonzalez Soto and G. J. A. Higuera and C. D. Berzosa and 
others",
TITLE="An Appproach to Flexible Modeling and Simulation for Control
processor Analysis",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="527 R",
YEAR=1979,
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Gonz79:Parameters,
AUTHOR="O. Gonzalez Soto and L. Martinez Miguez",
TITLE="Parameters and Communication Efficiencies in the Modelling of a
Packet Switching Network",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="435 R",
YEAR=1979,
KEYWORDS="Data traffic; computer network",
}

@INPROCEEDINGS{Gosz79:CCITT,
AUTHOR="G. Gosztony",
TITLE="{CCITT} Practice - a Permanent Challenge to Teletraffic
Engineering",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="310 I",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Gran79:Evolution,
AUTHOR="R. F. Grantges and G. W. Riesz and B. E. Synder",
TITLE="Evolution of the total Network Data System",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="213 R",
YEAR=1979,
KEYWORDS="Data traffic; computer network",
}

@INPROCEEDINGS{Greg79:Measurement,
AUTHOR="E. W. Gregory and D. J. Songhurst",
TITLE="Measurement and Analysis of Subscriber Traffic Rates",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="224 R",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Guit79:Taking,
AUTHOR="S. Guitoneau and B. Camoin",
TITLE="Network design Taking into Account Breakdowns and Traffic
Overloads",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="625 N",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Haen79:Management,
AUTHOR="D. G. Haenschke",
TITLE="Network Management System in the United States",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="632 R",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Harr79:Implementing,
AUTHOR="R. J. Harris and R. E. Sharkey",
TITLE="Implementing the Sequential Projection algorithm in an Operating
Telephone Company",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="114 N",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Harv79:Determining,
AUTHOR="C. Harvey and C. R. Hills",
TITLE="Determining Grades of Service in a network",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="626 R",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Hash79:Congestion,
AUTHOR="O. Hashida and S. Nakajima and M. Kazuhiko and Kazunori Okada",
TITLE="Congestion Mechanisme and Overload Control in Telephone
Networks",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="633 R",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Haug79:Traffic,
AUTHOR="R. B. Haugen and G. Fredrikson",
TITLE="Traffic Analysis of an Overloaded Telephone Network with Both
Centralized and Distributed Control",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="512 R",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Henn79:Feedback,
AUTHOR="B. Hennion",
TITLE="Feedback Methods for Calls Allocation on the Crossed Traffic
Routing",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="614 N",
YEAR=1979,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Herz79:Automatic,
AUTHOR="M. Herzberg",
TITLE="Automatic Message Supervision System {(AMSS)}",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="214 N",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Gos",
}

@INPROCEEDINGS{Holm79:Optimization,
AUTHOR="G. Holmberg and P. Lindberg",
TITLE="Optimization of digital local networks taking reliability into
account",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="424 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Hopm79:Service,
AUTHOR="A. C. M. Hopmans and R. Van der Ven",
TITLE="Service Protection for Special Traffic Flows",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="635 R",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Hwan79:Superior,
AUTHOR="F. K. Hwang",
TITLE="Superior Channel Graphs",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="342 R",
YEAR=1979,
KEYWORDS="Link system",
}

@INPROCEEDINGS{Iver79:Effect,
AUTHOR="V. B. Iversen",
TITLE="The Effect of Holding Times on Loss Systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="135 N",
YEAR=1979,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Jaco79:Teletraffic,
AUTHOR="C. Jacobaeus",
TITLE="Teletraffic Theory and its Practical Applications a Veteran's
Viewon the Present Situation",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="130 I",
YEAR=1979,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Jens79:Long,
AUTHOR="A. Jensen",
TITLE="Long Term Planning in Telephony",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="110 I",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Jobm79:Optimization,
AUTHOR="K. Jobmann",
TITLE="Optimization of Monte Carlo Simulation",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="232 N",
YEAR=1979,
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Joni79:Simulation,
AUTHOR="G. L. Jonin and J. J. Sedol",
TITLE="Simulation Language {PALM}",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="524 N",
YEAR=1979,
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Jung79:Busy,
AUTHOR="M. M. Jung",
TITLE="Busy Period Distribution of a Single Server Queueing System, to
which Traffic is Offered Via a Clock-Pulse Operated Gate",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="513 R",
YEAR=1979,
KEYWORDS="Delay system",
}

@ARTICLE{Jung79:Random,
AUTHOR="M. M. Jung",
TITLE="Random overflow of calls between subgroups in a full availability
group of lines",
JOURNAL=ptr,
ADDRESS="Eindhoven",
VOLUME=37,
NUMBER=2,
PAGES="81-94",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Katz79:Improved,
AUTHOR="S. S. Katz",
TITLE="Improved Network Administration Process Utilizing End-to-End
Service Consideration",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="544 R",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Khad79:Planning,
AUTHOR="R. Khadem and A. Schulzki",
TITLE="Planning and rorecasting using a simulation model",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="115 N",
YEAR=1979,
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Knut79:Modelling,
AUTHOR="A. Knutsson",
TITLE="Modelling for Automatic Network Management: An Adaptive
Time-Recursive Parameter Estimator and Traffic Predictor",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="636 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Kocz79:Mathematical,
AUTHOR="L. T. Koczy",
TITLE="A Mathematical Model of Path Searching in General Type Switching
Networks",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="343 R",
YEAR=1979,
KEYWORDS="Link system",
}

@INPROCEEDINGS{Koda79:Balanced,
AUTHOR="K. Kodaira and T. Ueda",
TITLE="Balanced Skip Multiples and their Wiring Algorithms",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="545 R",
YEAR=1979,
KEYWORDS="Grading",
}

@ARTICLE{Krau79:Telefonanlagen,
AUTHOR="G. Krause and A. Reiter",
TITLE="Telefonanlagen richtig bemessen",
JOURNAL="Data Report",
VOLUME=14,
NUMBER=1,
PAGES="38-41",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="tastengesteuerte Wählanlage; Nebenstellenanlage;
Gesprächsaufkommen; Leistungsmerkmale; aufgabengerechte Anlagen; grade
of service",
}

@INPROCEEDINGS{Krau79:Traffic,
AUTHOR="J. M. Kraushaar and R. R. Mina",
TITLE="A Traffic Measuring Device Based on the Concept of State
Transition",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="225 R",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Kuba79:Worst,
AUTHOR="M. Kubale",
TITLE="Worst - Case Analysis of some Algorithms for Rearranging Three -
Stage Connections Networks",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="344 N",
YEAR=1979,
KEYWORDS="Link system",
}

@INPROCEEDINGS{Lave79:Performances,
AUTHOR="R. Lavergne and M. Demard",
TITLE="E 12-System-Software Performances",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="525 N",
YEAR=1979,
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Lavi79:Administrative,
AUTHOR="M. E. Lavigne and J. R. Barry",
TITLE="Administrative Concepts in an Advance Routing Network",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="615 R",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Lee79:Traffic,
AUTHOR="L. Lee",
TITLE="A Traffic Forecast Technique for Network Planning",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="125 N",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Gall79:Further,
AUTHOR="P. Le Gall",
TITLE="Further Studies on lost call Telephone Traffic",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="132 R",
YEAR=1979,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Leht79:Extreme,
AUTHOR="P. Lehtinen",
TITLE="Extreme Value Control and an Additive Seasonal Moving Average
Model for the Evaluation of Daily Peak Hour Traffic Data",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="314 R",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Lind79:Traffic,
AUTHOR="G. Lind",
TITLE="Studies on Traffic Processes of Single Subscribers and Groups of
Subscribers",
BOOKTITLE=itc9,
ADDRESS="torromolinos",
PAGES="143 R",
YEAR=1979,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Lind79:Accuracy,
AUTHOR="K. Lindberger",
TITLE="The Accuracy of carried Traffic Measurements with Applications to
supervision of Overflow System",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="243 N",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Liu79:Direct,
AUTHOR="Ke Liu",
TITLE="Direct-Distance-Dialing Call Completion and Customer Retrial
behaviour",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="144 R",
NOTE="also in The Bell System Technical Journal, March 1980",
YEAR=1979,
KEYWORDS="GOS",
}

@INPROCEEDINGS{MacD79:Growth,
AUTHOR="A. N. MacDiarmid",
TITLE="A Growth Rate Forecast System for Intertoll Traffic",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="116 N",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{MacF79:Statistical,
AUTHOR="N. W. MacFadyen",
TITLE="Statistical Observation of Repeat attempts in the Arrival
Process",
BOOKTITLE=itc9,
ADDRESS="Torrmolinos",
PAGES="145 N",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Mari79:Mathematical,
AUTHOR="J. I. Marin",
TITLE="A Mathematical Model for Traffic Matrices Calculation",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="126 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Marl79:Use,
AUTHOR="A. Marlevi",
TITLE="Use of Stochastic Models in Choosing Network Synchronization
methods, Clock Stabilities and Elastic Buffer Sizes",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="425 N",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Mazz79:Full,
AUTHOR="U. Mazzei and G. Miranda and P. Pallotta",
TITLE="On a Full Digital Long-Distance Network",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="426 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Mier79:Estimation,
AUTHOR="J. Miernik",
TITLE="Estimation of Traffic Service in a System of Full-Availability
trunk Group with Mutual Overflow",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="245 N",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Miln79:Distribution,
AUTHOR="C. B. Milne",
TITLE="The Distribution of Measured Traffic with Poisson Call Arrivals",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="234 N",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Mina79:Role,
AUTHOR="R. R. Mina and J. M. Kraushaar",
TITLE="The Role of Traffic Engineering in the Environment of a Regulated
Monopoly Telephone Service",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="315 N",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Mizu79:Signifiance,
AUTHOR="M. Mizuki",
TITLE="Signifiance of Time Tagging in Each Simulated Sequence",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="235 N",
YEAR=1979,
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Mora79:Study,
AUTHOR="G. Morales and A. Crespo and M. G. Rafart",
TITLE="Study of Traffic Imbalance in Subscriber Matrice",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="546 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Mroz79:Reliability,
AUTHOR="G. Mrozynski",
TITLE="Reliability of Service Integrated Communication Networks and its
Dependencies of Traffic Load and Traffic Distribution",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="427 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Neal79:Effective,
AUTHOR="S. R. Neal",
TITLE="Effective Network Administration in the Presence of Measurement
Uncertainty",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="226 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Nils79:Use,
AUTHOR="A. Nilsson and W. J. Stewart and J. Seraj",
TITLE="On the Use of Digital Approximation for Modeling Multiprocessor
systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="515 N",
YEAR=1979,
KEYWORDS="Data traffic; computer network",
}

@INPROCEEDINGS{Nomb79:Spacing,
AUTHOR="L. F. Nombela",
TITLE="Spacing Theory in some Traffic Topics",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="316 N",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Olss79:Variance,
AUTHOR="K. M. Olsson",
TITLE="The Variance of Time Congestion in the Final Route of an
Alternative Routing System",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="246 R",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@ARTICLE{Ott79:Telefonsystem,
AUTHOR="G. Ott",
TITLE="Telefonsystem {EMS} von Siemens. Eine neue Familie von
Nebenstellenanlagen",
JOURNAL=ntz,
VOLUME=32,
NUMBER=4,
PAGES="224-229",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Link system",
}

@INPROCEEDINGS{Palm79:Study,
AUTHOR="K. Palmowska",
TITLE="A Study of Traffic Distribution Models with Reference to the
Polish Telex Network",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="127 R (12)",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Pand79:Applicaton,
AUTHOR="R. N. Pandya and W. D. Robinson",
TITLE="Applicaton of an Empirical Bayes Technique Technique to Telephone
Traffic Forecasting",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="117 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Peir79:Accuracy,
AUTHOR="L. Peiram",
TITLE="Accuracy of Measurements on Markovian Service Systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="236 R",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Pill79:Percentage,
AUTHOR="J. M. Pillado",
TITLE="Percentage Estimation of Busy Lines in Subscriber's Selections",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="146 N",
YEAR=1979,
KEYWORDS="Measurement",
}

@ARTICLE{Popt79:Bestimmung,
AUTHOR="V. Poptodorov",
TITLE="Bestimmung der mittleren Belegungsdauer von
Verbindungsleitungenmit Hilfe einer Regressionsmethode",
JOURNAL=ntzarchiv,
NUMBER=4,
PAGES="93-96",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Pott79:Equivalent,
AUTHOR="R. Potter",
TITLE="The Equivalent non Random Method and Restriction Imposed on
Reneval Overflow Systems by the Specification of a finite Number of
Overer of Overflow Traffic Moments",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="247 R",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@ARTICLE{Rack79:Prozessorgesteuerte,
AUTHOR="D. Racki",
TITLE="Prozessorgesteuerte Register für Rotary-Vermittlungsstellen",
JOURNAL=en,
VOLUME=54,
NUMBER=4,
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Link system",
}

@INPROCEEDINGS{Rahk79:Traffic,
AUTHOR="K. Rahko",
TITLE="Traffic Measurements for Telephone Network Planning",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="215 N",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Rao79:Improved,
AUTHOR="R. R. Rao",
TITLE="Improved Trunk Engineering Algorithm for High Blocking
Hierarchical Networks",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="616 R",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Rapp79:Queueing,
AUTHOR="D. Rapp",
TITLE="Some Queueing Models of {AXE-10}",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="516 N",
YEAR=1979,
KEYWORDS="Delay system",
}

@INPROCEEDINGS{Resh79:Optimal,
AUTHOR="M. Resh and U. Yechiali",
TITLE="Optimal Allocation of Telephone Cable Drums to Construction
Sites-a Cutting Stock Problem with a Generalized Objective Function
ction",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="617 N",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Robe79:Recent,
AUTHOR="J. W. Roberts",
TITLE="Recent Observations of Subscriber Behaviour",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="147 R",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Roy79:Effect,
AUTHOR="P. K. Roy-Choudhury and M. N. Shukla and T. R. Wadhwa",
TITLE="Effect of Subscriber Behaviour and Traffic Abnormalities on the
design of {SPC} Exchanges",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="148 N",
YEAR=1979,
KEYWORDS="TDM; time division multiplex",
}

@INPROCEEDINGS{Ruba79:Determination,
AUTHOR="J. Rubas and R. E. Warfield",
TITLE="Determination of Confidence Momits for the Estimates of
Congestion",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="237 N",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Ruci79:Estimation,
AUTHOR="A. Rucinski and A. Klimontowicz",
TITLE="Estimation of Service Effectiveness of Overflow Traffic Component
Flows in Overflow Systems with Full-Availability Trunk Groups",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="248 N",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Sait79:Traffic,
AUTHOR="T. Saito and H. Inose and S. Hayashi",
TITLE="Evaluation of Traffic Carrying Capability in One-Stage and
Two-stage Time-Division Network handling data with a Variety of Speed
classes",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="447 N",
YEAR=1979,
KEYWORDS="TDM; time division multiplex",
}

@INPROCEEDINGS{Sall79:Optimum,
AUTHOR="G. Sallai",
TITLE="An Optimum Strategy for Improving Network Traffic Throughput with
Resources Constraints",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="628 R",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Sall79:Approximate,
AUTHOR="J. M. Salles",
TITLE="An Approximate Model for a Conventional Telephone Exchange",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="517 R",
YEAR=1979,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Sanc79:Integral,
AUTHOR="F. Sanchez",
TITLE="An Integral Observation on an Automatic Telephonic Network, Plan
Application and Result",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="216 N",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Scho79:Optimal,
AUTHOR="Frederik Carel Schoute",
TITLE="Optimal Control and Call Acceptance in a {SPC} Exchange",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="535 N",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Shik79:Report,
AUTHOR="E. Shikiba and T. Mihara and K. Mizuashi and H. Kaiba",
TITLE="A Report on Telephone Traffic Variation in Japan",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="547 N",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Sinh79:System,
AUTHOR="N. K. Sinha",
TITLE="A System Approach to Telecom Network Management",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="637 N",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Somo79:Dynamic,
AUTHOR="P. Somoza and A. Guerrero",
TITLE="Dynamic Processor Overload Control and its Implementation in
certain Singleprocessor and Multiprocessor {SPC} Systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="536 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Ston79:Traffic,
AUTHOR="R. C. Stone and J. A. Sheft",
TITLE="Traffic Engineering of a Remotely Controlled Switching Systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="317 N",
YEAR=1979,
KEYWORDS="Link system",
}

@INPROCEEDINGS{Stor79:Improved,
AUTHOR="K. Stordahl and T. Bakken",
TITLE="Improved Utilization of the Telephone Network Through
Introductionof differentiated Rates",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="324 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Stor79:Confidence,
AUTHOR="K. Stordahl and B. H. Sollie and E. Damsleth",
TITLE="Confidence Limits for the Expected Telephone Traffic in
Simulation Models Using {ARMA-Models}",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="239 R",
YEAR=1979,
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Szcz79:Analog,
AUTHOR="J. Szczepanski",
TITLE="An Analog-Digital Methods for Measuring Parameters and
Probability Distributions of the Telephone Traffic",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="227 N",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Taka79:Generalized,
AUTHOR="K. Takagi",
TITLE="Generalized Optimal Channel Graphs for Slip Connections in a
Class of Link Systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="348 R",
YEAR=1979,
KEYWORDS="Link system",
}

@INPROCEEDINGS{Thie79:Loss,
AUTHOR="G. Thierer",
TITLE="Loss Calculation of Subscriber Link Systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="338 R",
YEAR=1979,
KEYWORDS="Link system",
}

@INPROCEEDINGS{Todo79:L,
AUTHOR="P. Todorov and K. Mirski",
TITLE="L'Influence du Degre de Developement Telephonique et des Tarifs
sur le Trafic Telephonique",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="325 N (32)",
YEAR=1979,
LANGUAGE="French",
KEYWORDS="Gos",
}

@INPROCEEDINGS{Tsan79:Planning,
AUTHOR="B. Tsankov",
TITLE="Planning of three Level Telecommunication Network for more than
one Busy Hour",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="618 N",
YEAR=1979,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Venk79:Traffic,
AUTHOR="M. C. Venkatram",
TITLE="Traffic Management in Congested Telephone Networks",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="548 N",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Vill79:Traffic,
AUTHOR="M. Villen-Altamirano and G. Morales",
TITLE="Traffic Analysis of a Class of Distributed {SPC} Systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="518 N",
YEAR=1979,
KEYWORDS="Data traffic; computer network",
}

@INPROCEEDINGS{Walk79:Link,
AUTHOR="E. Walker",
TITLE="Link Systems - Access to Outgoing Routes Connected to a Number of
Switches",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="349 N",
YEAR=1979,
KEYWORDS="Link system",
}

@INPROCEEDINGS{Wall79:Individual,
AUTHOR="B. Wallström and L. Reneby",
TITLE="On Individual Losses in Overflow Systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="249 R",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Warf79:Optimal,
AUTHOR="R. E. Warfield",
TITLE="Optimal Planning and Processing of Teletraffic Measurements",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="217 R",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Wern79:Productivity,
AUTHOR="M. Werner",
TITLE="Productivity Based Planning Model for Teleglobe Canada",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="326 N",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Wild79:Call,
AUTHOR="K. Wilding and T. Karlstedt",
TITLE="Call Handling and Control of Processor Load in a {SPC} - a
Simulation Study",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="537 R",
YEAR=1979,
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Wizg79:Flow,
AUTHOR="M. Wizgall and W. Kramer and J. Mayer",
TITLE="The Flow of Control Data Within the Analog Concentrator of the
system {IFS}",
BOOKTITLE=itc9,
ADDRESS="Torremolinos",
PAGES="528 R",
YEAR=1979,
KEYWORDS="Data traffic; computer network",
}

@ARTICLE{Apos79:Initializing,
AUTHOR="N. Apostolopoulos and G. Schuff",
TITLE={Initializing algorithms: A note to the article "Computer methods
for sampling from gamma, beta, Poisson and binomial distributions"},
JOURNAL=comp,
VOLUME=22,
PAGES="185-189",
NOTE="Fascicle 2",
YEAR=1979,
KEYWORDS="random variate generation",
}

@ARTICLE{Atki79:Computer,
AUTHOR="A. C. Atkinson",
TITLE="The computer generation of Poisson random variables",
JOURNAL=as,
VOLUME=28,
NUMBER=1,
PAGES="29-35",
YEAR=1979,
KEYWORDS="random variate generation",
}

@ARTICLE{Atki79:Recent,
AUTHOR="A. C. Atkinson",
TITLE="Recent developments in the computer generation of Poisson random
variables.",
JOURNAL=as,
VOLUME=28,
NUMBER=3,
PAGES="260-263",
YEAR=1979,
KEYWORDS="random variate generation",
}

@ARTICLE{Atki79:Family,
AUTHOR="A. C. Atkinson",
TITLE="A family of switching algorithms for the generation of beta
random variables",
JOURNAL=biometrika,
VOLUME=66,
NUMBER=1,
PAGES="141-145",
YEAR=1979,
KEYWORDS="random variate generation",
}

@ARTICLE{Atki79:Algorithm,
AUTHOR="A. C. Atkinson and J. Whittaker",
TITLE="Algorithm {AS} 134: The generation of beta random variable with
one parameter greater than and one parameter less than 1",
JOURNAL=as,
VOLUME=28,
NUMBER=1,
PAGES="90-93",
YEAR=1979,
KEYWORDS="random variate generation",
}

@ARTICLE{Best79:Easily,
AUTHOR="D. J. Best",
TITLE="Some easily programmed pseudo-random normal generators",
JOURNAL="The Australian Computer Journal",
VOLUME=11,
NUMBER=2,
PAGES="60-62",
YEAR=1979,
KEYWORDS="random variate generation",
}

@ARTICLE{Best79:Efficient,
AUTHOR="D. J. Best and N. I. Fisher",
TITLE="Efficient simulation of the von Mises distribution",
JOURNAL=as,
VOLUME=28,
NUMBER=2,
PAGES="152-157",
YEAR=1979,
KEYWORDS="random variate generation",
}

@ARTICLE{Chen79:Simple,
AUTHOR="R.-G. Cheng and G. M. Feast",
TITLE="Some simple gamma variate generators",
JOURNAL=as,
VOLUME=28,
NUMBER=3,
PAGES="290-295",
YEAR=1979,
KEYWORDS="random variate generation",
}

@ARTICLE{Fish79:Sampling,
AUTHOR="G. S. Fishman",
TITLE="Sampling from the binomial distribution on a computer",
JOURNAL="Journal of the American Statistical Association",
VOLUME=74,
NUMBER=366,
PAGES="418-423",
YEAR=1979,
KEYWORDS="random variate generation",
}

@ARTICLE{Geor7903:Numerical,
AUTHOR="Nicolaos D. Georganas and P. Eng",
TITLE="Numerical solution of queueing networks with multiple semiclosed
chains",
JOURNAL=piee,
VOLUME=126,
NUMBER=3,
PAGES="229-231",
YEAR=1979,
}

@INPROCEEDINGS{Herz79:Modeling,
AUTHOR="U. Herzog and W. Hoffmann and W. Kleinöder",
TITLE="Performance modeling and evaluation for hierarchically organized
multiprocessor computer systems",
BOOKTITLE="International Conference on Parallel Processing",
ADDRESS="Bellaire",
PAGES="103-114",
YEAR=1979,
}

@ARTICLE{Hlaw79:Zentrale,
AUTHOR="F. Hlawa and A. Stoll",
TITLE="Der Zentrale Zeichenkanal nach dem {CCITT-System} Nr.7.",
JOURNAL=siemenstr,
VOLUME=2,
NUMBER=6,
PAGES="394-401",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{John79:Computer,
AUTHOR="M. E. Johnson",
TITLE="Computer generation of the exponential power distribution",
JOURNAL="Journal of Statistical Computation and Simulation",
VOLUME=9,
PAGES="239-240",
YEAR=1979,
KEYWORDS="random variate generation",
}

@INCOLLECTION{Koba79:Computational,
AUTHOR="H. Kobayashi",
TITLE="A computational algorithm for queue distributions via the Polya
theory of enumeration",
BOOKTITLE="Performance of Computer Systems",
EDITOR="M. Arato and A. V. Butrimenko",
PUBLISHER="North-Holland, Amsterdam",
PAGES="79-88",
YEAR=1979,
KEYWORDS="Queueing network; product form; analysis",
}

@ARTICLE{Kull79:Statistische,
AUTHOR="H. Küllmer",
TITLE="Die statistische Schätzung und das Prüfen von Annahmen",
JOURNAL="Unterrichtsblätter der Deutschen Bundespost",
VOLUME=32,
NUMBER=12,
PAGES="459-468",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Simulation; statistical technique; confidence interval",
}

@TECHREPORT{Lave79:Stationary,
AUTHOR="S. S. Lavenberg and M. Reiser",
TITLE="Stationary State Probabilities at Arrival Instants for Closed
Queueing Networks with Multiple Types of Customers",
INSTITUTION="IBM Research Report RC-7592, Yorktown Heights, New York,
Apr",
ADDRESS="Yorktown Heights",
PAGES="1-18",
YEAR=1979,
KEYWORDS="Queueing network; product form",
}

@ARTICLE{Lewi79:Simulation,
AUTHOR="Pierre Lewis and G. S. Shedler",
TITLE="Simulation of nonhomogeneous Poisson processes with degree-two
exponential polynomial rate function",
JOURNAL=or,
VOLUME=27,
NUMBER=5,
PAGES="1026-1040",
YEAR=1979,
KEYWORDS="random variate generation",
}

@ARTICLE{Lux79:Another,
AUTHOR="I. Lux",
TITLE="Another special method to sample probability density functions",
JOURNAL=comp,
VOLUME=21,
NUMBER=4,
PAGES="359-364",
YEAR=1979,
KEYWORDS="random variate generation",
}

@INCOLLECTION{McCo79:Comparison,
AUTHOR="W. M. McCormack and R. G. Sargent",
TITLE="Comparison of future event set algorithms for simulations of
closed queueing systems",
BOOKTITLE="Current Issues in Computer Simulation",
EDITOR="N. R. Adam and A. Dogramaci",
PUBLISHER="Academic Press",
PAGES="71-82",
YEAR=1979,
KEYWORDS="Simulation; event set",
}

@TECHREPORT{Mear79:Simple,
AUTHOR="C. E. Mear and C. H. Sauer",
TITLE="A Simple and Robust Data Structure for the Simulation Event Set",
INSTITUTION="IBM Research Report RC-8001, Yorktown Heights, New York,
Dec.",
ADDRESS="Yorktown Heights",
PAGES="1-10",
YEAR=1979,
KEYWORDS="Simulation; event set",
}

@ARTICLE{Mona79:Extensions,
AUTHOR="J. F. Monahan",
TITLE="Extensions of von Neumann's method for generating random
variables",
JOURNAL=moc,
VOLUME=33,
NUMBER=147,
PAGES="1065-1069",
YEAR=1979,
KEYWORDS="random variate generation",
}

@ARTICLE{Pull79:Generation,
AUTHOR="D. I. Pullin",
TITLE="Generation of normal variates with given sample mean and
variance.",
JOURNAL="Journal of Statistical Computation and Simulation",
VOLUME=9,
PAGES="303-309",
YEAR=1979,
KEYWORDS="random variate generation",
}

@ARTICLE{Rapp79:Calculation,
AUTHOR="S. S. Rappaport",
TITLE="Calculation of some functions arising in problems of queueing and
communications traffic",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=1,
PAGES="249-251",
YEAR=1979,
KEYWORDS="Queueing theory; numerical evaluation",
}

@INCOLLECTION{Reis79:Mean,
AUTHOR="M. Reiser",
TITLE="Mean value analysis of queuing networks, a new look at an old
problem",
BOOKTITLE="Performance of Computer Systems",
EDITOR="M. Arato and A. V. Butrimenko and E. Gelenbe",
PUBLISHER="North-Holland",
PAGES="63-77",
YEAR=1979,
KEYWORDS="Queueing network; product form; analysis",
}

@ARTICLE{Saha79:Supplement,
AUTHOR="H. Sahai",
TITLE="A supplement to Sowey's bibliography on random number generation
and related topics",
JOURNAL="Journal of Statistical Computation and Simulation",
VOLUME=10,
NUMBER=1,
PAGES="31-52",
YEAR=1979,
KEYWORDS="random number generation; random variate generation;
bibliography",
}

@INCOLLECTION{Stew79:Direct,
AUTHOR="W. J. Stewart",
TITLE="A direct numerical method for queueing networks",
BOOKTITLE="Performance of Computer Systems",
EDITOR="M. Arato and A. V. Butrimenko and E. Gelenbe",
PUBLISHER="North-Holland, Amsterdam",
PAGES="89-102",
YEAR=1979,
KEYWORDS="Queueing network; analysis",
}

@ARTICLE{Tadi79:Random,
AUTHOR="P. R. Tadikamalla",
TITLE="Random sampling from the generalized gamma distribution",
JOURNAL=comp,
VOLUME=23,
PAGES="199-203",
YEAR=1979,
KEYWORDS="random number generation",
}

@ARTICLE{Brya79:Simulation,
AUTHOR="R. M. Bryant",
TITLE="Simulation on a Distributed System",
JOURNAL=ieeeproc,
PAGES="544-552",
YEAR=1979,
REFERENCES=12,
KEYWORDS="Distributed simulation",
ANNOTE="In this paper a simulation method is developed in which the
processes simulate the interactions of the system elements by sending
stimulus messages to one another and coordinate their activities with
decentralized control into the process programs. The control does not
place any real-time speed constraints on the computation or
communication and does not require any further communication links
between processes.",
}

@ARTICLE{Buck79:Distributed,
AUTHOR="B. P. Buckles and H. D. Fitzgibbon",
TITLE="Distributed Emulation Control: An Algorithm with {ESP}",
JOURNAL=ieeeproc,
PAGES="536-543",
YEAR=1979,
REFERENCES=5,
KEYWORDS="Distributed simulation",
ANNOTE="This paper describes an algorithm in which the emulation
executive is decentralized and equally apportioned among the emulator
processors in a manner not allowing any one processor knowledge of the
total state. The basic assumptions of the algorithm are the emulator
interprocessor communication structure is statistically comparable to
the emulated system communication structure and if a processor is
synchronized, then the entire sim. is sync.",
}

@TECHREPORT{Kreu79:Einige,
AUTHOR="R. Kreutzer",
TITLE="Einige Verfahren zur Berechnung des Anschlußnetzes in
Nachrichtensystemen mit zentraler Vermittlung",
ISBN="0342-6815",
INSTITUTION="Technischer Bericht Heinrich-Hertz-Institut",
VOLUME=209,
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Network planning; access network",
}

@INPROCEEDINGS{Sang79:Technique,
AUTHOR="J. Sanguinetti",
TITLE="A technique for integrating simulation and system design",
BOOKTITLE="conference on simulation, measurement and modeling of
computer systems",
PAGES="163-172",
YEAR=1979,
REFERENCES=7,
KEYWORDS="Simulation; system design",
ANNOTE="A technique for simulating incomplete systems is given which
allows performance prediction during system design. This technique,
called integrated simulation, allows the system design to itself be a
simulation model, thus avoiding the overhead of maintaining a separate,
valid simulation model for the system. The paper presents integrated
simulation in the framework of a system modeling language called the
Program Process Modeling Language, PPML",
}

@UNPUBLISHED{Labo79:Transport,
AUTHOR="University of Cambridge Computer Laboratory",
TITLE="A Transport Service",
NOTE="prepared by the Post Office Packet Switching Study Group 3",
YEAR=1979,
}

@ARTICLE{Corr79:SNA,
AUTHOR="F. P. Corr and D. H. Neal",
TITLE="{SNA} and emerging international standards",
JOURNAL=ibmsj,
VOLUME=18,
PAGES="244-262",
YEAR=1979,
}

@ARTICLE{Donn79:Components,
AUTHOR="J. E. Donnelley",
TITLE="Components of a network operating system",
JOURNAL=cn,
VOLUME=3,
PAGES="389-399",
YEAR=1979,
}

@INPROCEEDINGS{Fran79:Architectural,
AUTHOR="A. Frank and P. C. Patton",
TITLE="Some Architectural and System Implications of Local Computer
Networks",
BOOKTITLE=compcon,
PAGES="272-276",
NOTE="also in \cite{Thur81:Tutorial}",
MONTH="Spring",
YEAR=1979,
}

@ARTICLE{Gien79:Principles,
AUTHOR="M. Gien and H. Zimmermann",
TITLE="Design principles for network interconnection",
JOURNAL=ieeeproc,
PAGES="109-119",
YEAR=1979,
}

@ARTICLE{Gray79:SNA,
AUTHOR="J. P. Gray and T. B. McNeill",
TITLE="{SNA} multiple-system networking",
JOURNAL=ibmsj,
VOLUME=18,
PAGES="263-297",
YEAR=1979,
}

@ARTICLE{Hals79:Public,
AUTHOR="J. R. Halsey and L. E. Hardy and L. F. Powning",
TITLE="Public data networks: their evolution, interfaces and status",
JOURNAL=ibmsj,
VOLUME=18,
PAGES="222-243",
YEAR=1979,
}

@INPROCEEDINGS{Kuhn79:Serial,
AUTHOR="R. C. Kuhns and M. C. Shoquist",
TITLE="A Serial Data Bus System for Local Processing Networks",
BOOKTITLE=compcon,
PAGES="266-271",
NOTE="also in \cite{Thur81:Tutorial}",
MONTH="Spring",
YEAR=1979,
}

@ARTICLE{Mats79:Virtual,
AUTHOR="Y. Matsuhita and H. Yamazaki and Isamu Yoshida",
TITLE="An evaluation of virtual circuits and lettergram services",
JOURNAL=cn,
VOLUME=3,
PAGES="287-294",
YEAR=1979,
}

@ARTICLE{McCr79:Current,
AUTHOR="W. A. McCrum",
TITLE="Current {CCITT} data standards for interlinking",
JOURNAL=cn,
PAGES="95-110",
YEAR=1979,
}

@ARTICLE{Pohm79:Local,
AUTHOR="A. V. Pohm and  others",
TITLE="A local network of mini and microcomputers for experiment
support",
JOURNAL=cn,
VOLUME=3,
PAGES="381-387",
NOTE="also in Proc. 4th Conference on Local Computer Networks, (1979),
91-96; \cite{Thur81:Tutorial}",
YEAR=1979,
}

@INPROCEEDINGS{Alme79:Behaviour,
AUTHOR="G. T. Almes and E. D. Lazowska",
TITLE="The Behaviour of Ethernet-like Computer Communications Networks",
BOOKTITLE="7th Symposium on Operating System Principles",
PAGES="66-81",
YEAR=1979,
}

@ARTICLE{Chen79:Segmentation,
AUTHOR="Pi-Chun Chen and T. Pavlidis",
TITLE="Segmentation by texture using a co-occurance matrix and a
split-and-merge algorithm",
JOURNAL="CGIP",
VOLUME=10,
PAGES="172-182",
YEAR=1979,
ABSTRACT="The co-occurance matrix is used for segmentation according to
texture. See same authors 1983. Gives a variety of texture measures.",
}

@INPROCEEDINGS{Cole79:Image,
AUTHOR="G. B. Coleman and H. C. Andrews",
TITLE="Image segmentation by clustering",
BOOKTITLE=ieeeproc,
VOLUME=67,
PAGES="773-785",
YEAR=1979,
}

@INCOLLECTION{Duda79:Model,
AUTHOR="R. O. Duda and J. Gaschnig and P. E. Hart",
TITLE="Model design in the Prospector consultant system for mineral
exploration",
BOOKTITLE="Expert systems in the microelectronic age",
EDITOR="D. Michie",
PUBLISHER="Edinburgh Univ Press",
PAGES="153-167",
YEAR=1979,
}

@ARTICLE{Eklu79:Use,
AUTHOR="J. O. Eklundh",
TITLE="On the use of Fourier Phase Features for Texture Discrimination",
JOURNAL="CGIP",
VOLUME=9,
PAGES="199-201",
YEAR=1979,
ABSTRACT="Fourier features based on phase rather than amplitude do not
seem to be useful for texture classification",
}

@INCOLLECTION{Habe79:Classification,
AUTHOR="P. Haberacker",
TITLE="On the classification of multitemporal image data",
BOOKTITLE="Machine-aided image analysis",
EDITOR="W. E. Gardner",
PUBLISHER="The Institute of Physics",
PAGES="231-237",
YEAR=1979,
}

@INCOLLECTION{Kuma79:Comparison,
AUTHOR="R. Krishna Kumar",
TITLE="Comparison of feature selection techniques for earth resources
data",
BOOKTITLE="Machine-aided image analysis",
EDITOR="W. E. Gardner",
PUBLISHER="The Institute of Physics",
PAGES="238-243",
YEAR=1979,
}

@ARTICLE{Maso7906:Segmentation,
AUTHOR="D. C. Mason",
TITLE="Segmentation of terrain using textural and spectral
characteristics",
JOURNAL="Computers and Digital Techniques",
VOLUME=2,
NUMBER=6,
PAGES="251-259",
YEAR=1979,
}

@ARTICLE{Naga79:Region,
AUTHOR="M. Nagao and T. Matsuyama and Y. Ikeda",
TITLE="Region extraction and shape analysis in aerial photography",
JOURNAL="CGIP",
VOLUME=10,
PAGES="195-223",
YEAR=1979,
ABSTRACT="An initial segmentation first loosely catagorises into 1)
large homogeneous regions 2) elongated regions 3) large vegetation
regions 4) high contrast regions. Each of these groups is then analysed
in greater detail by knowledge base (and ad hoc) modules tailored for
each type. The results are fed back to help correct miss
segmentations.",
}

@ARTICLE{Naga79:Edge,
AUTHOR="M. Nagao and T. Matsuyama",
TITLE="Edge preserving smoothing",
JOURNAL="CGIP",
VOLUME=19,
PAGES="394-407",
YEAR=1979,
ABSTRACT="Noise can be removed but without blurring edges. NMethod is by
rotating a rectangle in a 5x5 window, to find the most homogeneous area.
The central point is then assigend to the average value of this area.",
}

@INCOLLECTION{Quin79:Discovering,
AUTHOR="J. R. Quinlan",
TITLE="Discovering rules by induction from large collections of
examples",
BOOKTITLE="Expert Systems in the microelectronics Age",
EDITOR="E. Michie",
PUBLISHER="Edinburgh Univ. Press",
YEAR=1979,
}

@ARTICLE{Yama79:Method,
AUTHOR="H. Yamamoto",
TITLE="A method for deriving compatibility coefficients for relaxation
operators",
JOURNAL="CGIP",
VOLUME=10,
PAGES="256-271",
YEAR=1979,
ABSTRACT="A simplified method of deriving compatibility coefficients for
the rekaxation labelling operator is presented. Several methods of
generating these coefficients have been reported; the choice of
coefficients may have significant effects in applications problems. In
this paper, these methods are discussed briefly, and a more effective
method from a viewpoint of both simplicity and accuracy is derived,
based on information-theoretic concepts. Finally, the effectiveness of
this method is demonstrated in a set of numerical experiments.",
}

@MASTERSTHESIS{Seet79:Study,
AUTHOR="M. Seethalakshmi",
TITLE="A study and analysis of performance of distributed simulation",
SCHOOL="Computer Science Dept. University of Texas at Austin",
ADDRESS="Austin, TX",
YEAR=1979,
}

@ARTICLE{Knig7905:Erfahrungen,
AUTHOR="D. König and R. Fröning",
TITLE="Erfahrungen mit rechnergest tzter Dokumentation",
JOURNAL=er,
ADDRESS="Germany",
VOLUME=21,
NUMBER=5,
PAGES="234-240",
YEAR=1979,
LANGUAGE="German",
REFERENCES=2,
KEYWORDS="Documentation; classification; retrieval system",
}

@ARTICLE{Lam79:Congestion,
AUTHOR="S. S. Lam and M. Reiser",
TITLE="Congestion control of store-and-forward networks by input buffer
limits - an analysis",
JOURNAL=ieeecom,
VOLUME="COM-27",
PAGES="127-134",
YEAR=1979,
REFERENCES=19,
KEYWORDS="Store-and-forward; network flow; M/M/N; channel capacity;
buffer length; congestion control",
ABSTRACT="The use of input buffer limits for congestion control of
store-and-forward networks is investigated. An analytic model is
formulated. Based upon the analytic results, strategies are proposed for
the design of input buffer limits to achieve the maximum network
throughput as well as to provide a safety margin for uncertainties in
the traffic assumptions. A useful capacity law is discovered. ...",
}

@INPROCEEDINGS{Addi79:General,
AUTHOR="R. G. Addie and G. Codsi and P. Gerrand and M. Rubinstein",
TITLE="A General Exchange Simulator for Capacity Studies",
BOOKTITLE=itc9,
ADDRESS="Torremolinos, Spain",
PAGES="521 R",
YEAR=1979,
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Akim79:Derivatives,
AUTHOR="H. Akimaru and T. Tokushima and T. Nishimura",
TITLE="Derivatives of Wilkinson Formula and their Application to Optimum
Design of Alternative Routing Systems",
BOOKTITLE=itc9,
ADDRESS="Torremolinos, Spain",
VOLUME="Sess. 24",
PAGES="241 N",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Ashe79:ISTC,
AUTHOR="A. Asher",
TITLE="{ISTC:} Integrated System for Traffic Measurements and Control",
BOOKTITLE=itc9,
ADDRESS="Torremolinos, Spain",
PAGES="211 N (21)",
YEAR=1979,
KEYWORDS="Data traffic; computer network",
}

@INPROCEEDINGS{Aura79:Effects,
AUTHOR="R. R. Auray",
TITLE="Some Effects of {U.S.} Interstate Message Tariff Changes on
Traffic Levels and Distributions",
BOOKTITLE=itc9,
ADDRESS="Spain",
VOLUME="Sess.32",
PAGES="320 I",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Barn79:Observations,
AUTHOR="D. H. Barnes",
TITLE="Observations of Extreme Value Statistics in small Switching
Offices",
BOOKTITLE=itc9,
ADDRESS="Spain",
PAGES="311 N",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Basu79:Optimizing,
AUTHOR="K. K. Basu",
TITLE="Optimizing Telephone Network with Alternate Routes: An Integer
Programming Solution",
BOOKTITLE=itc9,
ADDRESS="Torremolinos, Spain",
PAGES="621 R (62)",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Bean79:Dynamic,
AUTHOR="A. Bean and E. Szbicki",
TITLE="Dynamic Routing of Calls in the Local Telephone Network;
Performance of different Routing Algorithms",
BOOKTITLE=itc9,
ADDRESS="Spain",
VOLUME="Sess.61",
PAGES="612 R",
YEAR=1979,
KEYWORDS="Circuit switching; routing",
}

@INPROCEEDINGS{Bear79:Traffic,
AUTHOR="D. B. Bear",
TITLE="Traffic Aspects of Overall Control of a {PCM} Network",
BOOKTITLE="6th international teletraffic congress",
ADDRESS="München, Germany",
YEAR=1979,
KEYWORDS="Link system",
}

@ARTICLE{Berm7904:Verkehrsuntersuchung,
AUTHOR="L. Bermejo Saez and C. D. Berzosa and H. Garcia and G.
Gutierrez",
TITLE="Verkehrsuntersuchung der Steuerung des Systems Pentaconta 2000",
JOURNAL="Elektrisches Nachrichtenwesen",
ADDRESS="Germany",
VOLUME=54,
NUMBER=4,
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Link system",
}

@INPROCEEDINGS{Berr79:Telephone,
AUTHOR="L. T. M. Berry",
TITLE="A Telephone Network Performance Model",
BOOKTITLE=itc9,
ADDRESS="Spain",
VOLUME="Ses.24",
PAGES="242 N",
YEAR=1979,
KEYWORDS="Overload control; flow control; communication network",
}

@INPROCEEDINGS{Bezd79:Traffic,
AUTHOR="P. V. Bezdek",
TITLE="Traffic Routing and Trunk Forecasting with a Computer-Based
System",
BOOKTITLE=itc9,
ADDRESS="Spain",
VOLUME="Sess.12",
PAGES="121 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Biot79:Observationand,
AUTHOR="J. Biot and J. Massant",
TITLE="On the Observationand Augmentation of Subscriber Lines with High
Probability of Being Busy",
BOOKTITLE=itc9,
ADDRESS="Spain",
VOLUME="Sess.14",
PAGES="141 N",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Blai79:New,
AUTHOR="N. D. Blair and W. S. Hayward",
TITLE="New Methods for Administrative Area and Local Entity Usage
Forecasting",
BOOKTITLE=itc9,
ADDRESS="Spain",
VOLUME="Sess.11",
PAGES="111 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Boda79:Observations,
AUTHOR="H. Bodard and J. P. Guerineau",
TITLE="Observations of the Quality of Service of International Traffic
byMeans of a Minicomputer",
BOOKTITLE=itc9,
ADDRESS="Torremolinos, Spain",
VOLUME="Sess.22",
PAGES="221 N",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Bhm79:Causal,
AUTHOR="E. Böhm and W. Wacker and P. Thornton",
TITLE="Causal Models for Forecasting Telephone Services by Market
Sectors",
BOOKTITLE=itc9,
ADDRESS="Torremolinos, Spain",
VOLUME="Sess.11",
PAGES="112 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Bost79:Statistical,
AUTHOR="P. Bostica and M. Butto and A. Tonietti",
TITLE="Statistical Methods for Detecting Overloads in a Trunk Group",
BOOKTITLE=itc9,
ADDRESS="Torremolinos, Spain",
VOLUME="Sess.53",
PAGES="531 N",
YEAR=1979,
KEYWORDS="Measurement",
}

@INPROCEEDINGS{Brav79:Inter,
AUTHOR="V. Bravo and M. Gomez",
TITLE="Inter-Toll Traffic Versus Tariffs Evolution",
BOOKTITLE=itc9,
ADDRESS="Torremolinos, Spain",
VOLUME="Sess.32",
PAGES="321 R",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Brea79:Self,
AUTHOR="D. Breary",
TITLE="A Self-Optimising Network Model for the long Term Planning of the
{UK} Trunk Telecommunications Network",
BOOKTITLE="6th international teletraffic congress",
ADDRESS="München, Germany",
YEAR=1979,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Bret79:Repeated,
AUTHOR="G. Bretschneider",
TITLE="Repeated Calls with Limited Repetition Probability",
BOOKTITLE="6th international teletraffic congress",
ADDRESS="München, Germany",
YEAR=1979,
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Bric79:Comparison,
AUTHOR="A. Briccoli",
TITLE="Comparison of Regulation Methods for Traffic Overloads in {SPC}
System",
BOOKTITLE=itc9,
ADDRESS="Torremolinos, Spain",
VOLUME="Sess.53",
PAGES="532 R",
YEAR=1979,
KEYWORDS="Gos",
}

@ARTICLE{Kllm7912:Statistische,
AUTHOR="H. K llmer",
TITLE="Die statistische Schätzung und das Pr fen von Annahmen",
JOURNAL="Unterrichtsblätter der Deutschen Bundespost, AusgabeB
Fernmeldewesen",
ADDRESS="Germany",
VOLUME=32,
NUMBER=12,
PAGES="459-468",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Simulation; statistical technique; confidence interval",
}

@ARTICLE{Albr79:Subscriber,
AUTHOR="T. Albrectsen",
TITLE="Subscriber habits - Equipment for Data Collection. Abonnentadfærd
- Udstyr for dataopsamling",
JOURNAL="Teleteknik",
NUMBER=2,
PAGES="72-80",
YEAR=1979,
KEYWORDS="traffic measurement",
ABSTRACT="Ordrup measurements",
}

@ARTICLE{Ande7902:Queueing,
AUTHOR="R. R. Anderson and G. J. Foschini and B. Gopinath",
TITLE="A Queueing Model for a Hybrid Data Multiplexer",
JOURNAL=bstj,
VOLUME=58,
NUMBER=2,
PAGES="279-300",
YEAR=1979,
KEYWORDS="Queueing theory; model; modeling; hybrid system; multiplexer",
}

@ARTICLE{Arnd79:Continuity,
AUTHOR="U. Arndt and P. Franken",
TITLE="Continuity of Generalized Regenerating Processes",
JOURNAL=ec,
YEAR=1979,
KEYWORDS="Renewal process",
}

@INCOLLECTION{Arth79:Sizing,
AUTHOR="E. Arthurs and J. S. Kaufman",
TITLE="Sizing a message Store Subject to Blocking Criteria",
BOOKTITLE="Performance of Computer Systems",
EDITOR="M. Arato and A. V. Butrimenko and E. Gelenbe",
PUBLISHER="North-Holland",
PAGES="547-564",
YEAR=1979,
KEYWORDS="multiserver",
ABSTRACT="A common theme in computer applications is that of a number of
users contending for a shared resource. One example of a shared resource
is storage (primary or secondary), which often must be shared by a large
number of messages having varying size and residency requirements. In
this paper we analyze the blocking that mesaages with different storage
requirements incur, in contending for a common message store. Examples
are",
}

@ARTICLE{Bara79:Adaptive,
AUTHOR="Y. M. Baranov",
TITLE="Adaptive Control of Message Flow Distribution in Communication
Networks",
JOURNAL=ec,
YEAR=1979,
KEYWORDS="Communication network; control; method; message traffic;
message passing",
}

@ARTICLE{Bash79:Method,
AUTHOR="G. P. Basharin and V. A. Kokotushkin and V. A. Naumov",
TITLE="The Method of Equivalent Susbstitutions for Calculating Fragments
of Communication Networks for a Digital Computer. Part I",
JOURNAL=ec,
ADDRESS="SU",
VOLUME=6,
PAGES="66-73",
YEAR=1979,
KEYWORDS="Calculation; mathematical method; equivalence; communication
network; computer",
}

@TECHREPORT{Beck79:Systems,
AUTHOR="P. Becker",
TITLE="On Systems with Redundancy and Their Inherent Bounds on
Achievable Reliability",
INSTITUTION="Technical University of Denmark",
ADDRESS="Lyngby, Denmark",
PAGES=8,
YEAR=1979,
KEYWORDS="Reliability; system effectiveness",
}

@ARTICLE{Bely79:Statistical,
AUTHOR="Y. K. Belyayev and A. G. Gadzhiyev",
TITLE="Statistical Analysis of Simulation Results",
JOURNAL=ec,
YEAR=1979,
KEYWORDS="Analysis; simulation; statistics",
}

@ARTICLE{Bieb79:Optimal,
AUTHOR="G. Bieber",
TITLE="On Optimal Control of Markov Processes with applications to a
class of Service Systems",
JOURNAL="Math. Operationsforsch. Statist., Ser. Optimization",
VOLUME=10,
NUMBER=1,
PAGES="143-162",
YEAR=1979,
KEYWORDS="Markov process; optimal control; reward model; reward system",
ABSTRACT="A finite time control problem for markov processes with
arbitrary state and action space is studied. The value of a given
strategy is defined by the expected total reward up to a given point of
time where the rewards are defined on the one hand by a reward rate and
on the other hand by a valuation of the jumps of the controlled process.
A necessary and sufficient condition for the existence of an optimal
strategy is given",
}

@INCOLLECTION{Catt79:Graph,
AUTHOR="K. W. Cattermole",
TITLE="Graph Theory and Communcations Networks",
BOOKTITLE="Applications of Graph Theory",
EDITOR="R. J. Wilson and L. W. Beineke",
PUBLISHER="Academic Press",
PAGES="17-58",
YEAR=1979,
KEYWORDS="graph theory; communication network",
}

@ARTICLE{Choo79:New,
AUTHOR="Q. H. Choo and B. W. Conolly",
TITLE="New Results in the Theory of Repeated Orders Queueing Systems",
JOURNAL=jap,
VOLUME=16,
PAGES="631-640",
YEAR=1979,
KEYWORDS="Call Reattempt; Queueing System",
}

@ARTICLE{Cies79:Simulation,
AUTHOR="T. J. Cieslak and P. J. Hickson",
TITLE="Analysis and Simulation of No. 4 {ESS} Network Performance",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=1,
PAGES="1-9",
YEAR=1979,
KEYWORDS="Performance Evaluation; Switching System",
}

@ARTICLE{Dahl79:Kapacitetsplanlægning,
AUTHOR="P. Dahlgaard",
TITLE="Kapacitetsplanlægning for Maskinel i Store Datacentraler",
JOURNAL="DATA",
ADDRESS="Denmark",
PAGES="13-16",
YEAR=1979,
LANGUAGE="Danish",
KEYWORDS="Data Switching; Switching System; Capacity Planning",
}

@ARTICLE{Desc79:Analytic,
AUTHOR="P. J. Deschamps",
TITLE="Analytic Approximation of Blocking Probabilities in circuit
Switched Communication Networks",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=3,
PAGES="603-606",
YEAR=1979,
KEYWORDS="Analytical Model; Approximation; Blocking; Circuit Switching;
Traffic Theory",
ABSTRACT="A method inspired from S. Katz's service evaluation algorithm
is presented. The new algorithm is recursive, rather than iterative, in
nature, and especially suited for networks that do not contain cycles.
It also introduces two new features which takes existing theroretical
results into account, and as such corresponds more closely to the
current state of traffic theory.",
}

@ARTICLE{Dimi79:Single,
AUTHOR="M. T. Dimitrov",
TITLE="Single Line System of Mass Service with Group Service in
Processor Time-sharing Mode",
JOURNAL=ec,
ADDRESS="SU",
PAGES="89-92",
YEAR=1979,
KEYWORDS="Service Discipline; Processor Sharing",
}

@INPROCEEDINGS{Dor79:Blocking,
AUTHOR="M. Dor",
TITLE="The Blocking Probability of the M/M/s(s) Queue with
Time-Dependent Arrival Rate",
BOOKTITLE="Studies in Queueing Systems with Multiplicity and Their
Applications",
PAGES="121-126",
YEAR=1979,
KEYWORDS="M/M/N; Blocking; Probability; Time Dependent Queueing System;
Arrival Time Dependent",
}

@ARTICLE{Fali79:Single,
AUTHOR="G. I. Falin",
TITLE="A single-Line System with Secondary Orders",
JOURNAL=ec,
ADDRESS="SU",
VOLUME=17,
NUMBER=2,
PAGES="76-83",
YEAR=1979,
KEYWORDS="Queueing System; Single Server",
}

@ARTICLE{Fali79:Effect,
AUTHOR="G. I. Falin",
TITLE="Effect of the Recurrent Calls on Output Flow of a Single Channel
System of Mass Service",
JOURNAL=ec,
ADDRESS="SU",
PAGES="99-103",
YEAR=1979,
KEYWORDS="Output Process; Queueing System; Single Server",
}

@ARTICLE{Fayn79:Estimates,
AUTHOR="M. A. Faynberg",
TITLE="Estimates of the Waiting time in single-Channel Queueing
Systems",
JOURNAL=ec,
ADDRESS="SU",
VOLUME=2,
PAGES="144-146",
YEAR=1979,
KEYWORDS="Delay Model; Analysis; Waiting Time; Single Server;
approximation",
}

@ARTICLE{Fluh79:Advanced,
AUTHOR="Z. C. Fluhr and P. T. Porter",
TITLE="Advanced Mobile Phone Service: Control Architecture",
JOURNAL=bstj,
VOLUME=58,
NUMBER=1,
PAGES="43-69",
YEAR=1979,
KEYWORDS="cellular system; mobile radio",
}

@ARTICLE{Fred7903:Approximations,
AUTHOR="A. Fredericks and G. A. Reisner",
TITLE="Approximations to Stochastic Service Systems, with Application to
a Retrial Model",
JOURNAL=bstj,
VOLUME=58,
NUMBER=3,
PAGES="557-576",
YEAR=1979,
KEYWORDS="Queueing system; stochastic system; modeling",
}

@INPROCEEDINGS{Fuji79:Inter,
AUTHOR="T. Fujisawa and T. Osone",
TITLE="Inter-Arrival Time Distributions of Accepted Customers in Some
Queueing Systems with Finite Capacity",
BOOKTITLE="Studies in Queueing Systems with Multiplicity and Their
Applications",
YEAR=1979,
KEYWORDS="Delay Loss Model; Arrival Process; Distribution; Throughput
Performance",
}

@ARTICLE{Geil79:Nyt,
AUTHOR="S. Geil and D. Sörensson",
TITLE="Nyt Trafikcirkulære",
JOURNAL="Teleteknik",
ADDRESS="Sweden",
VOLUME=1,
PAGES="54-60 (paper 3)",
YEAR=1979,
LANGUAGE="Swedish",
KEYWORDS="Traffic engineering",
ABSTRACT="Cirkulære 21",
}

@ARTICLE{Gosz79:Grade,
AUTHOR="G. Gosztony and K. Rahko and R. J. Chapuis",
TITLE="The Grade of Service in the World-Wide Telephone Network",
JOURNAL="Telecommunication Journal",
VOLUME=46,
NUMBER=9,
PAGES="556-565",
YEAR=1979,
KEYWORDS="Gos",
}

@ARTICLE{Grom79:Two,
AUTHOR="A. I. Gromov",
TITLE="A Two-Phase Queueing system with Limited Intermediate Accumulator
and Hyper-Erlang Servicing of a Special Kind",
JOURNAL=ec,
ADDRESS="SU",
VOLUME=1,
PAGES="59-66",
YEAR=1979,
KEYWORDS="Queueing System; Two-Stage Discipline",
}

@TECHREPORT{Guzm79:Queueing,
AUTHOR="M. E. Guzman",
TITLE="A Queueing Model for Buffer Behavior Analysis",
INSTITUTION="Department of Telecommunication Networks and Systems, The
Royal Institute of Technology",
ADDRESS="Stockholm",
PAGES=41,
YEAR=1979,
KEYWORDS="buffer length; overflow; probability; finite buffer; batch
arrival; ATM",
}

@ARTICLE{Haug7909:Link,
AUTHOR="R. B. Haugen",
TITLE="Link Systems with Delay",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=9,
PAGES="1261-1270",
YEAR=1979,
KEYWORDS="Queueing System; Delay Model; Waiting Time; Overview; QOS;
Delay Distribution",
ABSTRACT="This paper discusses two classical methods of calculating
grade of service parameters for link systems, i.e. the methods of
Jacobaeus and Lotze. The possibility of extending these theories to
cover delay systems and in particular to calculate the waiting time
distribution is looked into. Numerical results from the theories are
compared with simulations results. Throughout this paper, pure Poisson
arrivals and negative exp",
}

@INCOLLECTION{Henn79:Decentralised,
AUTHOR="J. C. Hennet and A. Titli",
TITLE="Decentralised Control of Telecommunications Networks",
BOOKTITLE="Large Scale Systems Engineering Applications",
EDITOR="M. Singh and A. Titli",
PUBLISHER="North Holland",
PAGES="353-371",
YEAR=1979,
KEYWORDS="Communication Network; Network Control System; Decentralized
Control",
}

@PHDTHESIS{Hert79:Teoretisk,
AUTHOR="S. Hertzberg",
TITLE="Teoretisk Jämförelse av {ERT-} {EERT-,} Topptrafik- och
{NDM-Metoderna} för Dimensionering av Telefontrafikleder",
TYPE="Doktorafhandling",
SCHOOL="Helsinki University of Technology, Telecommunication
Laboratory",
ADDRESS="Helsinki, Finland",
NUMBER="13/79",
PAGES=9,
YEAR=1979,
LANGUAGE="Swedish",
KEYWORDS="Network planning; routing; overflow traffic",
}

@ARTICLE{Hill79:Revision,
AUTHOR="J. S. Hill",
TITLE="Revision of the Buffer Length Derivation for a Modified Ek/D/1
Systems by Maritsas and Hartley",
JOURNAL=ieeetc,
VOLUME="C-28",
NUMBER=3,
PAGES="269-273",
YEAR=1979,
KEYWORDS="buffer length; queue length; constant service time; Erlang
input constant removal rate; fractional loss; queue length
distribution",
ABSTRACT="The problem of loss of items arriving at a queue of limited
length is relevant to the design of computers with real-time inputs and
of similar equipments where only a limited input buffer size is
possible.  The length of buffer required to reduce overflow loss to an
acceptable low level is an important design parameter.",
}

@ARTICLE{Hopm79:Importance,
AUTHOR="A. C. M. Hopmans and J. P. Kleijnen",
TITLE="Importance Sampling in Systems simulation: A Practical Failure",
JOURNAL="Mathematics and Computers in Simulation",
VOLUME=21,
PAGES="209-220",
YEAR=1979,
KEYWORDS="variance reduction",
}

@ARTICLE{Jans7903:Criterion,
AUTHOR="U. Jansen and D. König and K. Nawrotzki",
TITLE="A Criterion of Insensitivity for a Class of Queueing Systems with
Random Marked Point Processes",
JOURNAL="Math. Operationsforsch. Statist., Ser. Optimization",
VOLUME=10,
NUMBER=3,
PAGES="379-403",
YEAR=1979,
KEYWORDS="Queueing system",
ABSTRACT="Insensitivity",
}

@ARTICLE{Kauf7901:Busy,
AUTHOR="J. S. Kaufman",
TITLE="The Busy Probability in M/G/n Loss Systems",
JOURNAL=or,
VOLUME=27,
NUMBER=1,
PAGES="204-206",
YEAR=1979,
KEYWORDS="Loss system; M/G/N",
ABSTRACT="If k+1 servers in an equilibrium M/G/n loss system are chosen
randomly without replacement and the first k servers chosen are busy,
the conditional probability that the (k+1)st server chosen is busy is
shown to be equal to the a priori probability that a randomly chosen
server in an equilibrium M/G/(n-k) loss system (with the same offered
load) is busy.",
}

@ARTICLE{Kita79:Single,
AUTHOR="M. Y. Kitayev and S. F. Yashkov",
TITLE="Analysis of a Single-Channel Queueing System with the Discipline
of Uniform Sharing of a Device",
JOURNAL=ec,
YEAR=1979,
KEYWORDS="packet switching; processor sharing",
}

@ARTICLE{Hoso7904:Blocking,
AUTHOR="T. Hosokawa and M. Terazono",
TITLE="Blocking Probability in Link-Frame Systems from the Viewpoint of
Overflow Processes",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=4,
PAGES="649-657",
YEAR=1979,
KEYWORDS="Link system; blocking; overflow",
ABSTRACT="From the development of the work concerning the overflow
processes due to Palm and Takács, we consider the blocking probability
in four-stage type systems which are used for telephone services at
speech-path connecting networks in central systems. First, the events
causing failure in channel matching in the system and the stochastic
properties in the system are considered. After that distribution of
interval-times between",
}

@ARTICLE{Krey79:Estimates,
AUTHOR="A. Y. Kreynin",
TITLE="Estimates of the Mean Waiting Time in a Single-Queue System with
Readjustment",
JOURNAL=ec,
ADDRESS="SU",
VOLUME=3,
PAGES="143-147",
YEAR=1979,
KEYWORDS="Queueing system; waiting time",
}

@ARTICLE{Krey79:Method,
AUTHOR="A. Y. Kreynin",
TITLE="A Method of Obtaining Estimates of the Mean Characteristics of
Queueing Systems",
JOURNAL=ec,
ADDRESS="SU",
VOLUME=5,
PAGES="53-56",
YEAR=1979,
KEYWORDS="Queueing system",
}

@ARTICLE{Lazo79:Selecting,
AUTHOR="E. D. Lazowska and C. A. Addison",
TITLE="Selecting Parameter Values for Servers of the Phase Type",
EDITOR="M. Arato and A. V. Butrimenko and E. Gelenbe",
JOURNAL="Performance of Computer Systems",
PUBLISHER="North-Holland",
PAGES="407-420",
YEAR=1979,
KEYWORDS="Cox distribution; phase-type model; estimation",
}

@ARTICLE{LeGa7909:Le,
AUTHOR="P. Le Gall",
TITLE="Sur le Próbleme du Trafic Téléphonique Général, Direct et Sans
Attente",
JOURNAL=atele,
ADDRESS="France",
VOLUME=34,
NUMBER="9-10",
PAGES="459-468",
YEAR=1979,
LANGUAGE="French",
ABSTRACT="The traffic handling in a fully available telephone group of
circuits is considered, in the case of lost calls model and with general
assumptions for the arrival process and for the holding time
distribution, in stationary and non-stationary conditions. In an earlier
study, the very great complexity of the traffic handling laws was
presented, in the general case. Explicit formulae were given only in the
case of one or two",
}

@ARTICLE{Lero79:Discrete,
AUTHOR="J. Leroudier and M. Parent",
TITLE="Discrete Event Simulation Modelling of Computer Systems for
Performance Evaluation",
JOURNAL="Mathematics and Computers in Simulation",
VOLUME=21,
PAGES="50-79",
YEAR=1979,
KEYWORDS="Simulation",
}

@ARTICLE{Lyak79:Model,
AUTHOR="A. K. Lyakhu and V. F. Matveyev",
TITLE="A Model of Operation of a Computer in a time-Sharing Mode",
JOURNAL=ec,
ADDRESS="SU",
VOLUME=5,
PAGES="45-53",
YEAR=1979,
KEYWORDS="Time sharing",
}

@ARTICLE{MacD79:Advanced,
AUTHOR="V. H. Mac Donald",
TITLE="Advanced Mobile Phone Service: The Cellular Concept",
JOURNAL=bstj,
VOLUME=58,
NUMBER=1,
PAGES="15-41",
YEAR=1979,
KEYWORDS="cellular system; mobile radio",
}

@ARTICLE{Manf7908:One,
AUTHOR="David R. Manfield and T. Downs",
TITLE="On the One-Moment Analysis of Telephone Traffic Networks",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=8,
PAGES="1169-1174",
YEAR=1979,
KEYWORDS="Telephony; analysis",
ABSTRACT="In this paper is a formulation of the one-moment method of
analysis for a telephone traffic network in terms of the link offered
traffics. By using a slightly strengthened version of the assumptions
hitherto used in one-moment analysis, and by developing a type of
limited availability link model, it is shown how the offered traffic to
each link may be found, and thus how the network analysis may be reduced
to a valid set",
}

@ARTICLE{McNi7902:Congestion,
AUTHOR="D. C. McNickle",
TITLE="Congestion in a Simple Overflow Model",
JOURNAL="NZOR",
VOLUME=7,
NUMBER=2,
PAGES="151-157",
YEAR=1979,
KEYWORDS="Overflow",
}

@ARTICLE{Mela79:Poisson,
AUTHOR="B. Melamed",
TITLE="On Poisson Traffic Processes in Discrete State Markovian Systems
with Applications to Queueing Theory",
JOURNAL=aap,
VOLUME=11,
PAGES="218-239",
YEAR=1979,
KEYWORDS="queueing network; decomposition",
ABSTRACT="This paper considers a regular Markov process with continuous
parameter, countable state space, and stationary transition
probabilities, and defines a class of traffic processes over it. The
possibility that multiple traffic processes constitute mutually
independent Poisson processes is investigated. A variety of independence
conditions on a traffic process and the underlying Markov process are
shown to lead to Poisson-re",
}

@ARTICLE{Mura7901:High,
AUTHOR="H. Murata and M. Akiyama",
TITLE="High-Density Traffic Analysis in a Communication Network",
JOURNAL=ecij1,
ADDRESS="Japan",
VOLUME="62-B",
NUMBER=1,
PAGES="62-70",
YEAR=1979,
KEYWORDS="Traffic measurement",
}

@ARTICLE{Newb7903:Simulation,
AUTHOR="M. J. Newby",
TITLE="The Simulation of Order Statistics from Life Distributions",
JOURNAL="Applied Statist.",
VOLUME=28,
NUMBER=3,
PAGES="298-301",
YEAR=1979,
KEYWORDS="Simulation; statistics",
}

@TECHREPORT{Niel79:Fast,
AUTHOR="M. G. Nielsen",
TITLE="On Fast Derivation of Equations Involving the Conditional
Binomial Moments of the State Probabilities of the M/M/n/M/infinity
Queueing System",
TYPE="Working paper",
INSTITUTION="IMSOR",
ADDRESS="Lyngby, Denmark",
PAGES=5,
YEAR=1979,
KEYWORDS="Queueing system",
}

@INCOLLECTION{Noet79:Product,
AUTHOR="A. S. Noetzel",
TITLE="The Product Form Queueing Network Model in Computer System
Analysis",
BOOKTITLE="Information Linkage Between Applied Mathematics and
Industry",
EDITOR="Peter Wang",
PUBLISHER="Academic Press",
PAGES="559-608",
YEAR=1979,
KEYWORDS="Product form",
}

@INCOLLECTION{Osaw79:Time,
AUTHOR="H. Osawa",
TITLE="The Time-Dependent Streams of Overflow and Input-Flows in the
Queueing System with Variable Arrival Rate",
BOOKTITLE="Studies in Queueing Systems with Multiplicity and Their
Applications",
PUBLISHER="Academic Press?",
PAGES="37-41",
YEAR=1979,
KEYWORDS="Queueing theory",
}

@INPROCEEDINGS{Oson79:Application,
AUTHOR="T. Osone and T. Fujisawa",
TITLE="An Application of an Imbedded Crossing Technique to Reserve for
Contingencies",
BOOKTITLE="Studies in Queueing Systems with Multiplicity and Their
Applications",
ADDRESS="Chofugaoka, Japan",
PAGES="77-91",
YEAR=1979,
KEYWORDS="Queueing system",
}

@ARTICLE{Papa7901:Potential,
AUTHOR="P. Papantoni-Kazakos",
TITLE="The Potential of End-to-End Observations in Trouble Localization
and Quality Control of Network Links",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=1,
PAGES="16-30",
YEAR=1979,
KEYWORDS="Network optimization",
}

@ARTICLE{Pear79:Teletraffic,
AUTHOR="C. Pearce",
TITLE="Teletraffic Theory and the Renewal Paradox",
JOURNAL=or,
PUBLISHER="North-Holland",
PAGES="1092-1103",
YEAR=1979,
KEYWORDS="Traffic theory",
}

@ARTICLE{Pech79:System,
AUTHOR="A. V. Pechinkin and A. D. Solov'yev and S. F. Yashkov",
TITLE="A System with Servicing Discipline Whereby the Order of Minimum
Remaining Length is Serviced First",
JOURNAL=ec,
YEAR=1979,
KEYWORDS="Spt",
ABSTRACT="SJF",
}

@ARTICLE{Pfan7902:Durchsatzsteigerung,
AUTHOR="H. Pfannschmidt and R. Kamitz",
TITLE="Durchsatzsteigerung in Breitband-Koppelnetzen mit kleinen
Abnehmerbündeln",
JOURNAL=ntzarchiv,
ADDRESS="Germany",
VOLUME=1,
NUMBER=2,
PAGES="35-57",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Switching network; broadband; circuit switching",
}

@ARTICLE{Ruba79:Priority,
AUTHOR="G. B. Rubal'skiy",
TITLE={Priority Service of "Long" Calls in Multichannel System},
JOURNAL=ec,
ADDRESS="SU",
VOLUME=4,
PAGES="93-98",
YEAR=1979,
KEYWORDS="Queueing system; priority",
}

@ARTICLE{Saue7901:Impact,
AUTHOR="C. H. Sauer and K. M. Chandy",
TITLE="The Impact of Distributions and Disciplines on Multiple Processor
Systems",
JOURNAL=cacm,
VOLUME=22,
NUMBER=1,
PAGES="25-34",
YEAR=1979,
KEYWORDS="Multiprocessor; queueing discipline",
}

@INCOLLECTION{Schm79:Einige,
AUTHOR="N. Schmitz",
TITLE="Einige Fehlerquellen bei Simulationsstudien",
BOOKTITLE="Quantitative Wirtschafts- und Unternehmensforschung",
EDITOR="R. Henn and B. Schips and P. Stähly",
PUBLISHER="Springer",
ADDRESS="Germany",
PAGES="101-113",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="simulation",
}

@PHDTHESIS{Schu79:Évaluation,
AUTHOR="G. R. Schumali",
TITLE="Évaluation par Simulation des Performances en Trafic d'un Système
de Commutation Électronique",
SCHOOL="ENST, École Nationale Supérieure des Télécommunications",
ADDRESS="Paris, France",
PAGES=85,
YEAR=1979,
LANGUAGE="French",
KEYWORDS="simulation",
}

@ARTICLE{Shko79:Estimates,
AUTHOR="E. I. Shkol'nyi",
TITLE="Estimates of the Loss Probabilities for a Queueing System with
Repeated Calls",
JOURNAL=ec,
ADDRESS="SU",
PAGES="74-78",
YEAR=1979,
KEYWORDS="Loss probability; call reattempt",
}

@ARTICLE{Sing7901:Characteristics,
AUTHOR="C. Singh",
TITLE="On the Characteristics of Method-of-Stages",
JOURNAL=ieeer,
VOLUME="R-28",
NUMBER=1,
PAGES="91-92",
YEAR=1979,
KEYWORDS="Reliability",
}

@ARTICLE{Smit79:Microprocessor,
AUTHOR="Jr. Smith and S. E. Barber",
TITLE="A Microprocessor-Controlled Teletraffic Logging Device",
JOURNAL=poeej,
VOLUME=72,
PAGES="149-152",
YEAR=1979,
KEYWORDS="traffic measurement",
}

@ARTICLE{Step79:Calculation,
AUTHOR="S. N. Stepanov",
TITLE="Calculation of the Correlation Function of a Markov Process with
Continuous Time and a Finite Number of States",
JOURNAL=ec,
ADDRESS="SU",
VOLUME=2,
PAGES="91-98",
YEAR=1979,
KEYWORDS="Markov process",
ABSTRACT="A computationally convenient exact formula for the correlation
function of a homogeneous regular markov process with continuous time
and a finite number of states is derived. This formula makes it possible
to calculate successive approximations of the correlation function. An
examination is made of questions connected with the performance of the
calculations. The results of the investigation can be applied in the
theoreti",
}

@INPROCEEDINGS{Szyb79:Advanced,
AUTHOR="E. Szybicki and M. E. Lavigne",
TITLE="The Introduction of an Advanced Routing System into Local Digital
Networks and its Impact on the Network Economy, Reliability and Grade of
Service",
BOOKTITLE=iss,
ADDRESS="Paris, France",
PAGES="171-177",
YEAR=1979,
KEYWORDS="Network planning; routing",
}

@ARTICLE{Tsia79:Advanced,
AUTHOR="S. H. Tsiang",
TITLE="Advanced Mobile Phone Service: Development support Systems",
JOURNAL=bstj,
VOLUME=58,
NUMBER=1,
PAGES="201-213",
YEAR=1979,
KEYWORDS="cellular system; mobile radio",
}

@ARTICLE{Walk79:Advanced,
AUTHOR="J. T. Walker",
TITLE="Advanced Mobile Phone Service: A Service Test Mobile Telephone
control Unit",
JOURNAL=bstj,
VOLUME=58,
NUMBER=1,
PAGES="145-152",
YEAR=1979,
KEYWORDS="cellular system; mobile radio",
}

@ARTICLE{Yaku79:Independent,
AUTHOR="Y. F. Yakushev",
TITLE="Independent Queues in Certain Two-Phase Servicing Systems",
JOURNAL=ec,
ADDRESS="SU",
VOLUME=4,
PAGES="103-110",
YEAR=1979,
KEYWORDS="Queueing system",
}

@ARTICLE{Youn79:Advanced,
AUTHOR="W. R. Young",
TITLE="Advanced Mobile Phone Service: Introduction, Background, and
Objectives",
JOURNAL=bstj,
VOLUME=58,
NUMBER=1,
PAGES="1-14",
YEAR=1979,
KEYWORDS="cellular system; mobile radio",
}

@ARTICLE{Zayt79:Optimal,
AUTHOR="V. A. Zaytsev and A. V. Pechinkin",
TITLE="Optimal Control of Servicing in a Multichannel System",
JOURNAL=ec,
ADDRESS="SU",
VOLUME=6,
PAGES="36-42",
YEAR=1979,
KEYWORDS="Queueing discipline; multiserver",
}

@ARTICLE{Zhil79:Stability,
AUTHOR="V. A. Zhilin and V. V. Kalashnikov",
TITLE="Stability Estimates of Regenerating Processes and Their
Application to Priority Service Systems",
JOURNAL=ec,
ADDRESS="SU",
VOLUME=4,
PAGES="82-89",
YEAR=1979,
KEYWORDS="Queueing theory",
}

@ARTICLE{Ivni79:Connections,
AUTHOR="V. A. Ivnitskiy",
TITLE="Connections between the Stationary Probabilities of the States of
Queueing Systems at an Arbitrary Instant, the Instant of Placing an
Order, and the Instant of Exit of an Order",
JOURNAL=ec,
ADDRESS="SU",
VOLUME=17,
PAGES="66-76",
YEAR=1979,
KEYWORDS="Queueing theory",
}

@ARTICLE{Jajs7902:Optimal,
AUTHOR="A. Jajszczyk",
TITLE="Optimal Structures of Benes' Switching Networks",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=2,
PAGES="433-437",
YEAR=1979,
KEYWORDS="Switching network",
}

@BOOK{Lang79:Hrung,
AUTHOR="P. Langrock and W. Jahn",
TITLE="Einführung in die Theorie der Markovschen Ketten und ihre
Anwendungen",
PUBLISHER="BSB B.G.Teubner Verlagsgesellschaft",
ADDRESS="Leipzig, Germany",
PAGES=268,
YEAR=1979,
LANGUAGE="German",
REFERENCES=121,
KEYWORDS="Markov chain",
ABSTRACT="Grundlagen der Wahrscheinlichkeitstheorie; Definition der
Markovschen Ketten; Beispiele für das Auftreten homogener Markovscher
Ketten; Zustandsverteilungen und
n-Schritt-Übergangswahrscheinlichkeiten; Klassifizierung der Zustände
Markovscher Ketten; Erstmalige Übergangszeiten und
Absorptionswahrscheinlichkeiten; Grenzwertsätze für die
n-Schritt-Übergangswahrscheinlichkeiten; Fostersches Kriterium f r
positiv-rekurrente Markovsche Ketten; Stati",
}

@ARTICLE{Hack79:Algorithmen,
AUTHOR="K.-D. Hackbarth",
TITLE="Algorithmen zur Berechnung minimaler disjunktiver Wege in
Netzen",
JOURNAL="Proceedings in Operations Research",
ADDRESS="Germany",
VOLUME=8,
PAGES="87-93",
YEAR=1979,
LANGUAGE="German",
REFERENCES=9,
KEYWORDS="Shortest Path; Algorithm",
ABSTRACT="In diesem Beitrag werden Algorithmen entwickelt, die kanten-
bzw. knotendisjunkte Wege mit minimaler Gesamtlänge berechnen.",
}

@ARTICLE{Bjrn79:Study,
AUTHOR="E. B. Christensen",
TITLE="A Study of Distributions for Call Durations and Other Holding
Times at the Copenhagen Telephone Company",
JOURNAL="Teleteknik",
VOLUME=2,
PAGES="117-130",
YEAR=1979,
KEYWORDS="Traffic measurement",
}

@ARTICLE{Blom79:Feldbus,
AUTHOR="W. Blome and W. Borst",
TITLE="Feldbus-Protokolle im Vergleich",
JOURNAL="Elektronik",
ADDRESS="Germany",
VOLUME=26,
PAGES="48-58",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Bus; lan; media access control",
ABSTRACT="Comparison of IEC-Fieldbus, Profibus-DP, ISP-Fieldbus and
Interbus-S.",
}

@BOOK{Gare79:Computers,
AUTHOR="M. Garey and D. B. Johnson",
TITLE="Computers and Intractability: A Guide to the Theory of
{NP-Completeness}",
ISBN="0-7167-1044-7",
PUBLISHER="Freeman and Company",
ADDRESS="New York",
YEAR=1979,
REFERENCES=12,
KEYWORDS="Complexity; computer; np problem",
ABSTRACT="A wide variety of commonly encountered problems from
mathematics, computer science, and operations research are now known to
be NP-complete, and the collection of such problems continues to grow
almost daily. Indeed, the NP-complete problems are now so pervasive that
it is important for anyone concerned with the computational aspects of
these fields to be familiar with the meaning and implications of this
concept.",
}

@ARTICLE{Krei79:Zweiter,
AUTHOR="J. Kreidl and A. Krepil",
TITLE="Zweiter Fruehling fuer den {VMEbus}",
JOURNAL="Elektronik",
ADDRESS="Germany",
VOLUME=26,
PAGES="30-35",
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Throughput; vme-bus",
ABSTRACT={Zehn Jahre nach seiner Entstehung steht der VMEbus vor seinem
zweiten Fruehling. Im Verbund mit dem seriellen Hochgeschwindigkeitsbus
"Autobahn" erreicht der VMEbus Datendurchsatzraten bis zu 560 MByte/s.
"Autobahn" nutzt dabei zwei serielle Leitungen amStecker P1 des VMEbus,
die bisher nicht benutzt waren...},
}

@ARTICLE{Stan79:FDDI,
AUTHOR="S. Stanley",
TITLE="{FDDI-Chips} der zweiten Generation",
JOURNAL="Elektronik",
ADDRESS="Germany",
VOLUME=26,
PAGES="39-41",
YEAR=1979,
LANGUAGE="German",
REFERENCES=6,
KEYWORDS="FDDI; hardware; processor; ring network",
ABSTRACT={Der Vorteil von FDDI hat sich allgemein herumgesprochen, die
Anwendung beginnt aber eher schleppend wegen der noch relativ hohen
Kosten. Eine Senkung kommt mit den hier vorgestellten Chips inSicht. Sie
stellen auf diesem Gebiet bereits die "zweite Generation" dar, mit
gegenueber der ersten wesentlich erweiterten Funktionen. Unter anderem
uebernehmen sie jetzt auch die "Übersetzung" von Daten zwischen
Ethernet-Netzen und dem FDDI-Netz.},
}

@ARTICLE{Cole79:Image,
AUTHOR="G. B. Coleman and H. C. Andrews",
TITLE="Image segmentation by clustering",
JOURNAL=ieeeproc,
VOLUME=67,
PAGES="773-785",
YEAR=1979,
}

@ARTICLE{Hara79:Statistical,
AUTHOR="R. M. Haralick",
TITLE="Statistical and structural approaches to texture",
JOURNAL=ieeeproc,
VOLUME=67,
NUMBER=5,
PAGES="786-804",
YEAR=1979,
}

@ARTICLE{Kueh7901:Approximate,
AUTHOR="P. J. Kühn",
TITLE="Approximate Analysis of General Queueing Networks by
Decomposition",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=1,
PAGES="113-126",
MONTH=jan,
YEAR=1979,
KEYWORDS="queueing theory; open queueing networks; moment
approximation",
ABSTRACT="In this paper an approximate method for the analysis of
general queueing networks is proposed. The queueing network is of the
open network type, having $N$ single server queueing stations with
arbitrary interconnections. Customers may enter the network at any
queueing station. The interarrival times of the exogeneous arrival
processes and the service times at the queueing stations are generally
distributed. The analysis is based on the method of decomposition where
the total network is broken up into subsystems; e.g., queueing stations
of the type $GI/G/1$ or subnets. The subsystems are analyzed invidually
by assuming renewal arrival and departure processes. All related
processes are considered with respect to their first two moments only.
An analysis procedure is reported which reduces the total problem to a
number of elementary operations which can be performed efficiently with
the aid of a computer. Numerical results are reported together with
simulation results to demonstrate the accuracy of the new method. The
paper concludes with a short discussion of possible extensions to the
method.",
}

@ARTICLE{Lam7901:Congestion,
AUTHOR="S. S. Lam and M. Reiser",
TITLE="Congestion Control of Store-and-Forward Networks by Input Buffer
Limits --- An Analysis",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=1,
PAGES="127-134",
MONTH=jan,
YEAR=1979,
KEYWORDS="congestion control",
ABSTRACT="The use of input buffr limits for congestion control of
store-and-forward networks is investigated. An analytic model is
formulated. Based upon the analytic results, strategies are proposed for
the design of input buffer limits to achieve the maximum network
throughput as well as to provide a safety margin for uncertainties in
traffic assumptions. A useful capacity law is discovered. Major
conclusions drawn from the analysis are supported by simulation results
for a four-node homogeneous network. These results indicate that input
buffer limits which satisfy the capacity law are a simple and effective
means of network congestion control.",
}

@ARTICLE{Manf7901:Decomposition,
AUTHOR="David R. Manfield and T. Downs",
TITLE="Decomposition of Traffic in Loss Systems with Renewal Input",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=1,
PAGES="44-58",
MONTH=jan,
YEAR=1979,
KEYWORDS="queueing theory; loss system",
ABSTRACT="A method is proposed for the analysis of a teletraffic network
with alternative routing. The approach used is to a model a ``general
link'' as a separate entity, being a first step towards analyzing the
network in a link-by-link fashion. To this end the general link is
considered to be a group of fully available trunks offered a number of
separate streams of traffic. By considering the multivariate point
process formed by the total stream of arriving calls, the individual
streams of traffic overflowing from, and the individual streams of
traffic carried on the common trunk, are distinguished. All streams of
traffic in the network are considered to be well described by simple
renewal processes. The validity of the method is illustrated with exact
numerical analysis results and by simulation.",
}

@ARTICLE{Nese7901:Hybrid,
AUTHOR="Martin Nesenbergs",
TITLE="A Hybrid of {Erlang} {$B$} and {$C$} Formulas and Its
Applications",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=1,
PAGES="59-68",
MONTH=jan,
YEAR=1979,
KEYWORDS="queueing theory",
ABSTRACT="This paper attempts to broaden the usefulness of existing
Erlang grade of service formulas, especially when faced with the
evolving extensive changes in the telephone networks. The old Markov
traffic arrival and Markov call duration (or service) models are
combined with what may be called more realistic user behavior and
network scenarios. For the specified service system models, a
generalized merger of ideal loss and ideal delay steady-state
representations is developed. It is shown that a particular weighted
inverse combination of Erlang $B$ and $C$ formulas, herein called the
hybrid, is useful for grade of service estimates under several
conditions. In addition to the usual offered load and the number of
servers, the hybrid involves a relative Erlang $B$ versus $C$ weighting
parameter $\theta$. This parameter is non-negative and depends on system
applications, as illustrated in a number of examples given. When less
than or equal to unity, such as for the popular Poisson model, $\theta$
has a simple meaning. It is then the conditional probability that a
typical customer elects to wait, or a service request is entered into a
queue, given that all servers are busy.",
}

@ARTICLE{Davi7901:Numerical,
AUTHOR="Brian Davies and Brian Martin",
TITLE="Numerical Inversion of the Laplace Transform: a survey and
comparison of methods",
JOURNAL="Journal of Computational Physics",
VOLUME=33,
NUMBER=1,
PAGES="1-32",
MONTH=jan,
YEAR=1979,
KEYWORDS="Laplace transform; numerical methods",
ABSTRACT="A large number of different methods for numerically inverting
the Laplace transform are tested and evaluated according to the criteria
of applicability to actual inversion problems, applicability to various
types of functions, numerical accuracy, computational efficiency, and
ease of programming and implementation. The methods are presented
briefly and classified theoretically into methods which compute a
sample, methods which expand $f(t)$ in exponential functions, methods
based on Gaussian quadrature, methods based on bilinear transformation,
and methods based on Fourier series. Extensive results are presented,
especially on the numerical accuracy of the methods on a set of 16 test
functions. The main conclusion is that for attaining high accuracy on a
wide range of test functions, the use of Laguerre polynomials is most
successful, while methods based on Chebyshev polynomials and on
accelerated convergence of a Fourier series are both quite good.
However, no single method gives optimum results for all purposes and all
occasions; the results obtained in this comparison give some idea of
which methods are likely to be suitable for special problems and
circumstances.",
}

@ARTICLE{Nied7901:Kostenvergleich,
AUTHOR="J. Niedereichholz and F. Stockheim",
TITLE="Kostenvergleich der Simulationssprachen {GPSS} 1100 und {SIMULA}
1",
JOURNAL=aninf,
PAGES="1-",
MONTH=jan,
YEAR=1979,
LANGUAGE="German",
KEYWORDS="Simulation; GPSS; SIMULA",
}

@ARTICLE{Anon7901:Measurement,
AUTHOR="Anonymous",
TITLE="Measurement of Interactive Response Time (from {US} Federal
Information Processing Standard 5)",
JOURNAL=ccr,
VOLUME=9,
NUMBER=1,
MONTH=jan,
YEAR=1979,
}

@ARTICLE{ANSI7901:Further,
AUTHOR="ANSI X3S3.7",
TITLE="Further Refinements to the Proposed Datagram Interface [for
{X.25]}",
JOURNAL=ccr,
VOLUME=9,
NUMBER=1,
MONTH=jan,
YEAR=1979,
}

@ARTICLE{Haje7901:Protocols,
AUTHOR="Jan Hajek",
TITLE="Protocols Verified by {APPROVER}",
JOURNAL=ccr,
VOLUME=9,
NUMBER=1,
MONTH=jan,
YEAR=1979,
}

@ARTICLE{Anon7901:Report,
AUTHOR="Anonymous",
TITLE="Report on {NATO} Advanced Study Institute",
JOURNAL=ccr,
VOLUME=9,
NUMBER=1,
MONTH=jan,
YEAR=1979,
}

@PHDTHESIS{Lehn7902:Modularer,
AUTHOR="R. Lehnert",
TITLE="Ein modularer Prozessor zur Simulation von Zufallsnetzwerken",
SCHOOL="RWTH Aachen, Lehrstuhl für Allgemeine Elektrotechnik und
Datenfernverarbeitung",
ADDRESS="Aachen, Germany",
PAGES=137,
MONTH=feb,
YEAR=1979,
LANGUAGE="German",
REFERENCES=63,
KEYWORDS="Queueing system; simulation; hardware simulator;
microcontroller",
}

@TECHREPORT{Shoc7902:Internetwork,
AUTHOR="John F. Shoch and L. Stewart",
TITLE="Internetwork Experiments with the Bay Area Packet Radio Network",
INSTITUTION="Xerox PARC",
NUMBER="SSL-79-4",
MONTH=feb,
YEAR=1979,
}

@INPROCEEDINGS{Chou7902:Comparative,
AUTHOR="Wu Chou and J. Powel and A. Bragg",
TITLE="Comparative evaluation of deterministic and adaptive routing",
BOOKTITLE="International Symposium on flow control in computer
networks",
ADDRESS="Versailles, France",
MONTH=feb,
YEAR=1979,
}

@INPROCEEDINGS{Edge7902:Comparison,
AUTHOR="S. W. Edge",
TITLE="Comparison of the hop-by-hop and end point approaches to network
interconnection",
BOOKTITLE="International Symposium on flow control in computer
networks",
ADDRESS="Versailles, France",
MONTH=feb,
YEAR=1979,
}

@INPROCEEDINGS{McQu7902:Interactions,
AUTHOR="J. M. McQuillan",
TITLE="Interactions between routing and congestion control in computer
networks",
BOOKTITLE="International Symposium on flow control in computer
networks",
ADDRESS="Versailles, France",
MONTH=feb,
YEAR=1979,
}

@INPROCEEDINGS{Rind7902:Passive,
AUTHOR="J. Rinde and A. Caisse",
TITLE="Passive flow control techniques for distributed networks",
BOOKTITLE="International Symposium on flow control in computer
networks",
ADDRESS="Versailles, France",
MONTH=feb,
YEAR=1979,
}

@INPROCEEDINGS{Rudi7902:Routing,
AUTHOR="Harry Rudin and H. Muller",
TITLE="On routing and flow control",
BOOKTITLE="International Symposium on flow control in computer
networks",
ADDRESS="Versailles, France",
MONTH=feb,
YEAR=1979,
}

@INPROCEEDINGS{Sega7902:Failsafe,
AUTHOR="A. Segall",
TITLE="Failsafe distributed algorithms for routing in communication
networks",
BOOKTITLE="International Symposium on flow control in computer
networks",
ADDRESS="Versailles, France",
MONTH=feb,
YEAR=1979,
}

@INPROCEEDINGS{Benn7902:Supporting,
AUTHOR="C. J. Bennett",
TITLE="Supporting Transnet Bulk Data Transfer",
BOOKTITLE="International Symposium on flow control in computer
networks",
ORGANIZATION="IFIP",
ADDRESS="Versailles",
PAGES="383-404",
MONTH=feb,
YEAR=1979,
}

@ARTICLE{Donn7902:Interaction,
AUTHOR="J. E. Donnelley and J. W. Yeh",
TITLE="Interaction Between Protocol Levels in a Prioritized {CSMA}
Broadcast Network",
JOURNAL=cn,
VOLUME=3,
NUMBER=1,
PAGES="9-23",
MONTH=feb,
YEAR=1979,
}

@INPROCEEDINGS{Labe7902:Study,
AUTHOR="J. Labetoulle",
TITLE="A Study of Flows in an {X.25} Environment",
BOOKTITLE="International Symposium on flow control in computer
networks",
PUBLISHER="North-Holland",
ADDRESS="Versailles",
PAGES="77-87",
MONTH=feb,
YEAR=1979,
}

@INPROCEEDINGS{Mago7902:Flow,
AUTHOR="R. Magoon and D. Twyver",
TITLE="Flow and Congestion Control in {SL-10} Networks",
BOOKTITLE="International Symposium on flow control in computer
networks",
PUBLISHER="North-Holland",
ADDRESS="Versailles",
PAGES="45-61",
MONTH=feb,
YEAR=1979,
}

@INPROCEEDINGS{Yemi7902:General,
AUTHOR="Y. Yemini and L. Kleinrock",
TITLE="On a General Rule for Access Control, or Silence is Golden
\ldots",
BOOKTITLE="International Conference on Flow Control in Computer
Networks",
ADDRESS="Versailles, France",
PAGES="335-347",
MONTH=feb,
YEAR=1979,
KEYWORDS="media access",
}

@PROCEEDINGS{Gran7902:Proceedings,
TITLE="Proceedings of the International Symposium on Flow Control in
Computer Networks",
EDITOR="J.-L. Grange and M. Gien",
ISBN="0-444-85297-2",
PUBLISHER="North-Holland",
ADDRESS="Versailles, France",
DAYS=12,
MONTH=feb,
YEAR=1979,
KEYWORDS="Computer network; congestion control; flow control;
interconnection; performance evaluation; routing",
}

@ARTICLE{Eckb7903:Single,
AUTHOR="Ted Eckberg",
TITLE="The Single Server Queue with Periodic Arrival Process and
Deterministic Service Times",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=3,
PAGES="556-562",
MONTH=mar,
YEAR=1979,
KEYWORDS="discrete time queue",
ABSTRACT="The paper derives an algorithm for computing the exact delay
distribution for the following first-come, first-served (FCFS, FIFO)
single server queue. The arrival process is the superposition of $N+1$
independent equivalent deterministic arrival streams, and the service
times are deterministic. Numerical results are used to compare this
system with an approximating system which has been used in the absence
of exact results: the $M/D/1$ queue (Poisson input, deterministic
service times). A comparison with a finite source model is also given.
\ldots The results indicate that an $M/D/1$ approximation can be quite
pessimistic in predicting the performance of such a system.",
ANNOTE="Finite population, infinite buffer, fixed service time, single
FCFS server. Continuous-time model with randomly staggered periodic
input streams, where arrivals are uniformly distributed over the
interval.",
}

@ARTICLE{Mino7903:Optimal,
AUTHOR="Daniel Minoli",
TITLE="Optimal Packet Length for Packet Voice Communication",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=3,
PAGES="607-611",
MONTH=mar,
YEAR=1979,
KEYWORDS="packet voice",
ANNOTE="Shows that for typical system parameters, delay-optimal voice
packet length is 300--370 bits for vocoders, less than 700 bits for PCM.
Investigates single-link system.",
}

@ARTICLE{Morr7903:Two,
AUTHOR="J. A. Morrison",
TITLE="Two Discrete-Time Queues in Tandem",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=3,
PAGES="563-573",
MONTH=mar,
YEAR=1979,
KEYWORDS="discrete time queue; tandem queue; end-to-end analysis",
ABSTRACT="A discrete-time queueing problem involving two queues in
tandem, with unit service time, is considered. Such a situation can
arise within a packet-switching network. Arrivals at the queues occur
from separate sources, which may be correlated. The joint arrivals from
the two sources are assumed to be independently and identically
distributed in each unit time interval. In addition, the output of the
first queue enters the second queue. Both queues are assumed to have
unlimited size, and the generating function of the steady state
distribution of the two queue lengths is calculated, under the
assumption that the mean combined input rate from the two sources is
less than unity. The average waiting times are also derived, under the
assumption that all arrivals take place at the end of a unit time
interval. --- A particular example, in which the input to the first
queue is geometrically distributed in each unit time interval, while the
input from the source into the second queue is either 0 or 1, with fixed
probabilities, is analyzed. The steady state probability that the length
of the second queue exceeds $m$ is calculated. The asymptotic behavior
for $m \gg 1$ changes significantly when a certain threshold, depending
on the mean input rates, is reached. Numerical results are presented.",
ANNOTE="Constant service time, single server, unlimited buffer. Second
server receives endogeneous and possibly correlated exogeneous arrivals.
Arrivals are iid from slot to slot. Example considers independent,
geometric arrival streams.",
}

@ARTICLE{Dubn7903:Variable,
AUTHOR="J. J. Dubnowski and R. E. Crochiere",
TITLE="Variable rate coding of speech",
JOURNAL=bstj,
VOLUME=58,
NUMBER=3,
PAGES="577-600",
MONTH=mar,
YEAR=1979,
KEYWORDS="voice coding; variable-rate coder; VBR",
ABSTRACT="In this paper, we examine a number of concepts and issues
concerning variable rate coding of speech. We formulate the problem as a
multistate coder (i.e., a coder that can operate at several bit rates)
coupled with a time buffer. We first analyze the theoretical aspects of
the problem by examining it in the context of a block processing
formulation. We then suggest practical methods for implementing a
variable rate coder based on the dynamic buffering approach. We also
allude to a multiple user configuration of variable-rate coding for
TASI-type applications. A practical example of a variable-rate ADPCM
coder is presented and applied to speech coding. It is shown that by
careful design the algorithm can be made to be as robust to channel
errors as that of a fixed rate ADPCM coder.",
}

@INPROCEEDINGS{Comf7903:Taxonomy,
AUTHOR="J. C. Comfort",
TITLE="A taxonomy and analysis of event set management algorithms for
discrete event simulation",
BOOKTITLE="12th Annual Simulation Symposium",
EDITOR="R. D. Conine and E. D. Katz and J. E. Melde",
ADDRESS="Tampa, Fl",
PAGES="115-146",
MONTH=mar,
YEAR=1979,
KEYWORDS="Simulation; event set",
}

@TECHREPORT{Forg7903:Voice,
AUTHOR="James W. Forgie and C. E. Feehrer and P. L. Weene",
TITLE="Voice Conferencing Technology Program",
TYPE="Final Report",
INSTITUTION="MIT/Lincoln Laboratory",
NUMBER="ESD-TR-79-78",
MONTH=mar,
YEAR=1979,
}

@ARTICLE{Netr7903:Motion,
AUTHOR="A. N. Netravali and J. D. Robbins",
TITLE="Motion Compensated Television Coding - Part I",
JOURNAL=bstj,
PUBLISHER="Bell",
VOLUME=58,
PAGES="631-670",
MONTH=mar,
YEAR=1979,
KEYWORDS="video compression",
}

@ARTICLE{Tows7904:Statistical,
AUTHOR="Donald F. Towsley and J. Wolf",
TITLE="On the Statistical Analysis of Queue Lengths and Waiting Times
for Statistical Multiplexers with {ARQ} Retransmission Schemes",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=4,
PAGES="693-702",
MONTH=apr,
YEAR=1979,
KEYWORDS="TDM; time division multiplex; data retransmission; ARQ",
ABSTRACT="The stop-and-wait and continuous error detection
retransmission schemes are widely used to control errors in many
computer-communication systems. In this paper a model is developed which
describes the statistical behavior of the multiplexer using these error
detection and retransmission schemes. The model is applied to the case
where errors are independent and can occur during data and/or
acknowledgement transmission. Numerical results for the mean waiting
time and mean queue occupancy are presented for the case of independent
errors.",
ANNOTE="Discrete-time queues. Slotted multiplexer, infinite buffer,
batch arrivals, constant packet length (multiple of slot size). Late
arrival system.",
}

@ARTICLE{Schn7904:PASCAL,
AUTHOR="G. M. Schneider",
TITLE="{PASCAL:} an overview",
JOURNAL=ieeecomp,
PAGES="61-",
MONTH=apr,
YEAR=1979,
KEYWORDS="Programming language; PASCAL",
}

@ARTICLE{Ahuj7904:Routing,
AUTHOR="V. Ahuja",
TITLE="Routing and flow control in systems network architecture",
JOURNAL=ibmsj,
VOLUME=18,
PAGES="298-314",
MONTH=apr,
YEAR=1979,
}

@ARTICLE{Laue7904:Duality,
AUTHOR="H. C. Lauer and R. M. Needham",
TITLE="On the Duality of Operating System Structures",
JOURNAL="reprinted in ACM Operating Systems Review",
VOLUME=13,
NUMBER=2,
PAGES="3-10",
MONTH=apr,
YEAR=1979,
}

@ARTICLE{Thur7904:Bibliography,
AUTHOR="Kenneth J. Thurber and A. H. Freeman",
TITLE="A Bibliography of Local Computer Network Architectures",
JOURNAL=ccr,
VOLUME=9,
NUMBER=2,
MONTH=apr,
YEAR=1979,
}

@ARTICLE{Boch7904:Message,
AUTHOR="Gregor V. Bochmann and F. Vogt",
TITLE="Message Link Protocol {(MLP)}",
JOURNAL=ccr,
VOLUME=9,
NUMBER=2,
MONTH=apr,
YEAR=1979,
}

@ARTICLE{Hill7904:Table,
AUTHOR="R. Hill",
TITLE="A Table-Driven Approach to Cyclic Redundancy Check Calculations",
JOURNAL=ccr,
VOLUME=9,
NUMBER=2,
MONTH=apr,
YEAR=1979,
}

@ARTICLE{Anon7904:International,
AUTHOR="Anonymous",
TITLE="International Symposium on Flow Control in Computer Networks",
JOURNAL=ccr,
VOLUME=9,
NUMBER=2,
MONTH=apr,
YEAR=1979,
}

@TECHREPORT{Asge7904:Planlægnings,
AUTHOR="C. Asgersen",
TITLE="Planlægnings- og Dimensioneringsproblemer, samt deres L sning i
det Danske Telenet",
INSTITUTION="KTAS",
ADDRESS="Copenhagen, Denmark",
PAGES=27,
MONTH=apr,
YEAR=1979,
LANGUAGE="Danish",
KEYWORDS="Traffic engineering; planning; network design; network
planning",
}

@ARTICLE{Stan7905:Reneging,
AUTHOR="Robert E. Stanford",
TITLE="Reneging Phenomena in Single Channel Queues",
JOURNAL=mor,
VOLUME=4,
NUMBER=2,
PAGES="162-178",
MONTH=may,
YEAR=1979,
KEYWORDS="queueing theory; bounded waiting time; GI/G/1",
ANNOTE="$GI/G/1$ with stochastic bound on waiting time",
}

@TECHREPORT{Jage7905:Traffic,
AUTHOR="Bjorn Jager and  Postema and J. de Boer",
TITLE="Traffic simulation in a trial trunked system for private mobile
radio",
TYPE="internal report",
INSTITUTION="Philips PTI / SAS",
ADDRESS="Hilversum",
NUMBER="SR 2200-79-3115",
MONTH=may,
YEAR=1979,
KEYWORDS="MAT; simulation",
}

@INPROCEEDINGS{Kano7905:New,
AUTHOR="S. Kano and H. Ebihara and Shuji Suzuki",
TITLE="New common channel signalling system",
BOOKTITLE=iss,
ADDRESS="Paris",
PAGES="1189-1195 (paper 1)",
MONTH=may,
YEAR=1979,
KEYWORDS="Signalling; common channel; CCS",
}

@INPROCEEDINGS{Shoc7905:Ethernet,
AUTHOR="John F. Shoch and J. A. Hupp",
TITLE="Performance of an Ethernet Local Network -- A Preliminary
Report",
BOOKTITLE="Local Area Communications Network Symposium",
ADDRESS="Boston",
MONTH=may,
YEAR=1979,
}

@MASTERSTHESIS{Soll7905:Copying,
AUTHOR="Karen Sollins",
TITLE="Copying Complex Structures in a Distributed System",
SCHOOL="Massachusetts Institute of Technology",
ADDRESS="Cambridge, Massachusetts",
MONTH=may,
YEAR=1979,
}

@INPROCEEDINGS{Wilk7905:Cambridge,
AUTHOR="M. V. Wilkes and D. J. Wheeler",
TITLE="The Cambridge digital communications ring",
BOOKTITLE="Symposium on Local area communications networks",
ORGANIZATION="Mitre Corp. and National Bureau of Standards",
ADDRESS="Boston",
PAGES="47-62",
MONTH=may,
YEAR=1979,
}

@ARTICLE{Conn7905:IBM3033,
AUTHOR="W. D. Connors and J. H. Florkowski and S. K. Patton",
TITLE="The {IBM3033:} An Inside Look",
JOURNAL=datamation,
PAGES="198-218",
MONTH=may,
YEAR=1979,
}

@ARTICLE{Ston7905:Concurrency,
AUTHOR="Michael Stonebraker",
TITLE="Concurrency Control and Consistency of Multiple Copies of Data in
Distributed {INGRES}",
JOURNAL=ieeese,
VOLUME="se-5",
NUMBER=3,
PAGES="188-194",
MONTH=may,
YEAR=1979,
}

@TECHREPORT{Harr7905:Queueing,
AUTHOR="R. J. Harris and W. M. Jolley",
TITLE="Queueing Systems with Post Call Activity",
TYPE="Traffic Engineering Report",
INSTITUTION="Telecom Australia",
NUMBER=16,
PAGES=32,
MONTH=may,
YEAR=1979,
KEYWORDS="Queueing System; Post Call Activity",
}

@INPROCEEDINGS{Calo7906:Delay,
AUTHOR="Seraphin Calo",
TITLE="Delay Properties of Message Channels",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Boston, Massachusetts",
PAGES="43.5.1-43.5.4",
MONTH=jun,
YEAR=1979,
KEYWORDS="queueing theory",
ANNOTE="tandem connection of FCFS single server queues, with service
times experienced by particular customer are scaled versions of the same
random variable (messages preserve their length). Uniform message
channel: service identically repeated for all servers.",
}

@INPROCEEDINGS{Kim7906:Discrete,
AUTHOR="Byung G. Kim and Donald F. Towsley and J. Wolf",
TITLE="On Discrete-Time Queueing Systems",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Boston, Massachusetts",
PAGES="43.4.1-43.4.5",
MONTH=jun,
YEAR=1979,
KEYWORDS="discrete time queue",
}

@INPROCEEDINGS{Klei7906:Power,
AUTHOR="L. Kleinrock",
TITLE="Power and Deterministic Rules of Thumb for Probabilistic Problems
in Computer Communications",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Boston, Massachusetts",
PAGES="43.1.1-43.1.10",
MONTH=jun,
YEAR=1979,
KEYWORDS="queueing theory",
ABSTRACT="By applying the tools from queueing theory to a number of
problems in computer communications and other multi-access systems, we
have found a number of useful and intuitively pleasing rules of thumb
which predict system behavior and which are easily calculated by
deterministic reasoning. These rules of thumb allow one to calculate the
``proper'' operating point in these systems where the basic tradeoff is
usually efficiency versus either delay (due to queueing) or loss (due to
blocking) or some combination thereof. Using a previously defined notion
of power as applied to delay systems, we extend that definition to
combined loss and delay systems and then are able to define the optimal
system operating point as that which maximizes this defined power. These
results take advantage of the smoothing effect of the law of large
numbers as applied to computer communication systems.",
}

@INPROCEEDINGS{Dhad7906:Digital,
AUTHOR="V. R. Dhadesugoor and Chaim Ziegler and Donald L. Schilling",
TITLE="Digital silence detection in delta modulation packet voice
networks",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Boston, Massachusetts",
VOLUME=2,
PAGES="24.7.1-24.7.5",
MONTH=jun,
YEAR=1979,
KEYWORDS="packet voice; silence detection",
ABSTRACT="In order to reduce the total packet transmission rate in
packet voice networks, it is advantageous to detect silence periods of
speech and not transmit any packet during this time. Using delta
modulation techniques, algorithms are derived for the digital detection
of silent periods. In addition, compensation algorithms for use by the
receiver during silent periods are developed. Real time experiments were
performed to test the algorithms.",
ANNOTE="Ref. 4, 5 have nothing to do with packet voice. Very simple
speech detection based on delta modulator output: if no signal change,
assume silence.",
}

@INPROCEEDINGS{Mino7906:Satellite,
AUTHOR="Daniel Minoli",
TITLE="Satellite on-board processing of packetized voice",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Boston, Massachusetts",
VOLUME=4,
PAGES="58.4.1-58.4.5",
MONTH=jun,
YEAR=1979,
KEYWORDS="packet voice; satellite communications",
ABSTRACT="Spectral room on satellite up-links is becoming more precious
as time progresses, especially in the UHF band. By using packetized
voice, more spectral efficiency can be achieved. Voice is a
delay-sensitive type of traffic. This paper examines the tradeoffs
between spectral advantages of packetized voice with other data traffic
and extra processing delay caused by packetization. Specifically, we
develop relations between voice throughput and end-to-end delay in a
processing satellite.",
}

@INPROCEEDINGS{Fras7906:Datakit,
AUTHOR="A. G. Fraser",
TITLE="Datakit -- a modular network for synchronous and asynchronous
traffic",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Boston, Massachusetts",
PAGES="20.1.1-20.1.3",
MONTH=jun,
YEAR=1979,
KEYWORDS="Datakit; network architecture",
ABSTRACT="A set of mutually compatible modules are the elements of an
experimental data network. Called Datakit, the concept being studied is
the ``erector set'' approach to the construction of data networks that
can grow gracefully and evolve to accomodate a wide variety of traffic
types. The modules, each a single circuit board, are interconnected by a
hardware packet switch. The network is master clocked so that speed
control can be used for stream traffic while asynchronous multiplexing
can be used for bursty traffic.",
ANNOTE="The switch processes data serially at 7.5 Mb/s.",
}

@INPROCEEDINGS{Cox7906:Variable,
AUTHOR="Richard V. Cox and R. E. Crochiere",
TITLE="Variable rate coding for {TASI} and packet transmission systems",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Boston, Massachusetts",
PAGES="25.6.1-25.6.4",
MONTH=jun,
YEAR=1979,
KEYWORDS="packet voice; TASI; variable rate coding; speech coding",
ABSTRACT="In this paper we examine the use of variable rate coding
concepts for TASI and packet speech transmission systems. The paper is
divided into two major parts. In the first part the theoretical
performance of variable rate coding is analyzed for multiple user (TASI)
applications. Potential gains in $s/n$ are experimentally determined
from two-party telephone conversation data for up to 12 shared
conversations on a channel. In the second part of the paper the buffer
control mechanism for coupling a variable rate coder to a fixed rate (or
slowly varying rate) channel is analyzed. It is shown that the buffer
control can be modeled as a second order control system and, under
adverse parameter settings, the system can be unstable. By an
appropriate design and parameter setting the buffer control can be made
to function properly. The insight developed from this particular buffer
control mechanism may also lead to a better understanding of other
buffer control problems in variable rate transmission or packet
systems.",
}

@ARTICLE{Hilt7906:Electronic,
AUTHOR="Starr Roxanne Hiltz",
TITLE="Electronic Information Exchange - Findings",
JOURNAL="Telecommunications Policy",
PAGES="156-161",
MONTH=jun,
YEAR=1979,
KEYWORDS="telecommunications policy",
}

@PROCEEDINGS{Bout7906:Teleinformatics,
TITLE="Teleinformatics",
EDITOR="E. J. Boutny and A. Danthine",
PUBLISHER="Proc. International Conference ``Teleinformatics 79''",
PAGES="1-314",
MONTH=jun,
YEAR=1979,
KEYWORDS="future outlook; communication network; data transmission;
special issue",
}

@INPROCEEDINGS{Butt7906:Delay,
AUTHOR="M. Butto and G. Colombo and A. Tonietti",
TITLE="Delay distribution in a data communication system with error
recovery",
BOOKTITLE=icc,
ADDRESS="Boston",
VOLUME=3,
PAGES="1-5 (43.8)",
MONTH=jun,
YEAR=1979,
KEYWORDS="Signalling; common channel; CCS; performance evaluation",
}

@INPROCEEDINGS{Schw7906:Approximate,
AUTHOR="P. Schweitzer",
TITLE="Approximate analysis of multiclass closed networks of queues",
BOOKTITLE="International Conference on Stochastic Control and
Optimization",
ADDRESS="Amsterdam",
PAGES="25-29",
MONTH=jun,
YEAR=1979,
KEYWORDS="Queueing network; analysis",
}

@TECHREPORT{Elli7906:Computer,
AUTHOR="C. A. Ellis and G. J. Nutt",
TITLE="Computer Science and Office Information Systems",
INSTITUTION="Xerox PARC",
MONTH=jun,
YEAR=1979,
}

@TECHREPORT{Lloy7906:Problem,
AUTHOR="P. J. Lloyd",
TITLE="The Problem of {Telnet---XXX} Conversion",
TYPE="Internal Note",
INSTITUTION="UCL",
NUMBER=765,
MONTH=jun,
YEAR=1979,
}

@INPROCEEDINGS{Morr7906:Fixing,
AUTHOR="R. M. Morris",
TITLE="Fixing Timeout Intervals for Lost Packet Detection in Computer
Communication Networks",
BOOKTITLE=ncc,
PAGES="887-891",
MONTH=jun,
YEAR=1979,
}

@INPROCEEDINGS{Wein7906:Efficient,
AUTHOR="Clifford J. Weinstein and A. J. McLaughlin and T. Bially",
TITLE="Efficient multiplexing of voice and data in integrated digital
networks",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Seattle, Washington",
PAGES="21.1.1-21.1.7",
MONTH=jun,
YEAR=1979,
KEYWORDS="packet voice; silence detection; voice source model;
integrated services",
ABSTRACT="The development of digital communications systems which can
accomodate voice and data traffic in an integrated manner is a subject
of much current interest and activity. In this paper, we describe some
basic issues and tradeoffs in the statistical multiplexing of voice and
data in common digital links, with particular attention to the
statistical properties of voice traffic and to the effectiveness of
various proposed techniques for integrating voice and data in a
bandwidth efficient manner. Techniques for the efficient multiplexing of
voice and data in a variety of system configurations, including
demand-assigned broadcast satellite networks, multi-node terrestrial
topologies , and distributed-control local networks, are discussed.
Communication strategies considered include packet techniques for both
voice and data, and hybrid methods which employ TDMA-based
circuit-switching for voice and packet-switching for data. Special
attention is directed at the exploitation of the silence periods in
voice conversation and at the effect of variable voice transmission
rates.",
}

@ARTICLE{Thom7906:Majority,
AUTHOR="R. Thomas",
TITLE="A Majority Consensus Approach to Concurrency Control for Multiple
Copy Databases",
JOURNAL=tods,
VOLUME=4,
NUMBER=2,
PAGES="180-209",
MONTH=jun,
YEAR=1979,
}

@ARTICLE{Arth7907:Theoretical,
AUTHOR="E. Arthurs and B. W. Stuck",
TITLE="A theoretical traffic performance analysis of an integrated
voice-data virtual circuit packet switch",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=7,
PAGES="1104-1111",
MONTH=jul,
YEAR=1979,
KEYWORDS="packet voice; integrated services; priority",
ABSTRACT="A time division packet switch capable of concurrently handling
both voice and data traffic is proposed, and some of its performance
limitations are analyzed. The voice packet traffic is handled at a
higher priority level than data traffic, in order to meet stringent
timing criteria, and can be shown to be handled just as if it were
circuit switched. The data traffic utilizes whatever time slots are not
occupied with voice traffic. The principal performance limitations
described in this exploratory study are the fraction of time the voice
traffic is blocked due to all the available time slots already being
used for voice traffic, and an upper bound on the mean delay encountered
by the data traffic as it waits to find an available time slot. An
illustrative numerical example is the following. If we assume that each
voice telephone conversation lasts for a mean of five minutes, and that
twenty voice calls are generated over a six hour time span, and each
data session lasts for a mean of fourty minutes, and that five data
calls are generated over a six hour time span, then if separate line
switched networks are used for voice and for data with long term
blocking probability of one percent, a total of 703 64 kbits links would
be required to support 461 voice stations and 882 data terminals. On the
other hand, using the integrated voice/data switch described here, and
if we assume that the total delay due to the switch alone for data
packets cannot exceed a long term mean value of one second, then only
298 64 kbit/s links are required to support 461 voice stations and 882
data terminals, reducing the number of required lines by a factor of
about two. Moreover, the assumptions leading to this comparison suggest
that the packet switch could in fact suport significantly more than this
number of voice stations and data terminals. This is achieved at the
expense of additional buffering for the data in the packet switch
approach.",
ANNOTE="voice packets are two octets: one data, one control",
}

@ARTICLE{Tsud7907:Approach,
AUTHOR="Toru Tsuda and Shimmi Hattori and Reigo Yatsuboshi and Kiyoharu
Yamauchi",
TITLE="An approach to multi-service subscriber loop system using
packetized voice terminals",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=7,
PAGES="1112-1117",
MONTH=jul,
YEAR=1979,
KEYWORDS="packet voice; subscriber loop; voice/data integration",
ABSTRACT="A new subscriber communication system and its design
philosophy are described. In addition to telephone communication, the
system is simultaneously able to offer data communications, still
picture communication, etc. The system is composed of a packetized
voice/data terminal, a multi-service switching equipment and the digital
subscriber loop connecting between them. The system utilizes the
existing subscriber line efficiently and is entirely suitable for coming
telephone and data public digital network. 64 kbit/s PCM coded voice
conversation and 48 kbit/s data communication were achieved
simultaneously over 96 kbit/s digital subscriber line which was spanned
up to 2 km.",
ANNOTE="voice packet length of 64 bytes; header 10 bytes",
}

@ARTICLE{Barb7907:Protocols,
AUTHOR="D. Barber",
TITLE="Protocols for intelligent terminals",
JOURNAL=ccr,
VOLUME=9,
NUMBER=3,
PAGES="13-22",
MONTH=jul,
YEAR=1979,
REFERENCES=13,
KEYWORDS="small computer; packet switching; communication protocol;
information system; data transmission; communication network",
}

@ARTICLE{Buts7907:File,
AUTHOR="B. Butscher and W. Heinze",
TITLE="A file transfer protocol and implementation",
JOURNAL=ccr,
VOLUME=9,
NUMBER=3,
PAGES="2-12",
MONTH=jul,
YEAR=1979,
REFERENCES=10,
KEYWORDS="Communication network; information system; data transmission;
realization; communication protocol",
ABSTRACT="This paper presents a file transfer service in a heterogeneous
computer network (HMINET). The basic architecture models are presented,
the file transfer protocol is described and the implementation in the
HMINET is shown with the functional capabilities and the command
structure.",
}

@ARTICLE{Corn7907:Critical,
AUTHOR="C. O. RNAFION Group",
TITLE="A critical study of different flow control methods in computer
networks",
JOURNAL=ccr,
VOLUME=9,
NUMBER=3,
PAGES="23-32",
MONTH=jul,
YEAR=1979,
REFERENCES=10,
KEYWORDS="Survey; communication network; network flow; process
management; window mechanism",
ANNOTE="The paper is concerned with a didactic overview about most of
the elements involved in the flow control mechanism of a computer
network. Particular attention is given to the presentation of strategies
using the concepts of window and credit.",
}

@PROCEEDINGS{Maur7907:Automata,
TITLE="Automata, languages and programming",
EDITOR="H. Maurer",
PUBLISHER="Springer-Verlag, Berlin",
ADDRESS="Graz",
PAGES="1-683",
NOTE="6th Colloquium, Lecture notes in computer science 71",
MONTH=jul,
YEAR=1979,
KEYWORDS="language processor; programming language; method; special
issue",
}

@ARTICLE{IFIP7907:Implications,
AUTHOR="I. F. IP WG 6.1",
TITLE="Implications of recommendation {X.75} and proposed improvements
for public data network interconnection",
JOURNAL=ccr,
VOLUME=9,
NUMBER=3,
PAGES="33-39",
MONTH=jul,
YEAR=1979,
REFERENCES=5,
KEYWORDS="Communication protocol; X.25; communication network; standard;
X.75",
ABSTRACT="The following document was submitted to CCITT study group VII
by ifip working group 6.1 at the end of 1978. CCITT recommendation X.75
deals with the interconnection of public packet networks.",
}

@TECHREPORT{Hinc7907:Replacement,
AUTHOR="A. J. Hinchley",
TITLE="Replacement of the Port Expander by the Ring Network",
TYPE="Internal Note",
INSTITUTION="UCL",
NUMBER=772,
MONTH=jul,
YEAR=1979,
}

@ARTICLE{7907:Implications,
AUTHOR="I. F. IP WG6. 1",
TITLE="Implications of Recommendation {X.75} and Proposed Improvements
for Public Data Networks",
JOURNAL=ccr,
VOLUME=9,
NUMBER=3,
MONTH=jul,
YEAR=1979,
}

@ARTICLE{Covi7908:Comparative,
AUTHOR="G. J. Coviello",
TITLE="Comparative Discussion of Circuit- vs. Packet-Switched Voice",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=8,
PAGES="1153-1160",
MONTH=aug,
YEAR=1979,
KEYWORDS="packet voice",
ANNOTE="5\% packet loss. Models end-to-end delay as convolution of
exponential distributions.",
}

@ARTICLE{Mino7908:Packet,
AUTHOR="Daniel Minoli",
TITLE="Issues in Packet Voice Communications",
JOURNAL=piee,
VOLUME=126,
NUMBER=8,
PAGES="729-740",
MONTH=aug,
YEAR=1979,
KEYWORDS="packet voice",
ANNOTE="``Speech loss as high as 50\% can be sustained with marginal
degradation if such loss occurs for very small (e.g., 19 ms) segments.
This concept might be employed to control total network traffic in case
of congestion.'' Maximum e-e delay of 200 ms. Presents voice models.
Claims good fit for exponential delay model (800 bit packets at 5
kbits/second).",
}

@ARTICLE{Reis7908:Queueing,
AUTHOR="M. Reiser",
TITLE="A Queueing Network Analysis of Computer Communication Networks
with Window Flow Control",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=8,
PAGES="1199-1209",
MONTH=aug,
YEAR=1979,
ABSTRACT="A computer communication network with window flow control is
modeled by a closed multichain queueing network. The severe
computational limitation of previous solution algorithms is overcome
with a heuristic derived from the recently found mean value analysis. A
large numerical example is given.",
ANNOTE="Congestion control.",
}

@INPROCEEDINGS{Ho7908:Generation,
AUTHOR="C. M. Ho and J. E. Gentle and W. J. Kennedy",
TITLE="Generation of random variates from the multinomial distribution",
BOOKTITLE="Annual Meeting of the American Statistical Association",
ADDRESS="Washington, D.C.",
PAGES="336-339",
MONTH=aug,
YEAR=1979,
KEYWORDS="random variate generation",
}

@INPROCEEDINGS{Kron7908:Generating,
AUTHOR="R. Kronmal and A. V. Peterson",
TITLE="Generating normal random variables using the uniform
alias-rejection-mixture method",
BOOKTITLE="Annual Meeting of the American Statistical Association",
ADDRESS="Washington",
PAGES="250-255",
MONTH=aug,
YEAR=1979,
KEYWORDS="random variate generation",
}

@INPROCEEDINGS{Berr7908:Method,
AUTHOR="L. T. M. Berry",
TITLE="A Method for Solving Steady State Probability Equations",
BOOKTITLE="4th National Conference of the Australian Society for
Operations Research",
MONTH=aug,
YEAR=1979,
KEYWORDS="Method; mathematical method; steady state probability; state
equation; steady state analysis",
}

@TECHREPORT{Bred7908:Mobiltelefonsimulering,
AUTHOR="B. Bredrup and S. Kubosch",
TITLE="Mobiltelefonsimulering for Oslo",
INSTITUTION="Norwegian Computing Center, Norsk Regnesentral",
ADDRESS="Norway",
NUMBER=647,
PAGES=5,
MONTH=aug,
YEAR=1979,
LANGUAGE="Norwegian",
KEYWORDS="mobile radio; cellular system",
}

@ARTICLE{Cohe7908:Multiple,
AUTHOR="J. W. Cohen",
TITLE="The Multiple Phase Service Network with Generalized Processor
Sharing",
JOURNAL=acta,
VOLUME=12,
PAGES="245-284",
MONTH=aug,
YEAR=1979,
KEYWORDS="queueing network",
}

@TECHREPORT{Joll7908:Congestion,
AUTHOR="W. M. Jolley",
TITLE="Congestion Calculations in Link Systems",
TYPE="Traffic Engineering Report",
INSTITUTION="Telecom Australia",
ADDRESS="Australia",
NUMBER=17,
PAGES="53 (paper 10)",
MONTH=aug,
YEAR=1979,
KEYWORDS="Link system",
}

@ARTICLE{Chan7909:Computing,
AUTHOR="Tat Keung Chan and John Lewis",
TITLE="Computing Standard Deviations: Accuracy",
JOURNAL=cacm,
VOLUME=22,
NUMBER=9,
PAGES="526-531",
MONTH=sep,
YEAR=1979,
KEYWORDS="simulation",
}

@ARTICLE{Mari7909:Approximate,
AUTHOR="Raymond Marie",
TITLE="An Approximate Analytical Method for General Queueing Networks",
JOURNAL=ieeese,
VOLUME="SE-5",
NUMBER=5,
PAGES="530-538",
MONTH=sep,
YEAR=1979,
KEYWORDS="approximate solution; equilibrium distribution; performance
evaluation; queueing networks; queueing theory; service time
distribution; queueing theory",
ABSTRACT="We present an approximate solution for the asymptotic behavior
of relatively general queueing networks. In the particular case of
networks with general service time distribution (i.e., fixed routing
matrix, one or many servers per station, FIFO discipline), the
application of the method gives relatively accurate results in a very
short time. The approximate stationary state probabilities are
identified with the solution of a nonlinear system. The proposed method
is applicable to a larger class of queueing networks (dependent routing
matrix, stations with finite capacity, etc.). In this case, the
structure of the network studied must satisfy certain decomposability
conditions.",
}

@INPROCEEDINGS{Wolf7909:Interactive,
AUTHOR="B. Wolfinger",
TITLE="An interactive graphical interface to a computer network modeling
system",
BOOKTITLE="7th ASU conference",
ADDRESS="Cernobbio, Como",
MONTH=sep,
YEAR=1979,
KEYWORDS="Communication network; simulation; simulation model",
ANNOTE="(Simula newsletter 7,3 August 1979) The current trend towards
the decentralization of computer systems is accompanied by an increasing
demand for efficient tools for evaluating a computer network's
performance. An important contribution to the analysis of the quality of
the services offered by a computer network (e.g., Remote job entry,
virtual terminal, virtual file service) consists in the simulation of
data flows within the network.",
}

@INPROCEEDINGS{Gasp79:Simulation,
AUTHOR="A. Gaspar and G. Visontay",
TITLE="Simulation of a packet switched computer network",
BOOKTITLE="7th ASU conference",
ADDRESS="Cernobbio",
MONTH=sep,
YEAR=1979,
KEYWORDS="Simulation; communication network; packet switching; network
congestion; overload control; deadlock; bottleneck",
ANNOTE="(SIMULA Newsletter 7,3 August 1979) The network design of the
Hungarian Academy of Sciences (HAS) is based on a simulation reproducing
foreign experiences. We reviewed our work in the ASM Sigcomm 1978/5. By
applying the very detailed simulation the network designers are able to
observe properly not only the occurrences of critical events and their
sequences but the automatic solutions of them as well (such as losing
packets, overloading",
}

@PROCEEDINGS{Inos79:Evolutions,
TITLE="Evolutions in computer communications",
BOOKTITLE="fourth international conference of computer communication",
EDITOR="H. Inose",
PUBLISHER="North Holland",
ADDRESS="Kyoto",
PAGES="1-842",
MONTH=sep,
YEAR=1979,
KEYWORDS="Communication network; data transmission; special issue",
ANNOTE="Sessions: keynote session. Operating experience of data networks
Internetworking; Mini- and micro-computer applications; Operating
experiences of data networks; Flow control studies; Ring networks and
applications of fiber optics; Issues in computer communications
planning; Computer communication policy and standards; Distributed
processing and software; X.25 protocol; Privacy and security;
Topological design of computer network.",
}

@TECHREPORT{Butt7909:Delay,
AUTHOR="M. Butto and G. Colombo and A. Tonietti",
TITLE="Delay distribution in a data communication system with error
recovery",
INSTITUTION="CSELT Rapporti Tecnici",
VOLUME=7,
NUMBER=3,
PAGES="209-214",
MONTH=sep,
YEAR=1979,
KEYWORDS="Signalling; common channel; CCS; performance evaluation",
}

@TECHREPORT{Mand7909:Conditional,
AUTHOR="A. Mandelbaum and U. Yechiali",
TITLE="The Conditional Residual Service Time in the {M/G/1} Queue",
INSTITUTION="Department of Statistics, University of Tel Aviv",
ADDRESS="Tel Aviv",
MONTH=sep,
YEAR=1979,
}

@ARTICLE{Denn7909:Data,
AUTHOR="D. E. Denning and Denning P. J.",
TITLE="Data Security",
JOURNAL=acmcs,
VOLUME=11,
NUMBER=3,
PAGES="227-250",
MONTH=sep,
YEAR=1979,
}

@ARTICLE{Wald7909:Evolution,
AUTHOR="D. C. Walden and A. A. McKenzie",
TITLE="The evolution of host-to-host protocol techniques",
JOURNAL=ieeecomp,
VOLUME=12,
PAGES="29-37",
MONTH=sep,
YEAR=1979,
}

@ARTICLE{Gros7909:International,
AUTHOR="Gary R. Grossman",
TITLE="Issues in International Public Data Networking",
JOURNAL=cn,
VOLUME=3,
PAGES="259-266",
MONTH=sep,
YEAR=1979,
}

@TECHREPORT{Forg7909:ST,
AUTHOR="James W. Forgie",
TITLE="{ST} - A Proposed {Internet} Stream Protocol",
TYPE="Internet Engineering Note",
INSTITUTION="MIT Lincoln Laboratory",
ADDRESS="Cambridge, Massachusetts",
NUMBER="IEN 119",
MONTH=sep,
YEAR=1979,
KEYWORDS="packet voice; ST-II",
ABSTRACT="The internet stream protocol (ST) described in this document
has been developed to support efficient delivery of streams of packets
to either single or multiple destinations in applications requiring
guaranteed data rates and controlled delay characteristics.  The
principal applications with these requirements are point-to-point speech
communication and voice conferencing.  While ST has been developed as a
part of the ARPA Internet Program and has been formulated as an
extension to the presently defined Internet Protocol (IP), it is not
likely to find useful application in the current ARPA internet
environment where the networks and gateways lack the capacity to handle
significant speech communication.  Instead, ST is aimed at application
in wideband networks, in particular those intended to carry a large
fraction of packet voice in their traffic mixes.  Work is currently
underway on such networks both for local access and long haul use. These
networks will serve as vehicles for research on techniques for flow and
traffic control and as testbeds for evaluating the potential of packet
technology for providing economical speech communication.  The design of
the ST protocol represents a compromise among the sometimes conflicting
requirements of compatibility with the existing IP and the gateways
which handle it, the need for flexibility in supporting flow and traffic
control research, and transmission efficiency.  The concepts in this
protocol originated in the deliberations of a working group consisting
of Danny Cohen, Estil Hoversten, and the author.  They have been
influenced by interactions with many other people.  In order to examine
the cost and feasibility of the protocol, the author has fleshed out
some aspects of the protocol in detail.  The other working group
participants have not had an opportunity to approve or modify these
detailed aspects of the protocol, and consequently all responsibility
for them lies with the author.  The state of the protocol is such that,
while there are still details to be worked out, implementation could
begin if the protocol were acceptable to those interested.",
URL="http://www.normos.org/ietf/ien/ien-119.txt.1",
}

@INPROCEEDINGS{Schr7910:Building,
AUTHOR="H. Schreiber and V. Sigmund",
TITLE="Design of 8086-based building blocks of a multi-microprocessor
special purpose system kit",
BOOKTITLE="Workshop on microcomputing German chapter of the ACM",
ADDRESS="Munich",
MONTH=oct,
YEAR=1979,
KEYWORDS="Multiprocessor system; microprocessor",
}

@ARTICLE{Day7910:Bibliography,
AUTHOR="John Day and C. A. Sunshine",
TITLE="A bibliography on the formal specification and verification of
computer network protocols",
JOURNAL=ccr,
VOLUME=9,
NUMBER=4,
PAGES="23-39",
MONTH=oct,
YEAR=1979,
}

@TECHREPORT{Lisk7910:CLU,
AUTHOR="B. Liskov and R. Atkinson and T. Bloom and E. Moss and C.
Shaffert and B. Scheifler and A. Snyder",
TITLE="{CLU} Reference Manual",
TYPE="MIT/LCS/Technical",
INSTITUTION="MIT, Laboratory for Computer Science",
NUMBER="Report-225",
MONTH=oct,
YEAR=1979,
}

@ARTICLE{Mino7910:Digital,
AUTHOR="Daniel Minoli",
TITLE="Digital Voice Communication Over Digital Radio Links",
JOURNAL=ccr,
VOLUME=9,
NUMBER=4,
MONTH=oct,
YEAR=1979,
KEYWORDS="packet voice",
}

@ARTICLE{Bauw7910:Remarks,
AUTHOR="E. Bauwens and F. Magnee",
TITLE="Remarks on Negotiation Mechanism and Attention Handling",
JOURNAL=ccr,
VOLUME=9,
NUMBER=4,
MONTH=oct,
YEAR=1979,
}

@ARTICLE{Papa7910:Serializability,
AUTHOR="C. H. Papadimitriou",
TITLE="Serializability of Concurrent Database Updates",
JOURNAL=jacm,
VOLUME=26,
NUMBER=4,
PAGES="631-653",
MONTH=oct,
YEAR=1979,
KEYWORDS="Seminal-Serializability",
}

@ARTICLE{Rose7910:Automatic,
AUTHOR="Arnold L. Rosenberg and C. E. Schmidt",
TITLE="Automatic recognition of spoken spelled names for obtaining
directory listings",
JOURNAL=bstj,
VOLUME=58,
NUMBER=8,
PAGES="1797-1823",
MONTH=oct,
YEAR=1979,
REFERENCES=16,
KEYWORDS="speech recognition; directory service; isolated-word
recognition",
ABSTRACT="An automatic speaker-dependent word recognizer is used to
accept strings of spelled letters spoken in isolation. The output of the
recognizer is a set of best-candidate letters for each letter spoken in
the string. Candidate strings forming spelled last names and initials
are compared to name strings obtained from a telephone directory stored
in a disk file. A systematic search is carried out to find matching
entries in the directory. An evaluation has been carried out with ten
talkers spelling lists of names extracted from an 18,000 entry telephone
directory. Although the median acoustic error rate per spelled letter is
approximately 20 percent, the median error rate in furnishing the
requested directory entry is approximately 4 percent.",
}

@INPROCEEDINGS{Grub7911:Delay,
AUTHOR="J. G. Gruber",
TITLE="Delay Related Issues in Integrated Voice and Data Networks --- A
Review and Some Experimental Work",
BOOKTITLE="6th Data Communications Symposium (ACM Sigcomm Computer
Communication Review)",
ORGANIZATION="ACM/IEEE",
ADDRESS="Pacific Grove, California",
PAGES="166-180",
MONTH=nov,
YEAR=1979,
KEYWORDS="packet voice",
}

@ARTICLE{Wein7911:Tradeoff,
AUTHOR="Clifford J. Weinstein and Edward M. Hofstetter",
TITLE="The Tradeoff Between Delay and {TASI} Advantage in a Packetized
Speech Multiplexer",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=11,
PAGES="1716-1720",
MONTH=nov,
YEAR=1979,
KEYWORDS="packet voice; multiplexer; Markov model",
ABSTRACT="A packetized speech multiplexer differs from a
circuit-switched TASI system in that the presence of a packet buffer
allows a tradeoff where the TASI advantage can be increased at a cost in
packet delay. This tradeoff is investigated via a simulation. Results
are presented to show the relations between TASI advantage and delay,
for both an average delay criterion and a maximum delay criterion. It is
shown that, particularly for the case where small number of talkers are
multiplexed, the packetized system offers significant advantages in TASI
advantage over the conventional circuit-switched multiplexer, at modest
cost in packet delay.",
}

@INPROCEEDINGS{Dhad7911:Source,
AUTHOR="V. R. Dhadesugoor and Chaim Ziegler and Donald L. Schilling",
TITLE="Source encoding using delta modulation in packet voice networks",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
VOLUME=1,
PAGES="4.4.1-4.4.5",
MONTH=nov,
YEAR=1979,
KEYWORDS="packet voice; speech communications",
ABSTRACT="The paper discusses the results of experiments that were
performed in the use of delta modulation as a source encoding technique
for use in packet voice networks. It presents the concept of packet loss
as a phenomenon where the receiver is ready and expecting to process a
packet, say packet $i$, and packet $i$ is not to be found at the
receiver. After an appropriate waiting time, the receiver will decide
that the packet is lost and will no longer await nor accept its arrival.
The parameters used in our experiments were packet size $P$, packet loss
rate $r$, and sampling rate, $f\_s$.",
ANNOTE="A packet loss rate of 1\% is not noticeable.",
}

@INPROCEEDINGS{Barb7911:Buffer,
AUTHOR="G. Barberis and Daniele Pazzaglia",
TITLE="Analysis, design and buffer sizing of a packet voice receiver",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
VOLUME=1,
PAGES="4.5.1-4.5.5",
MONTH=nov,
YEAR=1979,
KEYWORDS="packet voice; queueing analysis",
ABSTRACT="Some analytical tools are developed for the analysis and the
design of a packet voice receiver.  The delay suffered by packets
because of the reassembly mechanism is described in terms of the overall
delay probability density function $w(t)$.  This basic analytical result
is used in order to achieve the probability density function $b(t)$ of
the time spent by packets in the receiver buffer. The analytical
calculations are developed in wide statistical environments, matching
quite well with the real system behavior especially in the case of
highly dynamic routing schemes.  The tools here developed allow an
optimal design of the packet receiver and a choice of the buffer size at
the prescribed level of packets-loss probability.  Some numerical
results are presented showing the effectiveness of the analytical
techniques given to the designer by this work.",
}

@INPROCEEDINGS{Tana7911:Packet,
AUTHOR="H. Tanaka and C. K. Chan and M. Dressler and V. R. Dhadesugoor
and C. V. Chakravarthy and Donald L. Schilling",
TITLE="Design of a packet voice transmission system",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
VOLUME=1,
PAGES="13.1.1-13.1.5",
MONTH=nov,
YEAR=1979,
KEYWORDS="packet voice",
ABSTRACT="This paper describes the design of a packet voice network and
the results of the evaluation tests performed. The packet voice network
was simulated on a PDP 11/34 computer for real-time operation. Adaptive
delta modulators were used as source encoders. The average packet
transmission rate and the subjective quality of the processed speech are
presented.",
ANNOTE="Simple fixed playout delay; see also cite{Dhad79:Source}",
}

@INPROCEEDINGS{Dhad7911:Delta,
AUTHOR="V. R. Dhadesugoor and Chaim Ziegler and C. V. Chakravarthy and
Donald L. Schilling",
TITLE="Delta modulation packet voice network with a variable packet size
algorithm",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
VOLUME=1,
PAGES="13.2.1-13.2.5",
MONTH=nov,
YEAR=1979,
KEYWORDS="packet voice; silence detection",
ABSTRACT="The paper discusses the results of experiments in the use of
variable packet sizes in packet voice networks. Also shown is the
silence detection algorithm which makes use of the bit pattern at the
output of the delta modulator encoder, receiver compensation algorithm
during silent periods. The distribution of the packet size is plotted
and the packet transmission rate and effective bit rate is computed. The
authors conclude that the effective bit rate was reduced when silent
periods are not transmitted.",
}

@INPROCEEDINGS{Gitm7911:Sensitivity,
AUTHOR="I. Gitman and B. Occhiogrosso and W. Hsieh and H. Frank",
TITLE="Sensitivity of integrated voice and data networks to traffic and
design variables",
BOOKTITLE="Proceedng of the 6th Data Communications Symposium",
ORGANIZATION="ACM and IEEE",
ADDRESS="Pacific Grove, California",
PAGES="181-192",
MONTH=nov,
YEAR=1979,
KEYWORDS="packet voice; economic models; integrated services",
ABSTRACT="This paper presents quantitative results of cost/performance
studies of circuit-switching, packet-switching and hybrid
(circuit/packet) switching technologies. The results expose the cost
difference for alternative realizations and usage of a given network
technology.",
}

@INPROCEEDINGS{John7911:Local,
AUTHOR="Don Johnson and Gerald C. O'Leary",
TITLE="A local access network for packetized digital voice
communication",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
PAGES="13.4.1-13.4.5",
MONTH=nov,
YEAR=1979,
KEYWORDS="packet voice; local area networks; multiple access; CSMA;
p-persistent",
ABSTRACT="This paper presents a technique for connecting a large number
of packetized digital speech terminals using a common wideband broadcast
transmission medium. Access to the cable is controlled by a
carrier-sense multiple access protocol which is designed to exploit the
characteristics of speech traffic. A description of the statistical
characteristics of digitized speech traffic is given. A network based on
these principles is described. Theoretical and simulated performance
characteristics are presented and compared. The design results in a
network which is competitive with TDMA in its utilization of channel
capacity but at the same time provides a greater degree of
flexibility.",
}

@INPROCEEDINGS{Tsuk7911:Integrated,
AUTHOR="Kei-ichi Tsukada and Y. Yoshida and Ken-ichi Yukimatsu and
Hiroyuki Ohnishi",
TITLE="Integrated services data switching network",
BOOKTITLE="6th Data Communications Symposium",
ORGANIZATION="ACM and IEEE",
ADDRESS="Pacific Grove, California",
PAGES="159-165",
MONTH=nov,
YEAR=1979,
KEYWORDS="integrated services; traffic characteristics",
ABSTRACT="Domestic public networks for telecommunications services in
Japan are now provided by telephone and telex networks of Nippon
Telegraph \\& Telephone Public Corporation (NTT). Further, NTT will
start to provide the new public data switching networks (CSDN) and a
packet switched network (PSDN) soon in 1979. For the present time being,
a separate network needs to be available for each of telephone, data
communications, facsimile communications and so on. However, service
integration will be desirable in future for the purpose of user's
convenience and network economy. In this paper, service integration of
voice, daa and facsimile communications is studied from the viewpoint of
developing the data switching networks to integrated services networks
which could handle various types of information transmission. First,
requirements from the user's and carrier's points of view are described.
Integrated services networks must handle various calls with different
traffic characteristics and meet different service grades in accordance
with each type of calls. Considering such environments, many network
morphological alternatives are listed as regards data switching network
integration and data-telephone network integration, and network
functions associated with service integration and developed within or
around data switching networks are explained. Last, two experimental
systems are described as some approaches to integrated services data
networks.",
}

@INPROCEEDINGS{Ross7911:Approaches,
AUTHOR="Myron J. Ross and C. M. Sidlo",
TITLE="Approaches to the integration of voice and data in
telecommunications",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
PAGES="46.6.1-46.6.8",
MONTH=nov,
YEAR=1979,
KEYWORDS="integrated services; packet voice",
ABSTRACT="New approaches to integrated voice and data communications are
compared in terms of two main network performance parameters:
transmission efficiency, and delay. The generic families of packet and
hybrid (circuit/packet) switching systems are examined to determine how
to best meet the goals of stable and consistent performance over a wide
range of user demands, and the flexibility to accomodate new technology
and new approaches. A flexible hybrid approach, in which voice and data
are packet switched and bulk data is circuit switched, appears to
possess many of the advantages of both the packet and hybrid switching
concepts.",
}

@ARTICLE{Merl7911:Specification,
AUTHOR="Philip M. Merlin",
TITLE="Specification and validation of protocols",
JOURNAL=ieeecom,
VOLUME="COM-27",
NUMBER=11,
PAGES="1671-1680",
MONTH=nov,
YEAR=1979,
KEYWORDS="protocol verification; protocol specification; network
protocols; formal methods",
ABSTRACT="Complex protocols are used to coordinate remote activities in
computer networks. To insure proper operation, formal techniques of
protocol definition and validation have been proposed, and developed to
the point that they can be applied to actual protocols. However, much
work remains to be done in order to cope with protocols of
ever-increasing complexity; in particular, those coordinating the
activities of many interacting entities. The characteristics that
determine the applicability of the different specification and
validation techniques to a protocol will be discussed. We will define
the ``topology'' of a protocol, and treat also protocols that are
intended to work in a variety of configurations, as well as
configurations which may change in time (i.e., ``evolving topologies'').
Finally, based on this new general point of view, a short survey of
specification and validation techniques will be presented, and the
extensions needed to handle complex protocol characteristics will be
discussed.",
}

@INPROCEEDINGS{Daig7911:Preemptive,
AUTHOR="J. N. Daigle and C. E. Houstis",
TITLE="A preemptive priority queueing analysis with application to a
terminal controller in a communications environment",
BOOKTITLE=ntc,
ADDRESS="Washington",
VOLUME=1,
PAGES="1-6 (13.3)",
MONTH=nov,
YEAR=1979,
KEYWORDS="Queueing system; priority; analysis",
}

@ARTICLE{Kron7911:Alias,
AUTHOR="R. Kronmal and A. V. Peterson",
TITLE="On the alias method for generating random variables from a
discrete distribution",
JOURNAL="The American Statistician",
VOLUME=33,
NUMBER=4,
PAGES="214-218",
MONTH=nov,
YEAR=1979,
KEYWORDS="random variate generation",
}

@ARTICLE{Pitt7911:Closed,
AUTHOR="B. Pittel",
TITLE="Closed exponential networks of queues with saturation: The
Jackson-type stationary distribution and its asymptotic analysis",
JOURNAL=mor,
VOLUME=4,
NUMBER=4,
PAGES="357-378",
MONTH=nov,
YEAR=1979,
KEYWORDS="Queueing network; product form; analysis",
}

@INPROCEEDINGS{Wood7911:Cable,
AUTHOR="D. C. Wood and S. F. Holmgress and A. P. Skelton",
TITLE="A cable bus protocol architecture",
BOOKTITLE="6th data Communication Symposium",
PAGES="137-146",
MONTH=nov,
YEAR=1979,
}

@INPROCEEDINGS{Croc7911:Inter,
AUTHOR="D. H. Crocker and E. Szurkowski and D. Farber",
TITLE="An Inter-network Memo Distribution {Capability--MMDF}",
BOOKTITLE="6th Data Communications Symposium",
PUBLISHER="CSNET Design",
NOTE="Published as Proceedings of the 6th Data Communications Symposium,
number DN-3",
MONTH=nov,
YEAR=1979,
}

@TECHREPORT{Bord7911:MH,
AUTHOR="B. S. Borden and  others",
TITLE="The {MH} Message Handling System",
TYPE="Project Airforce document",
INSTITUTION="RAND",
ADDRESS="Santa Monica, California",
MONTH=nov,
YEAR=1979,
KEYWORDS="MH; electronic mail",
}

@INPROCEEDINGS{Shoc7911:Interconnecting,
AUTHOR="John F. Shoch and L. Stewart",
TITLE="Interconnecting Local Networks via the Packet Radio Network",
BOOKTITLE="6th Data Communications Symposium",
ADDRESS="Pacific Grove, California",
PAGES="153-158",
MONTH=nov,
YEAR=1979,
}

@INPROCEEDINGS{McQu7911:Overview,
AUTHOR="J. M. McQuillan and I. Richer and E. C. Rosen",
TITLE="An Overview of the New Routing Algorithm for the Arpanet",
BOOKTITLE="6th Data Communications Symposium",
ADDRESS="Pacific Grove, CA, USA",
PAGES=6,
MONTH=nov,
YEAR=1979,
KEYWORDS="Packet switching; ARPANET; routing",
}

@INPROCEEDINGS{Mowa7912:Integrated,
AUTHOR="Osama A. Mowafi and William J. Kelly",
TITLE="Integrated voice/data packet switching techniques for future
military networks",
BOOKTITLE=cns,
ORGANIZATION="IEEE",
ADDRESS="Gaithersburg, Maryland",
PAGES="216-223",
MONTH=dec,
YEAR=1979,
KEYWORDS="integrated services; packet voice; military networks",
ABSTRACT="Virtual Circuit and pure packet (datagram) based switching
techniques are studied for future application to the integrated
voice/data telecommunications. The coexistence of voice with both
interactive and bulk data in an integrated network suggests the
desireability of a mixed switching technique to allow the efficient
sharing of both the switching and communications resources. Such mixed
Packet Switching scheme is also evaluated. It uses virtual circuit for
regular traffic (voice and bulk data), and uses pure packet (datagram)
for bursty traffic (interactive and query/response). It also adapts to
changes in voice/data input traffic mixture.",
}

@ARTICLE{Sieg7912:Model,
AUTHOR="H. J. Siegel",
TITLE="A model of {SIMD} machines and a comparison of various
interconnection networks",
JOURNAL=ieeetc,
VOLUME="C-28",
NUMBER=12,
PAGES="907-917",
MONTH=dec,
YEAR=1979,
KEYWORDS="computer architecture; algorithm correctness; array
processors; Illiac IV; interconnection networks; n-cube array; parallel
processing; perfect shuffle; permutation networks; SIMD machines;
STARAN",
ABSTRACT="A formal mathematical model of single instruction stream --
multiple data stream (SIMD) machines is defined. It is used as a basis
for analyzing various types of interconnection networks that have been
discussed in the literature. The networks are evaluated in terms of the
lower and upper bounds on the time required for each of the networks
discussed to simulate the other networks. SIMD machine algorithms are
presented as proofs of the upper time bounds on these simulation tasks.
These simulations are used to demonstrate techniques for proving the
correctness of SIMD machine algorithms, i.e., analyzing the simultaneous
flow of $N$ data items among $N$ processors. Processor address masks, a
concise notation for activating and deactivating processors, are used in
the algorithms. The methods used to prove the lower bounds and to
construct (and prove correct) simulation algorithms to show the upper
bounds can be generalized and applied to the analysis of other
networks.",
}

@INPROCEEDINGS{Marx7912:Event,
AUTHOR="E. Marx",
TITLE="Event-by-event models of communication networks",
BOOKTITLE="Computer network symposium",
ADDRESS="Gaithersburg, Maryland",
MONTH=dec,
YEAR=1979,
KEYWORDS="Simulation; packet switching; circuit switching; GPSS",
}

@ARTICLE{Denn7912:Editor,
AUTHOR="P. J. Denning",
TITLE="Editor's Overview -- Special Section on Data Encryption",
JOURNAL=acmcs,
VOLUME=11,
NUMBER=4,
PAGES="283-284",
MONTH=dec,
YEAR=1979,
}

@PHDTHESIS{Luni7912:Architecture,
AUTHOR="Allen W. Luniewski",
TITLE="The Architecture of an Object Based Personal Computer",
SCHOOL="Massachusetts Institute of Technology, Dept. Electrical
Engineering and Computer Science",
ADDRESS="Cambridge, Massachusetts",
MONTH=dec,
YEAR=1979,
}

@INPROCEEDINGS{Bert7912:Dynamic,
AUTHOR="D. P. Bertsekas",
TITLE="Dynamic Models of Shortest Path Routing Algorithms for
Communication Networks with Multiple Destinations",
BOOKTITLE="IEEE Conference",
ADDRESS="Ft. Lauderdale, Florida",
PAGES="127-133",
MONTH=dec,
YEAR=1979,
}

@ARTICLE{Lisk7912:Primitives,
AUTHOR="B. Liskov",
TITLE="Primitives for Distributed Computing",
JOURNAL=acmosrev,
VOLUME=13,
NUMBER=5,
PAGES="33-42",
MONTH=dec,
YEAR=1979,
ABSTRACT="Defines 'guardian': a combination of processes and objects
(data) residing on one node, possibly with specific tasks. Inside one
guardian all memory is shared. There is no shared memory between
guardians, only message passing.",
}

@ARTICLE{Bent7912:Data,
AUTHOR="Jon Louis Bentley and Jerome H. Friedman",
TITLE="Data Structures for Range Searching",
JOURNAL=acmcs,
VOLUME=11,
NUMBER=4,
PAGES="397-409",
MONTH=dec,
YEAR=1979,
}

@INPROCEEDINGS{Giff7912:Weighted,
AUTHOR="D. K. Gifford",
TITLE="Weighted Voting for replicated data",
BOOKTITLE=sosp,
PAGES="150-162",
MONTH=dec,
YEAR=1979,
KEYWORDS="Voting",
}