@BOOK{Giff78:Queueing,
AUTHOR="Walter C. Giffin",
TITLE="Queueing: Basic Theory and Applications",
PUBLISHER="Grid",
ADDRESS="Columbus, Ohio",
YEAR=1978,
KEYWORDS="queueing theory",
ANNOTE="Computational methods for Markov chains.",
}

@ARTICLE{Kaul78:High,
AUTHOR="A. K. Kaul",
TITLE="Performance of High-Level Data Link Control in Satellite
Communications",
JOURNAL=comsat,
VOLUME=8,
PAGES="41-88",
MONTH="Spring",
YEAR=1978,
KEYWORDS="error control; ARQ",
ABSTRACT="Analytic models are presented for predicting the performance
of high-level data link control (HDLC) protocols, recently adopted as a
standard by the International Standards Organization. These models,
derived for satellite data communications, are also applicable to
terrestrial data links and allow the evaluation of throughput
efficiencies of computer communications links using HDLC. In addition,
they have been used to estimate the maximum achievable throughput over a
wide range of data transmission rates and bit error rates. The results
and the tradeoffs presented will provide system designers with useful
mathematical tools for selecting the optimal HDLC implementation for a
particular application.",
ANNOTE="correlated and uncorrelated errors.",
}

@ARTICLE{Morr7805:Combinatorial,
AUTHOR="J. A. Morrison",
TITLE="A Combinatorial Lemma and Its Application to Concentrating Trees
of Discrete-Time Queues",
JOURNAL=bstj,
VOLUME=57,
NUMBER=5,
PAGES="1645-1652",
MONTH="May-June",
YEAR=1978,
KEYWORDS="discrete time queue",
ABSTRACT="Concentrating rooted tree networks of discrete-time single
server queues, all with unit service time, are considered. Such networks
occur as subnetworks connecting remote access terminals to a node in a
data communications network. It is shown that the network of queues may
be replaced by a single queue, with prescribed input, which has the same
output as the queue at the root of the tree. The result is applied, in
particular, to the case of several queues in tandem, and it is shown how
this problem may be reduced to that of just two queues in tandem. The
latter problem was analyzed earlier by the author.",
}

@BOOK{Rabi78:Digital,
AUTHOR="L. R. Rabiner and R. W. Schafer",
TITLE="Digital Processing of Speech Signals",
ISBN="0-13-213603-1",
PUBLISHER="Prentice-Hall",
ADDRESS="Englewood Cliffs, New Jersey",
YEAR=1978,
ANNOTE="Section 4.4: Speech vs. Silence discrimination using energy and
zero-crossings (p. 130ff)",
}

@BOOK{Ferr78:Computer,
AUTHOR="D. Ferrari",
TITLE="Computer Systems Performance Evaluation",
PUBLISHER="Prentice-Hall",
YEAR=1978,
}

@ARTICLE{Cohe7809:Protocol,
AUTHOR="Danny Cohen",
TITLE="A protocol for packet-switching voice communication",
JOURNAL=cn,
VOLUME=2,
NUMBER="4/5",
PAGES="320-331",
MONTH="September/October",
YEAR=1978,
KEYWORDS="packet voice; NVP; real-time communication",
ABSTRACT="This paper discusses the issues associated with real-time
voice communication over packet switched networks. It suggests an
approach for the design of a protocol to support this application. The
ARPA Network Voice Protocol is presented as an example of such a
protocol. In addition, two extensions to it are discussed. Most of the
issues which are discussed in the context of the NVP, like separation of
control from data, device independence, and performance monitoring are
not unique only to voice applications, but apply equally to any other
real-time protocol. The major virtue of the real-time voice
communication as far as networking is concerned is the real-time, not
the voice, aspect of this communication.",
ANNOTE="discusses silent bit (at either end of talkspurt, first packet
chosen)",
}

@INPROCEEDINGS{Kuo78:Message,
AUTHOR="F. F. Kuo",
TITLE="Message Services in Computer Networks",
BOOKTITLE="Interlinking of Computer Networks",
EDITOR="Kenneth G. Beauchamp",
PUBLISHER="D. Reidel Publishing Company",
ADDRESS="University of Lancaster, UK",
PAGES="387-395",
NOTE="Proceedings of the NATO Advanced Study Institute held at Bonas,
France, August 28 -- September 8, 1978",
YEAR=1978,
KEYWORDS="computer messaging systems; electronic mail",
ABSTRACT="In this paper we discuss the key issues in the generation and
distribution of messages in a computer network. The principal issues
are: user support, privacy and security, addressing, and standards and
regulations. Examples of current message systems on the ARPAnet are
discussed.",
}

@BOOK{Hilt78:Nation,
AUTHOR="Starr Roxanne Hiltz and Murray Turoff",
TITLE="The Network Nation: Human Communication via Computer",
PUBLISHER="Addison Wesley",
ADDRESS="Reading, Massachusetts",
PAGES=528,
YEAR=1978,
KEYWORDS="computer conferencing",
ABSTRACT="One of the first books on computer conferencing by two of the
leaders in the field (Hiltz is a Sociologist and Turoff a Computer
Scientist). Heavily oriented to case histories using the EIES system
(Electronic Information Exchange System, New Jersey Institute of
Technology), the book covers essentially all aspects of the subject. It
is a bit dated in some areas but is sufficiently comprehensive and
skillfully written that it remains a good overall reference text.
Includes some early history of conferencing, comparisons with other
types of communication (mostly scientific), social and psychological
processes, impacts on managerial functions, uses by handicapped or
disadvantaged, uses by the public, science and technology effects,
research options dealing with computer conferencing, future
communications issues and economics/regulations, human-machine
interface, and broad societal impacts. Many chapters are written in
textbook style, with selected questions/topics for further discussion.
Brief ``newspaper articles'' are interspersed with the chapters and are
written from the perspective of 10-15 years after publication date
(1978).",
}

@ARTICLE{Turo78:EIES,
AUTHOR="Murray Turoff",
TITLE="The {EIES} Experience: Electronic Information Exchange System",
JOURNAL=basis,
VOLUME=4,
NUMBER=5,
PAGES="9-10",
YEAR=1978,
KEYWORDS="computer conferencing",
}

@MISC{Turo78:Information,
AUTHOR="Murray Turoff and Starr Roxanne Hiltz",
TITLE="Information and Communications in International Affairs",
NOTE="Paper presented to International Studies Association, Toronto,
Canada",
YEAR=1978,
KEYWORDS="computer conferencing",
}

@ARTICLE{Hilt78:Computer,
AUTHOR="Starr Roxanne Hiltz",
TITLE="The Computer Conference",
JOURNAL="Journal of Communication",
VOLUME=28,
NUMBER=3,
PAGES="157-163",
YEAR=1978,
KEYWORDS="computer conferencing",
}

@ARTICLE{Hilt78:Controlled,
AUTHOR="Starr Roxanne Hiltz",
TITLE="Controlled Experiments with Computerized Conferencing",
JOURNAL=basis,
VOLUME=4,
NUMBER=5,
PAGES="11-12",
YEAR=1978,
KEYWORDS="computer conferencing; human factor",
}

@TECHREPORT{Hilt78:Operational,
AUTHOR="Starr Roxanne Hiltz",
TITLE="The Operational Trials of the {EIES:} An Overview of the Nature,
Purpose and Initial Findings",
INSTITUTION="New Jersey Institute for Technology Computerized
Conferencing and Communications Center",
ADDRESS="Newark, New Jersey",
YEAR=1978,
KEYWORDS="computer conferencing",
}

@ARTICLE{Hilt78:Human,
AUTHOR="Starr Roxanne Hiltz",
TITLE="The Human Element in Computerized Systems",
JOURNAL=cn,
VOLUME=2,
PAGES="421-428",
YEAR=1978,
KEYWORDS="human factors",
}

@MISC{Hilt78:Electronic,
AUTHOR="Starr Roxanne Hiltz and Murray Turoff",
TITLE="Electronic Networks: The Social Dynamics of a New Communications
Medium",
NOTE="Paper presented to {American Sociology Association Seminar on
Social Networks, San Francisco}",
YEAR=1978,
KEYWORDS="human factor; social implications; computer conferencing",
}

@BOOK{Heyd78:Computer,
AUTHOR="Richard Heydinger",
TITLE="Computer Conferencing: Its Use as a Pedagogical Tool",
PUBLISHER="World Future Society",
PAGES=25,
YEAR=1978,
KEYWORDS="computer conferencing",
ABSTRACT="Describes applications of conferencing in institutions of
higher education. Examples based on CONFER conferencing system at the
University of Michigan. Discusses the use in courses (allowing more
flexibility), greater communication (among student, their peers, and
instructors), and applications to interdisciplinary courses and graduate
seminars (where mixed resources are enhanced using this technique).
Disadvantages include learning new techniques, finding terminal access,
and computer phobia.",
}

@ARTICLE{Smit78:New,
AUTHOR="David Burton Smith",
TITLE="A new proof of the optimality of the shortest remaining
processing time discipline",
JOURNAL=or,
VOLUME=26,
PAGES="197-199",
YEAR=1978,
REFERENCES=1,
KEYWORDS="G/G/1; number of elements in system; comparison",
ANNOTE="We present a new proof of the fact that for a work-conserving
queue, the queueing discipline that always serves a job with the
shortest remaining processing time minimizes the number of jobs in the
system.",
}

@BOOK{Wake78:Error,
AUTHOR="J. F. Wakerly",
TITLE="Error detecting codes, self-checking circuits and applications",
PUBLISHER="North Holland",
ADDRESS="Amsterdam, Holland",
PAGES=224,
YEAR=1978,
KEYWORDS="Error-correcting code",
ANNOTE="Introduction; Error-detecting codes; Self-checking circuits;
Detection of errors in data paths and memory; Detection of errors in
arithmetic operations; Detection of errors in logical operations;
Detection unit errors; Examples of self-checking processors; Index.",
}

@BOOK{Walk78:Realzeitrechner,
AUTHOR="B. Walke",
TITLE="Realzeitrechner-Modelle",
PUBLISHER="Oldenbourg-Verlag",
ADDRESS="München, Germany",
PAGES=240,
YEAR=1978,
LANGUAGE="German",
REFERENCES=120,
KEYWORDS="Queueing system; scheduling; priority",
}

@TECHREPORT{Wizg78:Gesichtspunkte,
AUTHOR="M. Wizgall",
TITLE="Gesichtspunkte der Integration von Kommunikationsdiensten",
INSTITUTION="PKI OG",
ADDRESS="Nürnberg, Germany",
PAGES=21,
YEAR=1978,
LANGUAGE="German",
KEYWORDS="survey; future outlook; digital network; service",
ANNOTE="1. Kommunikationsdienste; 2. Arten der integration; 3.
Diensterreichbarkeit",
}

@ARTICLE{Wong78:Queueing,
AUTHOR="J. W. Wong",
TITLE="Queueing network modeling of computer communication networks",
JOURNAL=acmcs,
VOLUME=10,
PAGES="343-351",
YEAR=1978,
REFERENCES=29,
KEYWORDS="Queueing network; communication network; flow control",
ABSTRACT="The application of queueing network models to the performance
analysis of message-switched (or packet-switched) communication networks
is surveyed. The main topics covered are the analysis of end-to-end
delay and the analysis of the buffer management schemes. A brief
discusion on flow control is also included. A queueing network model is
developed for a simple user-resource network. The mean response time of
a host computer in this network is \ldots",
}

@ARTICLE{Wong78:Distribution,
AUTHOR="J. W. Wong",
TITLE="Distribution of end-to-end delay in message-switched networks",
JOURNAL=cn,
VOLUME=2,
PAGES="44-49",
YEAR=1978,
REFERENCES=8,
KEYWORDS="Computer network; message switching; network delay",
ANNOTE="An open queueing network model is used to derive the
distribution of end-to-end delay in message-switched network. It is
shown that under fixed routing, the end-to-end delay of messages
belonging to a particular source-destination node pair is given by a sum
of independent and exponentially distributed random variables. The
generalization of this basic result to random routing and to messages
belonging to a group of source-destination pairs",
}

@ARTICLE{Ming78:Distributed,
AUTHOR="T. L. Ming",
TITLE="Distributed Loop Computer Networks",
JOURNAL="Advances in Computers",
VOLUME=17,
PAGES="163-221",
YEAR=1978,
REFERENCES=122,
KEYWORDS="Distributed processing; survey; result; loop system",
ANNOTE="The article presents both an expository survey and research
results on local computer networks in general and loop computer networks
in particular. Different types of local loop computer networks are
surveyed along with typical design problem areas and performance
studies.",
}

@ARTICLE{Dola78:Incentive,
AUTHOR="R. J. Dolan",
TITLE="Incentive Mechanisms for Priority Queueing Problems",
JOURNAL="Bell Journal of Economics",
VOLUME=9,
YEAR=1978,
}

@INCOLLECTION{Stro78:Urban,
AUTHOR="R. Strotz",
TITLE="Urban Transportation Parables",
BOOKTITLE="Public Economy of Urban Communities",
EDITOR="J. Margolis",
PUBLISHER="Resources for the Future",
ADDRESS="Washington, D.C.",
YEAR=1978,
}

@BOOK{Achi78:Fourier,
AUTHOR="D. Achilles",
TITLE="Die Fourier-Transformation in der Signalverarbeitung",
PUBLISHER="Springer Verlag",
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Mathematics",
}

@ARTICLE{Alex78:Bit,
AUTHOR="N. Alexandridis",
TITLE="Bit-sliced microprocessor architecture",
JOURNAL=ieeetc,
VOLUME="C-28",
PAGES="56-80",
YEAR=1978,
KEYWORDS="CPU; architecture",
}

@BOOK{Alle78:Probability,
AUTHOR="A. O. Allen",
TITLE="Probability; statistics and queueing theory with computer science
applications",
ISBN="0-12-051050-2",
PUBLISHER="Academic Press",
ADDRESS="New York",
YEAR=1978,
KEYWORDS="Queueing system; queueing theory",
}

@BOOK{Alle78:Anatomy,
AUTHOR="J. R. Allen",
TITLE="Anatomy of {LISP}",
PUBLISHER="MC GRAW-HILL BOOK",
ADDRESS="New York",
PAGES="1-446",
YEAR=1978,
KEYWORDS="Programming language; survey; LISP",
ANNOTE="This is a very good book. It is certainly the best book I have
seen on LISP. It covers important material which is not formally covered
in any other single source and which has become part of the tradition
and folklore of computer science. In addition, the author has supplied
an excellent bibliography of the important literature surrounding these
traditions and folklore.",
}

@ARTICLE{Bake78:Subsysteme,
AUTHOR="W. Bäker",
TITLE="Subsysteme mit Mikroprozessoren in {DVA}",
JOURNAL=siemensfe,
VOLUME=7,
PAGES="363-",
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Switching system; architecture; microprocessor",
}

@BOOK{Barr78:Scientists,
AUTHOR="R. Barras",
TITLE="Scientists must write - a guide to better writing for scientists,
engineers and students",
PUBLISHER="Chapman and Hall",
ADDRESS="London",
PAGES="1-176",
YEAR=1978,
REFERENCES=41,
KEYWORDS="Documentation; presentation",
ANNOTE="Contents: 1. Scientists must write. 2. Personal records. 3.
Communications. 4. How scientists should write. 5. Think - plan - write
- revise. 6. Thoughts into words. 7. Using words. 8. Helping the reader.
9. Numbers contribute to precision. 10. Illustrations contribute to
clarity. 11. Reading. 12. Reports and theses. 13. Preparing a report on
an investigation. 14. Talking about science.",
}

@TECHREPORT{Behr78:Petri,
AUTHOR="J. P. Behr",
TITLE="Petri-Netze und ihre Beziehungen zu Auswertenetzen",
INSTITUTION="Philips Forschungslabor",
ADDRESS="Hamburg, Germany",
VOLUME="134/78",
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Petri net; simulation; FORCASD",
}

@MASTERSTHESIS{Behr78:Generatorprogramm,
AUTHOR="W. Behrens",
TITLE="Ein Generatorprogramm für Simulationsmodelle auf Pro-Net Basis",
SCHOOL="Universität Dortmund, Informatik IV (Beilner)",
ADDRESS="Dortmund, Germany",
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Petri net; simulation",
ANNOTE="Auszug aus der DA",
}

@ARTICLE{Benn78:Measurements,
AUTHOR="C. J. Bennett and A. J. Hinchley",
TITLE="Measurements of Transmission Control Protocol",
JOURNAL=cn,
VOLUME=2,
PAGES="396-408",
YEAR=1978,
REFERENCES=19,
KEYWORDS="TCP/IP; traffic generator; time stamp; remote control",
ANNOTE="cited in Stehr 87",
}

@ARTICLE{Beut78:Decomposition,
AUTHOR="F. J. Beutler and B. Melamed",
TITLE="Decomposition and customer streams of feedback networks of queues
in equilibrium",
JOURNAL=or,
VOLUME=26,
PAGES="1059-1072",
YEAR=1978,
REFERENCES=10,
KEYWORDS="Exponential queueing network; feedback; M/M/1; Jackson net",
ANNOTE="Burke and reich independently showed that the output of an M/M/1
queue in equilibrium is a poisson process. Consequently, analysis of
series (tandem) exponential servers with a poisson input stream can be
reduced to consideration of a series of M/M/1 queues. This work
generalizes the above results to so-called jackson networks, consisting
of exponential servers with mutually independent poisson exogenous
inputs and random customer routings perm",
}

@ARTICLE{Bock78:Grenzen,
AUTHOR="P. Bocker",
TITLE="Möglichkeiten und Grenzen von Paketvermittlungsnetzen",
JOURNAL="Telcom-Report",
ADDRESS="München",
VOLUME=1,
PAGES="110-117",
YEAR=1978,
LANGUAGE="German",
REFERENCES=18,
KEYWORDS="Packet switching; survey; X.25; HDLC; bibliography; existing
network",
ANNOTE="Wenn man Datenfernverarbeitungssysteme einrichten will, hat man
fuer die Datenübertragung im wesentlichen zwei Möglichkeiten: man
benutzt ein bestehendes Wählnetz, oder man setzt sich sein System mit
Hilfe von Standleitungen zusammen (Bild 1). Hierzu ist etwa seit einem
Jahrzehnt die möglichkeit getreten, eigenständige Datenwählnetze zu
benutzen (1). Diese kann man in zwei Gruppen gliedern, die
Durchschaltenetze",
}

@TECHREPORT{Börg78:PIX,
AUTHOR="J. Börger and G. Schulze",
TITLE="The {PIX} virtual terminal protocol",
INSTITUTION="GMD",
ADDRESS="Bonn, Germany",
PAGES=34,
YEAR=1978,
REFERENCES=8,
KEYWORDS="communication protocol; session layer; virtual terminal
protocol",
ANNOTE="The PIX virtual terminal protocol is based on a general model of
interprocess communication and describes how this model is used to fit
the requirements of terminal control.",
}

@INPROCEEDINGS{Bux78:Results,
AUTHOR="W. Bux and K. Kümmerle and H. L. Truong",
TITLE="Results on the performance of balanced {HDLC} procedures",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
ADDRESS="Birmingham, Alabama",
PAGES="1-7",
YEAR=1978,
REFERENCES=10,
KEYWORDS="HDLC; simulation; performance evaluation; link layer",
ANNOTE="The high-level data-link controlled (HDLC) balanced class of
procedure is intended: (1) for use on links carrying heavy traffic
volumes where delays and link efficiency are important factors, and (2)
for situations which require equal control capability at both ends of
the link. The prime objective of the present paper is to analyze the
performance of this class of procedure, i.e., to quantitatively study
the interaction among a multiplicity of",
}

@ARTICLE{Cave78:Fast,
AUTHOR="J. K. Cavers",
TITLE="On the Fast Fourier Transform Inversion of Probability generating
Functions",
JOURNAL="Journal Institute Mathematics and Applications",
PUBLISHER="Academic Press",
VOLUME=22,
PAGES="275-282",
YEAR=1978,
REFERENCES=8,
KEYWORDS="Mathematics",
}

@ARTICLE{Chan78:Nontrivial,
AUTHOR="K. M. Chandy and J. Misra",
TITLE="A nontrivial example on concurrent processing: distributed
simulation",
JOURNAL=ieeeproc,
YEAR=1978,
REFERENCES=5,
KEYWORDS="Distributed simulation",
}

@ARTICLE{Chan78:Approximate,
AUTHOR="K. M. Chandy and C. H. Sauer",
TITLE="Approximate methods for analyzing queueing networks models of
computing systems",
JOURNAL=acmcs,
VOLUME=10,
PAGES="281-317",
YEAR=1978,
REFERENCES=62,
KEYWORDS="Queueing network; queueing approximation; diffusion
approximation; decomposition",
ANNOTE="It is the contention of this paper that queueing network models
with credible assumptions can be solved approximately to provide
credible performance estimates at low costs. This contention is
supported by examples of approximate solutions of queueig network
models. Two major approaches to approximate solutions, aggregation
(decomposition) and diffusion, are discussed.",
}

@ARTICLE{Chow78:Testing,
AUTHOR="T. S. Chow",
TITLE="Testing Software Design Modeled by Finite-State Machines",
JOURNAL=ieeese,
VOLUME="SE-4",
NUMBER=3,
PAGES="178-187",
YEAR=1978,
REFERENCES=17,
KEYWORDS="Protocol testing",
}

@ARTICLE{Delo78:Programmieren,
AUTHOR="W. R. Delong",
TITLE="Programmieren mit einem schnellen Spezialrechner",
JOURNAL=siemensfe,
ADDRESS="München",
VOLUME=7,
PAGES="204-",
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Computer architecture",
}

@ARTICLE{Denn78:Operational,
AUTHOR="P. J. Denning and J. P. Buzen",
TITLE="The operational analysis of queueing network models",
JOURNAL=acmcs,
VOLUME=10,
PAGES="225-261",
YEAR=1978,
REFERENCES=72,
KEYWORDS="Survey; reference; Queueing network; operational analysis",
ANNOTE="The early sections describe the nature of queueing network
models and their applications for calculating and predicting performance
quantities. The basic performance quantities, such as utilizations, mean
queue lengths, and mean response times, are defined and operational
relationships among them are derived. Following this, the concept of job
flow balance is introduced and used to study asymptotic throughputs and
response times.",
}

@ARTICLE{Donn78:Tendenzen,
AUTHOR="H. Donner",
TITLE="Tendenzen für die Architektur von Rechensystemen",
JOURNAL="NTG-Fachberichte",
VOLUME=62,
PAGES="21-38",
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Computer architecture; future outlook; large computer",
ANNOTE="Es wird versucht, die wichtigsten zu erwartenden tendenzen
aufzuzeigen. Betrachtet werden rechensysteme der sogenannten mittle ren
bis grossen leistungsklasse fuer die nächsten produkt-generationen.
Dabei bilden kompatibilitäts-gesichtspunkte wichtige randbedingungen.
Die ursachen fuer potentielle entwicklungen werden skizziert. Abschnitt
4 zeigt mögliche lösungsansätze, die beispielhaften charakter haben.
Wichtiges wie verbund-netze,",
}

@TECHREPORT{Egen78:Verfahren,
AUTHOR="F. J. Egenolf",
TITLE="Verfahren zur Entnahme von Stichproben mit unabhängigen Elementen
aus Zeitreihen stationärer stochastischer Folgen, wie sie bei der
Simulation von Wartesystemen entstehen",
TYPE="DFV-Bericht",
INSTITUTION="Lehrstuhl für Allgemeine Elektrotechnik und
Datenfernverarbeitung, RWTH Aachen",
ADDRESS="Aachen",
PAGES="1-12",
YEAR=1978,
LANGUAGE="German",
REFERENCES=7,
KEYWORDS="Mechanic McKay sampling; independent cycles; correlation;
estimation; Bayes statistics; Student distribution; validation; queueing
system",
ANNOTE="1. Begriffsdefinition 2. Ergebnisse und zweck einer
warteschlangensimulation 3. Die notwendigkeit unabhängiger stichprobene
lemente 4. Verfahren zur entnahme unabhängiger stichprobenele mente 5.
Literatur",
}

@ARTICLE{Enge78:Real,
AUTHOR="G. P. Engelberg and J. A. Howard and D. A. Mellichamp",
TITLE="A real-time simulation of a hierarchical computer network for
process control",
JOURNAL="Simulation",
PAGES="37-",
YEAR=1978,
KEYWORDS="Simulation; computer network",
}

@ARTICLE{Fied78:Realisierung,
AUTHOR="H. Fiedler",
TITLE="Realisierung sequentieller Logik mit dem Programmierbaren
Schaltwerk",
JOURNAL=siemensz,
VOLUME=52,
PAGES="624-627",
YEAR=1978,
LANGUAGE="German",
KEYWORDS="FSM; finite state machine; sequencer",
}

@BOOK{Fish78:Principles,
AUTHOR="G. S. Fishman",
TITLE="Principles of discrete event simulation",
PUBLISHER="John Wiley",
ADDRESS="New York",
PAGES=500,
YEAR=1978,
REFERENCES=162,
KEYWORDS="Simulation",
}

@TECHREPORT{Fish78:Statistical,
AUTHOR="G. S. Fishman and L. R. Moore",
TITLE="A statistical evaluation of multiplicative congruential
generators with modulus 2**31-1",
INSTITUTION="University of North Carolina",
ADDRESS="Chapel Hill",
NUMBER="78-11",
YEAR=1978,
REFERENCES=19,
KEYWORDS="random number generation; test; comparison; runtime
efficiency; storage efficiency; multidimensional uniformity; shift
register sequences",
ANNOTE="This paper presents the results of empirically testing eight
alternative multipliers for a multiplicative congruential generat or
with modulus 2**31-1.",
}

