@ARTICLE{Ahre80:Sampling,
AUTHOR="J. Ahrens and U. Dieter",
TITLE="Sampling from Binomial and Poisson Distributions: A Method with
Bounded Computation Times",
JOURNAL=comp,
VOLUME=25,
NUMBER=3,
PAGES="193-208",
YEAR=1980,
KEYWORDS="simulation",
ANNOTE="provides FORTRAN source",
}

@ARTICLE{Fred8007:Congestion,
AUTHOR="A. Fredericks",
TITLE="Congestion in Blocking Systems --- A Simple Approximation
Technique",
JOURNAL=bstj,
VOLUME=59,
NUMBER=6,
PAGES="805-827",
MONTH="July--August",
YEAR=1980,
KEYWORDS="queueing theory",
ABSTRACT="In the study of congestion in complex stochastic server
systems, it is often desirable to have simple techniques available for
obtaining approximations to important quantities of interest. This is
particularly true in the early stages of the systems analysis and in
cases where the only ``solution'' will be via a simulation. In this
paper, the author presents an extremely simple, but surprisingly useful,
technique for the approximate analysis of some such systems. Beginning
with an approximation for the blocking of overflow traffic that was
originally proposed by W. S. Hayward, we develop a natural extension to
the approximation of blocking in a more general system as well as the
determination of other (than blocking) quantities of interest. For the
special, but important, case of renewal input to exponential servers,
the author gives an explicit asymptotic (for heavy traffic)
representation of the error introduced by this approximation.",
}

@BOOK{Gele80:Synthesis,
AUTHOR="E. Gelenbe and I. Mitrani",
TITLE="Analysis and Synthesis of Computer Systems",
PUBLISHER="Academic Press",
ADDRESS="London",
YEAR=1980,
}

@BOOK{Grad80:Table,
AUTHOR="Izrail Solomonovich Gradshtein and Iosif Moiseevich Ryzhik",
TITLE="Table of Integrals, Series, and Products",
PUBLISHER="Academic Press",
ADDRESS="San Diego, California",
YEAR=1980,
}

@ARTICLE{Heff8007:Class,
AUTHOR="H. Heffes",
TITLE="A Class of Data Traffic Processes --- Covariance Function
Characterization and Related Queueing Results",
JOURNAL=bstj,
VOLUME=59,
NUMBER=6,
PAGES="897-929",
MONTH="July-August",
YEAR=1980,
KEYWORDS="queueing theory",
ABSTRACT="While the ``call'' or ``session'' is the basic entity that is
set up in many data traffic applications, the performance analysis of
data network elements depends on the internal units of traffic into
which calls are decomposed. In a packet-switching network, the packet
represents the basic internal unit of traffic, and packets from
different calls time-share facilities and contend for network resources,
giving rise to queueing delays. In this paper, the author considers the
problem of characterizing the doubly stochastic packet process resulting
from a superposition of call types, each type having a stochastically
varying number of calls in progress. The author obtains statistical
properties of the process and use them to obtain an approximating
process, based in part upon time constants associated with the
packet-rate covariance function. The author discusses existing queueing
models dealing with this approximating class of inputs and presents
results showing the effect of call and packet traffic parameters on
queueing performance.",
}

@BOOK{Prab80:Stochastic,
AUTHOR="Narahari Umanath Prabhu",
TITLE="Stochastic Storage Processes --- Queues, Insurance Risk, and
Dams",
SERIES="Applications of Mathematics",
PUBLISHER="Springer-Verlag",
ADDRESS="New York, New York",
VOLUME=15,
YEAR=1980,
KEYWORDS="stochastic processes; probability theory; dams",
}

@INPROCEEDINGS{Senc80:Viewpoint,
AUTHOR="M. Akin Sencer and David Baker",
TITLE="A viewpoint on packet-switched voice networks",
BOOKTITLE=iccc,
ORGANIZATION="International Council for Computer Communication",
PAGES="287-294",
YEAR=1980,
KEYWORDS="packet voice",
ABSTRACT="Recent interest in the packet switching of voice motivates
examination of this topic. First, a technical perspective will be
obtained by the following steps: i) rationale for packet switching of
voice, ii) packet network characteristics, and iii) voice communication
performance requirements (a broadened criterion for choosing voice
packet length is suggested). Secondly, recently-published significant
results on packet voice networks are assessed. Then, a viewpoint
reflecting total system cost (not tariffs), including local distribution
is advocated. It is shown that a cost-based approach will bring the
network technology choices closer together, and will point to some still
unanswered questions.",
}

@ARTICLE{Cohe8001:Flow,
AUTHOR="Danny Cohen",
TITLE="Flow control for real-time communication",
JOURNAL=ccr,
VOLUME=10,
NUMBER="1--2",
PAGES="41-47",
MONTH="January/April",
YEAR=1980,
KEYWORDS="flow control; congestion control; real-time traffic",
ABSTRACT="Flow control is a problem of resource allocation in
communication systems; typically the critical resources are the
bandwidth of the medium, memory space and processing capabilities.
Traditionally, protecting the resources of the communicating processes
is called flow control, and the protecting of the communication system
is called congestion control. Hence, the flow control is the protection
of one process from the others, and the congestion control is protection
of the communication system from the processes. This note argues that
real-time communication requires different flow control and congestion
control schemes than the familiar ones used for non-real-time
communication.",
ANNOTE="distinguishes 'milk rule' (discard oldest) from 'wine rule'
(discard youngest)",
}

@INCOLLECTION{Rice80:Computer,
AUTHOR="Ronald E. Rice",
TITLE="Computer Conferencing",
BOOKTITLE="Progress in Communication Sciences",
EDITOR="Brenda Dervin and Melvin J. Volgt",
PUBLISHER="Ablex Publishing Corporation",
ADDRESS="Norwood, New Jersey 07648",
VOLUME="II",
PAGES="215-240",
YEAR=1980,
KEYWORDS="CSWC; electronic mail; computer conferencing",
ABSTRACT="Overview of computer conferencing systems",
}

@ARTICLE{Lede80:Digital,
AUTHOR="Joshua Lederberg",
TITLE="Digital Communications and the Conduct of Science: The New
Literacy",
JOURNAL="Human Systems Management",
VOLUME=1,
PAGES="29-37",
YEAR=1980,
KEYWORDS="CSWC; electronic mail; eugram; computer conferencing",
ABSTRACT="This essay is a personal perspective on the emergence of a new
form of communication, optimistically call the 'eugram'. This form is
based on the convergence of economical digital communications with
computer aided facilities for file management, and protocols to
facilitate the interconnection of users separated both in time and
space. The eugram is contrasted with the telephone, with the latter's
demands on instant availability and the subjugation of the user to an
almost uninterruptable stream of data. The eugram is expected to
increase the thoughtfulness of communication, the return of literacy in
the efficient and precise use of language, and to enhance discourse in
many other ways.",
}

@MISC{Hilt80:Evolution,
AUTHOR="Starr Roxanne Hiltz and Murray Turoff",
TITLE="The Evolution of User Behavior in Computerized Communications
Systems",
NOTE="Paper presented to {\em International Communication Association,
Acapulco, Mexico}",
YEAR=1980,
KEYWORDS="human factors; computer conferencing",
}

@ARTICLE{Beau80:Packets,
AUTHOR="Leland Beaumont and James C. Ehlinger and Gottfried Luderer",
TITLE="Packets put more on the line",
JOURNAL=attr,
PAGES="11-17",
YEAR=1980,
KEYWORDS="packet switching",
ABSTRACT="The No. 1 packet switching system fills idle moments in a call
with data from other calls.",
}

@BOOK{Clau80:Grundgebiete,
AUTHOR="Horst Clausert and Gunther Wiesemann",
TITLE="Grundgebiete der Elektrotechnik",
PUBLISHER="Verlag Berliner Union GmbH and Verlag Kohlhammer",
ADDRESS="Stuttgart",
VOLUME="1 and 2",
YEAR=1980,
}

@BOOK{Elec80:Electronics,
TITLE="Electronics Circuit Designer's Casebook",
EDITOR="Electronics",
PUBLISHER="McGraw-Hill",
ADDRESS="New York",
YEAR=1980,
}

@ARTICLE{Shoc80:Measured,
AUTHOR="John F. Shoch and J. A. Hupp",
TITLE="Measured performance of an Ethernet local network",
JOURNAL=cacm,
VOLUME=23,
PAGES="711-721",
YEAR=1980,
REFERENCES=21,
KEYWORDS="performance evaluation; model; queueing network; packet",
ANNOTE="The ethernet communications network is a broadcast, multiaccess
system for local computer networking, using the techniques of carrier
sense and collision detection. Recently we have measured the actual
performance and error characteristics of an existing ethernet
installation which provides communications services to over 120 directly
connected hosts to network. This paper is a report on some of those
measurements.",
}

@BOOK{Sipp80:Essential,
AUTHOR="C. J. Sippl and J. Mayer",
TITLE="The essential computer dictionary and speller for secretaries,
managers, and office personnel",
PUBLISHER="Prentice-Hall",
ADDRESS="Englewood Cliffs, New Jersey",
PAGES=258,
YEAR=1980,
KEYWORDS="Reference",
ANNOTE="A ten-page prolog provides a survey of state-of-the-art
developments written in reasonably everyday language. What follows is a
250 page glossary of terms.",
}

@ARTICLE{Soko80:Three,
AUTHOR="D. Sokol and J. Shepard",
TITLE="Three-dimensional graphics for the Apple {II}",
JOURNAL=byte,
VOLUME=5,
NUMBER=11,
PAGES="148-150",
YEAR=1980,
KEYWORDS="Graphics; three-dimensional plot; design; process",
}

@ARTICLE{Stew80:Existence,
AUTHOR="W. J. Stewart and G. A. Zeiszler",
TITLE="On the existence of composite flow equivalent Markovian servers",
JOURNAL=per,
VOLUME=9,
NUMBER=2,
PAGES="105-116",
YEAR=1980,
REFERENCES=14,
KEYWORDS="Closed queueing network; model; queueing network",
ANNOTE="Queueing networks have been used to model a large variety of
complex systems. However, once a realistic model has been constructed it
has generally been necessary to distort and modify it so that an
analytic solution could be obtained. Unfortunately, the analytic
solution often has little relation to the original queueing system and
consequently often produces solutions with poor accuracy.",
}

@ARTICLE{Suth80:Optimality,
AUTHOR="William R. Sutherland",
TITLE="Optimality in transient Markov chains and linear programming",
JOURNAL="Mathematics Programming",
VOLUME=18,
NUMBER=1,
PAGES="1-6",
YEAR=1980,
KEYWORDS="Markov process; linear optimization; transient Markov chain",
ANNOTE="The author uses linear programming arguments rather than dynamic
programming arguments to discuss optimality for discrete Markov
programming problems.",
}

@ARTICLE{Swar80:Polling,
AUTHOR="G. B. Swartz",
TITLE="Polling in a loop system",
JOURNAL=jacm,
VOLUME=27,
NUMBER=1,
PAGES="42-59",
YEAR=1980,
REFERENCES=4,
KEYWORDS="Communication network; queueing system; polling",
ANNOTE="A communication system consisting of $n$ buffered input
terminals connected to a computer by a single channel is analyzed. The
terminals are polled in sequence. Data are removed one unit at a time
from the terminal's buffer. When the buffer has been emptied, the
channel is used for system overhead for a randomly determined length of
time. The system continues with a pol of the next terminal. The
stationary distributions of waiting times and queue",
}

@ARTICLE{Taka80:Queues,
AUTHOR="L. Takacs",
TITLE="Queues with infinitely many servers",
JOURNAL=rairo,
VOLUME=14,
NUMBER=2,
PAGES="109-113",
YEAR=1980,
KEYWORDS="G/G/oo; number of elements in system",
ANNOTE="In the time interval (0, infinite) calls arrive in a telephone
exchange in accordance with a recurrent process. There are an unlimited
number of available lines. The holding times are mutually independent
and identically distributed positive random variables and are
independent of the arrival times. In this paper we determine the limit
distribution of the number of the busy lines at the arrival of the n-th
call as $n$ to infinite.",
}

@TECHREPORT{Tijm80:Computational,
AUTHOR="H. Tijms and M. H. Hoorn",
TITLE="Computational methods for single-server and multi-server queues w
ith random and quasi random input",
TYPE="Research Report",
INSTITUTION="Free University Amsterdam",
ADDRESS="Amsterdam, Holland",
NUMBER=59,
PAGES=23,
YEAR=1980,
REFERENCES=33,
KEYWORDS="M/G/S; recursion method; method; M/G/1; steady state",
ANNOTE="We first consider a wide class of single-server queues with
state dependent Markovian input including the finite capacity m/g/1
queue and the machine servicing problem. We specify efficient and stable
algorithms to compute the state probabilities and the moments of the
waiting time. Next we discuss the multi-server queue with poisson input
and general service times. We present for the state probabilities good
quality approximations to be comput",
}

@ARTICLE{Toba80:Two2,
AUTHOR="F. A. Tobagi",
TITLE="Analysis of a two-hop centralized packet radio network - part 2:
carrier sense multiple access",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="208-216",
YEAR=1980,
REFERENCES=5,
KEYWORDS="broadcast; communication; packet switching; busy sense",
ANNOTE="Traffic originates at terminals, is destined to a central
station, and requires for its transport the relaying of packets by
store-and-forward repeaters. We consider here that all devices employ
the nonpersistent carrier sense multiple-access mode. System capacity
and throughput-delay tradeoffs are derived and compared to those
obtained for slotted aloha in part 1 (1).",
}

@ARTICLE{Toba80:Multiaccess,
AUTHOR="F. A. Tobagi",
TITLE="Multiaccess protocols in packet communication systems",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="468-488",
YEAR=1980,
REFERENCES=72,
KEYWORDS="Survey; packet switching; communication protocol",
ANNOTE="We give in this paper a unified presentation of the various
multiaccess techniques which we group into five categories: 1) fixed
assignment techniques, 2) random access techniques, 3) centrally
controlled demand assignment techniques, 4) demand assignment techniques
with distributed control, and 5) mixed strategies. We discuss their
applicability to different environments, namely, satellite channels,
local area communication networks and mu",
}

@ARTICLE{Toba80:Two1,
AUTHOR="F. A. Tobagi",
TITLE="Analysis of a two-hop centralized packet radio network - part 1:
carrier sense multiple access",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="196-207",
YEAR=1980,
REFERENCES=24,
KEYWORDS="ALOHA; broadcast; communication; packet switching; packet",
ANNOTE="A two-hop centralized configuration is considered in which
traffic originates at terminals, is destined to a central station, and
requires for its transport the relaying of packets by store-and-forward
repeaters. The throughput-delay performance is derived, and its
dependence on such key system variables as the network topology, the
transmission protocol, and the repeaters' storage capacities, is
given.",
}

@ARTICLE{Toba80:Carrier,
AUTHOR="F. A. Tobagi and V. B. Hunt",
TITLE="Performance analysis of carrier sense multiple access with
collision detection",
JOURNAL=cn,
VOLUME=4,
PAGES="245-259",
YEAR=1980,
KEYWORDS="Lan; csma/cd",
}

@BOOK{Tobi80:Language,
TITLE="Language design and programming methodology",
EDITOR="J. M. Tobias",
SERIES="Lecture notes in computer science",
PUBLISHER="Springer-Verlag",
ADDRESS="Berlin, Germany",
VOLUME=79,
PAGES=255,
YEAR=1980,
KEYWORDS="Design; programming language; method; program construction",
}

@ARTICLE{Toda80:DCNA,
AUTHOR="I. Toda",
TITLE="{DCNA} higher level protocols",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="575-584",
YEAR=1980,
REFERENCES=13,
KEYWORDS="Digital network; packet switching; virtual channel",
ANNOTE="To specify higher level protocols among computers of different
types, dcna defines a logical model of a computer network consisting of
three submodels: the basic model, the logical network model, and the
virtual network model. The basic model represents a logical view of the
network resources, e.g., processing power, files, data bases, I/O
devices, and a layered structure for the basic mechanisms for accessing
such resources, which incorporate \ldots",
}

@ARTICLE{Tows80:Queueing,
AUTHOR="Donald F. Towsley",
TITLE="Queueing network models with state-dependent routing",
JOURNAL=jacm,
VOLUME=27,
PAGES="323-337",
YEAR=1980,
REFERENCES=19,
KEYWORDS="Model; routing algorithm; closed queueing network; product",
ANNOTE="A model of a closed queueing network within which customer
routing between queues may depend on the state of the network is
presented. The routing functions allowed may be rational functions of
the queue lengths of various downstream queues which reside within
special subnetworks called p-subnetworks. If a network with no
state-dependent routing has a product-form joint equilibrium
distribution of the queue lengths, then the introduction of the",
}

@ARTICLE{Uchi80:Digital,
AUTHOR="T. Uchiyama",
TITLE="Digital data switching control system",
JOURNAL=recl,
VOLUME=28,
PAGES="338-349",
YEAR=1980,
KEYWORDS="Data switching; circuit switching; control processor",
}

@TECHREPORT{Urmo80:Reduktion,
AUTHOR="W. Urmoneit",
TITLE="Reduktion des Ranges von linearen Gleichungssystemen zur
Berechnung der Verlustwahrscheinlichkeit von vielstufigen
Koppelanordnungen",
TYPE="25. Bericht ber verkehrstheoretische Arbeiten",
INSTITUTION="University Stuttgart, Germany",
ADDRESS="Stuttgart, Germany",
PAGES=334,
YEAR=1980,
LANGUAGE="German",
REFERENCES=24,
KEYWORDS="Matrix; communication network; switching network; reduction",
ANNOTE="In modern switching systems, connections between telephone
subscribers are frequently established via multistage switching
networks. The number of unknowns (probabilities for the stage patterns)
occurring with the exact calculation is very great. To enable such an
excessively strong reduction of the number of unknowns in the linear
system of equations to be solved, a generally valid algorithm has to be
found. Such methods are developed",
}

@TECHREPORT{Hoor80:Algorithms,
AUTHOR="M. van Hoorn",
TITLE="Algorithms for the state probabilities in a general class of
single server queueing systems with group arrivals",
TYPE="Research Report",
INSTITUTION="Free University Amsterdam",
ADDRESS="Amsterdam, Holland",
NUMBER=56,
PAGES=12,
YEAR=1980,
REFERENCES=17,
KEYWORDS="MX/G/1; recursion method; method; steady state probability",
ABSTRACT="In this paper we present an algorithmic analysis of a single
server queueing system with general service times, where customers
arrive in groups according to a poisson process. The group size
distribution is state dependent. Using regenerative analysis we derive a
numerically stable recursive scheme to compute the state probabilities.
As application we discuss the computation of operating characteristics
for a finite capacity M/G/1 queue",
}

@ARTICLE{Tits80:Simulation,
AUTHOR="M. van Tits and H. van der Veeken",
TITLE="Simulation of a queueing problem with balking",
JOURNAL=simuletter,
VOLUME=11,
NUMBER=2,
PAGES="58-64",
YEAR=1980,
REFERENCES=7,
KEYWORDS="M/M/1; M/G/1; waiting time; continuous simulation; time
sequencing; discrete event simulation; model; independent cycles;
balking",
ANNOTE="Queueing theory becomes considerably more complicated if
impatient customers fail to join the queue, so-called balking.
Analytical results have been obtained for the standard queueing problem
(M/M/1) with balking, i.e., Formulae have been derived for the expected
queue-length and the expected waiting-time. This report describes an
investigation into the general validity of these formulae. Since an
analytical approach to the problem has so far \ldots",
}

@ARTICLE{Vant80:Near,
AUTHOR="H. Vantilborgh and R. L. Garner and E. D. Lazowska",
TITLE="Near-complete decomposability of queueing networks with clusters
of strongly interacting servers",
JOURNAL=per,
VOLUME=9,
NUMBER=2,
PAGES="81-92",
YEAR=1980,
REFERENCES=7,
KEYWORDS="Queueing network; model; interdependence; decomposition",
ANNOTE="The near-complete decomposability of queueing network models of
computer systems is generally supported by very large differences in the
service rates of the servers. In this paper we show how such models may
still be nearly completely decomposable if on the one hand these large
differences can no longer be realistically assumed (as is the case, for
example, in computer networks) but if on the other hand clusters of
strongly interacting servers",
}

@ARTICLE{Vary80:Fast,
AUTHOR="P. Vary",
TITLE="Fast digital frequency response measurement with multi-frequency
signals",
JOURNAL=aeu,
VOLUME=34,
PAGES="190-195",
YEAR=1980,
KEYWORDS="Digital signal processing",
}

@ARTICLE{Walk80:Zum,
AUTHOR="B. Walke",
TITLE="Zum Stand der Paketvermittlungstechnik",
JOURNAL=aeg,
VOLUME=53,
PAGES="111-135",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Packet switching",
}

@ARTICLE{Wang80:Intrinsic,
AUTHOR="Yixin Wang",
TITLE="Analysis of an intrinsic overload control for a class of queueing
systems",
JOURNAL=per,
VOLUME=9,
NUMBER=2,
PAGES="235-243",
YEAR=1980,
REFERENCES=4,
KEYWORDS="Queueing network; priority; overload control; performance",
ANNOTE="We consider a priority queueing system which consists of two
queues sharing a processor and in which there is delayed feedback. Such
a model arises from systems which employ a priority assignment scheme to
achieve overload control. An analytic expression for the stationary
probability of the queue lengths is derived. An algorithm is proposed to
compute the queue lengths distribution.",
}

@ARTICLE{Warl80:High,
AUTHOR="W. W. Warlick and J. E. Hershey",
TITLE="High-speed M-sequence generators",
JOURNAL=ieeetc,
VOLUME="C-29",
YEAR=1980,
KEYWORDS="Shift register sequences",
}

@ARTICLE{Wats80:Architecture,
AUTHOR="R. W. Watson and J. G. Fletcher",
TITLE="An architecture for support of network operating system
services",
JOURNAL=cn,
VOLUME=4,
NUMBER=1,
PAGES="33-49",
YEAR=1980,
REFERENCES=52,
KEYWORDS="Model; computer network; communication protocol",
ANNOTE="This paper argues that network architectures should be designed
with the explicit purpose of creating a coherent network operating
system (NOS). The resulting nos must be capable of efficient
implementation as the base (native) operating system on a given machine
or machines, or of being layered on top of existing operating systems as
a guest system. The goals and elements of a network architecture to
support a nos are outlined. This architectu",
}

@ARTICLE{Wein80:Data,
AUTHOR="Clifford J. Weinstein and M. L. Malpass and M. J. Fisher",
TITLE="Data traffic performance of an integrated circuit- and
packet-switched multiplex structure",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="873-878",
YEAR=1980,
REFERENCES=11,
KEYWORDS="Circuit switching; packet switching; network FLOW",
ANNOTE="Results are developed for data traffic performance in an
integrated multiplex structure which includes circuit-switching for
voice and packet-switching data. The results are obtained both through
simulation and analysis, and shown that excessive data queues and delays
will build up under heavy loading conditions. A variety of flow control
mechanisms to reduce data packet delays are investigated.",
}

@PROCEEDINGS{West80:Local,
TITLE="Local Networks for Computer Communications",
BOOKTITLE="IFIP WG 6.4 International Workshop on Local",
EDITOR="A. West and P. Janson",
ORGANIZATION="IFIP",
ADDRESS="Zürich, Switzerland",
YEAR=1980,
KEYWORDS="LAN",
}

@ARTICLE{Wilk80:Impact,
AUTHOR="M. V. Wilkes",
TITLE="The impact of wide-band local area communication systems on
distributed computing",
JOURNAL=ieeecomp,
VOLUME=13,
NUMBER=9,
PAGES="22-25",
YEAR=1980,
REFERENCES=10,
KEYWORDS="computer network; logical network structure; packet",
ANNOTE="Work in the design and implementation of local area systems
holds the key to the future of large distributed computer
installations.",
}

@ARTICLE{Wint80:Zur,
AUTHOR="W. Winter and W. Cimander",
TITLE="Zur Betriebsmittelverwaltung bei der Kopplung von Mikrorechnern
uber ein gemeinsames Bussystem",
JOURNAL=nte,
PAGES="400-402",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Multiprocessor system; bus arbitration; deadlock",
}

@ARTICLE{Wolf80:Simulation,
AUTHOR="B. Wolfinger and O. Drobnik",
TITLE="Simulation of protocol layers of communication in computer
networks",
JOURNAL="Computer networks and simulation",
PUBLISHER="North Holland",
YEAR=1980,
KEYWORDS="Simulation; protocol engineering; computer network; model",
ANNOTE="In the following the concept of a modeling system for simulating
protocols and protocol hierarchies is proposed, the flexibility of which
with regard to operational and functional structures of the computer
network architectures to be investigated is of special concern.",
}

@INPROCEEDINGS{Wund80:Control,
AUTHOR="E. F. Wunderlich and L. Kaufman and B. Gopinath",
TITLE="The Control of Store and Forward Congestion in Packet Switched
Networks",
BOOKTITLE=iccc,
ADDRESS="Atlanta, Georgia",
PAGES="851-856",
YEAR=1980,
REFERENCES=8,
KEYWORDS="Packet switching; congestion control; congestion",
ANNOTE="This study shows how store and forward congestion can be
controlled by a combination of buffer reservation and processor capacity
allocation. The scheme is analyzed using a detailed Markovian
state-space model of two coupled packet switches.",
}

@INPROCEEDINGS{Yama80:Graph,
AUTHOR="H. Yamazaki and Isamu Yoshida and Y. Matsushita",
TITLE="A Graph Theoretic Approach for Fault Detection and Recovery in a
Distributed Database",
BOOKTITLE=iccc,
ADDRESS="Atlanta, Georgia",
VOLUME=5,
PAGES="237-242",
YEAR=1980,
REFERENCES=9,
KEYWORDS="Graph theory; distributed database",
ANNOTE={In this paper, we discuss the fault detection and the recovery
technique in a distributed database, and propose the algorithm to detect
the network-partition. The proposed algorithms require an incident
matrix of the network at each site, and the additional computations that
the row-vectors of the matrix are repeatedly EORed. Our algorithm is
essentially a binary searching procedure based on the "weight" defined
on the set of vertices.},
}

@ARTICLE{Yu80:Access,
AUTHOR="Wei Yu and J. C. Majithia and J. W. Wong",
TITLE="Access protocols for circuit/packet switching networks",
JOURNAL=cn,
VOLUME=4,
NUMBER=6,
PAGES="271-283",
YEAR=1980,
REFERENCES=21,
KEYWORDS="Design; hybrid switching; communication protocol; X.25",
ABSTRACT="This paper discusses two possible designs of access protocols
for integrated computer networks with combined circuit and packet
switching capabilities. The special features of these protocols are
examined. Existing segregated protocols, i.e., pure circuit or packet
protocols, are evaluated with future integration in mind.",
}

@ARTICLE{Yum80:Measuring,
AUTHOR="T. S. Yum",
TITLE="Measuring the utilization of a synchronous data link: an
application of busy-period analysis",
JOURNAL=bstj,
VOLUME=59,
PAGES="731-744",
YEAR=1980,
REFERENCES=4,
KEYWORDS="Busy period; M/G/1; utilization",
ANNOTE="We assume the composite input of messages to an outgoing buffer
of a synchronous data link constitutes a poisson process. The message
length is arbitrarily distributed and is in units of ``packets''. This
allows us to model the transmission facilities as a
continuous-time-input, discrete-time-input M/G/1 queue. We analyze the
output process of such a system and determine the time needed to measure
link utilization with a prescribed accuracy.",
}

@ARTICLE{Yuva80:System,
AUTHOR="A. Yuval",
TITLE="System contention analysis - an alternate approach to system
tuning",
JOURNAL=ibmsj,
VOLUME=19,
NUMBER=2,
PAGES="208-228",
YEAR=1980,
KEYWORDS="Software monitor; tuning; operating system",
ANNOTE="This paper describes the implementation of a software monitor on
the IBM OS/MVS system for the purpose of contention analysis.",
}

@ARTICLE{Zeig80:Modelling,
AUTHOR="B. P. Zeigler",
TITLE="Modelling and simulation methodology: state of the art and
promising directions",
JOURNAL="Simulation of Systems",
PUBLISHER="North Holland",
PAGES="819-836",
YEAR=1980,
REFERENCES=35,
KEYWORDS="Simulation; model; method; survey; bibliography",
ANNOTE="After reviewing the state of the art of contemporary simulation
tools (languages packages systems) we discuss some of the proposed
computer based schemes being investigated by methodologists.",
}

@TECHREPORT{Ziek80:Pseudo,
AUTHOR="C. Ziekman",
TITLE="Pseudo-random binary sequence generators",
INSTITUTION="Philips Telecommunicatie",
ADDRESS="Hilversum, Holland",
NUMBER="SR 2244-80-531",
YEAR=1980,
KEYWORDS="shift register sequences",
}

@ARTICLE{Zimm80:OSI,
AUTHOR="H. Zimmermann",
TITLE="{OSI} reference model - the {ISO} model of architecture for Open
Systems Interconnection",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="425-432",
YEAR=1980,
REFERENCES=19,
KEYWORDS="data network; packet switching; communication protocol; OSI",
ANNOTE="This paper presents the model of architecture for open systems
interconnection developed by sc16. Some indications are also given on
the initial set of protocols which will likely be developed in this OSI
reference model.",
}

@ARTICLE{Chew80:Mathematical,
AUTHOR="E. K. Chew",
TITLE="Mathematical Modelling and Capacity Estimation of the {IST}
System",
JOURNAL=atr,
VOLUME=14,
NUMBER=2,
PAGES="3-18",
YEAR=1980,
REFERENCES=13,
KEYWORDS="Circuit switching; SPC; switching system; fault tolerance",
ANNOTE="A mathematical rule is derived for developing an appropriate
analytical model for modelling the response-time behaviour of the IST
system. The IST (Integrated Switching and Transmission) system is an
experimental digital tandem SPC telephone exchange, designed and
developed in the Research Laboratories of Telecom Australia.",
}

@ARTICLE{Pawl80:Auswertung,
AUTHOR="P. F. Pawlita",
TITLE="Auswertung und Vergleich gemessener Verkehrscharakteristika in
Dialog-Datenfernverarbeitungssystemen",
JOURNAL=er,
VOLUME=22,
NUMBER=1,
PAGES="24-35",
YEAR=1980,
LANGUAGE="German",
REFERENCES=15,
KEYWORDS="Traffic measurement; statistics; analysis; distribution",
ANNOTE="This paper summarizes recent data traffic measurements in four
dialogue TP-systems. For the statistical analysis the dialogue cycles
are divided into characteristic segments. The first two moments und
frequency distributions of some random variables arepresented. The daily
trend of these random variables and of traffic intensity is considered.
The traffic characteristics are explained.",
}

@ARTICLE{Chen80:Optimal,
AUTHOR="Pi-Chun Chen and J. Akoka",
TITLE="Optimal Design of Distributed Information Systems",
JOURNAL=ieeetc,
VOLUME="C-29",
NUMBER=12,
PAGES="1068-1080",
YEAR=1980,
KEYWORDS="Distributed database; parallel computing; math. programming",
ANNOTE="In this paper a model is developed for the optimization of
distributed information systems. Compared with the previous work in this
area, the model is more complete, since it considers simultaneously the
distribution of processing assignment of communication line capacities.
It also considers the return flow of information, as well as the
dependencies between programs and databases.",
}

@ARTICLE{Fink80:Processor,
AUTHOR="R. Finkel and M. Solomon",
TITLE="Processor Interconnection Strategies",
JOURNAL=ieeetc,
VOLUME="C-29",
NUMBER=5,
PAGES="360-371",
YEAR=1980,
KEYWORDS="Computer network; computer system; routing algorithm",
ANNOTE="In this paper, we describe four families of topologies for
interconnecting many indentical processors into a computer network. Each
family extends to arbitrarily many processors while keepingthe number of
neighbors of any one processor fixed. These families are investigated
with respect to bus load, routing algorithms, and the relation between
the everage interprocessor distance and the size of the network.",
}

@ARTICLE{Gonz80:Framework,
AUTHOR="M. Gonzalez and Scott Jordan",
TITLE="A Framework for the Quantitative Evaluation of Distributed Comput
er System",
JOURNAL=ieeetc,
VOLUME="C-29",
NUMBER=12,
PAGES="1087-1103",
YEAR=1980,
KEYWORDS="Parallel computing; performance evaluation",
ANNOTE="Current and anticipated advances in semiconductor technology,
ingeneral, and in the area of microcomputers, in particular, will lead
to a widespread utilization of distributed computer systems. The
advantages of these types of systems have led to numerous design
efforts. Most of these efforts have been undertaken in a largely ad hoc
manner without any mechanism for the evaluation of design tradeoffs.",
}

@ARTICLE{Wu80:Class,
AUTHOR="Chengke Wu and T. Feng",
TITLE="On a Class of Multistage Interconnection Networks",
JOURNAL=ieeetc,
VOLUME="C-29",
NUMBER=8,
PAGES="694-702",
YEAR=1980,
KEYWORDS="Multistage interconnection network; multiprocessor system",
ANNOTE="A baseline network and a configuration concept are introduced to
evaluate relationships among some proposed multistage interconnection
networks. It is proven that the data manipulator, flip network, omega
network, indirect binary n-cube network, and regu lar SW banyan network
are topologically equivalent. The configuration concept facilitates
developing a homogeneous routing algorithm which allows one-to-one and
one-to-many connections from",
}

@ARTICLE{Wu80:Reverse,
AUTHOR="Chengke Wu and T. Feng",
TITLE="The Reverse-Exchange Interconnection Network",
JOURNAL=ieeetc,
VOLUME="C-29",
NUMBER=9,
PAGES="801-811",
YEAR=1980,
KEYWORDS="Interconnection network; parallel computing; routing",
ANNOTE="Properties of the reverse-exchanga interconnection network are
used to develop a reconfiguration scheme and a two-pass structurefor
enhancing the efficiency of a class of multistage interconnection
networks. Functional relationships among a class of multistage
interconnection networks are first derived. According to the functional
relationships, we propose a reconfiguration sche me which enables a
network to accomplish various interconnection",
}

@ARTICLE{Addy80:Draft,
AUTHOR="A. M. Addyman",
TITLE="A draft proposal for {PASCAL} - {PASCAL} standardisation",
JOURNAL=sigplan,
VOLUME=15,
PAGES="1-69",
YEAR=1980,
KEYWORDS="PASCAL; standard",
}

@BOOK{Albe80:Beschreibungsregeln,
AUTHOR="I. Albert and A. Mokler and E. von der Wense",
TITLE="Beschreibungsregeln für Software: Methodik und Regeln zum
Herstellen von Software",
PUBLISHER="Kurzbeschreibungen SIEMENS AG",
PAGES="1-148",
YEAR=1980,
LANGUAGE="German",
REFERENCES=9,
KEYWORDS="Documentation; software; classification; standard; information
system; software engineering",
ANNOTE="Inhalt: 1. Beschreibungsmethodik; 2. Regeln zum Erstellen von
Kurzbeschreibungen; 3. Deskriptoren; 4. Beispiel für
Erfassungsformulare.",
}

@ARTICLE{Andr80:Computer,
AUTHOR="M. C. Andrews",
TITLE="Computer network architectures and operating experience of data
networks at {ICCC} 1978: promise and practice",
JOURNAL=cn,
VOLUME=4,
NUMBER=2,
PAGES="77-85",
YEAR=1980,
REFERENCES=9,
KEYWORDS="Computer network; network architecture; survey; ARPAnet; EDS",
ANNOTE="A review is given of the sessions of the international compute r
communications conference '78 which were devoted to computer network
architectures and to operating experience of data networks. The basic
concepts of some major architectures as devised by some of the leading
computer manufacturers in Japan and the United States are compared.
Under operating experience of data networks the key observations and
conclusions from 8 papers",
}

@ARTICLE{Arit80:Digital,
AUTHOR="T. Arita",
TITLE="Digital data switching network",
JOURNAL=recl,
VOLUME=28,
PAGES="328-337",
YEAR=1980,
KEYWORDS="Switching system; switching network; switching block",
}

@MISC{Asho80:Protocol,
AUTHOR="E. Ashok and V. Kottapalli and J. Yanosi",
TITLE="Protocol Specification and Verification with Hybrid State
machines",
YEAR=1980,
REFERENCES=3,
KEYWORDS="Protocol specification; verification; protocol engineering",
}

@ARTICLE{Atki80:Path,
AUTHOR="J. D. Atkins",
TITLE="Path control: the transport network of {SNA}",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="527-538",
YEAR=1980,
REFERENCES=20,
KEYWORDS="Digital network; virtual channel; packet switching; network
flow; routing algorithm; SNA; path control",
ANNOTE="This paper describes the structure of the path control layer of
sna, focusing on connectivity, routing, and flow control. The end user's
view of these architectural concepts is presented, as well as a
discussion of the underlying formats and protocols.",
}

@BOOK{Auer80:Auerbach,
TITLE="The Auerbach annual 1980 --- best computer papers",
EDITOR="I. L. Auerbach",
PUBLISHER="North Holland",
PAGES="1-405",
YEAR=1980,
KEYWORDS="Communication network; information system; special issue;
literature system",
}

@ARTICLE{Ball80:Videotex,
AUTHOR="A. J. S. Ball and Gregor V. Bochmann and J. Gecsei",
TITLE="Videotex networks",
JOURNAL=ieeecomp,
VOLUME=13,
NUMBER=12,
PAGES="8-14",
YEAR=1980,
REFERENCES=15,
KEYWORDS="Public network; communication network; hybrid switching; local
cable; telephone channel; fiber optics; broadcast; communication; X.25;
packet switching",
ANNOTE="Using the home tv screen, videotex networks can provide easy,
inexpensive access to vast amounts of information. Here, we consider
planned and possible network structures.",
}

@ARTICLE{Barb80:Useful,
AUTHOR="G. Barberis",
TITLE="A useful tool in the theory of priority queueing",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="1757-1762",
YEAR=1980,
REFERENCES=7,
KEYWORDS="HOL priority; G/M/1; packet switching",
ANNOTE="A double input channel priority network, consisting of a
low-priority queue with general interarrival distribution and Markovian
service time and a high priority completely Markovian queue, is
considered. A simple and handy estimate of the mean queue length for the
two flows is presented together with its relative effectiveness. The
analysis results show that the channel utilization can be improved by
introducing a deterministic traffic flow wi",
}

@INCOLLECTION{Baue80:Breitband,
AUTHOR="H. Bauer and H. J. Schmidt",
TITLE="Breitband-ISDN-Anschlüsse für Bewegtbild-Dienste und für schnelle
Daten",
BOOKTITLE="NTG-Fachberichte: Wege zum integrierten Kommunikationsnetz",
PUBLISHER="NTG-Verlag",
VOLUME=88,
PAGES="187-193",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="ATM; video service; data communication; BISDN",
}

@ARTICLE{Bauk80:Schwerpunkte,
AUTHOR="K. Bauknecht and P. Pircher",
TITLE="Schwerpunkte und Grenzen in der Behandlung von Modellen für
Computersysteme durch Simulation und durch analytische Verfahren",
JOURNAL=ors,
PUBLISHER="Springer-Verlag",
VOLUME=2,
PAGES="41-46",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Hybrid simulation",
ANNOTE="Die vorliegende Arbeit hat zum Ziel, die Anwendbarkeit von
analytischen Verfahren und der Simulationstechnik zur Behandlung
aktueller Problemstellungen in der Praxis der Leistungsanalyse von
Computersystemen zu diskutieren. An einem Beispiel wird dann das uns für
viele Fälle geeignet erscheinende hybride Verfahren gezeigt und die
damit mögliche Flexibilität erläutert; gleichzeitig weisen wir aber auch
auf die dabei entstehenden Probleme hin.",
}

@ARTICLE{Beil80:Hybride,
AUTHOR="H. Beilner",
TITLE="Hybride (heterogene) Modellierung",
JOURNAL=infspec,
PAGES="1-10",
YEAR=1980,
LANGUAGE="German",
REFERENCES=23,
KEYWORDS="Analytical model; simulation model; modeling; prediction;
hybrid modeling",
ANNOTE="Ausgearbeitet zur Aufnahme als aktuelles Schlagwort in die
GI-Zeitschrift Informatik-Spektrum, Springer-Verlag.",
}

@ARTICLE{Bell80:Optimal,
AUTHOR="C. E. Bell",
TITLE="Optimal operation of an {M/M/2} queue with removable servers",
JOURNAL=or,
VOLUME=28,
PAGES="1189-1204",
YEAR=1980,
KEYWORDS="Queueing system; M/M/2; removable server",
}

@INPROCEEDINGS{Bell80:Parametric,
AUTHOR="G. Bellavia and R. Laschi and F. Tesi",
TITLE="Parametric analysis of closed queueing networks using equivalent
systems in simulation problems",
BOOKTITLE="Simulation of Systems",
PUBLISHER="North Holland",
PAGES="95-104",
YEAR=1980,
REFERENCES=8,
KEYWORDS="Closed queueing network; simulation; parameter analysis",
ANNOTE="In this paper we present a method to analize the behaviour of a
closed queueing network, when the parameters of a network subset are
varied. The method can be used to evaluate the network parameters with a
remarkable saving in computation time. In addition it enables to analize
the resources included both in the variable subnet and in the
complementary constant subnet.",
}

@ARTICLE{Bell80:Throughput,
AUTHOR="S. Bellini and F. Borgonova",
TITLE="On the throughput of an {ALOHA} channel with variable length
packets",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="1932-1935",
YEAR=1980,
REFERENCES=4,
KEYWORDS="ALOHA; packet switching; variable packet length",
ANNOTE="In this paper we give a new simple expression for the
probability of successful transmission on an infinite population aloha
channel with variable length packets. Expressions for the throughput and
the probability density of the packet length on the channel are derived
in a straightforward way along with the best and the worst length
densities.",
}

@ARTICLE{Bert80:Physical,
AUTHOR="H. V. Bertine",
TITLE="Physical level protocols",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="433-444",
YEAR=1980,
REFERENCES=30,
KEYWORDS="Survey; interface; V.24; modem; communication protocol; X.20;
X.21; standard",
ANNOTE="This level covers the physical interface between devices and the
rules by which bits are passed from one to another. These devices may
be, for example, a data terminal equipment (DTE) and a data
circuit-terminating equipment (DCE, e.g., a modem). This paper describes
the physical level and the national and international standards that
have been developed for this level. Included are insights into the
development of recently adopted physical",
}

@INPROCEEDINGS{Bert80:Class,
AUTHOR="D. P. Bertsekas",
TITLE="A Class of Optimal Routing Algorithms for Communication
Networks",
BOOKTITLE=iccc,
ADDRESS="Atlanta",
PAGES="71-76",
YEAR=1980,
REFERENCES=17,
KEYWORDS="Routing algorithm; optimization; distributed routing; network
flow",
ANNOTE="We describe an algorithm for minimum delay routing in a
communication network. During the algorithm each node maintains a list
of paths along which it sends traffic to each destination together with
a list of the fractions of total traffic that are sent along these
paths. At each iteration a minimum marginal delay path to each
destinationis computed and added to the current list if not already
there. Simultaneously the corresponding fractio",
}

@ARTICLE{Besi80:Verkehrstheoretische,
AUTHOR="H. Besier and P. Heuer and G. Kettler",
TITLE="Verkehrstheoretische Untersuchungen von elektronischen
Datenvermittlungssystemen",
JOURNAL="Mitteilungen aus dem Forschungsinstitut der DBP",
ADDRESS="Darmstadt",
VOLUME=5,
YEAR=1980,
LANGUAGE="German",
KEYWORDS="performance evaluation; switching system; data switching",
}

@INPROCEEDINGS{Blac80:Evolution,
AUTHOR="R. E. Blackshaw and I. M. Cunningham",
TITLE="Evolution of Open Systems Interconnection",
BOOKTITLE=iccc,
ADDRESS="Atlanta",
PAGES="417-422",
YEAR=1980,
REFERENCES=3,
KEYWORDS="Protocol",
ANNOTE="This paper looks at the recent work in Open Systems Architecture
or Open Systems Interconnection (OSI) as it is more properly known. The
basics of such an architecture and the standards and standards bodies
involved are discussed. The rationale for carrier involvement in this
standardization activity is explored, and some parallels between data
network and voice network development are drawn. The value of OSI to all
members of the data process",
}

@INPROCEEDINGS{Blan80:NBS,
AUTHOR="R. P. Blanc and John F. Heafner",
TITLE="The {NBS} Program in Computer Network Protocol Standards",
BOOKTITLE=iccc,
ADDRESS="Atlanta",
PAGES="423-428",
YEAR=1980,
KEYWORDS="Protocol",
ANNOTE="The National Bureau of Standards' program to develop standards
for computer network protocols is described. A family of standards is
expected to emerge from the program. They will form the basis for
distributed computing in the Federal Government and will provide minimum
cost, high performance networking to meet Federal needs. The program
described includes a systematic approach to protocol development
comprising design, implementation, and",
}

@ARTICLE{Blec80:Advanced,
AUTHOR="F. Blecher",
TITLE="Advanced mobile phone service",
JOURNAL=ieeevt,
VOLUME="VT-29",
YEAR=1980,
KEYWORDS="MAT; architecture",
ANNOTE="Survey",
}

@INPROCEEDINGS{Blev80:Use,
AUTHOR="J. Blevanus and G. Mitaut",
TITLE="The Use of {X.75} in the Transpac International Gateway",
BOOKTITLE=iccc,
ADDRESS="Atlanta",
PAGES="723-728",
YEAR=1980,
REFERENCES=7,
KEYWORDS="TRANSPAC; packet switching",
ANNOTE="The following paper intends to describe the NTI interface for
international connections based in the CCITT X75 recommendation. To
facilitate the reader's comprehension, the hardware and software
architectures of the gateway are more briefly described.",
}

@ARTICLE{Boss80:Simulation,
AUTHOR="H. Bosshardt and C. Meylan",
TITLE="Simulation im Aufzugsbau",
JOURNAL="Bulletin ASE/UCS",
VOLUME=71,
PAGES="1166-1171",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="scheduling; simulation",
}

@ARTICLE{Brac80:Fast,
AUTHOR="C. Braccini and G. Marino",
TITLE="Fast geometrical manipulations of digital images",
JOURNAL="Computer graphics and image processing",
VOLUME=13,
NUMBER=2,
PAGES="127-141",
YEAR=1980,
KEYWORDS="Graphics; interactive mode; application; PASCAL; FORTRAN",
ANNOTE="The authors present an algorithm (three slightly different
versions actually for variant situations) which uses integer arithmetic
to perform affine transformations on digital images. As they point out,
piecewise application allows for nonlinear mapping. The algorithms are
described in pascal for potential implementors. Efficiency is
illustrated in comparison to a fortran program using a version
(unspecified) of the classical rotation and scaling",
}

@ARTICLE{Bran80:Further,
AUTHOR="A. Brandwajn",
TITLE="Further results on equivalence and decomposition in queueing
network models",
JOURNAL=per,
VOLUME=9,
NUMBER=2,
PAGES="93-104",
YEAR=1980,
REFERENCES=9,
KEYWORDS="queueing network; model; method; decomposition; conditional
probability; equivalence",
ANNOTE="This paper addresses three aspects related to the notion of
exact equivalence in queueing models. In many cases the parameters of a
system equivalent to a given model involve only a small subset of
conditional probabilities of the state of the original model given the
equivalent one. It is shown that meaningful bounds may be obtained for
the conditional probabilities of interest with little computational
effort. Such bounds are useful in as",
}

@ARTICLE{Brau80:Parallel,
AUTHOR="B. Braunleder and P. Götz and G. Tanner",
TITLE="Parallel processing with 128 microprocessors",
JOURNAL=siemensfe,
VOLUME=9,
NUMBER=6,
PAGES="330-333",
YEAR=1980,
REFERENCES=8,
KEYWORDS="Array processor; multiprocessing; microprocessor; parallel
computing",
ANNOTE="The software architecture of the experimental siemens parallel
processor sms with 128 microprocessors is described.",
}

@ARTICLE{Brow80:Future,
AUTHOR="B. E. Brown and S. W. Levine",
TITLE="The future of computer graphics",
JOURNAL=byte,
VOLUME=5,
NUMBER=11,
PAGES="22-28",
YEAR=1980,
KEYWORDS="graphics; three-dimensional plot; human factors; model;
display; realization; process interaction",
}

@BOOK{Brow80:Practical,
AUTHOR="M. R. Brown",
TITLE="The analysis of a practical and nearly optimal priority queue",
SERIES="Outstanding dissertations in the computer sciences",
PUBLISHER="Garland Publishing",
ADDRESS="New York",
PAGES=99,
YEAR=1980,
REFERENCES=44,
KEYWORDS="Performance evaluation; method; priority",
ANNOTE="The binomial queue, a new data structure for implementing
priority queues that can be efficiently merged, was recently discovered
by Jean Vuillemin; we explore the properties of this structure in
detail.",
}

@ARTICLE{Brow80:General,
AUTHOR="T. Brown",
TITLE="General fast generation of random variables for discrete
distribution",
JOURNAL=simuletter,
VOLUME=11,
NUMBER=4,
PAGES="73-75",
YEAR=1980,
REFERENCES=5,
KEYWORDS="random number generation; random variate generation; method;
table-look-up method",
ANNOTE="Recently a new method, the ALAIS method has been introduced for
generating a discrete, finite valued distribution (1,2). The method is
exceptionally fast and can be broadly applied. It should have wide
appeal. The purpose of this note is to introduce the method, place it in
prospective with other fast, generally applied methods and to provide a
Fortran program to generate constants needed by the method for any given
distribution.",
}

@BOOK{Brue80:Computational,
AUTHOR="S. C. Bruell and G. Balbo",
TITLE="Computational algorithms for closed queueing networks",
PUBLISHER="ELSEVIER North Holland",
ADDRESS="Amsterdam",
PAGES="1-190",
YEAR=1980,
KEYWORDS="Closed queueing network; method; discrete convolution;
normalization constant; job class; BCMP; MVA",
ANNOTE="Chapter 1 -- introduction chapter 2 -- computational aspects of
closed queueing networks with multiple job classes: the normalization
constant approach chapter 3 -- practical considerations chapter 4 --
computational aspects of closed queueing networks with multiple job
classes: the mean value analysis approach.",
}

@ARTICLE{Brya80:Homogeneity,
AUTHOR="R. M. Bryant",
TITLE="On homogeneity in {M/G/1} queueing systems",
JOURNAL=per,
VOLUME=9,
NUMBER=2,
PAGES="199-208",
YEAR=1980,
REFERENCES=11,
KEYWORDS="M/G/1; evaluation; operational analysis",
ANNOTE="Operational analysis replaces certain classical queueing theory
assumptions with the condition of ``homogeneous service times''. In this
paper, we show that the sample paths of an m/g/1 queueing system have
this property with non-zero probability if and only if the service time
distribution is exponential. We also consider the relationship of the
operational performance measures $s(n)$ and the mean service time. This
relationshipis shown to depend",
}

@ARTICLE{Bull80:Eventcounts,
AUTHOR="K. Bullis and William R. Franta",
TITLE="Implementation of eventcounts in a broadcast network",
JOURNAL=cn,
VOLUME=4,
NUMBER=2,
PAGES="57-69",
YEAR=1980,
REFERENCES=10,
KEYWORDS="Realization; computer network; process management; parallel
computing; synchronization",
ANNOTE="Eventcounts and sequences are synchronization mechanisms,
comparable to semaphores and mutual exclusion respectively. Both are
amenable to implementation in computer networks. In this paper their
definitions and uses are reviewed, then a robust implementation of both
is developed for a local network with reliable broadcast capacity.",
}

@TECHREPORT{Bund80:Einheitliche,
AUTHOR="Bundesminister des Innern",
TITLE="Einheitliche höhere Kommunikationsprotokolle, Ebene 4,
Basisumfang - {EHKP} 4, Basisumfang, Version 1",
INSTITUTION="Bundesministerium des Innern",
ADDRESS="Bonn, Germany",
PAGES="1-92",
YEAR=1980,
LANGUAGE="German",
REFERENCES=13,
KEYWORDS="standard; communication protocol; X.25; transport layer; data
switching; PIX",
ABSTRACT="Einführung; Darstellungsmethodik und Fehlermodell; Abstrakte
Schnittstelle zwischen dem Transportmedium und seinen Benutzern;
Abstrakte Schnittstelle zwischen der Netzwerkmaschine und ihren
Benutzern; Die Umsetzung der Schnittstelle der Netzwerkmaschine auf die
Schnittstelle X.25; Die level-4-Protokolle; Die Formate der
protocol-data-units und die Semantik ihrer Parameter",
}

@ARTICLE{Butl80:Easy,
AUTHOR="J. Butland and S. D. Butland",
TITLE="An easy-to-use graph drawing package",
JOURNAL=ieeecomp,
VOLUME=13,
NUMBER=2,
PAGES="69-80",
YEAR=1980,
KEYWORDS="diagram manipulation; application; method; human factors",
}

@TECHREPORT{Bux80:Verkehrsgerechte,
AUTHOR="W. Bux",
TITLE="Über die verkehrsgerechte Dimensionierung der
Vermittlungsknotenin Daten- und Rechnernetzen",
TYPE="Bericht über verkehrstheoretische Arbeiten, IND",
INSTITUTION="Universität Stuttgart",
ADDRESS="Stuttgart, Germany",
VOLUME=26,
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Queueing system; packet switching",
}

@ARTICLE{Bux80:Balanced,
AUTHOR="W. Bux and K. Kümmerle and H. L. Truong",
TITLE="Balanced {HDLC} procedures: a performance analysis",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="1889-1896",
YEAR=1980,
KEYWORDS="Queueing system; simulation; HDLC; packet switching; ARQ;
protocol; window mechanism; Performance evaluation; virtual transmission
time",
ABSTRACT="The prime objective of the present paper is to analyze the
performance of hdlc balanced class of procedures, i.e., to
quantitatively study the interaction among a multiplicity of parameters
which are procedure specific, characterize the properties of the
transmission medium, and identify the operational characteristics and
requirements. The approach taken is to consider two kinds of operation:
a saturated case characterized by maximum through",
}

@ARTICLE{Buze80:Measuring,
AUTHOR="J. P. Buzen and P. J. Denning",
TITLE="Measuring and calculating queue length distributions",
JOURNAL=ieeecomp,
VOLUME="C-",
PAGES="33-44",
YEAR=1980,
KEYWORDS="Queueing system; measurement; time series analysis; queue
length; waiting time; LOOP queue; bibliography; method; G/G/1",
ANNOTE="Operational analysis, an alternative to stochastic analysis
based on measurable variables rather than abstract parameters,
simplifies proofs of formulas for computing response times and queue
lengths.",
}

@ARTICLE{Cars80:Conservation,
AUTHOR="J. S. Carson and A. M. Law",
TITLE="Conservation equations and variance reduction in queueing
simulations",
JOURNAL=or,
VOLUME=28,
PAGES="535-546",
YEAR=1980,
KEYWORDS="Queueing system; simulation; estimation; variance reduction;
sampling",
ANNOTE="In simulations of queueing problems, there are often several
statistics of interest that can be independently estimated. If some of
these statistics are related to the others, however, the sample mean of
a particular random variable may not provide as good an estimate of the
true mean as does an estimate derived from direct measurement of a
different (but related) random variable. The authors define a measure
for the efficiency of an estimator",
}

@ARTICLE{Cave80:Buffer,
AUTHOR="J. K. Cavers and C. M. Woodside",
TITLE="Buffer size for data communications over fading radio links",
JOURNAL=cn,
VOLUME=4,
NUMBER=4,
PAGES="167-174",
YEAR=1980,
REFERENCES=12,
KEYWORDS="Overflow; buffer length; broadcast; packet radio; data
retransmission; binomial distribution; arrival process; oss system;
interrupted service; fading",
ANNOTE="With the increasing importance of computer traffic over radio
channels, it is important to study the effect of signal fluctuation.
This paper is the first analysis of buffer requirements for
retransmission error control schemes operating over fading links. It
contains four principal contributions: design curves are presented for
buffer size in terms of traffic and channel parameters; an intermittent
server model for the channel is introduced an",
}

@ARTICLE{Chan80:Recursive,
AUTHOR="Wai-Yip Geoffrey Chan",
TITLE="Recursive algorithms for computing end-to-end blocking in a
network with arbitrary routing plan",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="153-164",
YEAR=1980,
REFERENCES=12,
KEYWORDS="link system; blocking; routing algorithm",
ANNOTE="This paper presents three recursive algorithms for computing
end-to-end blocking probabilities in a network with alternate routing,
based on link blocking probabilities.",
}

@ARTICLE{Chan80:Computational,
AUTHOR="K. M. Chandy and C. H. Sauer",
TITLE="Computational algorithms for product form queueing networks",
JOURNAL=cacm,
VOLUME=23,
NUMBER=10,
PAGES="573-583",
YEAR=1980,
REFERENCES=25,
KEYWORDS="queueing network; discrete convolution; product form; network;
runtime/storage efficiency",
ANNOTE="In queueing networks with a product form solution two
computational algorithms for product form networks are presented. A
comprehensive treatment of these algorithms and the two important
existing algorithms, convolution and mean value analysis, is given.",
}

@ARTICLE{Chan80:Exercise,
AUTHOR="E. Chang",
TITLE="N-philosophers: an exercise in distributed control",
JOURNAL=cn,
VOLUME=4,
NUMBER=2,
PAGES="71-76",
YEAR=1980,
REFERENCES=6,
KEYWORDS="Process management; resource management; computer network;
parallel computing; dining philosophers model; decentralized control",
ANNOTE="The N-philosophers problem is an example of asynchronous
processes which interact. A message-passing mechanism is used to detect
the presence of deadlock among the philosophers. Some alternative ways
in which deadlock can be resolved are derived from differences in the
way philosophers might relinquish their resources and pending
requests.",
}

@ARTICLE{Chen80:Gamma,
AUTHOR="R.-G. Cheng and G. M. Feast",
TITLE="Gamma variate generators with increased shape parameter range",
JOURNAL=cacm,
VOLUME=23,
PAGES="389-394",
YEAR=1980,
REFERENCES=8,
KEYWORDS="Distribution; gamma distribution; random number generation",
ANNOTE="Gamma generators, easily programmed, and possess a uniform speed
over the operating range, but are only valid for alpha>1. Generating
random variates using the ratio of uniform variates are combined to
produce a family of generators valid for all alpha>1/n where $n$ is an
arbitrary integer. Thus if $n$ is greater than unity, variates with
alpha less than unity can be sampled.",
}

@INPROCEEDINGS{Ches80:Datakit,
AUTHOR="G. L. Chesson and A. G. Fraser",
TITLE="Datakit Network Architecture",
BOOKTITLE=compcon,
PAGES="59-61",
YEAR=1980,
REFERENCES=3,
KEYWORDS="Packet switching; network planning",
ANNOTE={Datakit hardware and software components approach the problems
of data communications with a modular "erector set" point of view. The
hardware modules comprise single circuit boards inter-connected by a
hardware packet switch. The software modules consists of
machine-independent routines for accessing the hardware and providing
process and file communication through the network.},
}

@ARTICLE{Chow80:Cycle,
AUTHOR="W.-M. Chow",
TITLE="The cycle time distribution of exponential cyclic queues",
JOURNAL=jacm,
VOLUME=27,
NUMBER=2,
PAGES="281-286",
YEAR=1980,
REFERENCES=14,
KEYWORDS="loop queue; time in system; exponential distribution; Erlang
distribution; model; cyclic service; cycle time",
ANNOTE="The cycle time distribution of a cyclic queue with two
exponential servers is derived. Results show that when the population
size $n$ is large enough, the cycle time distribution is not sensitive
to the ratio of service rates and asymptotically approaches an Erlangian
distribution. If service rates are identical, however, the cycle time
has an exact Erlangian distribution for any $n$.",
}

@ARTICLE{Chu80:Hierarchical,
AUTHOR="Wesley W. Chu and Yunfei Chen",
TITLE="A hierarchical routing and flow control policy {(HRFC)} for
packet switched networks",
JOURNAL=ieeetc,
VOLUME="C-29",
PAGES="971-977",
YEAR=1980,
KEYWORDS="Data network; routing algorithm; flow control; Packet
switching; network flow; distributed routing",
ABSTRACT="A new policy that can effectively handle message routing and
flow control simultaneously in a packet switched computer network is
presented.",
}

@ARTICLE{Cich80:PASCAL,
AUTHOR="R. J. Cichelli",
TITLE="{PASCAL-I-interactive,} conversational {PASCAL-S}",
JOURNAL=sigplan,
VOLUME=15,
NUMBER=1,
PAGES="34-44",
YEAR=1980,
KEYWORDS="Interactive mode; PASCAL; compiler; interpreter; text
processing; formatter",
ANNOTE="PASCAL-I is a version of the Wirth PASCAL-S (PASCAL subset)
system designed to interact with the terminal user. The system contains
a compiler, interpreter, text editor, formatter and a run-time debugging
system.",
}

@ARTICLE{Cich80:Fixing,
AUTHOR="R. J. Cichelli",
TITLE="Fixing {PASCAL'S} {I/O}",
JOURNAL=sigplan,
VOLUME=15,
PAGES=19,
YEAR=1980,
KEYWORDS="Pascal; evaluation",
ANNOTE="There have been a flurry of articles advocating modifications to
PASCAL's file facility to improve its functionality for input/output.
Here, questions regarding terminal I/O and relative record I/O will be
discussed.",
}

@ARTICLE{Cies80:New,
AUTHOR="A. J. Ciesielka and N. G. Long",
TITLE="New technology for loops - a plan for the '80's",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="923-930",
YEAR=1980,
REFERENCES=8,
KEYWORDS="Ring network; local cable; fiber optics; survey; future
outlook",
ANNOTE="This paper describes an evolutionary plan for loop electronics
to realize their full economic and service potential, and describes
issues of telco operations, cost, and technical capabilities which must
be resolved in the process. Initially, conventional feeder engineering
will lead to isolated applications of range extensions and pair gain.",
}

@BOOK{Coff80:Operating,
AUTHOR="E. G. Coffman and P. J. Denning",
TITLE="Operating Systems Theory",
PUBLISHER="Prentice-Hall Inc.",
ADDRESS="Englewood Cliffs",
YEAR=1980,
KEYWORDS="Queueing system",
}

@ARTICLE{Cohe80:General,
AUTHOR="Danny Cohen and D. Crowe",
TITLE="A general interpolating graphics package for the {TRS-80}",
JOURNAL=byte,
VOLUME=5,
NUMBER=11,
PAGES="296-310",
YEAR=1980,
KEYWORDS="Realization; polynomial; approximation; method; graphics;
BASIC; two-dimensional plot",
ANNOTE="With this package, TRS-80 users should be able to plot any
analytic function.",
}

@ARTICLE{Cott80:Technologies,
AUTHOR="I. W. Cotton",
TITLE="Technologies for local area computer networks",
JOURNAL=cn,
VOLUME=4,
NUMBER=5,
PAGES="197-208",
YEAR=1980,
REFERENCES=34,
KEYWORDS="Communication network; design; switching type; LAN; logical
network structure",
ANNOTE="Local area computer networks are distinguished from long
distance networks by the need to serve in a limited geographic area. The
service requirements for local area computer networks are reviewed and
several candidate technologies are briefly compared in the concluding
section.",
}

@ARTICLE{Dale80:Transient,
AUTHOR="G. Dalen",
TITLE="On the transient waiting times for a {GI/M/1} priority queue",
JOURNAL=jap,
VOLUME=17,
PAGES="227-234",
YEAR=1980,
REFERENCES=6,
KEYWORDS="GI/M/1/*/*; HOL priority; waiting time; appointment system",
ANNOTE="In this paper we consider the GI/M/1 queueing model with
infinite waiting-room capacity. The customer arriving at $T=0$ will find
$K-1$ customers waiting. The latter customers belong to a second
priority class, whereas the ones arriving in $(0,\infty)$ belong to a
first priority class and have the higher priority. Within each class we
have a first-in-first-out queueing discipline. A customer, once at the
service-point, remains there until his",
}

@ARTICLE{Davi80:Slotted,
AUTHOR="D. H. Davis and S. T.. A. Gronemeyer",
TITLE="Performance of slotted {ALOHA} random access with delay capture
and randomized time of arrival",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="703-710",
YEAR=1980,
REFERENCES=17,
KEYWORDS="ALOHA; random multiple access; TDMA; time division multiple
access",
ANNOTE="The application of the slotted aloha random access technique to
a system using a spread spectrum waveform is described and analyzed. The
technique takes advantage of the delay capture properties of spread
spectrum waveforms and is shown to achieve excellent delay and
throughput performance. System stability is maintained even in the face
of severe fluctuations in user population or traffic loading such as may
occur in a large population of mobi",
}

@ARTICLE{Day80:Terminal,
AUTHOR="John Day",
TITLE="Terminal protocols",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="585-593",
YEAR=1980,
REFERENCES=35,
KEYWORDS="bibliography; packet switching; ARPAnet; digital network;
communication protocol; terminal protocol; X.3; X.28; X.29",
ABSTRACT="This paper presents a survey of the architecture and
mechanisms used in current terminal protocols. The paper discusses both
parametric terminal protocols such as the ccitt x.3, x.28 and x.29 and
virtual terminal protocols, such as the arpanet telnet protocol. Many of
the problems encountered in terminal protocols recur in more complex
forms in the more sophisticated protocols.",
}

@ARTICLE{Dege80:MASYCA,
AUTHOR="W. Degen",
TITLE="{MASYCA:} Eine interaktive Kommandosprache zur symbolischen
Manipulation mathematischer Formeln",
JOURNAL=aninf,
VOLUME=22,
NUMBER=1,
PAGES="18-26",
YEAR=1980,
LANGUAGE="German",
REFERENCES=11,
KEYWORDS="Symbolic algebraic computation; realization",
ANNOTE="Ein interaktives Programmsystem mit Namen MASCYA auf der CDC
6600/CYBER 174 implementiert wird in seinen Grundzügen beschrieben und
durch einige Anwendungsbeispiele erläutert.",
}

@BOOK{Dekk80:Simulation,
AUTHOR="L. Dekker and G. Savastano and G. C. Vansteenkiste",
TITLE="Simulation of systems '79",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam",
PAGES=1169,
YEAR=1980,
KEYWORDS="Simulation",
}

@ARTICLE{Drei80:Modulares,
AUTHOR="M. Dreidoppel and G. Jaskulke",
TITLE="Ein modulares Konzept mikrocontroller-gesteuerter
Nebenstellenanalage für Text- und Bildkommunikation",
JOURNAL="NTG-Fachberichte",
ADDRESS="Stuttgart",
VOLUME=74,
PAGES="65-74",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="PABX; circuit switching; video service",
}

@INPROCEEDINGS{Druk80:X,
AUTHOR="C. Z. Drukarch and P. M. Karp and K. G. Knightson and L.
Lavandera",
TITLE="{X.25:} The Universal Packet Network",
BOOKTITLE=iccc,
ADDRESS="Atlanta",
PAGES="649-657",
YEAR=1980,
REFERENCES=13,
KEYWORDS="X.25; packet switching",
ANNOTE="CCITT Recommendation X.25, the interface between Data Terminal
Equipment (DTE) and packet switching networks, was adopted in 1976. This
paper highlights the technical issues that constitute the universally
acceptable X.25, adopted in February 1980, and gives a brief overview of
currently operating public data networks.",
}

@ARTICLE{East80:Batch,
AUTHOR="M. C. Easton",
TITLE="Batch throughput efficiency of {ADCCP/HDLC/SDLC} selective reject
protocols",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="187-195",
YEAR=1980,
REFERENCES=10,
KEYWORDS="HDLC; communication protocol; RJE; remote job entry; ARQ",
ANNOTE="The batch throughput efficiency is studied for three variants on
selective reject protocols that operate in a full duplex asynchronous
response mode and that adhere to the common architectural features of
adccp, hdlc, and sdlc.",
}

@ARTICLE{Ecke80:Graphische,
AUTHOR="R. Eckert and G. Enderle and K. Kansy and F.-J. Prester",
TITLE="Graphische Datenverarbeitung: Entwicklungen auf dem Weg zur
Standardisierung",
JOURNAL=infspec,
VOLUME=3,
PAGES="246-260",
YEAR=1980,
LANGUAGE="German",
REFERENCES=11,
KEYWORDS="realization; method; human factors; graphics; operating
system; interactive mode; memory management; information system",
ANNOTE="The graphical kernel system GKS that has been developed by a DIN
subcommittee is the base of the DIN standardization effort for computer
graphics.",
}

@ARTICLE{Elsa80:Priority,
AUTHOR="C. Elsaesser and Roy Preston Williams",
TITLE="Evaluation of priority rules to improve turn-around time for
computer users",
JOURNAL="Computer Industrial Engineering",
VOLUME=4,
NUMBER=4,
PAGES="281-292",
YEAR=1980,
KEYWORDS="priority; virtual waiting time",
ANNOTE="Two alternate methods for sequencing jobs arriving at the
computer center of ohio University are compared with the usual
shortest-job-first method. The results obtained suggest that the method
which reserves one memory partition (out of the four used for general
computation) for longer jobs may be desirable to improve turn-around
time for those jobs without seriously degrading performance for short
jobs.",
}

@ARTICLE{Enge80:Job,
AUTHOR="G. P. Engelberg and J. A. Howard and D. A. Mellichamp",
TITLE="Job scheduling in a single-node hierarchical network for process
control",
JOURNAL=ieeetc,
VOLUME="C-29",
PAGES="710-719",
YEAR=1980,
REFERENCES=16,
KEYWORDS="Computer network; simulation; hierarchical network;
performance measure; optimization; process control; performance
evaluation; single node hierarchy",
ANNOTE={The operating characteristics of a typical single-node
hierarchical element in a multiprocessor network such as might be used
for process control are described, and the class of scheduling problems
arising from the use of such a network is discussed and related to
similar problems which have been reported in the literature. Two
measures of system performance are then defined: the "settling time",
defined as the maximum of the finishing times},
}

@ARTICLE{Ephr80:Simple,
AUTHOR="Anthony Ephremides and P. Varaiya and J. Walrand",
TITLE="A Simple Dynamic Routing Problem",
JOURNAL=ieeeac,
VOLUME="AC-25",
NUMBER=4,
PAGES="690-693",
YEAR=1980,
REFERENCES=12,
KEYWORDS="Load Sharing; Analysis; Queueing system",
}

@ARTICLE{Fayo80:Solution,
AUTHOR="G. Fayolle and P. King and I. Mitrani",
TITLE="The solution of certain two-dimensional Markov models",
JOURNAL=per,
VOLUME=10,
NUMBER=2,
PAGES="283-289",
YEAR=1980,
REFERENCES=4,
KEYWORDS="Birth-death process; Markov process; Z-transform; Hilbert
transform; numerical method; steady state probability",
ANNOTE="A class of two-dimensional birth-and-death processes, with
applications in many modelling problems, is defined and analysed in the
steady-state. These are processes whose instantaneous transition rates
are state-dependent in a restricted way. Generating functions for the
steady-state distribution are obtained by solving a functional equation
in two variables. That solution method lends itself readily to numerical
implementation.",
}

@ARTICLE{Fayo80:Sharing,
AUTHOR="G. Fayolle and I. Mitrani and R. Iasnogorodski",
TITLE="Sharing a processor among many job classes",
JOURNAL=jacm,
VOLUME=27,
PAGES="519-532",
YEAR=1980,
REFERENCES=12,
KEYWORDS="Processor sharing; priority; Laplace transform; characteristic
function",
ABSTRACT="A single-server processor-sharing system with $M$ job classes
is analyzed in the steady state.  The scheduling strategy considered
divides the total processor capacity in unequal fractions among the
different job classes.  More precisely, if there are $N(j)$ jobs of
class $j$ in the system, $j=1,2,\ldots,M$, each class $k$ job receives a
fraction $G(k)/(\sum\_{j=1}^{M} G(j)*N(j))$ of the processor capacity.",
}

@ARTICLE{Fich80:Methods,
AUTHOR="George Fiche",
TITLE="Methods of evaluating {E10B} system traffic handling capacity",
JOURNAL="Commutation and transmission",
PAGES="103-116",
YEAR=1980,
KEYWORDS="Performance evaluation; switching system",
}

@ARTICLE{Fire80:Experimental,
AUTHOR="R. M. Firestone",
TITLE="An experimental {LISP} system for Sperry {UNIVAC} 1100 series",
JOURNAL=sigplan,
VOLUME=15,
NUMBER=1,
PAGES="117-129",
YEAR=1980,
REFERENCES=3,
KEYWORDS="Programming language; realization; lisp",
ANNOTE="An experimental lisp system has been developed for use on sperry
univac 1100 series computers. Although the general design of the system
is fairly traditional, a number of extensions have been made to the
customary nucleus which significantly improve the ease of use of the
language.",
}

@TECHREPORT{Fish80:Notes,
AUTHOR="G. S. Fishman",
TITLE="Notes on linear recurrence generators modulo 2",
INSTITUTION="UNIVERSIY OF NORTH CAROLINA",
ADDRESS="Chapel Hill",
YEAR=1980,
REFERENCES=1,
KEYWORDS="Shift register sequences; Tausworthe generator; random number
generation; test; runtime/storage efficiency; runs up and down test",
ANNOTE="Given the well established imperfections inherent in the class
of linear congruential generators, one naturally is curious about
alternative approaches to random number generation on a computer via a
method free of these imperfections. Tausworthe has suggested the use of
linear recurrence generators modulo 2 as an improved method of random
number generation. This selection describes these generators, including
their desirable and undesirable th",
}

@TECHREPORT{Fish80:Search,
AUTHOR="G. S. Fishman and L. R. Moore",
TITLE="In search of correlation in multiplication congruential
generators with modulus 2**31-1",
INSTITUTION="University of North Carolina",
ADDRESS="Chapel Hill, North Carolina",
NUMBER="80-5",
YEAR=1980,
REFERENCES=24,
KEYWORDS="Shift register sequences; comparison; bibliography;
runtime/storage efficiency; lattice test; spectral test; periodogram;
random number generation",
ANNOTE="This paper describes an empirical search for correlation in
sample sequences produced by 16 multiplicative congruential random
number generators with modulus 2**31-1.",
}

@ARTICLE{Flei80:Grundlagen,
AUTHOR="F. Fleischmann",
TITLE={Grundlagen des flächendeckenden {DV-Grossprojektes} {"START"}},
JOURNAL=siemenstr,
VOLUME=3,
NUMBER=2,
PAGES="155-159",
YEAR=1980,
LANGUAGE="German",
REFERENCES=1,
KEYWORDS="Survey; existing network; private network; computer network;
network topography; reservation system",
ANNOTE={Im folgenden Beitrag sind die Grundlagen des Projekts "START"
beschrieben. Das System ist - technisch gesehen - ein heterogenes
Rechnernetz, dessen Hauptkomponenten die START-Rechner und die bereits
bestehenden Auskunfts- und Buchungssysteme der Deutschen Bundesbahn, der
Deutschen Lufthansa und der Touristik Union International sind.},
}

@ARTICLE{Flei80:Verteilte,
AUTHOR="F. Fleischmann",
TITLE={Verteilte Verarbeitung in heterogenen Rechnernetzen am Beispiel
des flächendeckenden {DV-Grossprojekts} {"START"}},
JOURNAL=siemenstr,
ADDRESS="München",
VOLUME=3,
PAGES="245-252",
YEAR=1980,
LANGUAGE="German",
REFERENCES=1,
KEYWORDS="Application; reservation system; private network; star
network; basic mode; HDLC",
ANNOTE="Dieser Beitrag zeigt am Beispiel des Großprojekts START die
Möglichkeiten der verteilten Verarbeitung in heterogenen Rechnernetzen,
bezogen auf Kommunikation und Administration. Es werden die Gründe für
eine Lösung mit verteilter Verarbeitung anstelle einer rein zentralen
Lösung diskutiert.",
}

@ARTICLE{Fran80:Prioritized,
AUTHOR="William R. Franta and M. B. Bilodeau",
TITLE="Analysis of a prioritized {CSMA} protocol based on staggered
delays",
JOURNAL=acta,
VOLUME=13,
NUMBER=4,
PAGES="299-324",
YEAR=1980,
KEYWORDS="communication protocol; broadcast; communication; LAN; CSMA;
carrier sense multiple access; evaluation",
ANNOTE="Carrier sense multiple access (CSMA) protocols were originally
conceived for use in digital radio communication. Such protocols are,
however, quite applicable in a variety of distributed computing and
local networking configurations based on a shared bus.",
}

@ARTICLE{Fred80:Approximations,
AUTHOR="A. Fredericks",
TITLE="Approximations for customer-viewed delays in multiprogrammed,
transaction-oriented computer systems",
JOURNAL=bstj,
VOLUME=59,
PAGES="1559-1575",
YEAR=1980,
KEYWORDS="Queueing system; multiprogramming; queueing network; M/G/1;
interdeparture time; output process",
ANNOTE="A multiprogramming computer system is considered. For an
external queue in front of the system entrance the mean waiting time is
calculated by an approximation formula, where the mean forward
recurrence time of the interdeparture process of the saturated system is
the most important parameter.",
}

@ARTICLE{Free80:Discrete,
AUTHOR="H. T. Freedman and T. R. Harms",
TITLE="A discrete-event simulation analysis of loop network assignment
operations",
JOURNAL=bstj,
VOLUME=59,
YEAR=1980,
KEYWORDS="Simulation",
}

@INPROCEEDINGS{Gall80:Flow,
AUTHOR="Robert Gallager and S. J. Golestaani",
TITLE="Flow Control and Routing Algorithms for Data Networks",
BOOKTITLE=iccc,
ADDRESS="Atlanta",
PAGES="779-784",
YEAR=1980,
REFERENCES=8,
KEYWORDS="flow control; routing algorithm",
ANNOTE="We consider flow control algorithms consisting of two parts:
quasi-static flow control and dynamic flow control. The quasi - static
part uses short term average information on network utilization to
allocate maximum data rates and to determine routes for each user. The
rates are allocated to achieve an optimal tradeoff between assigned
priority cost functions for each user and the cost of congestion in the
network. This optimization can",
}

@ARTICLE{Gaud80:Recursive,
AUTHOR="M. D. Gaudreau",
TITLE="Recursive Formulas for the Calculation of Point-to-Point
Congestion",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=3,
PAGES="313-316",
YEAR=1980,
REFERENCES=4,
KEYWORDS="Congestion; routing algorithm; circuit switching; link
system",
ANNOTE="This paper presents recursive formulas for calculating the
point-to-point congestion in a circuit-switched telecommunication
network. This congestion value is derived from the individual blocking
probabilities of each link, with or without regard to switch blocking.
The approach is valid for alternate routing plans with a fixed sequence
of route selection, using a link-by-link call setup procedure. The
formulas presented here contrast with conv",
}

@ARTICLE{Geor80:Modeling,
AUTHOR="Nicolaos D. Georganas",
TITLE="Modeling and analysis message switched computer-communication net
works with multilevel flow control",
JOURNAL=cn,
VOLUME=4,
NUMBER=6,
PAGES="285-294",
YEAR=1980,
REFERENCES=23,
KEYWORDS="Computer network; message switching; network flow; evaluation;
model; flow control",
ANNOTE="A message-switched network with three-level flow-control, namely
end-to-end, local and global, is considered. A queueing model of the
entire controlled network, including probabilistic routing, is
developed. Fixed routing becomes a special case. Analytic expressions
for the important system measures such as average network throughput,
average delay and blocking probability are obtained. The results can be
applied to message-switched networks ha",
}

@ARTICLE{Gerk80:Digitale,
AUTHOR="P. Gerke and P. Bocker",
TITLE="Das digitale Telefonie-Netz {(DTN)} - Ein alldigitales
Fernsprechernetz für Sprach-, Daten-, Text- und Faksimilekommunikation",
JOURNAL=fernmeldepraxis,
VOLUME=57,
NUMBER=8,
PAGES="293-309",
YEAR=1980,
LANGUAGE="German",
REFERENCES=6,
KEYWORDS="Digital network; communication network; data network; PCM;
future outlook",
ANNOTE="Consideration of a future universal digital network for
telephony, data, and other services.",
}

@INPROCEEDINGS{Gerl80:Routing,
AUTHOR="M. Gerla and P. O. Nilsson",
TITLE="Routing and Flow Control Interplay in Computer Networks",
BOOKTITLE=iccc,
ADDRESS="Atlanta",
PAGES="84-89",
YEAR=1980,
REFERENCES=9,
KEYWORDS="Packet switching; routing algorithm; flow control",
ANNOTE={In this paper, we propose a technique which accounts for such
combined effect. We show that the exact solution is computationally very
complex to obtain, and present an approximate, iterativ solution
approach based on Mean Value analysis of a closed network, and on Flow
Deviation optimization of an "eqivalent" open network.},
}

@MISC{Gies80:Simulation,
AUTHOR="A. Giessler",
TITLE="Simulation von X.25-Paketvermittlungsnetzen",
PUBLISHER="Seminare Datenfernverarbeitung am Lehrstuhl für allgemeine
Elektrotechnik und DFV, RWTH Aachen",
ADDRESS="Aachen",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Simulation; X.25; packet switching; model; network design;
virtual channel; VL; virtual line; GMDnet; throughput guarantee",
ANNOTE="Simulationssystem; 1. Netzmodel; 2. Simulationskommandos; 3.
Programmaufwand; 4. Realisierung: Sprache, Netzkomponenten,
Baukastenprinzip, Netzfunktionen, Netzablaufsteuerung; 5. Forderungen an
eine Netz-Simulationssprache.",
}

@MISC{Gies80:X,
AUTHOR="A. Giessler and A. Jägemann and E. Mäser",
TITLE="{X.25} network simulation",
TYPE="Internal report",
INSTITUTION="GMD, Institut für DFV",
ADDRESS="Darmstadt",
PAGES="1-23",
YEAR=1980,
REFERENCES=5,
KEYWORDS="Communication network; X.25; network throughput; simulation;
packet switching; virtual channel; network design; model; throughput
guarantee; GMDnet; VL; virtual line; control; multiplexer",
ANNOTE="The problem of throughput guarantees in public packet networks
is considered and has been studied by simulation methods. The simulation
experiments are based on a transportation system applying a DCE-DCE
end-to-end protocol.",
}

@ARTICLE{Gonz80:Analyse,
AUTHOR="O. Gonzalez Soto and J. A. Garcia Higuera and C. D. Berzosa and 
others",
TITLE="Analyse von Prozessorsteuerungen durch anpassungsfähige
Simulationsmodelle",
JOURNAL=en,
ADDRESS="Stuttgart",
VOLUME=55,
PAGES="26-36",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Switching system; simulation",
ANNOTE="German Version of Paper \#527, 9th ITC",
}

@ARTICLE{Gonz80:New,
AUTHOR="T. F. Gonzalez and D. B. Johnson",
TITLE="A new algorithm for preemptive scheduling of trees",
JOURNAL=jacm,
VOLUME=27,
PAGES="287-312",
YEAR=1980,
REFERENCES=14,
KEYWORDS="Method; runtime/storage efficiency; queueing discipline;
optimization; preemptive scheduling; finish time",
ANNOTE="An algorithm which schedules forests of $n$ tasks on $m$
identical processors in $O(n*\log m)$ time, offline, is given. The
schedules are optimal with respect to finish time and contain at most
n-2 preemptions, a bound which is realized for all n. Also given is a
simpler algorithm which runs in $O(n*m)$ time on the same problem and
can be adapted to give optimal finish time schedules on-line for
independent tasks with release times.",
}

@ARTICLE{Gord80:Impact,
AUTHOR="K. D. Gordon and L. W. Dowdy",
TITLE="The impact of certain parameter estimation errors in queueing
network models",
JOURNAL=per,
VOLUME=9,
NUMBER=2,
PAGES="3-9",
YEAR=1980,
REFERENCES=11,
KEYWORDS="realization; performance evaluation; model; parameter
estimation; queueing network",
ANNOTE="The effect that parameter estimation errors have on performance
in closed product form queueing networks is investigated. In particular,
the effects of errors in the relative utilization estimates of the
servers are analyzed. It is shown that in single class load independent
networks, the resulting errors in throughput and utilizations are of
approximately the same percentage as the errors in the relative
utilization estimates. This result does",
}

@ARTICLE{Görd80:COPE,
AUTHOR="C. Gördt and W. Materna",
TITLE="{COPE,} ein Instrumentarium zur quantitativen Bewertung von
Rechensystemen",
JOURNAL="Informatik Fachberichte",
VOLUME=27,
PAGES="18-27",
YEAR=1980,
LANGUAGE="German",
REFERENCES=6,
KEYWORDS="Design; realization; method; sampling; SIMULA; program
construction; queueing system; discrete event simulation",
ABSTRACT="Das Programmsystem Cope (computer performance evaluator) ist
ein Instrumentarium zur leistungsgerechten Konfigurierung und
Dimensionierung von rechensystemen aus existenten bzw.  projektierten
Hardware- oder Software-Komponenten.  Das Instrumentarium soll den
Hersteller von Rechensystemen in die Lage versetzen, Rechensysteme den
Leistungsvorstellungen potentieller Kunden anzupassen.  Ferner soll es
den Anwender von Rechensystemen in Aufgaben",
}

@TECHREPORT{Gorg80:DIAMANT,
AUTHOR="C. Görg and B. Compte",
TITLE="{DIAMANT} - Diagramm - Manipulation - und - Test - system oder
Konventionen zur Datenübertragung zwischen {SIEMENS/151} und {HP}
9820-plotter",
INSTITUTION="Interner Bericht, Lehrstuhl für DFV, RWTH Aachen",
ADDRESS="Aachen",
PAGES="1-23",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Computer communication; graphics; PASCAL",
ANNOTE="Siemens/151; Aufruf, Parameter, Dateien; Eingabe; Steuerbefehle;
Plotbefehle; Implementierung; HP 9820; HP-programmbeschreibung;
Speicherbelegung; Anhang: Beispiel",
}

@ARTICLE{Gran80:Congestion,
AUTHOR="J.-L. Grange and J. C. Majithia",
TITLE="Congestion Control for a Packet-Switched Network",
JOURNAL=comcom,
VOLUME=3,
PAGES="106-116",
YEAR=1980,
KEYWORDS="Computer network; packet switching; congestion control",
}

@ARTICLE{Gree80:Queueing,
AUTHOR="L. Green",
TITLE="A queueing system in which customers require a random number of
servers",
JOURNAL=or,
VOLUME=28,
PAGES="1335-1346",
YEAR=1980,
KEYWORDS="Queueing system; multiserver",
}

@ARTICLE{Grog80:Graphic,
AUTHOR="A. W. Grogono",
TITLE="Graphic color slides",
JOURNAL=byte,
VOLUME=5,
NUMBER=11,
PAGES="126-144",
YEAR=1980,
KEYWORDS="graphics; BASIC; two-dimensional plot; three-dimensional plot;
realization; design; process interaction",
}

@ARTICLE{Half80:Heavy,
AUTHOR="S. Halfin and W. Whitt",
TITLE="Heavy traffic limits for queues with many exponential servers",
JOURNAL=or,
VOLUME=29,
PAGES="567-588",
YEAR=1980,
KEYWORDS="Queueing system; multiserver; heavy traffic approximation",
}

@ARTICLE{Hand80:Gedanken,
AUTHOR="W. Händler and H. Rohrer",
TITLE="Gedanken zu einem Rechner-Baukasten-System",
JOURNAL=er,
VOLUME=22,
PAGES="3-13",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Microprocessor; multiprocessor system; interconnection
network",
ANNOTE="Dirmu",
}

@ARTICLE{Hard80:Local,
AUTHOR="K. Hardwick and W. Federbusch",
TITLE="Local networking: the missing link emerges",
JOURNAL=datacommunications,
VOLUME=9,
NUMBER=7,
PAGES="81-89",
YEAR=1980,
KEYWORDS="LAN; survey; future outlook",
ANNOTE="This excellent summary article discusses the issues in local
networks and the probable evolution of these networks in the coming
decade.",
}

@ARTICLE{Hart80:Theoretische,
AUTHOR="U. Hartmann",
TITLE="Theoretische Grundlagen für Fernsprechuntersuchungen",
JOURNAL="Unterrichtsblätter der Deutschen Bundespost",
VOLUME=33,
PAGES="117-127",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Traffic engineering",
}

@MISC{Haup80:Tightly,
AUTHOR="D. Haupt and D. Suffner",
TITLE="Tightly and loosely coupled systems",
PUBLISHER="Das aktuelle Schlagwort, Inf. Spektrum",
VOLUME=3,
PAGES="123-124",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Multiprocessor system; computer system; tightly coupled
system; loosely coupled system",
}

@ARTICLE{Hels80:DISCO,
AUTHOR="K. Helsgaun",
TITLE="{DISCO} - a {SIMULA-based} language for continuous combined and
discrete simulation",
JOURNAL="Simulation",
VOLUME=35,
NUMBER=1,
PAGES="1-12",
YEAR=1980,
KEYWORDS="SIMULA; continuous simulation; discrete event simulation",
ANNOTE="Disco is an enhancement of simula that permits the modeling of
continuous as well as discrete processes in the same program.",
}

@INCOLLECTION{Hert80:Computer,
AUTHOR="F. R. Hertweck",
TITLE="Computer networks: recent trends and issues related to command
languages",
BOOKTITLE="Command language directions",
EDITOR="D. Beach",
ORGANIZATION="IFIP",
PUBLISHER="North Holland",
PAGES="369-383",
YEAR=1980,
REFERENCES=7,
KEYWORDS="communication network; command language; survey",
ANNOTE="In recent years, packet switching technology for data
communications has become popular and layered models of protocols have
been developed. While the lower levels are communication oriented, the
higher levels are increasingly relevant to the issue of command
languages in distributed systems.",
}

@ARTICLE{Herz80:Leistungsbewertung,
AUTHOR="U. Herzog",
TITLE="Leistungsbewertung hierarchisch organisierter
Mehrprozessor-Rechenanlagen mit Berücksichtigung beliebig verteilter
Bearbeitungszeiten",
JOURNAL=aeu,
VOLUME=34,
NUMBER=2,
YEAR=1980,
LANGUAGE="German",
REFERENCES=14,
KEYWORDS="Parallel computing; performance evaluation",
}

@ARTICLE{Heue80:Bemessung,
AUTHOR="P. Heuer",
TITLE="Bemessung des Empfangsspeichers einer Teletex-Endstelle",
JOURNAL=ntzarchiv,
VOLUME=2,
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Queueing system; discrete time; Teletex",
}

@ARTICLE{Hobe80:SNA,
AUTHOR="V. L. Hoberecht",
TITLE="{SNA} function management",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="594-603",
YEAR=1980,
REFERENCES=4,
KEYWORDS="Digital network; packet switching; communication protocol;
SNA; function management",
ANNOTE="SNA defines three categories of messages which flow on LU-to-LU
sessions - session control, data flow control, and function management
data. This paper discusses the structure and semantics of messages and
protocols used by one LU to manage functions performed by a remote LU.
The relationship between distribution of function, the nature of the
information, the technology, and the architecture of the data stream
will be discussed. The data",
}

@ARTICLE{Hofr80:Disk,
AUTHOR="M. Hofri",
TITLE="Disk scheduling: {FCFS} vs. {SSTF} revisited",
JOURNAL=cacm,
VOLUME=23,
PAGES="645-653",
YEAR=1980,
REFERENCES=8,
KEYWORDS="Queueing discipline; simulation; process management; SPT;
FIFO",
ANNOTE="We report on a rather extensive simulation effort directed at
evaluating the merits of two scheduling strategies, fcfs and sstf, for
moving-arm disks under stationary request arrival process. For
first-come-first-served (FCFS) scheduling, analytic results for the mean
waiting time are also given (in a closed form). If the objective of a
schedule is to minimize the mean waiting time (or queue size) and its
variance, the results seem to confirm",
}

@INPROCEEDINGS{Hopp80:KIWINET,
AUTHOR="K. Hopper",
TITLE="The {KIWINET/NICOLA} approach: implementation in a heterogeneous
network with at least one node",
BOOKTITLE="Command language directions",
EDITOR="D. Beach",
ORGANIZATION="IFIP",
PUBLISHER="North Holland",
PAGES="389-401",
YEAR=1980,
REFERENCES=5,
KEYWORDS="Communication network; command language",
}

@INPROCEEDINGS{Hube80:EDX,
AUTHOR="J. Huber",
TITLE="{EDX} - A Uniform System Architecture for Circuit, Packet, and
Message Switching",
BOOKTITLE=iccc,
ADDRESS="Atlanta",
PAGES="195-201",
YEAR=1980,
REFERENCES=3,
KEYWORDS="Network architecture; packet switching; network; switching
system",
ANNOTE="The paper describes a system architecture with new hardware and
software technology for more versatile data communications. Packet,
circuit and message switching are the main application areas which are
under consideration. The possibility of providing Value Added Services
can be seen on the basis of a model comprising entire functional
hardware modules assigned to tasks in accordance with the layered
techniques as defined in the ISO layered ar",
}

@ARTICLE{Hübn80:Offentliche,
AUTHOR="T. Hübner and W. Tietz",
TITLE="Öffentliche Datennetze in Europa",
JOURNAL=ntz,
VOLUME=33,
NUMBER=5,
PAGES="314-319",
YEAR=1980,
LANGUAGE="German",
REFERENCES=8,
KEYWORDS="Communication network; bibliography; future outlook; public
network; EURONET",
ANNOTE="In den verschiedenen europäischen Ländern ist der Ausbau der
Datennetze unterschiedlich weit fortgeschritten. Wie der Stand der Dinge
ist und welche weiteren Pläne bestehen, geht aus einer kürzlich in der
3. Auflage veröffentlichten CEPT studie hervor.",
}

@ARTICLE{Hwan80:Resource,
AUTHOR="K. Hwang and L. M. Ni",
TITLE="Resource optimization of a parallel computer for multiple vector
processing",
JOURNAL=ieeetc,
VOLUME="C-29",
PAGES="831-836",
YEAR=1980,
KEYWORDS="Parallel computing; queueing system",
}

@ARTICLE{Ikeh80:Response,
AUTHOR="S. Ikehara",
TITLE="Evaluation of response time and dynamic processor scheduling in a
function distributed system",
JOURNAL=recl,
VOLUME=28,
PAGES="1039-1052",
YEAR=1980,
KEYWORDS="Multiprocessor system; performance evaluation",
}

@BOOK{Iosi80:Finite,
AUTHOR="M. Iosifescu",
TITLE="Finite Markov Processes and Their Applications",
ISBN="0-471-27677-4",
PUBLISHER="John Wiley and Sons",
ADDRESS="Chichester-New",
YEAR=1980,
KEYWORDS="Markov process; Markov chain",
ANNOTE="1. Elements of probability theory and linear algebra 2.
Fundamental concepts in homogeneous Markov chain theory 3. Absorbing
Markov chains 4. Ergodic Markov chains 5. General properties of Markov
chains 6. Applications of Markov chains in psychology and genetics 7.
Nonhomogeneous Markov chains",
}

@ARTICLE{Jack80:Formatting,
AUTHOR="M. Jackel",
TITLE="A formatting parser for {PASCAL} programs",
JOURNAL=sigplan,
VOLUME=15,
NUMBER="7,8",
PAGES="58-63",
YEAR=1980,
KEYWORDS="Method; documentation; Pascal; text processing; formatting
parser",
}

@ARTICLE{Jaco8001:Virtual,
AUTHOR="T. Jacobsen and P. Hogh and Jeff Hansen",
TITLE="Virtual terminal protocols transport service and session
control",
JOURNAL=ccr,
VOLUME=10,
NUMBER="1-2",
PAGES="24-40",
MONTH="January/April",
YEAR=1980,
REFERENCES=16,
KEYWORDS="communication protocol; transport layer; session layer;
virtual terminal protocol",
ABSTRACT="The method to identify the different terminal protocols for
euronet and the parameter selection mechanism in vpt-d, particularly the
terminal mode, are discussed. based on this, the problems concerning
protocol shift are investigated. an integrated solution is outlined and
the iso reference model of open systems interconnection is enhanced.",
}

@ARTICLE{Jaco8001:CCITT,
AUTHOR="T. Jacobsen and P. Thisted",
TITLE="{CCITT} recommendation {X.25} as part of the {ISO} reference
model of open systems interconnection",
JOURNAL=ccr,
VOLUME=10,
NUMBER="1-2",
PAGES="48-55",
MONTH="January/April",
YEAR=1980,
REFERENCES=2,
KEYWORDS="network flow; X.25; ISO reference model; packet switching",
ABSTRACT="The CCITT recommendation X.25 is discussed in view of the ISO
reference model of open systems interconnection. It is stated that X.25
may serve as an access method of layer 3, 4 as well as 5, depending of
the actual architecture. the flow-control principles of X.25 are
discussed and a clarification is recommended.",
}

@ARTICLE{Jafa80:Simulation,
AUTHOR="H. Jafari and T. G. Lewis and J. D. Spragins",
TITLE="Simulation of a class of ring-structured networks",
JOURNAL=ieeecom,
VOLUME="COM-29",
YEAR=1980,
KEYWORDS="Loop system; LAN; simulation; performance evaluation; ring
network; packet switching; computer network; network throughput; network
delay; distributed control; transmission delay",
ANNOTE="This paper presents a new modular loop/ring architecture
combining advantages of several earlier centralized and decentralized
ring-structured loop networks while remaining simple. This is
accomplished by introducing two major innovations: first, use of a
seperate control loop for control messages flowing between nodes and a
loop controller; second, dynamically implementing partitionable segments
between adjacent nodes and treating them as sepe",
}

@INPROCEEDINGS{Jaff80:Decentralized,
AUTHOR="Joseph Jaffe",
TITLE={A Decentralized, "Optimal", Multiple-User, Flow Control
Algorithm},
BOOKTITLE=iccc,
ADDRESS="Atlanta",
PAGES="839-844",
YEAR=1980,
REFERENCES=11,
KEYWORDS="Flow control; virtual channel; packet switching",
ANNOTE={The problem of optimal flow control in a store-and-forward
network is analyzed. Multiple users sharing the links of the network
each attempt to adjust their throughput rates to achieve an ideal
delay-throughput tradeoff. Each user has a fixed path, or virtual
circuit. In the above environment, one motion of "ideal delay-throughput
tradeoff" is defined and motivated. This "ideal policy" is implemented
via a decentralized algorithm that achieves},
}

@ARTICLE{Jajs80:Effect,
AUTHOR="A. Jajszczyk and J. Rajski",
TITLE="The effect of choosing the switches for rearrangements in
switching networks",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="1832-1834",
YEAR=1980,
REFERENCES=4,
KEYWORDS="Switching network; rearrangement",
}

@ARTICLE{Jana80:Multiplexing,
AUTHOR="N. Janakiraman and B. Pagirel and J. E. Neilson",
TITLE="Multiplexing low-speed buffered data terminals",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="1838-1843",
YEAR=1980,
REFERENCES=10,
KEYWORDS="Concentrator; buffer length; TDM; time division multiplex",
ABSTRACT="when terminals (data and/or voice), connected to an
asynchronous time division multiplexer (atdm), are buffered and operate
at low speed, the arrivals at the mulitplexer are correlated. in this
paper, we consider the finite buffer behavior of an atdm with such
terminals. an earlier study by rudin is a special case of this approach.
the treatment here is also an improvement over the analysis by birdsall
OTHERS. of an atdm with speech sources and",
}

@ARTICLE{Jans80:DIMOND,
AUTHOR="P. G. Jansen and J. L. W. Kessels",
TITLE="The {DIMOND:} a component for the modular construction of
switching networks",
JOURNAL=ieeetc,
VOLUME="C-29",
PAGES="884-889",
YEAR=1980,
REFERENCES=5,
KEYWORDS="Switching network; switching component",
ANNOTE="The dimond is a building block for communication networks in
which throughput is more important than transmission delay. Its main
attraction stems from the fact that it allows the routing of messages
through a network to be completely distributed over the individual
building blocks.",
}

@INPROCEEDINGS{Jask80:Planning,
AUTHOR="G. Jaskulke",
TITLE="Planning of local exchange areas by introduction of subscriber
concentrators",
BOOKTITLE="ISSLS",
ADDRESS="Atlanta",
YEAR=1980,
KEYWORDS="Network planning",
}

@ARTICLE{Jenk80:Control,
AUTHOR="J. H. Jenkins and J. A. Howard",
TITLE="Control overhead - a performance metric for evaluating
control-unit designs",
JOURNAL=ieeetc,
VOLUME="C-29",
PAGES="300-307",
YEAR=1980,
REFERENCES=20,
KEYWORDS="Performance evaluation; hardware monitor; model; resource;
overhead; computer; sensitivity analysis",
ANNOTE="The basic goal in the design of computer control units is the
efficient, high-speed allocation, orchestration, and synchronization of
the computer resources. The key concept to meeting the above
requirements is the continual optimization of the control structure
during the design process. This paper defines an approach to control
optimization which is independent of the particular control structure.
Specifically, a metric-termed control overhea",
}

@ARTICLE{Jenq80:Stability,
AUTHOR="Y.-C. Jenq",
TITLE="On the stability of slotted {ALOHA} systems",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="1936-1944",
YEAR=1980,
REFERENCES=4,
KEYWORDS="Packet switching; ALOHA; network stability; busy sense
multiple access; packet radio; TDMA; time division multiple access",
ANNOTE="In this correspondence we prove the following properties of the
stability of the finite population model slotted aloha systems. 1) the
input-output packet flow balance principle and the concept of expected
drift used for the stability analysis of the slotted aloha system are
mathematically equivalent. 2) the slotted aloha system can only have
either one stable equilibrium point or three equilibrium points, with
the first one and the third one s",
}

@ARTICLE{Jenq80:Calculations,
AUTHOR="Y.-C. Jenq",
TITLE="On calculations of transient statistics of a discrete queueing
system with independent general arrivals and geometric departures",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="908-910",
YEAR=1980,
REFERENCES=5,
KEYWORDS="GI/M/1; queue length; transient behaviour",
ANNOTE="An approximation algorithm is developed for calculating
transient mean and variance of the queue size of a discrete queueing
system with independent general arrivals and geometric output processes.
The algorithm makes no assumption on the form of the distribution
function of the arrival process and only the first three moments of the
arrival process are required. Three numerical examples are presented.",
}

@ARTICLE{Jone80:Efficient,
AUTHOR="S. K. Jones and R. K. Cavin and D. A. Johnston",
TITLE="An efficient computational procedure for the evaluation of the
{M/M/1} transient state occupancy probabilities",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="2019-2020",
YEAR=1980,
REFERENCES=7,
KEYWORDS="Store-and-forward; M/M/1; queue length; transient behaviour;
ircular coverage function",
ANNOTE="In this note a procedure is given for the numerical evaluation
of the m/m/1 queue transient state occupancy probabilities which arise
in the analysis of dynamic buffer behavior in store and forward
networks. The procedure uses the circular coverage function of radar and
communication theory to eliminate an infinite series of modified bessel
functions.",
}

@ARTICLE{Jung80:Busy,
AUTHOR="M. M. Jung",
TITLE="Busy period distribution in an {SPC} processor having a
clock-pulse operated gate",
JOURNAL=ptr,
VOLUME=38,
PAGES="84-89",
YEAR=1980,
KEYWORDS="Queueing system; switching",
ANNOTE="also ITC 9 (paper 513)",
}

@INPROCEEDINGS{Kamo80:Congestion,
AUTHOR="F. Kamoun and A. Belguith and J.-L. Grange",
TITLE="Congestion Control with a Buffer Management Stategy Based on
Traffic Priorities",
BOOKTITLE=iccc,
ADDRESS="Atlanta",
PAGES="845-850",
YEAR=1980,
REFERENCES=10,
KEYWORDS="packet switching; congestion; congestion control",
ANNOTE={In this paper a distributed congestion control policy (SDMXQ)
based on nodal buffer management is proposed and analyzed. This policy
is such that at any node a maximum value is imposed on the number of
buffers to be allocated to any output queue. More importantly, two
classes of traffic are identified: "new" and "transit". At any node if
the 'total' number of allocated buffers exceeds a 'limit value' then the
incoming "new" traffic is},
}

@ARTICLE{Kamo80:Shared,
AUTHOR="F. Kamoun and L. Kleinrock",
TITLE="Analysis of shared finite storage in a computer network node
environment under general traffic conditions",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="992-1003",
YEAR=1980,
KEYWORDS="queueing system; computer network; ARPAnet; store-and-forward;
queueing network; buffer length; buffer memory; switching system;
blocking; product form; memory management",
ANNOTE="Nodal storage limitations in a store and forward computer
network lead to blocking; this results in degradation of network
performance due to the loss or retransmission of blocked messages. Five
sharing schemes are examined, analyzed, and displayed in a fashion which
permits one to establish the tradeoffs among blocking probability,
utilization, throughput, and delay. The key to the analysis lies in the
observation that the equilibrium join",
}

@INPROCEEDINGS{Kawa80:Method,
AUTHOR="T. Kawaoka and  others",
TITLE="A method for verifying layered protocol products",
BOOKTITLE=iss,
ADDRESS="Atlanta",
PAGES="379-384",
YEAR=1980,
KEYWORDS="Protocol engineering",
}

@ARTICLE{Kaye80:Interactive,
AUTHOR="D. R. Kaye",
TITLE="Interactive {PASCAL} input",
JOURNAL=sigplan,
VOLUME=15,
NUMBER=1,
PAGES="66-76",
YEAR=1980,
REFERENCES=1,
KEYWORDS="Interactive mode; PASCAL",
}

@TECHREPORT{Keil80:Laguerre,
AUTHOR="Julian Keilson and W. H. Nunn and U. Sumita",
TITLE="The Laguerre transform",
INSTITUTION="CNA",
ADDRESS="Alexandria, Virginia",
NUMBER=284,
PAGES="1-119",
YEAR=1980,
REFERENCES=32,
KEYWORDS="Laguerre transform; Laguerre polynomial; convolution integral;
Lindley integral equation",
ANNOTE="A novel transform is presented which maps continuum functions
(such as probabilty distributions) into discrete sequences and permits
rapid numerical calculations, multiple convolutions, and neumann
expansions for volterra integral equations. The transform is based on
the laguerre polynomials, associated laguerre functions, and their
convolution properties.",
}

@ARTICLE{Kent80:Programmable,
AUTHOR="S. A. Kent",
TITLE="A programmable network virtual machine",
JOURNAL=cn,
VOLUME=4,
NUMBER=3,
PAGES="125-137",
YEAR=1980,
REFERENCES=36,
KEYWORDS="Computer network; design; access control; network management",
ANNOTE="The increasing diversity of resources which is becoming
available to users through the introduction of computer networks has
opened up new areas of investigation. One of the problems encountered is
that of providing uniform and common access procedures where
functionally similar facilities exist on different systems. One approach
to solving these problems is to create an agent that is able both to
automate remote access procedures on the us",
}

@ARTICLE{Kerk80:Buffer,
AUTHOR="H. K. Kerke and C. L. Saxena and Mohd Khalid",
TITLE="Buffer behaviour for mixed arrivals and single server with random
interruptions",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="59-64",
YEAR=1980,
REFERENCES=13,
KEYWORDS="G/G/1/*/W; FIFO; TDM; time division multiplex; PCM;
interrupted service",
ANNOTE="A queueing model with finite buffer size, mixed input traffic
(Poisson and burst Poisson arrivals), synchronous transmission and
server interruptions through a bernoulli sequence of independent random
variables is studied. Using average burst length, traffic intensity and
input traffic mixture ratio as parameters, the relationships among
buffer size, overflow probability and expected message queueing delay
are obtained. An integrated digital vo",
}

@ARTICLE{Kerm80:Dynamic,
AUTHOR="Parviz Kermani and L. Kleinrock",
TITLE="Dynamic flow control in store-and-forward computer networks",
JOURNAL=ieeecom,
VOLUME="COM-28",
YEAR=1980,
KEYWORDS="Computer network; flow control; message switching; heuristics;
network flow; transport layer; window mechanism",
ANNOTE={In this paper we study a "dynamic flow control" in which
parameters of the system are dynamically adjusted to match the
availability of resources in the network. Based on Markov decision
theory, an optimal policy to dynamically select the number of tokens is
formulated. Because an exact solution to the problem is extremely
difficult, an effective heuristic solution to the problem is presented.
Numerical results are given and it is shown tha},
}

@ARTICLE{Kerm80:Static,
AUTHOR="L. Kleinrock and Parviz Kermani",
TITLE="Static flow control in store-and-forward computer networks",
JOURNAL=ieeecom,
VOLUME="COM-28",
YEAR=1980,
KEYWORDS="Computer network; flow control",
}

@ARTICLE{Kers80:Second,
AUTHOR="A. Kershenbaum and R. R. Boorstyn and R. Oppenheim",
TITLE="Second-order Greedy algorithms for centralized teleprocessing
network design",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="1835-1838",
YEAR=1980,
REFERENCES=10,
KEYWORDS="heuristics; data network; computer network; greedy algorithm",
ANNOTE="We consider the problem of designing a centralized
telecommunication network comprised of multipoint lines given a set of
terminal locations, traffic requirements, and a common central site. The
optimal solution to this problem is a capacitated minimal spanning tree.
We develop a class of heuristic algorithms for the solution of this
problem by imbedding heuristics, referred to as first-order greedy
algorithms, inside a loop where small, care-",
}

@INCOLLECTION{Kill80:Teilnehmerstation,
AUTHOR="Ulrich Killat",
TITLE="Teilnehmerstation für ein Netz mit dezentraler Vermittlung",
BOOKTITLE="Philips: Unsere Forschung in Deutschland",
PUBLISHER="Philips",
VOLUME=3,
PAGES="128-132",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Switching; loop system; LAN",
}

@ARTICLE{King80:Numerical,
AUTHOR="P. King and I. Mitrani",
TITLE="Numerical methods for infinite Markov processes",
JOURNAL=per,
PAGES="277-282",
YEAR=1980,
REFERENCES=9,
KEYWORDS="Markov process; model; numerical method; estimation; steady
state probability",
ANNOTE="The estimation of steady state probability distributions of
discrete Markov processes with infinite state spaces by numerical
methods is investigated. The aim is to find a method applicable to a
wide class of problems with a minimum of prior analysis. A general
method of numbering discrete states in infinite domains is developed and
used to map the discrete state spaces of Markov processes into the
positive integers, for the purpose of applying",
}

@ARTICLE{Kirb80:Measurement,
AUTHOR="D. B. Kirby",
TITLE="Performance Measurement in Data Communications Networks",
JOURNAL=comp_design,
VOLUME="nov",
PAGES="77-80",
YEAR=1980,
KEYWORDS="Data communication; performance measurement",
}

@MISC{Kist80:ISO,
AUTHOR="B. Kistner",
TITLE="{ISO-Architekturmodell}",
PUBLISHER="Das Aktuelle Schlagwort, Inf. Spektrum",
VOLUME=3,
PAGES="121-122",
YEAR=1980,
LANGUAGE="German",
REFERENCES=1,
KEYWORDS="Reference; standard; communication protocol; ISO reference
model; physical layer; link layer; network layer; transport layer;
session layer; presentation layer; application layer",
}

@ARTICLE{Klei80:Packet,
AUTHOR="L. Kleinrock and M. O. Scholl",
TITLE="Packet switching in radio channels: new conflict-free multiple
access schemes",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="1015-1029",
YEAR=1980,
KEYWORDS="Packet radio; Packet switching; broadcast; communication;
ALOHA; priority; round robin; random; random access",
ANNOTE="We study new access schemes for a population of geographically
distributed data users who communicate with each other and/or with a
central station over a multiple-access broadcast ground radio
packet-switching channel. We introduce and analyze alternating
priorities (AP), round robin (RR), and random order (RO) as new
conflict-free methods for multiplexing buffered users without control
from a central station. These methods are effective when",
}

@ARTICLE{Koch80:Grafische,
AUTHOR="A. Koch",
TITLE="Grafische Datenverarbeitung mit einem benutzerfreundlichen,
Geräteneutralen Programmsystem am Großrechner {TR} 440",
JOURNAL=er,
VOLUME=22,
NUMBER=3,
PAGES="115-122",
YEAR=1980,
LANGUAGE="German",
REFERENCES=2,
KEYWORDS="Information system; graphics; structure; application;
interactive mode",
ANNOTE="Für den parallelen Betrieb mehrerer Grafik-geräte an einem
Großrechner TR 440 wurde ein geräteneutrales Grafik-system geschaffen. 
Die auszugebenden Bilder werden mittels einer Beschreibungssprache in
einer Texthaltungsdatei beschrieben.  Diese Bilddatei wird in der Regel
durch Aufruf von Grafik-Unterprogrammen erzeugt; sie kann vom benutzer
leicht gelesen und verändert, auf Wunsch auch ohne Hilfe eines Programms
unmittelbar aufgebaut werden.",
}

@ARTICLE{Koge80:Getaktetes,
AUTHOR="E. Koger",
TITLE="Getaktetes Wartesystem mit zwei Warteschlangen unterschiedlicher
Priorität am Beispiel der Vermittlungstechnik",
JOURNAL=nte,
ADDRESS="Berlin",
PAGES="426-430",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Queueing system; priority; simulation; PL/1; performance
evaluation; exhaustive service; M/M/1; NIFO; nearest in first out",
ANNOTE="Mittels Simulation wird ein
Zwei-Warteschlangen-Prioritätensystem mit Exhaustive Service analysiert.
Wartezeiten und notwendige Puffergrössen werden angegeben.",
}

@ARTICLE{Konh80:Queueing,
AUTHOR="A. G. Konheim",
TITLE="A queueing analysis of two {ARQ} protocols",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="1004-1014",
YEAR=1980,
KEYWORDS="queueing system; computer network; ARQ; protocol; DATA
transmission; data retransmission; packet switching",
ANNOTE={In every data communication system, a procedure must be provided
to allow for the retransmission of data when errors are detected. The
receiving node is required to make a (positve/negative) acknowledgment
(ACK/NACK) to the sending node. Until an acknowledgment is received, a
"copy" of the message must be retained at the sending node. In this
paper, we present a queueing analysis of the two ARQ (automatic repeat
request) protocols - block},
}

@ARTICLE{Kons80:Software,
AUTHOR="B. R. Konsynski and W. E. Bracker",
TITLE="Software packages for solving network puzzles",
JOURNAL=datacommunications,
VOLUME=9,
NUMBER=7,
PAGES="69-77",
YEAR=1980,
KEYWORDS="communication network; design; network planning",
ANNOTE="This ARTICLE is an assessment of commercially available
computerized aids for the design, implementation, and control of present
and planned data communications networks.",
}

@ARTICLE{Kraf80:Rationale,
AUTHOR="K. H. Kraft and E. Schnieder",
TITLE="Rationale Rechenoperationen mit Gammaverteilten
Zufallsvariablen",
JOURNAL=siemensfe,
VOLUME=9,
PAGES="227-230",
YEAR=1980,
LANGUAGE="German",
REFERENCES=3,
KEYWORDS="Gamma distribution; random number generation",
ANNOTE="Two random variables $x$ and $y$ are joined to a new variable
$z(x,y)$. For the operations $z=x+y,x-y,x*y$ and $x/y$ formulae are
given for the density, expectation and variance.",
}

@ARTICLE{Krit80:Incorporating,
AUTHOR="P. S. Kritzinger and A. Krzesinski and P. Teunissen",
TITLE="Incorporating system overhead in queuing network models",
JOURNAL=ieeese,
VOLUME="SE-6",
PAGES="381-390",
YEAR=1980,
KEYWORDS="overhead time; Queueing network",
}

@ARTICLE{Krit80:Queueing,
AUTHOR="P. S. Kritzinger and A. Krzesinski and P. Teunissen",
TITLE="A queueing model of a time-sliced priority-driven task
dispatching algorithm",
JOURNAL=ieeese,
VOLUME="SE-6",
PAGES="219-255",
YEAR=1980,
KEYWORDS="Priority; feedback; queueing system",
ANNOTE="The novel aspect of this paper is the analysisof a policy of
time-sliced renewal. Renewal means that a preempted task is allocated an
entire time slice when it is readmitted to the cpu and not just the
remainder of its preempted slice. The model developed is a priority
queueing model with a service-time distribution that takes into account
renewal - and is therefore dependent upon the arrival rate of higher
priority jobs. The conclusion drawn",
}

@INPROCEEDINGS{Kubo80:Multi,
AUTHOR="M. Kubo and Y. Taguchi and K. Agusa and Y. Ohno",
TITLE="Multi-microprocessor system for three-dimensional color
graphics",
BOOKTITLE="IFIP congress",
ADDRESS="New York",
PAGES="145-150",
YEAR=1980,
KEYWORDS="Graphics; three-dimensional plot; microprocessor software;
multiprocessor system",
ANNOTE="This paper describes the prototype of a multi-microprocessor
system for three-dimensional color graphics. This distributed function
system, G-PSYCO, consists of a Z80 video controller, an Intel 8086
control processor, a Z80 I/O processor, and sixteen tms-9900s used for
SIMD-type graphics tasks such as determining the direction of polygons,
calculation of color intensities, transformations on coordinates, and
the generation of display images.",
}

@INPROCEEDINGS{Kuhn80:ARQ,
AUTHOR="P. J. Kühn",
TITLE="Performance of {ARQ-protocols} for hdx-transmission in
hierarchical polling systems",
BOOKTITLE=iccc,
ADDRESS="Atlanta",
NOTE="also Performance evaluation 1, 1, 1981, 19-30",
YEAR=1980,
KEYWORDS="Queueing system; Queueing network; ARQ; protocol",
}

@ARTICLE{Labe80:Isolation,
AUTHOR="J. Labetoulle and",
TITLE="Isolation method in a network of queues",
JOURNAL=ieeese,
VOLUME="SE-6",
PAGES="373-381",
YEAR=1980,
KEYWORDS="Queueing network; queueing approximation; time in system;
isolation method",
}

@ARTICLE{Lam80:CSMA,
AUTHOR="S. S. Lam",
TITLE="A {CSMA} protocol for {LAN's}",
JOURNAL=cn,
VOLUME=4,
PAGES="21-32",
YEAR=1980,
KEYWORDS="LAN; performance evaluation",
}

@ARTICLE{Lam80:Packet,
AUTHOR="S. S. Lam",
TITLE="Packet broadcast networks - a performance analysis of the
{R-ALOHA} protocol",
JOURNAL=ieeetc,
VOLUME="C-29",
PAGES="596-603",
YEAR=1980,
KEYWORDS="Packet radio; R-ALOHA; performance evaluation; broadcast;
communication; satellite radio; queueing system; ALOHA; multiple access;
packet broadcasting; contention",
ANNOTE="In packet broadcast networks, users are interconnected via a
broadcast channel. The key problem is multiple access of the shared
broadcast channel. The performance of the r-ALOHA protocol for multiple
access is studied in this paper.",
}

@ARTICLE{Lam80:Carrier,
AUTHOR="S. S. Lam",
TITLE="A carrier sense multiple access protocol for local networks",
JOURNAL=cn,
VOLUME=4,
NUMBER=1,
PAGES="21-32",
YEAR=1980,
REFERENCES=32,
KEYWORDS="LAN; performance evaluation; model; computer network; multiple
access; broadcast; communication; communication protocol; CSMA; carrier
sense multiple access",
ANNOTE={A specific csma protocol is defined which requires that
"collisions" in the channel be detected and that the users involved in a
collision abort their transmissions quickly. In addition, it is assumed
that the contention algorithm is adaptive and gives rise to a stable
channel. An analytic model is developed. Our main result is the moment
generating function of the distributed queue size (number of ready
users). Mean value formulas for mess},
}

@ARTICLE{Lam80:Response,
AUTHOR="S. S. Lam and A. U. Shankar",
TITLE="Response time distributions for a multi-class queue with
feedback",
JOURNAL=per,
VOLUME=9,
NUMBER=2,
PAGES="225-233",
YEAR=1980,
REFERENCES=11,
KEYWORDS="Queueing network; feedback; time in system; evaluation;
distribution",
ANNOTE="A single server queue with feedback and multiple customer
classes is analyzed. Arrival processes are independent poisson
processes. Each round of service is exponentially distributed. After
receiving a round of service, a customer may depart or rejoin the end of
the queue for more service. The number of rounds of service required by
a customer is a random variable with a general distribution. Our main
contribution is characterization of respons",
}

@ARTICLE{Land80:Abstract,
AUTHOR="C. E. Landwehr",
TITLE="An abstract type for statistics collection in {SIMULA}",
JOURNAL=toplas,
VOLUME=2,
PAGES="544-563",
YEAR=1980,
KEYWORDS="SIMULA; fundamentals in statistics; abstract data type;
simulation",
ANNOTE="The author describes how he used abstract data types in the
simula language to collect statistical data associated with simulation
runs. the ARTICLE presents background information, a design
specification, the actual simula code, and usage information. the code
has been used on a dec-10 in three versions of a simulator and in three
separately developed simulators.",
}

@ARTICLE{Lato80:Efficient,
AUTHOR="G. Latouche and M. F. Neuts",
TITLE="Efficient algorithmic solutions to exponential tandem queues with
blocking",
JOURNAL="SIAM Journal Algebraic Discrete Methods",
VOLUME=1,
NUMBER=1,
PAGES="93-106",
YEAR=1980,
KEYWORDS="Tandem queue; exponential queueing network; method; blocking",
}

@ARTICLE{Lawr80:Application,
AUTHOR="N. L. Lawrie",
TITLE="An application of queueing theory to a teletraffic problem",
JOURNAL=jors,
VOLUME=31,
PAGES="975-981",
YEAR=1980,
KEYWORDS="Queueing system; approximation",
}

@ARTICLE{Le80:Multiclass,
AUTHOR="L.-M. Le-Ny",
TITLE="Analysis of multiclass queueing network with state-dependent rout
ing",
JOURNAL=rairo,
VOLUME=14,
NUMBER=4,
PAGES="331-347",
YEAR=1980,
REFERENCES=2,
KEYWORDS="Queueing network; blocking; state dependent routing;
multiclass queueing network",
}

@ARTICLE{Lee80:Queueing,
AUTHOR="C. Lee",
TITLE="Queueing analysis of global locking synchronization schemes for
multicopy databases",
JOURNAL=ieeetc,
VOLUME="C-29",
PAGES="371-384",
YEAR=1980,
REFERENCES=23,
KEYWORDS="Model; queueing system; simulation; process management;
information system; distributed database; global locking;
synchronization",
ABSTRACT="Locking is a simple scheme to synchronize multiple updates in
a multicopy distributed database system. Various schemes were proposed
before to maintain the consistency of the distributed database. But
these schemes were compared to each other mostly on heuristic base. In
this paper three analytic queueing models for the network semaphore
scheme, hopping permit scheme, and adaptive hopping permit scheme are
developed.",
}

@ARTICLE{Lee80:FORTRAN,
AUTHOR="G. Lee and T. Boreham and B. Minns and F. Smith and R.
Soderstrom",
TITLE="{FORTRAN} programming standards",
JOURNAL=sigplan,
VOLUME=15,
NUMBER=2,
PAGES="51-63",
YEAR=1980,
KEYWORDS="standard; FORTRAN; program construction",
}

@ARTICLE{Lehm80:Prediction,
AUTHOR="A. Lehmann",
TITLE="Performance evaluation and prediction of storage hierarchies",
JOURNAL=per,
VOLUME=9,
NUMBER=2,
PAGES="43-54",
YEAR=1980,
REFERENCES=16,
KEYWORDS="Performance evaluation; method; model; resource; Simulation;
cache memory; hierarchical storage",
ANNOTE="This paper proposes a modelling methodology combining simulation
and analysis for computer performance evaluation and prediction. The
methodology is based on a special workload model that is suitable for
the generation and description of dynamic program behaviour. A
description of this workload model is given in section 2. The
applicability of this concept with respect to the design of new storage
systems, as well as the improvement or comparis",
}

@ARTICLE{Lehn80:Strukturiertes,
AUTHOR="M. Lehner and E.-H. Horneber",
TITLE="Strukturiertes Multimikroprozessor-System {SMS} 201: Erhöhung der
Rechenleistung durch Parallelverarbeitung",
JOURNAL=siemensfe,
VOLUME=9,
PAGES="88-93",
YEAR=1980,
LANGUAGE="German",
REFERENCES=4,
KEYWORDS="Multiprocessor system; microprocessor",
ANNOTE="The structure of the multi-microprocessor SMS 201 and its
typical performance are described.",
}

@ARTICLE{Lehn80:Spezialprozessor,
AUTHOR="R. Lehnert",
TITLE="Ein Spezialprozessor zur schnellen Simulation von
Zufallsnetzwerken",
JOURNAL=er,
VOLUME=22,
PAGES="74-82",
YEAR=1980,
LANGUAGE="German",
REFERENCES=13,
KEYWORDS="Hardware simulator; shift register sequences; design;
realization; application; comparison; Mechanic McKay sampling; Bayes
statistics; time sequencing; event sequencing; programming language;
future outlook",
ANNOTE="A special processor for the simulation of discrete event systems
is presented. This minicomputer-like modular special computer can be
programmed by an easy to learn simulation language. The simulation speed
of well-known simulation languages, for instance SIMULA, running on a
modern large computer, is achieved at costs which are by a factor of
more than 100 lower. An application example with simulation results of
an E/M/1 queueing system with",
}

@ARTICLE{Lein80:Simple,
AUTHOR="B. M. Leiner",
TITLE="A simple model for computation of packet radio network
communication performance",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="2020-2023",
YEAR=1980,
REFERENCES=8,
KEYWORDS="Packet switching; ALOHA; CSMA; carrier sense multiple access;
adio channel; packet radio",
ANNOTE="A model is presented that allows the computation of the
approximate level of communication performance for an arbitrary packet
radio network using one of a variety of protocols. The communication
performance is specified in terms of the end-to-end message delays
incurred for a given level of end-to-end traffic rates.",
}

@ARTICLE{Ljun80:PASCAL,
AUTHOR="S. Ljungkvist",
TITLE="{PASCAL} and existing {FORTRAN} files",
JOURNAL=sigplan,
VOLUME=15,
PAGES="54-55",
YEAR=1980,
REFERENCES=2,
KEYWORDS="Pascal; fortran; file management",
}

@TECHREPORT{Loos80:KWIC,
AUTHOR="R. Loos",
TITLE="A {KWIC-index} for the algebraic algorithms of the {SAC-2} and
{ALDES} system",
TYPE="internal report",
INSTITUTION="Fakultät für Informatik, Universität Karlsruhe",
ADDRESS="Karlsruhe",
NUMBER="26/80",
PAGES="1-43",
YEAR=1980,
KEYWORDS="symbolic algebraic computation; method; reference",
ANNOTE={For eack algorithm name of the sac-2 and aldes system the
explanation is given and the name of the subsystem to which the
algorithm belongs. The name and all key words of the explanation occur
in alphabetic order in the kwic-index surrounded by the context. In this
way, for example, all product algorithms in sac-2 can be looked up under
the key word "product".},
}

@BOOK{Maib80:Wahrscheinlichkeitstheorie,
AUTHOR="G. Maibaum",
TITLE="Wahrscheinlichkeitstheorie und mathematische Statistik",
PUBLISHER="VEB Deutscher Verlag der Wissenschaften",
ADDRESS="Berlin",
PAGES=268,
YEAR=1980,
LANGUAGE="German",
REFERENCES=28,
KEYWORDS="Probability; statistics",
}

@ARTICLE{Mari80:Calculating,
AUTHOR="Raymond Marie",
TITLE="Calculating equilibrium probabilities for $\lambda(N)/CK/1/N$
queues",
JOURNAL=per,
VOLUME=9,
NUMBER=2,
PAGES="117-125",
YEAR=1980,
REFERENCES=7,
KEYWORDS="Closed queueing network; M/Ck/1/S; model; queueing network;
decomposition; flow equivalence; steady state probability; Cox
distribution",
ANNOTE="Equilibrium state distributions are determined for queues with
load-dependent Poisson arrivals and service time distributions
representable by Cox's generalized method of stages. The solution is
obtained by identifying a birth-death process that has the same
equilibrium state distribution as the original queue. Special cases of
two-stage (C2) and Erlang-$k$ (Ek) service processes permit particulary
efficient algorithms for calculating the",
}

@ARTICLE{Mark80:Distributed,
AUTHOR="J. W. Mark",
TITLE="Distributed scheduling conflict-free multiple access for local
area communication networks",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="1968-1976",
YEAR=1980,
REFERENCES=14,
KEYWORDS="LAN; multiple access; store-and-forward",
ANNOTE="A conflict-free distributed scheduling multiple access (DSMA)
scheme using a high-speed main channel for data transmission and a
subchannel for distributed decision scheduling is described and
analyzed. Dsma, which has a variable cycle length and employs a slow
speed subchannel for scheduling, is suitable for local area
communication networks which employ a data bus as transmission support.
DSMA guarantees each active user one slot per cycl",
}

@ARTICLE{Mart80:Parameters,
AUTHOR="L. Martinez-Miguez and O. Gonzales-Soto",
TITLE="Parameters and communication efficiencies in the modeling of a
packet switching network",
JOURNAL=ec,
ADDRESS="Paris",
VOLUME=55,
NUMBER=1,
PAGES="46-56",
NOTE="also in Proc. 9th International Teletraffic Congress",
YEAR=1980,
REFERENCES=12,
KEYWORDS="model; packet switching; virtual channel",
ANNOTE="A knowledge of the basic traffic and protocol parameters invol
ved in packet switching is essential for the design of different
networks. This should include an evaluation of the sensitivity of
protocol efficiencies to different traffic parameters.",
}

@ARTICLE{Mart80:Gestaltung,
AUTHOR="L. Martinez-Miguez and O. Gonzales-Soto",
TITLE="Gestaltung eines Paketvermittlungsnetzes; Leistungsfähigkeit und
zugehörige Einflußgrößen",
JOURNAL="Elektrisches Nachrichtenwesen (ITT)",
ADDRESS="Stuttgart",
VOLUME=55,
PAGES="46-56",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Packet switching; performance evaluation",
}

@ARTICLE{Mayo80:Language,
AUTHOR="M. A. Mayor",
TITLE="A language for network analysis and definition",
JOURNAL=sigplan,
VOLUME=15,
NUMBER=1,
PAGES="130-138",
YEAR=1980,
REFERENCES=4,
KEYWORDS="Communication network; network design; logical network
structure; programming language; network management",
ANNOTE="A high level language is presented here which, having a similar
structure to that of a procedural language serves the purpose of
identifying the hardware and software network components and the
physical and logical relationships linking them. This language, to be
called network definition language ndl, has then three classes of
statements which are declarative, relational and procedural.",
}

@ARTICLE{Mehr80:Comparative,
AUTHOR="S. K. Mehra and J. W. Wong and J. C. Majitha",
TITLE="A comparative study of some two-processor organizations",
JOURNAL=ieeetc,
VOLUME="C-29",
PAGES="44-49",
YEAR=1980,
REFERENCES=10,
KEYWORDS="Queueing network; time in system; two processor organization;
dynamic reconfiguration",
ANNOTE="In many applications, parallelism inherent in a computation can
be exploited by using a parallel computer organization. Such
organizations may suffer throughput degradation because of data
dependencies. The case of no data dependencies is considered. In this
case, the throughput realized is dependent on the actual manner in which
the parallel computer system is organized. A comparative performance
study of four models of two-processor organizat",
}

@ARTICLE{Meis80:Adaptive,
AUTHOR="N. B. Meisner and J. L. Segal and M. Y. Tanigawa",
TITLE="An adaptive retransmission technique for use in a {slotted-ALOHA}
channel",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="1176-1178",
YEAR=1980,
REFERENCES=6,
KEYWORDS="packet switching; ALOHA; retransmission control",
ANNOTE="An algorithm for adaptive retransmission in a slotted aloha
communication channel has been designed and implemented. This algorithm
maintains the stability of the slotted-aloha channel under a wide
variety of conditions and provides improvements in the response time of
the channel. Simulation was used to test the algorithm for steady-state
and impulse response.",
}

@TECHREPORT{Meke80:Bias,
AUTHOR="M. S. Meketon and P. Heidelberger",
TITLE="Bias reduction in regenerative simulation",
TYPE="report",
INSTITUTION="IBM",
NUMBER="RC 8387",
YEAR=1980,
KEYWORDS="Regenerative simulation",
ANNOTE="Paper not availble for public use",
}

@ARTICLE{Merl80:Deadlock2,
AUTHOR="Philip M. Merlin and P. Schweitzer",
TITLE="Deadlock avoidance in store-and-forward networks - other deadlock
types",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="355-360",
YEAR=1980,
REFERENCES=5,
KEYWORDS="Store-and-forward; deadlock",
ANNOTE="This paper describes the construction of loop-free buffer graphs
which avoid four types of buffer deadlocks in store-and-forward
networks. 1. Progeny deadlock, where original messages spawn other ones,
and buffer contention occurs between the original and progeny messages.
2. Copy-release deadlock, where a message copy is stored at the source
node and the buffer is not released until an acknowledgment is received
from the destination node.",
}

@ARTICLE{Merl80:Deadlock1,
AUTHOR="Philip M. Merlin and P. Schweitzer",
TITLE="Deadlock avoidance in store-and-forward networks - {I:}
store-and-forward deadlock",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="345-354",
YEAR=1980,
REFERENCES=14,
KEYWORDS="Store-and-forward; deadlock",
ANNOTE="Store-and-forward deadlock in store-and-forward networks may be
avoided by forwarding messages from buffer to buffer in accordance with
a loop-free directed buffer graph which accommodates all the desired
message routes. Such an implementation increases the efficiency of
buffer use, and simplifies jumping between normal low-overhead operation
when deadlock is far and more careful operation when deadlock is near.
The proposed deadlock avoida",
}

@MISC{Mert80:CODASYL,
AUTHOR="P. Mertens",
TITLE="{CODASYL} end user facilities committee (end user facility)",
VOLUME=3,
PAGES="120-121",
YEAR=1980,
LANGUAGE="German",
REFERENCES=1,
KEYWORDS="Reference",
}

@ARTICLE{Meye80:Evaluating,
AUTHOR="J. Meyer",
TITLE="On evaluating the performability of degradable computing
systems",
JOURNAL=ieeetc,
VOLUME="C-29",
PAGES="720-731",
YEAR=1980,
REFERENCES=28,
KEYWORDS="Performance evaluation; reliability; performance measure;
performability; degradable system; computer system; fault tolerance",
ANNOTE={if the performance of a computing system is "degradable",
performance and reliability issues must be dealt with simultaneously in
the process of evaluating system effectiveness. for this purpose, a
unified measure, called "performability", is introduced and the
foundations of performability modeling and evaluation are established.},
}

@MISC{Moff80:Categorized,
AUTHOR="D. V. Moffat",
TITLE="A categorized {PASCAL} bibliography",
PUBLISHER="sigplan",
VOLUME=15,
NUMBER=10,
PAGES="63-75",
YEAR=1980,
REFERENCES=303,
KEYWORDS="bibliography; PASCAL",
}

@ARTICLE{Mora80:Verkehrsschiefe,
AUTHOR="G. Morales Andres and  others",
TITLE="Verkehrsschiefe in Teilnehmerkoppelvielfachen",
JOURNAL=en,
ADDRESS="Stuttgart",
VOLUME=55,
PAGES="18-25",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Switching system; performance evaluation",
}

@ARTICLE{Morg80:Autocorrelation,
AUTHOR="D. E. Morgan",
TITLE="Autocorrelation function of sequential $m$-bit words taken from
an n-bit shift register {(PN)} sequence",
JOURNAL=ieeetc,
VOLUME="C-29",
PAGES="408-416",
YEAR=1980,
REFERENCES=26,
KEYWORDS="Method; shift register sequences; random number generation;
test; autocorrelation",
ANNOTE="A closed-form expression is obtained for the autocorrelation f
unction of sequential m-bit, base alpha digital words formed by serial
bits of a single binary pn sequence of length l=2**n-1. Plots are
presented for several values of $m$ and $n$, showing detailed behavior
and limiting curves for the binary case $(\alpha=2)$.",
}

@ARTICLE{Mroz80:Auslastung,
AUTHOR="G. Mrozynski",
TITLE="Auslastung der Übertragungskanäle in
Nachrichtenvermittlungssystemen mit Integration von Diensten",
JOURNAL="Frequenz",
VOLUME=34,
NUMBER=9,
PAGES="252-259",
YEAR=1980,
LANGUAGE="German",
REFERENCES=7,
KEYWORDS="TDM; time division multiplex; communication network",
ANNOTE="The channel occupancy of transmission channels of conductor
bound switching networks is determined by the number of channels in a
trunk group to which competing service demands have access with a given
traffic loss or a maximum admitted mean waiting time. For examination of
the channel occupancy of the transmission channels a model of a service
integrated switching network is introduced in which the information of
two services with different",
}

@ARTICLE{Niel80:Early,
AUTHOR="P. R. Nielson",
TITLE="Early-warning software for preventing network breakdown",
JOURNAL=datacommunications,
VOLUME=9,
NUMBER=11,
PAGES="93-99",
YEAR=1980,
KEYWORDS="Communication network; switching system; reliability; network
stability",
}

@BOOK{Anon80:LISP,
AUTHOR="Anonymous",
TITLE="{LISP} conference",
PUBLISHER="The LISP Conference",
ADDRESS="Redwood States, CA 95044",
PAGES="1-247",
YEAR=1980,
KEYWORDS="Survey; programming language; LISP; Symbolic algebraic
computation",
}

@ARTICLE{Anon80:Rechner,
AUTHOR="Anonymous",
TITLE="Rechner helfen Reisen",
JOURNAL="Siemens Data Report",
VOLUME=15,
NUMBER=2,
PAGES="24-28",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Survey; existing network; private network; reservation
system",
ABSTRACT="Die Leistungen der bereits bestehenden Auskunfts- und
Buchungssysteme der Deutschen Bundesbahn (DB), der Deutschen Lufthansa
(LH) und Touristik Union International (TUI) integriert das start-System
in einen heterogenen Rechnerverbund.  Damit bietet start den über das
Siemens-Reisebüroterminal 8167 angeschlossenen Reisebüros und deren
Kunden ebenso wie den beteiligten Leistungsträgern große Vorteile.",
}

@ARTICLE{OGra80:Communication,
AUTHOR="E. P. O'Grady",
TITLE="A communication mechanism for multiprocessor simulation systems",
JOURNAL="Simulation",
VOLUME=34,
NUMBER=2,
PAGES="39-49",
YEAR=1980,
KEYWORDS="Continuous simulation; distributed simulation; multiprocessor
system; network design",
ANNOTE="This well-written and carefully organized paper includes a
comprehensive survey of the variety of proposals for multiprocessor
simulators. This is followed by a description of a proposed
multi-processor system including up to 256 processors. The proposed
high-speed communication method takes advantage of the iterative nature
of algorithms employed in simulation problems and includes an indirect,
decentralized, shared interconnection structure.",
}

@ARTICLE{Olsz80:Program,
AUTHOR="E. A. Olszewski and W. J. Thompson",
TITLE="A program for perspective views of three-dimensional surfaces",
JOURNAL="Computers Physics Communication",
VOLUME=21,
NUMBER=2,
PAGES="185-193",
YEAR=1980,
KEYWORDS="Graphics; three-dimensional plot; hidden line algorithm;
fortran",
ANNOTE="The fortran program tdplot3 provides a fast and efficient means
for the graphical display of three-dimensional surfaces $s(r,\theta)$,
where $r$ and $\theta$ are radial and angular variables. In
spherical-polar coordinates $\theta$ is the polar coordinate, and in $c$
ylindrical coordinates $\theta$ is the angular variable. Previous
three-dimensional display programs have used cartesian-coordinate
representations, usually on a uniform grid. By restricting",
}

@BOOK{Osak80:Reliability,
AUTHOR="S. Osaki and T. Nishio",
TITLE="Reliability evaluation of some fault tolerant computer
architectures",
PUBLISHER="Lecture notes in computer science Springer-Verlag",
ADDRESS="Berlin",
VOLUME=97,
PAGES=129,
YEAR=1980,
REFERENCES=50,
KEYWORDS="Computer architecture; reliability",
}

@ARTICLE{Park80:Notes,
AUTHOR="D. S. Parker",
TITLE="Notes on shuffle/exchange-type switching networks",
JOURNAL=ieeetc,
VOLUME="COM-29",
PAGES="213-222",
YEAR=1980,
REFERENCES=18,
KEYWORDS="Switching network",
}

@INPROCEEDINGS{Park80:New,
AUTHOR="D. S. Parker",
TITLE="New points of view on three-stage rearrangeable switching
networks",
BOOKTITLE="Workshop on interconnect networks for parallal and
distributed Processing",
ORGANIZATION="IEEE",
PAGES="56-63",
YEAR=1980,
REFERENCES=22,
KEYWORDS="Switching network",
}

@ARTICLE{Pawl80:Message,
AUTHOR="Krzysztof Pawlikowski",
TITLE="Message waiting time in a packet switching system",
JOURNAL=jacm,
VOLUME=27,
PAGES="30-41",
YEAR=1980,
REFERENCES=15,
KEYWORDS="Queueing system; Markov process; packet switching; priority;
ing network; loop system",
ANNOTE="The behavior of a buffer having an arbitrary number of common
output channels in a packet switching system with an arbitrary number of
priority classes of messages is studied. Because of the random lenghts
of the messages and the fixed packet size, some messages must be split
into several packets. Packets of the same message may not be sent
immediately in sequence because of the packets of higher priority
messages. Therefore, the message waitin",
}

@ARTICLE{Piat80:ISO,
AUTHOR="T. F. Piatkowski",
TITLE="The {ISO-ANSI} open systems reference model --- a proposal for a
systems approach",
JOURNAL=cn,
VOLUME=4,
NUMBER=3,
PAGES="111-124",
YEAR=1980,
REFERENCES=26,
KEYWORDS="OSI; survey",
ANNOTE="The open systems interconnection (osi) architecture and its
associated reference model is currently the subject of active
development by members of the international organization for
standardization (iso) and various national standards bodies. A principal
purpose of the open systems interconnection architecture is to guide the
development of standards that will make possible the configuration of a
wide variety of useful computer and data proces",
}

@ARTICLE{Pilo80:Unterst,
AUTHOR="R. Piloty",
TITLE="Unterstützung des Rechnerentwurfs durch Beschreibungssprachen",
JOURNAL="Informatik Fachberichte",
PUBLISHER="Springer Verlag",
VOLUME=27,
PAGES="22PP",
YEAR=1980,
LANGUAGE="German",
REFERENCES=13,
KEYWORDS="Method; documentation; hardware element; design; hardware
device; hardware design language",
ANNOTE="Der Entwurf eines Rechnersystems umfasst die Disposition über
viele tausende von Schaltbausteinen für die Hardware und über den Inhalt
von vielen Millionen von Speicherstellen für die Mikroprogramme und die
Systemsoftware. Für den Softwareentwurf wurden daher bald Assembler- und
höhere Programmiersprachen mit den zugehörigen Werkzeugen zur
Unterstützung der Programmentwicklung und zur Übersetzung in ein
ladefähiges Bitmuster entwickelt",
}

@ARTICLE{Posc80:Vorschlag,
AUTHOR="R. Posch",
TITLE="Ein Vorschlag zur Behandlung von prozedurfreien asynchronen
Terminals im Halbduplex-Verfahren",
JOURNAL=aninf,
VOLUME=22,
NUMBER=3,
PAGES="119-125",
YEAR=1980,
LANGUAGE="German",
REFERENCES=8,
KEYWORDS="Half-duplex transmission; telephone channel; design;
application; method; reliability; communication protocol; display; data
transmission",
ANNOTE="The problem of transmission errors on voice-grade lines, used
for most trivial unintelligent terminals and which operate half-duplex
is discussed. Only errors which arise from the switching on and off of
the carrier are looked at. This switching of the carrier is necessary at
half-duplex lines and the errors occur due to echoing and not due to
line quality. A switching unit is presented which makes any asynchronous
terminal capable of operating",
}

@ARTICLE{Poti80:Locking,
AUTHOR="D. Potier and P. Leblanc",
TITLE="Analysis of locking policies in database management systems",
JOURNAL=cacm,
VOLUME=23,
PAGES="584-593",
YEAR=1980,
REFERENCES=16,
KEYWORDS="Queueing system; Queueing network; performance evaluation;
model; DBMS; database management system; concurrency",
ANNOTE="Consistency control has to be enforced in database management
systems (dbms) where several transactions may concurrently access the
database. However, a drawback of integrity enforcement through locking
policies is the degradation of the global system performnace. The
results hereby obtained are aggregated in a second step to yield a
global performance evaluation.",
}

@ARTICLE{Pott80:Recursive,
AUTHOR="J. M. Potter",
TITLE="Recursive code generation based on m-sequence",
JOURNAL=elet,
VOLUME=16,
YEAR=1980,
KEYWORDS="Shift register sequences",
}

@BOOK{Pouz80:Seven,
AUTHOR="L. Pouzin",
TITLE="The seven plagues of the 80's",
SERIES="Infotech state of the art review",
PUBLISHER="Infotech",
PAGES="1-17",
YEAR=1980,
KEYWORDS="Future outlook; reliability; human factors; standard;
communication network; user support; regulation; unemployment",
ANNOTE="The computer technology has been for long a matter for
specialists. Mayor troublesome areas remain and are going to stay with
us for at least another decade. They may be identified as: human
interface, communications, support, standards, reliability, regulations
and unemployment.",
}

@ARTICLE{Pujo80:Comparison,
AUTHOR="Pujolle, G. Les",
TITLE="Comparison of some End-to-End Flow Control Policies in a Packet
Switching Network",
JOURNAL="Raport de Recherche",
VOLUME=1,
YEAR=1980,
LANGUAGE="English",
KEYWORDS="packet switching; end-to-end flow control",
}

@ARTICLE{Qued80:Erweiterung,
AUTHOR="H. D. Quednau",
TITLE="Erweiterung des {LIBAFORM-Systems} zur automatischen Erzeugung
von Programmen in höheren Computersprachen",
JOURNAL=aninf,
PAGES="194-196",
YEAR=1980,
LANGUAGE="German",
REFERENCES=7,
KEYWORDS="Programming language; symbolic algebraic computation;
automatic program generation",
ANNOTE="Es werden einige neu entwickelte Elemente der
formelverarbeitenden Computersprache LIBAFORM vorgestellt, die die
Erzeugung von Programmen in höheren Programmiersprachen in
mathematisch-naturwissenschaftlichen Bereich wesentlich vereinfachen.",
}

@ARTICLE{Ratz80:Economic,
AUTHOR="H. C. Ratz and J. A. Field",
TITLE="Economic comparison of data communication services",
JOURNAL=cn,
VOLUME=4,
NUMBER=4,
PAGES="143-155",
YEAR=1980,
REFERENCES=13,
KEYWORDS="Cost; communication network; data network; tariff; comparison;
model; economic evaluation",
ANNOTE="Recent advances in data communications technology have
confronted the potential user with a wide variety of alternatives in
communications facilities. Data communication services are available to
users under tariff charges which include a charge for access to a data
network and a charge for usage. The form of the usage charge depends
upon the nature of the service: that is, whether it is a leased line, or
a circuit switched, or a packet switche",
}

@ARTICLE{Raus80:Microprogramming,
AUTHOR="G. T. Rauscher and P. M. Adams",
TITLE="Microprogramming: a tutorial and survey of recent developments",
JOURNAL=ieeetc,
VOLUME="C-29",
PAGES="1-20",
YEAR=1980,
REFERENCES=72,
KEYWORDS="Bit-slice family; microprocessor software; survey;
microprogramming",
ANNOTE="The present status of microprogramming is developed from wilke's
initial concept of microprogramming to the more recent bit-slice
microprogrammable computer components. This tutorial defines basic
concepts and gives a simple example of machine language interpretation.
Describing the characteristics of microprogrammed machines provides the
background for an examination of microprogrammable bit slice
microprocessors.",
}

@ARTICLE{Razo80:Modelling,
AUTHOR="R. R. Razouk and G. Estrin",
TITLE="Modelling and verification of communication protocols in {SARA:}
the {X.21} interface",
JOURNAL=ieeetc,
VOLUME="C-29",
PAGES="1038-1051",
YEAR=1980,
KEYWORDS="Protocol engineering; X.21",
}

@ARTICLE{Reis80:Mean,
AUTHOR="M. Reiser and S. S. Lavenberg",
TITLE="Mean-value analysis of closed multichain queueing networks",
JOURNAL=jacm,
VOLUME=27,
PAGES="313-322",
YEAR=1980,
REFERENCES=15,
KEYWORDS="Method; queueing network; model; performance evaluation;
queueing approximation; closed queueing network; expectation; waiting
time; queue length; runtime/storage efficiency; throughput performance",
ANNOTE="It is shown that mean queue sizes, mean waiting times, and
throughputs in closed multiple-chain queueing networks which have
product-form solution can be computed recursively without computing
product terms and normalization constants. The resulting computational
procedures have improved properties (avoidance of numerical problems
and, in some cases, fewer operations) compared to previous algorithms.
Furthermore, the new algorithms have a physi",
}

@ARTICLE{Requ80:Representations,
AUTHOR="A. A. G. Requicha",
TITLE="Representations for rigid solids: theory, methods, and systems",
JOURNAL=acmcs,
VOLUME=12,
NUMBER=4,
PAGES="437-464",
YEAR=1980,
REFERENCES=80,
KEYWORDS="method; model; bibliography; graphics; two-dimensional plot;
three-dimensional plot; hidden line algorithm; information system;
numerical method; computational geometry; geometric modeling;
representation of solids",
ANNOTE={Computer-based systems for modeling the geometry of rigid solid
objects are becoming increasingly important in Computer graphics,
computer vision,  At the heart of such systems are symbol structures
(representations) designating "abstract solids" (subsets of euclidean
space) that model physical solids. Representations are the sources of
data for procedures which compute useful properties of objects. The
paper is devided into three},
}

@ARTICLE{Robe80:Packet,
AUTHOR="Jim Roberts and T. J. Healy",
TITLE="Packet radio performance over slow Rayleigh fading channels",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="279-286",
YEAR=1980,
REFERENCES=34,
KEYWORDS="ALOHA; broadcast; communication; packet radio; fading;
rayleigh distribution",
ANNOTE="Expressions for the throughput and average packet delay for a
pure-aloha single-hop packet radio system operating in slow rayleigh
fading are derived. The packet length which maximizes the useful data
throughput in slow rayleigh fading is found. The results of this
investigation indicate that a packet radio system can be designed with a
modest link margin for fading and achieve identical throughput
performance over a nonfading channel and a",
}

@ARTICLE{Roge80:Dynamic,
AUTHOR="G. Rogers",
TITLE="Dynamic 3d modeling for architectural design",
JOURNAL="Computer Aided Design",
VOLUME=12,
NUMBER=1,
PAGES="13-20",
YEAR=1980,
KEYWORDS="Graphics; three-dimensional plot; hidden line algorithm;
interactive mode; design",
ANNOTE="This paper describes fortran iv plus application programs
written to run on a pdp 11/34 interfaced to an evans and sutherland
picture system 2. They provide an architectural designer with the
capability to define sites and structures and to generate dynamically
varying displays of these creations. The designer defines a 3d site
using 2d input devices by tracing contours of equal elevation. A program
employing spline techniques creates smooth co",
}

@TECHREPORT{Roll80:Using,
AUTHOR="P. Rollin",
TITLE="Using Petri-nets in measurement of a distributed data base
system",
INSTITUTION="SIRIUS",
NUMBER="MES-I-002",
PAGES="1-14",
YEAR=1980,
REFERENCES=7,
KEYWORDS="Information system; performance evaluation; Petri net",
}

@ARTICLE{Rose80:User,
AUTHOR="M. P. Rose and J. P. O'Keefe",
TITLE="User studies value-added-network response times",
JOURNAL=datacommunications,
VOLUME=9,
NUMBER=4,
PAGES="83-90",
YEAR=1980,
KEYWORDS="Response time; packet switching",
ANNOTE="The company conducted a comparative test of response times
through Telenet and Tymnet.",
}

@ARTICLE{Rose80:Updating,
AUTHOR="E. C. Rosen",
TITLE="The updating protocol of {ARPAnet's} new routing algorithm",
JOURNAL=cn,
VOLUME=4,
NUMBER=1,
PAGES="11-19",
YEAR=1980,
REFERENCES=10,
KEYWORDS="computer network; routing algorithm; ARPAnet; communication
protocol; packet switching",
ANNOTE="In May 1979 a new routing algorithm was installed in the
arpanet. In this algorithm, each network node makes an independent
routing decision based on information about delays throughout the
network. The delay on a particular line is measured at the nodes
attached to that line, and disseminated to the rest of the network in
the form of a 'routing update'. This paper discusses one aspect of the
routing algorithm, viz. Its updating protocol",
}

@ARTICLE{Ruhl80:Wirtschaftlichkeit,
AUTHOR="U. Ruhl",
TITLE="Wirtschaftlichkeit von Rechnerverbund - Kriterien und Methoden
zur Beurteilung von Verbundsystemen",
JOURNAL=aninf,
VOLUME=11,
PAGES="452-461",
YEAR=1980,
LANGUAGE="German",
REFERENCES=24,
KEYWORDS="Cost; method; evaluation; solved exercise",
ANNOTE={Die Wirtschaftlichkeit wird immer wieder als Ziel bei Aufbau und
Betrieb von Rechnerverbundsystemen besonders hervorgehoben. Als
besonders geeignet erweist sich hier das "Kölner kombinationsverfahren
für Rangfolgeentscheidungen". Mit dessen Hilfe kann auch bei wenig
Information über ein Beurteilungsobjekt (hier Rechnerverbund) in
einfacher weise die geeignete ADV-lösung bestimmt werden.},
}

@ARTICLE{Rump80:Notiz,
AUTHOR="S. M. Rump",
TITLE="Notiz zur Genauigkeit der Arithmetik in Rechenanlagen",
JOURNAL=er,
VOLUME=22,
NUMBER=5,
PAGES="243-244",
YEAR=1980,
LANGUAGE="German",
REFERENCES=5,
KEYWORDS="Reliability; CPU; computer arithmetic; accuracy; rounding
error",
ANNOTE="Die folgende Notiz zur Genauigkeit der Arithmetik in
Rechenanlagen ist ein Appell an den Benutzer. Sie entstand aus der sich
beinahe täglich wiederholenden Erfahrung, daß auch elektronische
Rechenanlagen fehlerhafte Ergebnisse liefern. Und zwar nicht durch einen
Fehler des Benutzers verursacht, sondern vielmehr eine fehlerhafte
Arithmetik der Maschine, einen fehlerhaften Compiler",
}

@ARTICLE{Rybc80:Common,
AUTHOR="Antony Rybczynski and J. D. Palframan",
TITLE="A common {X.25} interface to public data networks",
JOURNAL=cn,
VOLUME=4,
NUMBER=3,
PAGES="97-110",
YEAR=1980,
REFERENCES=17,
KEYWORDS="Public network; ISO reference model; X.25",
ANNOTE="This paper briefly describes differences that have existed among
various network implementations of X.25. It then discusses X.25 as
recently approved. Contentious points have been eliminated, in favour of
a single universally acceptable specification. Elements of a DTE
implementation are described for connection to any X.25 network.",
}

@ARTICLE{Rzhi80:Algorithm,
AUTHOR="Y. I. Rzhikov",
TITLE="Algorithm of design of multiserver {Erlang} queueing systems",
JOURNAL="Automatika i Telemekhanika",
VOLUME=5,
PAGES="30-37",
YEAR=1980,
KEYWORDS="Queueing system; multiserver; M/Ek/N",
}

@ARTICLE{Sahn80:Scheduling,
AUTHOR="S. Sahni and Yong Soo Cho",
TITLE="Scheduling independent tasks with due times on uniform processor
system",
JOURNAL=jacm,
VOLUME=27,
PAGES="550-563",
YEAR=1980,
REFERENCES=5,
KEYWORDS="Process management; evaluation; independent tasks; preemptive
scheduling; due time; complexity",
}

@ARTICLE{Sama80:Queueing,
AUTHOR="N. K. Samari and G. M. Schneider",
TITLE="A queueing theory-based analytic model of a distributed computer
network",
JOURNAL=ieeetc,
VOLUME="C-29",
PAGES="994-1001",
YEAR=1980,
REFERENCES=19,
KEYWORDS="Analytical model; communication network; queueing network;
M/M/1; M/D/N; performance evaluation; switching system; network unit",
ANNOTE="This paper describes the development of an analytic model for
performance studies of distributed computer networks. The model factors
each node of a network into processing and channel components and models
each seperately using M/D/R AND M/M/1 queues. The model also includes a
correction factor to account for the nonexponential nature of the input
to the channel component.",
}

@ARTICLE{Same80:Efficient,
AUTHOR="H. Samet",
TITLE="Efficient on-line proofs of equalities and inequalities of
formulas",
JOURNAL=ieeetc,
VOLUME="C-29",
PAGES="28-32",
YEAR=1980,
REFERENCES=11,
KEYWORDS="Symbolic algebraic computation; equivalence",
ANNOTE="An algorithm is presented for proving equivalence and
inequivalence of instances of formulas involving constant terms. It is
based on the construction of an equality data base in the form of a
grammar. The algorithm differes from other approaches to the problem by
being an on-line algorithm. Equality between two formulas can be proved
in time proportional to the number constant and function symbols
appearing within them. An algorithm is also gi",
}

@ARTICLE{Sand80:Effects,
AUTHOR="Ray Sanders",
TITLE="Effects of switching technologies on network delay",
JOURNAL=datacommunications,
VOLUME=9,
NUMBER=4,
PAGES="109-118",
YEAR=1980,
KEYWORDS="network delay; comparison; packet switching; hybrid switching;
TDM; time division multiplex; model",
ANNOTE="This practical article focuses on an analytic method for
determining delay in network transmission. Its purpose is to enable
system designers to understand the nature of delay imposed by time
division, packet switching, and hybrid switching schemes. Based on a few
reasonable assumptions about networks in real-time environments, the
author describes a usable analytic tool for comparison of the three
methods in a single case.",
}

@ARTICLE{Sant80:Throughput,
AUTHOR="D. Sant",
TITLE="Throughput of unslotted {ALOHA} channels with arbitrary packet
interarrival time distributions",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="1422-1425",
YEAR=1980,
KEYWORDS="Packet switching; computer network; Aloha; packet radio;
satellite radio; broadcast; random multiple access",
ANNOTE="An unslotted aloha channel with dissimilar users and each user
having an arbitrary distribution of packet interarrival time, is
analyzed for its throughput. It is shown that the throughput behavior of
an unslotted channel with a very large number of users is the same as
that of abramson's poisson channel. When each user transmits many
packets almost in succession and then remains silent for a long period,
the throughput of the unslotted channe",
}

@INPROCEEDINGS{Saue80:Simulation,
AUTHOR="C. H. Sauer",
TITLE="Simulation analysis of generalized queuing networks",
BOOKTITLE="Summer simulation conference",
YEAR=1980,
KEYWORDS="Simulation; queueing network",
}

@ARTICLE{Saue80:Language,
AUTHOR="C. H. Sauer and E. A. Mac Nair and S. Salza",
TITLE="A language for extended queueing network models",
JOURNAL=ibmjrd,
VOLUME=24,
PAGES="747-755",
YEAR=1980,
KEYWORDS="Queueing system; approximation; simulation; RESQ; research
Queueing Package",
}

@ARTICLE{Scha80:Use,
AUTHOR="I. P. Schagen",
TITLE="The use of stochastic processes in interpolation and
approximation",
JOURNAL="International Journal Computational Mathematics",
VOLUME=8,
NUMBER=1,
PAGES="63-76",
YEAR=1980,
KEYWORDS="Process; interpolation; approximation",
ANNOTE="The method of interpolation from scattered points described in
this paper appears to have some promise in various areas: contouring,
optimization, quadrature, for instance. It is designed for situations
where the data is sparse and not necessarily evenly scattered across the
region of interest.",
}

@INCOLLECTION{Scha80:Zeitmultiplex,
AUTHOR="G. Schallert",
TITLE="Zeitmultiplex-Datenübertragungssystem {ZD1000-A2} für synchrone
Datenübertragung im {IDN}",
BOOKTITLE="Taschenbuch der Fernmeldepraxis",
PUBLISHER="Schiele \& Schön",
PAGES="300-323",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="IDN; multiplexer; circuit switching; X.51",
}

@ARTICLE{Schi80:System,
AUTHOR="D. C. Schiller",
TITLE="System capacity and performance evaluation",
JOURNAL=ibmsj,
VOLUME=19,
NUMBER=1,
PAGES="46-67",
YEAR=1980,
KEYWORDS="M/M/1; M/G/1; computer system; performance evaluation",
ANNOTE={(Review) A better title for this article would be "System
capacity and performance evaluation of IBM's MVS (Multiple Virtual
Storage)". The article will be of little utility to non-IBM'ers.
Performance is studied using basic M/M/1 and M/G/1 queueing formulas, as
well as some other formulas which appear as if by magic.},
}

@ARTICLE{Schm80:Generation,
AUTHOR="B. W. Schmeiser",
TITLE="Generation of variates from distribution tails",
JOURNAL=or,
VOLUME=28,
PAGES="1012-1017",
YEAR=1980,
KEYWORDS="Simulation; random number generation; random variate
generation",
}

@ARTICLE{Schm80:SIGMUS,
AUTHOR="K. Schmidt",
TITLE="{SIGMUS} - Ein Simulator-Generator für Multiprozessor-Systeme",
JOURNAL=aninf,
NUMBER=10,
PAGES="402-408",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Simulation; multiprocessor system; program construction;
automatic program generation",
ANNOTE="Sigmus ist ein in standard FORTRAN IV geschriebenes System, mit
dem für beliebige Multiprozessorsysteme Simulatoren in Form von standard
FORTRAN IV Programmen generiert werden können. Insbesondere folgende
Merkmale unterscheiden SIGMUS von ähnlichen Entwicklungen: simulation
parallel ablaufender Vorgänge jeglicher Art, Simulation von
Systemmodellen beliebigen Abstraktionsgrades und
Effektivitätsoptimierung durch Wahlmöglichkeit zwischen",
}

@ARTICLE{Schm80:Monitoring,
AUTHOR="N. Schmitt",
TITLE="Monitoring in der Prozeßrechentechnik",
JOURNAL="Informatik Fachberichte",
PUBLISHER="Springer-Verlag",
ADDRESS="Berlin",
VOLUME=27,
PAGES="28-37",
YEAR=1980,
LANGUAGE="German",
REFERENCES=9,
KEYWORDS="design; realization; monitoring; comparison",
ANNOTE="Prozessrechensysteme muessen die Anforderungen, die an sie aus
dem zu automatisierenden Prozess gestellt werden, unter engen zeitlichen
Bedingungen, sogenannten Echtzeitbedingungen bearbeiten. Für den
Nachweis, daß diese Bedingungen in jedem Betriebszustand sicher
eingehalten werden, ist die quantitative Erfassung, das heißt die
messung des dynamischen verhaltens von prozessrechensystemen
unabdingbar.  Softwaremonitore bewirken hohe Rückwirkungen",
}

@ARTICLE{Schn80:Einfache,
AUTHOR="F. Schneider and K. D. Wolfenstetter",
TITLE="Einfache lineare Regression",
JOURNAL=fernmelde,
VOLUME=34,
NUMBER=7,
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Statistics",
}

@ARTICLE{Schr80:Coverage,
AUTHOR="L. W. Schruben",
TITLE="A coverage function for interval estimators of simulation
response",
JOURNAL=ms,
VOLUME=26,
NUMBER=1,
PAGES="18-27",
YEAR=1980,
KEYWORDS="Bibliography; simulation; sampling; estimation; survey;
confidence interval; comparison",
ANNOTE="(Review) This article presents a research tool for analyzing
methods used in discrete event simulation. The presentation should be
interesting to developers of simulation methodology (regenerative
techniques, non-parametric procedures, etc.) and to users of the
methods. The coverage function presented here compares theoretical and
actual probabilities of parameter estimates being contained within
prescribed confidence intervals.",
}

@MISC{Schu80:CHILL,
AUTHOR="K. Schulz",
TITLE="{CHILL}",
PUBLISHER="DAS AKTUELLE SCHLAGWORT, Inf. Spektrum",
VOLUME=3,
PAGES="122-123",
YEAR=1980,
LANGUAGE="German",
REFERENCES=2,
KEYWORDS="programming language; switching system; CHILL",
}

@ARTICLE{Schw80:Autokorrelationsfunktion,
AUTHOR="M. Schwindt",
TITLE="Autokorrelationsfunktion der binär geteilten Bernoulli-Folge",
JOURNAL="Frequenz",
VOLUME=34,
PAGES="16-",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Shift register sequences; correlation",
}

@ARTICLE{Schw80:System,
AUTHOR="M. Schwindt",
TITLE="Ein System nicht kreuzkorrelierter Pseudo-Zufallsquellen",
JOURNAL="Frequenz",
VOLUME=34,
PAGES="334-338",
YEAR=1980,
LANGUAGE="German",
REFERENCES=4,
KEYWORDS="Shift register sequences; design; realization; method",
ANNOTE="Es wird ein neues Verfahren zur Erzeugung praktisch beliebig
vieler, untereinander unkorrelierter binärer Pseudozufallsfolgen
beschrieben. Hervorzuheben ist, daß alle Zufallsquellen gleichartig und
äusserst einfach aufgebaut sind. Die folgen sind mit der technologisch
bedingten maximalen Taktfrequenz verfügbar. Dieses
Pseudozufalls-Quellen-System lässt sich zur Hochfrequenten sowie
parallelen Erzeugung binärer Zufallszahlen grosser",
}

@ARTICLE{Schw80:Erzeugung,
AUTHOR="M. Schwindt",
TITLE="Erzeugung unkorrelierter dezimaler Zufallsfolgen aus
Binärfolgennach einem Selektions- und Pufferverfahren",
JOURNAL="Frequenz",
VOLUME=34,
PAGES="260-264",
YEAR=1980,
LANGUAGE="German",
REFERENCES=3,
KEYWORDS="shift register sequences; design; realization; method",
ANNOTE="Es wird ein BCD-Generator beschrieben, der eine dezimale
Zufallsfolge mit Gleichverteilung aus vier binären Zufallsfolgen je
Dekade bei beliebiger Stellenzahl erzeugt. Hierzu muessen die binaeren
Zufallsfolgen unkorreliert und gleichverteilt $(p=0,5)$ sein. Die
Autokorrelationsfunktion der BCD-folge wird in Abhängigkeit von der
verwendeten Registerlänge berechnet und damit gezeigt, dass zum Beispiel
schon mit 8-bit Registern die Werte der Normierten",
}

@ARTICLE{Seam80:Modeling,
AUTHOR="P. H. Seaman",
TITLE="Modeling considerations for predicting performance of {CICS/VS}
systems",
JOURNAL=ibmsj,
VOLUME=19,
NUMBER=1,
PAGES="68-80",
YEAR=1980,
KEYWORDS="Model; operating system; prediction",
ANNOTE="This is a well-written, informative article. The main idea,
which the author develops using a set of sample examples, is that
capacity planning models should not get mired in unnecessary detail. the
results of such models, which are not necessarily very accurate, give
the user a feel for how a system will behave under varying workloads and
when equipment upgrades may be necessary.",
}

@ARTICLE{Seid80:Modellbildung,
AUTHOR="H. Seidel and P. von Studnitz and K. Winter",
TITLE="Modellbildung und Simulation eines verteilten {DV-Systems}",
JOURNAL=aninf,
VOLUME=22,
NUMBER=6,
PAGES="235-244",
YEAR=1980,
LANGUAGE="German",
REFERENCES=8,
KEYWORDS="Model; simulation; application; documentation; parallel
computing; generation system",
ANNOTE="This article describes a deterministic model building and
simulation method for distributed systems which diminishes the effort
considerably in comparison to other methods. This is achieved by
building separate models for application, system hardware and system
software and by applying a simulation model generator.",
}

@ARTICLE{Seng80:Telephone,
AUTHOR="M. Sengoku",
TITLE="Telephone traffic in a mobile communication system using dynamic
frequency assignments",
JOURNAL=ieeevt,
VOLUME="VT-29",
PAGES="270-278",
YEAR=1980,
KEYWORDS="MAT; DCA; dynamic channel assignment",
}

@ARTICLE{Stah80:Prognosen,
AUTHOR="P. Stahlknecht",
TITLE="Prognosen für den {DV-Bereich} - Überblick und kritische
Betrachtung",
JOURNAL=aninf,
PAGES="133-140",
YEAR=1980,
LANGUAGE="German",
REFERENCES=47,
KEYWORDS="Survey; future outlook; hardware element; hardware device;
program construction; display; computer system; resource",
ANNOTE="The data processing area is characterized by fast changes. This
leads to a permanent forecast by consultant companies, software houses,
mainframe producers, and universities. Such forecasts concern hardware
technology, especially price and performance, the number of universal
machines installed, minicomputers, terminals, methods and costs of
software development. This article gives a survey on some typical
forecasts and compares them. In addition",
}

@ARTICLE{Tayl80:Waiting,
AUTHOR="I Taylor and J. G. C. Templeton",
TITLE="Waiting time in a multi-server cutoff-priority queue, and its
application to an urban ambulance service",
JOURNAL=or,
ADDRESS="Toronto, Canada",
VOLUME=28,
NUMBER=5,
PAGES="1168-1188",
YEAR=1980,
REFERENCES=12,
KEYWORDS="Queueing system; M/M/N/S; M/M/N; HOL priority; waiting time;
ut-off priority",
ABSTRACT="We consider a priority queue in steady state with $N$ servers,
two classes of customers, and a cutoff service discipline.  Low priority
arrivals are ``cut off'' (refused immediate service) and placed in a
queue whenever $N1$ or more servers are busy, in order to keep $N-N1$
servers free for high priority arrivals.  A Poisson arrival process for
each class, and a common exponential service rate, are assumed.  Two
models are considered: one where high",
}

@ARTICLE{Toba80:Two,
AUTHOR="F. A. Tobagi",
TITLE="Analysis of a two-hop centralized packet radio network - part 1:
slotted {ALOHA}",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="196-207",
YEAR=1980,
REFERENCES=24,
KEYWORDS="ALOHA; broadcast; communication; packet switching; packet
radio",
ANNOTE="A two-hop centralized configuration is considered in which
traffic originates at terminals, is destined to a central station, and
requires for its transport the relaying of packets by store-and-forward
repeaters. The throughput-delay performance is derived, and its
dependence on such key system variables as the network topology, the
transmission protocol, and the repeaters' storage capacities, is
given.",
}

@ARTICLE{Walk80:Rechnermodell,
AUTHOR="B. Walke",
TITLE="Ein Rechnermodell mit statistischen Prioritäten und
Zeitscheiben",
JOURNAL=er,
PAGES="107-114",
YEAR=1980,
LANGUAGE="German",
REFERENCES=12,
KEYWORDS="Arrival time dependent; priority; FIFO",
ABSTRACT="Es wird ein Modell vom Typ M/G/1 berechnet. Anforderungen mit
der statistischen priorität $i$ $(i=1,2,\ldots,n)$ haben individuelle
Ankunftsraten und Bedienungsverteilungen. Neben der bekannten
Abfertigungsstrategie first-come-first-serve (FCFS) wird für
Anforderungen gleicher Priorität ein Zeitscheibenverfahren eingefuehrt,
das in Abhängigkeit der schon verbrauchten Bediendauer unt erschiedlich
lange Zeitscheiben verwendet. Die mittlere Wartezei",
}

@ARTICLE{Wegl80:Multiprocessor,
AUTHOR="J. Weglarz",
TITLE="Multiprocessor scheduling with memory allocation - a
deterministic approach",
JOURNAL=ieeetc,
VOLUME="C-29",
PAGES="703-709",
YEAR=1980,
REFERENCES=20,
KEYWORDS="Process management; multiprocessor system; main memory; memory
management; scheduling; independent tasks; resource management",
ANNOTE="This paper proposes a deterministic approach to the preemptive
scheduling of independent tasks, which takes into account primary memory
allocation in multiprocessor systems with virtual memory and a common
primary memory. Exact and approximate algorithms are presented which
minimize or tend to minimize the length of schedules on an arbitrary
number of identical processors.",
}

@TECHREPORT{Welc80:Simple,
AUTHOR="Peter D. Welch",
TITLE="Simple, graphical techniques for estimating the initial
transient",
INSTITUTION="IBM WATSON RESEARCH CENTER YORKTOWN HEIGTHS, NEW YORK",
YEAR=1980,
KEYWORDS="Simulation; method; graphics; transient behaviour",
ANNOTE="The problem: initial transient by statistical analysis of a
simulation output.",
}

@BOOK{Gele80:Queueing,
AUTHOR="E. Gelenbe and",
TITLE="Introduction to Queueing Networks",
ISBN="0-471-90464-3",
PUBLISHER="John Wiley and Sons",
ADDRESS="Chicester",
YEAR=1980,
KEYWORDS="Delay system",
}

@ARTICLE{Goel80:Hourly,
AUTHOR="L. F. Goeller",
TITLE="Hourly Traffic Versus Monthly Data in Engineering Telephone
Facilities",
JOURNAL=bcr,
VOLUME=10,
NUMBER=4,
PAGES="24-29",
YEAR=1980,
KEYWORDS="Measurement",
}

@ARTICLE{Hart80:Technische,
AUTHOR="U. Hartmann",
TITLE="Technische Einrichtungen für Fernsprechverkehrsuntersuchungen",
JOURNAL="Unterrichtsblätter der Deutschen Bundespost",
ADDRESS="Darmstadt",
VOLUME=33,
NUMBER=6,
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Measurement",
}

@ARTICLE{Hofs80:Verkehrsverhalten,
AUTHOR="H. Hofstetter",
TITLE="Das Verkehrsverhalten des digitalen Koppelnetzes im
Fernsprech-Vermittlungssystem {EWSD}",
JOURNAL=siemenstr,
ADDRESS="München",
VOLUME=3,
NUMBER=3,
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Jewe80:Systems,
AUTHOR="J. Jewett and B. Shrago and J. Gilliland and B. Yomtov",
TITLE="Systems Approach to Network Design: Choosing the Right
Technique",
JOURNAL=bcr,
VOLUME="May-June",
YEAR=1980,
KEYWORDS="Loss system",
}

@ARTICLE{Mean80:Class,
AUTHOR="D. R. Means",
TITLE="A Class of Lossless, Reciprocal Anti-sidetone Networks for
Telephone Sets",
JOURNAL=bstj,
VOLUME=59,
NUMBER=8,
YEAR=1980,
KEYWORDS="Link system",
}

@ARTICLE{Mehl80:Verfahren,
AUTHOR="N. Mehlhorn",
TITLE="Ein Verfahren zur Berechnung der Verzögerungswahrscheinlichkeit
bei Absuchvorgängen in zeitgeteilten Vermittlungseinrichtungen",
JOURNAL="Mitteilungen Institute Post-Fernmeldewesen",
VOLUME=24,
NUMBER=4,
PAGES="9-11",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="TDM; time division multiplex",
}

@ARTICLE{Neal80:Blocking,
AUTHOR="S. R. Neal",
TITLE="Blocking Distributions for Trunk Network Administration",
JOURNAL=bstj,
VOLUME=59,
NUMBER=6,
PAGES="829-844",
YEAR=1980,
KEYWORDS="Loss system",
}

@TECHREPORT{Rode80:Verkehrseigenschaften,
AUTHOR="A. Röder",
TITLE="Über die Verkehrseigenschaften und Strukturen einseitiger
vielstufiger Koppelanordnungen in Verlustsystemen",
TYPE="Bericht über verkehrstheoretische Arbeiten",
INSTITUTION="Institut für Nachrichtenvermittlung und
Datenenverarbeitung, Universität Stuttgart",
ADDRESS="Stuttgart, Germany",
NUMBER=28,
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Schn80:Belegungs,
AUTHOR="H. Schnack",
TITLE="Belegungs- und Gesprächdauer im internationalen
Selbstwählferndienst",
JOURNAL="Mitteilungen aus dem IPF",
NUMBER=1,
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Measurement",
}

@ARTICLE{Szel80:Trunk,
AUTHOR="C. R. Szelag",
TITLE="Trunk Demand Servicing in the Presence of Measurement
Uncertainty",
JOURNAL=bstj,
PAGES="845-860",
YEAR=1980,
KEYWORDS="Measurement",
}

@TECHREPORT{Thie80:Berechnung,
AUTHOR="G. Thierer",
TITLE="Die Berechnung der Verlustwahrscheinlichkeit in Linksystemen mit
Punkt-Punkt-Markierung",
TYPE="Bericht über verkehrstheoretische Arbeiten",
INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung,
TH Stuttgart",
ADDRESS="Stuttgart, Germany",
NUMBER=29,
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Wint80:Kopplung,
AUTHOR="W. Winter",
TITLE="Kopplung von Mikrorechnern über ein gemeinsames, zeitgeteilt
benutztes Bussystem",
JOURNAL=nte,
VOLUME=30,
NUMBER=6,
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Simulation",
ANNOTE="Firma KDT, Dresden, DDR",
}

@TECHREPORT{Wizg80:Architektur,
AUTHOR="M. Wizgall",
TITLE="Über Architektur, Betriebsweise und Verkehrsverhalten der
Steuerung einer rechnergesteuerten Vermittlungsstelle",
TYPE="Bericht über verkehrstheoretische Arbeiten",
INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung
der TH Stuttgart",
ADDRESS="Stuttgart, Germany",
NUMBER=27,
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Control; overload control",
}

@ARTICLE{Arch80:Generation,
AUTHOR="N. P. Archer",
TITLE="The generation of piecewise linear approximations of probability
distribution functions.",
JOURNAL="Journal of Statistical Computation and Simulation",
VOLUME=11,
NUMBER=1,
PAGES="21-40",
YEAR=1980,
KEYWORDS="random variate generation",
}

@TECHREPORT{Bux80:Traffic,
AUTHOR="W. Bux",
TITLE="Traffic-Based Dimensioning of Switching Nodes in Data and
Computer Networks",
INSTITUTION="Institute of Switching and Data Technics, University
Stuttgart",
ADDRESS="Stuttgart, Germany",
NUMBER="26. Report on Studie",
YEAR=1980,
KEYWORDS="queueing theory; capacity planning",
}

@INPROCEEDINGS{Bux8011:HDLC,
AUTHOR="W. Bux and K. Kümmerle and H. L. Truong",
TITLE="{HDLC} performance: Comparison of normal response mode and
asynchronous balanced mode of operation",
BOOKTITLE=ntc,
ADDRESS="Houston, Texas",
PAGES="1-6 (15.3)",
MONTH="November/December",
YEAR=1980,
KEYWORDS="Performance evaluation; link layer; HDLC",
}

@ARTICLE{Dave80:Self,
AUTHOR="D. Davey and J. G. Vaucher",
TITLE="Self-optimizing partitioned sequencing sets for discrete event
simulation",
JOURNAL=infor,
VOLUME=8,
NUMBER="NUMBER=1, PAGES=",
YEAR=1980,
KEYWORDS="Simulation; event set",
}

@ARTICLE{Devr80:Generating,
AUTHOR="L. Devroye",
TITLE="Generating the maximum of independent identically distributed
random variables",
JOURNAL="Computers and Mathematics with Applications",
VOLUME=6,
NUMBER=3,
PAGES="305-315",
YEAR=1980,
KEYWORDS="random variate generation",
}

@ARTICLE{Gunt80:Almost,
AUTHOR="F. L. Gunther and R. W. Wolff",
TITLE="The almost regenerative method for stochastic system simulation",
JOURNAL=or,
VOLUME=28,
NUMBER=2,
PAGES="375-386",
YEAR=1980,
KEYWORDS="Simulation; statistical technique",
}

@ARTICLE{Haze80:Formulas,
AUTHOR="G. B. Hazen and A. Alan B. Pritsker",
TITLE="Formulas for the variance of the sample mean in finite state
Markov processes",
JOURNAL="Journal of Statistical Computation and Simulation",
VOLUME=12,
PAGES="25-40",
YEAR=1980,
KEYWORDS="Simulation; statistical technique",
}

@ARTICLE{Heym80:Relation,
AUTHOR="D. P. Heyman and S. Stidham",
TITLE="The relation between customer and time averages in queues",
JOURNAL=or,
VOLUME=28,
NUMBER=4,
PAGES="983-994",
YEAR=1980,
KEYWORDS="Queueing theory; number of elements in system",
}

@ARTICLE{Hosa80:New,
AUTHOR="T. Hosaka and S. Kano and K. Kitami",
TITLE="New common channel signaling system: An overview",
JOURNAL=recl,
VOLUME=28,
NUMBER="1-2",
PAGES="41-49",
YEAR=1980,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Jans80:Insensitivity,
AUTHOR="U. Jansen and D. König",
TITLE="Insensitivity and steady-state probabilities in product form for
queueing networks",
JOURNAL=eik,
VOLUME=16,
NUMBER="8-9",
PAGES="385-397",
YEAR=1980,
KEYWORDS="Queueing network; product form; analysis",
}

@ARTICLE{Kind80:New,
AUTHOR="A. J. Kinderman and J. F. Monahan",
TITLE="New methods for generating Student's $t$ and gamma variables",
JOURNAL=comp,
VOLUME=25,
NUMBER=4,
PAGES="369-777",
YEAR=1980,
KEYWORDS="random variate generation",
}

@TECHREPORT{Lave80:Closed,
AUTHOR="S. S. Lavenberg",
TITLE="Closed Multichain Product Form Queueing Networks with Large
Population Sizes",
INSTITUTION="IBM Research Report RC-8496, Yorktown Heights, New York,
Sep",
ADDRESS="Yorktown Heights",
PAGES="1-32",
YEAR=1980,
KEYWORDS="Queueing network; product form; analysis",
}

@ARTICLE{Lave80:Stationary,
AUTHOR="S. S. Lavenberg and M. Reiser",
TITLE="Stationary state probabilities at arrival instants for closed
queueing networks with multiple types of customers",
JOURNAL=jap,
VOLUME=17,
NUMBER=4,
PAGES="1048-1061",
YEAR=1980,
KEYWORDS="Queueing network; product form",
}

@ARTICLE{Mars80:Generating,
AUTHOR="G. Marsaglia",
TITLE="Generating random variables with a t-distribution",
JOURNAL=moc,
VOLUME=34,
NUMBER=149,
PAGES="235-236",
YEAR=1980,
KEYWORDS="random variate generation",
}

@ARTICLE{Sait8001:Signaling,
AUTHOR="I. Saito and S. Yamada and H. Yamauchi",
TITLE="Signaling equipment for the new common channel signaling system",
JOURNAL=recl,
VOLUME=28,
NUMBER="1/2",
PAGES="80-90",
MONTH="January/February",
YEAR=1980,
KEYWORDS="Signalling; common channel; CCS",
}

@INPROCEEDINGS{Schm80:Random,
AUTHOR="B. W. Schmeiser",
TITLE="Random variate generation: A survey",
BOOKTITLE=wsc,
EDITOR="T. I. Ören and C. M. Shub and P. F. Roth",
ADDRESS="Orlando, Florida",
YEAR=1980,
KEYWORDS="random variate generation",
}

@ARTICLE{Schm8007:Beta,
AUTHOR="B. W. Schmeiser and A. J. G. Babu",
TITLE="Beta variate generation via exponential majorizing functions",
JOURNAL=or,
VOLUME=28,
NUMBER=4,
PAGES="917-926",
MONTH="July/August",
YEAR=1980,
KEYWORDS="random variate generation",
}

@ARTICLE{Suzu8001:Common,
AUTHOR="Shuji Suzuki and Y. Satake and H. Tokunaga",
TITLE="Common channel signaling network structure",
JOURNAL=recl,
VOLUME=28,
NUMBER="1-2",
PAGES="50-66",
MONTH="January/February",
YEAR=1980,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Tomi8001:Software,
AUTHOR="A. Tomita and F. Sato",
TITLE="Software for new common channel signaling system",
JOURNAL=recl,
VOLUME=28,
NUMBER="1--2",
PAGES="67-79",
MONTH="January/February",
YEAR=1980,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Take80:Parallel,
AUTHOR="H. Takenouchi and M. Hatada and K. Hiyama",
TITLE="Parallel Processing Simulator for Network Systems using
Multi-Microcomputer",
JOURNAL="IEEE proceedings distributed computing",
PAGES="55-62",
YEAR=1980,
REFERENCES=6,
KEYWORDS="Distributed simulation; parallel computing",
ANNOTE="This paper describes the parallel processing simulator,
emphasizing details of its hardware system configuration, execution
control, model description language, and simulation software, as well as
its application to a telephone network simulation.",
}

@MANUAL{Digi80:Data,
AUTHOR="{Digital Equipment Corporation}",
TITLE="Data Access Protocol Functional Specification",
EDITION="Version 5.6.0",
ADDRESS="Maynard, MA",
YEAR=1980,
}

@MANUAL{Digi80:DigitalNetwork,
AUTHOR="{Digital Equipment Corporation}",
TITLE="Digital Network Architecture: Network Management Functional
Specification",
EDITION="Version 2.0.0",
ADDRESS="Maynard, MA",
NOTE="(Phase III)",
YEAR=1980,
}

@MANUAL{Digi80:DECnetSession,
AUTHOR="{Digital Equipment Corporation}",
TITLE="{DECnet:} Session Control Functional Specification",
EDITION="Version 1.0.0",
ADDRESS="Maynard, MA",
NOTE="(Phase III)",
YEAR=1980,
}

@MANUAL{Digi80:DECnetGeneral,
AUTHOR="{Digital Equipment Corporation}",
TITLE="{DECnet} General Description",
EDITION="Phase III",
ADDRESS="Maynard, MA",
YEAR=1980,
}

@MANUAL{Digi80:DECnetTransport,
AUTHOR="{Digital Equipment Corporation}",
TITLE="{DECnet:} Transport Functional Specification",
EDITION="Version 1.3.0",
ADDRESS="Maynard, MA",
NOTE="(Phase III)",
YEAR=1980,
}

@MANUAL{Digi80:DECnetMaintenance,
AUTHOR="{Digital Equipment Corporation}",
TITLE="{DECnet:} Maintenance Operation Protocol Functional
Specification",
EDITION="Version 2.1.0",
ADDRESS="Maynard, MA",
NOTE="(Phase III)",
YEAR=1980,
}

@MANUAL{Digi80:Digital,
AUTHOR="{Digital Equipment Corporation}",
TITLE="Digital Network Network Services Protocol",
EDITION="3.2.0",
ADDRESS="Maynard, MA",
NOTE="(Phase III)",
YEAR=1980,
}

@MISC{Pete80:Source,
AUTHOR="Haldane Roy Peterson",
TITLE="Design of Source Quench Congestion Control Algorithms in
Interconnected Networks",
HOWPUBLISHED="Undergraduate Thesis",
NOTE="Massachusetts Institute of Technology",
YEAR=1980,
}

@MANUAL{Shoc80:Ethernet,
AUTHOR="John F. Shoch",
TITLE="The Ethernet Specification",
EDITION="Draft Spec. 2/15/80",
ORGANIZATION="Xerox Corporation",
ADDRESS="Palo Alto, CA 94304",
YEAR=1980,
}

@ARTICLE{Cona80:Character,
AUTHOR="James W. Conard",
TITLE="Character-oriented data link protocols",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="445-454",
YEAR=1980,
}

@ARTICLE{Gord80:RINGNET,
AUTHOR="R. L. Gordan and W. W. Farr and P. Levine",
TITLE="{RINGNET:} a packet switched local network with decentralised
control",
JOURNAL=cn,
VOLUME=4,
PAGES="373-379",
NOTE="also in Proc. of 4th Conference on Local Computer Networks (1979),
106-116 and \cite{Thur81:Tutorial}",
YEAR=1980,
}

@INPROCEEDINGS{Kell80:Overview,
AUTHOR="P. T. Kelly",
TITLE="An overview of the plans of the European telecommunications
administrations for public data networks and services",
BOOKTITLE="Conference on Networks",
SERIES="Infotech State of Art",
ADDRESS="Paris",
YEAR=1980,
}

@INPROCEEDINGS{Lamo80:Private,
AUTHOR="F. Lamond",
TITLE="Private networks",
BOOKTITLE="Conference on Networks Infotech state of arts",
ADDRESS="Paris",
YEAR=1980,
}

@ARTICLE{Pouz80:Public,
AUTHOR="L. Pouzin",
TITLE="Public data networks --- an overview",
EDITOR="G. Murray",
SERIES="Infotech State of Art Reports",
JOURNAL=datacommunications,
PAGES="215-228",
YEAR=1980,
}

@INPROCEEDINGS{Schl80:Control,
AUTHOR="R. D. Schlegel",
TITLE="Control data {PLATO} computer based education network",
BOOKTITLE="Networks",
ADDRESS="Bombay",
YEAR=1980,
}

@INPROCEEDINGS{Yeh80:Local,
AUTHOR="J. W. Yeh and W. Siegmund",
TITLE="Local network architectures",
BOOKTITLE="3rd Symposium on Small systems, ACM Sigsmall",
ADDRESS="Palo Alto",
VOLUME=6,
YEAR=1980,
}

@BOOK{Abra80:Computer,
TITLE="Computer Networks: A Tutorial",
EDITOR="M. D. Abrams and R. P. Blanc and I. W. Cotton",
PUBLISHER="IEEE",
YEAR=1980,
KEYWORDS="computer networks; survey; collection",
}

@INPROCEEDINGS{Came80:Report,
AUTHOR="W. H. Cameron and P. Galloy and W. J. Graham",
TITLE="Report on the Toronto Advanced Routing Concpet Trial",
BOOKTITLE="Telecommunication Networks Planning Conference",
ADDRESS="Paris",
YEAR=1980,
}

@MISC{CCIT80:Control,
AUTHOR="C. C. ITT",
TITLE="Control Procedures for the Teletex Service",
HOWPUBLISHED="VIIth Plenary Assembly, Draft Rec. S62, Doc 88",
INSTITUTION="CCITT",
ADDRESS="Geneva",
PAGES="77-137",
YEAR=1980,
}

@MISC{CCIT80:Teletex,
AUTHOR="C. C. ITT",
TITLE="Teletex Service, {F.200}",
INSTITUTION="CCITT",
ADDRESS="Geneva",
YEAR=1980,
KEYWORDS="Teletex",
}

@MISC{CCIT80:Character,
AUTHOR="C. C. ITT",
TITLE="Character Repertoire and Coded Character Sets For the
International Teletex Service",
HOWPUBLISHED="VIIth Plenary Assembly, Draft Rec. S61",
INSTITUTION="CCITT",
ADDRESS="Geneva",
YEAR=1980,
}

@MISC{CCIT80:Independent,
AUTHOR="C. C. ITT",
TITLE="Network Independent Basic Transport Service for Teletex",
HOWPUBLISHED="VIIth Plenary Assembly, Draft Rec. S70, Doc 88",
INSTITUTION="CCITT",
PAGES="157-204",
YEAR=1980,
}

@TECHREPORT{DCA80:Final,
AUTHOR="D. C. A",
TITLE="Final Report for the Atlantic Packet Satellite Project",
INSTITUTION="U.S. Defense Communications Agency",
NUMBER="contract DCA 100-78-",
YEAR=1980,
}

@INCOLLECTION{Hopp80:Cambridge,
AUTHOR="Andrew Hopper",
TITLE="The Cambridge Ring - A Local Network",
BOOKTITLE="Advanced Techniques for Microprocessor Systems",
EDITOR="F. K. Hanna",
PUBLISHER="Peter Perigrinus Ltd",
YEAR=1980,
}

@TECHREPORT{Palm80:COM,
AUTHOR="J. Palme and  others",
TITLE="The {COM} Teleconferencing System functional Specification",
TYPE="FOA report",
INSTITUTION="University of Stockholm",
NUMBER="C10164-M6",
YEAR=1980,
}

@TECHREPORT{Smit80:TELEMAIL,
AUTHOR="D. G. Smith",
TITLE="{TELEMAIL} Reference Manual",
INSTITUTION="GTE Telenet",
ADDRESS="Vienna, Virginia",
YEAR=1980,
}

@PHDTHESIS{Trea80:Measurement,
AUTHOR="S. W. Treadwell",
TITLE="Measurement Methods in Packet Switched Networks",
SCHOOL="University College London",
NUMBER="TR 65",
YEAR=1980,
}

@BOOK{Sear80:Speech,
TITLE="Speech Act Theory and Pragmatics",
EDITOR="J. R. Searle",
PUBLISHER="Reidel Publishing Company",
YEAR=1980,
}

@ARTICLE{Chen80:Image,
AUTHOR="Pi-Chun Chen and T. Pavlidis",
TITLE="Image segmentation as an estimation problem",
JOURNAL="CGIP",
VOLUME=12,
PAGES="153-172",
YEAR=1980,
ABSTRACT="Picture segmentation is expressed as a series of decision
problems within the framework of a split and merge algorithm. First
regions of an arbiturary image segmentation are tested for uniformity
and if not uniform they are subdivided into smaller regions, or set
aside if their size is below a given threshold. Next regions classified
as uniform are subject to a cluster analysis to identify similar types
which are merged. At this point there exists reliable estimates of the
parameters of the random field of each type of region and they are used
to classify some of the remianing small regions. Any regions remaining
after this step are considered part of a boundary ambiguity zone. The
location of the boundary is estimated then by interpolation between the
existing uniform regions. Experimental results on artificila pictures
are also included.",
}

@ARTICLE{Chit80:Learning,
AUTHOR="C. B. Chittineni",
TITLE="Learning with imperfectly labelled patterns",
JOURNAL=pattern,
VOLUME=12,
PAGES="281-291",
YEAR=1980,
ABSTRACT="The problem of learning in pattern recognition using
imperfectly labelled patterns is considered. Using a probabilistic model
for the mislabelling of the training patterns, the author discusses
performance of Bayes and nearest neighbour classifiers with imperfect
labels. Schemes are presented for training the classifier using both
parametric and non parametric techniques. Methods are developed for the
correction of imperfect labels. To gain an understanding of the learning
process, the author derives expressions for success probability as a
function of training time for a 1D increment error correction classifier
with imperfect labels. Futhermore, feature selection with imperfectly
labelled patterns is considered. Very mathsy, theoretical.",
}

@INPROCEEDINGS{Crai80:Sources,
AUTHOR="R. G. Craig and M. L. Labovitz",
TITLE="Sources of varation in {LANDSAT} autocorrelation",
BOOKTITLE="14th international Symposium Remote Sensing of the
Environment",
PAGES="1755-1767",
YEAR=1980,
}

@TECHREPORT{Davi80:Logic,
AUTHOR="L. S. Davies",
TITLE="A logic model for constraint propagation",
TYPE="Technical report",
INSTITUTION="Computer Science Department, University of Texas",
NUMBER="TR-137",
YEAR=1980,
}

@INCOLLECTION{Duff80:CLIP,
AUTHOR="M. J. B. Duff",
TITLE="{CLIP-4}",
BOOKTITLE="Special computer architectures for pattern processing",
EDITOR="K S Fu",
PUBLISHER="CRC Press",
ADDRESS="Boca Raton, Florida",
YEAR=1980,
}

@ARTICLE{Eklu8001:Relaxation,
AUTHOR="J. O. Eklundh and H. Yamamoto and A Rosenfeld",
TITLE="A Relaxation method for multispectral pixel classification",
JOURNAL=ieeepami,
VOLUME=2,
NUMBER=1,
YEAR=1980,
}

@ARTICLE{Gurn8002:Threshold,
AUTHOR="C. M. Gurney",
TITLE="Threshold selection for line detection algorithms",
JOURNAL="IEEE Transactions on Geoscience and remote sensing",
VOLUME=18,
NUMBER=2,
PAGES="204-211",
YEAR=1980,
ABSTRACT="Band 7 MSS (0.8-1.1um) good contrast for lines. Most linear
features have low intensity wrt background.",
}

@ARTICLE{Hara80:Edge,
AUTHOR="R. M. Haralick",
TITLE="Edge and regional analysis for digital image data",
JOURNAL="CGIP",
VOLUME=12,
PAGES="60-73",
YEAR=1980,
}

@ARTICLE{Harr8004:Spectral,
AUTHOR="R. J. Harris",
TITLE="Spectral and spatial image processing for remote sensing",
JOURNAL=remote,
VOLUME=1,
NUMBER=4,
PAGES="361-375",
YEAR=1980,
ABSTRACT="The paper presents an argument that remote sensing image
processing should attempt to copy human abilities. The techniques of
spatial analysis and textural analysis are reviewed and compared in
their abilities to emulate human interpretation. A preference for
texture analysis is expressed. Gives an example of Fourier analysis used
to identify cloud types. Points out that the aperture (window) used to
surround the section will distort the transform. Also scan lines can
give problems. He argues that 'first order statistics' ie mean, density,
variance, edge counting perform as well or better than Fourier analysis.
A useful method evaluating the performance of a texture classifier is
given.",
}

@ARTICLE{Hass80:Use,
AUTHOR="M. Hassner and J. Sklansky",
TITLE="The use of Markov random fields as models of texture",
JOURNAL="CGIP",
VOLUME=12,
PAGES="357-370",
YEAR=1980,
ABSTRACT="We propose Markov random fields (MRFs) as probabilistic models
of digital image texture where a textured region is viewed as a finite
sample of a 2D random process describable by its statisticl parameters.
MRFs are multidimensional generalisations of Markov chains defined in
terms of conditional probabilities associated with spatial
neighbourhoods. We present an algorithm that generates an MRF on a
finite toroidal square lattice from an independent identically
distributed (iid) array of random variables and a given set of
independent real-valued statistical parameters. The parametric
specification of a consistent collection of MRF conditional
probabilities is a general result known as the MRF-Gibbs Random Field
(GRF) equivalence. The MRF statistical parameters control the size and
directionality of the clusters of adjacent similar pixels which are
basic to texture descrimination and thus seem to constitute an efficient
model of texture. In the last part of this paper we outline an MRF
parameter estimation method and goodness of fit statistical tests
applicable to MRF models for a given unknown digital image texture on a
finite toroidal square lattice. The estimated parameters may be used as
basic features in texture classification. Alternatively these parameters
may be used in conjunction with the MRF generation algorithm as a
powerful data compression scheme.",
}

@ARTICLE{Holl8003:Adaptive,
AUTHOR="J. H. Holland",
TITLE="Adaptive algorithms for discovering and using general patterns in
growing knowledge bases",
JOURNAL="International Journal on Policy Analysis and Information
Systems",
VOLUME=4,
NUMBER=3,
PAGES="245-268",
YEAR=1980,
ABSTRACT="This paper concerns the design of user-orientated, interactive
systems that combine knowledge-acquisition techniqus with the basic
techniques of database searching and word processing. The object of such
a system is to create, for each individual user, a database and
acquisition system relevant to his changing needs and purposes. This of
course, requires continual changes in the system's organisation.
Learning, augmented by sophisticated inference procedures, is a sine qua
non for such systems, unless a computer professional is to be
permanently assigned to each copy of the system. 6 criteria for an
interactive knowledge-acquisition system employing learning are
presented. Then a prototype, based on extant systems and using an
adaptive algorithm as an interface procedure, is used to explore this
criteria in detail.",
}

@ARTICLE{Jame80:Feature,
AUTHOR="M. James",
TITLE="Feature detection using the general linear model",
JOURNAL=pattern,
VOLUME=12,
PAGES="137-140",
YEAR=1980,
ABSTRACT="The detection of simple features using position-invariant
filters constructed by the use of the matched filter theorem is extended
to the general case of features with more than one free parameter.",
}

@ARTICLE{Kana80:Markov,
AUTHOR="L Kanal",
TITLE="Markov mesh models",
JOURNAL="CGIP",
VOLUME=12,
PAGES="371-375",
YEAR=1980,
ABSTRACT="Markov mesh models presented by Abend, Harley and Kanal sought
to incorporate spatial dependencies in reducing the complexity of
likelihood functions for image classification. This study of near
neighbour spatial dependencies anticipated the latter interest in Markov
random fields (MRF) in image modelling. Here I summarise the Markov mesh
presentation and comment on some related references and developments of
MRF models.",
}

@ARTICLE{Land80:Development,
AUTHOR="D. A. Landgrebe",
TITLE="The development of a spectral-spatial classifier for Earth
observational data",
JOURNAL=pattern,
VOLUME=12,
PAGES="165-175",
YEAR=1980,
ABSTRACT="Over the last several years ma classifier for observational
image data has been under development which is intended to achieve
improved performance by utilising spatial characteristics of the data as
an adjunct to multispectral ones. This paper provides an overview of the
conception, development, evaluation and documentation of this
spectral-spatial classifier. The research program leading to this
classifier is described, the algorithms of the current implementation
called ECHO are outlined, and results on its performance are summarised.
These results show it to have improved accuracy, with greater
computation efficiency, and only slightly increased operator
complexity.",
}

@BOOK{Laws80:Textured,
AUTHOR="K. I. Laws",
TITLE="Textured image segmentation {(PhD} dissertation)",
PUBLISHER="Dept. of Engineering, University Southern California",
YEAR=1980,
}

@ARTICLE{Mabb80:Cross,
AUTHOR="A. Mabbet and M. Stone and J. Washbrook",
TITLE="Cross-validatory selection of binary variables in differential
diagnosis",
JOURNAL=as,
VOLUME=29,
PAGES="198-204",
YEAR=1980,
ABSTRACT="The statistical method of cross-validatory choice is used to
contruct a basis for prediction of a binary dependent variable from
binary independent variables. The implementation of the method involves
a score function, a cut off value and a loss function. It proceeds by
unrestricted sequential splitting, followed by a C-V selection of the
cut off value which is then applied to the result of the splitting. The
method is evaluated on 3 well known data bases for the diagnosis of
kerato conjunctivitis sicca, rheumatoid arthritis and the treatment of
jaundice. Generalisations of the technique are outlined.",
}

@INPROCEEDINGS{Marr80:Theory,
AUTHOR="D. Marr and E. C. Hildreth",
TITLE="Theory of edge detection",
BOOKTITLE="Royal Society London",
VOLUME="B207",
PAGES="187-217",
YEAR=1980,
}

@ARTICLE{Mich80:Pattern,
AUTHOR="R. S. Michalski",
TITLE="Pattern recognition as rule guided inductive inference",
JOURNAL=ieeepami,
VOLUME=2,
PAGES="349-361",
YEAR=1980,
ABSTRACT="The determination of pattern recognition rules is viewed as a
problem of inductive inference, guided by generalisation rules, which
control the gen. process, and problem knowledge rules, which represent
the underlying semantics relevant to the recognition problem under
consideration. The paper formulate the theoretical framework and a
method for infering general and optimal (according to certain criterion)
descriptions of object classess from examples of classification or
partial discriptions. The language for expressing the class descriptions
and the guidance rules is an extension of the first order predicate
calculus, called variable-valued logic calculus VL21. VL21 involves
typed variables and contains several new operators especially suited for
conducting inductive inference, such as selector, internal disjunction,
internal conjunction, exception and generalisation.",
}

@BOOK{Naga80:Structural,
AUTHOR="M. Nagao and T. Matsuyama",
TITLE="A Structural Analysis of Complex Aerial Photographs",
PUBLISHER="Plenum Press",
ADDRESS="New York",
YEAR=1980,
}

@ARTICLE{Pele80:New,
AUTHOR="S. Peleg",
TITLE="A new probabilistic relaxation scheme",
JOURNAL=ieeepami,
VOLUME=2,
PAGES="362-369",
YEAR=1980,
ABSTRACT="Let a vector of probabilities be associated with every node of
a graph. These probabilities define a random variable representing the
possible labels of the node. Probabilities at neighbouring nodes are
used iteratively to update the probabilities at a given node based on
statistical relations among node labels. The results are compared with
previous work on probabilistic relaxation labelling, and examples are
given from the image segmentation domain. References are also given to
applications of the new scheme in text processing.",
}

@ARTICLE{Pele80:Determining,
AUTHOR="S. Peleg and A Rosenfeld",
TITLE="Determining compatibility coefficients for curve enhancement
relaxation processes",
JOURNAL=ieeepami,
VOLUME=2,
PAGES="362-369",
YEAR=1980,
ABSTRACT="Relaxation labelling is a process that attempts to
disambiguate probabilistic labellings of objects. Compatibility
coefiicients play an important role in the rrelaxaxtion process. No
explanation exists at present for their exact meaning, and no algorithm
has been proposed to generate them . Some possible interpretations of
these coefficients are presented, and algorithms are suggested to obtain
them from the initail probabilistic labelling. Examples are given for
the case where relaxation is used to disambiguate the detection of
curves in pictures.",
}

@ARTICLE{Prag8001:Extracting,
AUTHOR="J. M. Prager",
TITLE="Extracting and labelling boundary segments in natural scenes",
JOURNAL=ieeepami,
VOLUME=2,
NUMBER=1,
PAGES="16-27",
YEAR=1980,
}

@ARTICLE{Rush8012:Comparison,
AUTHOR="C. K. Rushforth and R. L. Frost",
TITLE="Comparison of some algorithms for reconstructing space-limited
images",
JOURNAL="Journal Optical Society of America",
VOLUME=70,
NUMBER=12,
PAGES="1539-1544",
YEAR=1980,
ABSTRACT="This paper deals with the long standing problem of
reconstructing an optical object of known finite spatial extent from an
image that is a noisy, low pass filtered version of the object. The
development of a number of iterative reconstruction algorithms in recent
years has created a resurgence of interest in this topic. We consider
several reconstruction algorithms from a point of view that illuminates
their performance in the presence of noise. WQe also introduce a new
iterative reconstruction algorithm and compare its performance with that
of earlier algorithms proposed by Gerchberg.",
}

@ARTICLE{Taki80:Learning,
AUTHOR="R. Takiyama",
TITLE="A learning procedure for multisurface method of pattern
separation",
JOURNAL=pattern,
VOLUME=12,
PAGES="75-82",
YEAR=1980,
ABSTRACT={Mangasarian has proposed an interesting method of pattern
separation, which is called {"}multisurface method{"}. In the method,
linear programming problems are recursively solved, and the correct
classification of any disjoint pattern sets is basically possible.
However the fact that linear programming problems are recursively solved
leads to the result that it takes long computation times and requires
much memory space of computer in use. This paper describes a learning
procedure for multisurface method instead of linear programming to avoid
drawbacks above. The proposed learning algorithm requires only
repetitive simple calculations. Experimental results show that the
computation times required by learning procedure are shorter than those
by linear programming.},
}

@PHDTHESIS{Wall80:Mechanisms,
AUTHOR="David W. Wall",
TITLE="Mechanisms for Broadcast and Selective Broadcast",
SCHOOL="Department of Electrical Engineering, Stanford University",
YEAR=1980,
}

@ARTICLE{Anon8001:Transborder,
AUTHOR="Anonymous",
TITLE="Transborder Data Flow Issues",
JOURNAL=ccr,
VOLUME=10,
NUMBER=1,
MONTH="January/April",
YEAR=1980,
}

@ARTICLE{Anon8001:Draft,
AUTHOR="Anonymous",
TITLE="Draft Revised {CCITT} Recommendation {X.25}",
JOURNAL=ccr,
VOLUME=10,
NUMBER=1,
MONTH="January/April",
YEAR=1980,
}

@TECHREPORT{Chan80:Termination,
AUTHOR="K. M. Chandy and J. Misra",
TITLE="Termination detection of diffusing computations in communicating
sequential processes",
INSTITUTION="Computer Science Dept. University of Texas at Austin",
ADDRESS="Austin, TX",
NUMBER="TR-144",
YEAR=1980,
}

@BOOK{Step80:Three,
AUTHOR="Mark B. Stephens",
TITLE="Three Mile Island",
PUBLISHER="Random House",
YEAR=1980,
}

@PHDTHESIS{Bux80:Über,
AUTHOR="W. Bux",
TITLE="Über die verkehrsgerechte Dimensionierung der Vermittlungsknoten
in Daten- und Rechnernetzen",
SCHOOL="Universität Stuttgart, IND",
ADDRESS="Stuttgart, Germany",
VOLUME=26,
NOTE="Bericht über verkehrstheoretische Arbeiten",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Queueing system; packet switching",
}

@ARTICLE{McQu80:New,
AUTHOR="J. M. McQuillan and I. Richer and E. C. Rosen",
TITLE="The new routing algorithm for the {ARPANET}",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="711-719",
YEAR=1980,
REFERENCES=12,
KEYWORDS="ARPANET; routing algorithm",
ABSTRACT="In the new procedure, each node in the network maintains a
database describing the complete network topology and the delays on all
lines, and uses the database describing the network to generate a tree
representing the minimum delays paths from a given root node to every
other network node. because the traffic in the network can be quite
variable, each node periodically measures the delays along its outgoing
lines and forwards this information",
}

@BOOK{Saue80:Computer,
AUTHOR="C. H. Sauer and K. M. Chandy",
TITLE="Computer systems performance modeling",
PUBLISHER="Prentice-Hall",
ADDRESS="Englewood Cliffs, NJ",
PAGES="1-352",
YEAR=1980,
KEYWORDS="Model; performance evaluation; Queueing network; survey;
simulation; application; realization",
ABSTRACT="introduction; general principles; markovian queueing models of
computer systems; isolated queues and open networks of queues; closed
product form queueing networks; approximation; simulation; measurement
and parameter estimation; management of modeling projects",
}

@INCOLLECTION{Schu80:Sprachpausenausnutzung,
AUTHOR="U. Schütte",
TITLE="Sprachpausenausnutzung mit dem {TLD-System}",
BOOKTITLE="Unterrichtblätter der DBP",
PUBLISHER="Deutsche Post",
ADDRESS="Germany",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="TASI; telephony",
}

@ARTICLE{Wu8009:Reverse,
AUTHOR="Chengke Wu and T. Feng",
TITLE="The Reverse - Exchange Interconnection Network",
JOURNAL=ieeetc,
VOLUME="C-29",
NUMBER=9,
PAGES="801-811",
YEAR=1980,
KEYWORDS="Interconnection network; parallel computing; routing
algorithm",
ABSTRACT="Properties of the reverse-exchanga interconnection network are
used to develop a reconfiguration scheme and a two-pass structurefor
enhancing the efficiency of a class of multistage interconnection
networks. Functional relationships among a class of multistage
interconnection networks are first derived. According to the functional
relationships, we propose a reconfiguration sche me which enables a
network to accomplish various interconnection",
}

@ARTICLE{Azza8006:Hierarchische,
AUTHOR="A. Azzam and G. Entreß",
TITLE="Hierarchische Gestaltung einer Rechner-Simulation",
JOURNAL=nte,
ADDRESS="Germany",
VOLUME=30,
NUMBER=6,
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Data traffic; computer network",
}

@PHDTHESIS{Röde80:Über,
AUTHOR="A. Röder",
TITLE="Über die Verkehrseigenschaften und Strukturen einseitiger
vielstufiger Koppelanordnungen in Verlustsystemen",
SCHOOL="Institut fr Nachrichtenvermittlung und Datenenverarbeitung,
Universität Stuttgart, Bericht uber verkehrstheoretische Arbeiten",
ADDRESS="Stuttgart, Germany",
VOLUME=28,
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Link system",
}

@PHDTHESIS{Wizg80:Über,
AUTHOR="M. Wizgall",
TITLE="Über Architektur, Betriebsweise und Verkehrsverhalten der
Steuerung einer rechnergesteuerten Vermittlungsstelle",
SCHOOL="Institut für Nachrichtenvermittlung und Datenverarbeitung der TH
Stuttgart",
ADDRESS="Stuttgart, Germany",
VOLUME=27,
NOTE="27. Bericht über verkehrstheoretische Arbeiten",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Control; overload control",
}

@ARTICLE{Addi80:General,
AUTHOR="R. G. Addie and G. Codsi and P. Gerrand and M. Rubinstein",
TITLE="A General Exchange Simulator for Capacity Studies of
Telecommunication Systems",
JOURNAL=atr,
VOLUME=14,
NUMBER=1,
PAGES="18-27",
YEAR=1980,
KEYWORDS="capacity planning; simulation; traffic generator",
}

@TECHREPORT{Ahls80:En,
AUTHOR="B. V. M. Ahlstedt",
TITLE="En Samling av Bruno {V.} {M.} Ahlstedts Publikationer om
Telefontrafik",
INSTITUTION="Helsinki University of Technology, Telecommunication
Laboratory",
ADDRESS="Helsinki, Finland",
NUMBER="4/80",
YEAR=1980,
LANGUAGE="Finnish",
KEYWORDS="traffic theory",
}

@ARTICLE{Bard8005:Estimation,
AUTHOR="Y. Bard",
TITLE="Estimation of State Probabilities Using the Maximum Entropy
Principle",
JOURNAL=ibmjrd,
VOLUME=24,
NUMBER=5,
PAGES="563-569",
YEAR=1980,
KEYWORDS="method; entropy; estimation; probability; performance
evaluation; computer performance",
ABSTRACT="A simple method is derived for computing state probabilities
of a system when the probabilities of certain aggregate states are
known. The method is based on maximizing the system entropy. It is shown
that the results obtained by the method satisfy certain assumptions on
statistical independence between events. The method is applied to a
problem arising in computer performance analysis.",
}

@ARTICLE{Behr80:Modelling,
AUTHOR="J. P. Behr and P. Pernards and B. Schendel and J. Schwandt",
TITLE="Modelling and Simulation as an Aid in Designing a Computer",
JOURNAL=ptr,
VOLUME=39,
NUMBER=5,
PAGES="134-149",
YEAR=1980,
KEYWORDS="Modeling; simulation; computer architecture; design",
}

@ARTICLE{Berr80:Definition,
AUTHOR="L. T. M. Berry",
TITLE="On the Definition of Offered Traffic",
JOURNAL=atr,
VOLUME=14,
NUMBER=2,
PAGES="35-38",
YEAR=1980,
KEYWORDS="Traffic offered",
}

@ARTICLE{Bies8003:Network,
AUTHOR="S. Biesel-Guitonneau and B. Camoin",
TITLE="Network Design Taking into Account Breakdowns and Traffic
Overloads",
JOURNAL=atele,
ADDRESS="France",
VOLUME=35,
NUMBER="3-4",
PAGES="143-149",
YEAR=1980,
KEYWORDS="traffic theory; telephony; QOS; evaluation; reliability;
mathematical model; algorithm; optimization",
ABSTRACT="Models and algorithms are presented enabling an evaluation of
the traffic efficiency of a telephone network under abnormal working
conditions and an optimization of network structures with reliability
requirements.",
}

@ARTICLE{Bill8001:Automatiskt,
AUTHOR="O. Billström and B. Troili",
TITLE="Automatiskt, Publikt Mobiltelefonsystem",
JOURNAL=ericssonr,
ADDRESS="Stockholm, Sweden",
NUMBER=1,
PAGES="26-36",
YEAR=1980,
LANGUAGE="Swedish",
KEYWORDS="cellular system; mobile radio",
}

@ARTICLE{Boda8003:Observations,
AUTHOR="H. Bodard and J. P. Guerineau",
TITLE="Observations de la quelité de service du trafic international au
moyen dún minicalculateur. Observations of the Quality of Service on
International Traffic by Means of a Minicomputer",
JOURNAL=atele,
ADDRESS="France",
VOLUME=35,
NUMBER="3-4",
PAGES="125-135",
YEAR=1980,
KEYWORDS="traffic theory; telephony; QOS; measurement method; parameter
estimation; simulation; international; observation",
ABSTRACT="With the aim of gaining greater insight into the quality of
service for international calls, the French PTT has conducted a
measurement campaign at the Paris international complex on certain
outgoing routes which use the CCITT No 4 signalling code. After a brief
description of the equipment used to make these observations and a
discussion of the underlying principles, this",
}

@TECHREPORT{Boel80:Semi,
AUTHOR="R. Boel",
TITLE="Semi-Markov Analysis of finite Buffer Queues: A Martingale
Approach",
INSTITUTION="Computing and Control Department, Imperial College,
London",
PAGES=10,
YEAR=1980,
KEYWORDS="finite buffer; finite queue; semi markov process; martingale;
analysis",
}

@TECHREPORT{Boel80:Stochastic,
AUTHOR="R. Boel",
TITLE="Stochastic Modeling of Computer Networks",
INSTITUTION="Computing and Control Department, Imperial College,
London",
PAGES=16,
YEAR=1980,
KEYWORDS="Stochastic theory; stochastic analysis; computer network",
}

@ARTICLE{Bran80:Approximation,
AUTHOR="J. Brandt and B. Lisek",
TITLE="On the Approximation of {GI/GI/m/0} by Means of
{GI/GI/infinite}",
JOURNAL=eik,
ADDRESS="Soviet Union",
VOLUME=16,
NUMBER="10-12",
PAGES="597-600",
YEAR=1980,
KEYWORDS="Approximation; GI/GI/N",
}

@ARTICLE{Bund80:G,
AUTHOR="B. D. Bunday and R. E. Scraton",
TITLE="The G/M/r Machine Interference Model",
JOURNAL=ejor,
VOLUME=4,
NUMBER="399-402",
YEAR=1980,
KEYWORDS="Palm machine repair; machine-repair-man model",
ABSTRACT="This paper solves the machine interference problem in which N
automatic machines are maintained by a team of operatives.  Repair times
are assumed to follow a negative exponential distribution, and running
times for each of the machines are assumed to be independently and
identically distributed.  It is shown that the solution to this G/M/r
model is identical in most important respects to that for the",
}

@ARTICLE{Chun80:Switching,
AUTHOR="F. R. K. Chung",
TITLE="On Switching Networks and Block Design, {II}",
JOURNAL=bstj,
VOLUME=59,
NUMBER=7,
PAGES="1165-1173",
YEAR=1980,
KEYWORDS="Switching Network; Design",
}

@ARTICLE{Cohe80:Sensitivity,
AUTHOR="J. W. Cohen",
TITLE="Sensitivity and Insensitivity",
JOURNAL="Delft Progress Report",
VOLUME=5,
NUMBER=3,
PAGES="159-173",
NOTE="Papers of Symposium ``Traffic and Control'' dedicated to the
scientific Work of Prof. Dr. Ir. L. Kosten",
YEAR=1980,
KEYWORDS="Erlang B formula; loss system; engset formula; network;
processor sharing; grading; sensitivity analysis; product form;
insensitivity",
ABSTRACT="In the late thirties, early forties the insensitivity of the
stationary state probabilities for the classical Erlang and for the
Engset model was discussed by Vaulot, Palm and Kosten.  This phenomenon,
rediscovered several times, has attracted much attention in the last ten
years.  Particularly in the analysis of data processing networks.",
}

@ARTICLE{Cont80:Effects,
AUTHOR="R. Conte",
TITLE="Effects of Scanning Interval on Peak Load Measurements",
JOURNAL=bstj,
VOLUME=59,
NUMBER=8,
PAGES="1513-1524",
YEAR=1980,
KEYWORDS="Load Measurement",
}

@ARTICLE{Cosm80:Approximations,
AUTHOR="G. P. Cosmetatos and S. A. Godsave",
TITLE="Approximations in the Multi-Server Queue with Hyper-Exponential
Inter-arrival Times and Exponential Service times",
JOURNAL=jors,
VOLUME=31,
NUMBER=1,
PAGES="57-62",
YEAR=1980,
KEYWORDS="Approximation; H2/M/N",
}

@ARTICLE{Daws80:Traffic,
AUTHOR="W. Dawson and P. J. Burville",
TITLE="Traffic Measurement Installations for Collecting Data for
Long-Term Traffic Studies",
JOURNAL=poeej,
VOLUME=73,
PAGES="119-122",
YEAR=1980,
KEYWORDS="Traffic Measurement",
}

@ARTICLE{Debi8003:Comparison,
AUTHOR="J. L. Debiesse and G. Matignon",
TITLE="Comparison of Different Methods for the Calculation of Traffic
matrices",
JOURNAL=atele,
ADDRESS="France",
VOLUME=35,
NUMBER="3-4",
PAGES="91-102",
YEAR=1980,
KEYWORDS="Traffic matrix; traffic theory; matrix; linear programming;
optimization; extrapolation; positive matrix; quadratic programming",
ABSTRACT="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 aportionment is also given",
}

@ARTICLE{Deul80:Stationarity,
AUTHOR="N. Deul",
TITLE="Stationarity Conditions for Multi-Server Queueing Systems with
Repeated Calls",
JOURNAL=eik,
VOLUME=16,
NUMBER="10--12",
PAGES="607-613",
YEAR=1980,
KEYWORDS="Call reattempt; multiserver; queueing system",
}

@TECHREPORT{Eden80:Optimale,
AUTHOR="B. N. Eden and D. Dreyer and B. Jung and R. Kreutzer and G.
Mrozynski",
TITLE="Optimale Entwicklungsplanung von Nachrichtensystemen mit
zentraler Vermittlung",
INSTITUTION="Heinrich Hertz Institut für Nachrichtentechnik",
ADDRESS="Berlin, Germany",
PAGES=95,
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Switching; planning",
}

@ARTICLE{Faki80:Blocking,
AUTHOR="D. Fakinos",
TITLE="The M/G/k Blocking System with Heterogeneous Servers",
JOURNAL=jors,
VOLUME=31,
PAGES="919-927",
YEAR=1980,
KEYWORDS="Erlang B formula",
}

@ARTICLE{Fisc80:Priority,
AUTHOR="M. J. Fischer",
TITLE="Priority Loss Systems - Unequal Holding Times",
JOURNAL="AIIE Transactions",
VOLUME=12,
NUMBER=1,
PAGES="47-53",
YEAR=1980,
KEYWORDS="Loss system; Priority; Service Time",
}

@ARTICLE{Garc80:OFELIE,
AUTHOR="R. Garcia and K.-D. Hackbarth",
TITLE="{OFELIE} - Eine Methode zur Langfristigen Planung von
Fernmeldenetzen",
JOURNAL=ors,
ADDRESS="Germany",
VOLUME=2,
PAGES="47-58",
YEAR=1980,
LANGUAGE="German",
KEYWORDS="network planning",
}

@ARTICLE{Goel80:Software,
AUTHOR="A. L. Goel",
TITLE="Software Error Detection Model with Applications",
JOURNAL="The Journal of Systems and Software",
VOLUME=1,
PAGES="243-249",
YEAR=1980,
KEYWORDS="Software engineering; modeling",
ABSTRACT="This paper deals with the modeling of software errors
encountered in a small and a large software system.  A deterministic
analysis of software failure process is presented to obtain an
appropriate mean value function for a nonhomogeneous Poisson process.
Several quantitative measures for software quality assessment are also
proposed.  Statistical techniques of inference about unknown parameters
are discussed and determined",
}

@ARTICLE{Harv80:Determining,
AUTHOR="C. Harvey",
TITLE="Determining the End-to-End Grade of Service in a Network - Some
New Results",
JOURNAL=poeej,
VOLUME=73,
PAGES="109-114",
YEAR=1980,
KEYWORDS="Communication network; end-to-end delay; QOS",
}

@INPROCEEDINGS{Haug80:Trafikkorienterte,
AUTHOR="J. Haugland and T. Frydenberg",
TITLE="Trafikkorienterte Driftssikkerhetsnormer",
BOOKTITLE="NTS-3",
ADDRESS="Stockholm, Sweden",
PAGES=23,
YEAR=1980,
LANGUAGE="Swedish",
}

@ARTICLE{Heid80:Variance,
AUTHOR="P. Heidelberger",
TITLE="Variance Reduction Techniques for the Simulation of Markov
Processes, {I:} Multiple Estimates",
JOURNAL=ibmjrd,
VOLUME=24,
NUMBER=5,
PAGES="570-581",
YEAR=1980,
KEYWORDS="Simulation; Simulation Method; Markov Process",
}

@ARTICLE{Heym80:Comments,
AUTHOR="D. P. Heyman",
TITLE="Comments on a Queueing Inequality",
JOURNAL=ms,
VOLUME=26,
NUMBER=9,
PAGES="956-959",
YEAR=1980,
KEYWORDS="queueing system; multiserver; inequality",
}

@ARTICLE{Hopm80:Regression,
AUTHOR="A. C. M. Hopmans and J. P. Kleijnen",
TITLE="Regression Estimation in Simulation",
JOURNAL=jors,
VOLUME=31,
PAGES="1033-1038",
YEAR=1980,
KEYWORDS="Simulation; time series analysis",
}

@ARTICLE{Jens8002:Yesterday,
AUTHOR="A. Jensen",
TITLE="Yesterday's Trouble Today's Response Tomorrows Theory",
JOURNAL="Delft Progress Report",
ADDRESS="Delft, Netherlands",
VOLUME=5,
NUMBER=2,
PAGES="185-195",
NOTE="Papers presented to the Symposium ``Traffic and Control''
dedicated to the Scientific Work of Prof. Dr. Ir. L. Kosten",
YEAR=1980,
KEYWORDS="Traffic engineering",
}

@ARTICLE{Klib8001:Quality,
AUTHOR="A. B. Klibaner and N. V. Pevtsov",
TITLE="The Quality of Servicing Automatic Intercity Telephone
Communications",
JOURNAL="Telecommunications and Radio Engineering",
ADDRESS="SU",
VOLUME=34,
NUMBER=1,
PAGES="43-46",
YEAR=1980,
KEYWORDS="Telephony; QOS",
}

@INPROCEEDINGS{Knut80:När,
AUTHOR="A. Knutsson",
TITLE="När är de Nordiska Näten Mogna för Network Management?",
BOOKTITLE="NTS-3",
ADDRESS="Stockholm, Sweden",
PAGES=2,
YEAR=1980,
LANGUAGE="Swedish",
}

@ARTICLE{Kost80:Approximate,
AUTHOR="L. Kosten",
TITLE="Approximate Determination of Congestion Quantities by Equivalent
Traffic methods",
JOURNAL="Delft Progress Report, Mathematics and mathematical
Engineering",
VOLUME=5,
PAGES="227-252",
YEAR=1980,
KEYWORDS="overflow",
}

@INPROCEEDINGS{Law80:Tutorial,
AUTHOR="A. M. Law",
TITLE="A Tutorial on Statistical Analysis of Simulation Output Data",
BOOKTITLE="Winter Simulation Conference. T.I. Ören, C.M. Shub, P.F. Roth
(editors)",
PAGES="361-370",
YEAR=1980,
KEYWORDS="Simulation; output analysis",
}

@ARTICLE{Lee80:Correlation,
AUTHOR="P. A. Lee",
TITLE="Correlation Structure of Teletraffic Measurements from
Randomly-Scanned Calls Arrival Data",
JOURNAL=jap,
VOLUME=17,
PAGES="203-217",
YEAR=1980,
KEYWORDS="Traffic measurement; time series analysis",
ABSTRACT="VBI-000801. Scanning principle; Ref. vbi Iversen; Inter
arrival times",
}

@ARTICLE{LeGa8003:Nouvelles,
AUTHOR="P. Le Gall",
TITLE="Nouvelles études sur le trafic téléphonique à appels perdus.
Further Studies on Lost Call Telephone Traffic",
JOURNAL=atele,
ADDRESS="France",
VOLUME=35,
NUMBER="3-4",
PAGES="103-112",
YEAR=1980,
LANGUAGE="French",
KEYWORDS="traffic theory; telephony; stochastic process; overflow;
mathematical model",
ABSTRACT="The author considers the stochastic process representing the
flow of traffic in a full availability group of telephone circuits, in
the case of the lost call model. Recently obtained results in the case
of the most general assumptions regarding the arrival process and the
distribution of service times are briefly recalled, in order to present
a new method. With the same degree of generality, this method is applied
to the",
}

@TECHREPORT{Leht80:Automatic,
AUTHOR="P. Lehtinen",
TITLE="An Automatic Adaptive Counter Method for the Detection of Faulty
Equipment with Abnormal Holding Times",
INSTITUTION="Research Institute of the Helsinki Telephone Company",
ADDRESS="Helsinki, Finland",
NUMBER=93,
PAGES=8,
YEAR=1980,
KEYWORDS="Junction network; reliability",
ABSTRACT="Killer trunks",
}

@TECHREPORT{Leht80:Mathematical,
AUTHOR="P. Lehtinen",
TITLE="A Mathematical Model for the Supervision of Stochastic Traffic
Networks",
INSTITUTION="Research Institute of the Helsinki Telephone Company",
PAGES=20,
YEAR=1980,
KEYWORDS="fault",
ABSTRACT="Faulty trunks",
}

@TECHREPORT{Leht80:Estimation,
AUTHOR="P. Lehtinen",
TITLE="Estimation of a Traffic Distribution Matrix by Means of a
Transfer Function Model",
INSTITUTION="Research Institute of the Helsinki Telephone Company",
ADDRESS="Helsinki, Finland",
NUMBER=95,
PAGES=11,
YEAR=1980,
KEYWORDS="Network planning",
}

@TECHREPORT{Leht80:Network,
AUTHOR="P. Lehtinen",
TITLE="Network flow Model of a Communication Network for Optimal
Planning",
INSTITUTION="Research Institute of the Helsinki Telephone Company",
ADDRESS="Helsinki, Finland",
NUMBER=94,
PAGES=32,
YEAR=1980,
KEYWORDS="Network planning",
}

@TECHREPORT{Leht80:Software,
AUTHOR="P. Lehtinen and H. Huotari",
TITLE="The Software Implementation of a Daily Peak Hour Traffic
Measurement and control Procedure in the {AUTRAX} System",
INSTITUTION="Research Institute of the Helsinki Telephone Company",
ADDRESS="Helsinki, Finland",
NUMBER=92,
PAGES=125,
YEAR=1980,
KEYWORDS="Traffic measurement",
}

@ARTICLE{LeNy8004:Étude,
AUTHOR="L. M. Le Ny",
TITLE="Étude Analytique de Réseaux de Files d'Attente Multiclasses a
Routages Variables",
JOURNAL=rairo,
ADDRESS="France",
VOLUME=14,
NUMBER=4,
PAGES="331-347",
YEAR=1980,
LANGUAGE="French",
KEYWORDS="Packet switching",
}

@INPROCEEDINGS{Lepp80:Satellite,
AUTHOR="R. Leppänen and K. Rahko",
TITLE="On-Board Satellite Switching and its Use in Worldwide Alternative
routing Network",
BOOKTITLE="NTS-3, Tredie Nordiske Teletrafik Seminar",
ADDRESS="Stockholm, Sweden",
PAGES=9,
YEAR=1980,
KEYWORDS="Satellite radio",
}

@ARTICLE{Levy80:Derivation,
AUTHOR="D. Levy and A. Alexandrovitz",
TITLE="Derivation of First-Passage Time Distribution of a single Lift
for Arbitrary Traffic",
JOURNAL="International Journal for Numerical Methods in Engineering",
VOLUME=15,
PAGES="1-11 (paper 41)",
YEAR=1980,
KEYWORDS="Stochastic system",
ABSTRACT="Lift",
}

@INPROCEEDINGS{Lewi80:Chapter,
AUTHOR="Pierre Lewis",
TITLE="Chapter G of the {IMSL} Library - Generation and Testing of
Random Variates: {SIMULATION}",
BOOKTITLE="Winter Simulation Conference. T.I. Ören, C.M. Shub, P.F. Roth
(editors). IEEE 1980",
PAGES="357-360",
YEAR=1980,
KEYWORDS="RNG; simulation",
}

@ARTICLE{Lips8004:Study,
AUTHOR="L. Lipsky",
TITLE="A Study of Time Sharing Systems Considered as Queueing Networks
of Exponential Servers",
JOURNAL="The Computer Journal",
VOLUME=23,
NUMBER=4,
PAGES="290-297",
YEAR=1980,
KEYWORDS="Queueing network",
}

@ARTICLE{Lise8008:Qualitative,
AUTHOR="B. Lisek and M. Lisek",
TITLE="On Qualitative Properties of Inventory Models with Discrete
Demand",
JOURNAL=eik,
ADDRESS="Soviet Union",
VOLUME=16,
NUMBER="8-9",
PAGES="425-431",
YEAR=1980,
KEYWORDS="Queueing system",
}

@ARTICLE{Liu8003:Direct,
AUTHOR="Ke Liu",
TITLE="Direct Distance Dialling: Call Completion and Customer Retrial
Behaviour",
JOURNAL=bstj,
VOLUME=59,
NUMBER=3,
PAGES="295-311",
YEAR=1980,
KEYWORDS="Traffic source model; busy; retry; no answer; reliability;
telephone; customer behavior",
ABSTRACT="Most customers placing a direct-distance-dialing (DDD) call in
the United States are able to complete the call on the first attempt.
However, it is reasonable to expect that the probability of an initial
completion will be less than 1. When an initial attempt fails to
complete, a customer may decide to abandon his desired telephone
connection or to make one or more retrials. In general, a sequence of
one or more attempts may be initiated by a customer in an effort to
establish the desired connection. A study of DDD call completion and
retrials is important to provide an overall characterization of network
performance and customer behavior in setting up customers' desired
telephone connections. A survey adopting a two-stage stratified sampling
plan was undertaken to obtain DDD retrial statistics. Data associated
with sampled DDD calls that were originated from one of 890 switching
entities in the Bell System network were collected for a period of one
week. The basic DDD retrial results reported here are initial call
attempt disposition probabilities, retrial probabilities, number of
additional attempts, ultimate success probabilities, and distribution
functions for retrial intervals following different types of incomplete
initial attempts. Results of subclass analyses of retrial statistics by
originating and terminating classes of service (residence and business)
are also presented. Results in this study are useful in many network
planning applications. An application of significant importance is
provision of a tool to evaluate the revenue and cost impact of call
completion improvement programs. A technique to analyze the revenue and
cost impact is outlined in the paper.",
}

@TECHREPORT{Lþken80:Aksesstrategi,
AUTHOR="B. Lþken",
TITLE="Aksesstrategi og Kanalutnyttelse i Nordisk Mobiltelefon",
INSTITUTION="Televerkets Forskningsinstitut",
ADDRESS="Kjeller, Norway",
NUMBER="1/80",
PAGES=52,
YEAR=1980,
LANGUAGE="Norwegian",
KEYWORDS="mobile radio; cellular system",
ABSTRACT="NMT; TF",
}

@ARTICLE{Luss80:Model,
AUTHOR="H. Luss",
TITLE="A Model for Advanced Reservations for Large Scale Conferencing
Services",
JOURNAL=jors,
VOLUME=31,
PAGES="239-245",
YEAR=1980,
KEYWORDS="reservation",
}

@TECHREPORT{Mamr80:Sizing,
AUTHOR="S. A. Mamrak",
TITLE="Sizing Distributed Systems: Overview and Recommendations",
INSTITUTION="NBS special Publication",
NUMBER="500-60",
PAGES=16,
YEAR=1980,
KEYWORDS="Distributed system",
}

@ARTICLE{Mino8006:Sizing,
AUTHOR="Daniel Minoli",
TITLE="Sizing Trunk Bundles Which Can Be Seized at Both Ends with
Different Grade of Service",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=6,
PAGES="794-801",
YEAR=1980,
KEYWORDS="Junction network; GOS; two-way; both-way",
ABSTRACT="In this paper, a technique is established and prepared tables
are furnished for the sizing of trunk bundles which can be seized at
both ends, but where different grade of service must be rendered at each
end.  An approximate approach is also discussed.  These solutions find
applications in the engineering of foreign exchange voice systems
serving a customer base (low blocking) and interdeparmental communi",
}

@ARTICLE{Nare8005:Behaviour,
AUTHOR="K. S. Narendra and M. A. L. Thathachar",
TITLE="On the Behaviour of a Learning Automaton in a changing
Environment with Application to Telephone Traffic Routing",
JOURNAL=ieeesmc,
VOLUME="SMC-10",
NUMBER=5,
PAGES="262-269",
YEAR=1980,
KEYWORDS="Telephony; routing; network optimization",
}

@ARTICLE{Niu80:Single,
AUTHOR="S.-C. Niu",
TITLE="A Single Server Queueing Loss Model with Heterogeneous Arrival
and Service",
JOURNAL=or,
VOLUME=28,
NUMBER=3,
PAGES="584-593",
YEAR=1980,
KEYWORDS="Erlang B formula",
}

@ARTICLE{ONei8001:Statistics,
AUTHOR="P. O'Neill and A. O'Neill",
TITLE="Performance Statistics of a Time Sharing Network at a Small
University",
JOURNAL=cacm,
VOLUME=23,
NUMBER=1,
PAGES="10-13",
YEAR=1980,
KEYWORDS="Computer network; traffic measurement",
}

@ARTICLE{Okum80:Optimum,
AUTHOR="K. Okumoto and A. L. Goel",
TITLE="Optimum Release Time for Software Systems Based on Reliability
and Cost Criteria",
JOURNAL="The Journal of System and Software",
VOLUME=1,
PAGES="315-318",
YEAR=1980,
KEYWORDS="Software engineering; reliability",
ABSTRACT="The problem of determining the optimum time when testing can
stop and the system can be considered ready for operational use is
considered.  This decision, of course, depends on the model for the
software failure phenomenon and the criterion used for evaluating system
readiness.  With the time dependent error detection rate model of Goel
and Okumoto, two criteria are investigated:  software reliability and
total expected",
}

@ARTICLE{Ovuw80:Multi,
AUTHOR="G. C. Ovuworie",
TITLE="Multi-channel Queues: a Survey and Bibliography",
JOURNAL="International Statistical Review",
VOLUME=48,
PAGES="49-71",
YEAR=1980,
KEYWORDS="Queueing system; multiserver; survey; bibliography",
}

@ARTICLE{Pana80:Solving,
AUTHOR="J. C. Panayiotopoulos",
TITLE="Solving Queueing Systems with Increasing Priority Numbers",
JOURNAL=jors,
VOLUME=31,
PAGES="637-646",
YEAR=1980,
KEYWORDS="Queueing system",
}

@ARTICLE{Parv8012:Autrax,
AUTHOR="A. Parviala",
TITLE="The Autrax System as Part of the Helsinki Telephone Company's
Traffic Control Routines",
JOURNAL="SSähkö Electricity in Finland",
ADDRESS="Finland",
VOLUME=53,
NUMBER=12,
PAGES="375-379",
YEAR=1980,
KEYWORDS="Traffic control",
}

@ARTICLE{Pujo8004:Réseaux,
AUTHOR="Pujolle, G. Les",
TITLE="Réseaux de Files d'Attente a Forme Produit",
JOURNAL=rairo,
VOLUME=14,
NUMBER=4,
PAGES="317-330",
YEAR=1980,
LANGUAGE="French",
KEYWORDS="Product form",
}

@TECHREPORT{Rahk80:Service,
AUTHOR="K. Rahko",
TITLE="Service Quality in the International Telephone Network: New
Dimensioning Methods for Traffic Routes",
INSTITUTION="Helsinki University of Technology, Telecommunication
Laboratory",
ADDRESS="Helsinki, Finland",
NUMBER="5/80",
PAGES=46,
YEAR=1980,
KEYWORDS="Network planning; QOS",
}

@ARTICLE{Rama80:Digital,
AUTHOR="S. Ramakrishnan and N. T. Taskar",
TITLE="Introduction of Digital Switching \& Transmission Techniques in
the Indian Telecommunication Network",
JOURNAL="Udleveret til Networks I",
ADDRESS="Paris, France",
PAGES=10,
YEAR=1980,
KEYWORDS="Communication network",
}

@BOOK{Rous80:Queueing,
AUTHOR="W. B. Rouse",
TITLE="Queueing Theory",
PUBLISHER="Systems Eng. Models of Human-Machine Interaction. Chap. 4:
Queueing Theory. North-Holland Publishing Co",
ADDRESS="Netherlands",
PAGES="60-86",
YEAR=1980,
KEYWORDS="Queueing theory",
}

@ARTICLE{Sand80:Comments,
AUTHOR="B. Sanders",
TITLE={Comments on "Calculation of Some Functions Arising in Problems of
Queueing and Communications Traffic"},
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=6,
PAGES="906-908",
YEAR=1980,
KEYWORDS="numerical method",
}

@ARTICLE{Saps80:Measurement,
AUTHOR="B. G. Sapsford",
TITLE="Measurement and Analysis Centres: Operational Activities and
Achievements",
JOURNAL=poeej,
VOLUME=73,
PAGES="43-46",
YEAR=1980,
KEYWORDS="traffic measurement",
}

@INPROCEEDINGS{Schm80:Fundamentals,
AUTHOR="J. W. Schmidt",
TITLE="Fundamentals of Digital Simulation Modelling",
BOOKTITLE="Winter Simulation Conference, T.I. Ören, C.M. Shub, P.F. Roth
(editors). IEEE 1980",
PAGES="315-323",
YEAR=1980,
KEYWORDS="Simulation method",
}

@ARTICLE{Schn8001:Algorithm,
AUTHOR="K. S. Schneider and Daniel Minoli",
TITLE="An Algorithm for Computing Average Loss Probability in a
Circuit-Switched Communication Network",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=1,
PAGES="27-33",
YEAR=1980,
KEYWORDS="Circuit switching; loss probability",
}

@ARTICLE{Shan8006:Approximations,
AUTHOR="J. G. Shanthikumar and J. A. Buzacott",
TITLE="On the Approximations to the Single Server Queue",
JOURNAL=ijpr,
VOLUME=18,
NUMBER=6,
PAGES="761-773",
YEAR=1980,
KEYWORDS="Queueing system; single server; approximation",
}

@ARTICLE{Shne8001:Several,
AUTHOR="M. Shneps-Shneppe",
TITLE="Several Problems Involved in the Control of a Telephone Network",
JOURNAL="Telecommunications and Radio Engineering",
ADDRESS="SU",
VOLUME=34,
NUMBER=1,
PAGES="12-16",
YEAR=1980,
KEYWORDS="Traffic engineering; call reattempt",
ABSTRACT="A method for the approximate calculation of telephone network
parameters is presented taking into account repeated attempts by a
subscriber to establish a connection.  The presence of a maximum on the
load curve of the called subscriber is explained.  It is suggested that
that this maximum should be used to select toll rates, as the basis for
standards of the quality of service and for operational confidence",
}

@ARTICLE{Skou80:Systemmandens,
AUTHOR="T. F. Skousen",
TITLE="Systemmandens Rolle i 80'erne",
JOURNAL="DATA",
ADDRESS="Denmark",
NUMBER="1/2",
PAGES="37-40",
YEAR=1980,
LANGUAGE="Danish",
}

@ARTICLE{Sobe80:Simple,
AUTHOR="M. J. Sobel",
TITLE="Simple Inequalities for Multiserver Queues",
JOURNAL=ms,
VOLUME=26,
NUMBER=9,
PAGES="951-956",
YEAR=1980,
KEYWORDS="queueing system; multiserver; inequality",
ABSTRACT="Sinple inequalities are obtained for some operating
characteristics of multiserver queueing models. Loss system and Delay
system results are presented.",
}

@ARTICLE{Stre8008:Generalization,
AUTHOR="A. Streller",
TITLE="A Generalization of Cumulative Processes",
JOURNAL=eik,
ADDRESS="Soviet Union",
VOLUME=16,
NUMBER="8-9",
PAGES="449-460",
YEAR=1980,
KEYWORDS="Queueing theory",
}

@ARTICLE{Svob8001:Problems,
AUTHOR="Liba. Svobodova",
TITLE="Performance Problems in Distributed Systems",
JOURNAL=infor,
ADDRESS="Canada",
VOLUME=18,
NUMBER=1,
PAGES="21-40",
YEAR=1980,
KEYWORDS="Distributed system",
}

@ARTICLE{Triv8004:Model,
AUTHOR="K. S. Trivedi and R. E. Kinicki",
TITLE="A Model for Computer Configuration Design",
JOURNAL=ieeecomp,
VOLUME=13,
NUMBER=4,
PAGES="47-54",
YEAR=1980,
KEYWORDS="Computer system",
ABSTRACT="The lagrange multiplier method unravels the configuration
design problem. It guarantees a global solution that optimizes device
speeds and main memory size.",
}

@ARTICLE{Poel80:Early,
AUTHOR="W. van der Poel",
TITLE="The Early History of Computing at {PTT}",
JOURNAL="Delft Progress Report",
VOLUME=5,
NUMBER=3,
PAGES="174-184",
NOTE="Papers presented to the Symposium 'Traffic and Control' dedicated
to the scientific work of Prof. Ir. L.  Kosten",
YEAR=1980,
KEYWORDS="simulation",
}

@INPROCEEDINGS{Wall80:Queue,
AUTHOR="B. Wallström",
TITLE="On the {M/G/1} Queue with Several Classes of Customers Having
Different Service Time Distributions",
BOOKTITLE="NTS-3",
ADDRESS="Stockholm, Sweden",
PAGES=19,
YEAR=1980,
KEYWORDS="M/g/1",
}

@ARTICLE{Webe80:Marginal,
AUTHOR="R. A. Weber",
TITLE="On the Marginal Benefits of Adding Servers to {GI/GI/m} Queues",
JOURNAL=ms,
VOLUME=26,
NUMBER=9,
PAGES="946-950",
YEAR=1980,
KEYWORDS="queueing system; multiserver; design",
ABSTRACT="Design of queues",
}

@ARTICLE{Whit8004:Continuity,
AUTHOR="W. Whitt",
TITLE="Continuity of Generalized Semi-Markov Processes",
JOURNAL=mor,
VOLUME=5,
NUMBER=4,
PAGES="494-501",
YEAR=1980,
KEYWORDS="Semi Markov process",
}

@ARTICLE{Wika8010:Algorithm,
AUTHOR="D. Wikarski",
TITLE="An Algorithm for the Solution of Linear Equation Systems with
Block Structure",
JOURNAL=eik,
ADDRESS="Soviet Union",
VOLUME=16,
NUMBER="10-12",
PAGES="615-620",
YEAR=1980,
KEYWORDS="Mathematics",
}

@ARTICLE{Zeli80:Optimization,
AUTHOR="A. M. Zelinskiy and A. Y. Markovich and M. N. Pisker",
TITLE="Optimization of the Strategy for Servicing Calls in Switching
Systems Taking into Consideration the Vulnerability of the Equipment to
Failures",
JOURNAL="Telecommunications and Radio Engineering",
VOLUME=34,
NUMBER=3,
PAGES="16-20",
YEAR=1980,
KEYWORDS="reliability",
}

@ARTICLE{Jaco8001:Teletrafikteori,
AUTHOR="C. Jacobaeus",
TITLE="Teletrafikteori ocd dess praktiska tillämpningar",
JOURNAL=ericssonr,
ADDRESS="Stockholm, Sweden",
NUMBER=1,
PAGES="8-15",
YEAR=1980,
LANGUAGE="Swedish",
}

@BOOK{Peeb80:Probability,
AUTHOR="P. Z. Peebles",
TITLE="Probability, Random Variables, and Random Signal Prinziples",
ISBN="0-07-049180-1",
PUBLISHER="McGraw-Hill Book Company",
ADDRESS="New York",
PAGES=267,
YEAR=1980,
REFERENCES=30,
KEYWORDS="Probability theory; random process",
ABSTRACT="Probability; Random Variables; Operations on One Random
Variable-Expectation; Multiple Random Variables; Operations on Multiple
Random Variables; Random Processes; Spectral Characteristics of Random
Processes; Linear Systems with Random Inputs; Optimum Linear Systems",
}

@ARTICLE{Ting80:Digital,
AUTHOR="Dennis Ting and Birendra Prasada",
TITLE="Digital processing techniques for encoding of graphics",
JOURNAL=ieeeproc,
VOLUME=68,
NUMBER=7,
PAGES="757-769",
YEAR=1980,
REFERENCES=28,
KEYWORDS="Method; graphics; coding theory; simulation model",
ANNOTE="This paper deals with two classes of preprocessing techniques
for documents which are essentially black and white. These are bilevel
quantization and preprocessing techniques for noisy input documents. The
effect of such techniques on the compression ratio and the subjective
quality of the output copy are studied. It is shown that for noisy
documents, certain preprocessing techniques considerably improve the
compression ratio. The improvement",
}

@ARTICLE{Yiu80:Simple,
AUTHOR="K. P. Yiu",
TITLE="A simple method for the determination of feedback shift register
connections for delayed maximal-length sequences",
JOURNAL=ieeeproc,
VOLUME=68,
PAGES="537-538",
YEAR=1980,
REFERENCES=6,
KEYWORDS="Shift register sequences",
ANNOTE="A fast and simple method for computing the feedback shift
register connections of a delayed maximal-length sequence is present ed.
The method is to utilize the modified recurrence relationships
repeatedly. This method can be easily programmed on a computer or
permits hand computation.",
}

@ARTICLE{Zade80:Fuzzy,
AUTHOR="L A Zadeh",
TITLE="Fuzzy sets versus probability",
JOURNAL=ieeeproc,
VOLUME=68,
PAGES=421,
YEAR=1980,
REFERENCES=8,
KEYWORDS="Fundamentals in statistics; fuzzy statistics; probability",
ANNOTE="Short remarks on the idea of fuzzy sets.",
}

@ARTICLE{Bods80:Compression,
AUTHOR="Dennis Bodson and Richard. Schaphorst",
TITLE="Compression and error sensitivity of two-dimensional facsimile
coding techniques",
JOURNAL=ieeeproc,
VOLUME=68,
NUMBER=7,
PAGES="846-853",
YEAR=1980,
REFERENCES=18,
KEYWORDS="Graphics; filter theory; runtime/storage efficiency;
bibliography; research problem; coding theory; error classification",
ANNOTE="Seven proposals were submitted to the international telegraph
and telephone consultative committee (CCITT) for selection of a standard
two-dimensional code as an extension of the current ccitt standard
one-dimensional code. The ccitt specified the use of particular
parameters and procedures to compare the candidate techniques on a
quantitative basis. The compression ratio and error sensitivity of all
seven coding techniques were measured for a",
}

@ARTICLE{Brit80:Pole,
AUTHOR="J. N. Brittingham and Eric Miller and J. L. Willows",
TITLE="Pole extraction from real-frequency information",
JOURNAL=ieeeproc,
VOLUME=68,
PAGES="263-273",
YEAR=1980,
REFERENCES=24,
KEYWORDS="Laplace transform; approximation; method; spectral analysis;
ignal detection; Prony's method; poles",
ANNOTE="This paper describes a procedure, analogous to Prony's method,
for extracting the complex-frequency poles of electromagnetic transfer
functions. The paper explains a multiple processing technique, involving
the overlaying of several pole sets, by which redundant data are used to
separate actual from curve-fitting poles.",
}

@ARTICLE{Buze80:Operational,
AUTHOR="J. P. Buzen and P. J. Denning",
TITLE="Operational treatment of queue distributions and mean-value
analysis",
JOURNAL=compperf,
VOLUME=1,
NUMBER=1,
PAGES="6-15",
YEAR=1980,
REFERENCES=23,
KEYWORDS="queue length; queueing network; operational analysis",
ANNOTE="Relationships among the queue-length distributions seen by an
arriving job, a completing job and an outside observer are derived using
operational analysis. A simplified derivation of the sevcik-mitrani
theorem is presented and used as the basis for disc ussing reiser and
lavenberg's mean-value analysis. Two results are presented: an algorithm
for computing queue-length distributions from conditional throughputs in
closed, product-form queuein",
}

@ARTICLE{Denn80:Learning,
AUTHOR="P. J. Denning",
TITLE="On learning how to predict",
JOURNAL=ieeeproc,
VOLUME=68,
NUMBER=9,
PAGES="1099-1103",
YEAR=1980,
REFERENCES=36,
KEYWORDS="Performance evaluation; model; queueing system; operating
system; memory management; queueing network; decomposition",
ANNOTE="To meet performance guarantees, we should consider building
computer systems more like queueing models we do understand, rather than
trying to build complex queueing models of systems we do not understand.
This approach is already familiar to software en gineers, who use models
to constrain software development so that the results are more reliable
and understandable. Four real examples illustrate how a performance
model can guide a system's d",
}

@ARTICLE{Foxl80:Technique,
AUTHOR="E. Foxley and M. S. Ali",
TITLE="Technique for generation of simulated workload",
JOURNAL=compperf,
VOLUME=1,
NUMBER=1,
PAGES="37-40",
YEAR=1980,
REFERENCES=6,
KEYWORDS="Performance evaluation; simulation; simulation model;
multiprogramming; carried traffic; workload",
ANNOTE="The pattern of workload of jobs in a multiprogramming computer
environment plays a key role in the achievement of the performa nce
goals for that system. In order to access performance, whether by
modelling, simulation, or synthetic or real benchmarking, it is
necessary to build a model of the expected work-load. A simple method is
discussed that represents the real workload of a computer system more
accurately than any other known method.",
}

@ARTICLE{Hohn80:Control,
AUTHOR="W. C. Hohn",
TITLE="The Control Data loosely coupled network lower level protocols",
JOURNAL=afips,
VOLUME=49,
PAGES="129-134",
YEAR=1980,
KEYWORDS="Communication protocol; loosely coupled system; low level
protocol",
ANNOTE="Using a hierarchical model of network protocols, this paper
attempts to explain the lower three protocol levels (i.e., the network
level) used with Control Data Corporation's loosely coupled network
(LCN) communication interface devices, known as network access devices
(NADs). While an appearance in the open literature of information on nad
is overdue, this paper raises as many questions about LCNs and NADs as
it answers.",
}

@ARTICLE{Kunt80:Block,
AUTHOR="Murat Kunt and O. Johnsen",
TITLE="Block coding of graphics: a tutorial review",
JOURNAL=ieeeproc,
VOLUME=68,
NUMBER=7,
PAGES="770-786",
YEAR=1980,
REFERENCES=27,
KEYWORDS="graphics; coding theory; model; runtime/storage efficiency;
research problem; bibliography; optimization",
ANNOTE="This paper gives a review of block coding for picture data
compression. Block coding has been devised primarily for coding of
graphics, but it has subsequently been extended to multilevel pictures.
All the proposed codes are simple suboptimum prefix codes. Their
simplicity make them suitable for real-time applications . Although
blocks can be of any shape, higher efficiencies are obtained with
two-dimensional blocks, thus exploiting the inhere",
}

@ARTICLE{Mour80:Concerning,
AUTHOR="J. A. Moura and J. A. Field",
TITLE="Concerning mean packet delay as a performance measure in single
channel networks",
JOURNAL=ieeeproc,
VOLUME=68,
NUMBER=8,
PAGES="1022-1024",
YEAR=1980,
REFERENCES=2,
KEYWORDS="packet switching; message switching; time in system",
ANNOTE="It is shown that, under certain conditions, it is possible to
have mean packet delay greater than mean message delay in single channel
networks. The analysis includes overheads and transmission interference.
It is shown further that for exponential message lengths, under the same
assumptions, mean packet delay is always greater than mean message
delay.",
}

@ARTICLE{Requ80:Zeros,
AUTHOR="A. A. G. Requicha",
TITLE="The zeros of entire functions: theory and engineering
applications",
JOURNAL=ieeeproc,
VOLUME=68,
PAGES="308-328",
YEAR=1980,
REFERENCES=77,
KEYWORDS="Function theory; Taylor expansion; survey",
ANNOTE="Functions that are analytic over a complex plane are called
entire functions. They may be viewed as generalizations of polynomials
because they admit power series expansions that converge everywhere.
This paper provides a tutorial introduction to relevant aspects of the
theory of entire functions of a single complex variable, and also a
discussion of exemplary applications. The paper deals specifically with
a class of entire functions",
}

@ARTICLE{Royt80:Expression,
AUTHOR="L. M. Roytman and M. N. S. Swamy",
TITLE="An expression for the Jacobian of the roots of a polynomial",
JOURNAL=ieeeproc,
VOLUME=68,
NUMBER=6,
PAGES="737-738",
YEAR=1980,
REFERENCES=5,
KEYWORDS="Algorithm; polynomial; poles",
ANNOTE="An expression for the Jacobian of the roots of a polynomial is
first established and its usefulness in determining the displacements of
poles or zeros of a linear system is shown. An example of a digital
filter is considered.",
}

@ARTICLE{Sarw80:Crosscorrelation,
AUTHOR="Dilip Sarwate and M. B. Pursley",
TITLE="Crosscorrelation properties of pseudorandom and related
sequences",
JOURNAL=ieeeproc,
VOLUME=68,
PAGES="593-619",
YEAR=1980,
REFERENCES=136,
KEYWORDS="Shift register sequences; correlation; survey; bibliography",
ANNOTE="Binary maximal-length linear feedback shift register sequences
(m-sequences) have been successfully employed in communications,
navigation, and related systems over the past several years. For the
early applications, m-sequences were used primarily because of their
excellent periodic autocorrelation properties. For many of the recent
systems applications, however, the crosscorrelation properties of such
sequences are at least as important as th",
}

@ARTICLE{Hale80:Frequency,
AUTHOR="W. K. Hale",
TITLE="Frequency Assignment: Theory and Applications",
JOURNAL=ieeeproc,
VOLUME=68,
NUMBER=12,
PAGES="1497-1514",
YEAR=1980,
KEYWORDS="frequency distribution",
ABSTRACT={Special issue on "Efficient Use of the Spectrum"},
}

@ARTICLE{Osaw80:Ruin,
AUTHOR="H. Osawa",
TITLE="The Analysis of the Ruin Problem Using the Queueing Theory",
JOURNAL="Studies in Queueing Systems with Multiplicity and Their
Applications",
PAGES="92-98",
YEAR=1980,
KEYWORDS="Queueing theory",
}

@ARTICLE{Ackr8001:Computing,
AUTHOR="M. H. Ackroyd",
TITLE="Computing the Waiting Time Distribution for the {$G/G/1$} Queue
by Signal Processing Methods",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=1,
PAGES="52-58",
MONTH=jan,
YEAR=1980,
KEYWORDS="queueing theory; G/G/1",
ABSTRACT="Two methods, based on signal processing techniques, are
presented for obtaining numerical solutions for the general single
server queue with first-come, first-served (FCFS, FIFO) discipline. The
first method is based on the use of the fast Fourier transform (FFT) for
producing iterative solutions to a discrete version of Lindley's
integral equation for both nonsteady state and equilibrium conditions.
The second method makes use of the complex cepstrum, implemented with
the FFT, for providing direct solutions with the queue in equilibrium.",
}

@ARTICLE{Ilra8001:Comparison,
AUTHOR="Marek I. Ilrand and",
TITLE="Comparison of Two Packet-Retransmission Techniques",
JOURNAL=ieeeit,
VOLUME="IT-26",
NUMBER=1,
PAGES="92-97",
MONTH=jan,
YEAR=1980,
KEYWORDS="congestion control",
ABSTRACT="Two methods of dealing with the overflow problem in packet
switches are compared: switch-retransmission and host-retransmission.
The comparison is based on approximate analytic models of tandem
queueing networks and is verified by simulation.",
}

@ARTICLE{Kekr8001:Buffer,
AUTHOR="H. B. Kekre and C. L. Saxena and Mohd Khalid",
TITLE="Buffer Behavior for Mixed Arrivals and Single Server with Random
Interruptions",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=1,
PAGES="59-64",
MONTH=jan,
YEAR=1980,
KEYWORDS="discrete time queue",
ABSTRACT="A queueing model with finite buffer size, mixed input traffic
(Poisson and burst Poisson arrivals), synchronous transmission and
server interruptions through a Bernoulli sequence of independent random
variables is studied. The queueing model developed is quite general in a
sense that it covers pure Poisson and burst Poisson arrival processes
and the mixture of the two as well.",
}

@ARTICLE{Tows8001:Statistical,
AUTHOR="Donald F. Towsley",
TITLE="The Analysis of a Statistical Multiplexer with Nonindependent
Arrivals and Errors",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=1,
PAGES="65-72",
MONTH=jan,
YEAR=1980,
ABSTRACT="Most stochastic models for discrete time statistical
multiplexers make the assumption that 1) arrivals are governed by a
Bernoulli process and that 2) transmission errors or multiplexer
failures are described by an independent error process. We study a
multiplexer operating in a two state Markovian environment in which each
state is characterized by its own Bernoulli arrival process and
independent error process. We derive the probability generating function
for the queue length distribution for such a system. \par We also
consider two special cases of this model. One referred to as the
saturated arrival model corresponds to a system in which during one of
the two states, the saturated state, at least one arrival occurs during
each discrete time unit. The other model, the breakdown model,
corresponds to a system in which during one of the two states, the
breakdown state, the multiplexer is inoperative. For both models, we
generalize the analysis to cases in which the durations of the saturated
state and breakdown state may take on values described by arbitrary
distributions. \par Finally, we study the effects of different arrival
processes and error processes on the queue length.",
ANNOTE="The paper studies a multiplexer operating in a two-state
Markovian environment in which each state is characterized by its own
Bernoulli arrival process and independent error process. The paper
derives the probability generating function for the queue length
distribution for such a system. -- Discrete-time queues.",
}

@ARTICLE{Dhad8001:Delta,
AUTHOR="V. R. Dhadesugoor and Chaim Ziegler and Donald L. Schilling",
TITLE="Delta modulators in packet voice networks",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=1,
PAGES="33-51",
MONTH=jan,
YEAR=1980,
KEYWORDS="packet voice; voice coding; delta modulation; CVSD; SVADM;
silence detection",
ABSTRACT="In this paper, the performances of the Song Voice Adaptive
Delta Modulator (SVADM) and the Continuously Variable Slop Delta
Modulator (CVSD) in terms of dynamic range, sampling rate and the
channel errors are compared. The use of the SVADM and CVSD in a packet
voice system, the algorithm for digital detection of silent periods and
the peformance of a packet voice system using the SVADM and the CVSD as
source encoders are presented. The parameters employed for subjective
evaluation of the packet voice system are packet size, silence detection
algorithm, bit rate and packet loss rate.",
}

@ARTICLE{CCIT8001:X.25,
AUTHOR="C. C. ITT",
TITLE="Draft Revised Recommendation {X.25}",
JOURNAL=ccr,
VOLUME=10,
NUMBER="1-2",
PAGES="56-129",
MONTH=jan,
YEAR=1980,
KEYWORDS="Packet switching; X.25; standard",
ABSTRACT="The following revised recommendation is a draft produced as a
result of the February 1980 CCITT study group VII meeting in Geneva.",
}

@ARTICLE{Crav8001:La,
AUTHOR="J. Craveur and B. Delosme and A. Leroux and F. Lucas and P.
Lucas",
TITLE="La signalisation par canal semaphore, premiere partie: Le systeme
{CCITT} nr. 7 et son application a la signalisation telephonique",
JOURNAL="L'echo des Recherches",
NUMBER="98-99",
PAGES="4-15",
MONTH=jan,
YEAR=1980,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Lind8001:Algorithm,
AUTHOR="Y. Linde and A. Buzo and R. M. Gray",
TITLE="An algorithm for vector quantiser design",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="84-95",
MONTH=jan,
YEAR=1980,
KEYWORDS="video compression",
}

@ARTICLE{Barb8002:Optimal,
AUTHOR="G. Barberis and Daniele Pazzaglia",
TITLE="Analysis and Optimal Design of a Packet-Voice Receiver",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=2,
PAGES="217-227",
MONTH=feb,
YEAR=1980,
}

@ARTICLE{Bhar8002:Discrete,
AUTHOR="Kadaba Bharath-Kumar",
TITLE="Discrete-Time Queueing Systems and Their Networks",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=2,
PAGES="260-263",
MONTH=feb,
YEAR=1980,
KEYWORDS="discrete time queue",
ABSTRACT="Queueing systems in discrete time that can model certain
computer communication systems are considered. First, a single-resource
model consisting of a geometric server with feedback facility, to which
packets arrive in independent bulks, is analyzed. Then, it is shown that
a network of such geometric resources with packets arriving in
independent Bernoulli streams (which, in a sense, is a discrete analog
of Jackson's network) does not possess the independence property. A
byproduct of this result is the fact that output of geometric resource
fed by two or more independent Bernoulli streams is not an independent
Bernoulli stream.",
}

@ARTICLE{Cour8002:Finite,
AUTHOR="P.-J. Courtois",
TITLE="The {$M/G/1$} Finite Capacity Queue with Delays",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=2,
PAGES="165-172",
MONTH=feb,
YEAR=1980,
KEYWORDS="queueing theory",
ABSTRACT="A steady-state analysis is made of the $M/G/1$ finite capacity
queue with delay is made. In this model every busy period is followed by
the execution of a noninterruptible task other than the servicing of
ordinary customers; the duration of this task, called a delay, is a
random variable with general distribution. Closed form expression, easy
to evaluate, are given for the distribution of the queue length and the
first two moments of the queueing time distribution. A variant is also
studied in which a busy period is followed by as many delays as
possible, new delays being reinitiated as long as no customer has
arrived.",
}

@INPROCEEDINGS{Clar8002:Distributed,
AUTHOR="D. D. Clark and Liba. Svobodova",
TITLE="Design of Distributed Systems Supporting Local Autonomy",
BOOKTITLE=compcon,
ORGANIZATION="IEEE",
ADDRESS="San Francisco, CA",
NOTE="Invited Paper",
MONTH=feb,
YEAR=1980,
}

@INPROCEEDINGS{Dona8002:Technology,
AUTHOR="J. R. Donaloson",
TITLE="Technology management and exchange through a world wide computer
network",
BOOKTITLE="Networks",
ADDRESS="Bombay",
MONTH=feb,
YEAR=1980,
}

@INPROCEEDINGS{Mino8002:Taxonomy,
AUTHOR="Daniel Minoli",
TITLE="A taxonomy and comparison of random access protocols for computer
networks",
BOOKTITLE="Networks",
ADDRESS="Bombay, India",
MONTH=feb,
YEAR=1980,
}

@ARTICLE{Thor8002:Back,
AUTHOR="J. E. Thornton",
TITLE="Back-End Network Approaches",
JOURNAL=ieeecomp,
VOLUME=13,
PAGES="10-17",
NOTE="also in \cite{Thur81:Tutorial}",
MONTH=feb,
YEAR=1980,
}

@INPROCEEDINGS{Twyv8002:Public,
AUTHOR="D. Twyver",
TITLE="Public data networks",
BOOKTITLE="Networks",
ADDRESS="Bombay",
MONTH=feb,
YEAR=1980,
}

@TECHREPORT{Post8002:Independent,
AUTHOR="Study Group 3 Post Office P. S. S User Forum",
TITLE="A Network Independent Transport Service",
BOOKTITLE="DCPU",
INSTITUTION="Post Office PSS User Forum, Study Group 3",
MONTH=feb,
YEAR=1980,
KEYWORDS="yellow book NITS",
}

@ARTICLE{Bial8003:Technique,
AUTHOR="T. Bially and Bernard Gold and Stephanie Seneff",
TITLE="A Technique for Adaptive Voice Flow Control in Integrated Packet
Networks",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="325-333",
MONTH=mar,
YEAR=1980,
KEYWORDS="packet voice",
ABSTRACT="Integrated packet-switched networks have potential for
providing improved performance by dynamically sharing transmission
bandwidths between various users and user types, but new flow control
methods are needed to deal with packetized voice traffic. This paper
describes a packet voice flow control concept based on embedded speech
coding. Results are presented from a computer simulation study of the
technique in the context of a multilink wideband packet speech network.
Several control methodologies are described, leading to an end-to-end
feedback approach that achieves stable operation and efficient
utilization of network resources by adaptively matching transmitted
voice bit rates to prevailing network conditions. Issues in the design
of embedded speech coding algorithms are reviewed and a candidate
structure based on channel vocoding principles is presented, along with
the subjective results of some preliminary listening tests.",
}

@ARTICLE{Cox8003:Multiple,
AUTHOR="Richard V. Cox and R. E. Crochiere",
TITLE="Multiple User Variable Rate Coding for {TASI} and Packet
Transmission Systems",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="334-344",
MONTH=mar,
YEAR=1980,
KEYWORDS="packet voice",
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 three major parts. In the first part, the theoretical
performance of variable rate coding is analyzed for multiple user (TASI)
applications. Potential gains 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 a dynamic buffer scheme 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 stabilized. 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. In the third part of the paper, a practical method is analyzed
for implementing a variable rate {ADPCM} system for multiple user
applications. Examples of computer simulations of the system are
presented.",
}

@ARTICLE{Rama8003:Queue,
AUTHOR="V. Ramaswami",
TITLE="The {$N/G/1$} Queue and Its Detailed Analysis",
JOURNAL=aap,
VOLUME=12,
NUMBER=1,
PAGES="222-261",
MONTH=mar,
YEAR=1980,
KEYWORDS="queueing theory",
}

@INPROCEEDINGS{Silv8003:Packet,
AUTHOR="J. M. Silva and J. de Mercado and S. A. Mahmoud",
TITLE="Packet speech for land mobile channels",
BOOKTITLE="International Zürich Seminar on Digital Communications
(DIGICOM)",
ORGANIZATION="IEEE",
ADDRESS="Zürich, Switzerland",
PAGES="E4.1-E4.6",
MONTH=mar,
YEAR=1980,
KEYWORDS="packet voice; packet radio",
ABSTRACT="This paper describes the results of a study to evaluate the
feasibility of applying packet speech concepts to land mobile systems.
One particular random access technique (NPCSMA) is investigated and it
is shown that for typical values of the system parameters packet speech
compares favorably to conventional trunked land mobile systems. An
expression is derived for the maximum number of active users that can be
supported by a single 30 kHz channel, as a function of the voice
digitization rate and the lost packet level. It is further shown that
the number of base-to-mobile channels does not need to be equal to the
number of mobile-to-base channels.",
}

@PROCEEDINGS{Zimm8003:GI,
TITLE={{GI-NTG} Fachtagung "Struktur und Betrieb von Rechensystemen"},
EDITOR="G. O. Zimmermann",
PUBLISHER="Informatik Fachberichte Springer-Verlag",
ADDRESS="Kiel, Germany",
VOLUME=27,
PAGES=275,
MONTH=mar,
YEAR=1980,
LANGUAGE="German",
KEYWORDS="Performance evaluation; model; queueing system; communication
network; hardware design language; operating system; system evaluation;
special issue; vertical migration",
ANNOTE="quantitative Bewertung von Rechensystemen; Kommunikation in
Rechensystemen und Rechnernetzen; vertikale Verlagerung; Verschiebung
der Hardware-Software-Schnittstelle; Entwurf mit
Rechnerbeschreibungssprachen; Strukturmodelle von Rechensystemen;
Betriebssysteme",
}

@TECHREPORT{Benn8003:Transnetwork,
AUTHOR="C. J. Bennett",
TITLE="The Design and Implementation of Transnetwork Systems",
INSTITUTION="Department of Computer Science, University College London",
NUMBER="TR-62",
MONTH=mar,
YEAR=1980,
}

@MISC{Suns8003:Addressing,
AUTHOR="C. A. Sunshine and J. B. Postel",
TITLE="Addressing Mobile Hosts in the {ARPA} {Internet} Environment",
HOWPUBLISHED="Internet Engineering Note (IEN) 135",
MONTH=mar,
YEAR=1980,
}

@INPROCEEDINGS{Cox8004:Time,
AUTHOR="John Charles Cox",
TITLE="Time delay effects on speech intelligibility",
BOOKTITLE=icassp,
ORGANIZATION="IEEE",
ADDRESS="Denver, Colorado",
PAGES="1034-1036",
MONTH=apr,
YEAR=1980,
KEYWORDS="speech communication; echo cancellation",
ABSTRACT="This paper is a preliminary report on an experiment to repeat
the 1949 Haas dissertation. A portable laboratory using modern
state-of-the-art equipment has been developed. Preliminary resultsusing
both speech and music as sources are given. The paper investigates the
effect of a single echo on speech intelligibility. Delays below 4 ms
achieve a stereophonic effect, while at delays of 84 ms and greater, the
words are unintelligible. Both speech and music support the rule that
delay should not exceed one third the distance between syllables (here
135 and 249 ms).",
}

@ARTICLE{Gree8004:Architectures,
AUTHOR="David Green",
TITLE="An introduction to network architectures and protocols",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=4,
PAGES="413-424",
MONTH=apr,
YEAR=1980,
KEYWORDS="protocols; survey; network architecture; X.25; SNA; DNS",
ABSTRACT="This tutorial paper is intended for the reader who is
unfamiliar with computer networks, to prepare him for reading the more
detailed technical literature on the subject. The approach here is to
start with an ordered list of the functions that any network must
provide in tieing two end users together, and then to indicate how this
leads naturally to layered peer protocols out of which the architecture
of a computer network is constructed. After a discussion of a few block
diagrams of private (commercially provided) and public (common carrier)
networks, the layer and header structures of SNA and DNA architectures
and the X.25 interface are briefly described.",
}

@ARTICLE{Gerl8004:Flow,
AUTHOR="M. Gerla and L. Kleinrock",
TITLE="Flow control: a comparative survey",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=4,
PAGES="553-574",
MONTH=apr,
YEAR=1980,
KEYWORDS="flow control; congestion control; survey",
ABSTRACT="Packet switching offers attractive advantages over the more
conventional circuit-switched scheme, namely, flexibility in setting up
user connections and more efficient use of resources after the
connection is established. However, if user demands are allowed to
exceed the system capacity, unpleasant congestion effects occur which
rapidly neutralize the delay and efficiency advantages. Congestion can
be eliminated by using an appropriate set of traffic monitoring and
control procedures called flow control procedures. Flow control can be
exercised at various levels in a packet network. The following models
are identified and discussed in this paper: hop level, entry-to-exit
level, network access level, and transport level. For each level, the
most representative techniques are surveyed and compared. Furthermore,
the interaction between the different levels is discussed.",
}

@ARTICLE{Bogg8004:Pup,
AUTHOR="David R. Boggs and John F. Shoch and Edward A. Taft and Robert
M. Metcalfe",
TITLE="Pup: an internetwork architecture",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=4,
PAGES="612-624",
MONTH=apr,
YEAR=1980,
KEYWORDS="Pup; internet; network layer; addressing; header compression;
flow control; congestion control; FTP; endpoint identifier; hop count;
routing; BSP; RTP; fragmentation",
ABSTRACT="Pup is the name of an internet packet format (PARC Universal
Packets), a hierarchy of protocols, and a style of internetwork
communication. The fundamental abstraction is an end-to-end
media-independent internetwork datagram. Higher levels of functionality
are achieved by end-to-end protocols that are strictly a matter of
agreement among the communicating end processes. This report explores
important design issues, sets forth principles that have guided the Pup
design, discuss the present implementation in moderate detail, and
summarize experience with an operational internetwork. This work serves
as the basis for a functioning internetwork system that provides service
to about 1000 computers, on 25 networks of 5 different types, using 20
internetwork gateways.",
ANNOTE="RTP: rendezvous and termination protocol",
}

@ARTICLE{Post8004:Internetwork,
AUTHOR="J. B. Postel",
TITLE="Internetwork protocol approaches",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=4,
PAGES="604-611",
MONTH=apr,
YEAR=1980,
KEYWORDS="internetworking; network layer; ARPAnet; X.25; addressing;
routing; flow control; error control",
ABSTRACT="The motivation for interconnecting networks is to provide one
or more consistent services to the set of users of the interconnected
networks. To provide these services either new end-to-end service
protocols must be defined or the service protocols of the individual
networks must be made to interwork. In either case the issues of
addressing, routing, buffering, flow control, error control, and
security must be considered. Two examples of interconnection strategy
are examined: the interconnection of X.25 networks, and the
interconnection of ARPA research networks. The model for interconnection
of networks and the role of internetwork protocols are discussed.",
}

@ARTICLE{Boch8004:Formal,
AUTHOR="Gregor V. Bochmann and C. A. Sunshine",
TITLE="Formal methods in communication protocol design",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=4,
PAGES="624-631",
MONTH=apr,
YEAR=1980,
KEYWORDS="network protocols; protocol verification; protocol
specification; formal methods; protocol implementation; survey",
ABSTRACT="While early protocol design efforts had to rely largely on
seat-of-the-pants methods, a variety of more rigorous techniques have
been developed recently. This paper surveys the formal methods being
applied to the problem of protocol specification, verification, and
implementation. In the specification area, both the service that a
protocol layer provides to its users and the internal operations of the
entities that compose the layer must be defined. Verification then
consists of a demonstration that the layer will meet its service
specification and that each of the components is correctly implemented.
Formal methods for accomplishing these tasks are discussed, including
state transition models, program verification, symbolic execution, and
design rules.",
}

@ARTICLE{Dant8004:Protocol,
AUTHOR="A. Danthine",
TITLE="Protocol representation with finite-state models",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=4,
PAGES="632-643",
MONTH=apr,
YEAR=1980,
KEYWORDS="protocol verification; protocol modeling; finite-state
machines; network protocols",
ABSTRACT="A three-layer model of a computer network is used to introduce
the concept of interface and of end-to-end protocols. Using a simple
interface protocol as example, finite state automaton and Petri nets are
introduced. The idea of an interface machine is rejected and the
problems related to the transmission medium are approached. End-to-end
protocols request a global model which includes two local models and a
transmission medium model. However, the local model has to be
generalized. This eventually leads to the association of the state of
the automaton with a context. Petri nets have also to be expanded.
Models presented here have been successfully used for modeling transport
protocols.",
}

@ARTICLE{Schu8004:Executable,
AUTHOR="Gary D. Schultz and David B. Rose and C. H. West and J. P.
Gray",
TITLE="Executable description and validation of {SNA}",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=4,
PAGES="661-677",
MONTH=apr,
YEAR=1980,
KEYWORDS="protocol verification; protocol validation; network protocols;
SNA; network protocol languages",
ABSTRACT="The definition of IBM's System Network Architecture (SNA) has
evolved into a specification of a node in the form of a
meta-implementation using formal, state-oriented descriptive techniques.
This evolution is traced here, and the different formal techniques are
described. The culmination of this process has been the development of a
PL/I-based programming language, Format and Protocol Language (FAPL), as
a descriptive tool. Using FAPL, the architects now define SNA by a
programmed meta-implementation of a node. In this form, it is precise,
readily accessible to the implementing product designers and
programmers, and structurally close to the implementations. The
essential features of the meta-implementation and of FAPL are described,
along with the implications and advantages of describing the
architecture in an executable form. One major benefit, already being
realized, is the capability to test the logical consistency and
completeness of the executable description itself. The current status of
the validation of the executable description and sample results obtained
are described.",
}

@ARTICLE{Zafi8004:Analyzing,
AUTHOR="P. C. H. West and Harry Rudin and D. D. Cowan and D. Brand",
TITLE="Towards analyzing and synthesizing protocols",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=4,
PAGES="651-661",
MONTH=apr,
YEAR=1980,
KEYWORDS="formal methods; protocol verification",
ABSTRACT="The production of error-free protocols or complex process
interactions is essential to reliable communications. This paper
presents techniques for both the detection of errors in protocols and
for prevention of error in their design. The methods have been used
successfully to detect and correct errors in existing protocols. A
technique based on a reachability analysis is described which detects
errors in a design. This ``perturbation technique'' has been implemented
and has successfully detected inconsistencies or errors in existing
protocol designs including both X.21 and X.25. The types of errors
handled are state deadlocks, unspecified receptions, nonexecutable
interactions, and state ambiguities. These errors are discussed and
their effects considered. An interactive design technique is then
described that prevents design errors. The technique is based on a set
of production rules which guarantee that complete reception capability
is provided in the interacting processes. These rules have been
implemented in the form of a tracking algorithm that prevents a designer
from creating unspecified receptions and nonexecutable interactions and
monitors for the presence of state deadlocks and ambiguities.",
}

@ARTICLE{Boch8004:General,
AUTHOR="Gregor V. Bochmann",
TITLE="A general transition model for protocols and communication
services",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=4,
PAGES="643-650",
MONTH=apr,
YEAR=1980,
KEYWORDS="formal methods; finite state machines; protocol verification;
protocol implementation; X.25; HDLC",
ABSTRACT="Different approaches have been used for the formal
specification and verification of communication protocols. This paper
explains the approach of using a general transition model which combines
aspects of finite state transition diagrams and programming languages.
Different ways of structuring a protocol into separate modules or
functions are also discussed. The main part of the paper describes a
method for exactly specifying the communication service provided by a
protocol. Two aspects of a service specification are distinguished: 1)
the local properties which characterize the interface through which the
service may be accessed, and 2) the global properties which describe the
``end-to-end'' communication characteristics of the service. It is shown
how the specification method is related to the general transition model
for protocol specification. Verification is discussed briefly with
emphasis on the use of invariant assertions in the context of finite
state as well as programming language protocol descriptions. The
discussed topics are demonstrated with examples based on the HDLC
classes of procedures and the X.25 virtual circuit data transmission
service.",
}

@ARTICLE{Alle8004:Queueing,
AUTHOR="A. O. Allen",
TITLE="Queueing models of computer systems",
JOURNAL=ieeecomp,
PAGES="13-24",
MONTH=apr,
YEAR=1980,
KEYWORDS="performance evaluation; queueing theory; survey",
ABSTRACT="Benchmarking is older. Simulation is more popular. But
analytical queueing models may offer the most cost-effective technique
for computer system performance modeling.",
}

@ARTICLE{Cona8004:Character,
AUTHOR="James W. Conard",
TITLE="Character-oriented data link control protocols",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=4,
PAGES="445-454",
MONTH=apr,
YEAR=1980,
KEYWORDS="data link layer; data link protocols; bisync; protocol
layering; link control; ASCII",
ABSTRACT="Character or byte-oriented data link protocols have had a
profound influence on the rapid and successful development of data
communication networks. Although subject to certain limitations which
led to the development of the now emerging bit-oriented protocols,
character-oriented protocols have served our industry very well. Because
of widespread implementation, they can be expected to continue this
service into the foreseeable future. This paper offers an overview of
character-oriented protocols and their place in the communications
hierarchy. It examines these protocols from a historical and
evolutionary perspective. It provides details, with examples, of the
structure, functions, characteristics, and operation of the family of
character-oriented link protocols.",
}

@ARTICLE{Weck8004:DNA,
AUTHOR="S. Wecker",
TITLE="{DNA:} the digital network architecture",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=4,
PAGES="510-526",
MONTH=apr,
YEAR=1980,
KEYWORDS="DNA; network architecture; DECnet",
ABSTRACT="Recognizing the need to share resources and distribute
computing among systems, computer manufacturers have been designing
network components and communication subsystems as part of their
hardware/software system offerings. A manufacturer's general purpose
network structure must support a wide range of applications, topologies,
and hardware configurations. The Digital Network Architecture (DNA), the
architectural model for the DECnet family of network implementations,
has been designed to meet these specific requirements and to create a
communication environment among the heterogeneous computers comprising
Digital's systems. This paper describes the Digital Network
Architecture, including an overview of its goals and structure, and
details on the interfaces and functions within that structure. The
protocols implementing the functions of DNA are described, including the
motivation for the specific designs, alternatives and tradeoffs, and
lessons learned from the implementations. The protocol descriptions
include discussions of addressing, error control, flow control,
synchronization, flexibility, and performance. The paper concludes with
examples of DECnet operation.",
}

@ARTICLE{Carl8004:Bit,
AUTHOR="David E. Carlson",
TITLE="Bit-oriented data link control procedures",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=4,
PAGES="455-467",
MONTH=apr,
YEAR=1980,
KEYWORDS="data link layer; HDLC; survey; SDLC; LAPB",
ABSTRACT="The rapid growth of data communications in recent years,
coupled with a movement from batch-oriented to transaction-oriented
(interactive) type of operation, generated the need for a new, more
efficient, more reliable, more flexible form of data link control
procedure. A bit-oriented approach to data link control that has become
the generally accepted standard around the world is discussed in this
paper. The basic elements and structure of the procedure are described,
some typical examples of operation reviewed, and a ``crystal-balling''
of the future is offered.",
}

@ARTICLE{Rybc8004:X,
AUTHOR="Antony Rybczynski",
TITLE="{X.25} interface and end-to-end virtual circuit service
characteristics",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=4,
PAGES="500-510",
MONTH=apr,
YEAR=1980,
KEYWORDS="X.25; public data networks; DTE; virtual circuit; PVC; SVC;
flow control; signaling",
ABSTRACT="Public packet switching networks around the world use CCCITT
recommendation X.25, which is the standard device-independent interface
between packet networks and user devices operating in the packet mode.
Since its development in 1976 and with four years of network operational
experience, the X.25 interface specification has reached a high level of
maturity. A revised version of X.25 has been approved by CCITT Study
Group VII at its meeting in February 1980. The revised X.25
specification is more complex than its predecessor, eliminates a number
of ambiguous areas which lead to network implementation differences, and
has been enhanced by the addition of new capabilities both to the X.25
interface and to the end-to-end service. This paper presents a
consolidated view of the end-to-end characteristics of the
virtual-circuit-based services accessible through the X.25 interface. It
then discusses the characteristics of the revised X.25 interface, with
emphasis on areas that have been addressed in the revised
Recommendation. The revised Recommendation leads the way to greater
commonality among network implementations. The increased functionality
of the end-to-end virtual-circuit services has impact on the
relationship of X.25 to system architectures discussed by international
standards bodies.",
}

@ARTICLE{Schw8004:Routing,
AUTHOR="M. Schwartz and T. E. Stern",
TITLE="Routing techniques used in computer communication networks",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=4,
PAGES="539-552",
MONTH=apr,
YEAR=1980,
KEYWORDS="routing; SNA; DNA; TYMNET; ARPAnet; Internet; TRANSPAC;
virtual circuit; shortest path routing",
ABSTRACT="An overview is provided in this paper of the routing
procedures used in a number of operating networks, as well as in two
commercial network architectures. The networks include TYMNET, ARPAnet,
and TRANSPAC. The network architectures discussed are the IBM SNA and
the DEC DNA. The routing algorithms all tend to fall in the shortest
path class. In the introductory sections, routing procedures in general
are discussed, with specialization to shortest path algorithms. Two
shortest path algorithms, one appropriate for centralized computation,
the other for distributed computation, are described. These algorithms,
in somewhat modified form, provide the basis for the algorithms actually
used in the networks discussed.",
}

@ARTICLE{Folt8004:X,
AUTHOR="H. C. Folts",
TITLE="{X.25} transaction-oriented features -- datagram and fast
select",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=4,
PAGES="496-500",
MONTH=apr,
YEAR=1980,
KEYWORDS="X.25; datagram; fast select; network layer; VC",
ABSTRACT="The latest proposed revisions to CCITT recommendation X.25 for
packet-switched service in public data networks now include two new
capabilities suitable for transport of a small amount of data. The first
provides datagram service for the transport of independent 'message
type' packets. The other new feature is the fast select feature which
provides for inclusion of 128 octets of user data in the call
establishment packets for virtual call service. Both these new
provisions greatly enhance the capability of X.25 to efficiently support
the broadest range of user applications.",
}

@ARTICLE{Folt8004:Procedures,
AUTHOR="H. C. Folts",
TITLE="Procedures for circuit-switched service in synchronous public
data networks",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=4,
PAGES="489-496",
MONTH=apr,
YEAR=1980,
KEYWORDS="X.21; X.25; VC; virtual circuit; call setup; signaling",
ABSTRACT="X.21 specifies a simple character-oriented procedure used to
establish a transparent connection through a synchronous Public Data
Network. The architecture of call establishment for X.21 is the same as
that for call (virtual) establishment of X.25; in this regard, their
functionality is nearly identical. This paper describes the background
that went into the development of the Recommendation, discusses the
architectural relationships, and presents the details of the X.21
circuit-switching protocol.",
}

@ARTICLE{Saue8004:Approximate,
AUTHOR="C. H. Sauer and K. M. Chandy",
TITLE="Approximate solution of queueing models",
JOURNAL=ieeecomp,
PAGES="25-31",
MONTH=apr,
YEAR=1980,
KEYWORDS="Queueing system; Queueing network; approximation; G/G/1;
model; bibliography",
ANNOTE="A variety of phenomena and interactions defy exact analytic
modeling. Approximation can provide a reasonably accurate solution of a
realistic model and is computationally inexpensive.",
}

@ARTICLE{Spra8004:Analytical,
AUTHOR="J. D. Spragins",
TITLE="Analytical queueing models",
JOURNAL=ieeecomp,
VOLUME=13,
NUMBER=4,
PAGES="9-11",
MONTH=apr,
YEAR=1980,
KEYWORDS="Queueing network; analysis",
}

@ARTICLE{Folt8004:Transaction,
AUTHOR="H. C. Folts",
TITLE="Transaction oriented features - datagram and fast select",
JOURNAL=ieeecom,
VOLUME="COM-28",
PAGES="496-500",
MONTH=apr,
YEAR=1980,
}

@TECHREPORT{Szur8004:MMDF,
AUTHOR="E. Szurkowski",
TITLE="{MMDF} Dial-Up Link Protocol",
TYPE="CSNET Design",
INSTITUTION="CSNET",
NUMBER="DN-4",
MONTH=apr,
YEAR=1980,
}

@TECHREPORT{John8004:Ring,
AUTHOR="M. E. Johnson",
TITLE="Ring Byte Stream Protocol Specification",
INSTITUTION="Computer Laboratory, University of Cambridge",
MONTH=apr,
YEAR=1980,
}

@ARTICLE{Rose8004:Recognition,
AUTHOR="Arnold L. Rosenberg and L. R. Rabiner and J. G. Wilpon",
TITLE="Recognition of spoken spelled names for directory assistance
using speaker-independent templates",
JOURNAL=bstj,
VOLUME=59,
NUMBER=4,
PAGES="571-592",
MONTH=apr,
YEAR=1980,
REFERENCES=9,
KEYWORDS="speech recognition",
ABSTRACT="In a recent paper, Rosenberg and Schmidt demonstrated the
applicability of a speaker-trained, isolated word recognizer to the
problem of automatic directory assistance.  Input to the system was in
the form of a string of letters which spelled the last name and initials
of an individual for whom a directory listing was required.  Rosenberg
and Schmidt found that, even though the recognition rate for individual
letters was rather low (approximately 80 percent), the rate at which the
correct directory listing was found was higher (approximately 95
percent).  In this paper, we extend these results to include the case of
speaker-independent recognition of letters.  We show that overall
performance in the speaker-independent mode is comparable to performance
in a speaker-dependent mode and examine various factors important for
operation in a speaker-independent mode, such as characteristics of the
reference templates, choice of decision rule, and threshold parameters.
For the most part, the overall system is remarkably robust to the
parameters of the recognizer.  For the best choice of these parameters,
a 95-percent correct string rate is obtained, comparable to the
performance in a speaker-dependent mode.",
}

@TECHREPORT{Ande8004:Computer,
AUTHOR="J. P. Anderson",
TITLE="Computer security threat monitoring and surveillance",
INSTITUTION="James P. Anderson Company",
ADDRESS="Fort Washington, Pennsylvania",
MONTH=apr,
YEAR=1980,
}

@TECHREPORT{Carb8005:LSI,
AUTHOR="R. E. Carbonell",
TITLE="{LSI-11} Ring Access Logic",
TYPE="Internal Note",
INSTITUTION="UCL",
NUMBER=916,
MONTH=may,
YEAR=1980,
}

@BOOK{Reid8005:SCRIBE,
AUTHOR="B. K. Reid and J. T. Walker",
TITLE="{SCRIBE} - Introductory User's Manual",
PUBLISHER="UNILOGIC Ltd.",
ADDRESS="Pittsburgh",
MONTH=may,
YEAR=1980,
}

@PHDTHESIS{Bogh80:Fault,
AUTHOR="W. Boghdady",
TITLE="Implementation of Fault Detection, Localisation in Data
Transmission Networks",
SCHOOL="ENST, Ecole Nationale Superieure des Telecommications,
Department Electronique et Physique",
PAGES=123,
MONTH=may,
YEAR=1980,
KEYWORDS="data transmission; transmission system; data network; fault",
}

@INPROCEEDINGS{Saad8006:Input,
AUTHOR="S. Saad and M. Schwartz",
TITLE="Input Buffer Limiting Mechanisms for Congestion Control",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Seattle, Washington",
PAGES="23.1.1-23.1.5",
MONTH=jun,
YEAR=1980,
ABSTRACT="Prior work by Lam and Reiser on input buffer limiting
mechanisms for congestion control in computer communication networks is
extended in this paper. We show congestion control at a node in the
network may be improved in two ways: 1. by using a tighter control over
input packets newly generated at the node, with priority allotted to
transit packets passing through the node; and 2. by invoking a link
level control mechanism with the number of input packets constrained by
buffer allocation at the output link to which it is assigned, in
addition to input buffer limiting at the node level. The tighter control
mechanism suggested blocks input packets when the sum of all packets in
the node, input plus transit, exceed a specified number. The Lam and
Reiser control blocks input packets when they alone reach a specified
threshold. The analysis, following the Lam and Reiser's approach,
focuses on a typical node in a (assumed) large, homogeneous, symmetric
network. Both throughput and time delay as a function of offered load
are calculated in comparing various control mechanisms, and the concept
of ``power'', the ratio of throughput to time delay, is invoked as a
single useful performance measure to be optimized.",
ANNOTE="Congestion control.",
}

@INPROCEEDINGS{Verm8006:Procedure,
AUTHOR="Pramode K. Verma",
TITLE="A Procedure for Estimating Percentile Response Time in a Packet
Switched Network",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Seatle, Washington",
PAGES="61.5.1-61.5.4",
MONTH=jun,
YEAR=1980,
ANNOTE="convolution for mixed discrete/continuous distributions",
}

@INPROCEEDINGS{Forg8006:Voice,
AUTHOR="James W. Forgie",
TITLE="Voice conferencing in packet networks",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Seatle, Washington",
PAGES="21.3.1-21.3.4",
MONTH=jun,
YEAR=1980,
KEYWORDS="packet voice; voice conferencing; speech transmission",
ABSTRACT="Packet networks offer advantages for digital voice
conferencing in a number of areas. Transmission capacity can be utilized
very efficiently because typically only one of the conferees need to
occupy network resources for speech transmission at any time. Conference
control can be carried out effectively through the transmission of data
packets between terminals and conference controllers. Techniques and
protocols for packet voice conferencing will be described. Experience
with packet voice experiments in terrestrial, satellite and internetted
network environments will be discussed. Sites used LPC-based coders with
bit rates between 2400 and 5000 bps. Typical packets contained between
140 to 240 ms of speech, with shorter packets at the end of talkspurts.
Receiver buffering is required to keep losses below an acceptable value
of 1\%. Since vocoders cannot handle more than one voice, signal
selection rather than mixing is used. Floor control either by pressing a
button or by speech activity detection with priority resolution of
collisions. Speech activity detection is more natural and avoids the
``town meeting'' type of conference. Successful conferences were carried
out early 1976. Satellite conferencing was first demonstrated in May
1978.",
}

@INPROCEEDINGS{Spil8006:Digital,
AUTHOR="Paal Spilling and Earl Craighill",
TITLE="Digital voice communications in the packet radio network",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Seattle, Washington",
PAGES="21.4.1-21.4.7",
MONTH=jun,
YEAR=1980,
KEYWORDS="packet radio; packet voice; speech communication",
ABSTRACT="This paper describes the functional requirements for a voice
terminal to be used in the packet radio environment and the performance
requirements necessary to support voice traffic. The intended
application is for point-to-point conversation or conferencing within a
packet radio network, or within an internetted environment, created by
connecting the packet radio network to other networks. The primary focus
of this paper is the requirements for a single voice connection with the
PRNET. The feasibility for transport of voice in a packet radio network
was investigated experimentally, using emulated traffic. Results are
promising, but indicate a temporary degradation in the performance under
mobile conditions. Methods for improving performance under these
conditions are presented and their implications for voice terminal
design are discussed. --- Optimal packet size is equivalent to 20 to 40
ms.",
}

@INPROCEEDINGS{Arth8006:Traffic,
AUTHOR="E. Arthurs and B. W. Stuck",
TITLE="Traffic analysis tools for integrated voice-data multiplexing",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Seattle, Washington",
PAGES="21.5.1",
MONTH=jun,
YEAR=1980,
KEYWORDS="speech transmission; multiplexer; slot assignment",
}

@ARTICLE{Harr8006:Voice,
AUTHOR="Edmund A. Harrington",
TITLE="Voice/data integration using circuit switched networks",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=6,
PAGES="781-793",
MONTH=jun,
YEAR=1980,
KEYWORDS="integrated services; circuit switched networks; TASI; network
architecture; hybrid switching",
ABSTRACT="This paper assesses the impact of integrating voice and data
over circuit switched networks. Three main types of circuit switching
are considered: 1) traditional circuit switching, 2) fast circuit
switching -- employing advanced switching speeds, and 3) enhanced
circuit switching -- employing time assigned speech interpolation (TASI)
and adaptive data multiplexing (ADM) techniques. The circuit switching
networks are evaluated in terms of the main network performance
parameters: transmission efficiency and delay. In addition, an
evaluation is made of such things as protocol and error control,
precedence and preemption, routing and flow control, synchronization,
voice continuity, probability of error or loss, and classmarking
flexibility. One of the main conclusions of this paper is that circuit
switching technologies have several deficiencies associated with
providing integrated voice/data service and that the future lies in the
effective use of packet and hybrid (circuit/packet) switching
technologies.",
}

@INCOLLECTION{Beil80:Construction,
AUTHOR="H. Beilner",
TITLE="On the construction of computing system simulators",
BOOKTITLE="2nd summer school on computer systems performance",
PUBLISHER="North Holland",
ADDRESS="Urbino",
MONTH=jun,
YEAR=1980,
REFERENCES=57,
KEYWORDS="Simulation; overview",
ANNOTE="This contribution attempts to give an overview over techniques
and software tools as employed for constructing simulative models of
computing systems. Section 1 surveys the performance evaluation fields
and puts the simulative modelling approach into perspective. Section 2
addresses the basic programming techniques for constructing simulators
and discusses various general simulation languages. Section 3 is devoted
to specialised software tools",
}

@ARTICLE{John8006:New,
AUTHOR="M. E. Johnson and G. L. Tietjen and R. J. Beckman",
TITLE="A new family of probability distributions with applications to
Monte Carlo studies",
JOURNAL="Journal of the American Statistical Association",
VOLUME=75,
NUMBER=370,
PAGES="276-279",
MONTH=jun,
YEAR=1980,
KEYWORDS="random variate generation",
}

@ARTICLE{Lato8006:Exponential,
AUTHOR="G. Latouche",
TITLE="Exponential Servers Sharing a Finite Storage",
JOURNAL=ieeecom,
VOLUME=28,
NUMBER=6,
PAGES="910-915",
MONTH=jun,
YEAR=1980,
}

@ARTICLE{Good8007:Embedded,
AUTHOR="David J. Goodman",
TITLE="Embedded {DPCM} for Variable Bit Rate Transmission",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=7,
PAGES="1040-1046",
MONTH=jul,
YEAR=1980,
KEYWORDS="packet voice",
ABSTRACT="Within the bit stream of an embedded digital code is a stream
that can be decoded to produce a reasonable replica of the analog source
signal. Unlike pulse code modulation (PCM), differential PCM (DPCM), is
not an embedded code. If $C$ bits/sample are deleted from the bit stream
of a DPCM coder with $E$ bits/sample, the decoded output is
substantially noisier than the output of a DPCM codec with $D=E-C$
bits/sample. The penalty is 4--10 dB in signal-to-noise ratio (SNR).
\par However, with minor modifications to the encoder and decoder, DPCM
becomes an embedded code. Embedded DPCM with $E$ bits/sample at the
encoder and $D$ bits/sample transmitted produces exactly the same output
as embedded DPCM with $D$ bits/sample encoding and perfect transmission.
The SNR of embedded DPCM is slightly lower than the SNR of DPCM. The
penalty is 0.5-0.8 dB if the minimum transmitted bit rate is 2
bits/sample. It is less than 3 dB if $D$ is at least 3 bits/sample. \par
Combined with an appropriate adaptive quantizer the embedded DPCM codec
produces embedded DPCM (adaptive DPCM) for variable rate transmission
ranging from 2 bits/sample up to any desired maximum. Application exist
in speech interpolation, packet switching, and hardware architecture.",
}

@ARTICLE{Rudi8007:Dynamic,
AUTHOR="Harry Rudin and H. R. Mueller",
TITLE="Dynamic Routing and Flow Control",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=7,
PAGES="1030-1039",
MONTH=jul,
YEAR=1980,
ABSTRACT="This is an expanded version of an earlier report, adding new
results. The first part introduces a simple analytic model showing that
dynamic routing may increase network throughput or lower delay when
trunks are moderately loaded, but will reduce throughput or increase
delay at heavy trunk loads. The second part of the paper presents
simulation results characterizing: 1) the operation of the network
``protected'' by end-to-end flow control, 2) the operation of an
``unprotected'' network, 3) the transition between these two modes, 4)
the effect of changing the update interval for the routing algorithms,
5) the effect of slow local loops, and 6) the effect of increasing the
number of alternate paths available for dynamic routing. \par Overall,
the results show that dynamic routing improves network performance only
over a small parameter range, and should dynamic routing be used at all,
it must be implemented with great care.",
ANNOTE="Routing.",
}

@ARTICLE{Crav80:La,
AUTHOR="J. Craveur and B. Delosme and A. Leroux and F. Lucas and et al",
TITLE="La signalisation par canal semaphore, 2. partie: Organisation du
leseau semaphore",
JOURNAL="L'echo des Recherches",
NUMBER=101,
PAGES="31-40",
MONTH=jul,
YEAR=1980,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Free8007:Updated,
AUTHOR="H. A. Freeman and Kenneth J. Thurber",
TITLE="Updated bibliography on local computer networks",
JOURNAL=ccr,
VOLUME=10,
NUMBER=3,
PAGES="10-18",
MONTH=jul,
YEAR=1980,
}

@TECHREPORT{Call8007:Features,
AUTHOR="R. Callon",
TITLE="Features of Internetwork Protocol",
INSTITUTION="National Bureau of Standards",
NUMBER="ICST/HLNP-80-8",
MONTH=jul,
YEAR=1980,
}

@TECHREPORT{Lloy8007:Ring,
AUTHOR="P. J. Lloyd",
TITLE="Ring Data-Capture Measurements",
TYPE="Internal Note",
INSTITUTION="UCL",
NUMBER=934,
MONTH=jul,
YEAR=1980,
}

@ARTICLE{Stur8007:Distributed,
AUTHOR="H. Sturgis and J. Mitchell and J. Israel",
TITLE="Issues in the Design of a Distributed File System",
JOURNAL=acmosrev,
VOLUME=14,
NUMBER=3,
PAGES="55-69",
MONTH=jul,
YEAR=1980,
}

@TECHREPORT{Hood8007:Real,
AUTHOR="Robert T. Hood and Robert C. Melville",
TITLE="Real Time Queue Operations in Pure {LISP}",
INSTITUTION="Cornell University, Computer Science Department",
NUMBER="TR80-433",
PAGES=5,
MONTH=jul,
YEAR=1980,
ABSTRACT="Several methods of implementing a queue in Pure LISP are
presented. A technique to distribute the reversal of a list over a
number of operations leads to a real-time queue implementation.",
}

@ARTICLE{Wats8007:Contention,
AUTHOR="W. B. Watson",
TITLE="Performance in Contention Bus Local Network Interconnection",
JOURNAL=ccr,
VOLUME=10,
NUMBER=3,
MONTH=jul,
YEAR=1980,
}

@ARTICLE{Spil8007:Comments,
AUTHOR="Paal Spilling and N. Shacham and Earl Craighill",
TITLE={Comments on "Digital Voice Communication over Digital Radio
Links"},
JOURNAL=ccr,
VOLUME=10,
NUMBER=3,
MONTH=jul,
YEAR=1980,
}

@ARTICLE{Bent8007:Optimal,
AUTHOR="Jon Louis Bentley and D. C. Wood",
TITLE="An Optimal Worst Case Algorithm for Reporting Intersections of
Rectangles",
JOURNAL=ieeetc,
VOLUME=29,
NUMBER=7,
PAGES="571-577",
MONTH=jul,
YEAR=1980,
}

@ARTICLE{Gold8008:Jackson,
AUTHOR="Henry M. Goldberg",
TITLE="Jackson's Conjecture on Earliest Due Data Scheduling",
JOURNAL=mor,
VOLUME=5,
NUMBER=3,
PAGES="460-466",
MONTH=aug,
YEAR=1980,
KEYWORDS="queueing theory",
ANNOTE="Distribution function of virtual waiting time in transient as
well as steady state.",
}

@INPROCEEDINGS{Salt8008:Source,
AUTHOR="J. H. Saltzer and D. P. Reed and D. D. Clark",
TITLE="Source Routing for Campus-Wide {Internet} Transport",
BOOKTITLE="IFIP Working Group 6.4, International Workshop on Local
Networks",
ADDRESS="Zurich, Switzerland",
NOTE="also in ``Local Networks for Computer Communications,'' pp. 1-25
by North Holland Publishing Company",
MONTH=aug,
YEAR=1980,
}

@INCOLLECTION{Post8008:User,
AUTHOR="J. B. Postel",
TITLE="User Datagram Protocol {NIC-RFC-768}",
BOOKTITLE="DDN Protocol Handbook",
PUBLISHER="U. S. Department of Defense",
VOLUME=2,
PAGES="2.175-2.177",
MONTH=aug,
YEAR=1980,
}

@UNPUBLISHED{Cher80:Loosely,
AUTHOR="D. R. Cheriton",
TITLE="A Loosely-Coupled {I/O} System for a Distributed Environment",
NOTE="University of British Columbia",
MONTH=aug,
YEAR=1980,
}

@INPROCEEDINGS{Dant8008:Transport,
AUTHOR="A. Danthine and F. Magnee",
TITLE="Transport Layer - Long-Haul vs. Local Networks",
BOOKTITLE="International Workshop on Local Area Networks, IFIP WG 6.4,
Zurich",
MONTH=aug,
YEAR=1980,
}

@INPROCEEDINGS{Shoc8008:Carrying,
AUTHOR="John F. Shoch",
TITLE="Carrying voice traffic through an Ethernet local area network --
a general overview",
BOOKTITLE="IFIP WG 6.4 International Workshop on Local-Area Computer
Networks",
ADDRESS="Zurich, Switzerland",
MONTH=aug,
YEAR=1980,
KEYWORDS="packet voice; Ethernet; LAN",
}

@ARTICLE{Sond8008:Silencing,
AUTHOR="M. M. Sondhi and David A. Berkley",
TITLE="Silencing Echoes on the Telephone Network",
JOURNAL=ieeeproc,
VOLUME=68,
NUMBER=8,
PAGES="948-963",
MONTH=aug,
YEAR=1980,
ANNOTE="Voice telephony.",
}

@ARTICLE{Bial8009:Voice,
AUTHOR="T. Bially and A. J. McLaughlin and Clifford J. Weinstein",
TITLE="Voice communication in integrated digital voice and data
networks",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=9,
PAGES="1478-1490",
MONTH=sep,
YEAR=1980,
KEYWORDS="packet voice; speech communication; multiplexer",
ABSTRACT="Voice communications networks have traditionally been designed
to provide either analog signal paths or fixed-rate synchronous digital
connections between individual subscribers. These designs were aimed at
accommodating the ``streamlike'' character of speech, which has
traditionally been considered to flov from source to destination at a
more or less constant rate. In way of contrast, interactive and
computer-to-computer data transactions tend to be ``bursty'' in nature,
and this has given rise to the development of packet-switching methods
for data communications. The dichotomous nature of these two major
traffic classes and the apparent conflict between the types of network
services they require has resulted in the deployment of separate
military communications facilities for voice and data. A challenge in
the design of future systems is to achieve overall economy and
flexibility in the allocation of resources and the efficient integration
of both traffic types in common network facilities. This paper
summarizes a number of advanced concepts for switching and flow control
of combined voice and data traffic in integrated environments.
Performance characteristics are described based on analysis results and
computer simulation studies for both multilink terrestrial and broadcast
satellite network topologies.",
ANNOTE="Modeling of voice/data mulitplexers and flow control with
bit-rate variation.",
}

@ARTICLE{Mowa8009:Integrated,
AUTHOR="Osama A. Mowafi and Kelly Donnelly",
TITLE="Integrated voice/data packet switching techniques for future
military networks",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=9,
PAGES="1655-1662",
MONTH=sep,
YEAR=1980,
KEYWORDS="packet voice; integrated services",
ABSTRACT="Virtual circuit and pure packet (datagram) based switching
techniques are studied for future applications to the integrated
voice/data telecommunications. The coexistence of voice with both
interactive and bulk data in an integrated network suggests the
desirability of a mixed switching technique to allow the efficient
sharing of both the switching and communication resources. Such a 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{Schm8009:Squeeze,
AUTHOR="B. W. Schmeiser and R. Lal",
TITLE="Squeeze methods for generating gamma variates",
JOURNAL=jams,
VOLUME=75,
NUMBER=371,
PAGES="679-682",
MONTH=sep,
YEAR=1980,
KEYWORDS="random variate generation",
}

@ARTICLE{Schm8009:Acceptance,
AUTHOR="B. W. Schmeiser and M. A. Shalaby",
TITLE="Acceptance/rejection methods for beta variate generation",
JOURNAL=jams,
VOLUME=75,
NUMBER=371,
PAGES="673-678",
MONTH=sep,
YEAR=1980,
KEYWORDS="random variate generation",
}

@ARTICLE{Tadi8009:Random,
AUTHOR="P. R. Tadikamalla",
TITLE="Random sampling from the exponential power distribution",
JOURNAL=jams,
VOLUME=75,
NUMBER=371,
PAGES="683-686",
MONTH=sep,
YEAR=1980,
KEYWORDS="random variate generation",
}

@ARTICLE{Baba8009:Data,
AUTHOR="Y. M. Babad and J. A. Hoffer",
TITLE="Data Element Security and Its Effects on File Segmentation",
JOURNAL=ieeese,
VOLUME="SE-6",
NUMBER=5,
PAGES="402-410",
MONTH=sep,
YEAR=1980,
}

@ARTICLE{Birr8009:Universal,
AUTHOR="A. D. Birrell and R. M. Needham",
TITLE="A Universal File Server",
JOURNAL=ieeese,
VOLUME="SE-6",
NUMBER=5,
PAGES="450-453",
MONTH=sep,
YEAR=1980,
}

@ARTICLE{Gude8009:Cryptography,
AUTHOR="E. Gudes",
TITLE="The Design of a Cryptography Based Secure File System",
JOURNAL=ieeese,
VOLUME="SE-6",
NUMBER=5,
PAGES="411-419",
MONTH=sep,
YEAR=1980,
}

@PHDTHESIS{Kent8009:Protecting,
AUTHOR="Stephen T. Kent",
TITLE="Protecting Externally Supplied Software in Small Computers",
SCHOOL="Massachusetts Institute of Technology",
ADDRESS="Cambridge, MA",
MONTH=sep,
YEAR=1980,
}

@TECHREPORT{Dall8009:Transport,
AUTHOR="I. N. Dallas",
TITLE="Transport service byte stream protocols",
TYPE="Rep.",
INSTITUTION="University of Kent at Canterbury Computing laboratory",
NUMBER=1,
MONTH=sep,
YEAR=1980,
}

@ARTICLE{Ratz8009:Economic,
AUTHOR="H. C. Ratz and J. A. Field",
TITLE="Economic comparisons of data communication services",
JOURNAL=cn,
VOLUME=4,
PAGES="143-155",
MONTH=sep,
YEAR=1980,
}

@BOOK{Inve8009:CSNET,
AUTHOR="Lawrence H. Landweber",
TITLE="{CSNET,} The Computer Science Research Network",
PUBLISHER="proposal to the National Science Foundation",
MONTH=sep,
YEAR=1980,
}

@ARTICLE{Padu8009:High,
AUTHOR="D. Padua and D. Kuck and D. H. Lawrie",
TITLE="High-Speed Multiprocessors and Compilation Techniques",
JOURNAL=ieeetc,
VOLUME=29,
NUMBER=9,
PAGES="763-776",
MONTH=sep,
YEAR=1980,
KEYWORDS="multiprocessor ; compiler; compilation; dependence graph;
high-speed",
}

@INPROCEEDINGS{Bast8009:Optimal,
AUTHOR="E. Maal e and P. rkenyi",
TITLE="Optimal Routing of Circuits in a Telecommunications network. A
{LP-Formulation}",
BOOKTITLE="NOAK Conference on Operations Research",
ADDRESS="Reykjavik, Iceland",
PAGES=34,
MONTH=sep,
YEAR=1980,
KEYWORDS="Routing; routing algorithm; communication network",
}

@TECHREPORT{Peir8009:Mätningar,
AUTHOR="L. Peiram",
TITLE="Mätningar på L M Ericssons Datanät - Föredrag vid {NTS-3}",
TYPE="Internal Report",
INSTITUTION="L M Ericsson AB",
ADDRESS="Stockholm, Sweden",
NUMBER="Um80 057",
PAGES=10,
MONTH=sep,
YEAR=1980,
LANGUAGE="Swedish",
KEYWORDS="traffic measurement; data network",
}

@INPROCEEDINGS{Song8009:Protection,
AUTHOR="D. J. Songhurst",
TITLE="Protection Against Traffic Overload in Hierarchical Networks
Employing Alternative Routing",
BOOKTITLE="1st International Network Planning Symposium",
ADDRESS="Paris, France",
PAGES="214-220",
MONTH=sep,
YEAR=1980,
KEYWORDS="Overload control; alternate routing",
}

@INPROCEEDINGS{Stav8009:Economically,
AUTHOR="B. Stave and H. Pettersen",
TITLE="Economically Optimal Dimensioning of the Telephone Trunking
Network",
BOOKTITLE="NOAK Congress on Operations Research",
ADDRESS="Reykjavik, Iceland",
PAGES=38,
MONTH=sep,
YEAR=1980,
KEYWORDS="Network planning; junction network",
}

@ARTICLE{Bass8009:Local,
AUTHOR="C. Bass and J. S. Kennedy and J. Davidson",
TITLE="Local Network Gives New Flexibility to Distributed Processing",
JOURNAL="Electronics",
PAGES="114-122",
NOTE="also in \cite{Thur81:Tutorial}",
DAYS=25,
MONTH=sep,
YEAR=1980,
}

@INPROCEEDINGS{Cohe8010:Packet,
AUTHOR="Danny Cohen",
TITLE="On Packet Speech Communication",
BOOKTITLE="5th International Conference on Computer Communications",
ORGANIZATION="IEEE",
ADDRESS="Atlanta, Georgia",
PAGES="271-274",
MONTH=oct,
YEAR=1980,
KEYWORDS="packet voice",
ANNOTE="very basic introduction to issues in packet voice coding, mainly
low-rate codecs",
}

@INPROCEEDINGS{Jaya8010:Effects,
AUTHOR="Nuggehally S. Jayant",
TITLE="Effects of Packet Losses on Waveform-Coded Speech",
BOOKTITLE="5th International Conference on Computer Communications",
ORGANIZATION="IEEE",
ADDRESS="Atlanta, Georgia",
PAGES="275-280",
MONTH=oct,
YEAR=1980,
KEYWORDS="packet voice; packet loss; PCM; ADPCM",
ANNOTE="PCM and ADPCM; tolerable losses are 2 to 5\% without
interpolation and 5 to 10\% with interpolation; suggests zero-amplitude
stuffing and odd-even sample interpolation (best, but additional
delay)",
}

@ARTICLE{Morr8010:Overflow,
AUTHOR="J. A. Morrison",
TITLE="Analysis of Some Overflow Problems with Queueing",
JOURNAL=bstj,
VOLUME=59,
NUMBER=8,
PAGES="1427-1462",
MONTH=oct,
YEAR=1980,
KEYWORDS="queueing theory",
ABSTRACT="When calls offered to a primary group of trunks find all of
them busy, provisions are made for these calls to overflow to other
groups of trunks. Such traffic overflow systems have been of interest
for a long time, but recently overflow systems that allow for some calls
to be queued have been of importance. In this paper, the author analyzes
a traffic overflow system with queueing. The system consists of two
groups, a primary and a secondary. The author considers two cases which
differ in the treatment of demands waiting in the primary queue. The
author adapts a novel analytical approach, which considerably reduces
the dimensions of the problem and simplifies the calculation of various
steady-state quantities of interest. Our theoretical results include
expressions for the loss probabilities, the probability of overflow from
the primary to the secondary, and the average waiting times in the
queues.",
}

@ARTICLE{Morr8010:Traffic,
AUTHOR="J. A. Morrison",
TITLE="Some Traffic Overflow Problems with a Large Secondary Queue",
JOURNAL=bstj,
VOLUME=59,
NUMBER=8,
PAGES="1463-1482",
MONTH=oct,
YEAR=1980,
KEYWORDS="queueing theory",
ABSTRACT="When calls offered to a primary group of trunks find all of
them busy, provisions are made for these calls to overflow to other
groups of trunks. Such traffic overflow systems have been of interest
for a long time, but recently overflow systems that allow for some calls
to be queued have been of importance. In this paper, the author analyzes
a traffic overflow system with queueing. The system consists of two
groups, a primary and a secondary. The author considers two cases which
differ in the treatment of demands waiting in the primary queue. We
present an analytical approach which is suitable if the secondary queue
is large, or even infinite, and we contrast it with an earlier approach
of the author's which is more suitable if the secondary queue is not
large. The analysis considerably reduces the dimensions of the problem
and simplifies the calculation of various steady-state quantities of
interest. Our results include expressions for the loss probabilities,
the average waiting times in the queues, and the average number of
demands in service in each group.",
}

@INPROCEEDINGS{OLea8010:Local,
AUTHOR="Gerald C. O'Leary",
TITLE="Local access area facilities",
BOOKTITLE=iccc,
ORGANIZATION="iccc",
ADDRESS="Atlanta, Georgia",
PAGES="281-286",
MONTH=oct,
YEAR=1980,
KEYWORDS="packet voice",
ABSTRACT="An experimental packet voice local access network is being
developed to provide connectivity among voice terminals in a local area
and to provide these terminals with access to long-haul wideband packet
networks through a speech traffic concentrator. The network design is
based on a distributed architecture originally developed for local
computer communications. The details of the design have been modified to
take advantage of the special characteristics of voice traffic. The
network consists of a set of flexible, modular speech terminals
interconnected by a wideband cable, which provides broadcast
connectivity among the terminals. The network capability has been
demonstrated within the local access area. The local network is being
interfaced to a wideband packet satellite network.",
}

@INPROCEEDINGS{Hilt8010:System,
AUTHOR="Starr Roxanne Hiltz",
TITLE="The System is as the User Group Does",
BOOKTITLE="Annual Meeting of the American Society for Information
Science",
MONTH=oct,
YEAR=1980,
KEYWORDS="human factors",
}

@INPROCEEDINGS{Klei8010:Flow,
AUTHOR="L. Kleinrock and C. W. Tseng",
TITLE="Flow control based on limiting permit generation rates",
BOOKTITLE=iccc,
ADDRESS="Atlanta",
MONTH=oct,
YEAR=1980,
KEYWORDS="Computer network; flow control; packet switching; evaluation;
method; Markov process; network flow",
ANNOTE="Two new static flow control schemes for computer communication
networks are presented and analyzed. These schemes are based on
mechanisms for limiting the generation rate of permits on logical
channels between communicating users. Both open and closed queueing
network models are used in analyzing the behavior of these systems. The
schemes offer a new dimension in flow control. They are quite effective,
easy to implement, simple to analyze and a",
}

@INPROCEEDINGS{Lam8010:Experimental,
AUTHOR="S. S. Lam and Y. L. Liem",
TITLE="An experimental study of the congestion control of packet
communication networks",
BOOKTITLE=iccc,
ADDRESS="Atlanta",
MONTH=oct,
YEAR=1980,
KEYWORDS="Computer network; flow control; simulation",
}

@INPROCEEDINGS{Maru8010:Generation,
AUTHOR="K. Maruyama and G. Markowsky",
TITLE="On the Generation of Explicit Routing Tables",
BOOKTITLE=iccc,
ADDRESS="Atlanta",
PAGES="90-95",
MONTH=oct,
YEAR=1980,
REFERENCES=7,
KEYWORDS="Packet switching; SNA; routing algorithm",
ANNOTE="Explicit routing offers some good features for packet-switching.
This paper considers three table-driven explicit routing algorithms
depending on the information carried in the packet header and how the
packet is steered at all the intermediate nodes. These are the
origin-dependent algorithm, the origin-independent non-swap algorithm
and the origin-independent swap algorithm. This paper assumes that the
routes to be defined in the routing",
}

@INPROCEEDINGS{Petr8010:Verification,
AUTHOR="A. F. Petrenko",
TITLE="On the specification and verification of protocols using Petri
nets",
BOOKTITLE=iccc,
ADDRESS="Atlanta",
MONTH=oct,
YEAR=1980,
KEYWORDS="Protocol engineering; Petri net",
}

@INPROCEEDINGS{Radw8010:Tymnet,
AUTHOR="M. S. Radwin",
TITLE="Tymnet's Advanced Communications Technology and Recent
State-of-the-Art Service Introductions",
BOOKTITLE=iccc,
ADDRESS="Atlanta",
PAGES="113-118",
MONTH=oct,
YEAR=1980,
KEYWORDS="TYMNET; packet switching; network",
ANNOTE="This paper covers the background and history of Tymnet, Inc.;
reviews Tymnet's traditional service offerings, the key elements of its
Advanced Communications Technology, recent service enhancements, and the
direction of its future developments.",
}

@INPROCEEDINGS{Razo8010:Better,
AUTHOR="R. R. Razouk and G. Estrin",
TITLE="A better behaved {X.21} interface derived from {SARA} protocol
analysis",
BOOKTITLE=iccc,
MONTH=oct,
YEAR=1980,
KEYWORDS="Protocol engineering; X.21",
}

@INPROCEEDINGS{Rudi8010:Automated,
AUTHOR="Harry Rudin and  Walther and P. Zafiropoulo and D. D. Cowan and 
Link",
TITLE="Automated protocol synthesis via graphics",
BOOKTITLE=iccc,
MONTH=oct,
YEAR=1980,
KEYWORDS="Protocol engineering",
}

@PROCEEDINGS{Salz8010:Proc,
TITLE="iccc",
EDITOR="J. Salz",
PUBLISHER="North Holland",
ADDRESS="Atlanta",
MONTH=oct,
YEAR=1980,
KEYWORDS="computer networks; computer communications",
}

@ARTICLE{Mats8010:New,
AUTHOR="Y. Matsuo and K. Mizuashi and S. Kano",
TITLE="New common channel signaling system",
JOURNAL=jtr,
VOLUME=22,
NUMBER=4,
PAGES="300-307",
MONTH=oct,
YEAR=1980,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Pric8010:System,
AUTHOR="T. W. Prichard",
TITLE="System {X:} Subsystems, part 4 -- common-channel signalling and
the message transmission subsystem",
JOURNAL=poeej,
VOLUME=73,
PAGES="165-170",
MONTH=oct,
YEAR=1980,
KEYWORDS="Signalling; common channel; CCS",
}

@INCOLLECTION{Have8010:XNET,
AUTHOR="Jack Haverty",
TITLE="{XNET} Formats for {Internet} Protocol Version 4 {IEN} 158",
BOOKTITLE="DDN Protocol Handbook",
PUBLISHER="U. S. Department of Defense",
VOLUME=2,
PAGES="2-345 to 2-348",
MONTH=oct,
YEAR=1980,
}

@TECHREPORT{Pujo8010:Virtual,
AUTHOR="and O. Spaniol",
TITLE="The Virtual Subchannel Protocol for Satellite Link
Communications",
INSTITUTION="INRIA",
NUMBER=38,
MONTH=oct,
YEAR=1980,
}

@ARTICLE{McQu8010:Local,
AUTHOR="J. M. McQuillan",
TITLE="Local network technology and the lessons of history",
JOURNAL=cn,
VOLUME=4,
PAGES="235-238",
MONTH=oct,
YEAR=1980,
}

@INPROCEEDINGS{Warn8010:Connecting,
AUTHOR="C. Warner",
TITLE="Connecting local networks to long haul networks; Issues in
protocol design",
BOOKTITLE="5th Conference Local computer networks",
PUBLISHER="IEEE computer society",
PAGES="71-76",
MONTH=oct,
YEAR=1980,
}

@TECHREPORT{Lloy8010:Ring,
AUTHOR="P. J. Lloyd",
TITLE="The Ring and {Internet} Addressing",
TYPE="Internal Note",
INSTITUTION="UCL",
NUMBER=1003,
MONTH=oct,
YEAR=1980,
}

@ARTICLE{Anon8010:USPS,
AUTHOR="Anonymous",
TITLE="{USPS} to Implement E-Com Service",
JOURNAL=ccr,
VOLUME=10,
NUMBER=4,
MONTH=oct,
YEAR=1980,
}

@ARTICLE{Anon8010:Telecommunications,
AUTHOR="Anonymous",
TITLE="Telecommunications Act Rewrite Hits Snag",
JOURNAL=ccr,
VOLUME=10,
NUMBER=4,
MONTH=oct,
YEAR=1980,
}

@ARTICLE{Anon8010:IFIP,
AUTHOR="Anonymous",
TITLE="{IFIP} Working Group 6.1 Report",
JOURNAL=ccr,
VOLUME=10,
NUMBER=4,
MONTH=oct,
YEAR=1980,
}

@ARTICLE{Kenn8010:Clarification,
AUTHOR="J. S. Kennedy",
TITLE="Clarification of Net/One Performance",
JOURNAL=ccr,
VOLUME=10,
NUMBER=4,
MONTH=oct,
YEAR=1980,
}

@ARTICLE{Cerf8010:Protocols,
AUTHOR="V. G. Cerf",
TITLE="Protocols for Interconnected Packet Networks",
JOURNAL=ccr,
VOLUME=10,
NUMBER=4,
MONTH=oct,
YEAR=1980,
}

@ARTICLE{Anon8010:DoD1,
AUTHOR="Anonymous",
TITLE="{DoD} Standard {Internet} Protocol",
JOURNAL=ccr,
VOLUME=10,
NUMBER=4,
MONTH=oct,
YEAR=1980,
}

@ARTICLE{Anon8010:DoD2,
AUTHOR="Anonymous",
TITLE="{DoD} Standard Transmission Control Protocol",
JOURNAL=ccr,
VOLUME=10,
NUMBER=4,
MONTH=oct,
YEAR=1980,
}

@ARTICLE{Kimu8010:Single,
AUTHOR="Takumi Kimura",
TITLE="Single Mode Digital Transmission Technology",
JOURNAL=ieeeproc,
VOLUME=68,
NUMBER=10,
MONTH=oct,
YEAR=1980,
}

@ARTICLE{Li8010:Structures,
AUTHOR="Tongtong Li",
TITLE="Structures, Parameters and Transmission Properties of Optical
Fibres",
JOURNAL=ieeeproc,
VOLUME=68,
NUMBER=10,
PAGES="1175-1180",
MONTH=oct,
YEAR=1980,
}

@ARTICLE{Ackr8011:Iterative,
AUTHOR="M. H. Ackroyd",
TITLE="Iterative Computation of the {$M/G/1$} Queue Length Distribution
Via the Discrete Fourier Transform",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=11,
PAGES="1929-1932",
MONTH=nov,
YEAR=1980,
KEYWORDS="queueing theory",
ABSTRACT="An iterative method is presented by which the distribution of
queue lengths in the $M/G/1$ queue may be computed. The method applies
to the nonsteady-state [transient] case and involves repeatedly
performing convolutions. The steady state solution may be obtained by
performing the iterations until convergence occurs. A frequency-domain
equivalent of the method is presented which gives much greater
computational economy.",
}

@ARTICLE{Fisc8011:Delay,
AUTHOR="M. J. Fischer",
TITLE="Delay analysis of {TASI} with random fluctuations in the number
of voice calls",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=11,
PAGES="1883-1889",
MONTH=nov,
YEAR=1980,
KEYWORDS="speech communications; TASI; packet voice; multiplexer",
ABSTRACT="In this paper we consider a system where the talkspurts from
several voice conversations are buffered and multiplexed over the same
transmission channels. A simple mathematical model is given for the case
where the number of voice calls may statistically come and go. This
model is then used to numerically analyze the system and make
comparisons with previously presented results.",
}

@ARTICLE{Chu8011:Task,
AUTHOR="Wesley W. Chu and Leslie J. Holloway and Min-Tsung Lan and Kemal
Efe",
TITLE="Task Allocation in Distributed Data Processing",
JOURNAL=ieeecomp,
VOLUME=13,
NUMBER=11,
PAGES="57-69",
MONTH=nov,
YEAR=1980,
}

@TECHREPORT{Reis8011:Significance,
AUTHOR="M. Reiser",
TITLE="The Significance of the Decomposition and the Arrival Theorems
for the Evaluation of Closed Queueing Networks",
INSTITUTION="IBM Research Report",
ADDRESS="Rüschlikon",
NUMBER="RZ-1047",
PAGES="1-25",
MONTH=nov,
YEAR=1980,
KEYWORDS="Queueing network; product form; analysis",
}

@TECHREPORT{Jone8011:GGP,
AUTHOR="R. G. Jones",
TITLE="{GGP} Echo Delay Measurements",
TYPE="Internal Note",
INSTITUTION="UCL",
NUMBER=1018,
MONTH=nov,
YEAR=1980,
}

@TECHREPORT{Lloy8011:Cambridge,
AUTHOR="P. J. Lloyd",
TITLE="A Cambridge {Ring-SATNET} Datagram Gateway",
TYPE="Internal Note",
INSTITUTION="UCL",
NUMBER=1034,
MONTH=nov,
YEAR=1980,
}

@TECHREPORT{Nels8011:ARPAnet,
AUTHOR="H. A. Nelson and J. E. Mathis",
TITLE="The {ARPAnet} {IMP} Port Expander",
INSTITUTION="SRI International",
NUMBER="TR 1080-140-1",
MONTH=nov,
YEAR=1980,
}

@TECHREPORT{Mink8011:Analytic,
AUTHOR="A. Mink",
TITLE="An Analytic Study of a Shared Device Among Independent Computing
Systems",
TYPE="Special Publication",
INSTITUTION="NBS",
NUMBER="500-69",
PAGES=166,
MONTH=nov,
YEAR=1980,
KEYWORDS="Computer network",
}

@ARTICLE{Haug8012:Queueing,
AUTHOR="R. B. Haugen and E. Skogan",
TITLE="Queueing Systems with Stochastic Time Out",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=12,
PAGES="1984-1989",
MONTH=dec,
YEAR=1980,
KEYWORDS="queueing theory; bounded waiting time; M/M/c",
ANNOTE="M/M/c with stochastic time-out",
}

@ARTICLE{Jone8012:Efficient,
AUTHOR="S. K. Jones and III Cavin and D. A. Johnston",
TITLE="Efficient Computational Procedure for the {$M/M/1$} Transient
State Occupancy Probabilities",
JOURNAL=ieeecom,
VOLUME="COM-28",
NUMBER=12,
PAGES="2019-2020",
MONTH=dec,
YEAR=1980,
KEYWORDS="queueing theory",
ABSTRACT="In this note a procedure is given for the numerical evaluation
of the $M/M/1$ queue transient state occupancy probabilities which arise
in the analysis of dynamic buffer behavior in store and forward
networks. The procedure uses the circular coverage function of radar and
communication theory to eliminate an infinite series of modified Bessel
functions. Computational savings are illustrated by several numerical
examples.",
}

@ARTICLE{Kerm8012:Tradeoff,
AUTHOR="Parviz Kermani and L. Kleinrock",
TITLE="A Tradeoff Study of Switching Systems In Computer Communication
Networks",
JOURNAL=ieeetc,
VOLUME="C-29",
NUMBER=12,
PAGES="1052-1060",
MONTH=dec,
YEAR=1980,
}

@INPROCEEDINGS{Brya8012:SIMPAS,
AUTHOR="R. M. Bryant",
TITLE="{SIMPAS:} A simulation language based on {PASCAL}",
BOOKTITLE=wsc,
EDITOR="T. I. Ören and C. M. Shub and P. F. Roth",
ADDRESS="Orlando, Florida",
PAGES="25-40 (paper 1)",
MONTH=dec,
YEAR=1980,
KEYWORDS="Simulation; simulation language",
}

@ARTICLE{Saad8012:Variations,
AUTHOR="Y. Saad",
TITLE="Variations of Arnoldi's method for computing eigenelements of
large unsymmetric matrices",
JOURNAL="Linear Algebra and its Applications",
VOLUME=34,
PAGES="269-295",
MONTH=dec,
YEAR=1980,
KEYWORDS="Eigenvalue; linear equation",
}

@INPROCEEDINGS{Shub8012:Discrete,
AUTHOR="C. M. Shub",
TITLE="Discrete event simulation languages",
BOOKTITLE=wsc,
EDITOR="T. I. Ören and C. M. Shub and P. F. Roth",
ADDRESS="Orlando, Florida",
PAGES="107-124",
MONTH=dec,
YEAR=1980,
KEYWORDS="Simulation; simulation language",
}

@ARTICLE{Tadi8012:Look,
AUTHOR="P. R. Tadikamalla",
TITLE="A look at the Burr and related distributions",
JOURNAL="International Statistical Review",
VOLUME=48,
NUMBER=3,
PAGES="337-344",
MONTH=dec,
YEAR=1980,
KEYWORDS="random variate generation",
}

@TECHREPORT{Lerm8012:Detecting,
AUTHOR="C. W. Lermen and F. Schneider",
TITLE="Detecting Distributed Termination When Processors Can Fail",
INSTITUTION="Cornell University, Computer Science Department",
NUMBER="TR80-449",
PAGES=41,
MONTH=dec,
YEAR=1980,
ABSTRACT="A collection of protocols to facilitate detection of the
termination of a computation on a distributed system are developed.
Communication is assumed to be accomplished by use of asynchronous
broadcasting. It is argued that this is a reasonable assumption for a
distributed system in light of advances in local networking. The
protocols presented are all robust with respect to processor failures.
They differ in their requirements - some make heavy use of the
communications network at the end of a computation, while others spread
the communications cost out through the computation. Problems of
restarting failed processors are also addressed.",
}

@INPROCEEDINGS{Lai8012:Recursive,
AUTHOR="W. S. Lai",
TITLE="Recursive Models of Traffic Control in Communication Networks",
BOOKTITLE="Computer Networking Symposium",
ADDRESS="Gaithersburg, USA",
PAGES="161-169",
MONTH=dec,
YEAR=1980,
KEYWORDS="Traffic control",
}