@ARTICLE{Fosc78:Basic,
AUTHOR="G. J. Foschini and J. Salz",
TITLE="A Basic Dynamic Routing Problem and Diffusion",
JOURNAL=ieeecom,
VOLUME="COM-26",
NUMBER=3,
PAGES="320-327",
YEAR=1978,
REFERENCES=34,
KEYWORDS="Routing algorithm; diffusion approximation; dynamic routing",
ANNOTE="Diffusion theory has sometimes been successful in providing
excellent approximate solutions to difficult queueing problems. Here we
explore whether such methods can be used to analyze a basic dynamic
routing strategy associated with a single idealized node in a data
network. We analyze a dynamic routing policy where messages, or packets,
that arrive at a certain node are routed to leave the node on the link
having the shorter queue. In the",
}

@ARTICLE{Fox78:Algorithm,
AUTHOR="P. A. Fox and A. D. Hall and N. L. Schryer",
TITLE="Algorithm 528, framework for a portable library {(Z)}",
JOURNAL=toms,
VOLUME=4,
PAGES="177-188",
YEAR=1978,
REFERENCES=1,
KEYWORDS="Reliability; program construction; mathematical method;
FORTRAN; portability; error handling; memory management; library",
ANNOTE="The three program packages presented here provide a framework
for a portable FORTRAN subroutine library. They were developed for the
BELL Laboratories library PORT(1). The packages are: machine-dependent
constants, automatic error handling, and dynamic storage allocation
using a stack.",
}

@TECHREPORT{Fran78:Markow,
AUTHOR="H. Franken",
TITLE="Markow-Ketten und Wartesysteme",
TYPE="Interne Berichte Lehrstuhl",
INSTITUTION="DFV, RWTH Aachen",
ADDRESS="Aachen",
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Queueing Theory",
}

@ARTICLE{Fran78:Comparison,
AUTHOR="William R. Franta and K. Maly",
TITLE="A comparison of heaps and the {TL} structure for the simulation
event set",
JOURNAL=cacm,
VOLUME=21,
YEAR=1978,
KEYWORDS="Simulation",
}

@TECHREPORT{Fröl78:Zwei,
AUTHOR="R. Frölich",
TITLE="Zwei neue Verfahren zur Aufwandsminderung diskreter Simulatoren
von Rechensystemen",
INSTITUTION="Institut für Informatik, Universität Hamburg",
NUMBER=45,
PAGES="0.1-7.8",
YEAR=1978,
LANGUAGE="German",
REFERENCES=64,
KEYWORDS="Discrete event simulation; stationary process; expectation;
variance; regression analysis; model adaption; moment estimation;
autoregressive process",
ANNOTE="The paper describes the reduction of discrete simulation-models
in order to cut simulation costs: during the simulation submodels of the
model are substituted by suitable stochastic generators. The parameters
of these generators are gained from the observations during
simulation.",
}

@ARTICLE{Gabe78:Es,
AUTHOR="J. Gabel",
TITLE="Es wird möglich: Das offene Datennetz",
JOURNAL=ntz,
VOLUME=31,
NUMBER=6,
PAGES="398-399",
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Euronet",
ANNOTE="Kurzbericht über ``EIN'' (European Informatics Network).",
}

@INPROCEEDINGS{Gele78:Protocol,
AUTHOR="E. Gelenbe and J. Labetoulle and",
TITLE="Performance evaluation of the protocol {HDLC}",
BOOKTITLE="Computer Network Protocols Symposium",
ADDRESS="Liege",
PAGES="1-5",
YEAR=1978,
REFERENCES=4,
KEYWORDS="Performance evaluation; HDLC; model",
ANNOTE="The HDLC (high-level data link control) protocol has been
accepted as an international standard for computer communications. As
such it is very important that its performance limits be well
understood. The mathematical model of hdlc developed in this paper
allows us to compute its performance limits as a function of window
width, transmission errors, and packet lengths for symmetrie and
asymmetric traffic, but with no transmission delays. Expli",
}

@INPROCEEDINGS{Gien78:CYCLADES,
AUTHOR="M. Gien and J.-L. Grange",
TITLE="Performance evaluations in {CYCLADES}",
BOOKTITLE=iccc,
ADDRESS="Kyoto",
PAGES="23-32",
YEAR=1978,
REFERENCES=30,
KEYWORDS="Performance evaluation; CYCLADES; communication network;
measurement",
ANNOTE="This paper presents an overview of some aspects of measurements
conducted on the cyclades computer network.",
}

@ARTICLE{Gies78:Free,
AUTHOR="A. Giessler and J. O. Hänle and A. König and E. Pade",
TITLE="Free buffer allocation - an investigation by simulation",
JOURNAL=cn,
VOLUME=2,
PAGES="191-208",
YEAR=1978,
REFERENCES=7,
KEYWORDS="Packet switching; network flow; resource management;
Simulation; network design; datagram; virtual channel; buffer memory;
dynamic resource allocation; deadlock; network behaviour; network
characteristics; GMDNET",
ANNOTE={Results of simulation studies performed during 1975/76 at the
institute for teleprocessing of the gmd are presented. The
investigations refer to packet networks applying dynamic deadlock-free
resource allocation based on so-called buffer classes. Communications
systems with the virtual channel switching technique as well as
"datagram switching" networks are considered. Appropriate flow control
mechanisms, which are consistent with the deadlock-},
}

@BOOK{Gilo78:Interactive,
AUTHOR="W. K. Giloi",
TITLE="Interactive computer graphics: data structures, algorithms,
languages",
PUBLISHER="PRENTICE-HALL",
ADDRESS="Englewood Cliffs, New Jersey",
PAGES="1-354",
YEAR=1978,
REFERENCES=157,
KEYWORDS="Model; bibliography; graphics; diagram manipulation;
two-dimensional plot; three-dimensional plot; hidden line algorithm;
programming language",
ANNOTE={The book should prove useful both as a source of reference
material for the practicing engineer or computer scientist and as a
"selected reading" type of textbook for a college-level course in
computer graphics.},
}

@ARTICLE{Gott78:Hidden,
AUTHOR="M. Gottlieb",
TITLE="Hidden line subroutines for three-dimensional plotting",
JOURNAL=byte,
VOLUME=3,
NUMBER=5,
PAGES="49-58",
YEAR=1978,
KEYWORDS="BASIC; graphics; application; method; human factors",
}

@INPROCEEDINGS{Gran78:Thirty,
AUTHOR="J.-L. Grange and M. I. Irland",
TITLE="Thirty nine steps to a computer network",
BOOKTITLE=iccc,
ADDRESS="Kyoto",
PAGES="763-769",
YEAR=1978,
REFERENCES=24,
KEYWORDS="Communication network; CYCLADES; simulation; performance
evaluation; routing algorithm; link layer; network behaviour; network
congestion; CCNG; computer communication network group",
ANNOTE="After a short presentation of the cyclades project and the ccng,
the cigale network and the simulation tools are briefly described.
Following sections discuss simulation techniques and results obtained
for cigale in various areas: general network behaviour and performance,
transmission link protocols, adaptive routing, and congestion control.",
}

@BOOK{Gras78:Steuerwerke,
AUTHOR="W. Grass",
TITLE="Steuerwerke",
PUBLISHER="Springer-Verlag",
ADDRESS="Berlin",
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Microcontroller; sequencer; microprogramming",
ANNOTE="German Reference!",
}

@ARTICLE{Gras78:PHx,
AUTHOR="W. Grassmann",
TITLE="The {PHx/M/c} queue",
JOURNAL="Selecta statistica Canadiana",
ADDRESS="Saskatchewan",
VOLUME=7,
PAGES=26,
YEAR=1978,
REFERENCES=9,
KEYWORDS="Queueing system; bulk arrival",
}

@ARTICLE{Grus78:ENTRASIM,
AUTHOR="M. Gruszecki",
TITLE="{ENTRASIM} - ein Echtzeitverkehr-Umweltsimulator für
rechnergesteuerte Vermittlungssysteme",
JOURNAL="Elektrisches Nachrichtenwesen (ITT)",
VOLUME=53,
NUMBER=1,
PAGES="83-90",
YEAR=1978,
LANGUAGE="German",
REFERENCES=7,
KEYWORDS="Environment simulation; switching system",
ANNOTE="Durch Echtzeit-Umweltsimulation wird ein genaues Abbild eines
rechnergesteuerten Vermittlungssystems verfügbar, das zur
Verkehrssimulation herangezogen werden kann. Mit diesem Verfahren werden
zuverlässige und genaue Ergebnisse erzielt.",
}

@BOOK{Hama78:Computer,
AUTHOR="V. C. Hamacher and Z. G. Vranesic and S. G. Zaky",
TITLE="Computer organization",
SERIES="Computer science series",
PUBLISHER="McGraw-Hill",
ADDRESS="New York",
PAGES="1-465",
YEAR=1978,
REFERENCES=61,
KEYWORDS="Computer system; isolated system; software; survey;
communication network",
ANNOTE="Nach Einführung in die Rechnerstruktur und die Terminologie
werden zunächst die Adressierungs- und Befehlsfolgeverfahren sowie die
Befehlsvorräte und ihre Implementierung erläutert. Im anschliessenden
Hauptteil des Textes werden in sechs Kapiteln die Zentraleinheit, die
mikroprogrammierte Steuerung, Organisation der Daten-ein-ausgabe,
Rechnerarithmetik, Halbleiter- und Magnetkernspeicher sowie periphere
Einheiten und Interfaces beschrieben.",
}

@INCOLLECTION{Hänl78:Simulation,
AUTHOR="J. O. Hänle and A. Giessler",
TITLE="Simulation of data transport systems of packet-switched
networks",
BOOKTITLE="Computer networks and simulation",
EDITOR="S. Shoemaker",
PUBLISHER="North Holland",
PAGES="101-117",
YEAR=1978,
REFERENCES=4,
KEYWORDS="simulation; packet switching; communication protocol;
Performance evaluation; communication network; network design; method;
model; gmdnet",
ANNOTE="The simulation of transport system mostly involves the
evaluation and comparison of different variants of transport systems and
the optimization of not yet completely defined system parameters. The
problem how to do this is regarded. Additionally the design principles
applied by the authors when constructing the simulation model of a
special transport system are outlined and the experiences gained during
their simulation work are reported.",
}

@ARTICLE{Haug78:Queueing,
AUTHOR="R. B. Haugen",
TITLE="Queueing systems with several input streams and time-out",
JOURNAL="Telektronikk",
VOLUME=2,
PAGES="100-106",
YEAR=1978,
KEYWORDS="Queueing system; limited waiting time",
}

@TECHREPORT{Hein78:PIX,
AUTHOR="W. Heinze and B. Struif and M. Wilhelm",
TITLE="The {PIX-RJE} protocol",
INSTITUTION="GMD",
ADDRESS="Bonn",
PAGES="1-59",
YEAR=1978,
REFERENCES=4,
KEYWORDS="RJE; remote job entry; communication protocol; pix",
ANNOTE="The paper describes the rje protocol in terms of the
synchronization and communication facilities of the pix communication
model. The RJE protocol consists of the following parts: netjob
submission, output submission, status request/response, cancel request/
response and operator/operator communication.",
}

@MISC{Henc78:HMI,
AUTHOR="L. Henckel and K. Ullmann and  others",
TITLE="{HMI-Rechnerverbund}",
PUBLISHER="HMI-Jahresbericht 1978",
PAGES="17-29",
YEAR=1978,
LANGUAGE="German",
REFERENCES=25,
KEYWORDS="realization; communication network; standard; data network;
HDLC; X.25; datagram; transport layer",
ANNOTE="1.1. Introduction 1.2. Actual network configuration 1.3. Net
services 1.4. Modelling of end-to-end level 1.5. Test development for a
hdcl-link 1.6. Bernet",
}

@ARTICLE{Hent78:Mehrzweckmodell,
AUTHOR="S. Hentschke",
TITLE="Mehrzweckmodell der Verkehrstheorie",
JOURNAL=ntzarchiv,
VOLUME=1,
PAGES="3-",
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Queueing system",
}

@ARTICLE{Hert78:ML,
AUTHOR="F. R. Hertweck and E. Raubold and F. Vogt",
TITLE="The {ML-protocol-description}",
JOURNAL=pik,
ADDRESS="Bonn",
PAGES="1-45",
YEAR=1978,
REFERENCES=3,
KEYWORDS="Communication protocol; virtual channel; transport layer; PIX;
transport protocol; interprocess communication; X.25",
ANNOTE="The ML-protocol is established on top of an X.25 packet level
and comprises the following functions: connection of process pairs via
an X.25 virtual channel, selection of communication modes,
re-synchronisation after unexpected conditions, end-to-end recovery
between processes, transport of messages between processes.",
}

@ARTICLE{Herz78:Priority,
AUTHOR="U. Herzog",
TITLE="Priority models for communication processors including system
overhead",
JOURNAL=aninf,
PAGES="120-127",
YEAR=1978,
REFERENCES=21,
KEYWORDS="Model; queueing system; queueing discipline; overhead time;
switching system; interrupt procedure",
ANNOTE={Various scheduling strategies for communication processors are
discussed and uniformly described by means of the so-called "preemption
distance". Then, two types of communication processors are described:
processors with fully automatic (hardware) priority-interrupt systems
and, secondly, processors with software con trolled priority-interrupt
systems. For both, queueing models including preemption-distance
priorities are presented and analyze},
}

@BOOK{Hofe78:Datenfernverarbeitung,
AUTHOR="H. Hofer",
TITLE="Datenfernverarbeitung",
PUBLISHER="Springer-Verlag",
ADDRESS="Berlin",
PAGES="1-226",
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Survey; data transmission",
ANNOTE="1. Aussenstelle 2. Datenfernübertragung 3. Rechenzentrum 4.
Betriebsabwicklung",
}

@ARTICLE{Hoks78:Approximations,
AUTHOR="P. Hokstad",
TITLE="Approximations for the M/G/m queue",
JOURNAL=or,
VOLUME=26,
PAGES="510-523",
YEAR=1978,
KEYWORDS="Queueing system; M/G/N; difference equation; differential
equation; number of elements in system; queueing approximation; queue
length",
ANNOTE="We study the M/G/M queue and obtain difference-differential equ
ations for the equilibrium joint distribution of the number of customers
present and of the remaining holding times for services in progress. A
study of these equations leads to the proposal of a simple approximation
for the queue length distribution. Approximate waiting time and busy
period distributions easily follow. Simple expressions for the means of
the variables in question",
}

@ARTICLE{Igle78:Simulation,
AUTHOR="D. L. Iglehart and G. S. Shedler",
TITLE="Simulation of response times in finite-capacity open networks of
queues",
JOURNAL=or,
VOLUME=26,
PAGES="896-914",
YEAR=1978,
REFERENCES=31,
KEYWORDS="Simulation; response time; queueing network; loss system;
independent cycles",
ANNOTE="We extend to two types of finite-capacity open networks a
previously developed technique for the estimation by simulation of job
response time characteristics in closed queueing network models of
multiprogrammed computer systems. Particular stochastic point processes
associated with a Markov renewal process generate arrivals to the
networks. Such arrival patterns are useful for representation of the
work load of the computer system being modele",
}

@ARTICLE{Jage78:Inversion,
AUTHOR="D. L. Jagerman",
TITLE="An inversion technique for the Laplace transform with application
to approximation",
JOURNAL=bstj,
VOLUME=57,
NUMBER=3,
PAGES="669-710",
YEAR=1978,
REFERENCES=19,
KEYWORDS="Laplace transform",
}

@ARTICLE{Jess78:Wartenetze,
AUTHOR="E. Jessen",
TITLE="Wartenetze als Verkehrsmodelle von Rechensystemen",
JOURNAL=infspec,
VOLUME=1,
PAGES="90-100",
YEAR=1978,
LANGUAGE="German",
REFERENCES=16,
KEYWORDS="Survey; exponential queueing network; expectation; time in
system; overhead time; time sharing; multiprogramming; Jackson net;
Gordon Newell net",
ANNOTE="Networks of queueing systems form simple but effective models
for the determination of essential traffic parameters like throughput
and time in system for computing systems. An introduction to the
assumptions and the use of such networks is given, starting from simple
applications. A basic serial system, a multiprogramming system with
paging and a time-sharing system are presented. Particular emphasis is
on those properties of the networks whic",
}

@ARTICLE{Kamp78:Graded,
AUTHOR="G. Kampe and P. J. Kühn",
TITLE="Graded delay systems with infinite or finite source traffic and
exponential or constant holding time",
JOURNAL=aeu,
VOLUME=32,
NUMBER="1+2",
NOTE="also 8th International Teletraffic Congress, November 1976,
Melbourne",
YEAR=1978,
KEYWORDS="queueing system; M/M/N; M/D/N; FIFO; LIFO; random",
ANNOTE="The paper deals with single stage delay systems of the types
M/M/N and M/D/N and single-stage delay-loss systems of the type M/M/N-S
both in case of full or limited accessibility. Further distinctions are
made between single and multi-queues, ideal and real gradings, and a
finite or infinite number of traffic sources. Waiting calls are served
according to the disciplines FIFO, random, or LIFO.",
}

@ARTICLE{Kand78:Fuzzy,
AUTHOR="A. Kandel and W. J. Byatt",
TITLE="Fuzzy sets, fuzzy algebra, and fuzzy statistics",
JOURNAL=ieeeproc,
VOLUME=66,
NUMBER=12,
PAGES="1619-1639",
YEAR=1978,
REFERENCES=566,
KEYWORDS="fundamentals in statistics; survey; fuzzy statistics",
ANNOTE="The extension of algebraic and analytical concepts to the theory
of fuzzy sets appears to play a central role in the investigation of
nondeterministic techniques. Since an exact description of any real
physical situation is virtually impossible, it is necessary to develop
schemes which deal analytically with decision processes in an imprecise
environment.",
}

@INPROCEEDINGS{Karp78:New,
AUTHOR="W. J. Karplus",
TITLE="New computer structures for low-cost high-speed digital
simulation",
BOOKTITLE="Information Technology, North Holland",
PAGES="33-38",
YEAR=1978,
KEYWORDS="Continuous simulation; cost; performance evaluation; future
outlook; small computer; multiprocessor system; hardware simulator",
ABSTRACT="In the simulation of continous dynamic systems, high speed is
required in order to provide real-time capability as well as in order to
permit the solution of exceptionally large systems of equations. in this
paper, the evolution of the simulation art is briefly reviewed followed
by the description of a newly-developed approach to high-speed
simulation, the host-plus-peripheral system. This innovative simulator
consists of a large minicomputer.",
}

@ARTICLE{Klei78:Principles,
AUTHOR="L. Kleinrock",
TITLE="Principles and lessons in packet communications",
JOURNAL=ieeeproc,
VOLUME=66,
PAGES="1320-1329",
YEAR=1978,
KEYWORDS="routing algorithm; network flow; ARPAnet; survey; broadcast;
communication; packet switching; evaluation",
ANNOTE="In this clearly written paper, Kleinrock uses the ARPANET
resource-sharing network as the primary example of a geographically
distributed computer-communications network that uses packet-swit ching
techniques for intercommunication.",
}

@BOOK{Koba78:Modelling,
AUTHOR="H. Kobayashi",
TITLE="Modelling and analysis: an introduction to system performance
evaluation methodology",
PUBLISHER="Addison Wesley",
ADDRESS="London",
YEAR=1978,
KEYWORDS="Queueing system; modeling",
}

@ARTICLE{Koti78:Approximate,
AUTHOR="T. C. T. Kotiah",
TITLE="Approximate transient analysis of some queueing systems",
JOURNAL=or,
VOLUME=26,
PAGES="333-346",
YEAR=1978,
REFERENCES=8,
KEYWORDS="M/M/1; queueing approximation; queue length; M/M/2; M/EK/1;
transient behaviour",
ANNOTE="We propose approximations for the time-dependent queue size
distribution $PN(T)$ and the mean queue size $E(X(T))$ of an M/M/1
queue. The methods can be applied to approximate the behavior of more
complicated queues. Applications to the M/M/2 queue and the M/EP/1 queue
are discussed briefly.",
}

@BOOK{Krau78:Daten,
AUTHOR="G. Kraus",
TITLE="Einführung in die Datenübertragung",
PUBLISHER="Oldenbourg-Verlag",
ADDRESS="München",
PAGES=307,
YEAR=1978,
LANGUAGE="German",
REFERENCES=84,
KEYWORDS="Data transmission; classification; communication network;
baseband transmission; transmission principle; error-correcting code;
modulation theory; measurement",
ANNOTE="Nach Einführung in die Begriffe der Übertragungs- und
Datenübertragungstechnik werden der Aufbau eines
Datenübertragungssystems, der Datenverkehr im Rahmen der
Datenfernverarbeitung, Strukturen der Datennetze sowie die Zeit- und
Spektralfunktion des Datensignals, die Basisbandübertragung und ihre
Signalformen, Modulatin, Zeitmultiplex, Codierung und Fehlersicherung
behandelt. Es folgt die Beschreibung des Telex-, DATEX-, Direktruf-,
Fernsprechdienste.",
}

@MANUAL{Lehn78:Zufallssimulator,
AUTHOR="R. Lehnert",
TITLE="Der Zufallssimulator {ZUSI1;} Kurzbeschreibung und
Bedienungsanleitung",
PUBLISHER="Tech. Rep. Lehrstuhl für Allg. Elektrotechnik und
Datenfernverarbeitung",
ADDRESS="Aachen",
PAGES=38,
YEAR=1978,
LANGUAGE="German",
REFERENCES=4,
KEYWORDS="Hardware simulator",
}

@ARTICLE{Lin78:Circuit,
AUTHOR="Philip Lin and B. J. Leon and C. R. Stewart",
TITLE="Analysis of Circuit-Switched Networks Employing
Originating-Office Control with Spill-Forward",
JOURNAL=ieeecom,
VOLUME="COM-26",
NUMBER=6,
PAGES="754-765",
YEAR=1978,
REFERENCES=30,
KEYWORDS="Circuit switching; routing algorithm",
ANNOTE={This paper presents a single-moment method for determining the
node-to-node grades of service of a circuit-switched communication
network employing a routing strategy called "originating-office control
with spill-forward". An example of such a network is the European
AUTOVON. The new method makes use of the concept of "path-loss sequence"
and the techniques in system reliability analysis to determine the
probability of each route being used},
}

@ARTICLE{Mari78:Phase,
AUTHOR="Maritsos and  others",
TITLE="Phase-shift analysis of linear feedback shift register structures
generating pseudo-random sequences",
JOURNAL=ieeetc,
VOLUME="C-27",
PAGES="660-",
YEAR=1978,
KEYWORDS="random number generation; shift register sequences",
}

@BOOK{Mart78:Communications,
AUTHOR="J. Martin",
TITLE="Communications satellite systems",
PUBLISHER="PRENTICE-HALL",
ADDRESS="Englewood Cliffs, New Jersey",
PAGES="1-398",
YEAR=1978,
KEYWORDS="Survey; satellite radio; protocol engineering",
}

@PHDTHESIS{Mers78:Jobzuteilungsverfahren,
AUTHOR="G. Mersmann",
TITLE="Jobzuteilungsverfahren in Rechnersystemen für
Stapelverarbeitungbei Vorkenntnissen über die zu verarbeitenden Jobs",
SCHOOL="Lehrstuhl für Betriebssysteme RWTH Aachen",
ADDRESS="Aachen, Germany",
PAGES="1-135",
YEAR=1978,
LANGUAGE="German",
REFERENCES=41,
KEYWORDS="Queueing discipline; batch processing; computer network;
performance evaluation; network throughput; multiprogramming",
ANNOTE="SAB: select and balance. MSL: maximal system sharing last. MSF:
maximal system sharing first. MMF/S: maximal multiprogramming first /
statisch. MMF/D: maximal multiprogramming first / dynamisch. 1.
Einleitung. 2. Modellierung des rechnersystems. 3. Modellierung des
jobprofils. 4. Zeitabhängig- keiten des jobverhaltens. 5. Kenngrössen
des bearbeitungssystems. 6. Maximierung des durchsatzes fuer
multiprogramming. 7. Einhaltung garantierter ferti",
}

@TECHREPORT{Meye78:SIM,
AUTHOR="Michael Meyer and  Schaller and B. Schmidt",
TITLE="{SIM-Queue:}",
INSTITUTION="Arbeitsberichte des IMMD, Universität Erlangen",
ADDRESS="Erlangen",
VOLUME=11,
NUMBER=11,
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Simulation; GPSS-Fortran",
}

@ARTICLE{Miya78:Delay,
AUTHOR="H. Miyahara and Yoskimi Teshigawara and Toshiharu Hasegawa",
TITLE="Delay and Throughput Evaluation of Switching Methods in Computer
Communication Networks",
JOURNAL=ieeecom,
VOLUME="COM-26",
NUMBER=3,
PAGES="337-344",
YEAR=1978,
REFERENCES=6,
KEYWORDS="communication network; delay analysis; throughput",
ANNOTE="Message, packet and line switching in computer communication
networks are analyzed by a queueing model. Message transmission delay
time and network throughput between a source-destination node pair are
obtained as a function of various parameters including message length,
traffic arriving at the network, and the number of switching nodes
existing between the nodes. A criterion to determine the most suitable
switching method under the given",
}

@ARTICLE{Munt78:Queueing,
AUTHOR="R. R. Muntz",
TITLE="Queueing networks: a critique of the state of the art and
directions for the future",
JOURNAL=acmcs,
VOLUME=10,
PAGES="353-359",
YEAR=1978,
REFERENCES=16,
KEYWORDS="survey; Queueing network; research problem",
ANNOTE="Other papers in the special issue have surveyed the state of the
art. This note attempts to provide a condensed statement as to where we
are and, as much as possible, to indicate areas of future research with
high potential.",
}

@TECHREPORT{Musi78:Vergleich,
AUTHOR="H. Musielak and B. Schmidt and M. Stößel",
TITLE="Vergleich von Simulationssprachen {GPSS-Fortran} - {GPSS} -
{GASP} {IV}",
BOOKTITLE="Arbeitsberichte des IMMD",
INSTITUTION="Universität Erlangen",
ADDRESS="Erlangen, Germany",
VOLUME=11,
NUMBER=9,
PAGES=55,
NOTE="also in Elektronische Rechenanlagen 21, 1979, pp. 23-28",
YEAR=1978,
LANGUAGE="German",
REFERENCES=12,
KEYWORDS="Simulation; GPSS; GPSS-Fortran; GASP",
}

@ARTICLE{Nanc78:Processor,
AUTHOR="R. E. Nance and U. Narayan Bhat",
TITLE="A processor utilization model for a multiprocessor computer
system",
JOURNAL=or,
VOLUME=26,
PAGES="881-895",
YEAR=1978,
REFERENCES=21,
KEYWORDS="G/M/N/S; busy period; imbedded Markov chain; utilization",
ANNOTE="Using a G/M/S/N queueing system model, we develop a processor
utilization model for a simplified multiprocessor computer system. The
mathematical model is based on the busy period analysis, and two
utilization measures are derived: processor utilization (the fraction of
processor occupation time during a busy cycle) and system utilization
(the fraction of actual utilization time for all processors).",
}

@ARTICLE{Neva78:Efficiency,
AUTHOR="O. Nevalainen and J. Teuhola",
TITLE="The efficiency of two indexed priority queue algorithms",
JOURNAL="BIT",
VOLUME=18,
NUMBER=3,
PAGES="320-333",
YEAR=1978,
KEYWORDS="performance evaluation; method; event sequencing; priority;
simulation",
ANNOTE="This paper analyzes two algorithms which can be used to manage
priority queues. Such queues are frequently encountered in the
implementation of the future event chain found in discrete event
simulation programs.",
}

@BOOK{Anon78:Basiswissen,
AUTHOR="Anonymous",
TITLE="Basiswissen Datenverarbeitung",
PUBLISHER="Siemens AG",
ADDRESS="Berlin",
PAGES="1-131",
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Survey; solved exercise; isolated system; communication
network; software; reliability",
ANNOTE="Dieses Lehrheft mit Übungsteil vermittelt Grundkentnisse der
elektronischen Datenverarbeitung.",
}

@TECHREPORT{Anon78:Ubersicht,
AUTHOR="Anonymous",
TITLE="Übersicht über Struktur und Begriffe des Datenvermittlungssystems
{NW} {(DVS)}",
INSTITUTION="Landesamt für Datenverarbeitung und Statistik, NRW",
ADDRESS="Düsseldorf",
PAGES="1-11",
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Classification; data network; data switching",
ABSTRACT="In der öffentlichen Verwaltung des Landes NW einschliesslich
des Hochschulbereichs sind zur Zeit über 40 Rechenzentren und alleine
auf Landesebene über 1000 Datenstationen und kleinere Rechenanlagen in
betrieb.  Zwischen diesen Rechenzentren, Kleinrechnern und
Datenstationen wird in den nächsten jahren eine umfangreiche
Zusammenarbeit, d.h. vielfältiger Datenaustausch erwartet.",
}

@ARTICLE{Pack78:Output,
AUTHOR="C. D. Pack",
TITLE="The output of multiserver queueing systems",
JOURNAL=or,
VOLUME=26,
PAGES="492-509",
YEAR=1978,
KEYWORDS="Queueing theory; output process; G/G/N; M/M/N; M/D/N",
ABSTRACT="We derive a recurrence relation for $xi\_n$, the time until
the $n$th departure measured from $t\_0$, any well-defined instant in
time. While the recurrence, valid for the G/G/S queue, is generally not
easy to work with, in certain cases we can use it to obtain the
distribution and moments of $xi\_n$.  we obtain limited results for the
M/M/S queue but investigate the M/D/S queue in detail.",
}

@INCOLLECTION{Payn78:Topological,
AUTHOR="A. J. Payne and B. J. Lings",
TITLE="Topological design of a small resource sharing network",
BOOKTITLE="Auerbach Annual Best computer papers --",
EDITOR="I. L. Auerbach",
PUBLISHER="North Holland",
PAGES="59-77",
YEAR=1978,
REFERENCES=10,
KEYWORDS="Logical network structure; optimization; network design;
cost",
ANNOTE="In recent years there has been a rapid growth in the development
and implementation of networks to achieve efficient sharing of
geographically distributed computer resources. It is the purpose of this
paper to detail an approach which, using available performance data on
existing networks, derives an optimum topology for a network
interconnecting the computing facilities of research institutions.",
}

@ARTICLE{Pouz78:Tutorial,
AUTHOR="L. Pouzin and H. Zimmermann",
TITLE="A tutorial on protocols",
JOURNAL=ieeeproc,
VOLUME=66,
NUMBER=11,
PAGES="1346-1370",
NOTE="also in \cite{Abra80:Computer}",
YEAR=1978,
KEYWORDS="Protocol engineering; survey; design; Performance evaluation;
standard",
ANNOTE="The authors have created a superb introduction to computer
communication protocols. They attempt to provide not only an
introduction to protocol concepts, but also a discussion of protocol
design and performance, the architecture of distributed systems, and
protocol standardization.",
}

@INCOLLECTION{Pric78:Simulation,
AUTHOR="W. L. Price",
TITLE="Simulation of routing doctrines, flow control and congestion
avoidance",
BOOKTITLE="Computer networks and simulation",
EDITOR="S. Shoemaker",
PUBLISHER="North Holland, Amsterdam",
PAGES="141-153",
YEAR=1978,
REFERENCES=26,
KEYWORDS="simulation; routing algorithm; network flow; network
congestion; packet switching; Performance evaluation",
ANNOTE="A brief review is given of the nature of routing and flow
control procedures in packet switched networks, and reference is made to
the complexities facing the designer who wishes to optimise the
performance of these processes. An account is given of various studies
of such problems using simulation techniques.",
}

@ARTICLE{Rama78:Computer,
AUTHOR="S. Ramani and A. G. Joshi",
TITLE="Computer communication through satellite channels",
JOURNAL="NCSDCT Research Review",
PAGES="3-15",
YEAR=1978,
REFERENCES=8,
KEYWORDS="Communication network; telephone channel; ALOHA; fully
connected network; reliability; packet switching; multiplexer",
ANNOTE="The use of geosynchronous satellites to provide voice
communication channels for international and domestic calls has had its
impact on computer data communication. The availability of satellite
channels for data communication raises a number of technical issues.",
}

@ARTICLE{Rubi78:Reliable,
AUTHOR="I. Rubin",
TITLE="On reliable topological structures for message-switching communic
ation networks",
JOURNAL=ieeecom,
VOLUME="COM-26",
PAGES="62-74",
YEAR=1978,
REFERENCES=14,
KEYWORDS="Message switching; graph theory; network topography; network
delay; channel capacity; delay capacity product",
ANNOTE="The synthesis of optimal reliable (invulnerable) topological
structures for message-switching communication networks is considered.
The connectivity of the underlying graphs is used as a measure of the
network invulnerability. The maximal average message delay value is
utilized as the network delay measure. Simultaneously with choosing the
topological structure, optimal line capacities are assigned. Therefore,
the performance measure of a given",
}

@ARTICLE{Rudi78:Automated,
AUTHOR="Harry Rudin and C. H. West and P. Zafiropulo",
TITLE="Automated Protocol Validation: One Chain of Development",
JOURNAL=cn,
VOLUME=2,
NUMBER="4/5",
PAGES="373-380",
YEAR=1978,
REFERENCES=14,
KEYWORDS="Protocol engineering; protocol verification",
}

@ARTICLE{Rusc78:Analytical,
AUTHOR="M. Ruschitzka",
TITLE="An analytical treatment of policy function schedulers",
JOURNAL=or,
VOLUME=26,
PAGES="845-863",
YEAR=1978,
REFERENCES=13,
KEYWORDS="M/G/1; processor sharing; policy function",
ANNOTE="This paper presents an analysis of time-sharing computer
facilities using scheduling algorithms defined in terms of priority
functions. We consider the class of algorithms in which a job's priority
is defined by the difference between the time it spent in the system and
an arbitrary function $f$ of its attained service, where $f$ is called
the policy function. Our main result, the average response time for a
job conditioned on its service requireme",
}

@ARTICLE{Salt78:Research,
AUTHOR="J. H. Saltzer",
TITLE="Research problems of decentralized systems with largely
autonomous nodes",
JOURNAL=acmosrev,
VOLUME=12,
NUMBER=1,
PAGES="43-52",
YEAR=1978,
REFERENCES=32,
KEYWORDS="Communication network; communication protocol; research
problem; bibliography; model",
}

@TECHREPORT{Saue78:Queueing,
AUTHOR="C. H. Sauer and E. A. Mac Nair",
TITLE="Queueing network software for systems modeling",
INSTITUTION="IBM report RC 7143",
ADDRESS="Yorktown Heights",
YEAR=1978,
KEYWORDS="Simulation; APLOMB; QNET; QSIM",
}

@PROCEEDINGS{Schi78:Rechnernetze,
TITLE="Rechnernetze und Datenfernverarbeitung",
EDITOR="S. Schindler",
PUBLISHER="TU-Berlin, Fachbereich Informatik (20)",
ADDRESS="Berlin",
PAGES="1-365",
YEAR=1978,
LANGUAGE="English, German",
KEYWORDS="Communication network; X.25; communication protocol; logical
network structure; euronet; special issue",
ABSTRACT={Veranstalter dieses Workshops war der Fachausschuss 3/4
"Rechnerorganisation und Betriebssysteme" der GI.  Insgesamt darf man
den Workshop wohl als erste umfassende Darstellung der derzeitigen
Vorgänge in diesem Gebiet in der BRD und deren Zusammenhang mit
internationalen Aktivitäten betrachten.},
}

@ARTICLE{Schm78:Betriebssystemstruktur,
AUTHOR="B. Schmidt",
TITLE="Betriebssystemstruktur für eine Mehrprozessorkonfiguration mit
privaten Speichern",
JOURNAL="NTG-Fachberichte",
VOLUME=62,
PAGES="253-263",
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Simulation; multiprocessor system",
}

@BOOK{Schm78:GPSS,
AUTHOR="B. Schmidt",
TITLE="{GPSS-Fortran,} Version {II}",
PUBLISHER="Informatik Fachberichte, Springer-Verlag",
VOLUME=6,
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Simulation; GPSS-Fortran",
}

@INCOLLECTION{Schn78:VANS,
AUTHOR="G. M. Schneider",
TITLE="{VANS} - a resource-sharing computer network design tool",
BOOKTITLE="Computer networks and simulation",
EDITOR="S. Shoemaker",
PUBLISHER="North Holland",
ADDRESS="Amsterdam",
PAGES="227-245",
YEAR=1978,
REFERENCES=6,
KEYWORDS="Simulation; communication network; model; Performance
evaluation; network design",
ANNOTE="The vans system represents a new approach to the simulation of
distributed, resource-sharing computer networks. It provides a network
designer with two levels of control - investigation of the parametric
characteristics of a specific network or modification of the logical
structure of the network itself.",
}

@BOOK{Schn78:Rechnernetze,
AUTHOR="P. Schnupp",
TITLE="Rechnernetze. Entwurf und Realisierung",
PUBLISHER="De Gruyter",
ADDRESS="Berlin",
PAGES="1-193",
YEAR=1978,
LANGUAGE="German",
REFERENCES=152,
KEYWORDS="Survey; communication network; operating system; realization;
network design; switching type",
ANNOTE="Das Buch wendet sich vor allem an Software-Spezialisten,
erfahrene Programmierer und fortgeschrittene Studenten der Informatik.
ES gibt eine Einführung in die Spezifikation, Planung und
Implementierung von Rechnerverbundnetzen.",
}

@BOOK{Scho78:Computer,
AUTHOR="S. Ed. Schoemaker",
TITLE="Computer networks and simulation",
PUBLISHER="North Holland",
ADDRESS="Amsterdam",
PAGES="1-256",
YEAR=1978,
KEYWORDS="Communication network; simulation; survey; network flow;
network congestion; special issue",
ANNOTE="Introductory remarks on CCITT; Use of computers for network
planning and circuit group dimensioning (CCITT); On networking (G.
Lemoli); Interconnection of computer networks (C. Sunshine); On
simulation (S. Schoemaker); Simulation techniques in network design (A.
Remes); Simulation of data transport systems of packet switched networks
(J. O. Hänle, A. Giessler); Simulation of protocol layers of
communication in computer networks (B. Wol)",
}

@ARTICLE{Schr78:Satz,
AUTHOR="F. Schreiber",
TITLE="Der Satz von Bayes und die Priori-Gleichverteilung als Grundlage
für statistische Aussagen",
JOURNAL=aeu,
VOLUME=32,
PAGES="35-43",
YEAR=1978,
LANGUAGE="German",
REFERENCES=23,
KEYWORDS="Statistics; Bayes statistics; error measure",
ANNOTE="On the background of the present dispute on the importance of a
bayes statistics the folowing basic problem of statistics is solved in
general terms along the guidelines of bayes: given a random process
described by the probability function $prob(\beta*N/p)$ determine the
unknown parameter $p$ by means of the result $\beta*N$ which has been
measured after $n=1,2,\ldots$ Independent trials. According to the bayes
postulate before starting the measurement",
}

@ARTICLE{Schr78:Anwendung,
AUTHOR="F. Schreiber",
TITLE="Anwendung der objektiven Bayes-Statistik auf die Normal- und
{CHI**2-Verteilung}",
JOURNAL=aeu,
VOLUME=32,
PAGES="363-368",
YEAR=1978,
LANGUAGE="German",
REFERENCES=8,
KEYWORDS="Bayes statistics; application; error measure; normal
distribution; chi-square distribution",
ANNOTE="The methods of the objective bayes-statistics are used to
determine the unknown expectation $\mu$ and the unknown variance $\nu$
of a normal distributed random variable $x$ from the vector
$(x\_1,x\_2,\ldots,x\_N)$ measured in $n$ independent trials
respectively.  From the sums: $y\_N=sum(i=1,\ldots,N, x*I)$ and
$\eta\_N=\sum(i=1,\ldots N,x\_I**2)-y\_N**2/n$.  The main result refers
to bayes-density functions which describe the knowledge of $\mu$ and
$\nu$ after $n$ trials and enable simple formulae",
}

@TECHREPORT{Schr78:Hardware,
AUTHOR="H. Schreiber",
TITLE="Hardware-Messung und Analyse des Ablaufgeschehens in
Rechnerkernen",
TYPE="Arbeitsberichte des IMMD",
INSTITUTION="Universität Erlangen-Nürnberg",
ADDRESS="Erlangen, Germany",
NUMBER="11/7",
PAGES=112,
YEAR=1978,
LANGUAGE="German",
REFERENCES=33,
KEYWORDS="Hardware monitor; measurement; traffic model",
}

@ARTICLE{Sher78:NSPIV,
AUTHOR="A. H. Sherman",
TITLE="{NSPIV,} a {FORTRAN} subroutine for sparse {Gaussian} eliminating
with partial pivoting {(F4)}",
JOURNAL="Collected algorithms from ACM",
PAGES="1-24",
NOTE="Algorithm 533",
YEAR=1978,
REFERENCES=8,
KEYWORDS="method; sparse matrix; FORTRAN; sparse Gaussian elimination;
partial pivoting; linear equation",
ANNOTE="This is the full-length version of the algorithm described in
ACM Transactions Math. Softw. 4,4 (1978), pages 391-398.",
}

@ARTICLE{Sher78:Algorithm,
AUTHOR="A. H. Sherman",
TITLE="Algorithm 533 {NSPIV,} a {FORTRAN} subroutine for sparse
{Gaussian} elimination with partial pivoting {(F4)}",
JOURNAL=toms,
VOLUME=4,
PAGES="391-398",
YEAR=1978,
REFERENCES=5,
KEYWORDS="method; sparse matrix; FORTRAN; sparse Gaussian elimination;
artial pivoting; linear equation",
ANNOTE="Nspiv is a fortran subroutine which solves a sparse of linear
equations a*x=b by sparse gaussian elimination with partial pivoting.",
}

@ARTICLE{Witt78:MICRONET,
AUTHOR="L. D. Wittie",
TITLE="{MICRONET:} a reconfigurable microcomputer network for
distributed systems research",
JOURNAL="Simulation",
PAGES="145-153",
NOTE="also in \cite{Thur81:Tutorial}",
YEAR=1978,
KEYWORDS="Multiprocessor system; distributed simulation",
}

@INPROCEEDINGS{Naka78:Storage,
AUTHOR="T. Nakamura and T. Mizoguchi",
TITLE="An analysis of storage utilization factor in block split data
structuring scheme",
BOOKTITLE="IEEE Congress",
ISBN="CH1389-6/78/0000-048",
PAGES="489-495",
YEAR=1978,
REFERENCES=2,
KEYWORDS="Analysis; memory; utilization",
ANNOTE="The Storage Utilization Factor (SUF) of Block Split Data Struc-
turing (BSDS) scheme is analyzed in this paper. SUF is analyzed in both
cases of light input after arbitrary initial loading andheavy input
volume at initial loading.",
}

@ARTICLE{Toba78:Modeling,
AUTHOR="F. A. Tobagi and M. Gerla and R. W. Peebles and E. Manning",
TITLE="Modeling and Measurement Techniques in Packet Communication
Networks",
JOURNAL=ieeeproc,
VOLUME=66,
NUMBER=11,
PAGES="1423-1447",
NOTE="also in \cite{Abra80:Computer}",
YEAR=1978,
REFERENCES=94,
KEYWORDS="Network; packet switching; modeling; measurement",
ANNOTE="The paper reviews the modeling techniques that are most
frequently used to study these packet transport networks. Then the basic
measurement tools are introduced and discussed.",
}

@ARTICLE{Dosh78:Production,
AUTHOR="B. T. Doshi and F. van der Duym and A. J. J. Talman",
TITLE="A production-inventory control model with a mixture of
back-orders and lost-sales",
JOURNAL=ms,
VOLUME=24,
NUMBER=10,
PAGES="1078-1086",
YEAR=1978,
REFERENCES=13,
KEYWORDS="Manufacturing system; production rate",
ANNOTE="We consider a production-inventory control model of finite capac
which backordering up to a certain level is allowed. We assume there
exist two possible production rates. The control is basedcritical
stock-levels and prescribes to change the production raonly when one of
these levels is reached.",
}

@ARTICLE{Chun78:Zone,
AUTHOR="F. R. K. Chung",
TITLE="Zone-Balanced Networks and Block Designs",
JOURNAL=bstj,
VOLUME=57,
NUMBER=8,
YEAR=1978,
KEYWORDS="Link system",
}

@ARTICLE{Chun78:Blocking,
AUTHOR="F. R. K. Chung and F. K. Hwang",
TITLE="On Blocking Probabilitis for a Class of Linear Graphs",
JOURNAL=bstj,
VOLUME=57,
NUMBER=8,
YEAR=1978,
KEYWORDS="Link system",
}

@ARTICLE{Duff7801:Study,
AUTHOR="F. P. Duffy and R. A. Mercer",
TITLE="A Study of Network Performance and Customer Behavior
During-Direct-Distance-Dialing Call Attempts in the {USA}",
JOURNAL=bstj,
VOLUME=57,
NUMBER=1,
PAGES="1-33",
YEAR=1978,
KEYWORDS="Measurement; performance evaluation; direct dial; post-dial
delay; subscriber behavior; retry; busy",
ABSTRACT="A survey was conducted throughout the Bell System in October
1974 to gather detailed information about Direct Distance Dialing call
attempts.  The dispositions, setup times, and customer abandonment times
associated with DDD attempts are discussed in detail in this article to
provide network performance and customer behavior characteristics to
network planners and administrators and to designers of equipment and
systems which use, and interact with, the telephone network.  It is
shown that both network performance and customer behavior affect the
call dispositions and the total call setup time; however,
customer-dependent failures to complete account for 85 percent of all
failures, and customer-determined components of the call setup time make
up 71 percent of the total setup time.  It is found that traffic
composition in terms of the relative mix of business and residential
originations exerts a strong influence on call dispositions.  Network
performance affects the probability of equipment blockages and failures
and the interval from end of dialing to receipt of a network response.
These are both found to depend on calling distance, while the latter is
also affected by the types of originating and terminating local
switching.",
}

@ARTICLE{Farm78:Numerical,
AUTHOR="R. F. Farmer and I. Kaufman",
TITLE="On the Numerical Evaluation of Some Basic Traffic Formulae",
JOURNAL=networks,
VOLUME=8,
PAGES="153-186",
YEAR=1978,
KEYWORDS="Loss system",
}

@ARTICLE{Hwan78:Construction,
AUTHOR="F. K. Hwang and T. C. Liang",
TITLE="The Construction for Symmetrical Zone-Balanced Networks",
JOURNAL=bstj,
VOLUME=57,
NUMBER=8,
YEAR=1978,
KEYWORDS="Link system",
}

@ARTICLE{Inos78:Theoretical,
AUTHOR="H. Inose and T. Saito",
TITLE="Theoretical Aspects in the Analysis and Synthesis of Packet
Communication Networks",
JOURNAL="IEEE Proceedings ?",
VOLUME=66,
NUMBER=11,
YEAR=1978,
KEYWORDS="Data traffic; computer network",
}

@ARTICLE{Kram78:Approximate,
AUTHOR="W. Krämer and M. Langenbach-Belz",
TITLE="Approximate Formulae for General Single Server Systems with
Singleand Batch Arrivals",
JOURNAL=aninf,
NUMBER=9,
YEAR=1978,
KEYWORDS="Delay system",
}

@ARTICLE{Luhm78:Ziele,
AUTHOR="S. Luhmann",
TITLE="Ziele und Strategien für die Zuteilung von Bearbeitungsplätzen in
einem Teilnehmerrechensystem",
JOURNAL=aninf,
NUMBER=11,
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Data traffic; computer network",
}

@ARTICLE{Mena78:Traffic,
AUTHOR="T. A. Menachem",
TITLE="Traffic Characteristics of the No. 3 {ESS} Network",
JOURNAL=ieeecom,
VOLUME="COM-26",
NUMBER=12,
YEAR=1978,
KEYWORDS="Simulation",
}

@ARTICLE{Mess78:Approximation,
AUTHOR="E. J. Messerli",
TITLE="An Approximation for the Variance of the {UPCO} Offered Load
Estimate",
JOURNAL=bstj,
VOLUME=57,
NUMBER=7,
PAGES="part 2",
YEAR=1978,
KEYWORDS="Measurement",
}

@ARTICLE{More78:Estimation,
AUTHOR="J. P. Moreland",
TITLE="Estimation of Point-to-Point Telephone Traffic",
JOURNAL=bstj,
VOLUME=57,
NUMBER=8,
PAGES="2847-2863",
YEAR=1978,
KEYWORDS="Measurement",
ANNOTE="Inhalt: Fernsprechverkehr, Verkehrsmessungen,
Verkehrsvorhersage, mathematische Modelle",
}

@ARTICLE{Mroz78:Mittlere,
AUTHOR="G. Mrozynski",
TITLE="Mittlere Wartezeit und Wartewahrscheinlichkeit in einem dezentral
vermittelnden System mit reinem Internverkehr zwischen endlich vielen
Teilnehmern",
JOURNAL=aeu,
VOLUME=32,
NUMBER=3,
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Delay system",
ANNOTE="Inhalt: Zustandswahrscheinlichkeiten, Ringnetz,
Teilnehmergesamtzahl",
}

@ARTICLE{Nils78:Overflow,
AUTHOR="A. Nilsson",
TITLE="On overflow Systems in Telephone Networks General Service Times
inthe Secondary Group",
JOURNAL=ericssont,
NUMBER=2,
PAGES="48-70",
YEAR=1978,
KEYWORDS="Overload control; flow control; communication network",
}

@ARTICLE{Thie78:Verfahren,
AUTHOR="K. Thiesemann",
TITLE="Verfahren zur Erzielung einer besseren Verkehrsauslastung von
Eingangsgruppen",
JOURNAL=fernmeldepraxis,
VOLUME=55,
NUMBER=1,
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Gos",
}

@ARTICLE{Bart78:Generating,
AUTHOR="R. Bartels",
TITLE="Generating non-normal stable variates using limit theorem
properties",
JOURNAL="Journal of Statistical Computation and Simulation",
VOLUME=7,
PAGES="199-212",
YEAR=1978,
KEYWORDS="random variate generation",
}

@ARTICLE{Best78:Letter,
AUTHOR="D. J. Best",
TITLE="Letter to the Editors concerning [Cheng 1977])",
JOURNAL=as,
VOLUME=27,
NUMBER=2,
PAGES="181-",
YEAR=1978,
KEYWORDS="random variate generation",
}

@INPROCEEDINGS{Best78:Simple,
AUTHOR="D. J. Best",
TITLE="A simple algorithm for the computer generation of random samples
from a Student's $t$ or symmetric beta distribution",
BOOKTITLE=compstat,
EDITOR="L. C. A. and J. Hermans",
PUBLISHER="Physica-Verlag",
PAGES="341-347 (paper 1)",
YEAR=1978,
KEYWORDS="random variate generation",
}

@ARTICLE{Dagp78:Sampling,
AUTHOR="J. S. Dagpunar",
TITLE="Sampling of variates from a truncated gamma distribution",
JOURNAL="Journal of Statistical Computation and Simulation",
VOLUME=8,
PAGES="59-64",
YEAR=1978,
KEYWORDS="random variate generation",
}

@ARTICLE{Deci78:Prospects,
AUTHOR="M. Decina and C. Mossotto and M. Romagnoli",
TITLE="Prospects for common channel signalling in Italy",
JOURNAL=comcom,
VOLUME=1,
NUMBER=3,
PAGES="123-127",
YEAR=1978,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Enge78:Time,
AUTHOR="R. Engelbrecht-Wiggans and W. L. Maxwell",
TITLE="Analysis of the time indexed list procedure for synchronization
of discrete event simulations",
JOURNAL=ms,
VOLUME=24,
NUMBER=13,
PAGES="1417-1427",
YEAR=1978,
KEYWORDS="Simulation; event set",
}

@ARTICLE{Fish78:Grouping,
AUTHOR="G. S. Fishman",
TITLE="Grouping observations in digital simulation",
JOURNAL=ms,
VOLUME=24,
NUMBER=5,
PAGES="510-521",
YEAR=1978,
KEYWORDS="Simulation; statistical technique",
}

@ARTICLE{Flei78:Method,
AUTHOR="A. I. Fleishman",
TITLE="A method for simulating non-normal distributions",
JOURNAL="Psychometrika",
VOLUME=43,
NUMBER=4,
PAGES="521-532",
YEAR=1978,
KEYWORDS="random variate generation",
}

@ARTICLE{Igle78:Regenerative,
AUTHOR="D. L. Iglehart",
TITLE="The regenerative method for simulation analysis",
JOURNAL="Current Trends in Programming Methodology Software Modeling",
PUBLISHER="Prentice Hall",
VOLUME=3,
PAGES="52-71",
YEAR=1978,
KEYWORDS="Simulation; statistical technique",
}

@ARTICLE{Jesw78:New,
AUTHOR="P. T. Jeswani and S. Sikdar",
TITLE="A new approach to machine generation of random variables with any
distribution",
JOURNAL=ieeer,
VOLUME="R-27",
NUMBER=1,
PAGES="55-57",
YEAR=1978,
KEYWORDS="random variate generation",
}

@ARTICLE{Klim78:Time,
AUTHOR="G. P. Klimov",
TITLE="Time-sharing service systems, {II}",
JOURNAL="Theory of Probability and its Applications",
VOLUME=23,
NUMBER=2,
PAGES="314-321",
YEAR=1978,
KEYWORDS="Queueing system; priority; analysis",
}

@INCOLLECTION{Koba78:System,
AUTHOR="H. Kobayashi",
TITLE="System design and performance analysis using analytic models",
BOOKTITLE="Current Trends in Programming Methodology Software Modeling",
EDITOR="K. M. Chandy and R. T. Yeh",
PUBLISHER="Prentice Hall",
VOLUME=3,
PAGES="72-114",
YEAR=1978,
KEYWORDS="Queueing network; product form; analysis",
}

@ARTICLE{Krae78:Investigations,
AUTHOR="W. Kraemer",
TITLE="Performance investigations with a {DOS/VS-based} operating system
model",
JOURNAL=ibmsj,
VOLUME=17,
NUMBER=4,
PAGES="409-443",
YEAR=1978,
KEYWORDS="Queueing system; priority; analysis",
}

@ARTICLE{Lux78:Special,
AUTHOR="I. Lux",
TITLE="A special method to sample some probability density functions",
JOURNAL=comp,
VOLUME=20,
NUMBER=2,
PAGES="183-188",
YEAR=1978,
KEYWORDS="random variate generation",
}

@ARTICLE{Padg78:Comment,
AUTHOR="W. J. Padgett",
TITLE="Comment on inverse {Gaussian} random number generation",
JOURNAL="Journal of Statistical Computation and Simulation",
VOLUME=8,
PAGES="78-79",
YEAR=1978,
KEYWORDS="random variate generation",
}

@INCOLLECTION{Reis78:Queueing,
AUTHOR="M. Reiser and C. H. Sauer",
TITLE="Queueing network models: Methods of solution and their program
implementation",
BOOKTITLE="Current Trends in Programming Methodology",
EDITOR="K. M. Chandy and R. T. Yeh",
PUBLISHER="Prentice-Hall Inc.",
VOLUME=3,
PAGES="115-167",
YEAR=1978,
KEYWORDS="Queueing network; product form; analysis",
}

@ARTICLE{Saka78:Generation,
AUTHOR="H. Sakasegawa",
TITLE="On a generation of normal pseudo-random numbers",
JOURNAL="Annals of the Institute of Statistical Mathematics, Part A",
VOLUME=30,
NUMBER=2,
PAGES="271-179",
YEAR=1978,
KEYWORDS="random variate generation",
}

@ARTICLE{Saue78:Simultaneous,
AUTHOR="C. H. Sauer and E. A. MacNair",
TITLE="Simultaneous resource possession in queueing models of
computers",
JOURNAL=per,
VOLUME=7,
NUMBER="1-2",
PAGES="41-52",
MONTH="Spring-Summer",
YEAR=1978,
KEYWORDS="Queueing network; analysis",
}

@INPROCEEDINGS{Schm78:Rejection,
AUTHOR="B. W. Schmeiser and M. A. Shalaby",
TITLE="Rejection using piese-wise linear majorizing functions in random
variate generation",
BOOKTITLE="Computer Science and Statistics: 11th Annual Symposium on the
Interface",
EDITOR="A. R. Gallant",
PAGES="230-233",
YEAR=1978,
KEYWORDS="random variate generation",
}

@ARTICLE{Vant78:Exact,
AUTHOR="H. Vantilborgh",
TITLE="Exact aggregation in exponential queueing networks",
JOURNAL=jacm,
VOLUME=25,
NUMBER=4,
PAGES="620-629",
YEAR=1978,
KEYWORDS="Queueing network; product form; aggregation",
}

@MANUAL{CCIT78:Orivusuibak,
AUTHOR="C. C. ITT",
TITLE="Orivusuibak Recommendation {X.3,} {X.25,} {X.28} and {X.29} on
Packet-Switched Data Transmissions Services",
YEAR=1978,
}

@MANUAL{Digi78:DECnetData,
AUTHOR="{Digital Equipment Corporation}",
TITLE="{DECnet:} Data Access Protocol Functional Specification",
ADDRESS="Maynard, Massachusetts",
NUMBER="Version 5.6.0",
YEAR=1978,
}

@MANUAL{Corp78:Digital,
AUTHOR="{Digital Equipment Corporation}",
TITLE="Digital Data Communications Message Protocol",
ADDRESS="Maynard, Massachusetts",
NUMBER="Version 4.0",
YEAR=1978,
}

@MANUAL{Digi78:DECnetVax,
AUTHOR="{Digital Equipment Corporation}",
TITLE="{DECnet-VAX} User's Guide",
ADDRESS="Maynard, Massachusetts",
NUMBER="AA-D901A-TE",
YEAR=1978,
}

@TECHREPORT{IBM78:IBM,
AUTHOR="I. B. M",
TITLE="{IBM} System/38 Technical Developments",
INSTITUTION="IBM",
NUMBER="IBM S/38 TECH DEV",
NOTE="ISBN 0-933186-00-2",
YEAR=1978,
}

@MANUAL{Corp78:Maintenance,
AUTHOR="{Digital Equipment Corporation}",
TITLE="Maintenance Operation Protocol",
ADDRESS="Maynard, Massachusetts",
YEAR=1978,
}

@MANUAL{Digi78:DECnetNetwork,
AUTHOR="{Digital Equipment Corporation}",
TITLE="{DECnet:} Network Services Protocol Functional Specification",
ADDRESS="Maynard, Massachusetts",
YEAR=1978,
}

@INPROCEEDINGS{Alte78:Public,
AUTHOR="G. Altehage and W. Statudinger",
TITLE="The public switched data network of the Deutsche Bundespost:
three years of experience with the electronic data switching system
{(EDS)} - future developments of {EDS}",
BOOKTITLE=iccc,
PAGES="9-16",
YEAR=1978,
}

@ARTICLE{Barb78:X,
AUTHOR="D. Barber and T. Kalin and C. Solomonides",
TITLE="An implementation of the {X.25} interface in a datagram network",
JOURNAL=cn,
VOLUME=2,
PAGES="340-345",
YEAR=1978,
}

@INPROCEEDINGS{Brae78:Experimental,
AUTHOR="J. Braekhus and J. Wigdahal",
TITLE="An experimental {X.25} packet switch in the Norwegian
circuit-switched trial data network",
BOOKTITLE="ECCNP",
VOLUME="E7",
YEAR=1978,
}

@ARTICLE{Bran78:Verification,
AUTHOR="D. Brand and W. H. Joyner",
TITLE="Verification of protocols using symbolic execution",
JOURNAL=cn,
VOLUME=2,
PAGES="351-360",
YEAR=1978,
}

@INPROCEEDINGS{Carp78:Microprocessor,
AUTHOR="R. J. Carpenter and Jr. Sokol and R. Rosenthal",
TITLE="A Microprocessor-Based Local Network Node",
BOOKTITLE=compcon,
PAGES="104-109",
NOTE="also in \cite{Thur81:Tutorial}",
MONTH="Fall",
YEAR=1978,
}

@INPROCEEDINGS{Chan78:Social,
AUTHOR="P. Chan",
TITLE="Some social criteria for implementing telecommunications
policies",
BOOKTITLE=iccc,
PAGES="215-220",
YEAR=1978,
}

@ARTICLE{Hert78:X,
AUTHOR="F. R. Hertweck and E. Raubold and F. Vogt",
TITLE="{X.25} based process-process communication",
JOURNAL=cn,
VOLUME=2,
PAGES="250-270",
YEAR=1978,
}

@INPROCEEDINGS{Hilt78:Wired,
AUTHOR="Starr Roxanne Hiltz and Murray Turoff",
TITLE="The wired world of the office of the future: applications and
impacts of computerised conferencing in the multinational organization",
BOOKTITLE=iccc,
PAGES="711-716",
YEAR=1978,
}

@ARTICLE{Humm78:Role,
AUTHOR="E. Hummel",
TITLE="Role and functioning of the {CCITT}",
JOURNAL=cn,
VOLUME=2,
PAGES="123-124",
YEAR=1978,
}

@ARTICLE{Jacq78:Interprocess,
AUTHOR="Y. A. Jacquemart",
TITLE="Network interprocess communication in an {X25} environment",
JOURNAL=cn,
VOLUME=2,
PAGES="227-235",
YEAR=1978,
}

@ARTICLE{Kirs78:Choice,
AUTHOR="P. T. Kirstein",
TITLE="Choice of data communication media for transmission of facsimile
information",
JOURNAL=cn,
VOLUME=2,
PAGES="179-190",
YEAR=1978,
}

@INPROCEEDINGS{Lin78:Packet,
AUTHOR="Kuang-Shin Lin",
TITLE="Design of a Packet-Switched Micro-Subnetwork",
BOOKTITLE=compcon,
PAGES="184-193",
NOTE="also in \cite{Thur81:Tutorial}",
MONTH="Fall",
YEAR=1978,
}

@ARTICLE{MacD78:International,
AUTHOR="V. C. MacDonald",
TITLE="International standards, open system interconnection,
{ISO/TC97/SC16}",
JOURNAL=cn,
PAGES="115-117",
YEAR=1978,
}

@INPROCEEDINGS{Spri78:Distributed,
AUTHOR="J. F. Springer",
TITLE="The Distributed Data Network, Its Architecture and Operation",
BOOKTITLE=compcon,
PAGES="221-228",
NOTE="also in \cite{Thur81:Tutorial}",
MONTH="Fall",
YEAR=1978,
}

@ARTICLE{Suns78:Protocol,
AUTHOR="C. A. Sunshine",
TITLE="Survey of protocol definition and verification techniques",
JOURNAL=cn,
VOLUME=2,
PAGES="346-350",
YEAR=1978,
}

@INPROCEEDINGS{Szur78:High,
AUTHOR="E. Szurkowski",
TITLE="A High Bandwidth Local Computer Network",
BOOKTITLE=compcon,
PAGES="98-103",
NOTE="also in \cite{Thur81:Tutorial}",
MONTH="Fall",
YEAR=1978,
}

@INCOLLECTION{Tyme78:International,
AUTHOR="L. Tymes",
TITLE="International value added networks",
BOOKTITLE="Future Networks",
EDITOR="A. W. Westley",
SERIES="Infotech State of Art Reports",
PUBLISHER="Infotech",
PAGES="273-281",
YEAR=1978,
}

@BOOK{Baye78:Operating,
TITLE="Operating Systems - An Advanced Course",
EDITOR="R. Bayer",
ISBN="3-540-09812-7",
PUBLISHER="Springer-Verlag",
YEAR=1978,
}

@BOOK{Cyps78:Communications,
AUTHOR="R. J. Cypser",
TITLE="Communications Architecture for Distributed Systems",
PUBLISHER="Addison-Wesley",
YEAR=1978,
}

@INCOLLECTION{Gray78:Notes,
AUTHOR="Jim Gray",
TITLE="Notes on Database Operating Systems",
BOOKTITLE="Operating Systems - An Advanced Course",
EDITOR="R. Bayer",
ISBN="3-540-09812-7",
PUBLISHER="Springer-Verlag",
YEAR=1978,
}

@INPROCEEDINGS{Higg78:Experiences,
AUTHOR="P. Higginson and Z. Fisher",
TITLE="Experiences with the Initial {EPSS} Service",
BOOKTITLE="European Computing Congress (Eurocomp)",
PUBLISHER="Online",
ADDRESS="London",
PAGES="581-600",
YEAR=1978,
KEYWORDS="Epss",
}

@INCOLLECTION{Jone78:Object,
AUTHOR="Alan Jones",
TITLE="The Object Model: A Conceptual Tool for Structuring System
Software",
BOOKTITLE="Operating Systems - An Advanced Course",
EDITOR="R. Bayer",
ISBN="3-540-09812-7",
PUBLISHER="Springer-Verlag",
YEAR=1978,
}

@INCOLLECTION{Jone78:Protection,
AUTHOR="Alan Jones",
TITLE="Protection Mechanisms and the Enforcement of Security Policies",
BOOKTITLE="Operating Systems - An Advanced Course",
EDITOR="R. Bayer",
ISBN="3-540-09812-7",
PUBLISHER="Springer-Verlag",
YEAR=1978,
}

@INCOLLECTION{Laga78:Synchronisation,
AUTHOR="K. Lagally",
TITLE="Synchronisation in a Layered System",
BOOKTITLE="Operating Systems - An Advanced Course",
EDITOR="R. Bayer",
ISBN="3-540-09812-7",
PUBLISHER="Springer-Verlag",
YEAR=1978,
}

@INCOLLECTION{Rand78:Reliable,
AUTHOR="B. Randell",
TITLE="Reliable Computing Systems",
BOOKTITLE="Operating Systems - An Advanced Course",
EDITOR="R. Bayer",
ISBN="3-540-09812-7",
PUBLISHER="Springer-Verlag",
YEAR=1978,
}

@INCOLLECTION{Salt78:Naming,
AUTHOR="J. H. Saltzer",
TITLE="Naming and Binding of Objects",
BOOKTITLE="Operating Systems - An Advanced Course",
EDITOR="R. Bayer",
ISBN="3-540-09812-7",
PUBLISHER="Springer-Verlag",
YEAR=1978,
}

@INPROCEEDINGS{Trea78:High,
AUTHOR="S. W. Treadwell and A. J. Hinchley",
TITLE="A High Level Network Measurement Tool",
BOOKTITLE="European Computing Congress (Eurocomp)",
PAGES="35-49",
YEAR=1978,
}

@ARTICLE{Deri78:Parallel,
AUTHOR="H. Derin and C.-S. Won",
TITLE="A parallel image segmentation algorithm using relaxation with
varying neighbourhoods and its mapping to array processors",
JOURNAL="CGVIP",
VOLUME=40,
PAGES="54-78",
YEAR=1978,
ABSTRACT="This paper presents a segmentation algorithm based on
deterministic relaxation with varying neighbourhood structures for the
segmentation of noisy images. The image is modeled as a discrete valued
Markov random field, or equivalently a Gibbs random field, corrupted by
addative, independent, Gaussian noise; although additivity and Gaussian
assumptions are not neceessary for the algorithm. The alg seeks to
determine the maximum aposteriori (MAP) estimate of the noisless scene.
Using varying neighbourhood during relaxation helps pick up certain
directional features in the image, which are otherwise smoothed out. The
paralleism of the alg is underscored by providing its mapping to
mesh-connected and systolic array processors suitable for VLSI
implementation. Segmentation results are given for 2 and 4 level Gibbs
distributed and geometric images corrupted by noise of different levels.
A comparative study of this segmentation alg with other relaxation algs
and a single sweep dynamic prog algorithm, all seeking the MAP estimate,
is also presented.",
}

@INCOLLECTION{Enri78:Topology,
AUTHOR="R. Enrich and J. Foith",
TITLE="Topology and semantics of intensity arrays",
BOOKTITLE="Computer vision",
EDITOR="Mathias Johanson and  Riseman",
PUBLISHER="Academic Press",
YEAR=1978,
}

@ARTICLE{Gold7802:Clustering,
AUTHOR="M. Goldberg and S. Shlien",
TITLE="A clustering scheme for multispectral images",
JOURNAL=ieeesmc,
VOLUME=8,
NUMBER=2,
PAGES="86-92",
YEAR=1978,
}

@BOOK{Hans78:Computer,
AUTHOR="A. R. Hanson and E. M. Riseman",
TITLE="Computer vision systems",
PUBLISHER="Academic Press",
ADDRESS="New York",
YEAR=1978,
}

@ARTICLE{Hara78:Consistent1,
AUTHOR="R. M. Haralick and L. G. Shapiro",
TITLE="The consistent labelling problem: part 1",
JOURNAL=ieeepami,
VOLUME=1,
PAGES="173-183",
YEAR=1978,
}

@ARTICLE{Hara78:Consistent2,
AUTHOR="R. M. Haralick and L. G. Shapiro",
TITLE="The consistent labelling problem: part 2",
JOURNAL=ieeepami,
VOLUME=2,
PAGES="193-203",
YEAR=1978,
}

@INCOLLECTION{Holl78:Cognitive,
AUTHOR="J. H. Holland and J. S. Reitman",
TITLE="Cognitive systems based on adaptive algorithms",
BOOKTITLE="Pattern-directed Inference Systems",
EDITOR="D. Hayes-Roth and F. Waterman",
PUBLISHER="Academic Press",
ADDRESS="New York",
PAGES="313-329",
YEAR=1978,
ABSTRACT="The type of cognitive system (CS) studied here has 4 basic
parts: 1) a set of interacting elementary productions called
classifiers, 2) a performance algorithm that directs the action of the
system in the environment, 3)a simple learning algorithm that keeps a
record of each classifiers success in bringing about rewards and 4)a
more complex learning algorithm, called the GA, that modifies the set of
classifiers so that variants of good classifiers persist and new,
potentially better ones are created in a provably efficient manner. Two
'proof-of-principle' experiments are reported. One experiment shows CS's
performance in a maze when it has only the ability to adjust the
predictions about ensuing rewards of classifiers (similar to adjusting
the 'weight' of each classifer) vs when the power of the GA is added.
Criterion was achieved an order of magnitude more rapidly when the GA
was operative. A second experiment examines transfer of learning. Placed
in a more difficult maze, CS with experience in the simpler maze reaches
criterion an order of magnitude more rapidly than CS without prior
experience.",
}

@INCOLLECTION{Kuma78:Statistical,
AUTHOR="R. Krishna Kumar and M. Niero",
TITLE="Statistical separability and accuracy of different options of
Image 100 for land use classes",
BOOKTITLE="Machine-aided image analysis,",
EDITOR="W. E. Gardner",
PUBLISHER="The Institute of Physics",
PAGES="244-249",
YEAR=1978,
}

@INPROCEEDINGS{Rech78:Evolutionsstrategien,
AUTHOR="I. Rechenberg",
TITLE="Evolutionsstrategien",
BOOKTITLE="Simulationsmethoden in der Medizin und Biologie Workshop",
EDITOR="B. Ranft and Schneider U.",
PUBLISHER="Berlin Springer",
ADDRESS="Hanover",
PAGES="83-114",
YEAR=1978,
}

@ARTICLE{Stef7802:Parallel,
AUTHOR="R. Stefanelli and A Rosenfeld",
TITLE="Some parallel thinning algorithms for digital pictures",
JOURNAL=jacm,
VOLUME=18,
NUMBER=2,
PAGES="255-264",
YEAR=1978,
}

@ARTICLE{Swai78:Bayesian,
AUTHOR="P. H. Swain",
TITLE="Bayesian classification in a time-varying environment",
JOURNAL="SMC",
VOLUME=8,
PAGES="879-883",
YEAR=1978,
}

@ARTICLE{Tous78:Use,
AUTHOR="G. T. Toussaint",
TITLE="The use of context in pattern recognition",
JOURNAL=pattern,
VOLUME=10,
PAGES="189-204",
YEAR=1978,
}

@ARTICLE{Larm78:Scheduling,
AUTHOR="J Larmouth",
TITLE="Scheduling for Immediate Turnaround",
JOURNAL=spe,
PUBLISHER="Wiley",
VOLUME=8,
PAGES="559-578",
YEAR=1978,
KEYWORDS="scheduling",
}

@ARTICLE{Wede78:Relationale,
AUTHOR="Hartmut Wedekind",
TITLE="Relationale Datenbanksysteme",
JOURNAL=infspec,
YEAR=1978,
LANGUAGE="German",
REFERENCES=54,
ABSTRACT="Conventional CP-systems and database systems differ among
other aspects by a higher degree of data independence, a system enforced
integrity and a centralized arrangement of data with respects to various
processes. A simple example is used to describe essential features of
relational and hierarchical data models (schema). The three schema
architecture of the ANSI/SPARC proposal is discussed from the relational
point of view. The advantage of set oriented data manipulation languages
are outlined with regard to programming and query applications. Finally
well-known implementations are briefly presented.",
}

@ARTICLE{Back78:Can,
AUTHOR="J. Backus",
TITLE="Can programming be liberated from the von Neumann style? A
functional style and its algebra of programs",
JOURNAL=cacm,
VOLUME=21,
PAGES="613-641",
YEAR=1978,
REFERENCES=23,
KEYWORDS="Programming language; reliability; future outlook; von Neumann
computer; applicative computing system",
ABSTRACT="Conventional programming languages are growing ever more
enormous, but not stronger. Inherent defects at the most basic level
cause them to be both fat and weak: their primitive word-at-a-time style
of programming inherited from their common ancestor - the von Neumann
computer, their close coupling of semantics to state transitions, their
division of programming into a world of expressions and a world of
statements, their inability to effectively",
}

@INPROCEEDINGS{Yum78:Comparison,
AUTHOR="T. S. Yum and M. Schwartz",
TITLE="Comparison of Adaptive Routing Algorithms for Computer
Communication Networks",
BOOKTITLE="Net. Telecommunication Conference",
ADDRESS="Birmingham, Great Britain",
YEAR=1978,
REFERENCES=8,
KEYWORDS="Packet switching; routing algorithm; adaptive routing",
ABSTRACT="In this paper we compare the performance of a series of
adaptive routing rules for use in computer communication networks. The
performance is based on analysis, where possible, with verification by
simulation. These rules are assumed embedded in a fixed rule base. The
adaptive components of the rules studied are of two types: those using
local node information only and those using information fed back from
neighboring nodes. The information",
}

@ARTICLE{Ackr7809:Increasing,
AUTHOR="M. H. Ackroyd",
TITLE="Increasing the Efficiency of Roulette Simulation of Teletraffic",
JOURNAL=elet,
ADDRESS="Great Britain",
VOLUME=14,
NUMBER=9,
PAGES="270-",
YEAR=1978,
KEYWORDS="roulette method",
}

@ARTICLE{Aein78:Multi,
AUTHOR="J. M. Aein",
TITLE="A Multi-User-Class, Blocked-Calls-Cleared, demand Access Model",
JOURNAL=ieeecom,
VOLUME="COM-26",
NUMBER=3,
PAGES="378-385",
YEAR=1978,
KEYWORDS="multiserver",
}

@INPROCEEDINGS{Arhn78:Problemer,
AUTHOR="J. Arhnung",
TITLE="Problemer i forbindelse med dimensionering af interne trafikveje
ved {KTAS}",
BOOKTITLE="NTS 2",
ADDRESS="Århus, Copenhagen, Denmark",
PAGES="1.1-12",
YEAR=1978,
LANGUAGE="Danish",
KEYWORDS="Traffic engineering; planning",
}

@ARTICLE{Arnd78:Continuity,
AUTHOR="U. Arndt",
TITLE="A Continuity Theorem for Stationary Distributions in General
m-Server Queues",
JOURNAL=eik,
VOLUME=14,
NUMBER="7/8",
PAGES="385-391",
YEAR=1978,
KEYWORDS="distribution; queueing theory",
}

@INPROCEEDINGS{Asge78:Er,
AUTHOR="C. Asgersen",
TITLE="Er {CCITT's} dimensionering up to date?",
BOOKTITLE="NTS 2",
ADDRESS="Århus",
PAGES="2.1-2.28",
YEAR=1978,
LANGUAGE="Swedish",
KEYWORDS="CCITT; network design; network planning",
ABSTRACT="Når man beskæftiger sig med dimensioneringsregler, er det
naturligt, at se på, hvordan andre har gjort.  Jeg har pr vet at
sammenligne CCITT's dimensioneringsregler med de danske.  Jeg må f rst
og fremmest konstatere, at der er mange forskelle, og at forskellene er
store.  Jeg skal give en analyse af forskellene og pr ve at vurdere de 2
dimensioneringsprincipper i forhold til hinanden.",
}

@ARTICLE{Bard7803:VM,
AUTHOR="Y. Bard",
TITLE="The {VM/370} Performance Predictor",
JOURNAL=acmcs,
VOLUME=10,
NUMBER=3,
PAGES="333-342",
YEAR=1978,
KEYWORDS="Performance prediction",
}

@ARTICLE{Barn78:Optimal,
AUTHOR="A. Barnett",
TITLE="Optimal control of the {B/B/C} Queue",
JOURNAL="Interfaces",
VOLUME=8,
NUMBER=4,
PAGES="49-52",
YEAR=1978,
KEYWORDS="Randomness; queueing theory",
ABSTRACT="A randomized strategy to defeat the British on the Battlefield
is obtained. Some special cases are examined in detail.",
}

@ARTICLE{Beck78:Optimal,
AUTHOR="M. Becker and P. Becker",
TITLE="Optimal Simulation Lengths for Various Algorithms Computing the
Mean",
JOURNAL="Mathematics and Computers in Simulation",
VOLUME=20,
PAGES="44-52",
YEAR=1978,
KEYWORDS="simulation; simulation method; algorithm; calculation;
accuracy",
ABSTRACT="The importance of truncation errors made by the computer is
emphasized. A precise calculation of the bias for various algorithms of
means computation leads us to the notion of optimal precision and
optimal simulation length. It is proved that it is wrong to assume that
the precision improves when the simulation length is increasing. The
choice of a convenient algorithm and the choice of the simulation length
appears to be",
}

@INPROCEEDINGS{Bern78:Traffic,
AUTHOR="J. M. Bernard and P. Le Gall",
TITLE="Traffic Observation Equipments for Routine Measurements and
Special Investigations",
BOOKTITLE="2nd ITC Seminar",
ADDRESS="Budapest, H",
PAGES=6,
YEAR=1978,
KEYWORDS="traffic measurement",
}

@ARTICLE{Bttg7804:Fehler,
AUTHOR="R. Böttger",
TITLE="Fehler bei Impulsdauer Messungen durch einen Zeittakt",
JOURNAL=zor,
ADDRESS="Germany",
VOLUME=22,
NUMBER=4,
PAGES="B145-B156",
YEAR=1978,
LANGUAGE="German",
KEYWORDS="traffic measurement",
}

@ARTICLE{Brum78:Generalization,
AUTHOR="S. L. Brumelle",
TITLE="A Generalization of Erlang's Loss System to State Dependent
Arrival and Service Rates",
JOURNAL=mor,
VOLUME=3,
NUMBER=1,
PAGES="10-16",
YEAR=1978,
KEYWORDS="Loss System; State Dependent Service; M/M/N; Erlang B
formula",
}

@INCOLLECTION{Buze78:Operational,
AUTHOR="J. P. Buzen",
TITLE="Operational Analysis: An alternative to Stochastic Modelling",
BOOKTITLE="Performance of computer Installations",
EDITOR="D. Ferrari",
PUBLISHER="North-Holland",
ADDRESS="Netherlands",
PAGES="175-194",
YEAR=1978,
KEYWORDS="Operational Analysis; Stochastic Theory; Modeling",
}

@ARTICLE{Byrd78:Value,
AUTHOR="J. Byrd",
TITLE="The Value of Queueing Theory",
JOURNAL="Interfaces",
VOLUME=8,
NUMBER=3,
PAGES="22-28",
YEAR=1978,
KEYWORDS="Queueing Theory",
ABSTRACT="Comments: Ref.: Bhat, U. Narayan: The Value of Queueing Theory
- A Rejoinder. Interfaces Vol. 8 (1978):3, 27-28.",
}

@ARTICLE{Chan78:Comparative,
AUTHOR="J. Chan and B. W. Conolly",
TITLE="Comparative Effectiveness of Certain Queueing Systems with
Adaptive Demand and Service Mechanisms",
JOURNAL="Computers and Operations Research",
VOLUME=5,
PAGES="187-196",
YEAR=1978,
KEYWORDS="Comparison; Queueing System",
}

@ARTICLE{Denc7802:Subscriber,
AUTHOR="E. Dencker-Nielsen",
TITLE="Subscriber Habits - Results of Data Collection",
JOURNAL="Teleteknik",
ADDRESS="Sweden",
NUMBER=2,
PAGES="75-80",
YEAR=1978,
KEYWORDS="traffic measurement",
ABSTRACT="Ordrup measurements",
}

@ARTICLE{Dill78:Efficient,
AUTHOR="G. D. Dill and G. Gordon",
TITLE="Efficient Computation of {Erlang} Loss Functions",
JOURNAL=comsat,
VOLUME=8,
NUMBER=2,
PAGES="353-370",
YEAR=1978,
KEYWORDS="Erlang B formula; loss system; numerical method",
}

@ARTICLE{Dobi78:Further,
AUTHOR="A. W. Dobieski",
TITLE="Further Results for Closed Cyclic Queues with Balanced
Exponential Servers",
JOURNAL=jors,
VOLUME=29,
NUMBER=6,
PAGES="607-609",
YEAR=1978,
KEYWORDS="queueing network",
}

@ARTICLE{Eric78:Digital,
AUTHOR="B. Ericson and S. Roos",
TITLE="Digital gruppväljare i {AXE} 10-systemet",
JOURNAL=ericssonr,
ADDRESS="Stockholm, Sweden",
VOLUME=4,
PAGES="140-149",
YEAR=1978,
LANGUAGE="Swedish",
KEYWORDS="Switching system; switching network",
ABSTRACT="Group selector",
}

@ARTICLE{Etti78:Optimal,
AUTHOR="B. Y. Ettinger",
TITLE="Optimal Allocation of Throughput in computer Networks",
JOURNAL="Automatic Control and Computer Sciences (USSR)",
VOLUME=12,
PAGES="66-69",
YEAR=1978,
KEYWORDS="Throughput Analysis; Allocation; Optimization; Computer
Network",
}

@ARTICLE{Fish78:Procedure,
AUTHOR="G. S. Fishman and E. P. C. Kao",
TITLE="A Procedure for Generating Time-Dependent Arrivals for Queueing
Simulations",
JOURNAL=navres,
VOLUME=24,
PAGES="661-666",
YEAR=1978,
KEYWORDS="Simulation; Arrival Process; Algorithm; Delay Model; Time
Dependent Queueing System",
}

@ARTICLE{Fran78:Remark,
AUTHOR="P. Franken",
TITLE="A Remark on the Stationary Availibility",
JOURNAL="Math. Operationsforsch. Statist., Ser. Optimization",
VOLUME=9,
NUMBER=1,
PAGES="143-144",
YEAR=1978,
KEYWORDS="Analysis; Reliability; Stationary Process; Theory",
}

@ARTICLE{Gafa78:Commonly,
AUTHOR="A. V. Gafarian and C. J. Ancker and T. Morisaku",
TITLE={Evaluation of Commonly Used Rules for Detecting "Steady State" in
Computer Simulation},
JOURNAL=navres,
VOLUME=25,
PAGES="511-530",
YEAR=1978,
KEYWORDS="Simulation; Steady State; M/M/1; Evaluation",
ABSTRACT="A definition of the problem of the initial transient with
respect to the steady state mean value has been formulated. A set of
criteria has been set forth by which the efficacy of any proposed rule
may be assessed. Within this framework, five heuristic rules for
predicting the approximate end of transiency, four of which have been
quoted extensively in the simulation literature, have been evaluated in
the M/M/1 situation.",
}

@INPROCEEDINGS{Geil78:Sidstevejssystemers,
AUTHOR="S. Geil",
TITLE="Sidstevejssystemers overbelastningsevne",
BOOKTITLE="NTS 2",
ADDRESS="Århus, Denmark",
PAGES="3.1-16",
YEAR=1978,
LANGUAGE="Danish",
ABSTRACT="Ved dimensionering af centralledningsbundter i det dansk net
er sidstevelssystemet den fundamentale byggebolk.  I det f lgende
omtales baggrunden herfor nærmere.  Indledningsvis skal nævnes, at et
sidstevejssystem består af et sidstevejsbundt og et antal
tværledningsbundter, der afgiver overlab til det pågældende
sidstevejsbundt.  Baggrunden for at indf re dette begreb i
dimensioneringen var netop problemer med nette",
}

@INCOLLECTION{Gned78:Problems,
AUTHOR="B. W. Gnedenko",
TITLE="On Some Problems in Queueing Theory",
BOOKTITLE="Colloquia Mathematica Societatis János Bolyai - Point
Porcesses and Queueing Problems",
PUBLISHER="North-Holland",
PAGES="85-92",
YEAR=1978,
KEYWORDS="Overview; Queueing Theory; Analysis",
}

@INPROCEEDINGS{Good78:Traffic,
AUTHOR="J. H. Goodfellow and J. A. Povey",
TITLE="Traffic Measurement Practice of the British Post Office",
BOOKTITLE="2nd ITC Seminar",
ADDRESS="Budapest",
PAGES=9,
YEAR=1978,
KEYWORDS="Measurement; Overview; Traffic Measurement; Method",
}

@ARTICLE{Grah7803:Queueing,
AUTHOR="G. S. Graham",
TITLE="Queueing Network Models of Computer System Performance",
JOURNAL=acmcs,
VOLUME=10,
NUMBER=3,
PAGES="219-224",
YEAR=1978,
KEYWORDS="Queueing Network; Performance Evaluation; computer
performance",
}

@ARTICLE{Gros78:Spares,
AUTHOR="D. Gross and J. F. Ince",
TITLE="Spares Provisioning for Repairable Items: Cyclic Queues in Light
Traffic",
JOURNAL="AIEE Transactions",
VOLUME=10,
NUMBER=3,
PAGES="307-314",
YEAR=1978,
KEYWORDS="Queueing System; Repair; Approximation",
}

@ARTICLE{Hala78:Approximating,
AUTHOR="B. Halachmi",
TITLE="On Approximating the Generalized Occupancy of the G/M/k Queueing
System",
JOURNAL="Computers and Operations Research",
VOLUME=5,
PAGES="81-88",
YEAR=1978,
KEYWORDS="Queueing System; G/M/N; Approximation",
}

@ARTICLE{Hala78:Diffusion,
AUTHOR="B. Halachmi and William R. Franta",
TITLE="A Diffusion Approximation to the Multi-Server Queue",
JOURNAL=ms,
VOLUME=24,
NUMBER=5,
PAGES="522-529",
YEAR=1978,
KEYWORDS="Queueing System; Multiserver; Diffusion Approximation;
Approximation",
}

@ARTICLE{Han78:Petri,
AUTHOR="Y. W. Han",
TITLE="Performance Evaluation with Petri Nets",
JOURNAL="Computer Performance Evaluation Users Group. CPEUG, NBS Special
Publication 500-41",
PAGES="83-92",
YEAR=1978,
KEYWORDS="Petri net",
}

@ARTICLE{Hans78:Prediction,
AUTHOR="F. Hansen",
TITLE="Prediction of Radio Frequency Channel Demand for Land Mobile
Radio",
JOURNAL="Telecommunication Journal",
VOLUME=45,
NUMBER=11,
PAGES="587-597",
YEAR=1978,
KEYWORDS="mobile radio",
}

@INPROCEEDINGS{Helv78:Bereging,
AUTHOR="B. E. Helvik",
TITLE="Bereging av G/G/1-koer med konstant kotidsbegrensning",
BOOKTITLE="NTS 2",
ADDRESS="Aarhus, Denmark",
PAGES="4.1-22",
YEAR=1978,
LANGUAGE="Norwegian",
KEYWORDS="G/G/1; Delay Model; FIFO; NIL",
ABSTRACT="En tar for seg et k system med generell interankomstfordeling,
generell k tidsfordeling og en FIFO-k hvor den maksimale ventetid er
begrenset av en konstant.  For dette systemet er det utledet en
integral-ligning som bestemmer ventetidsfordelinger.  Denne ligningen må
i det generelle tilfellet antas å være ul selig.  Den er derfor overf rt
til et sett linære ligninger, som l st gir systemets karakteristiske
verdier med nsk",
}

@ARTICLE{Jens7804:Driftsovervågning,
AUTHOR="K. G. Jensen",
TITLE="On-line Driftsovervågning på Telefoncentraler - Grindstedfors
get",
JOURNAL="Teleteknik",
ADDRESS="Stockholm, Sweden",
NUMBER=4,
PAGES="166-175",
YEAR=1978,
LANGUAGE="Swedish",
KEYWORDS="traffic measurement",
}

@INPROCEEDINGS{Jens78:Datamatstyret,
AUTHOR="K. G. Jensen",
TITLE="Datamatstyret dataindsamling på konventionelle centreler -
Grindstedfors get",
BOOKTITLE="NTS 2",
ADDRESS="Aarhus, Denmark",
PAGES="25 (paper 5)",
YEAR=1978,
LANGUAGE="Danish",
}

@ARTICLE{John78:Complexity,
AUTHOR="David B. Johnson and J. K. Lenstra and A. H. G. Rinnooy Kan",
TITLE="The Complexity of the Network Design Problem",
JOURNAL=networks,
VOLUME=8,
PAGES="279-285",
YEAR=1978,
KEYWORDS="Network planning",
}

@ARTICLE{Kahw7804:Hybrid,
AUTHOR="T. J. Kahwa and Nicolaos D. Georganas",
TITLE="A Hybrid Channel Assignment Scheme in Large-Scale,
Cellular-Structured Mobile Communication Systems",
JOURNAL=ieeecom,
VOLUME="COM-26",
NUMBER=4,
PAGES="432-438",
YEAR=1978,
KEYWORDS="Mobile radio",
}

@ARTICLE{Hwan78:Link,
AUTHOR="F. K. Hwang",
TITLE="Link Designs and Probability Analyses for a Class of Connecting
networks",
JOURNAL=networks,
VOLUME=8,
PAGES="287-296",
YEAR=1978,
KEYWORDS="Interconnection network",
}

@ARTICLE{Kirs7809:Inequalities,
AUTHOR="B. M. Kirstein",
TITLE="Some Inequalities for Queues with Applications to Tandem and
Overflow Systems",
JOURNAL=eik,
ADDRESS="SU",
VOLUME=14,
NUMBER=9,
PAGES="445-462",
YEAR=1978,
KEYWORDS="Queueing network; tandem queue",
}

@ARTICLE{Kirs7804:Monotonicity,
AUTHOR="B. M. Kirstein",
TITLE="Some Monotonicity Properties and Bounds for {GI/M/m} Systems
without Delay",
JOURNAL=eik,
ADDRESS="SU",
VOLUME=14,
NUMBER=4,
PAGES="203-216",
YEAR=1978,
KEYWORDS="Queueing theory",
}

@ARTICLE{Klib7810:Principle,
AUTHOR="A. B. Klibaner",
TITLE="The Principle of Distributing Lost Calls over the Sections of an
Intercity Telephone Network",
JOURNAL="Telecommunications \& Radio Engineering",
ADDRESS="SU",
VOLUME="32/33",
NUMBER=10,
PAGES="33-36",
YEAR=1978,
KEYWORDS="Telephony; loss probability",
ABSTRACT="The optimum distribution of the standard quotes of lost calls
over the sections of a telephone network between switching points while
establishing intercity connections between any two subscribers is
considered. It is shown that the problem can be solved by the method of
dynamic programming.",
}

@INPROCEEDINGS{Knig78:Relationships,
AUTHOR="D. König and V. Schmidt",
TITLE="Relationships Between Time- and Customer-Stationary
Characteristics of Service Systems",
BOOKTITLE="Colloquia Mathematica Societatis János Bolyai - Point
Processes and Queueing Problems",
ADDRESS="Sofia, BG",
PAGES="181-225",
YEAR=1978,
KEYWORDS="Queueing system; stationary process",
}

@TECHREPORT{Kost78:Parametrisation,
AUTHOR="L. Kosten",
TITLE="Parametrisation of Overflow Traffic in Telecommunication and
Datahandling",
INSTITUTION="University of Delft",
ADDRESS="Delft, Netherlands",
PAGES=24,
YEAR=1978,
KEYWORDS="Overflow traffic",
}

@ARTICLE{Lave7804:Stability,
AUTHOR="S. S. Lavenberg",
TITLE="Stability and Maximum Departure Rate of Certain Open Queueing
Networks Having Finite Capacity Constraints",
JOURNAL=rairo,
VOLUME=12,
NUMBER=4,
PAGES="353-370",
YEAR=1978,
KEYWORDS="Queueing network",
}

@ARTICLE{Law7804:Confidence,
AUTHOR="A. M. Law",
TITLE="Confidence Intervals in Discrete Event Simulation: A Comparison
of Replication and Batch Means",
JOURNAL=navres,
VOLUME=24,
NUMBER=4,
PAGES="667-678",
YEAR=1978,
KEYWORDS="Discrete event simulation; confidence interval",
}

@ARTICLE{Lema7802:Une,
AUTHOR="B. Lemaire",
TITLE="Une Demonstration Directe de la Formule de Pollaczek-Khintchine",
JOURNAL=rairo,
ADDRESS="France",
VOLUME=12,
NUMBER=2,
PAGES="229-231",
YEAR=1978,
LANGUAGE="French",
KEYWORDS="Queueing theory",
ABSTRACT="On donne une demonstration directe de la formule de
Pollaczek-Khintchine qui exprime l'attente moyenne pour la file M/G/1
fondee sur l'emploi des methodes de conservation.",
}

@ARTICLE{Lise78:Comparability,
AUTHOR="B. Lisek",
TITLE="Comparability of Special Distributions",
JOURNAL="Mathematische Operationsforschung Statistik, Serie Statistik",
VOLUME=9,
NUMBER=4,
PAGES="587-598",
YEAR=1978,
KEYWORDS="Weibull distribution; gamma distribution",
ABSTRACT="Stoyan; Lognormal",
}

@INCOLLECTION{Liu78:Simulation,
AUTHOR="Minkui Liu",
TITLE="A Simulation Study of Memory Partitioning Algorithms",
BOOKTITLE="Performance of Computer Installations",
EDITOR="D. Ferrari",
PUBLISHER="North-Holland",
ADDRESS="Netherlands",
PAGES="155-168",
YEAR=1978,
KEYWORDS="Computer system; memory organization",
}

@ARTICLE{Ma78:Busy,
AUTHOR="R. K. Ma",
TITLE="On the Busy Period of a Queueing Network of Two Service Stages
with Exponentially Distributed Service Time",
JOURNAL="Computer Performance Evaluation Users Group, CPEUG, NBS Special
Publication 500-41",
PAGES="113-116",
YEAR=1978,
KEYWORDS="Tandem queue",
}

@TECHREPORT{Mitc78:Pricing,
AUTHOR="B. Mitchell",
TITLE="Pricing Policies in Selected European Telephone Systems",
INSTITUTION="International Institute of Management, Wissenschaftszentrum
Berlin",
PAGES=52,
YEAR=1978,
KEYWORDS="cost",
}

@ARTICLE{Movs7810:Combination,
AUTHOR="A. I. Movshovich",
TITLE="A Combination Method for Calculating the Lost Calls in Networks
with Channel Switching",
JOURNAL="Telecommunications \& Radio Engineering",
ADDRESS="SU",
VOLUME="32/33",
NUMBER=10,
PAGES="27-33",
YEAR=1978,
KEYWORDS="Communication network; loss system",
ABSTRACT="A combination method for calculating the lost calls in
communications networks with alternative trunking is investigated. The
distribution of the applied load over the branches of the network and
estimates of the probability of blocking the branches are determined by
statistical simulations. The probabilities of a lost call between all
pairs of switching functions are calculated analytically. The
combination method reduce",
}

@ARTICLE{Neut78:Renewal,
AUTHOR="M. F. Neuts",
TITLE="Renewal Processes of Phase Type",
JOURNAL=navres,
VOLUME=25,
PAGES="445-454",
YEAR=1978,
KEYWORDS="Phase-type model",
ABSTRACT="This paper discusses a class of analytical and numerically
tractable renewal processes, which generalize the Poisson process. When
used to describe interarrival or service times in queues, these renewal
processes lead to computationally explicit solutions which involve only
real arithmetic. Previous modifications of the Poisson process, based on
the Erlang or the Hyperexponential distribution, appears as particular
cases.",
}

@ARTICLE{Ng7802:Multiaccess,
AUTHOR="S. Ng and J. W. Mark",
TITLE="Multiaccess Model for Packet Switching with a Satellite Having
Processing Capability: Delay Analysis",
JOURNAL=ieeecom,
VOLUME="COM-26",
NUMBER=2,
PAGES="283-290",
YEAR=1978,
KEYWORDS="Packet switching; satellite radio",
}

@INPROCEEDINGS{Olss78:Tillståndsövervakning,
AUTHOR="K. M. Olsson",
TITLE="Tillståndsövervakning - Ett Alternativ till Tidsspärrmätning",
BOOKTITLE="NTS 2",
ADDRESS="Aarhus, Denmark",
PAGES=12,
YEAR=1978,
LANGUAGE="Danish",
KEYWORDS="Traffic measurement",
ABSTRACT="För övervakning av trafiken i fullt åtkomliga organgrupper,
anordnade som upptagetsystem, förekommer som mätstorhet såväl anrops-
som tidsspärrning.  För båda dessa storheter gäller för de flesta i
praktiken förekommande fall, att variansen för estimatet är relativt
stor.  Detta leder till att man först efter en relativt lång
observationstid har erhållit ett estimat som har tillräckligt stor
noggrannhet.  Nedan studeras en ö",
}

@ARTICLE{Padg7804:Bayes,
AUTHOR="W. J. Padgett and C. P. Tsokos",
TITLE="On Bayes Estimation of Reliability for Mixtures of Life
Distributions",
JOURNAL=siapp,
VOLUME=34,
NUMBER=4,
PAGES="692-703",
YEAR=1978,
KEYWORDS="Reliability",
}

@ARTICLE{Pipp78:Rearrangeable,
AUTHOR="N. Pippenger",
TITLE="On Rearrangeable and Non-blocking Switching Networks",
JOURNAL="Journal of Computer and System Sciences",
VOLUME=17,
NUMBER=14,
PAGES="5-162",
YEAR=1978,
KEYWORDS="Switching network; nonblocking",
}

@ARTICLE{Pott7802:Teletraffic,
AUTHOR="R. B. Potts",
TITLE="Teletraffic and Vehicular Traffic",
JOURNAL="NZOR",
VOLUME=6,
NUMBER=2,
PAGES="95-108",
YEAR=1978,
KEYWORDS="Traffic engineering",
}

@INPROCEEDINGS{Rene78:En,
AUTHOR="L. Reneby",
TITLE="En Metod för Spärrningsutjämning i Alternativvägsnät",
BOOKTITLE="NTS 2",
ADDRESS="Århus, Denmark",
PAGES="7.1-9",
YEAR=1978,
LANGUAGE="Danish",
ABSTRACT="I alternativvägsnät avverkar slutviorna dels trafik som
spärras från högspärrvior, dels trafik utan högspärrsmöjlighet.  Det är
ett känt faktum att spärrsannolikheterna för samtal utan
högspärrsmöjlighet är avsevärt högre än för samtal som först dirigeras
via en högspärrsvia.",
}

@INPROCEEDINGS{Roge78:Simulering,
AUTHOR="T. Rogeberg and S. Berge",
TITLE="Simulering av Overbelastning - Forsok med en Modell",
BOOKTITLE="NTS 2",
ADDRESS="Aarhus, Denmark",
PAGES="8.1-31",
YEAR=1978,
LANGUAGE="Danish",
ABSTRACT="Denne artikkelen presenterer resultater fra forsök med en
simuleringsmodell.  Modellen er bygget over et lokalområde i det norske
telenettet.  Området inneholder 13 fysiske sentraler (hvorav en er
detaljert representert i modellen), 27 sambandsbunter (trunk groups) og
förer en normal trafikk på 250 erlang.  Simuleringene er utf rt med tre
trafikkpåtrykk:  1) Normaltrafikk 2) Generell overbelastning (dobling av
normaltrafikk)",
}

@ARTICLE{Rose7803:Measurement,
AUTHOR="C. A. Rose",
TITLE="A Measurement Procedure for Queueing Network Models of Computer
Systems",
JOURNAL=acmcs,
VOLUME=10,
NUMBER=3,
PAGES="263-280",
YEAR=1978,
KEYWORDS="Queueing network",
}

@ARTICLE{Scha78:Insensitivity,
AUTHOR="R. A. Schassberger",
TITLE="The Insensitivity of Stationary Probabilities in networks of
Queues",
JOURNAL=aap,
VOLUME=10,
PAGES="906-912",
YEAR=1978,
KEYWORDS="Queueing network",
}

@ARTICLE{Scho7802:Decentralized,
AUTHOR="Frederik Carel Schoute",
TITLE="Decentralized Control in Packet Switched Satellite
Communication",
JOURNAL=ieeeac,
VOLUME="AC-23",
NUMBER=2,
PAGES="362-371",
YEAR=1978,
KEYWORDS="Packet switching; satellite radio",
}

@ARTICLE{Shim7808:Optimal,
AUTHOR="D. G. Shimshak",
TITLE="Optimal Sequencing of Servers in the Two-Station Series Queueing
System",
JOURNAL=jors,
VOLUME=29,
NUMBER=8,
PAGES="779-788",
YEAR=1978,
KEYWORDS="Tandem Queue",
}

@ARTICLE{Shri7803:Autonomous,
AUTHOR="A. K. Shrivastava and P. Ramanadhan and A. Shah and  others",
TITLE="Autonomous Line Scanning for {SPC-Telephone} Switching Systems",
JOURNAL=ieeecom,
VOLUME="COM-26",
NUMBER=3,
PAGES="368-373",
YEAR=1978,
KEYWORDS="Spc",
}

@ARTICLE{Stoy7807:Further,
AUTHOR="D. Stoyan",
TITLE="A Further Bound for the Mean Stationary Waiting Time in M/GI/s
Queues",
JOURNAL=eik,
ADDRESS="SU",
VOLUME=14,
NUMBER="7/8",
PAGES="393-395",
YEAR=1978,
KEYWORDS="M/G/N; waiting time",
}

@ARTICLE{Stoy7808:Queueing,
AUTHOR="D. Stoyan",
TITLE="Queueing Networks - Insensitivity and a Heuristic Approximation",
JOURNAL=eik,
ADDRESS="SU",
VOLUME=14,
NUMBER=8,
PAGES="135-143",
YEAR=1978,
KEYWORDS="Queueing network",
}

@ARTICLE{Suna7801:Approximation,
AUTHOR="T. Sunaga and E. Kondo and S. K. Biswas",
TITLE="An Approximation Method Using Continuous Models for Queueing
Problems",
JOURNAL=jorsj,
ADDRESS="Japan",
VOLUME=21,
NUMBER=1,
PAGES="29-42",
YEAR=1978,
KEYWORDS="Queueing theory",
}

@ARTICLE{Sutt7801:Mathematical,
AUTHOR="D. Sutton",
TITLE="A Mathematical Study of the Partitioning of Overflow Traffic from
Limited Availability Groups",
JOURNAL=atr,
ADDRESS="Australia",
VOLUME=12,
NUMBER=1,
PAGES="46-55",
YEAR=1978,
KEYWORDS="Network planning; overflow traffic",
}

@ARTICLE{Tsan7804:Study,
AUTHOR="B. Tsankov",
TITLE="A Study of a Priority Queueing System Serving Data Traffic in
Telecommunication Networks",
JOURNAL="Elektropromishlenost i Priborostroene (In Bulgarian)",
ADDRESS="BG",
VOLUME=13,
NUMBER=4,
PAGES="162-165",
YEAR=1978,
LANGUAGE="Bulgarian",
KEYWORDS="Data communication; queueing system; priority",
}

@ARTICLE{Vida78:Pipeline,
AUTHOR="R. V. V. Vidal",
TITLE="Design of a Pipeline Route",
JOURNAL="Mathematical Programming Study",
VOLUME=9,
PAGES="95-108",
YEAR=1978,
KEYWORDS="Routing",
}

@TECHREPORT{Wall78:Overflow,
AUTHOR="B. Wallström",
TITLE="Overflow-beräkningar med användning av Interrupted Poisson
Processes {(IPP)}",
INSTITUTION="Lund Institute of Technology, Department of Communication
Systems",
ADDRESS="Lund, Sweden",
NUMBER="TETS-7006-04-26",
PAGES=16,
YEAR=1978,
LANGUAGE="Swedish",
KEYWORDS="Ipp",
}

@ARTICLE{Zaho7803:Queueing,
AUTHOR="J. L. Zahorjan and J. N. P. Hume and K. C. Sevcik",
TITLE="A Queueing Model of a Rotational Position Sensing Disk System",
JOURNAL=infor,
VOLUME=16,
NUMBER=3,
PAGES="199-216",
YEAR=1978,
KEYWORDS="Queueing system; disk; database",
}

@ARTICLE{Zeli7801:Two,
AUTHOR="A. M. Zelinskiy and Y. N. Kornyshev",
TITLE="Two Models of a System with Repeated Calls",
JOURNAL="Telecommunications and Radio Engineering",
ADDRESS="SU",
VOLUME=32,
NUMBER=1,
PAGES="43-47",
YEAR=1978,
KEYWORDS="Call reattempt; model",
}

@TECHREPORT{Jaco78:Trends,
AUTHOR="J. Jacobaeus",
TITLE="Some Trends in Teletraffic Theory and Its Applications",
INSTITUTION="L M Ericsson AB",
ADDRESS="Stockholm, Sweden",
NUMBER="Internal Report 0331",
PAGES=11,
YEAR=1978,
KEYWORDS="Traffic engineering",
}

@PROCEEDINGS{Weat78:Computer,
TITLE="Computer Performance Evaluation Users Group {(CPEUG):}
proceedings of the fourteenth meeting held at Boston, Massachusetts,
October 24--27, 1978",
EDITOR="James E. Weatherbee",
SERIES="NBS special publication",
PUBLISHER="U.S. National Bureau of Standards",
ADDRESS="Gaithersburg, Maryland",
VOLUME="500-41",
PAGES="xii + 373",
YEAR=1978,
}

@ARTICLE{Lam7801:New,
AUTHOR="S. S. Lam",
TITLE="A New Measure for Characterizing Data Traffic",
JOURNAL=ieeecom,
VOLUME="COM-26",
NUMBER=1,
PAGES="137-140",
MONTH=jan,
YEAR=1978,
KEYWORDS="queueing theory",
ABSTRACT="Introduces bursty factor for characterizing the burstiness of
a data traffic source, dependent only upon the traffic source
characteristics and performance requirements.",
}

@ARTICLE{Sche7801:Calculation,
AUTHOR="R. Schehrer",
TITLE="On the Calculation of Overflow Systems with a Finite Number of
Sources and Full Available Groups",
JOURNAL=ieeecom,
VOLUME="COM-26",
NUMBER=1,
PAGES="75-82",
MONTH=jan,
YEAR=1978,
KEYWORDS="queueing theory; overflow system",
ABSTRACT="This paper deals with the calculation of loss probabilities in
overflow systems with a finite number of sources and full available
groups. An exact, explicit solution is derived for overflow systems with
only one primary group. Furthermore, an exact method is applied in case
of overflow systems with two primary groups. For overflow systems with
an arbitrary number of primary groups an approximate method is developed
which takes into account the variance of offered overflow traffic. This
approximate method yields results which are in good agreement with exact
calculations and simulation results.",
}

@ARTICLE{Drag7801:Digital,
AUTHOR="P. G. Drago and A. M. Molinari and F. C. Vagliani",
TITLE="Digital dynamic speech detectors",
JOURNAL=ieeecom,
VOLUME="COM-26",
NUMBER=1,
PAGES="140-145",
MONTH=jan,
YEAR=1978,
KEYWORDS="packet voice; silence detection; digital speech
interpolation",
ABSTRACT="This paper proposes two dynamic-type speech detectors; their
performances are described also by means of in-field experimental
results. The two detectors are based on the same operational principle:
the presence of the speech signal is detected by analyzing the dynamic
variations of the short-term power of the channel signal. The speech
detector must have a high noise immunity and be able to recognize the
presence of phonemes without causing interruptions at the beginning,
middle or end of words. While the speech signal is a non-stationary
process with great variations in the short-time power, the background
noise is stationary and characterized by constant or slightly variable
short-time-power. The algorithms shown here process 8 bit A and
$\mu$-law PCM samples. Short-term power is computed by low-pass
filtering (first order recursive digital filter with simplified
structure) the absolute value signal. Any signal with power greater than
-30 or -40 dbm0 is considered speech. In addition, the relative
variation of the envelope signal is used. Finally, a low-power cutoff
(-50 dBm0) is used.",
}

@ARTICLE{West7801:Automated,
AUTHOR="C. H. West and P. Zafiropulo",
TITLE="Automated validation of a communications protocol: the {CCITT}
{X.21} recommendation",
JOURNAL=ibmjrd,
VOLUME=22,
NUMBER=1,
PAGES="60-71",
MONTH=jan,
YEAR=1978,
KEYWORDS="formal methods; protocol verification; X.21",
ABSTRACT="The call establishment procedure of the X.21 interface
recommended by the International Telegraph and Telephone Consultative
Committee (CCITT) has been validated as a test of a recently developed
theory and of an implemented system for automated communication protocol
validation. The test demonstrated the applicability of the validation
technique and identified a number of points where the interface state
diagram does not completely define the interface behavior.",
}

@ARTICLE{Dysa7801:NEWCLUST,
AUTHOR="H. G. Dysart and N. O. Georganas",
TITLE="{NEWCLUST} - An algorithm for the topological design of two-level
multidrop teleprocessing networks",
JOURNAL=ieeecom,
VOLUME="COM-26",
MONTH=jan,
YEAR=1978,
}

@ARTICLE{Fors7801:Operating,
AUTHOR="H. C. Forsdick and R. E. Schantz and R. Thomas",
TITLE="Operating Systems for Computer Networks",
JOURNAL=ieeecomp,
VOLUME=11,
PAGES="48-57",
NOTE="also in \cite{Abra80:Computer}",
MONTH=jan,
YEAR=1978,
}

@ARTICLE{Ensl7801:Distributed,
AUTHOR="P. H. Enslow",
TITLE="What is a Distributed Data Processing system?",
JOURNAL=ieeecomp,
PAGES="13-21",
MONTH=jan,
YEAR=1978,
}

@ARTICLE{Lauc7801:Note,
AUTHOR="Anthony Lauck",
TITLE="A Note on Network Symmetry and Call Collision",
JOURNAL=ccr,
VOLUME=8,
NUMBER=1,
MONTH=jan,
YEAR=1978,
}

@ARTICLE{Spri7801:RPCNET,
AUTHOR="Allen Springer and Livio Lazzeri and Luniano Lenzini",
TITLE="The Implementation of {RPCNET} on a Minicomputer",
JOURNAL=ccr,
VOLUME=8,
NUMBER=1,
MONTH=jan,
YEAR=1978,
}

@ARTICLE{Haje7801:Progress,
AUTHOR="Jan Hajek",
TITLE="Progress Report on the Automatic and Proven Protocol Verifiers",
JOURNAL=ccr,
VOLUME=8,
NUMBER=1,
MONTH=jan,
YEAR=1978,
}

@ARTICLE{Anon7801:Results,
AUTHOR="Anonymous",
TITLE="Results of the {ANSI} {X3S3.7} Survey on Datagram-Interface
Standard",
JOURNAL=ccr,
VOLUME=8,
NUMBER=1,
MONTH=jan,
YEAR=1978,
}

@ARTICLE{Anon7801:ISO,
AUTHOR="Anonymous",
TITLE="{ISO} Position on Datagram Service",
JOURNAL=ccr,
VOLUME=8,
NUMBER=1,
MONTH=jan,
YEAR=1978,
}

@TECHREPORT{Pede7801:Approximations,
AUTHOR="P. W. Pedersen",
TITLE="Some Approximations and Algorithms for Calculators and
Microcomputers",
INSTITUTION="Matematisk Institut, Danmarks tekniske Hojskole",
PAGES=30,
MONTH=jan,
YEAR=1978,
KEYWORDS="numerical method",
ABSTRACT="Pocket calculators",
}

@ARTICLE{Zieg7802:Delay,
AUTHOR="Chaim Ziegler and Donald L. Schilling",
TITLE="Delay Decomposition at a Single Server Queue with Constant
Service Time and Multiple Inputs",
JOURNAL=ieeecom,
VOLUME="COM-26",
NUMBER=2,
PAGES="290-295",
MONTH=feb,
YEAR=1978,
KEYWORDS="queueing theory",
ABSTRACT="Two networks consisting of single server queues [infinite
storage], each with a constant service time, are considered. The
external inputs to each network are assumed to follow some general
probability distribution. Several interesting equivalencies that exist
between the two networks considered are derived. This leads to the
introduction of an important concept in delay decomposition. It is shown
that the waiting time experienced by a customer can be decomposed into
two basic components called self delay and interference delay.",
}

@INPROCEEDINGS{Cohe7802:Protocol,
AUTHOR="Danny Cohen",
TITLE="A protocol for packet-switching voice communication",
BOOKTITLE="Computer Network Protocols Symposium",
ADDRESS="Liege, Belgium",
MONTH=feb,
YEAR=1978,
KEYWORDS="packet voice; NVP; real-time communication",
}

@ARTICLE{Stew7802:Comparison,
AUTHOR="W. J. Stewart",
TITLE="A comparison of numerical techniques in Markov modeling",
JOURNAL=cacm,
VOLUME=21,
NUMBER=2,
PAGES="144-152",
MONTH=feb,
YEAR=1978,
KEYWORDS="Markov chain; linear equation",
}

@INPROCEEDINGS{Benn7802:Measurements,
AUTHOR="C. J. Bennett and A. J. Hinchley",
TITLE="Measurements of the Transmission Control Protocol",
BOOKTITLE="Computer Network Protocols Symposium",
ADDRESS="Liege, Belgium",
PAGES="G1/1-11",
MONTH=feb,
YEAR=1978,
}

@ARTICLE{Ritc7802:Common,
AUTHOR="A. E. Ritchie and J. Z. Menard",
TITLE="Common Channel Interoffice Signaling: An Overview",
JOURNAL=bstj,
VOLUME=57,
NUMBER=2,
PAGES="221-224",
MONTH=feb,
YEAR=1978,
KEYWORDS="telephone network; CCIS; common-channel signaling",
}

@ARTICLE{Dahl7802:Common,
AUTHOR="C. A. Dahlbom and J. S. Ryan",
TITLE="Common Channel Interoffice Signaling: History and Description of
a New Signaling System",
JOURNAL=bstj,
VOLUME=57,
NUMBER=2,
PAGES="225-250",
MONTH=feb,
YEAR=1978,
KEYWORDS="telephone network; CCIS; common-channel signaling",
ABSTRACT="A new interoffice signaling system known as the Common Channel
Interoffice Signaling System (CCIS) has been introduced into the Bell
System's DDD toll network.  It represents a major step forward in
signaling systems by providing high speed data links between processors
of stored-protram-controlled switching offices to carry all signaling
and network control information, completely independent of the
communication paths used by customers.  As CCIS implementation proceeds
it will have an expanding and significant impact on the DDD network
system performance due to improved speed of signaling and provision of
signals to provide a multitude of new network and customer services. The
history of common channel signaling is traced from early mechanical
implementation to use of present-day technological advances.  The
fundamental concepts, basic features, signal formats and system
operation are described.",
}

@ARTICLE{Mill7802:Common,
AUTHOR="C. A. Dahlbom and J. S. Ryan",
TITLE="Common Channel Interoffice Signaling: Signaling Network",
JOURNAL=bstj,
VOLUME=57,
NUMBER=2,
PAGES="263-282",
MONTH=feb,
YEAR=1978,
KEYWORDS="telephone network; CCIS; common-channel signaling",
ABSTRACT="The CCIS signaling network provides an efficient reliable
signaling capability for calls between CCIS-equipped switching offices.
This article contains a description of the signaling network and the
Signal Transfer Points.  The discussion highlights the nromal signaling
message routing as well as the reaction to system failures.",
}

@ARTICLE{Fayo7803:Analytic,
AUTHOR="G. Fayolle and E. Gelenbe and",
TITLE="An Analytic Evaluation of the Performance of the ``Send and
Wait'' Protocol",
JOURNAL=ieeecom,
VOLUME="COM-26",
NUMBER=3,
PAGES="313-319",
MONTH=mar,
YEAR=1978,
KEYWORDS="queueing theory; ARQ",
ABSTRACT="In this study, we are concerned with a simple error control
protocol, the ``send and wait'' protocol, which uses the classical
technique of positive acknowledgement and time-out periods. We first
analyze the influence of the time-out on the packet transmission rate.
Then we use a queueing analysis to obtain the ergodicity condition and
to compute the buffer queue length probability distribution. Finally we
compute buffer overflows when a finite number of packets are allowed to
enter the node. This analysis allows us to obtain optimum values of the
time-out in order to maximize throughput, or to minimize average transit
delay through the node or buffer overflow probabilities.",
}

@ARTICLE{Irla7803:Buffer,
AUTHOR="M. I. Irland",
TITLE="Buffer Management in a Packet Switch",
JOURNAL=ieeecom,
VOLUME="COM-26",
NUMBER=3,
PAGES="328-337",
MONTH=mar,
YEAR=1978,
KEYWORDS="queueing theory",
ANNOTE="Restricted buffer sharing with limited queue length; square-root
rule; Poisson arrivals; exponential packet length.",
}

@ARTICLE{Jage7803:Inversion,
AUTHOR="D. L. Jagerman",
TITLE="An inversion technique for the Laplace transform with
applications to approximation",
JOURNAL=bstj,
VOLUME=57,
NUMBER=3,
PAGES="669-710",
MONTH=mar,
YEAR=1978,
KEYWORDS="Laplace transform; inversion; Widder transform",
ABSTRACT="Properties of a sequence of positive operators defined by the
Widder Laplace inversion formula are studied in order to obtain
practical methods for the inversion of the Laplace transform, practical
error formulae, and useful approximations to given functions. The
approximation procedure retains essential structural characteristics of
the original function, e.g., nonnegativity, monotonicity, and convexity.
Thus a distribution function is approximated by distribution functions.
Enhancement techniques are provided for the improvement of accuracy for
a given order of approximation. The methods are illustrated by
applications to renewal theory and to the covariance and recovery
functions of telephoen traffic theory.",
}

@TECHREPORT{Lars7803:Structural,
AUTHOR="R. E. Larson",
TITLE="Structural System Models for Locational Decisions: An Example
Using the Hypercube Queueing Model",
INSTITUTION="Operations Research Center, Massachusetts Institute of
Technology",
NUMBER=145,
PAGES=64,
MONTH=mar,
YEAR=1978,
KEYWORDS="Queueing system; hypercube",
}

@INPROCEEDINGS{Benn7803:Numerical,
AUTHOR="A. W. Bennett and R. Ed. Vichnevetsky",
TITLE="Numerical methods for differential equations and simulation",
BOOKTITLE="IMACS (IACA)",
ADDRESS="Blacksburg, Virginia, USA",
PAGES="1-222",
DAYS=9,
MONTH=mar,
YEAR=1978,
KEYWORDS="Numerical method; differential equation; simulation;
optimization; special issue",
ABSTRACT="In addition to the major topic of simulation software and
numerical methods for differential equations, this volume also contains
related papers on parameter and systems optimization, curve fitting,
numerical methods for partial differential equations and two-point
foundry value problems.",
}

@ARTICLE{Kekr7804:Finite,
AUTHOR="H. B. Kekre and C. L. Saxena",
TITLE="Finite Buffer Behavior with Poisson Arrivals and Random Server
Interruptions",
JOURNAL=ieeecom,
VOLUME="COM-26",
NUMBER=4,
PAGES="470-474",
MONTH=apr,
YEAR=1978,
KEYWORDS="discrete time queue",
ABSTRACT="A queueing model with finite buffer size, Poisson arrival
process, synchronous transmission and server interruptions is studied
through a Bernoulli sequence of independent random variables. An
integrated digital voice-date system with synchronous time-division
multiplexing (STDM) for voice sources and Poisson arrival process for
data messages is considered as an application for this model. The
relationships among overflow probabilities, buffer size and expected
queueing delay due to buffering for various traffic intensities are
obtained. The results of this study are portrayed on graphs and may be
used as guide lines for the buffer design in digital voice data systems.
Although this study arose in the design of a buffer for digital
voice-data systems, the queueing model developed is quite general and
may be useful for other industrial applications.",
}

@ARTICLE{Chen7804:Generating,
AUTHOR="R.-G. Cheng",
TITLE="Generating beta variates with nonintegral shape parameters",
JOURNAL=cacm,
VOLUME=21,
NUMBER=4,
PAGES="317-322",
MONTH=apr,
YEAR=1978,
KEYWORDS="random variate generation",
}

@TECHREPORT{Hopp7804:Local,
AUTHOR="Andrew Hopper",
TITLE="Local Area Computer Communication Network",
INSTITUTION="University of Cambridge Computer Laboratory",
NUMBER="TR-7",
NOTE="Dissertation submitted for PhD Thesis",
MONTH=apr,
YEAR=1978,
}

@TECHREPORT{Nati7804:Local,
TITLE="Local area networking",
EDITOR="I. W. Cotton",
TYPE="NBS Special Publication",
INSTITUTION="National Bureau of Standards",
NUMBER="500-31",
MONTH=apr,
YEAR=1978,
}

@ARTICLE{Ono7804:Interface,
AUTHOR="K. Ono and Y. Urano and Ken-Ichi Suzuki and Hiroshi Matsunaga
and Yuzo Tanaka and Shunichi Sakurai",
TITLE="Interface Communication Processor for Public Packet Switching
Networks",
JOURNAL=ccr,
VOLUME=8,
NUMBER=2,
MONTH=apr,
YEAR=1978,
}

@ARTICLE{Anon7804:Concerning,
AUTHOR="Anonymous",
TITLE="Issues Concerning the Frame Mode {DTE/DCE} {(FDTE/DCE)}
Interface",
JOURNAL=ccr,
VOLUME=8,
NUMBER=2,
MONTH=apr,
YEAR=1978,
}

@ARTICLE{Anon7804:Conference,
AUTHOR="Anonymous",
TITLE="Conference Review: Computer Network Protocols Symposium",
JOURNAL=ccr,
VOLUME=8,
NUMBER=2,
MONTH=apr,
YEAR=1978,
}

@ARTICLE{Tadi7805:Computer,
AUTHOR="P. R. Tadikamalla",
TITLE="Computer generation of gamma random variables",
JOURNAL=cacm,
VOLUME=21,
NUMBER=5,
PAGES="419-422",
MONTH=may,
YEAR=1978,
KEYWORDS="random variate generation",
}

@BOOK{Gran7805:Thirty,
AUTHOR="J.-L. Grange and M. I. Irland",
TITLE="Thirty nine steps to a computer networking",
PUBLISHER="IRIA Report",
MONTH=may,
YEAR=1978,
}

@ARTICLE{Mann7805:Datagram,
AUTHOR="E. Manning",
TITLE="On datagram service in public packet-switched networks",
JOURNAL=cn,
PAGES="79-83",
MONTH=may,
YEAR=1978,
}

@TECHREPORT{BBN7805:Specifications,
AUTHOR="B. B. N",
TITLE="Specifications for the Interconnection of a Host and an {IMP}",
INSTITUTION="Bolt, Beranek and Newman",
NUMBER=1822,
MONTH=may,
YEAR=1978,
}

@TECHREPORT{Flan7805:Packet,
AUTHOR="J. L. Flanagan",
TITLE="Packet transmission of speech",
TYPE="U.S. Patent",
INSTITUTION="Bell Telephone Laboratories",
ADDRESS="Murray Hill, New Jersey",
NUMBER="4,100,377",
MONTH=may,
YEAR=1978,
KEYWORDS="packet audio; packet voice; TASI",
ABSTRACT="A multiplex transmission system is disclosed in which speech
activity is detected as a sequence of talkspurts and intervening silent
intervals.  The speech information is encoded and accumulated in a
buffer store by omitting the silent intervals.  A time stamp is
associated with each talkspurt code burst to permit approximate
reconstruction of the talkspurt time structure at the receiver.  The
talkspurt code bursts are assembled into packets of optimum size for
transmission on shared transmission facilities, such as a Time
Assignment Speech Interpolation (TASI) system.The assembled talkspurt
packets can be encoded by an adaptive technique responsive to the
loading on the transmission facilities and can be transmitted at a rate
faster than real-time speech generation to accommodate high-level usage
on the shared transmission facilities.",
URL="http://patent.womplex.ibm.com/details?patent\_number=4100377",
}

@INPROCEEDINGS{Raja8005:Routing,
AUTHOR="A. Rajaraman",
TITLE="Routing in Tymnet",
BOOKTITLE="EUROCOMP",
PUBLISHER="The European computing Conf., London",
MONTH=may,
YEAR=1978,
}

@ARTICLE{Fuji7806:Error,
AUTHOR="F. C. Fujiwara and M. Kasahara and K. Yamashita and T.
Namekawa",
TITLE="Evaluations of Error-Control Techniques in Both Independent and
Dependent-Error Channels",
JOURNAL=ieeecom,
VOLUME="COM-26",
NUMBER=6,
PAGES="785-793",
MONTH=jun,
YEAR=1978,
KEYWORDS="error control; ARQ",
ABSTRACT="Error control techniques in the various digital data
transmission systems can be divided into three classes, i.e., classes of
forward error correction (FEC), automatic repeat request (ARQ), and FEC
embedded within ARQ (Hybrid). We exactly analyze and compare the
performances of these error control techniques in both independent-error
and dependent-error channels. It is shown that among the various error
control techniques the Go-Back-2 ARQ system offers the best performance
over a wide range of the channel error rate, ie., $P\_e \leq 10^{-4}$,
regardless of the type of the channel. The various numerical results are
shown graphically along with the discussions.",
ANNOTE="Maximum throughput of stop-and-wait and go-back-$N$.",
}

@INPROCEEDINGS{Kapl7806:Queue,
AUTHOR="Michael Kaplan",
TITLE="The Queue {$D/D/1$} with a Poisson Background",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Toronto, Canada",
PAGES="36.5.1-36.5.4",
MONTH=jun,
YEAR=1978,
KEYWORDS="queueing theory",
ABSTRACT="Two streams of customers compete for service in first-in,
first-out (FIFO) fashion at a single deterministic server of rate $1/b$.
Of the two streams, one (the primary) is deterministic, with
inter-arrival times $\alpha$; the other (the background) is Poisson. The
problem is to solve for the steady-state statistics of waiting-time for
primary customers and also of virtual waiting time. It is shown that
there is a single closed-form expression for the (transform) solution
whenever $b(\alpha-b)^{-1}$ is an integer. The result gives an estimate
of message delay in a certain elemental packet-switching node receiving
both exogenous and endogenous message streams.",
ANNOTE="$M+D/D/1$",
}

@INPROCEEDINGS{Klei7806:Flow,
AUTHOR="L. Kleinrock",
TITLE="On Flow Control in Computer Networks",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Toronto, Canada",
PAGES="27.2.1-27.2.5",
MONTH=jun,
YEAR=1978,
KEYWORDS="congestion control",
ABSTRACT="The paper discusses the effect that flow control procedures
have on the throughput in a computer network. We introduce the notion of
starvation and use it as a basis for the measure of the cost of any flow
control procedure. For any given flow control procedure, we then apply a
previously defined measure of power and show how to identify that
operating point which yields maximum power.",
}

@INPROCEEDINGS{Mino7806:General,
AUTHOR="Daniel Minoli",
TITLE="General Geometric Arrival-Constant Server Queue with Applications
to Packetized Voice",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Toronto, Canada",
VOLUME=3,
PAGES="36.6.1-36.6.5",
MONTH=jun,
YEAR=1978,
KEYWORDS="discrete time queue; packet voice",
ANNOTE="discrete time, $Geo/D/1/\infty$ queue, where service time is any
rational multiple of the interarrival slot size. Steady-state
probabilities are computed by explicit matrix multiplication.",
}

@INPROCEEDINGS{Ulug7806:Unique,
AUTHOR="M. E. Ulug",
TITLE="A unique flow control technique for a transparent intelligent
network",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Toronto, Canada",
PAGES="24.2.1-24.2.11",
MONTH=jun,
YEAR=1978,
KEYWORDS="flow control",
ABSTRACT="Unlike a conventional packet switched network, in TI-NET
packets are transmitted and switched in parallel. In other words, each
customer uses a small fraction of a given link capacity, i.e., one of
its channels. Because of this, TI-NET flow control is called ``channel
flow control''.",
}

@INPROCEEDINGS{Ulug7806:Admission,
AUTHOR="M. E. Ulug and J. G. Gruber and N. Janakiraman",
TITLE="Admission delays in a transparent intelligent network",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Toronto, Canada",
PAGES="27.6.1-27.6.11",
MONTH=jun,
YEAR=1978,
KEYWORDS="admission control",
}

@INPROCEEDINGS{Miya7806:Integrated,
AUTHOR="H. Miyahara and Toshiharu Hasegawa",
TITLE="Integrated switching with variable frame and packet",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Toronto, Canada",
VOLUME=2,
PAGES="20.3.1-20.3.5",
MONTH=jun,
YEAR=1978,
KEYWORDS="speech transmission; integrated services; hybrid switching",
}

@INPROCEEDINGS{McAu7806:Integrated,
AUTHOR="Daniel J. McAuliffe",
TITLE="An integrated approach to communications switching",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Toronto, Canada",
PAGES="20.4.1-20.4.5",
MONTH=jun,
YEAR=1978,
KEYWORDS="packet voice; network architecture; integrated services",
ABSTRACT="Digital technology and in particular, LSI, has provided for
the possibility of new and innovative design approaches to the strategic
or local communications environment. This coupled with the significant
growth in the number of computer based equipments/systems that require
the support of a communications switching (or distribution) network has
created the need for new approaches to our overall concepts of
communications switching and our ability to implement them. Since 1967,
the United States Air Forces' Rome Air Development, Griffiss Air Force
Base, New York under the Automated Data Processing (ADP)
Telecommunications Program, has been actively engaged in research and
development which will allow for the introduction of integrated digital
communications concepts in large strategic systems as well as the local
communications area. The purpose of the ADP telecommunications program
is to establish a test facility that can be used to conduct experiments
on various concepts for integrated switching. This testbed is in
actuality a switch which has the ability to interface with and switch
the following forms of communications: analog and digital voice, PCM
trunks, teletype, AUTODIN, host computers and terminals. The overall
test facility is designed to switch traffic generated from the
complement of terminals or where a large amount of traffic is required
for test and evaluation of the concepts under stressed conditions, from
a simulated source which derives its data from estimated traffic
conditions. Intrinsic data collection routines collect the necessary
data which through an off-line data reduction program produces figures
of merit, such as mean packet delay, for evaluation of the concept under
evaluation. The outcome is a functional design for a future integrated
node. This paper reports on the results of the above mentioned program
with the intent to show how such technology has allowed for the
introduction of new concepts in the local communications environment.",
}

@INPROCEEDINGS{Hsie7806:Hybrid,
AUTHOR="W. Hsieh and I. Gitman and B. Occhiogrosso",
TITLE="Design of hybrid-switched networks for voice and data",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Toronto, Canada",
PAGES="20.1.1-20.1.9",
MONTH=jun,
YEAR=1978,
KEYWORDS="integrated services; hybrid switching",
}

@INPROCEEDINGS{Rudi7806:Integration,
AUTHOR="Harry Rudin",
TITLE="Studies on the integration of circuit and packet switching",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Toronto, Canada",
VOLUME=2,
PAGES="20.2.1-20.2.7",
MONTH=jun,
YEAR=1978,
KEYWORDS="networks; economics; circuit switching; packet switching",
ABSTRACT="This paper summarizes a several-year research study by the
Data Networks Group on the integration of circuit and packet switching
in the context of data networks. Given the growing interest in
integrated systems it is worthwhile bringing together here the main
results of a number of previously published component studies and
setting these into relation with one another. The topics covered are: 1)
performance and cost comparison of the two switching techniques; 2)
multiplexing at the trunk level; 3) an integrated interface based on the
CCITT X.21 specification; 4) routing for the packet- and
circuit-switched subnetworks; 5) a multiple processor design for the
network nodes; 6) the overall architecture.",
}

@PROCEEDINGS{Ferr7806:Computer,
TITLE="The performance of computer installations evaluation and
management",
EDITOR="D. Ferrari",
PUBLISHER="Proc. International conference on performance of computer
installations (ICPCI)",
PAGES="1-332",
MONTH=jun,
YEAR=1978,
KEYWORDS="Performance evaluation; monitoring; information system;
process control; operating system; method; special issue",
ANNOTE="This book contains 25-30 papers on the most recent advances in
some of the crucially important areas of computer installation
performance evaluation and management.  Included are discussions of
novel ideas and results of research workload characterization, benchmark
construction and usage, tuning methods, monitoring technology, capacity
planning, equipment procurement, cost-benefit analysis of performance
evaluation of virtual",
}

@INPROCEEDINGS{Buze7806:BEST,
AUTHOR="J. P. Buzen and R. P. Goldberg and A. M. Langer and E. Lentz and
 others",
TITLE="{BEST/1} -- design of a tool for computer system capacity
planning",
BOOKTITLE=ncc,
EDITOR="S. P. Ghosh and L. Y. Liu",
ADDRESS="Anaheim",
PAGES="447-455",
MONTH=jun,
YEAR=1978,
KEYWORDS="Computer tool; performance evaluation",
}

@INPROCEEDINGS{Merl7806:Tool,
AUTHOR="D. Merle and D. Potier and M. Veran",
TITLE="A tool for computer system performance analysis",
BOOKTITLE="International Conference on the Performance of Computer
Installations",
ADDRESS="Gardone Riviera",
PAGES="195-213",
MONTH=jun,
YEAR=1978,
KEYWORDS="Computer tool; performance evaluation",
}

@ARTICLE{Toba7806:Effect,
AUTHOR="F. A. Tobagi and L. Kleinrock",
TITLE="The Effect of Acknowledgement Traffic on the Capacity of Packet
Switched Radio Channels",
JOURNAL=ieeecom,
VOLUME="COM-26",
PAGES="815-826",
MONTH=jun,
YEAR=1978,
}

@BOOK{Kjel78:Erlang,
AUTHOR="V. Kjeldsen",
TITLE="Erlang, Trafiktabeller og Lommeregneren",
PUBLISHER="Jydsk Telefon",
ADDRESS="Aarhus, Denmark",
PAGES=14,
MONTH=jun,
YEAR=1978,
LANGUAGE="Danish",
KEYWORDS="table",
}

@ARTICLE{Pipp7806:Complexity,
AUTHOR="N. Pippenger",
TITLE="Complexity Theory",
JOURNAL="Scientific American",
PAGES="90-100",
MONTH=jun,
YEAR=1978,
KEYWORDS="Complexity; theory",
}

@ARTICLE{West7807:General,
AUTHOR="C. H. West",
TITLE="General technique for communications protocol validation",
JOURNAL=ibmjrd,
VOLUME=22,
NUMBER=4,
PAGES="393-404",
MONTH=jul,
YEAR=1978,
KEYWORDS="protocol verification; formal methods; protocol validation;
finite state machine",
ABSTRACT="A technique for the validation of protocols in communication
systems is described. It can be used for systems composed of processes
that can be modeled as finite directed graphs. The validation
exhaustively exercises the interaction domain of a system and identifies
all occurrences of a number of well-defined error conditions. The method
can detect when individual processes have no predefined response to
incoming messages, as well as system deadlocks and potential loss of
messages due to overflow conditions.",
}

@ARTICLE{Lamp7807:Time,
AUTHOR="Leslie Lamport",
TITLE="Time, clocks, and the ordering of events in a distributed
system",
JOURNAL=cacm,
VOLUME=21,
NUMBER=7,
PAGES="558-565",
MONTH=jul,
YEAR=1978,
KEYWORDS="distributed systems; computer networks; clock synchronization;
multiprocess systems",
ABSTRACT="The concept of one event happening before another in a
distributed system is examined, and is shown to define a partial
ordering of the events. A distributed algorithm is given for
synchronizing a system of logical clocks which can be used to totally
order the events. The use of the total ordering is illustrated with a
method for solving synchronization problems. The algorithm is then
specialized for synchronizing physical clocks, and a bound is derived on
how far out of synchrony the clocks can become.",
}

@ARTICLE{Jewe7807:Queing,
AUTHOR="J. Jewett and J. B. Shrago",
TITLE="Queing and Time-of-Day Routing in Multi-Point switched voice
networks",
JOURNAL=bcr,
MONTH=jul,
YEAR=1978,
KEYWORDS="Delay system",
}

@ARTICLE{Raws7807:Fibernet,
AUTHOR="E. G. Rawson and R. M. Metcafe",
TITLE="Fibernet: Multimode Optical Fibers for Local Computer Networks",
JOURNAL=ieeecom,
VOLUME="COM-26",
PAGES="983-990",
NOTE="also in \cite{Thur81:Tutorial}",
MONTH=jul,
YEAR=1978,
}

@ARTICLE{Aho7807:AWK,
AUTHOR="A. V. Aho and  Weinberger and B. W. Kernighan",
TITLE="{AWK} - a pattern scanning and processing language",
JOURNAL=spe,
MONTH=jul,
YEAR=1978,
}

@ARTICLE{Mats7807:Overall,
AUTHOR="Y. Matsushita and Mikio Sakuma and Hideki Nishigaki and
Nobuyoshi Miyazaki and Isamu Yoshida",
TITLE="An Overall Network Architecture Suitable for Implementation with
either Datagram or Virtual Circuits Facilities",
JOURNAL=ccr,
VOLUME=8,
NUMBER=3,
MONTH=jul,
YEAR=1978,
}

@ARTICLE{Brad7807:X,
AUTHOR="Colin Bradbury",
TITLE="{X.25} Asymmetries and How to Avoid Them",
JOURNAL=ccr,
VOLUME=8,
NUMBER=3,
MONTH=jul,
YEAR=1978,
}

@ARTICLE{N7807:Provisional,
AUTHOR="I. S. O/TC 97/SC 16 N34",
TITLE="Provisional Model of Open-Systems Architecture",
JOURNAL=ccr,
VOLUME=8,
NUMBER=3,
MONTH=jul,
YEAR=1978,
}

@TECHREPORT{Berm7807:Congested,
AUTHOR="O. Berman and R. E. Larson",
TITLE="The Congested Median Problem",
TYPE="Working Paper",
INSTITUTION="Operations Research Center, Massachusetts Institute of
Technology",
PAGES=21,
MONTH=jul,
YEAR=1978,
KEYWORDS="Queueing theory",
}

@ARTICLE{Wein7808:Fractional,
AUTHOR="Clifford J. Weinstein",
TITLE="Fractional Speech Loss and Talker Activity Model for {TASI} and
for Packet-Switched Speech",
JOURNAL=ieeecom,
VOLUME="COM-26",
NUMBER=8,
PAGES="1253-1257",
MONTH=aug,
YEAR=1978,
ANNOTE="Derives cutout fraction in TASI. For packet voice, describes
packet loss when queueing delays is limited to packetization interval.
Presents simple Markov model for number of active speakers, mentioning
that it agrees well with observed data for 25 or more speakers.",
}

@ARTICLE{Wils7808:Startup,
AUTHOR="James R. Wilson and A. Alan B. Pritsker",
TITLE="Evaluation of startup policies in simulation experiments",
JOURNAL="Simulation",
VOLUME=31,
NUMBER=3,
PAGES="79-89",
MONTH=aug,
YEAR=1978,
ABSTRACT="This paper describes a procedure for evaluating proposed
startup policies that define the initial conditions and the truncation
point in a simulation experiment. The evaluation procedure involves the
tabulation of bias, variance, and mean square error of the sample mean
over a fixed range of truncation points and initial conditions. For each
policy, the tabulated values are averaged with respect to an empirical
truncation-point distribution based on independent model runs. These
results are used to construct confidence intervals for the steady-state
mean with the same average length for all policies; the corresponding
average confidence interval coverage can then be used to compare
policies. --- To illustrate the procedure, several well-known policies
are evaluated for two finite-state Markovian queueing systems - a single
server queue with a capacity of 15 and a machine-repair system with 3
repairmen and 14 machines. The results for both systems indicate that
the best initial condition is the most frequently observed value (the
mode) of the steady-state distribution of the number-in-system process,
and that the judicious selection of an initial condition is more
effective than truncation in improving the performance of the sample
mean as an estimator of the steady-state mean.",
ANNOTE="Simulation.",
}

@ARTICLE{Wils7808:Research,
AUTHOR="James R. Wilson and A. Alan B. Pritsker",
TITLE="A Survey of research on the simulation startup problem",
JOURNAL="Simulation",
VOLUME=31,
NUMBER=2,
PAGES="55-58",
MONTH=aug,
YEAR=1978,
ABSTRACT="The reduce the effects of initial conditions on the results of
a simulation experiment, several authors have proposed startup policies
that specify how to minimize the warmup period and identify the
truncation point beyond which observations are to be recorded and
analyzed. Other approaches to this problem have used results from
time-series analysis and queueing theory. This paper surveys research on
the simulation startup problem; a companion paper presents a procedure
for evaluating startup policies when the mean of the truncated sample is
to be used to estimate the steady-state mean of the underlying
process.",
ANNOTE="Simulation.",
}

@INPROCEEDINGS{Burf7808:Comparative,
AUTHOR="R. L. Burford and J. E. Willis",
TITLE="The comparative quality of unit normal variates generated by the
Box-Muller algorithm using alternative unit uniform generators",
BOOKTITLE="Annual Meeting of the American Statistical Association",
ADDRESS="San Diego",
PAGES="84-89",
MONTH=aug,
YEAR=1978,
KEYWORDS="random variate generation",
}

@INPROCEEDINGS{Gate7808:Generating,
AUTHOR="C. E. Gates",
TITLE="Generating random normal deviates using a modified Butler
algorithm",
BOOKTITLE="Annual Meeting of the American Statistical Association",
ADDRESS="San Diego",
PAGES="111-114",
MONTH=aug,
YEAR=1978,
KEYWORDS="random variate generation",
}

@INPROCEEDINGS{Kind7808:Recent,
AUTHOR="A. J. Kinderman and J. F. Monahan",
TITLE="Recent developments in the computer generation of Student's $t$
and gamma random variables",
BOOKTITLE="Annual Meeting of the American Statistical Association",
ADDRESS="San Diego",
PAGES="90-94",
MONTH=aug,
YEAR=1978,
KEYWORDS="random variate generation",
}

@INPROCEEDINGS{Kron7808:Alias,
AUTHOR="R. Kronmal and A. V. Peterson and E. D. Lundberg",
TITLE="The alias-rejection-mixture method for generating random
variables from continuous distributions",
BOOKTITLE="Annual Meeting of the American Statistical Association",
ADDRESS="San Diego",
PAGES="106-110",
MONTH=aug,
YEAR=1978,
KEYWORDS="random variate generation",
}

@INPROCEEDINGS{Gerh7808:Pacific,
AUTHOR="L. H. Gerhardstein and J. O. Schroeder and A. J. Boland",
TITLE="The Pacific Northwest Laboratory Minicomputer Network",
BOOKTITLE="3rd Berkeley Workshop on Distributed Data Management and
Computer Networks",
PAGES="144-158",
NOTE="also in \cite{Thur81:Tutorial}",
MONTH=aug,
YEAR=1978,
}

@INPROCEEDINGS{Solb7808:Mathematical,
AUTHOR="J. J. Solberg",
TITLE="A Mathematical Model of Computerized Manufacturing Systems",
BOOKTITLE="4th International Conference on Production Research",
ADDRESS="Tokyo, Japan",
PAGES="1265-1275",
MONTH=aug,
YEAR=1978,
KEYWORDS="Manufacturing system",
ABSTRACT="This paper presents a mathematical model which can be used to
gain both qualitative and quantitative information about existing and
proposed computerized manufacturing systems.  The model is based on
known results from queueing network theory.  It is shown to be capable
of providing a considerable variety of useful",
}

@ARTICLE{Minh7809:Discrete,
AUTHOR="Do Quang Minh",
TITLE="The Discrete-Time Single-Server Queue with Time-Inhomogeneous
Compound Poisson Input and General Service Time Distribution",
JOURNAL=jap,
VOLUME=15,
NUMBER=3,
PAGES="590-601",
MONTH=sep,
YEAR=1978,
KEYWORDS="discrete time queue",
ABSTRACT="This paper studies a discrete-time, single server queueing
model having a compound Poisson input with time-dependent parameters and
a general service time distribution. All major transient characteristics
of the system can be calculated very easily. For the queueing model with
periodic arrival function, some explicit results are obtained.",
}

@INPROCEEDINGS{Geor7809:Numerical,
AUTHOR="Nicolaos D. Georganas",
TITLE="Numerical analysis of computer communication networks with
multilevel flow control",
BOOKTITLE=compcon,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
PAGES="4-11",
MONTH=sep,
YEAR=1978,
KEYWORDS="flow control; computer networks",
}

@INPROCEEDINGS{Tows7809:Error,
AUTHOR="Donald F. Towsley",
TITLE="Error detection and retransmission schemes in computer
communication networks",
BOOKTITLE=compcon,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
PAGES="12-18",
MONTH=sep,
YEAR=1978,
KEYWORDS="error detection; ARQ; transport protocols",
ABSTRACT="In this paper, we compare the effects that a variety of ARQ
error detection and retransmission schemes have on 1) maximum message
throughput rates, 2) average message delays, and 3) average queue
lengths through the use of analytical and simulation techniques. We
consider both ``stop and wait'' and ``continuous'' ARQ schemes along
with several variations. Finally, we discuss the similarities of ARQ
schemes with flow control protocols.",
}

@INPROCEEDINGS{Toba7809:Slotted,
AUTHOR="F. A. Tobagi",
TITLE="Analysis of slotted Aloha in a centralized two-hop packet radio
network",
BOOKTITLE=compcon,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
PAGES="19-26",
MONTH=sep,
YEAR=1978,
KEYWORDS="Aloha; media access; performance evaluation",
}

@INPROCEEDINGS{Good7809:Verifiable,
AUTHOR="Donald I. Good and Richard M. Cohen",
TITLE="Verifiable communications processing in Gypsy",
BOOKTITLE=compcon,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
PAGES="28-35",
MONTH=sep,
YEAR=1978,
KEYWORDS="verification",
}

@INPROCEEDINGS{Whyd7809:MHE,
AUTHOR="R. Whyde and K. Seikel and T. Kowalski",
TITLE="{MHE} -- a communications tool",
BOOKTITLE=compcon,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
PAGES="36-45",
MONTH=sep,
YEAR=1978,
KEYWORDS="emulator",
ABSTRACT="A mini host emulator (MHE) system has been developed within
the software systems division of Diebold, Incorporated to provide
communications support for the automated teller machines (ATM's)
produced there. This system will be described as it evolved from two
prior developments to its current implementation and use to support the
areas of communication hardware development, manufacturing, and terminal
software development. Specifically, an interpretive language, RAYBOL, a
major tool for hardware and manufacturing use, will be outlined.",
}

@INPROCEEDINGS{Varn7809:Criteria,
AUTHOR="R. C. Varney and N. P. Groundwater",
TITLE="Criteria for architecture verification",
BOOKTITLE=compcon,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
PAGES="40-45",
MONTH=sep,
YEAR=1978,
KEYWORDS="computer architecture",
}

@INPROCEEDINGS{McCa7809:Online,
AUTHOR="Davis B. McCarn",
TITLE="Online services of the National Library of Medicine",
BOOKTITLE=compcon,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
PAGES="48-53",
MONTH=sep,
YEAR=1978,
KEYWORDS="on-line services; information services",
}

@INPROCEEDINGS{Baye7809:Dialog,
AUTHOR="Mark P. Bayer",
TITLE="Dialog -- an online retrieval system for bibliographic
information",
BOOKTITLE=compcon,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
PAGES="54-58",
MONTH=sep,
YEAR=1978,
KEYWORDS="information services",
}

@INPROCEEDINGS{Blac7809:System,
AUTHOR="Donald V. Black",
TITLE="System Development Corporation's search service",
BOOKTITLE=compcon,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
PAGES="59-64",
MONTH=sep,
YEAR=1978,
KEYWORDS="information services",
}

@INPROCEEDINGS{Quak7809:Bibliographhic,
AUTHOR="Ronald Quake and Janet Egeland",
TITLE="Bibliographhic Retrieval Services, Inc {(BRS):} a new company
with new ideas in the online information industry",
BOOKTITLE=compcon,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
PAGES="65-69",
MONTH=sep,
YEAR=1978,
KEYWORDS="information services",
}

@INPROCEEDINGS{Shoc7809:Inter,
AUTHOR="John F. Shoch",
TITLE="Inter-Network Naming, Addressing, and Routing",
BOOKTITLE=compcon,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
PAGES="72-79",
MONTH=sep,
YEAR=1978,
KEYWORDS="routing; addressing; internetworking; naming",
ABSTRACT="As work continues to interconnect computer networks, it
becomes increasingly important to clarify the differences between names,
addresses and routes -- while closely related, these are three distinct
functions in any communications system. A clear appreciation for some of
the more subtle aspects of their use can help in understanding such
traditional models as the switched telephone system, as well as more
recent designs for bringing together heterogeneous computer systems.",
ANNOTE="Contains an excellent information description of names,
addresses, and routes. The name is what we seek, the address is where it
is, and the route is how to get there. [Sn]",
}

@INPROCEEDINGS{McQu7809:Message,
AUTHOR="J. M. McQuillan",
TITLE="Message addressing modes for computer networks",
BOOKTITLE=compcon,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
PAGES="80-88",
MONTH=sep,
YEAR=1978,
KEYWORDS="addressing; network layer; naming",
ABSTRACT="In the basic mode of operation of many computer networks
today, the subscriber presents a message to the network with an address
corresponding to the destination subscriber's physical location. While
this approach is simple and effective, it is also restrictive, since it
requires subscribers to know each other's physical locations, and it
does not encompass such ideas as assigning a subscriber multiple network
connections, or sending a message to more than one address or to one of
several addresses, etc. The present paper explores the subject of
addressing, which has received surprisingly little attention to date,
and indicates that useful approaches can be developed to extend the
basic ``language'' of network messages and to improve network
performance.",
}

@INPROCEEDINGS{Thur7809:Circuit,
AUTHOR="Kenneth J. Thurber",
TITLE="Circuit switching technology: a state-of-the survey",
BOOKTITLE=compcon,
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
PAGES="116-124",
MONTH=sep,
YEAR=1978,
KEYWORDS="circuit switching; survey",
ABSTRACT="A summary of the state-of-the-art in circuit switching
technology is provided in this paper. The concept of a circuit switch is
viewed from its basic switch parameters: type, function, implementation,
capability, topology, and complexity. Important results in each
parameter area are discussed as well as future research trends.",
}

@INPROCEEDINGS{Bux7809:Distributed,
AUTHOR="W. Bux and P. J. Kühn and K. Kümmerle",
TITLE="Distributed processing in a packet-switching node: performance
analysis",
BOOKTITLE="EUROCOMP",
ADDRESS="London",
PAGES="1-20",
NOTE="also IBM Research Report RZ 888 (No. 29913)",
MONTH=sep,
YEAR=1978,
KEYWORDS="Simulation; performance evaluation; packet switching;
switching system; network throughput; multiprocessor system; arallel
computing",
ANNOTE="In the context of an integrated network for circuit and packet
switching, a new structure for a switching node was suggested.
Connection management and node control functions on the one hand and
packet processing/storing on the other are performed by two groups of
modules. Considering both the high throughput require ment of about 1200
packets/sec/node and the modularity requirement, node configurations may
exceed 30 packet-handling modules.",
}

@INPROCEEDINGS{Pujo7809:Flow,
AUTHOR="Guy Pujolle",
TITLE="Analysis of Flow Control in Switched Data Network by a Unified
Model",
BOOKTITLE=iccc,
ADDRESS="Kyoto",
PAGES="123-128",
MONTH=sep,
YEAR=1978,
LANGUAGE="English",
KEYWORDS="computer network; flow control; performance evaluation",
}

@ARTICLE{John7809:Modified,
AUTHOR="N. L. Johnson",
TITLE="Modified $t$ tests and confidence intervals for asymmetrical
populations",
JOURNAL="Journal of the American Statistical Association",
VOLUME=73,
NUMBER=363,
PAGES="536-544",
MONTH=sep,
YEAR=1978,
KEYWORDS="Simulation; statistical technique; confidence interval",
}

@ARTICLE{Kull7809:Stichproben,
AUTHOR="H. K llmer",
TITLE="Stichproben aus Grundgesamtheiten mit Zufallsverteilung",
JOURNAL="Unterrichtsblätter der Deutschen Bundespost",
VOLUME=31,
NUMBER=9,
PAGES="288-299",
MONTH=sep,
YEAR=1978,
LANGUAGE="German",
KEYWORDS="Simulation; statistical technique; confidence interval",
}

@ARTICLE{Ulri7809:Event,
AUTHOR="E. G. Ulrich",
TITLE="Event manipulation for discrete simulations requiring large
numbers of events",
JOURNAL=cacm,
VOLUME=21,
NUMBER=9,
PAGES="777-785",
MONTH=sep,
YEAR=1978,
KEYWORDS="Simulation; event set",
}

@ARTICLE{Wong7809:Queuing,
AUTHOR="J. W. Wong",
TITLE="Queuing Network Modeling of Computer Communication Networks",
JOURNAL=acmcs,
VOLUME=10,
NUMBER=3,
PAGES="343-351",
MONTH=sep,
YEAR=1978,
}

@INPROCEEDINGS{Maru7809:Designing,
AUTHOR="K. Maruyama",
TITLE="Designing Reliable Packet-Switched Communication Networks",
BOOKTITLE="4th International Conference on computer Communication,
Kyoto, 26-29",
PAGES="493-498",
MONTH=sep,
YEAR=1978,
KEYWORDS="packet switching",
}

@INPROCEEDINGS{Iver7810:Review,
AUTHOR="V. B. Iversen",
TITLE="Review of traffic measurement methods and application fields of
measurement results",
BOOKTITLE="2nd ITC Seminar",
ADDRESS="Budapest",
PAGES="1-32",
MONTH=oct,
YEAR=1978,
REFERENCES=68,
KEYWORDS="survey; bibliography; measurement; communication network",
ANNOTE="the purpose of this paper is to present a systematic review of
the principles and methods of traffic measurements and application
fields of data. After a description of the switching system and the
traffic process the basic tasks for measurement equipment is described.
existing measuring equipment is divided into two types: (a) conventional
equipment based on wired logic and (b) computerized equipment based on
stored program control. the operatio",
}

@ARTICLE{Gasp7810:Simulated,
AUTHOR="A. Gaspar and P. Lamm",
TITLE="A Simulated Data Communication Network",
JOURNAL=ccr,
VOLUME=8,
NUMBER=4,
MONTH=oct,
YEAR=1978,
}

@ARTICLE{Edge7810:End,
AUTHOR="S. W. Edge and A. J. Hinchley",
TITLE="A Survey of End-to-End Retransmission Techniques",
JOURNAL=ccr,
VOLUME=8,
NUMBER=4,
MONTH=oct,
YEAR=1978,
}

@ARTICLE{Anon7810:Telecommunications,
AUTHOR="Anonymous",
TITLE="Telecommunications and Information Agency",
JOURNAL=ccr,
VOLUME=8,
NUMBER=4,
MONTH=oct,
YEAR=1978,
}

@ARTICLE{Anon7810:Advanced,
AUTHOR="Anonymous",
TITLE="{AT\&T's} Advanced Communications Service",
JOURNAL=ccr,
VOLUME=8,
NUMBER=4,
MONTH=oct,
YEAR=1978,
}

@INPROCEEDINGS{Jain7810:Control,
AUTHOR="Raj Jain",
TITLE="Control-theoretic Approach to Computer Systems Performance
Improvement",
BOOKTITLE="Computer Performance Evaluation Users Group 14th Meeting
(CPEUG)",
ADDRESS="Boston, Mass",
PAGES="93-100",
DAYS=24,
MONTH=oct,
YEAR=1978,
}

@ARTICLE{Gitm7811:Economic,
AUTHOR="I. Gitman and H. Frank",
TITLE="Economic Analysis of Integrated Voice and Data Networks: A Case
Study",
JOURNAL=ieeeproc,
VOLUME=66,
NUMBER=11,
PAGES="1549-1570",
MONTH=nov,
YEAR=1978,
KEYWORDS="packet voice; economic analysis",
ABSTRACT="This paper describes the results of a study to evaluate
alternative switching strategies for future integrated voice and data
networks. Three fundamental problems are addressed: 1) the economics of
integrating voice and data applications in a common communications
system; 2) the comparison of alternative switching technologies for
integrated voice and data networks; 3) the cost-effectiveness of
alternative voice digitization rates and strategies. Three broad
switching technologies and variations thereof are investigated and
compared. The switching technologies are: circuit switching, packet
switching and hybrid (circuit-packet) switching. Each switching
technology can accomodate either voice or data applications separately
or combine voice and data requirements in an integrated fashion. Results
of studies regarding communication systems options are provided and the
sensitivity of the results are tested with respect to traffic
variations, cost trends of switching and transmission, and network
performance variables. The significant variables which affect the result
are identified and quantified. The intent of the study is to identify
and quantify network technologies which demonstrate long-term low
operating costs.",
}

@ARTICLE{Kahn7811:Advances,
AUTHOR="R. E. Kahn and Steven A. Gronemeyer and Jerry Burchfiel and
Ronald C. Kunzelman",
TITLE="Advances in packet radio technology",
JOURNAL=ieeeproc,
VOLUME=66,
NUMBER=11,
PAGES="1468-1496",
MONTH=nov,
YEAR=1978,
KEYWORDS="packet radio",
ABSTRACT="Packet radio (PR) is a technology that extends the application
of packet switching which evolved for networks of point-to-point
communication lines to the domain of broadcast radio. It offers a highly
efficient way of using a multiple access radio channel with a
potentially large number of mobile subscribers to support computer
communication and to provide local distribution of information over a
wide geographic area. We discuss the basic concepts of packet radio in
this paper and present the recent technology and system advances in this
field. Various aspects of spread spectrum transmission in the network
environment are identified and our experience with a testbed network in
the San Francisco Bay area is discussed.",
}

@ARTICLE{Robe7811:Evolution,
AUTHOR="L. G. Roberts",
TITLE="The evolution of packet switching",
JOURNAL=ieeeproc,
VOLUME=66,
NUMBER=11,
PAGES="1307-1313",
MONTH=nov,
YEAR=1978,
KEYWORDS="packet switching; survey; history of computing; ARPAnet; X.25;
Tymnet; virtual circuits; datagram",
ABSTRACT="Over the past decade data communications has been
revolutionized by a radically new technology called packet switching. In
1968 virtually all interactive data communication networks were circuit
switched, the same as the telephone network. Circuit switching networks
preallocate transmission bandwidth for an entire call or session.
However, since interactive data traffic occurs in short burst 90 percent
or more of this bandwidth is wasted. Thus, as digital electronics become
inexpensive enough, it became dramatically more cost-effective to
completely redesign communication networks, introducing the concept of
packet switching where the transmission bandwidth is dynamically
allocated, permitting many users to share the same transmission line
previously required for one user. Packet switching has been so
successfull, not only in improving the economics of data communications
but in enhancing reliability and functional flexibility as well, that in
1978 virtually all new data networks being built throughout the world
are based on packet switching. An open question at this time is how long
will it take for voice communications to be revolutionized as well by
packet switching technology. In order to better understand both the past
and future evolution of this fast moving technology, this paper examines
in detail the history and trends of packet switching.",
}

@ARTICLE{Cerf7811:Packet,
AUTHOR="V. G. Cerf and P. T. Kirstein",
TITLE="Issues in packet-network interconnection",
JOURNAL=ieeeproc,
VOLUME=66,
NUMBER=11,
PAGES="1386-1408",
MONTH=nov,
YEAR=1978,
KEYWORDS="Internet; network interconnection; X.25; X.75",
ABSTRACT="This paper introduces the wide range of technical, legal, and
political issues associated with the interconnection of packet-switched
data communication networks. Motivations for interconnection are given,
desired user services are described, and a range of technical choices
for achieving interconnection are compared. Issues such as the level of
interconnection, the role of gateways, naming and addressing, flow and
congestion control, accounting and access control, and basic internet
services are discussed in detail. The CCITT X.25/X.75 packet-network
interface recommendations are evaluated in terms of their applicability
to network interconnection. Alternatives such as datagram operation and
general host gateways are compared with the virtual circuit methods.
Some observations on the regulatory aspects of interconnection are
offered and the paper concludes with a statement of open research
problems and some tentative conclusions.",
}

@ARTICLE{Spro7811:High,
AUTHOR="Robert F. Sproull and Danny Cohen",
TITLE="High-level protocols",
JOURNAL=ieeeproc,
VOLUME=66,
NUMBER=11,
PAGES="1371-1386",
MONTH=nov,
YEAR=1978,
KEYWORDS="network protocols; NVP; packet voice; graphics; distributed
systems; protocol implementation",
ABSTRACT="High-level protocols (HLPs) are the high-level languages of
distributed systems. In a resource-sharing network, HLPs link processes
working on a common application. The design of an HLP is decomposed into
three components: language, coding, and transport. The language
expresses the commands and data passed between processes. It is desired
to provide standardization and device independence, in order to use a
small number of HLPs to address a range of applications implemented on a
variety of computer systems. Coding converts the language into digital
messages. Finally, a transport system is used to transmit the messages
from one process to another -- experience with HLPs has shown that
different HLPs require different transport behaviors. This paper
describes some examples of HLPs (ARPA network voice and graphics
protocols), and argues that modern techniques for expressing structure
and control in programming languages should be applied to analogous
problems in communication among application processes in a network.",
}

@ARTICLE{Tadi7811:Computer,
AUTHOR="P. R. Tadikamalla",
TITLE="Computer generation of gamma random variables -- {II.}",
JOURNAL=cacm,
VOLUME=21,
NUMBER=11,
PAGES="925-928",
MONTH=nov,
YEAR=1978,
KEYWORDS="random variate generation",
}

@ARTICLE{Clar7811:Local,
AUTHOR="D. D. Clark and K. T. Pogran and D. P. Reed",
TITLE="An Introduction to Local Area Networks",
JOURNAL=ieeeproc,
ORGANIZATION="IEEE",
PAGES="1497-1517",
MONTH=nov,
YEAR=1978,
}

@ARTICLE{IJac7811:General,
AUTHOR="I. Jacobs and R. Binder and E. Hoversten",
TITLE="General Purpose Packet Satellite Networks",
JOURNAL=ieeeproc,
VOLUME=66,
NUMBER=11,
PAGES="1448-1467",
MONTH=nov,
YEAR=1978,
}

@ARTICLE{Kell7811:Public,
AUTHOR="P. T. Kelly",
TITLE="Public packet switched data networks, international plans and
standards",
JOURNAL=ieeeproc,
VOLUME=66,
PAGES="1539-1549",
MONTH=nov,
YEAR=1978,
}

@ARTICLE{Lick7811:Applications,
AUTHOR="J. C. R. Licklider and A. Vezza",
TITLE="Applications of Information networks",
JOURNAL=ieeeproc,
VOLUME=66,
PAGES="1330-1345",
NOTE="also in \cite{Abra80:Computer}",
MONTH=nov,
YEAR=1978,
}

@ARTICLE{Math7811:Commercial,
AUTHOR="S. L. Mathison",
TITLE="Commercial, Legal and International Aspects of Packet
Communications.",
JOURNAL=ieeeproc,
VOLUME=66,
PAGES="1527-1538",
NOTE="also in \cite{Abra80:Computer}",
MONTH=nov,
YEAR=1978,
}

@ARTICLE{McQu7811:Enhanced,
AUTHOR="J. M. McQuillan",
TITLE="Enhanced message addressing capabilities for computer networks",
JOURNAL=ieeeproc,
VOLUME=66,
PAGES="1517-1527",
MONTH=nov,
YEAR=1978,
}

@ARTICLE{Hans7811:Distributed,
AUTHOR="P. Brinch Hansen",
TITLE="Distributed Processes: A Concurrent Programming Concept",
JOURNAL=cacm,
VOLUME=21,
NUMBER=11,
PAGES="934-941",
MONTH=nov,
YEAR=1978,
}

@INPROCEEDINGS{Sciu7812:System,
AUTHOR="Joseph A. Sciulli",
TITLE="System Engineering Considerations in {DSI} Applications",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
ADDRESS="Birmingham, Alabama",
PAGES="14.2.1-14.2.5",
MONTH=dec,
YEAR=1978,
KEYWORDS="packet voice; digital speech interpolation; DSI; TASI",
ABSTRACT="Topics considered: digital hierarchy compatibility, DSI gain,
equipment costs, speech quality, compabitibility with voiceband data
transmission and echo control, problems with tandem connections and
effect of bit errors.",
ANNOTE="Discusses both bit reduction and silence suppression.",
}

@INPROCEEDINGS{Maru7812:DSI,
AUTHOR="R. Maruta and A. Tomozawa and T. Nishitani",
TITLE="Design of a {DSI} Terminal for Domestic Applications",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
ADDRESS="Birmingham, Alabama",
PAGES="14.3.1-14.3.5",
MONTH=dec,
YEAR=1978,
KEYWORDS="digital speech interpolation; DSI; TASI",
ABSTRACT="System considerations for tailoring DSI to terrestrial
applications are discussed. Design approaches of a microprocessor
controlled 96/48 DSI, which merges 4 T1 signals into 2 T1 compatible bit
streams, are discussed.",
}

@INPROCEEDINGS{Covi7812:Comparative,
AUTHOR="G. J. Coviello",
TITLE="Comparative discussion of circuit vs. packet-switched voice",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
ADDRESS="Birmingham, Alabama",
PAGES="12.1.1-12.1.7",
MONTH=dec,
YEAR=1978,
KEYWORDS="packet voice; speech transmission",
ABSTRACT="Various other studies have already indicated potential
advantage of packet-switching over traditional circuit switching
concepts for voice communications. This paper explores the robustness of
such comparisons for a range of network architectures. In particular, it
is demonstrated that network sizing as related to the number of voice
channels traversing a particular transmission link, and network topology
with respect to the number of tandem links utilized in an end-to-end
connection can have significant effects on the system performance.
Estimates for end-to-end delay and the efficiency of trunk utilization
are developed as a function of network topology to provide the insight
necessary to identify network design limitations. A number of packet
switching design approaches, ranging from a pure datagram to a
circuit-switching-like mode, are also discussed together with their
effects on over-all performance.",
ANNOTE="Sets one-way delay for tolerable conversation at 0.5 s.",
}

@INPROCEEDINGS{Casn7812:Initial,
AUTHOR="Stephen Casner and Eric R. Mader and Randolph E. Cole",
TITLE="Some initial measurements of {ARPAnet} packet voice
transmission",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
ADDRESS="Birmingham, Alabama",
VOLUME=1,
PAGES="12.2.1-12.2.5",
MONTH=dec,
YEAR=1978,
KEYWORDS="packet voice; ARPAnet; network measurements",
ABSTRACT="The ISI network speech group has completed an initial set of
measurements of packet voice transmission on the ARPAnet. Measurements
were made of variance in network transit time as a function of packet
rate. These measurements suggest a packet rate which minimizes the total
delay between the speaker and the listener.",
ANNOTE="5000 bps LPC",
}

@INPROCEEDINGS{Ulug7812:Protocol,
AUTHOR="M. E. Ulug",
TITLE="Protocol design for a transparent intelligent network",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
ADDRESS="Birmingham, Alabama",
VOLUME=1,
PAGES="12.3.1-12.3.5",
MONTH=dec,
YEAR=1978,
KEYWORDS="TI-net",
ABSTRACT="Store-and-forward rhythmic message switching using multi-user
packets. A unique network protocol using entities called reservations
has been introduced to reduce if not completely eliminate steady state
synchronous data queues in every node and thereby greatly reduce the
variance of message transmission delay within the network. This latter
feature of TI-NET makes the system ideal for transmission of encoded
voice in the range 9.6 - 2.4 kb/s or even at lower bit rates using
statistical multiplexing.",
}

@INPROCEEDINGS{Rubi7812:Natural,
AUTHOR="Darryl Rubin and Earl Craighill and R. Raphael",
TITLE="Topics in the design of a natural teleconferencing system",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
ADDRESS="Birmingham, Alabama",
VOLUME=1,
PAGES="12.4.1-12.4.5",
MONTH=dec,
YEAR=1978,
KEYWORDS="packet voice; speech transmission; teleconferencing;
cooperative work; floor control",
ABSTRACT="Computer network teleconferencing systems can offer advantages
of extensive automation of conference functions such as call-up, floor
management, and conference reconfiguration. Historically, these systems
have provided such capabilities in exchange for the natural sound and
feel of face-to-face communication. It is now possible, however, to
overcome this drawback and better simulate a live conferencing
environment. In this paper we present a model for a computer
teleconferencing system, and discuss specific mechanisms that it can
include to better achieve natural audio and operational
characteristics.",
ANNOTE="Centralized conference control. Discusses notion of limited
feedback, allowing for time-limited interjections from listeners.
Broadcast arbitration.",
}

@INPROCEEDINGS{Occh7812:Packet,
AUTHOR="B. Occhiogrosso",
TITLE="Performance analysis of packet-switched voice/data communication
systems",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
ADDRESS="Birmingham, Alabama",
VOLUME=1,
PAGES="12.5.1",
MONTH=dec,
YEAR=1978,
KEYWORDS="packet voice; integrated services",
ABSTRACT="Packet voice performance is comprised of several elements:
network delay (important for conversational interaction), interpacket
gap (that should be minimized to preserve speech continuity) and overall
perceptual quality (a function of the vocoding techniques used and
network error rates). Closed form expressions are derived for each of
the above measures with respect to the following system traffic and
operational parameters: call load, vocoding techniques and voice
digitization rates, speech characteristics, packetization strategy and
error control techniques. The model's generality enables engineering of
network resources (transmission capacity and storage) in order to
guarantee adequate performance as a function of protocol variations; in
addition, expressions for the required buffer sizing and artificial
delays used at the destination switch to smooth excessive inter-packet
gaps, and thereby maintain speech continuity and intelligibility, are
also derived. Finally, exemplary performance tradeoffs and derivation of
an optimal set of system operating parameters are obtained.",
ANNOTE="Abstract only.",
}

@INPROCEEDINGS{Camp7812:Digital,
AUTHOR="S. J. Campanella",
TITLE="Digital speech interpolation techniques",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
ADDRESS="Birmingham, Alabama",
VOLUME=1,
PAGES="14.1.1-14.1.5",
MONTH=dec,
YEAR=1978,
KEYWORDS="packet voice; digital speech interpolation; DSI; TASI; speech
communication",
ABSTRACT="For more than a decade, speech interpolation has been used in
transatlantic cable service to double the capacity of analog FDM cable
circuits for telephone conversation in the well-known time assigned
speech interpolation (TASI) A, B, and C systems. These systems operate
satisfactorily when care is exercised to prevent overloading, which
causes competitive clipping during peak traffic. In recent years, the
advent of high-speed digital processing and digital transmission on
telecommunication links, especially in the satellite system area, has
encouraged the further development of speech interpolation. The speed
and flexibility of such techniques can be exploited to improve the
quality of speech interpolation at a given channel multiplication ratio
and to permit satisfactory operation at higher channel multiplication
ratios. This paper addresses several digital methods for speech
interpolation including TASI with bit reduction, SPEC (speech predictive
encoded communication), and DELSI (delta modulation speech
interpolation) with bit reduction. Methods incorporating bit reduction
or prediction, which are ideal for wideband satellite links, are shown
to be superior to TASI.",
ANNOTE="Compares clip fraction and increase in quantizing noise.",
}

@ARTICLE{Suns7812:Connection,
AUTHOR="C. A. Sunshine and Y. Dalal",
TITLE="Connection Management in Transport Protocols",
JOURNAL=cn,
VOLUME=2,
NUMBER=6,
PAGES="454-473",
MONTH=dec,
YEAR=1978,
KEYWORDS="TCP; host-to-host protocol; transport protocol; interprocess
communication; connections; connection management; reliability;
synchronization; 3-way handshake; resynchronization; correctness;
protocol verification",
ABSTRACT="Transport protocols are designed to provide fully reliable
communication between processes which must communicate over a less
reliable medium such as a packet switching network (which may damage,
lose, or duplicate packets, or deliver them out of order). This is
typically accomplished by assigning a sequence number and checksum to
each packet transmitted, and retransmitting any packets not positively
acknowledged by the other side. The use of such mechanisms requires the
maintenance of state information describing the progress of data
exchange. The initialization and maintenance of this state information
constitutes a connection between the two processes, provided by the
transport protocol programs on each side of the connection. Since a
connection requires significant resources, it is desirable to maintain a
connection only while processes are communicating. This requires
mechanisms for opening a connection when needed, and for closing a
connection after ensuring that all user data have been properly
exchanged. These connection management procedures form the main subject
of this paper. Mechanisms for establishing connections, terminating
connections, recovering from crashes or failures of either side, and for
resynchronizing a connection are presented. Connection management
functions are intimately involved in protocol reliability and if not
designed properly may result in deadlocks or old data being erroneously
delivered in place of current data. Some protocol modeling techniques
useful in analyzing connection management are discussed, using
verification of connection establishment as an example. The paper is
based on experience with the Transmission Control Protocol (TCP), and
examples throughout the paper are taken from TCP.",
}

@INPROCEEDINGS{Whit7812:NETCOM,
AUTHOR="Richard C. White",
TITLE="{NETCOM:} a real-time message routing capability for a maxi/mini
computer network",
BOOKTITLE=cns,
ORGANIZATION="IEEE",
ADDRESS="Gaithersburg, Maryland",
PAGES="107-113",
MONTH=dec,
YEAR=1978,
KEYWORDS="real-time systems; implementation",
ABSTRACT="NETCOM is a real-time message routing capability for intertask
communication, either within or between nodes of a heterogeneous
UNIVAC-1110/PDP-11 computer network. It was specifically designed to
meet stringent performance requirements of a satellite tracking and
telecommunication system. NETCOM augments the services of three
different operating systems to provide network communication between
both operating system and application software tasks. The
maxi/mini-computer communication problem is resolved by employing
primarily software mechanism for effectively dealing with the PDP/UNIVAC
word size difference, as well as the data format, transmission rate, and
protocol incompatibilities. The message routing functions at each
network node are integrated into a real-time multitask scheduling and
execution environment.",
}

@ARTICLE{Dala7812:Reverse,
AUTHOR="Y. Dalal and Robert M. Metcalfe",
TITLE="Reverse path forwarding of broadcast packets",
JOURNAL=cacm,
VOLUME=21,
NUMBER=12,
PAGES="1040-1048",
MONTH=dec,
YEAR=1978,
KEYWORDS="reverse path forwarding; broadcast packets; routing; computer
networks; store-and-forward packet switching; broadcast protocols",
ABSTRACT="A broadcast packet is for delivery to all nodes of a network.
Algorithms for accomplishing this delivery through a store-and-forward
packet switching computer network include (1) transmission of separately
addressed packets, (2) multidestination addressing, (3) hot potato
forwarding, (4) spanning tree forwarding, and (5) source based
forwarding. To this list of algorithms, we add (6) reverse path
forwarding, a broadcast routing method which exploits routing procedures
and data structures already available for packet switching. Reverse path
forwarding is a practical algorithm for broadcast routing in
store-and-forward packet switching computer networks. The algorithm is
described as being practical because it is not optimal according to
metrics developed for its analysis in this paper, and also because it
can be implemented in existing networks with less complexity than that
required for the known alternatives.",
}

@INPROCEEDINGS{Tadi7812:Simple,
AUTHOR="P. R. Tadikamalla",
TITLE="Simple rejection methods for sampling from the normal
distribution",
BOOKTITLE="10th Annual Conference of the American Institute for",
PAGES="290-291",
MONTH=dec,
YEAR=1978,
KEYWORDS="random variate generation",
}

@INPROCEEDINGS{Tadi7812:Methods,
AUTHOR="P. R. Tadikamalla and M. E. Johnson",
TITLE="A survey of methods for sampling from the gamma distribution",
BOOKTITLE="Winter Simulation Conference",
EDITOR="H. J. Highland and N. R. Nielsen and Christopher Carothers",
ADDRESS="Miami Beach",
VOLUME=1,
PAGES="131-134",
MONTH=dec,
YEAR=1978,
KEYWORDS="random variate generation",
}

@PHDTHESIS{Mont7812:Robust,
AUTHOR="Warren A. Montgomery",
TITLE="Robust Concurrency Control for a Distributed Information System",
SCHOOL="Massachusetts Institute of Technology, Department of Electrical
Engineering and Computer Science",
ADDRESS="Cambridge, Massachusetts",
MONTH=dec,
YEAR=1978,
}

@PHDTHESIS{Reed7812:Naming,
AUTHOR="D. P. Reed",
TITLE="Naming and Synchronization in a Decentralized Computer Systems",
SCHOOL="Massachusetts Institute of Technology",
ADDRESS="Cambridge, Massachusetts",
MONTH=dec,
YEAR=1978,
}

@INPROCEEDINGS{Lucz7812:Global,
AUTHOR="E. C. Luczak",
TITLE="Global Bus Computer Communication Techniques",
BOOKTITLE=cns,
PAGES="58-71",
NOTE="also in \cite{Abra80:Computer}",
MONTH=dec,
YEAR=1978,
}

@ARTICLE{McQu7812:Review,
AUTHOR="J. M. McQuillan and G. Falk and I. Richer",
TITLE="A review of the development and performance of the {ARPAnet}
routing algorithm",
JOURNAL=ieeecom,
VOLUME="COM-26",
PAGES="1802-1811",
MONTH=dec,
YEAR=1978,
}

@INPROCEEDINGS{Teng7812:Formal,
AUTHOR="A. Y. Teng and Minkui Liu",
TITLE="A formal model for logical verification and implementation of
network communication protocols",
BOOKTITLE=cns,
ADDRESS="Gaithersburg, Maryland",
MONTH=dec,
YEAR=1978,
}

@ARTICLE{Need7812:Using,
AUTHOR="R. M. Needham and M. D. Schroeder",
TITLE="Using Encryption for Authentication in Large Networks of
Computers",
JOURNAL=cacm,
VOLUME=21,
NUMBER=12,
PAGES="993-999",
MONTH=dec,
YEAR=1978,
}

@INPROCEEDINGS{Leve7812:Evaluation,
AUTHOR="Martin S. Levetin and Lawrence C. Rafsky",
TITLE="An evaluation of user reaction to visual teleconferencing over
satellite vs. terrestrial facilities",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
ADDRESS="Birmingham, Alabama",
PAGES="34.4.1-34.4.5",
MONTH=dec,
YEAR=1978,
REFERENCES=2,
KEYWORDS="teleconferencing; usability; human factors; delay",
ABSTRACT="The acceptability of a visual teleconference can be affected
by the transmission delay inherent in the transmission facilities
connecting the conference locations. In this paper, the results of a
study to evaluate user reaction to visual teleconferencing over
satellite vs. terrestrial facilities are described. The study was
conducted with Bell System users employing PicturePhone Meeting Service
for actual working conferences.",
ANNOTE="Echo suppression with voice switched gain (ERLE of 30 dB). No
significant differences in perceived quality was measured.",
}

@TECHREPORT{Bred7812:Simulering,
AUTHOR="B. Bredrup and S. Kubosch",
TITLE="Simulering av et Nordisk, Automatisk Mobiltelefonsystem",
INSTITUTION="Norsk Regnesentral",
ADDRESS="Norway",
NUMBER=622,
PAGES=46,
MONTH=dec,
YEAR=1978,
LANGUAGE="Norwegian",
KEYWORDS="mobile radio",
}

@ARTICLE{Hest7812:Manufacturer,
AUTHOR="S. Hester",
TITLE="A Manufacturer's Perspective on Digital Switching",
JOURNAL="Telephone Engineer and Management",
PAGES="78-81",
DAYS=15,
MONTH=dec,
YEAR=1978,
KEYWORDS="Gos",
}