@BOOK{Beck77:Elementary,
AUTHOR="Petr Beckmann",
TITLE="Elementary Queuing Theory and Telephone Traffic",
PUBLISHER="Lee's Training Manuals",
ADDRESS="Geneva, Illinois",
YEAR=1977,
KEYWORDS="queueing theory",
ANNOTE="elementary introduction to standard Markovian models. Corrected
edition of \cite{Beck68:Elementary}",
}

@ARTICLE{Bril7707:Level,
AUTHOR="P. H. Brill and M Posner",
TITLE="Level Crossings in Point Processes Applied to Queues:
Single-Server Case",
JOURNAL=or,
VOLUME=25,
NUMBER=4,
PAGES="662-674",
MONTH="July -- August",
YEAR=1977,
KEYWORDS="queueing theory",
}

@INCOLLECTION{Knep77:Numerical,
AUTHOR="J. E. Knepley and M. J. Fischer",
TITLE="A Numerical Solution for Some Computational Problems Occurring in
Queueing Theory",
BOOKTITLE="Algorithmic Methods in Probability",
EDITOR="M. F. Neuts",
PUBLISHER="North-Holland",
PAGES="271-285",
YEAR=1977,
KEYWORDS="queueing theory",
ANNOTE="Transient analysis, inversion of waiting time transforms,
analysis of complex queueing systems.",
}

@BOOK{Rein77:Combinatorial,
AUTHOR="Edward M. Reingold and Jurg Nievergelt and Narsingh Deo",
TITLE="Combinatorial Algorithms: Theory and Practice",
PUBLISHER="Prentice-Hall",
ADDRESS="Englewood Cliffs, New Jersey",
YEAR=1977,
KEYWORDS="algorithm; combinatorial method",
}

@BOOK{Schw77:Computer,
AUTHOR="M. Schwartz",
TITLE="Computer-Communication Network Design and Analysis",
PUBLISHER="Prentice-Hall",
ADDRESS="Englewood Cliffs, New Jersey",
YEAR=1977,
}

@INCOLLECTION{Broo77:Laser,
AUTHOR="E. Brookman",
TITLE="Laser Radar Theory and Technology",
BOOKTITLE="Radar Technology",
PUBLISHER="Artech",
ADDRESS="Norwood, Massachusetts",
PAGES="339-361",
YEAR=1977,
}

@BOOK{Free77:Real,
AUTHOR="A. L. Freedman",
TITLE="Real-time computer systems",
PUBLISHER="Crane Russak",
ADDRESS="New York",
YEAR=1977,
}

@BOOK{Gele77:Measuring,
AUTHOR="H. Beilner and E. Gelenbe and  others",
TITLE="Measuring, Modelling and Evaluating Computer Systems",
PUBLISHER="North-Holland",
YEAR=1977,
}

@ARTICLE{Kekr77:Two,
AUTHOR="H. B. Kekre and C. L. Saxena and H. M. Srivastava",
TITLE="A two-state Markov model of speech in conversation and its
application to computer communication systems",
JOURNAL="Computers and Electrical Engineering",
VOLUME=4,
PAGES="133-141",
YEAR=1977,
KEYWORDS="TASI; freezeout",
ABSTRACT="A two-state Markov model of speech in conversation is
developed. The model considers the alternate occurrence of talkspurts
(speaking period) and pauses (silence period) during the conversation.
Talkspurt length is assumed to be a random variable with negative
exponential distribution and pause length is assumed to have a constant
plus exponential distribution as suggested by Brady. When 24 users are
using 24 channels each occupying one channel, the probability
distribution of busy channels, average number of busy channels and
variance are calculated using the developed mathematical model. The
model is also used to calculate freeze out fraction (FOF) as a function
of number of users when TASI technique is applied to the group of 24
channels. All the results obtained analytically are verified by
simulating the model on the EC-1030 computer. There is a close
resemblance between the analytical and simulation results. The maximum
number of users that can be served with FOF not more than 0.5\% on a
group of 24 channels is estimated as 44 using two-state Markov model and
43 using simulation technique.",
ANNOTE="uses Brady's data; no buffering",
}

@ARTICLE{Kekr77:Three,
AUTHOR="H. B. Kekre and C. L. Saxena",
TITLE="Three-state Markov model of speech on telephone lines and optimal
utilization of communication systems by {TASI} technique",
JOURNAL="Computers and Electrical Engineering",
VOLUME=4,
PAGES="235-250",
YEAR=1977,
KEYWORDS="TASI; call model; source model",
ABSTRACT="A three-state model of speech on telephone lines is developed.
The model considers the alternate occurrence of the telephone calls and
the intercall gaps on the telephone lines. During a phone call there are
several talkspurts (speech without break) and pauses (silence without
break) in the user's speech. The three types of events, intercall gaps
(large gaps), talkspurts and pauses occurring on the telephone lines are
assumed to have negative exponential density functions with different
transition rate parameters. The steady state probability distribution,
average and variance of the number of busy channels and the system
utilization are evaluated as a function of call loss fraction
($P\_{of}$). The synchronous time division multiplexing (STDM) system
with number of channels in the group equal to 6 and 24 is considered.
The model is also applied to time assignment speech interpolation (TASI)
system and the relationships among the number of user terminals, speech
freeze out fraction (FOF) and system utilization are obtained for
various values of $P\_{of}$. The STDM and TASI system applied to the
group of 6 channels are simulated on the EC-1030 computer to check the
validity of the analytical results. The results of this study are
portrayed on graphs and may be used as guide lines in the design of TASI
systems.",
ANNOTE="Brady's model",
}

@ARTICLE{Kekr77:Single,
AUTHOR="H. B. Kekre and C. L. Saxena",
TITLE="An on-off single server queueing model with finite waiting room
and its application to computer communications",
JOURNAL="Computers and Electrical Engineering",
VOLUME=4,
PAGES="309-321",
YEAR=1977,
KEYWORDS="queueing theory; finite queue; multiplexer; server with
vacations",
ABSTRACT="A queueing model with finite waiting room, Poisson arrivals,
constant service time, synchronous transmission and a single server
interrupted through a first-order Markov process is studied. The
buffer's access to a channel, transmitting data at a field rate is
controlled by a switch which in turn is controlled through a first-order
Markov process. The relationships among overflow probabilities, buffer
size and expected queueing delay due to buffering are obtained. A
recursive method for computation of steady-state probabilities of the
buffer states are developed. The system of multiplexing data in analog
speech signals on telephone lines is considered as an application of the
model studied. The results of this study are portrayed on graphs and may
be used as the guide lines for the buffer design in digital systems. The
system of multiplexing data in analog speech signals using this model,
is simulated on the EC-1030 computer to check the validity of the
analytical results. Simulation results are also portrayed on the graphs
for comparison. Although this study arose in the buffer design required
for multiplexing the data in analog speech, the queueing model developed
is quite general and may be useful in other industrial applications.",
}

@ARTICLE{Suns77:Interconnection,
AUTHOR="C. A. Sunshine",
TITLE="Interconnection of computer networks",
JOURNAL=cn,
VOLUME=1,
NUMBER=2,
PAGES="175-195",
YEAR=1977,
KEYWORDS="interprocess communcations; protocol; computer network;
network interconnection; internetworking; gateway; routing; standards",
ABSTRACT="As computer networks proliferate, interest in interconnecting
networks will increase. This paper considers the problems of
interconnecting heterogeneous computer networks to provide communication
between processes in different networks. The treatment is tutorial with
a comprehensive survey of relevant work. Topics discussed include global
addressing and routing techniques, level of network interconnection, and
functions performed by the interface or gateway between networks.
Various approaches to each of these problems are compared, with
particular attention to the extent of changes in existing local net
operations required by the different approaches. Techniques to implement
internet addressing, routing, error recovery and other necessary
communication services on top of local network facilities appear
feasible without demanding large changes to individual nets.",
}

@MISC{Turo77:Computerized,
AUTHOR="Murray Turoff and Starr Roxanne Hiltz",
TITLE="Computerized Conferencing: A Review and Statement of the Issues",
NOTE="Paper presented at {NATO} Telecommunications Symposium",
YEAR=1977,
KEYWORDS="computer conferencing",
}

@INPROCEEDINGS{Turo77:Human,
AUTHOR="Murray Turoff and J. Whitescarver and Starr Roxanne Hiltz",
TITLE="The human-machine interface in a computerized conferencing
environment",
BOOKTITLE="IEEE Conference on Systems, Man, and Cybernetics",
PAGES="145-157",
YEAR=1977,
KEYWORDS="user interface; computer conferencing",
}

@ARTICLE{Ferg77:PLANET,
AUTHOR="J. A. Ferguson",
TITLE="{PLANET:} A Computer Conferencing system and its evaluation
through a case study",
JOURNAL="Behavior Research Methods, Instruments, and Computers",
VOLUME=9,
PAGES="92-95",
YEAR=1977,
KEYWORDS="computer conferencing",
}

@ARTICLE{Spel77:Continuing,
AUTHOR="F. Spelt",
TITLE="Evaluation of a continuing computer conference on simulation",
JOURNAL="Behavior Research Methods, Instruments, and Computers",
VOLUME=9,
PAGES="87-91",
YEAR=1977,
KEYWORDS="computer conferencing",
}

@ARTICLE{Thor77:Using,
AUTHOR="E. Thorson and T. F. Buss",
TITLE="Using computer conferencing to formulate a computer simulation of
transitive behavior",
JOURNAL="Behavior Research Methods, Instruments, and Computers",
VOLUME=9,
PAGES="81-86",
YEAR=1977,
KEYWORDS="computer conferencing",
}

@ARTICLE{Zinn77:Computer,
AUTHOR="K. L. Zinn",
TITLE="Computer facilitation of communication within professional
communities",
JOURNAL="Behavior Research Methods, Instruments, and Computers",
VOLUME=9,
PAGES="96-107",
YEAR=1977,
KEYWORDS="computer conferencing",
}

@ARTICLE{Spra77:Simple,
AUTHOR="J. D. Spragins",
TITLE="Simple derivation od queueing formulas for loop systems",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES=446,
YEAR=1977,
KEYWORDS="Loop system; LAN; performance evaluation",
}

@ARTICLE{Ster77:Class,
AUTHOR="T. E. Stern",
TITLE="A Class of Decentralized Routing Algorithms using Relaxation",
JOURNAL=ieeecom,
VOLUME="COM-25",
NUMBER=10,
PAGES="1092-1102",
YEAR=1977,
REFERENCES=14,
KEYWORDS="Packet switching; routing algorithm; distributed routing",
ANNOTE="An important problem in packet-switched communication networks
is the optimal assignment of routes to the message packets. An optimal
routing assignment is one which chooses network paths for the packets in
a way that minimizes some cost function, typically average message
delay.",
}

@ARTICLE{Stoy77:Bounds,
AUTHOR="D. Stoyan",
TITLE="Bounds and approximations in queueing through monotonicity and
continuity",
JOURNAL=or,
VOLUME=25,
PAGES="851-863",
YEAR=1977,
REFERENCES=67,
KEYWORDS="Queueing system; queueing approximation; inequality",
ANNOTE="This paper is a survey of recent research on the monotonicity
and continuity of queueing systems and their application to obtain
bounds and approximations.",
}

@ARTICLE{Taub77:Two,
AUTHOR="M. Taube-Netto",
TITLE="Two queues in tandem attended by a single server",
JOURNAL=or,
VOLUME=25,
PAGES="140-144",
YEAR=1977,
KEYWORDS="Queueing system; tandem queue",
}

@ARTICLE{Trib77:New,
AUTHOR="J. M. Tribolet",
TITLE="A New Phase Unwrapping Algorithm",
JOURNAL=ieeeassp,
VOLUME="ASSP-25",
PAGES="170-177",
YEAR=1977,
REFERENCES=1,
KEYWORDS="Mathematics",
}

@ARTICLE{Vasi77:Inequality,
AUTHOR="O. A. Vasicek",
TITLE="An inequality for the variance of waiting time under a general
queueing discipline",
JOURNAL=or,
VOLUME=25,
PAGES="878-884",
YEAR=1977,
REFERENCES=5,
KEYWORDS="Inequality; variance; waiting time; queueing discipline",
ANNOTE="We show that the expected value of any convex function of the
waiting time (such as the variance) in a general queueing system under
any queueing discipline independent of the service times does not exceed
that under the last-come-first-served discipline, and is not less than
that under the first-come-first-served discipline.",
}

@ARTICLE{Walk77:Efficient,
AUTHOR="A. J. Walker",
TITLE="An Efficient Method for Generating Discrete Random Variables with
General Distributions",
JOURNAL=toms,
VOLUME=3,
PAGES="253-256",
YEAR=1977,
KEYWORDS="Simulation; random number; random number generation; random
variate generation",
}

@ARTICLE{Wolf77:Incorrect,
AUTHOR="D. Wolf",
TITLE="The incorrect operation of asynchronously driven flipflops",
JOURNAL="Frequenz",
VOLUME=31,
NUMBER=3,
PAGES="71-76",
YEAR=1977,
LANGUAGE="German",
REFERENCES=4,
KEYWORDS="Digital circuit; flipflop",
}

@TECHREPORT{Wolf77:Modellierungssystem,
AUTHOR="B. Wolfinger and  Marker and O. Drobnik",
TITLE="Modellierungssystem für die Benutzerebene und Subsystemebene des
{HMI-Rechnernetzes}",
INSTITUTION="Institut für Datenverarbeitung in der Technik",
ADDRESS="Karlsruhe, Germany",
PAGES=166,
YEAR=1977,
LANGUAGE="German",
REFERENCES=18,
KEYWORDS="model; simulation; SIMULA; communication network",
ANNOTE="Das vorliegende Modellierungssystem wurde im Rahmen eines
Kooperationsvertrages zwischen der GFK (IDT) und dem
Hahn-Meitner-Institut erstellt. Ziel des in SIMULA implementierten
Programmsystems ist eine detaillierte Untersuchung der Subsystem- und
BEnutzerebene des am HMI aufgebauten Rechnernetzes. Beim Design dieses
Modelles war eine Integration des in Bericht Nr. IDT/115/02
vorgestellten Modellierungssystems (zur Simulation der Transportebene)",
}

@ARTICLE{Wu77:Interactive,
AUTHOR="Shiquan Wu and J. F. Abel and D. P. Greenberg",
TITLE="An interactive computer graphics approach to surface
representation",
JOURNAL=cacm,
VOLUME=20,
PAGES="703-712",
YEAR=1977,
REFERENCES=9,
KEYWORDS="Graphics; two-dimensional plot; three-dimensional plot",
ANNOTE="An interactive computer graphics method has been developed for
the rapid generation of arbitrary shaped three-dimensional surfaces. The
method is a synthesis of spline theory and algorithms, an interactive
means for man-machine communication, and software for static or dynamic
graphics display. The basic technique employed is a modified lofting
method in which sectional curves are represented by uniform b-splines
and the surface is interpolated",
}

@ARTICLE{Yuen77:Testing,
AUTHOR="Chris Yuen",
TITLE="Testing random numbers by Walsh-transforms",
JOURNAL=ieeetc,
VOLUME="C-26",
YEAR=1977,
KEYWORDS="random number generation; Walsh-transform",
}

@ARTICLE{Chow77:Buffer,
AUTHOR="W.-M. Chow and L. Woo",
TITLE="Buffer Performance Analysis of Communication Processors During
Slowdown at Network Control",
JOURNAL=ibmjrd,
PAGES="264-272",
YEAR=1977,
REFERENCES=7,
KEYWORDS="Buffer; performance evaluation; renewal approximation",
ANNOTE="An approximative model based on renewal theory has been
developed for the performance analysis of communication processors
during Network Control Program (NPC) slowdown. Performance values, which
include cycle length, buffer utilization, amd message loss, were
computed as functions of traffic loads and user-assigned threshold
values of free buffers were used for slowdown control. Comparison of the
obtained results with simulated shows accuracy",
}

@INPROCEEDINGS{Kuhn77:Delay,
AUTHOR="P. J. Kühn",
TITLE="Delay Problems in Communications Systems, Classification of
Models and Tables for Application",
BOOKTITLE=icc,
ADDRESS="Chicago, Illinois",
VOLUME="I",
PAGES="237-243",
YEAR=1977,
REFERENCES=35,
KEYWORDS="Communication System; Modeling; delay model; switching",
ANNOTE="This paper is devoted to the development of delay tables for the
dimensioning of communications systems with respect to the grade of
service. Firstly, some important delay problems are reviewed influencing
the performance of com. systems. Then, the basic delay system models are
classified systematically. In the third part, the development of a set
of delay tables is outlined which cover the most frequent
applications.",
}

@ARTICLE{Maru77:Discrete,
AUTHOR="K. Maruyama and D. T. Tang",
TITLE="Discrete Link Capacity and Priority Assignments in Communication
Metworks",
JOURNAL=ibmjrd,
PAGES="254-263",
YEAR=1977,
REFERENCES=16,
KEYWORDS="Store-and-forward; network; priority; capacity assignment",
ANNOTE="The paper deals with discrete link capacity and priority
assign-ment in store-and-forward networks. A discription of a
discretecapacity assignment algorithm for networks with arbitrarily de-
fined classes of packets having individual delay constraints is given
and for priority assignment an algorithm is developed which assigns
suboptimal priorities on classes of packets based on parameters such as
delay requirement, path length, etc.",
}

@ARTICLE{Ludw77:Saturation,
AUTHOR="G. Ludwig and R. Roy",
TITLE="Saturation routing network limits",
JOURNAL=ieeeproc,
VOLUME=65,
NUMBER=9,
PAGES="1353-1362",
YEAR=1977,
REFERENCES=5,
KEYWORDS="Circuit switching; saturation routing",
ANNOTE="Describes the properties (advantages and drawbacks) of the
saturation routing method. Gives, for a particular implementation of the
saturation routingmethod, the limits due to the processor capacity and
to the channel capacity on the number of calls which can be dealt with.
Good.",
}

@ARTICLE{Klei77:Hierarchical,
AUTHOR="L. Kleinrock and F. Kamoun",
TITLE="Hierarchical routing for large networks",
JOURNAL=cn,
VOLUME=1,
NUMBER=3,
PAGES="155-174",
YEAR=1977,
REFERENCES=30,
KEYWORDS="packet switching; routing; computer network; large network;
data",
ANNOTE="Performance evaluation and optimization: Distributed adaptive
routing has proven to be useful in packet switching networks. However
the storage and updating cost of this routing procedure becomes
prohibitive as the number of nodes in the network gets large. This paper
deals with the specification, analysis and evaluation of some
hierarchical routing procedures which are effective for large
store-and-forward packed-switched computer networks",
}

@ARTICLE{Abra77:Methodology,
AUTHOR="M. D. Abrams and S. Treu",
TITLE="A methodology for interactive computer service measurement",
JOURNAL=cacm,
VOLUME=20,
PAGES="936-944",
YEAR=1977,
REFERENCES=24,
KEYWORDS="Man-machine interaction; performance measure; measurement;
method; survey",
ANNOTE="A measurement methodology applicable to interactive computer
service is described. Its primary purpose is to enable external,
user-oriented assessment of computer performance, instead of the more
frequently used internal system measurement techniques. The nbs network
measurement system is employed as the external measurement tool. Example
data have been collected and analyzed. A demonstration of the
methodology, leading to a pragmatic figure-of",
}

@ARTICLE{Abra77:Throughput,
AUTHOR="N. Abramson",
TITLE="The throughput of packet broadcasting channels",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="117-128",
YEAR=1977,
REFERENCES=44,
KEYWORDS="Survey; broadcast; communication; bibliography; multiple
access; packet broadcasting",
ANNOTE="Packet broadcasting is a form of data communications
architecture which can combine the features of packet switching with
those of broadcast channels for data communication networks. Much of the
basic theory of packet broadcasting has been presented as a byproduct in
a sequence of papers with a distinctly practical emphasis. In this paper
we provide a unified presentation of packet broadcasting theory.",
}

@ARTICLE{Albr77:Strucure,
AUTHOR="S. C. Albright",
TITLE="Strucure of optimal policies in complex queueing systems",
JOURNAL=or,
VOLUME=25,
PAGES="1020-1027",
YEAR=1977,
KEYWORDS="Queueing system; M/G/N",
}

@ARTICLE{Andr77:Looping,
AUTHOR="S. Andresen",
TITLE="The looping algorithm extended to {BAS} 2t rearrangeable
switching networks",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="1057-1063",
YEAR=1977,
REFERENCES=13,
KEYWORDS="Switching network",
}

@ARTICLE{Araz77:Self,
AUTHOR="B. Arazi",
TITLE="Self-synchronizing digital scramblers",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="1505-",
YEAR=1977,
KEYWORDS="Shift register sequences; scrambler",
}

@ARTICLE{Arvi77:Combinational,
AUTHOR="A. C. Arvillias",
TITLE="Combinational logic-free realisations for high-speed m-sequence
generation",
JOURNAL=elet,
VOLUME=13,
PAGES=500,
YEAR=1977,
KEYWORDS="Shift register sequences",
}

@TECHREPORT{Barb77:Shortest,
AUTHOR="G. Barberis and U. Mazzei",
TITLE="A Shortest Route Algorithm for Graphs having Weighted Nodes and
Arcs with Application to {S/F} Communication Networks",
TYPE="Rapporti tecnici",
INSTITUTION="CSELT",
ADDRESS="Torino",
VOLUME=5,
NUMBER=1,
PAGES="63-66",
YEAR=1977,
REFERENCES=5,
KEYWORDS="Shortest path",
ABSTRACT="The problem is approached of automatically finding the
shortest routes to a node from all the others in a graph with generic
lengths both on his arcs and his nodes; an efficient solution is
proposed as derived from Dijkstra's algorithm for weighted arcs without
increasing up the computation complexity. Need of this algorithm arises,
for instance, when routing problems must be addressed in
store-and-forward (S/F) communication networks with",
}

@ARTICLE{Boor77:Large,
AUTHOR="R. R. Boorstyn and H. Frank",
TITLE="Large-scale network topological optimization",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="29-47",
YEAR=1977,
REFERENCES=53,
KEYWORDS="LAN; logical network structure; optimization; model;
Performance evaluation; bibliography; backbone network",
ABSTRACT="A cost-effective structure for a large network is a multilevel
hierarchy consisting of a backbone network and a family of local access
networks. The backbone network is generally a distributed network, while
the local access networks are typically centralized systems. This paper
discusses topological design problems for such systems, including the
concentrator location problem, the terminal layout problem (the
constrained minimum spanning tree",
}

@ARTICLE{Bran77:Hardware,
AUTHOR="J. R. Brandsma and B. L. A. Waumans",
TITLE="The hardware-simulator: a tool for evaluating computer systems",
JOURNAL=ieeetc,
VOLUME="C-26",
YEAR=1977,
KEYWORDS="Simulation; hardware simulator; design; realization; method;
discrete event simulation; time sequencing; logic element; small
computer",
ABSTRACT="The hardware simulator is an apparatus on which physical
models of computer systems can be built. The main frame consists of
console, power supply, and many connectors in which standard modules can
be plugged. Each standard module represents a special function,
essential in a computer system. The model is constructed by connecting
the modules in a specific way. In this paper the special functions and
the standard modules which represent them.",
}

@ARTICLE{Bran77:Queueing,
AUTHOR="A. Brandwajn",
TITLE="A queueing model of multiprogramming computer systems under full
load conditions",
JOURNAL=jacm,
PAGES=19,
YEAR=1977,
REFERENCES=17,
KEYWORDS="Queueing system; decomposition",
}

@ARTICLE{Bux77:Approximation,
AUTHOR="W. Bux and U. Herzog",
TITLE="Approximation von Verteilungsfunktionen, ein wichtiger Schritt
bei der Modellbildung für Rechensysteme",
EDITOR="Brauer",
JOURNAL="Informatik Fachberichte",
PUBLISHER="Springer-Verlag",
VOLUME=9,
PAGES="1-15",
YEAR=1977,
LANGUAGE="German",
REFERENCES=10,
KEYWORDS="method; approximation; linear optimization; distribution;
phase concept",
ABSTRACT="Ein wichtiger schritt fuer die verkehrstheoretische analyse
von modellen fuer rechensysteme ist die approximation gemessener
verteilungsfunktionen. Typische beispiele sind verteilungsfunktionen
fuer ankunftsabstände, fuer bedienungszeiten oder fuer transportzeiten.
Es wird ein verfahren vorgeschlagen, welches fuer die
verkehrstheoretische analyse äusserst zweckmässig ist und numerisch
effektiv arbeitet. Die statistische zulässigkeit der app",
}

@ARTICLE{Bux77:Phase,
AUTHOR="W. Bux and U. Herzog",
TITLE="The phase concept: approximation of measured data and performance
analysis",
JOURNAL=compperf,
PUBLISHER="North Holland",
VOLUME=1,
PAGES="23-38",
YEAR=1977,
KEYWORDS="Distribution function; queueing system; Method; approximation;
linear optimization; distribution; phase concept; G/Ek/1/S; M/G/1",
ABSTRACT="Distribution functions for interarrival and service times are
described by means of a simplified cox model with a uniform service rate
for all phases but different branching probabilities.  We first present
an efficient algorithm to determine a phasetype distribution function. 
Which fits actual measured data with a prescribed accuracy. 
Investigating queueing models with that type of distribution function. 
It is shown how to reduce the complexity of state spaces.",
}

@PROCEEDINGS{Chan77:Computer,
TITLE="Computer performance",
EDITOR="K. M. Chandy and M. Reiser",
ORGANIZATION="IFIP WG 7.3",
PUBLISHER="Proc. International Symposium on Computer Performance
Modelling",
ADDRESS="Amsterdam, Holland",
PAGES="1-564",
YEAR=1977,
KEYWORDS="Measurement; queueing system; system evaluation; numerical
method; performance evaluation; model; communication network; network
flow; heuristics; fundamentals in statistics; special issue;
simulation",
ABSTRACT="Improving approximations of queueing network subsystems (K. C.
Sevcik, et al.); Measured data and performance analysis (W. Bux, et
al.); Dynamic load in distributed systems (Y. C. Chow, et al.);
Throughput in locally balanced models (A. S. Noetzel); numerical
solution of queueing problems (A. Brandwajn); Scheduling strategies for
interactive computer systems (Y. Bard); Analytical models for
performance prediction (M. A. Diethelm)",
}

@PHDTHESIS{Chri77:Transactions,
AUTHOR="T. W. Christopher",
TITLE="Transactions oriented queueing system simulation on network
computers",
SCHOOL="Illinois Institute of Technology",
ADDRESS="Illinois",
PAGES=200,
YEAR=1977,
REFERENCES=30,
KEYWORDS="Design; evaluation; method; future outlook; research problem;
event sequencing; distributed simulation; network; computer system",
ABSTRACT="1. The problem 2. Review of the literature 3. The simulation
language 4. Distributed structure of a simulation program 5. Faccom 6.
Behaviour of the trancoms 7. Freezing 8. Extensions and future research
9. Conclusions",
}

@INPROCEEDINGS{Cott77:International,
AUTHOR="I. W. Cotton and H. C. Folts",
TITLE="International standards for data communications: a status
report",
BOOKTITLE="5th data communication symposium",
ADDRESS="Snowbird, Utah",
PAGES="426-436",
NOTE="also in \cite{Abra80:Computer}",
YEAR=1977,
KEYWORDS="Standard; communication protocol",
ANNOTE="This paper describes recently developed interface protocols for
data terminal and data circuit terminating equipment and communication
networks. National and international protocol standards are described.
Historical insight into the rationale for protocol selection is given.
Unfortunately, the paper is somewhat difficult to read because of its
great detail and extensive use of jargon.",
}

@BOOK{Cour77:Decomposability,
AUTHOR="P.-J. Courtois",
TITLE="Decomposability: Queueing and Computer System Applications",
SERIES="ACM monograph series",
ISBN="0-12-193750-X",
PUBLISHER="Academic Press",
ADDRESS="New York",
PAGES=201,
YEAR=1977,
REFERENCES=130,
KEYWORDS="Queueing system; Queueing network",
}

@ARTICLE{Crab77:Classified,
AUTHOR="T. B. Crabill and D. Gross and M. J. Magazine",
TITLE="A classified bibliography of research on optimal design and
control of queues",
JOURNAL=or,
VOLUME=25,
PAGES="219-235",
YEAR=1977,
KEYWORDS="bibliography; queueing system; queueing discipline; arrival
process",
ABSTRACT="This paper presents a classified bibliography organized into
six sections - static design models, dynamic control models, models
involving queue discipline control, miscellaneous models, tutorial and
survey papers, and books that have specific portions devoted to design
and control.",
}

@ARTICLE{Crow77:Aliasing,
AUTHOR="F. C. Crow",
TITLE="The aliasing problem in computer generated shaded images",
JOURNAL=cacm,
VOLUME=20,
PAGES="799-805",
YEAR=1977,
REFERENCES=10,
KEYWORDS="Method; graphics; three-dimensional plot; display; filter
theory; sampling; aliasing; convolutional filtering; hidden line
algorithm",
ABSTRACT="Certain defects, such as jagged edges and disappearing detail,
have long been an annoyance in digitally generated shaded images.
Although increasing the resolution or defocusing the display can
attenuate them, an understanding of these defects leads to more
effective methods. This paper explains the observed defects in terms of
the aliasing phenomenon inherent in sampled signals and discusses
prefiltering as a recognized cure",
}

@ARTICLE{Cyre77:WISPAC,
AUTHOR="W. R. Cyre and  others",
TITLE="{WISPAC:} a parallel array computer for large-scale system
simulation",
JOURNAL="Simulation",
PAGES="165-172",
YEAR=1977,
KEYWORDS="Distributed simulation; array processor; continuous
simulation; hardware simulator; design; realization; application;
microprocessor; large computer",
ABSTRACT="This paper discusses the multiple-instruction stream, multiple
data stream (MIMD) wisconsin parallel aray computer (WISPAC). The design
of the computer makes use of current, low-cost microprocessor technology
and is intended to meet future needs in large-scale simulation. A
modular approach is taken where smaller configurations are meant as
direct competive replacements of current hybrid systems. Larger
configurations will allow high-speed solutions.",
}

@ARTICLE{DAvi77:Queue,
AUTHOR="G. R. D'Avignon and R. L. Disney",
TITLE="Queue with instantaneous feedback",
JOURNAL=ms,
VOLUME=24,
NUMBER=2,
PAGES="168-180",
YEAR=1977,
REFERENCES=8,
KEYWORDS="round robin; model; FIFO; feedback; queue length; priority;
service time; steady state",
ABSTRACT="A large class of problems appears in computer modelling under
the name of round-robin models and foreground-background models. In the
present paper, such a system is referred to as a queue with
instantaneous feedback. Throughout the text it is assumed that there are
two independent poisson arrival processes giving two types of customers.
Each type of customer has its own service time distributions. The
decision to feedback (to receive another",
}

@ARTICLE{Davi77:Optimization,
AUTHOR="M. Davio and J. P. Deschamps and J. C. Lienard",
TITLE="Optimization of strictly non-blocking and rearrangeable
interconnections",
JOURNAL="Philips research reports",
VOLUME=32,
PAGES="266-296",
YEAR=1977,
REFERENCES=11,
KEYWORDS="Switching network",
}

@ARTICLE{Desk77:Capacity,
AUTHOR="S. D. Deskmukh and S. Jain",
TITLE="Capacity design and service quality control in a queueing
system",
JOURNAL=or,
VOLUME=25,
PAGES="651-661",
YEAR=1977,
KEYWORDS="Queueing system; single server; finite capacity;
optimization",
}

@ARTICLE{Diet77:Teilbelegungstreue,
AUTHOR="G. Dietrich and R. Salade",
TITLE="Teilbelegungstreue Simulation der Steuerung von
Vermittlungssystemen",
JOURNAL="Elektrisches Nachrichtenwesen (ITT)",
VOLUME=52,
NUMBER=1,
PAGES="61-68",
YEAR=1977,
LANGUAGE="German",
REFERENCES=5,
KEYWORDS="Simulation; switching system",
}

@ARTICLE{Duff77:Sparse,
AUTHOR="I. S. Duff",
TITLE="A survey of sparse matrix research",
JOURNAL=ieeeproc,
VOLUME=65,
NUMBER=4,
PAGES="500-535",
YEAR=1977,
REFERENCES=604,
KEYWORDS="Survey; sparse matrix",
ABSTRACT="This paper surveys the state of the art in sparse matrix
research in january 1976. Much of the survey deals with the solution of
sparse simultaneous linear equations, including the storage of such
matrices and the effect of paging on sparse matrix algorithms. In the
symmetric case, relevant terms from graph theory are defined. Band
systems and matrices arising from the discretization of partial
differential equations are treated as separate cas",
}

@TECHREPORT{Egen77:Statistische,
AUTHOR="F. J. Egenolf",
TITLE="Statistische Analyse von Zeitreihen",
TYPE="DFV-BERICHT",
INSTITUTION="Lehrstuhl Fuer Allgemeine Elektrotechnik und
Datenfernverarbeitung, RWTH Aachen",
ADDRESS="Aachen, Germany",
PAGES="1-12",
YEAR=1977,
LANGUAGE="German",
REFERENCES=4,
KEYWORDS="mechanic McKay sampling; independent cycles; correlation;
estimation; Bayes statistics; queueing system; Student distribution;
validation",
ABSTRACT="1. Wahrscheinlichkeitstheoretische grundlagen 2. Stochastische
folgen 3. Stationarität 4. Auswertung von simulationsergebnissen",
}

@PHDTHESIS{Egen77:Auswahlstrategien,
AUTHOR="F. J. Egenolf",
TITLE="Auswahlstrategien in baumstrukturierten Wartesystemen mit großer
Quellenzahl",
SCHOOL="RWTH Aachen",
ADDRESS="Aachen, Germany",
PAGES=118,
YEAR=1977,
LANGUAGE="German",
REFERENCES=40,
KEYWORDS="Queueing system; queueing discipline; EDS; NIFO; nearest in
first out",
}

@INPROCEEDINGS{Eyri77:Online,
AUTHOR="F. Eyries and M. Gien",
TITLE="Online performance measurement in the {CYCLADES} computer
network",
BOOKTITLE="EUROCON",
ADDRESS="Venice",
PAGES="1-6",
YEAR=1977,
REFERENCES=8,
KEYWORDS="Performance evaluation; CYCLADES; communication network;
measurement",
ABSTRACT="Now that public data networks are going to be provided
employing the same techniques, which have been proved workable, it is
useful to have some quantitative information on their performance. Such
measurements have already been conducted on some of those early days
networks. One aspect of the measurement campaign presently being
conducted on cyclades is presented here.",
}

@ARTICLE{Ferg77:Bound,
AUTHOR="M. J. Ferguson",
TITLE="A bound and approximation of delay distribution for fixed-length
packets in an unslotted {ALOHA} channel and a comparison with time
division multiplexing {TDM}",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="136-139",
YEAR=1977,
REFERENCES=5,
KEYWORDS="ALOHA; approximation; method; comparison; random multiple
access; time in system; TDMA; time division multiple access",
ABSTRACT="This paper presents an approximation analysis of a pure
unslotted aloha random access with fixed-length packets and computes
percentiles of delay for various throughputs. It introduces the concept
of the burst ratio (mean packet interarrival time/maximum delay) of a
source which allows a precise comparison with time division multiplexing
(TDM) and indicates when aloha is the preferred access technique.",
}

@ARTICLE{Fish77:Achieving,
AUTHOR="G. S. Fishman",
TITLE="Achieving specific accuracy in simulation output analysis",
JOURNAL=cacm,
VOLUME=20,
PAGES="310-",
YEAR=1977,
KEYWORDS="Simulation; time series analysis",
}

@BOOK{Fran77:Comparative,
TITLE="A comparative review of statistical software",
EDITOR="I. Francis",
PUBLISHER="International Assoc. for Statistical Computing",
ADDRESS="New Dehli",
PAGES="1-685",
YEAR=1977,
KEYWORDS="Software; probability; statistics",
ABSTRACT="In this volume of the proceedings of the 41st session of the
isi, prof. ivor francis has assembled and presented a comprehensive
collection of evaluations of 46 major statistical computing packages,
describing their capabilities and use.",
}

@BOOK{Fran77:Process,
AUTHOR="William R. Franta",
TITLE="A process view of simulation",
ISBN="0-444-00223-5",
PUBLISHER="North Holland",
PAGES="1-195",
YEAR=1977,
KEYWORDS="Simulation; SIMULA; event sequencing; solved exercise",
ABSTRACT="Basic notions. a general view of simulation and simulation
syst ems. the scenario approach to simulation. SIMULA: providing the
tools. SIMULA: simulation support. Examples. Constructs using SIMULA.
Costs of simulation. Bibliography. Index.",
}

@ARTICLE{Fran77:Efficient,
AUTHOR="William R. Franta and K. Maly",
TITLE="An efficient data structure for the simulation event set",
JOURNAL=cacm,
VOLUME=20,
YEAR=1977,
KEYWORDS="Simulation; event sequencing; method",
}

@ARTICLE{Gavi77:Computer,
AUTHOR="Bezalel X Gavish and A. G. Konheim",
TITLE="Computer communication via satellites - a queueing model",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="140-147",
YEAR=1977,
REFERENCES=8,
KEYWORDS="Queueing system; model; satellite radio; concentrator",
ABSTRACT="In this paper we examine a model for computer-to-computer
communication via satellite link.  In each network, a single node, the
satellite communication concentrator (SCC), manages the flow of
information between the terminals in the network and the satellite
link.",
}

@ARTICLE{Gavi77:Markowian,
AUTHOR="Bezalel X Gavish and P. Schweitzer",
TITLE="The Markowian queue with bounded waiting time",
JOURNAL=ms,
VOLUME=23,
PAGES="1349-1357",
YEAR=1977,
KEYWORDS="Queueing system; M/G/1; limited waiting time",
}

@ARTICLE{Gerl77:Topological,
AUTHOR="M. Gerla and L. Kleinrock",
TITLE="On the topological design of distributed computer networks",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="48-60",
YEAR=1977,
REFERENCES=48,
KEYWORDS="logical network structure; design; communication network;
MODEL; performance evaluation; heuristics; bibliography",
ABSTRACT="The problem of data transmission in a network environment
involves the design of a communication subnetwork. Recently, significant
progress has been made in this technology, and in this article we survey
the modeling, analysis, and design of such computer-communication
networks. Most of the design methodology presented has been developed
with the packet-switched advanced research projects agency network
(ARPAnet) in mind, although the principle",
}

@ARTICLE{Gras77:Transient,
AUTHOR="W. Grassmann",
TITLE="Transient solutions in Markovian queues",
JOURNAL=ejor,
PUBLISHER="North-Holland",
VOLUME=1,
PAGES="397-402",
YEAR=1977,
REFERENCES=9,
KEYWORDS="M/M/1; transient behaviour; waiting time; traffic theory",
ABSTRACT="An algorithm for finding transient solutions in Markovian
queuesis given and it is applied to find transient solutions for the
M/M/1 queue. This algorithm can also be applied to solve waiting-time
problems as is shown by an exanple",
}

@ARTICLE{Gray77:Services,
AUTHOR="J. P. Gray",
TITLE="Network services in systems network architecture",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="104-116",
YEAR=1977,
REFERENCES=17,
KEYWORDS="SNA; survey",
ABSTRACT="This paper discusses the services provided by a systems
network architecture (SNA) network and design aspects related to these
services. Both the basic transmission services and higher level network
services are discussed.",
}

@ARTICLE{Grub77:Criteria,
AUTHOR="D. S. Grubb and I. W. Cotton",
TITLE="Criteria for Evaluation of Data Communications Services",
JOURNAL=cn,
VOLUME=1,
PAGES="325-340",
YEAR=1977,
REFERENCES=35,
KEYWORDS="Computer network; availability; reliability; communication;
transfer rate; accuracy; network delay; transparency; security;
performance parameter",
}

@ARTICLE{Haug77:Erlang,
AUTHOR="R. B. Haugen",
TITLE="Erlang's ideal grading as a delay system with unlimited and
limited waiting times",
JOURNAL=aeu,
VOLUME=31,
PAGES="467-472",
YEAR=1977,
KEYWORDS="Queueing system; limited waiting time",
}

@ARTICLE{Haug77:Analytische,
AUTHOR="R. B. Haugen and  others",
TITLE="Analytische Untersuchungen von Rückkoppel-Effekten in Rechner
vonelektronisch gesteuerten Systemen",
JOURNAL=en,
ADDRESS="Stuttgart",
VOLUME=52,
YEAR=1977,
LANGUAGE="German",
KEYWORDS="Traffic engineering; Switching",
ABSTRACT="also 8th ITC",
}

@ARTICLE{Herr77:Flow,
AUTHOR="J. Herrmann",
TITLE="Flow Control in the {ARPA} Network",
JOURNAL=cn,
VOLUME=1,
PAGES="65-76",
YEAR=1977,
KEYWORDS="ARPAnet; flow control",
}

@ARTICLE{Hert77:X,
AUTHOR="F. R. Hertweck and E. Raubold and F. Vogt",
TITLE="{X.25} based process-process communication - concepts and
facilities -",
JOURNAL=pik,
ADDRESS="Bonn",
PAGES="1-64",
YEAR=1977,
REFERENCES=7,
KEYWORDS="X.25; process management; pix; interprocess communication",
ABSTRACT="This paper describes an end-to-end protocol for interprocess
communication based on the X.25 virtual channel protocol.",
}

@ARTICLE{Hofr77:Certain,
AUTHOR="M. Hofri",
TITLE="On certain output-buffer management techniques - a stochastic
model",
JOURNAL=jacm,
VOLUME=24,
PAGES="241-249",
YEAR=1977,
REFERENCES=9,
KEYWORDS="Buffer length; overflow; method; real time; steady state
probability; memory management; bulk arrival",
ABSTRACT="A queueing-type model is used to analyze the storage
requirements of a component of a real-time data entry system. The
objectives and criteria of the buffer management procedure are
identified and related to the variables of the model. Both infinite and
finite buffers are considered. The analysis is done symbolically in part
and numerically in part to accommodate input processes that are peculiar
to the system. Techniques to obtain overflow pro",
}

@ARTICLE{Huyn77:Optimal,
AUTHOR="D. Huynh and H. Kobayashi and F. F. Kuo",
TITLE="Optimal design of mixed-media packet-switching networks: routing
and capacity assignment",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="158-169",
YEAR=1977,
REFERENCES=25,
KEYWORDS="packet switching; ALOHA; routing algorithm; time in system;
cost; multiple access",
ABSTRACT="This paper considers a mixed-media packet-switched computer
communication network which consists of a low-delay terrestrial
store-and-forward subnet combined with a low-cost high-bandwidth
satellite subnet. We show how to route traffic via ground and/or
satellite links by means of static, deterministic procedures and assign
capacities to channels subject to a given linear cost such that the
network average delay is minimized.",
}

@TECHREPORT{Irla77:Congestion,
AUTHOR="M. I. Irland",
TITLE="Analysis and simulation of congestion in packet-switched
networks",
INSTITUTION="Department of Computer Science and Computer Communication
Network Group, University of Waterloo",
ADDRESS="Waterloo, Canada",
NUMBER="E-61",
PAGES="1-220",
YEAR=1977,
REFERENCES=136,
KEYWORDS="Packet switching; simulation; model; network congestion;
buffer length; tandem queue; multiprocessor system; CCNG; computer
communication network group",
ABSTRACT="Introduction; The problem; Flows and queues; Congestion in a
packet switch and buffer management; A model of tandem queues motivated
by packet switching; General model of packet-switched networks;
Multiprocessor simulator using minicomputers; Validation of the
simulation; Conclusions and further work this work considers congestion
in packet-switched data communications networks. The carrier's goal is
to maximize data throughput.",
}

@TECHREPORT{Irla77:Simulation,
AUTHOR="M. I. Irland and N. B. Cohen",
TITLE="Simulation of congestion controls in {CIGALE}",
INSTITUTION="Computer communication network group, University of
Waterloo",
ADDRESS="Waterloo, Canada",
NUMBER="E-64",
PAGES="1-33",
YEAR=1977,
REFERENCES=12,
KEYWORDS="Network congestion; simulation; evaluation; CCNG; computer
communication network group",
ABSTRACT="A proposed implementation of congestion controls in the cigale
network is described and the results of a preliminary simulation study
are presented.",
}

@ARTICLE{Karp77:Peripheral,
AUTHOR="W. J. Karplus",
TITLE="Peripheral processors for high-speed simulation",
JOURNAL="Simulation",
PAGES="143-",
YEAR=1977,
KEYWORDS="Continuous simulation",
}

@ARTICLE{Klei77:Throughput,
AUTHOR="L. Kleinrock",
TITLE="Throughput in the {ARPANET-protocols} and measurement",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="95-104",
YEAR=1977,
REFERENCES=13,
KEYWORDS="ARPAnet; measurement; network throughput; network flow",
ABSTRACT="The speed at which large files can travel across a computer
network is an important performance measure of that network. In this
paper we examine the achievable sustained throughput in the Arpanet.",
}

@ARTICLE{Koba77:Approximate,
AUTHOR="H. Kobayashi and Y. Onozato and D. Huynh",
TITLE="An approximate method for design and analysis of an
{ALOHA-system}",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="148-157",
YEAR=1977,
REFERENCES=27,
KEYWORDS="ALOHA; queueing approximation; design; modeling; prediction;
time in system; broadcast; communication; multiple access; packet
broadcasting",
ABSTRACT="We develop here an approximate method for the design and
performance prediction of a multiaccess communication system which
employs the aloha packet-switching technique. Our model is based on the
use of a diffusion process approximation of an aloha-like system (with
or without time-slotting). A simple closed-form solution for the
variable $q(t)$, a variant of the number of backlog messages at time
$t$, is given in terms of a few system and user parameters",
}

@INPROCEEDINGS{Kram77:Processor,
AUTHOR="W. Krämer",
TITLE="Processor priority model with different user tasks and operating
system phases",
BOOKTITLE="International Symposium on Computer Performance",
PUBLISHER="North-Holland",
ADDRESS="Yorktown Heights, New York",
PAGES="305-325",
YEAR=1977,
REFERENCES=16,
KEYWORDS="model; operating system; priority; M/G/1; feedback; process
management",
ABSTRACT="A processor model is considered with different types of user
tasks as well as different operating system phases. The processing of
user code (in problem state) and the processing of operating system code
(in supervisor state) are scheduled by interrupt schemes and by
dispatching rules.",
}

@TECHREPORT{Lack77:DFUE,
AUTHOR="H. Lackner",
TITLE="Das {DFÜ-System} der {BURROUGHS} {B6700}",
INSTITUTION="Universität Karlsruhe, Informatik-Rechnerabteilung",
ADDRESS="Karlsruhe",
PAGES="1-31",
YEAR=1977,
LANGUAGE="German",
KEYWORDS="Communication network; communication protocol; programming
language; data communication; ALGOL",
ABSTRACT="1. Struktur 2. Programmierung",
}

@ARTICLE{Lam77:Queueing,
AUTHOR="S. S. Lam",
TITLE="Queueing networks with population size constraints",
JOURNAL=ibmjrd,
VOLUME=21,
PAGES="370-378",
YEAR=1977,
REFERENCES=15,
KEYWORDS="Exponential queueing network",
ABSTRACT="The class of queueing networks with multiple routing subchains
is extended to include mechanisms of state-dependent lost arrivals and
triggered arrivals. A sufficient condition is found, involving the loss
and trigger functions, for the equilibrium network state probability
distribution to have the product form: the known class of queueing
networks with a product form solution is thus enlarged. Such queueing
networks are useful models for syste",
}

@ARTICLE{Lanc77:Usage,
AUTHOR="G. N. Lance and A. C. Edington",
TITLE="Network usage statistics",
JOURNAL=cn,
VOLUME=1,
PAGES="295-305",
YEAR=1977,
REFERENCES=4,
KEYWORDS="Network management; measurement; file statistics",
}

@ARTICLE{Lave77:Sequential,
AUTHOR="S. S. Lavenberg and C. H. Sauer",
TITLE="Sequential stopping rules for the regenerative method of
simulation",
JOURNAL=ibmjrd,
PAGES="545-",
YEAR=1977,
KEYWORDS="Simulation; regenerative simulation; stopping rule; method;
comparison; M/G/1; two-sample problem; independent cycles; queueing
network",
ABSTRACT="We consider the estimation via simulation of confidence
intervals for steady-state response variables for stochastic systems
which have a regenerative stochastic structure. Sequential stopping
rules are investigated which allow the ratio of the width to the
midpoint of an estimated confidence interval to be specified ahead of
time. We prove that the resulting confidence intervals are valid
asymptotically as the relative width decreases to zero.",
}

@ARTICLE{Law77:Conservation,
AUTHOR="A. M. Law",
TITLE="Conservation equations and their application to queueing
simulations",
JOURNAL=or,
VOLUME=25,
PAGES="279-288",
YEAR=1977,
REFERENCES=3,
KEYWORDS="Queueing system; simulation; estimation; variance; waiting
time; conservation law",
ABSTRACT="In this paper we continue our study of efficient estimators
for simulated queueing systems. We previously showed that it is more
efficient to estimate the first moments of all the usual measures of
performance from an estimate of mean wait in queue than to estimate them
directly. Here we derive some new conservation equations that are then
used to obtain efficient estimators of the variances of the usual
measures of performance. We also introdu",
}

@ARTICLE{Mark77:Allgemeine,
AUTHOR="H. Marko",
TITLE="Eine allgemeine Spektraltransformation, die
Fourier-Transformationund Laplace-Transformation gleichzeitig umfaßt",
JOURNAL=aeu,
VOLUME=31,
NUMBER=9,
PAGES="363-370",
YEAR=1977,
LANGUAGE="German",
REFERENCES=5,
KEYWORDS="Transmission; mathematics",
ABSTRACT="Es wird eine Spektraltransformation vorgestellt, deren
Spektrum sowohl als Fourier-S. als auch als Laplace-S. aufgefaßt
werdenkann, und die somit den Zusammenhang zwischen beiden herstellt.
Mit der Transf. lassen sich allgemeine Zeitfunkt. darstellen und
Stabilitätskriterien für allgemeine Systeme aufstellen. Beispiel:
Anwendung zur Lösung von lin. Dgls. unter Berücksichtigung des
Anfangszustandes durch die vergangene Systemerregung.",
}

@ARTICLE{Mark77:Calculation,
AUTHOR="Z. Markov",
TITLE="Calculation of the fully available group with one type of mixed
traffic",
JOURNAL=aeu,
VOLUME=31,
NUMBER=1,
YEAR=1977,
KEYWORDS="Loss system",
}

@ARTICLE{Matt77:Zeitplatzorganisation,
AUTHOR="H. J. Matt",
TITLE="Eine Zeitplatzorganisation für ein digitales
Breitband-Nachrichtennetz",
JOURNAL=ntz,
PAGES="19-77",
YEAR=1977,
LANGUAGE="German",
KEYWORDS="Switching; LAN; broadband; loop system",
}

@ARTICLE{Matt77:Probabilistic,
AUTHOR="D. E. Matthews",
TITLE="Probabilistic priorities in the {M/G/1} queue",
JOURNAL=navres,
VOLUME=24,
NUMBER=3,
PAGES="457-462",
YEAR=1977,
REFERENCES=7,
KEYWORDS="M/G/1; priority; waiting time; expectation; variance; SPT;
LPT; evaluation",
ABSTRACT="A simple method is presented for deriving the mean and
variance of the queueing time distribution in an M/G/1 queue when the
priorities assigned to customers have an assignment probablity
distribution. Several examples illustrate the results. The mean and
variance of the queueing time distribution for the longest service time
discipline are derived, and its disadvantages are discussed.",
}

@ARTICLE{McGr77:Algorithm,
AUTHOR="P. McGregor and D. Shen",
TITLE="Network design: an algorithm for the access facility location
problem",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="61-73",
YEAR=1977,
REFERENCES=41,
KEYWORDS="Communication network; design; logical network structure;
network topography",
ABSTRACT={In any network where a large number of widely dispersed
"users" share a limited number of "resources", the strategy for access
will play a large part in determining the cost and performance of the
network. In this paper we consider a topological design aspect of the
access problem. in particular, we consider the problem of locating
"access facilities", or concentration points, to obtain an economic
connection of users to resources.},
}

@ARTICLE{Mill77:Simple,
AUTHOR="Nancy Miller and Ian Brown and P. Mars",
TITLE="A simple technique for the determination of delayed maximal
length linear binary sequences",
JOURNAL=ieeetc,
VOLUME="C-26",
PAGES="808-",
YEAR=1977,
KEYWORDS="Shift register sequences",
}

@ARTICLE{Mitc77:Table,
AUTHOR="R. Mitchell",
TITLE="Table-lookup methods for generating arbitrary random numbers",
JOURNAL=ieeetc,
VOLUME="C-26",
PAGES="1006-",
YEAR=1977,
KEYWORDS="Rng",
ABSTRACT="RNG for CDC 6400",
}

@TECHREPORT{Anon77:GMD,
AUTHOR="Anonymous",
TITLE="Das {GMD-Netz} - 4. Simulation",
INSTITUTION="Gesellschaft für Mathematik und Datenverarbeitung",
ADDRESS="Bonn",
PAGES="1-27",
YEAR=1977,
LANGUAGE="German",
REFERENCES=6,
KEYWORDS="Simulation; packet switching; communication protocol;
performance evaluation; communication network; network design; method;
model; GMDNET",
ABSTRACT="Inhaltsverzeichnis: Netzverhalten deadlockfreier systeme;
Flußkontrolle durch begrenzung des Eingangsverkehrs; Optimierung der
Pufferschranken; Individuelle Flußkontrolle; Prioritäten",
}

@ARTICLE{Nock77:Time,
AUTHOR="R. Nocker",
TITLE="A time-division multiplex communication network featuring
decentralized switching and reduced bandwidth",
JOURNAL=siemensfe,
ADDRESS="München",
VOLUME=6,
NUMBER=4,
PAGES="198-203",
YEAR=1977,
REFERENCES=4,
KEYWORDS="communication network; TDM; time division multiplex;
decentralized control; reduced bandwidth",
ABSTRACT="If a communication network level is without a switching
center, but each station has a switching unit of its own, that network
level is said to feature decentralized switching. Communication networks
of this type in which all stations have multiple access to the
transmission medium have been under discussion for some time.",
}

@INPROCEEDINGS{Pare77:Graphical,
AUTHOR="M. Parent and F. Prunet and J. M. Dumas and Y. Moreau",
TITLE="Graphical models and the {LAM} hardware discrete event
simulator",
BOOKTITLE="Computer performance",
PUBLISHER="North Holland",
YEAR=1977,
KEYWORDS="Hardware simulator; graphical input",
}

@PHDTHESIS{Pawl77:Messung,
AUTHOR="P. F. Pawlita",
TITLE="Messung und Analyse des Ein-/Ausgabeverkehrs von Datenstationen
in fernverarbeitungsnetzen",
SCHOOL="RWTH Aachen",
ADDRESS="Aachen, Germany",
PAGES=168,
YEAR=1977,
LANGUAGE="German",
REFERENCES=100,
KEYWORDS="Traffic measurement; traffic model",
}

@ARTICLE{Peas77:Indirect,
AUTHOR="M C Pease",
TITLE="The Indirect Binary n-Cube Microprocessor Array",
JOURNAL=ieeetc,
VOLUME="C-26",
NUMBER=5,
PAGES="458-473",
YEAR=1977,
REFERENCES=16,
KEYWORDS="Interconnection Network",
}

@ARTICLE{Pric77:Data,
AUTHOR="W. L. Price",
TITLE="Data Network Simulation Experiments at the National Physical
Laboratory",
JOURNAL=cn,
VOLUME=1,
PAGES="199-210",
YEAR=1977,
KEYWORDS="Computer network; simulation",
}

@INPROCEEDINGS{Pric77:Simulation,
AUTHOR="W. L. Price",
TITLE="Simulation of the 10-node data communication network operating
with link speeds of 9.6 kb/s",
BOOKTITLE="NPL Report COM 87",
PAGES="2-26",
YEAR=1977,
REFERENCES=7,
KEYWORDS="Simulation; communication network; routing algorithm;
comparison; limited waiting time",
}

@TECHREPORT{Pric77:Adaptive,
AUTHOR="W. L. Price",
TITLE="Adaptive Routing in Store-And-Forward Networks and the Importance
of Load Splitting",
INSTITUTION="National Physical Laboratory",
ADDRESS="Teddington",
YEAR=1977,
REFERENCES=14,
KEYWORDS="Routing algorithm; packet switching; adaptive routing",
ABSTRACT="The paper briefly surveys recent work in data communications
network traffic routing, with particular reference to the performance
improvements that may be expected from the various available techniques.
The needs of a network organised in areas or in hierarchies are
discussed. An account is given of experimental work in which simulation
is used to investigate the performance of a network in which the routing
algorithm deliberately sets out",
}

@TECHREPORT{Raub77:PIX,
AUTHOR="E. Raubold",
TITLE="The {PIX} communication model",
INSTITUTION="GMD",
ADDRESS="Bonn, Germany",
PAGES="1-20",
YEAR=1977,
REFERENCES=9,
KEYWORDS="communication protocol; process management; pix; interprocess
communication",
ABSTRACT="In order to have guidelines for the definition of higher level
protocols within pix project, a pragmatic model of inter-process
communication has been developed.",
}

@INPROCEEDINGS{Rey77:Robust,
AUTHOR="W. J. J. Rey",
TITLE="M-estimators in robust regression, a case study",
BOOKTITLE="recent developments in statistics",
ADDRESS="Brussels",
YEAR=1977,
KEYWORDS="Statistics",
ABSTRACT="PRLB employee",
}

@ARTICLE{Rusc77:Unifying,
AUTHOR="M. Ruschitzka and R. S. Fabry",
TITLE="A unifying approach to scheduling",
JOURNAL=cacm,
VOLUME=20,
PAGES="469-477",
YEAR=1977,
KEYWORDS="Scheduling; queueing discipline; priority; processor sharing;
process management",
ABSTRACT="This paper presents a scheme for classifying scheduling
algorithms based on an abstract model of a scheduling system which
formalizes the notion of priority.",
}

@ARTICLE{Schr77:Berechnung,
AUTHOR="F. Schreiber",
TITLE="Berechnung von Mittelwert und Varianz",
JOURNAL=aeu,
VOLUME=30,
PAGES="141-",
YEAR=1977,
LANGUAGE="German",
KEYWORDS="Queueing system; L'Hospital; Faa di Bruno",
}

@ARTICLE{Schw77:Theoretische,
AUTHOR="M. Schwindt",
TITLE="Theoretische Beschreibung von Komponenten zur
Analog-Stochastik-Codierung",
JOURNAL="Frequenz",
VOLUME=31,
PAGES="352-",
YEAR=1977,
LANGUAGE="German",
KEYWORDS="Stochastic computer",
}

@ARTICLE{Suit77:Näherung,
AUTHOR="D. Suiter",
TITLE="Näherung der Wahrscheinlichkeitsdichten von Netzwerkfunktionen
durch Pearsonsche Kurven",
JOURNAL=aeu,
VOLUME=31,
PAGES="457-462",
YEAR=1977,
LANGUAGE="German",
REFERENCES=6,
KEYWORDS="Approximation; method; Pearson family distribution; linear
network",
ABSTRACT="The probability densities of network functions are
approximated by curves of Pearson's system of curves. At first, moments
up to fourth order are calculated from the second order approximation of
the network function. From this, skewness and excess of the distribution
are determined and accordingly the suitable curve of the Pearson system
is selected.",
}

@PHDTHESIS{Tuch77:Einfluss,
AUTHOR="H. Tuchel",
TITLE="Der Einfluß der Warteprozedurfamilie {F/LIFO} auf das
Systemverhalten des Warteraums {M/G/1}",
SCHOOL="RWTH Aachen",
ADDRESS="Aachen, Germany",
PAGES=170,
YEAR=1977,
LANGUAGE="German",
REFERENCES=63,
KEYWORDS="Queueing system; queueing discipline; FIFO; LIFO",
}

@ARTICLE{Geld77:Structured,
AUTHOR="A. van Gelder",
TITLE="Structured programming in {COBOL:} an approach for application
programmers",
JOURNAL=cacm,
VOLUME=20,
PAGES="2-12",
YEAR=1977,
REFERENCES=24,
KEYWORDS="Program construction; COBOL; standard",
ABSTRACT="Techniqes for designing and writing cobol programs are
presented.",
}

@ARTICLE{Schm77:GPSS,
AUTHOR="B. Schmidt",
TITLE="{GPSS-FORTRAN} - Die Modellerstellung nach dem
Baukastenverfahren",
JOURNAL=er,
VOLUME=19,
NUMBER=1,
PAGES="21-24",
YEAR=1977,
LANGUAGE="German",
REFERENCES=1,
KEYWORDS="Simulation; Discrete event simulation; Simulation language;
GPSS-FORTRAN",
ABSTRACT="Short introduction in GPSS-FORTRAN",
}

@ARTICLE{Igna77:Output,
AUTHOR="E. Ignall and A. Silver",
TITLE="The output of a two-stage system with unreliable machines and
limited storage",
JOURNAL="AIIE Transactions",
VOLUME=9,
NUMBER=2,
PAGES="183-188",
YEAR=1977,
REFERENCES=8,
KEYWORDS="Tandem queue; manufacturing system; buffer length",
ABSTRACT="Buffer storage allows the decoupling of successive stages of
larautomatic production systems, which can be important when the
masometimes fail. System designers shoud know how much added
buffecapacity increases the hourly output of such system. Previously
available methods for predicting this increase treat systems witmachine
in each stage. We present a computationally simple heuriprocedure for
estimating hourly line output for two stage system",
}

@ARTICLE{Chun77:Blocking,
AUTHOR="F. R. K. Chung and F. K. Hwang",
TITLE="On Blocking Probabilities for Switching Networks",
JOURNAL=bstj,
VOLUME=56,
NUMBER=8,
PAGES="1431-1446",
YEAR=1977,
KEYWORDS="Link system",
}

@ARTICLE{Dart77:Begriffe,
AUTHOR="J. P. Dartois",
TITLE="Die Begriffe 'Verkehrsgüte' und 'Vermittlungstechnische
Dienstgüte' in öffentlichen Fernsprechvermittlungsstellen",
JOURNAL="Elektrisches Nachrichtenwesen",
VOLUME=52,
PAGES="288-300",
YEAR=1977,
LANGUAGE="German",
KEYWORDS="Loss system",
ABSTRACT="Nennverkehrsbedingungen, Belegungsspektrum, -kapazität,
Verkehrsgüte, -aufteilung, Vollständigkeitsgrad, Wartewahrscheinlichke
it,",
}

@BOOK{Desc77:Pricing,
AUTHOR="P. J. Deschamps",
TITLE="Pricing for Congestion in Telephone Networks: A Numerical
Example",
PUBLISHER="Academic Press",
ADDRESS="New York",
YEAR=1977,
KEYWORDS="QOS; pricing; congestion; quality of service",
}

@ARTICLE{Elsn77:Descent,
AUTHOR="W. B. Elsner",
TITLE="A Descent Algorithm for the Multihour Sizing if Traffic
networks",
JOURNAL=bstj,
VOLUME=56,
NUMBER=8,
PAGES="1405-1430",
YEAR=1977,
KEYWORDS="Gos",
ABSTRACT="Verkehrstheorie, verteilte Verkehrsspitzen,
Verbindungsleitungsberechnung, Beispiele",
}

@ARTICLE{Eser77:Einsatz,
AUTHOR="J. Eßer and G. Bär",
TITLE="Einsatz von Wählsterneinrichtungen im öffentlichen Netz der
Deutschen Bundespost",
JOURNAL="Unterrichtsblätter der Deutschen Bundespost",
ADDRESS="Darmstadt",
VOLUME=30,
NUMBER=8,
YEAR=1977,
LANGUAGE="German",
KEYWORDS="Loss system",
ABSTRACT="Eßer: TFAm FTZ Darmstadt, Bär :Stuttgart",
}

@ARTICLE{Hill77:Effects,
AUTHOR="D. D. Hill",
TITLE="The Effects of Traffic Load Variation on Measurement Accuracy",
JOURNAL=bstj,
VOLUME=56,
NUMBER=4,
PAGES="561-573",
YEAR=1977,
KEYWORDS="Measurement",
}

@ARTICLE{Hwan77:Construction,
AUTHOR="F. K. Hwang and T. C. Liang",
TITLE="Construction for Group-Balanced Connecting Networks",
JOURNAL=bstj,
VOLUME=56,
NUMBER=9,
YEAR=1977,
KEYWORDS="Link system",
}

@ARTICLE{Jewe77:Queuing,
AUTHOR="J. Jewett",
TITLE="Network Design for Queuing Situations: Equivalent Queue Tables
and Example",
JOURNAL=bcr,
VOLUME="May-June",
PAGES="3-13",
YEAR=1977,
KEYWORDS="Delay system",
}

@ARTICLE{Jewe77:Which,
AUTHOR="J. Jewett and J. H. Holland",
TITLE="Which Formula Predicts Cost and Grade of Service Best: Poisson,
{Erlang} B or Extended {Erlang} {B?}",
JOURNAL=bcr,
VOLUME="March-Apri",
PAGES="21-27",
YEAR=1977,
KEYWORDS="Loss system",
}

@INPROCEEDINGS{Kamp77:Link,
AUTHOR="G. Kampe",
TITLE="Analysis of Link Systems with Delay",
BOOKTITLE=icc,
ADDRESS="Chicago",
VOLUME=1,
PAGES="244-248",
YEAR=1977,
KEYWORDS="Link system",
}

@TECHREPORT{Kamp77:Vielstufig,
AUTHOR="G. Kampe",
TITLE="Vielstufig konjugierte Wartesysteme zur Verkehrskonzentration",
TYPE="23. Bericht über verkehrstheoretische Arbeiten",
INSTITUTION="Institut für Nachrichtenvermittlung und Datenverkehr,
Universität Stuttgart",
ADDRESS="Stuttgart, Germany",
VOLUME=23,
YEAR=1977,
LANGUAGE="German",
KEYWORDS="Delay system",
}

@ARTICLE{Schu77:Wozu,
AUTHOR="W. Schuberth",
TITLE="Wozu Verkehrstheorie?",
JOURNAL=fernmeldepraxis,
VOLUME=54,
NUMBER=9,
PAGES="373-401",
YEAR=1977,
LANGUAGE="German",
KEYWORDS="Loss system",
}

@TECHREPORT{Weis77:Entwicklung,
AUTHOR="H. Weisschuh",
TITLE="Entwicklung der Steuersoftware für eine rechnergesteuerte
Vermittlungsstelle",
TYPE="24. Bericht über verkehrstheoretische Arbeiten",
INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung
der Universität Stuttgart",
ADDRESS="Stuttgart, Germany",
VOLUME=24,
YEAR=1977,
LANGUAGE="German",
KEYWORDS="Control; overload control",
}

@ARTICLE{Atki77:Easyly,
AUTHOR="A. C. Atkinson",
TITLE="An easyly programmed algorithm for generating gamma random
variables",
JOURNAL="Journal of the Royal Statistical Society, Series A, Part 2",
VOLUME=140,
PAGES="232-234",
YEAR=1977,
KEYWORDS="random variate generation",
}

@INPROCEEDINGS{Briz77:Algorithms,
AUTHOR="M. Brizzi and D. Grillo",
TITLE="Implementation of algorithms for performance analysis of a class
of multiprogrammed computers",
BOOKTITLE="Measuring, Modelling and Evaluating Computer Systems",
EDITOR="H. Beilner and E. Gelenbe",
PUBLISHER="North-Holland",
PAGES="131-150",
YEAR=1977,
KEYWORDS="Queueing network; product form; analysis",
}

@ARTICLE{Chen77:Generation,
AUTHOR="R.-G. Cheng",
TITLE="The generation of gamma variables with non-integral shape
parameter",
JOURNAL=as,
VOLUME=26,
NUMBER=1,
PAGES="71-75",
YEAR=1977,
KEYWORDS="random variate generation",
}

@INCOLLECTION{Gree77:Portable,
AUTHOR="J. A. Greenwood",
TITLE="Portable generators for the random variables usual in reliability
simulation",
BOOKTITLE="Recent Developments in Statistics",
PUBLISHER="North-Holland",
PAGES="677-688",
YEAR=1977,
KEYWORDS="random variate generation",
}

@INPROCEEDINGS{Henr77:Improved,
AUTHOR="J. O. Henriksen",
TITLE="An improved events list algorithm",
BOOKTITLE="Winter Simulation Conference",
EDITOR="H. J. Highland and R. G. Sargent and J. W. Schmidt",
ADDRESS="Gaithersberg",
VOLUME=2,
PAGES="546-557",
YEAR=1977,
KEYWORDS="Simulation; event set",
}

@ARTICLE{Kami77:Simulating,
AUTHOR="F. C. Kaminsky and D. L. Rumpf",
TITLE="Simulating nonstationary Poisson processes: A comparison of
alternatives including the correct approach",
JOURNAL="Simulation",
VOLUME=29,
NUMBER=1,
PAGES="17-20",
YEAR=1977,
KEYWORDS="random variate generation",
}

@ARTICLE{Kind77:Computer,
AUTHOR="A. J. Kinderman and J. F. Monahan and J. G. Ramage",
TITLE="Computer methods for sampling from Student's $t$ distribution",
JOURNAL=moc,
VOLUME=31,
NUMBER=140,
PAGES="1009-1018",
YEAR=1977,
KEYWORDS="random variate generation",
}

@INCOLLECTION{Labe77:Modeling,
AUTHOR="J. Labetoulle and",
TITLE="Modeling of packet switching communication networks with finite
buffer size at each node",
BOOKTITLE="Computer Performance",
EDITOR="K. M. Chandy and M. Reiser",
PUBLISHER="North-Holland, Amsterdam",
PAGES="515-535",
YEAR=1977,
}

@ARTICLE{Lam77:Extension,
AUTHOR="S. S. Lam",
TITLE="An extension of Moore's result for closed queuing networks",
JOURNAL=ibmjrd,
VOLUME=21,
NUMBER=4,
PAGES="384-387",
YEAR=1977,
KEYWORDS="Queueing network; product form; analysis",
}

@ARTICLE{Lemo77:Networks,
AUTHOR="A. J. Lemoine",
TITLE="Networks of queues -- a survey of equilibrium analysis",
JOURNAL=ms,
VOLUME=24,
NUMBER=4,
PAGES="464-481",
YEAR=1977,
KEYWORDS="Queueing network; product form; analysis",
}

@ARTICLE{Mars77:Squeeze,
AUTHOR="G. Marsaglia",
TITLE="The squeeze method for generating gamma variates",
JOURNAL="Computers and Mathematics with Applications",
VOLUME=3,
NUMBER=4,
PAGES="321-325",
YEAR=1977,
KEYWORDS="random variate generation",
}

@INPROCEEDINGS{Moel77:Spectral,
AUTHOR="T. L. Moeller and Peter D. Welch",
TITLE="A spectral based technique for generating confidence intervals
from simulation outputs",
BOOKTITLE="Winter Simulation Conference",
EDITOR="H. J. Highland and R. G. Sargent and J. W. Schmidt",
ADDRESS="Gaitherburg",
VOLUME=1,
PAGES="177-184",
YEAR=1977,
KEYWORDS="Simulation; statistical technique; confidence interval",
}

@ARTICLE{Panw77:Scheduling,
AUTHOR="S. S. Panwalkar and W. Iskander",
TITLE="A survey of scheduling rules",
JOURNAL=or,
VOLUME=25,
NUMBER=1,
PAGES="45-61",
YEAR=1977,
}

@ARTICLE{Pope77:Computer,
AUTHOR="I. Popescu",
TITLE="On computer generation of Burr and Pareto random variables",
JOURNAL="Analele Universitatii Bucuresti, Seria Matematica",
ADDRESS="Bucaresti",
VOLUME=26,
PAGES="79-89",
YEAR=1977,
KEYWORDS="random variate generation",
}

@INCOLLECTION{Reis77:Numerical,
AUTHOR="M. Reiser",
TITLE="Numerical methods in separable queueing networks",
BOOKTITLE="TIMS Studies in the Management Sciences",
EDITOR="M. F. Neuts",
PUBLISHER="North-Holland, Amsterdam",
VOLUME=7,
PAGES="113-142",
YEAR=1977,
KEYWORDS="Queueing network; product form; analysis",
}

@INPROCEEDINGS{Sevc77:Improving,
AUTHOR="K. C. Sevcik and A. I. Levy and Satish K. Tripathi and J. L.
Zahorjan",
TITLE="Improving approximations for aggregated queuing network
subsystems",
BOOKTITLE="Computer performance",
EDITOR="K. M. Chandy and M. Reiser",
PUBLISHER="North-Holland, Amsterdam",
PAGES="1-22",
YEAR=1977,
KEYWORDS="Queueing network; analysis",
}

@INPROCEEDINGS{Stew77:New,
AUTHOR="W. J. Stewart",
TITLE="A new approach to the numerical analysis of Markovian models",
BOOKTITLE="Computer performance",
EDITOR="K. M. Chandy and M. Reiser",
PUBLISHER="North-Holland, Amsterdam",
PAGES="279-295",
YEAR=1977,
KEYWORDS="Markov chain; linear equation",
}

@ARTICLE{Vadu77:Computer,
AUTHOR="I. Vaduva",
TITLE="On computer generation of gamma random variables by rejection and
composition procedures",
JOURNAL="Mathematische Operationsforschung und Statistik, Series
Statistics",
VOLUME=8,
NUMBER=4,
PAGES="545-576",
YEAR=1977,
KEYWORDS="random variate generation",
}

@TECHREPORT{Roth77:Berechnung,
AUTHOR="K. Rothmaier",
TITLE="Berechnung des Wähltonverzugs in registergesteuerten
Vermittlungssystemen",
INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung,
Prof. Dr.-Ing. A. Lotze",
ADDRESS="TH Stuttgart",
YEAR=1977,
LANGUAGE="German",
KEYWORDS="SPC; performance evaluation",
}

@INPROCEEDINGS{Huen77:Computer,
AUTHOR="W. Huen and  others",
TITLE="A Network Computer for Distributed Processing",
BOOKTITLE=compcon,
PAGES="326-330",
NOTE="also in \cite{Thur81:Tutorial}",
MONTH="Fall",
YEAR=1977,
}

@INPROCEEDINGS{Liu77:Message,
AUTHOR="Minkui Liu and C. C. Reames",
TITLE="Message communication protocol and Operating System design for
the Distributed Loop Computer Network {(DLCN)}",
BOOKTITLE="4th annual Symposium on Computer Architecture",
PAGES="193-200",
YEAR=1977,
}

@INPROCEEDINGS{McQu77:Routing,
AUTHOR="J. M. McQuillan",
TITLE="Routing Algorithms for computer networks - A survey",
BOOKTITLE=ntc,
YEAR=1977,
}

@ARTICLE{Mock77:Local,
AUTHOR="P. V. Mockapetris and  others",
TITLE="On the design of local network interfaces",
JOURNAL="IFIP Proceedings",
PAGES="427-430",
YEAR=1977,
}

@ARTICLE{Saka77:House,
AUTHOR="T. Sakai and  others",
TITLE="In house Computer Network: Kuipnet",
JOURNAL="Information Processing",
PAGES="161-166",
NOTE="also in \cite{Thur81:Tutorial}",
YEAR=1977,
}

@INPROCEEDINGS{Toko77:Acknowledging,
AUTHOR="M. Tokoro and K. Tamaru",
TITLE="Acknowledging Ethernet",
BOOKTITLE=compcon,
PAGES="320-325",
NOTE="also in \cite{Thur81:Tutorial}",
MONTH="Fall",
YEAR=1977,
REFERENCES=2,
KEYWORDS="Ethernet; LAN; simulation; performance evaluation",
ABSTRACT="A modified Ethernet named 'Acknowledging Ethernet' which
essentially provides higher reliability is proposed herein and its
performance is evaluated via a simulation. The evaluation results show
the advantages of Ack. Ethernet over the original Ethernet in both
response timeand effective transmission rate. Comparing the overall
performance the modified version appears to be a definite improvement.",
}

@ARTICLE{Zloo7704:Query,
AUTHOR="M. M. Zloof",
TITLE="Query By Example: a database language",
JOURNAL=ibmsj,
VOLUME=16,
NUMBER=4,
PAGES="324-343",
YEAR=1977,
KEYWORDS="Qbe",
}

@INCOLLECTION{Flan77:Efficient,
AUTHOR="P. M. Flanders and D. J. Hunt and S. F. Reddaway and D.
Parkinson",
TITLE="Efficient high speed computing with the Distributed Array
Processor",
BOOKTITLE="High Speed Computer and Algorithm Organisation",
PUBLISHER="Academic Press",
ADDRESS="London",
PAGES="113-128",
YEAR=1977,
}

@BOOK{Gonz77:Digital,
AUTHOR="R. C. Gonzalez and P. Wintz",
TITLE="Digital Image Processing",
PUBLISHER="Addison-Wesley",
YEAR=1977,
ABSTRACT="Good overview of image processing.",
}

@ARTICLE{Zuck7704:Application,
AUTHOR="S. W. Zucker and R. A. Hummel and A Rosenfeld",
TITLE="An application of relaxation labelling to line and curve
enhancements",
JOURNAL=ieeetc,
VOLUME=26,
NUMBER=4,
PAGES="394-403",
YEAR=1977,
}

@TECHREPORT{Brya77:Simulation,
AUTHOR="R. M. Bryant",
TITLE="Simulation of packet communication architecture computer
systems",
INSTITUTION="Massachusetts Institute of Technology",
ADDRESS="Cambridge, Mass.",
NUMBER="MIT,LCS,TR-188",
YEAR=1977,
}

@ARTICLE{Zloo77:Query,
AUTHOR="M. M. Zloof",
TITLE="Query-by-Example: A Data Base Language",
JOURNAL=ibmsj,
NUMBER=4,
YEAR=1977,
REFERENCES=12,
ABSTRACT="Query-by-Example is a high-level data base management language
that provides a convenient and unified style to query, update, define,
and protocol a relational data base. The philosophy of Query-by-Example
is to require the user to know very little in order to get started and
to minimize the number of concepts that he subsequently has to learn in
order to understand and use the whole language. The language syntax is
simple, yet it covers a wide variety of complex transactions. This is
achieved through the use of the same operations for retrieval,
manipulation, definition, and control (to the extent possible). The
language operations should mimic, as much as possible, manual table
manipulation, thus capturing the simplicity, symmetry and neutrality of
the relational model. The formulation od transaction should capture the
user's thought process, thereby providing freedom to formulate a
transaction. The system should allow the user to create and drop tables
dynamically from the data base; it must also provide the user with a
dynamic capability for defining control statements and security
features.",
}

@INCOLLECTION{Pier77:Telephone,
AUTHOR="John R. Pierce",
TITLE="The telephone and society in the past 100 years",
BOOKTITLE="Social Impact of the Telephone",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=13,
KEYWORDS="telephone; social impact",
ABSTRACT="Statistics on telephone usage from 1876 to 1976.",
}

@INCOLLECTION{Maye77:Telephone,
AUTHOR="Martin Mayer",
TITLE="The telephone and the uses of time",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=4,
KEYWORDS="telephone; social impact",
ABSTRACT="Statistics on local and long distance calling, such as
duration, demographics, calls per day, holding time by time of day,
residence toll call distribution.",
}

@INCOLLECTION{Aron77:Bell,
AUTHOR="Sidney H. Aronson",
TITLE="Bell's Electrical Toy: What's the Use? The Sociology of Early
Telephone Usage",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=75,
KEYWORDS="telephone; social impact; history",
ABSTRACT="Describes reception of early telephone experiments.",
}

@INCOLLECTION{Brig77:Pleasure,
AUTHOR="Asa Briggs",
TITLE="The Pleasure Telephone",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=82,
KEYWORDS="telephone; social impact",
ABSTRACT="Describes early entertainment uses for the telephone.",
}

@INCOLLECTION{Perr77:British,
AUTHOR="Charles R. Perry",
TITLE="The British Experience 1876--1912: The Impact of the Telephone
During the Years of Delay",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=106,
KEYWORDS="telephone; social impact; history; technology acceptance;
Great Britain",
ABSTRACT="Describes why telephones took longer to gain popularity in
Great Britain than in the United States.",
}

@INCOLLECTION{Atta77:Birth,
AUTHOR="Jacques Attali and Yves Stourdze",
TITLE="The birth of the telephone and economic crisis: the slow death of
monologue in French society",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=21,
KEYWORDS="telephone; social impact; France; technology acceptance",
}

@INCOLLECTION{Cher77:Telephone,
AUTHOR="Colin Cherry",
TITLE="The telephone system: creator of mobility and social change",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=7,
KEYWORDS="telephone; social impact; economics",
ABSTRACT="Figure with ratio of domestic telephones per business
telephones as a function of per-capita GNP.",
}

@INCOLLECTION{Pool77:Foresight,
AUTHOR="Ithiel de Sola Pool",
TITLE="Foresight and hindsight: the case of the telephone",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=48,
KEYWORDS="telephone; social impact; history; technology forecast",
ABSTRACT="Contains 1878 letter of Alexander Graham Bell to the
capitalists of the Electric Phone Company.",
}

@INCOLLECTION{Boet77:Sixth,
AUTHOR="Henry M. Boettinger",
TITLE="Our sixth-and-a-half sense",
BOOKTITLE="Social Impact of the Telephone",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
KEYWORDS="telephone; social impact",
}

@INCOLLECTION{Broo77:First,
AUTHOR="John Brooks",
TITLE="The first and only century of telephone literature",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=20,
KEYWORDS="telephone; social impact; literature",
}

@INCOLLECTION{Wurt77:Latent,
AUTHOR="Alan H. Wurtzel and Colin Turner",
TITLE="Latent functions of the telephone: what missing the extension
means",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=20,
KEYWORDS="telephone; social impact; reliability",
ABSTRACT="Describes effect of 1975 telephone outage in Manhattan.",
}

@INCOLLECTION{Bren77:Women,
AUTHOR="Brenda Maddox",
TITLE="Women and the switchboard",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=50,
KEYWORDS="telephone; social impact; switchboard",
}

@INCOLLECTION{Kell77:Telephone,
AUTHOR="Suzanne Keller",
TITLE="The telephone in new (and old) communities",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=38,
KEYWORDS="telephone; social impact; future; community",
}

@INCOLLECTION{Gott77:Megalopolis,
AUTHOR="Jean Gottmann",
TITLE="Megalopolis and antipolis: the telephone and the structure of the
city",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=9,
KEYWORDS="telephone; social impact; office location",
}

@INCOLLECTION{Able77:Telephone,
AUTHOR="Ronald Abler",
TITLE="The telephone and the evolution of the American metropolitan
system",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=33,
KEYWORDS="telephone; social impact; cost; long-distance",
ABSTRACT="Provides historical cost of long-distance call between New
York and San Francisco, showing flattening as a function of distance.",
}

@INCOLLECTION{Moye77:Urban,
AUTHOR="J. Alan Moyer",
TITLE="Urban growth and the development of the telephone: some
relationships at the turn of the century",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=80,
KEYWORDS="telephone; social impact; Boston; history",
}

@INCOLLECTION{Thor77:Silent,
AUTHOR="Bertil Thorngren",
TITLE="Silent Actors: communication networks for development",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=8,
KEYWORDS="telephone; social impact",
}

@INCOLLECTION{Reid77:Comparing,
AUTHOR="A. A. L. Reid",
TITLE="Comparing telephone with face-to-face contact",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=41,
KEYWORDS="telephone; social impact; communications effiency",
ABSTRACT="Summarizes studies comparing the efficiency of audio-only
(telephone) communications with face-to-face or video communications.",
}

@INCOLLECTION{Sche77:Identification,
AUTHOR="Emanuel A. Schegloff",
TITLE="Identification and recognition in interactional openings",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=17,
KEYWORDS="telephone; social impact; conversation behavior",
}

@INCOLLECTION{Lest77:Use,
AUTHOR="David Lester",
TITLE="The use of the telephone in counseling and crisis intervention",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=37,
KEYWORDS="telephone; social impact; counseling",
}

@INCOLLECTION{Rao77:Telephone,
AUTHOR="Paladugu V. Rao",
TITLE="Telephone and instructional communications",
BOOKTITLE="Social Impact of the Telephone",
EDITOR="Ithiel de Sola Pool",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
REFERENCES=22,
KEYWORDS="telephone; social impact; teleteaching; education",
}

@BOOK{Pool77:Social,
AUTHOR="Ithiel de Sola Pool",
TITLE="The social impact of the telephone",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
YEAR=1977,
LANGUAGE="English",
KEYWORDS="telephone; social impact; history; collection",
}

@INPROCEEDINGS{Pand77:Delay,
AUTHOR="R. N. Pandya",
TITLE="Delay Analysis for {DATAPAC} - A Packet Switched Network with two
priority Classes",
BOOKTITLE="5th Data Communications Symposium",
ADDRESS="Ottawa, Canada",
PAGES="3-14-3-21",
YEAR=1977,
REFERENCES=12,
KEYWORDS="Delay analysis; public network; packet switching; priority;
queueing system; estimation",
}

@ARTICLE{Jewe77:Network,
AUTHOR="J. Jewett",
TITLE="Network Design for Queuing Situations: Equivalent QueueTables and
Example",
JOURNAL=bcr,
VOLUME="May-June",
PAGES="3-13",
YEAR=1977,
KEYWORDS="Delay system",
}

@ARTICLE{Arhn77:Erlang,
AUTHOR="J. Arhnung",
TITLE="{A.K.} {Erlang}",
JOURNAL="Teleteknik",
ADDRESS="Sweden",
NUMBER=4,
PAGES="201-210",
YEAR=1977,
LANGUAGE="Danish",
KEYWORDS="Traffic theory; erlang b formula; erlang c formula",
}

@TECHREPORT{Berr77:Generalisation,
AUTHOR="L. T. M. Berry",
TITLE="A Generalisation of the {Erlang} Loss Formula",
INSTITUTION="Applied Mathematics Department, University of Adelaide",
PAGES=12,
YEAR=1977,
KEYWORDS="multiserver",
}

@ARTICLE{Boer77:Overflow,
AUTHOR="J. de Boer",
TITLE="Overflow Traffic of a Group of Lines connected to One or Two
Link-Networks",
JOURNAL=ptr,
VOLUME=35,
NUMBER=1,
PAGES="45-54",
YEAR=1977,
KEYWORDS="overflow traffic; link system; network",
}

@BOOK{Butr77:Economical,
AUTHOR="A. V. Butrimenko",
TITLE="Economical Reasons for Computer Networks",
PUBLISHER="Progress in Cybernetics and Systems Research, Volume V.J.
Wiley \& Sons",
PAGES="436-445",
YEAR=1977,
KEYWORDS="Computer Network; Economic Evaluation",
}

@TECHREPORT{Buze77:Principles,
AUTHOR="J. P. Buzen",
TITLE="Principles of Computer Performance Modelling and Prediction",
SERIES="Infotech State of the Art Report",
INSTITUTION="Performance Modelling and Prediction",
PAGES="1-18",
YEAR=1977,
KEYWORDS="Performance model; prediction; computer performance",
}

@ARTICLE{Clev77:Bayes,
AUTHOR="M. L. Clevenson and J. V. Zidek",
TITLE="Bayes Linear Estimators of the Intensity Function of the
Nonstationary Poisson Process",
JOURNAL="Journal of the American Statistical Association",
VOLUME=72,
NUMBER=357,
PAGES="112-120",
YEAR=1977,
KEYWORDS="Poisson process; Bayes statistics; estimation; instationary
process",
ABSTRACT="Intensity variations",
}

@ARTICLE{Cono77:Generalised,
AUTHOR="B. W. Conolly and J. Chan",
TITLE="Generalised Birth and Death Queueing Processes: Recent Results",
JOURNAL=aap,
VOLUME=9,
PAGES="125-140",
YEAR=1977,
KEYWORDS="Birth-Death Process; Queueing Theory",
}

@ARTICLE{Corb7702:Vereinfachung,
AUTHOR="A. Corbaz",
TITLE="Vereinfachung der Abrechnung von Telefongeb hren in öffentlichen
Sprechstellen sowie Überwachung der Telefonlinien in privaten
Unternehmen",
JOURNAL="Landis \& Gyr - Mitteilungen",
ADDRESS="Germany",
VOLUME=24,
NUMBER=2,
PAGES="10-12",
YEAR=1977,
LANGUAGE="German",
KEYWORDS="charging",
}

@INPROCEEDINGS{Dams77:Tidsrekkeanalyse,
AUTHOR="E. Damsleth and B. H. Sollie",
TITLE="Tidsrekkeanalyse av målte og simulerte data",
BOOKTITLE="NTS 1",
ADDRESS="Kjeller, Norway",
PAGES=20,
YEAR=1977,
LANGUAGE="Norwegian",
KEYWORDS="Simulation",
ABSTRACT="NTS-1",
}

@TECHREPORT{Denn77:Operational,
AUTHOR="P. J. Denning",
TITLE="An Operational Overview of Queueing networks",
INSTITUTION="Infotech State of the Art Report",
PAGES="75-107",
NOTE="Performance Modelling and Prediction",
YEAR=1977,
KEYWORDS="Queueing network; overview",
}

@ARTICLE{Eise77:Engineering,
AUTHOR="M. Eisenberg",
TITLE="Engineering Traffic Networks for More Than One Busy Hour",
JOURNAL=bstj,
VOLUME=56,
NUMBER=1,
PAGES="1-20",
YEAR=1977,
KEYWORDS="Traffic Engineering; Network Planning; Heavy Load",
}

@ARTICLE{Elld7704:Teletrafikproblem,
AUTHOR="A. Elldin",
TITLE="Teletrafikproblem i utvicklingsländer",
JOURNAL=ericssonr,
ADDRESS="Stockholm, Sweden",
NUMBER=4,
PAGES="149-161",
YEAR=1977,
LANGUAGE="Swedish",
KEYWORDS="Ccitt",
ABSTRACT="ITU; ESCAP",
}

@ARTICLE{Elld77:Teletraffic,
AUTHOR="A. Elldin",
TITLE="Teletraffic Engineering Problems in Developing Countries",
JOURNAL=ericssont,
NUMBER=4,
PAGES=13,
YEAR=1977,
KEYWORDS="Traffic Engineering; Special Issue",
}

@ARTICLE{Fali77:Waiting,
AUTHOR="G. I. Falin",
TITLE="Waiting Time in a Single-Channel Queueing System with Repeated
Calls",
JOURNAL="Computational Mathematics and Cybernetics",
ADDRESS="Moscow, SU",
PAGES="66-69",
YEAR=1977,
KEYWORDS="Waiting Time; Queueing System; Single Server",
}

@TECHREPORT{Geil77:Udkast,
AUTHOR="S. Geil and D. Sörensson",
TITLE="Udkast til Nyt Trafikcirkulære",
INSTITUTION="Arbejdsgruppe under Telefontilsynet",
ADDRESS="Denmark",
PAGES=15,
YEAR=1977,
LANGUAGE="Danish",
}

@ARTICLE{Honi77:Practical,
AUTHOR="G. Honi and G. Gosztony",
TITLE="Some Practical Problems of the Traffic Engineering in Overloaded
Telephone networks",
JOURNAL="Budavox Telecommunication Review",
ADDRESS="Budapest, Hunagary",
VOLUME=2,
PAGES="1-12",
NOTE="Paper presented at ITC-8, Melbourne 1976",
YEAR=1977,
KEYWORDS="Telephony; traffic engineering; overload control",
}

@ARTICLE{Hala77:Diffusion,
AUTHOR="B. Halachmi and William R. Franta",
TITLE="A Diffusion Approximate Solution to the G/G/k Queueing System",
JOURNAL="Computer \& Operations Research",
VOLUME=4,
PAGES="37-46",
YEAR=1977,
KEYWORDS="Queueing System; G/G/N; Diffusion Approximation;
approximation",
}

@ARTICLE{High77:Role,
AUTHOR="H. J. Highland",
TITLE="Role of simulation in Computer Performance Measurement and
Evaluation",
JOURNAL="Performance Modelling and Prediction. Infotech State of the Art
Report",
PAGES="193-219",
YEAR=1977,
KEYWORDS="Simulation; Performance Evaluation; Survey",
}

@ARTICLE{John7701:Efficient,
AUTHOR="D. B. Johnson",
TITLE="Efficient Algorithms for Shortest Paths in Sparse Networks",
JOURNAL=jacm,
VOLUME=24,
NUMBER=1,
PAGES="1-13",
YEAR=1977,
KEYWORDS="Routing; shortest path",
}

@ARTICLE{Kope77:Relation,
AUTHOR="K. Koperniczky",
TITLE="Survey of the Man-Machine Relation in Telephone-Service",
JOURNAL="Budavox Telecommunication Review",
ADDRESS="H",
PAGES="26-28",
YEAR=1977,
KEYWORDS="Man-machine interaction",
}

@ARTICLE{Kouv77:Mathematical,
AUTHOR="D. D. Kouvatsos",
TITLE="Mathematical Methods for the Modular Design of Computer Systems",
JOURNAL="Computers and Operations Research",
VOLUME=4,
PAGES="55-63",
YEAR=1977,
KEYWORDS="Computer system; design",
}

@ARTICLE{Lam7702:Continuous,
AUTHOR="C. F. Lam",
TITLE="Continuous Simulation of a Complex Queueing System",
JOURNAL="Simulation",
VOLUME=29,
NUMBER=2,
PAGES="42-48",
YEAR=1977,
KEYWORDS="Simulation; queueing system",
}

@ARTICLE{Lave77:Variance,
AUTHOR="S. S. Lavenberg and T. L. Moeller and Peter D. Welch",
TITLE="Variance Reduction in the simulation of Queueing Networks",
JOURNAL="Simulation",
PAGES=4,
YEAR=1977,
KEYWORDS="Simulation; variance reduction",
ABSTRACT="This paper presents an application of control variables to the
simulation of a queueing network model of a multiprogrammed computer
system. The control variables proposed and investigated summarize the
effects of both the service time and routing random variables which
drive the simulation. Empirical studies are described which estimate the
variance reduction achievable and the validity of the resulting
confidence interva",
}

@ARTICLE{Lips7703:Applications,
AUTHOR="L. Lipsky and J. D. Church",
TITLE="Applications of a Queueing Network Model for a Computer System",
JOURNAL=acmcs,
VOLUME=9,
NUMBER=3,
PAGES="205-221",
YEAR=1977,
KEYWORDS="Queueing network",
}

@ARTICLE{Livn77:Recursive,
AUTHOR="H. Livni and Y. Bar-Ness",
TITLE="Recursive Algorithm for Traffic Distribution Calculation for
Certain Unreliable Telephone Exchanges",
JOURNAL=ieeer,
VOLUME="R-26",
NUMBER=1,
PAGES="61-62",
YEAR=1977,
KEYWORDS="Erlang distribution; blocking; algorithm; telephony; recursive
algorithm; available telephone trunks; maintenance",
ABSTRACT="One often wishes to calculate the probability function of the
number of available trunks for service in a full-availability, blocking
telephone exchange, with unreliable trunks.  A recursive algorithm for
calculating this function is presented.  It takes about 1/40 computation
time (when the exchange has 50 trunks) than does the brute force method
of calculation",
}

@ARTICLE{Mats7702:Multichannel,
AUTHOR="M. Matsui and J. Fukuta",
TITLE="On a Multichannel Queueing System with Ordered Entry and
Heterogeneous Servers",
JOURNAL="AIEE Transactions",
VOLUME=9,
NUMBER=2,
PAGES="209-214",
YEAR=1977,
KEYWORDS="Queueing system; multiserver",
}

@ARTICLE{Ndor77:Efficiency,
AUTHOR="L. Nádor",
TITLE="Efficiency and Network Management of the Automatic Telephone
Network",
JOURNAL="Budavox Telecommunication Review",
ADDRESS="H",
VOLUME=4,
PAGES="29-35",
YEAR=1977,
KEYWORDS="Telephony; network management",
}

@TECHREPORT{Neut77:Mythology,
AUTHOR="M. F. Neuts",
TITLE="The Mythology of Steady-State",
INSTITUTION="Department of Statistics and Computer Science, Univ. of
Delaware",
PAGES=11,
YEAR=1977,
KEYWORDS="Queueing theory",
}

@ARTICLE{Page7701:Approximations,
AUTHOR="E. S. Page",
TITLE="Approximations to the Cumulative Normal Function and Its Inverse
for Use on a Pocket Calculator",
JOURNAL=as,
VOLUME=26,
NUMBER=1,
PAGES="75-76",
YEAR=1977,
KEYWORDS="Algorithm",
}

@ARTICLE{Pau7701:Analyse,
AUTHOR="L. F. Pau",
TITLE="Analyse Continue des Fluctuation d'un Paramètre de
Fonctionnement: Application au Diagnostic Automatisé des changements de
Régime d'une Machine",
JOURNAL=rairo,
ADDRESS="France",
VOLUME=11,
NUMBER=1,
PAGES="5-15",
YEAR=1977,
LANGUAGE="French",
KEYWORDS="Reliability",
}

@TECHREPORT{Peir77:Precision,
AUTHOR="L. Peiram",
TITLE="Precision vid Trafikstyrkemätninger. Sammenfattning",
TYPE="Internal Report",
INSTITUTION="L M Ericsson AB",
ADDRESS="Stockholm, Sweden",
NUMBER="Um 7045",
PAGES=24,
YEAR=1977,
LANGUAGE="Swedish",
KEYWORDS="traffic measurement",
}

@TECHREPORT{Peir77:Av,
AUTHOR="L. Peiram",
TITLE="Analys av Beläggningstider (Holbæk)",
TYPE="Internal Report",
INSTITUTION="L M Ericsson AB",
ADDRESS="Sweden",
NUMBER="Um 7002",
PAGES=15,
YEAR=1977,
LANGUAGE="Swedish",
KEYWORDS="Traffic measurement",
}

@TECHREPORT{Peir77:Residual,
AUTHOR="L. Peiram",
TITLE="A Residual-Life Problem with Applications",
TYPE="Internal Report",
INSTITUTION="L M Ericsson AB",
ADDRESS="Stockholm, Sweden",
NUMBER="Um 7025",
PAGES=15,
YEAR=1977,
KEYWORDS="Queueing theory",
}

@TECHREPORT{Peir77:Kommentarer,
AUTHOR="L. Peiram",
TITLE="Kommentarer til Iversens {ITC-8} Bidrag: 312: On General Point
Processes in Teletraffic Theory with Applications to Measurements and
Simulations",
TYPE="Internal Report",
INSTITUTION="L M Ericsson AB",
ADDRESS="Stockholm, Sweden",
NUMBER="Um 7031",
PAGES=6,
YEAR=1977,
LANGUAGE="Swedish",
KEYWORDS="Traffic measurement",
}

@ARTICLE{Scha7701:Insensitivity,
AUTHOR="R. A. Schassberger",
TITLE="Insensitivity of Steady-State Distributions of Generalized
Semi-Markov Processes",
JOURNAL="The Annals of Probability",
VOLUME=5,
NUMBER=1,
PAGES="87-99",
YEAR=1977,
KEYWORDS="Semi Markov process",
}

@TECHREPORT{Sole77:Laguerre,
AUTHOR="R. R. Solem",
TITLE="Laguerre-Polynomene og Deres Anvendelse ved Losning av
K-Teoretiske Problemer",
INSTITUTION="Televerkets Forskningsinstitutt (TF)",
ADDRESS="Kjeller, Norway",
NUMBER=20,
PAGES=26,
YEAR=1977,
LANGUAGE="Norwegian",
KEYWORDS="queueing theory",
}

@TECHREPORT{Sole77:En,
AUTHOR="R. R. Solem",
TITLE="En Hyper-Normal Sannsynlighetsfordeling",
INSTITUTION="Televerkets Forskningsinstitutt (TF)",
ADDRESS="Kjeller, Norway",
NUMBER="18/77",
PAGES=7,
YEAR=1977,
LANGUAGE="Norwegian",
KEYWORDS="Arrival process",
}

@ARTICLE{Spyr77:Fast,
AUTHOR="N. Spyratos and A. Bowen",
TITLE="A Fast Algorithm for Reliability Calculations in Sparse
Networks",
JOURNAL=networks,
VOLUME=7,
PAGES="227-246",
YEAR=1977,
KEYWORDS="Reliability",
}

@TECHREPORT{Stec77:Optimal,
AUTHOR="K. E. Stecke and J. J. Solberg",
TITLE="The Optimal Planning of Computerized Manufacturing Systems -
Scheduling of Operations in a Computerized Manufacturing System",
INSTITUTION="School of Industrial Engineering, Purdue University",
ADDRESS="West Lafayette, Indiana",
PAGES=113,
YEAR=1977,
KEYWORDS="Manufacturing system",
}

@TECHREPORT{Sven77:Dansk,
AUTHOR="H. Svendsen",
TITLE="Dansk Terminologi for Datakommunikation",
INSTITUTION="Post- og Telegrafvæsenet",
ADDRESS="Copenhagen, Denmark",
PAGES=9,
YEAR=1977,
LANGUAGE="Danish",
KEYWORDS="Survey",
}

@ARTICLE{Taji7707:Correctness,
AUTHOR="W. D. Tajibnapis",
TITLE="A Correctness Proof of a Topology Information Maintenance
Protocol for a Distributed Computer network",
JOURNAL=cacm,
VOLUME=20,
NUMBER=7,
PAGES="477-485",
YEAR=1977,
KEYWORDS="Protocol verification",
}

@ARTICLE{Toml77:Teletraffic,
AUTHOR="P. N. Tomlinson and C. W. Chia",
TITLE="Teletraffic Aspects of Digital Switching",
JOURNAL=poeej,
ADDRESS="Great Britain",
PAGES="102-107",
YEAR=1977,
KEYWORDS="Traffic engineering; SPC",
}

@ARTICLE{Wall7704:Overflow,
AUTHOR="J. F. E. Wallin",
TITLE="Overflow Traffic from the Viewpoint of Renewal Theory",
JOURNAL="Statistica neerlandica",
ADDRESS="Netherlands",
VOLUME=31,
NUMBER=4,
PAGES="171-178",
YEAR=1977,
KEYWORDS="Overflow traffic",
ABSTRACT="In this paper some known formulae concerning overflow traffic
have been derived in a simpler way than is generally done in literature,
i.e. by using simple results obtained from renewal theory. After the
model has been introduced, the distribution of intervals between
overflows is calculated by means of a recurrence relation. A
generalization of Erlang's formula for the call congestion follows
almost immediately. The last",
}

@TECHREPORT{Wall77:Calculation,
AUTHOR="B. Wallström",
TITLE="Calculation of Moments of Overflow Traffics Behind a Server Group
Offered Two Interrupted Poisson Traffics. 1. {IPP's} with Three Traffic
Descriptive Parameters",
INSTITUTION="University of Lund, Department of Telecommunications",
ADDRESS="Lund, Sweden",
NUMBER="10-04",
PAGES=18,
YEAR=1977,
KEYWORDS="Ipp",
}

@TECHREPORT{Wall77:Interrupted,
AUTHOR="B. Wallström",
TITLE="Interrupted Poisson Processes",
INSTITUTION="University of Lund, Department of Telecommunications",
ADDRESS="Lund, Sweden",
NUMBER="12-12",
PAGES=12,
YEAR=1977,
KEYWORDS="Ipp",
}

@INCOLLECTION{Wolf77:Effect,
AUTHOR="R. W. Wolff",
TITLE="The Effect of Service Time Regularity on System Performance",
BOOKTITLE="Computer Performance",
EDITOR="K. M. Chandy and M. Reiser",
PUBLISHER="North Holland",
PAGES="297-304",
YEAR=1977,
KEYWORDS="sensitivity analysis",
ABSTRACT="Conventional wisdom holds that the more regular the arrival
process and/or service times are, the better system performance will be.
Examples of contrary behavior are presented in three cases: loss
systems, processor sharing, and multi-channel queues without losses. In
each case, it is shown that making service more regular can make system
performance worse.",
}

@ARTICLE{Eklu77:Channel,
AUTHOR="B. Eklundh",
TITLE="Channel Utilization and Blocking Probability in a Cellular Mobile
Telephone System with Directed Retry",
JOURNAL=ieeecom,
VOLUME="COM",
NUMBER=2,
PAGES="329-337",
YEAR=1977,
KEYWORDS="Mat",
ABSTRACT="directed retry: capacity dependant base station selection",
}

@PROCEEDINGS{Chan77:Computer,
TITLE="Computer performance: Proc. International Symposium on Computer
Performance Modelling",
EDITOR="K. M. Chandy and M. Reiser",
ORGANIZATION="IFIP WG 7.3",
PUBLISHER="North Holland",
ADDRESS="Amsterdam, Holland",
PAGES="1-564",
YEAR=1977,
KEYWORDS="Measurement; queueing system; system evaluation; numerical
method; performance evaluation; model; communication network; network
flow; heuristics; fundamentals in statistics; special issue;
simulation",
ABSTRACT="Improving approximations of queueing network subsystems (K. C.
Sevcik, et al.); Measured data and performance analysis (W. Bux, et
al.); Dynamic load in distributed systems (Y. C. Chow, et al.);
Throughput in locally balanced models (A. S. Noetzel); numerical
solution of queueing problems (A. Brandwajn); Scheduling strategies for
interactive computer systems (Y. Bard); Analytical models for
performance prediction (M. A. Diethelm)",
}

@ARTICLE{Lazo77:Use,
AUTHOR="E. D. Lazowska",
TITLE="The Use of Percentiles in Modeling {CPU} Service Time
Distributions",
JOURNAL=compperf,
ADDRESS="Netherlands",
PAGES="53-66",
YEAR=1977,
KEYWORDS="Performance evaluation",
}

@ARTICLE{Gall7701:Minimum,
AUTHOR="Robert Gallager",
TITLE="A Minimum Delay Routing Algorithm Using Distributed Computation",
JOURNAL=ieeecom,
VOLUME="COM-25",
NUMBER=1,
PAGES="73-85",
MONTH=jan,
YEAR=1977,
KEYWORDS="routing",
}

@ARTICLE{Koba7701:Queueing,
AUTHOR="H. Kobayashi and A. G. Konheim",
TITLE="Queueing Models for Computer Communications System Analysis",
JOURNAL=ieeecom,
VOLUME="COM-25",
NUMBER=1,
PAGES="2-29",
MONTH=jan,
YEAR=1977,
KEYWORDS="queueing theory",
ABSTRACT="\ldots A unified treatment of buffer storage overflow problems
will be discussed as an application example, in which we call attention
to the analogy between buffer behavior and waiting time in the $GI/G/1$
queue. Another application deals with the analysis of various
multiplexing techniques and network configurations. An extensive
reference list of the subject fields is also provided.",
ANNOTE="Continuous and discrete-time analysis of both single queues and
queueing networks. Discusses discrete-time analog of common
continuous-time systems. Bounds on loss probability in discrete-time
system with general batch arrivals and batch service.",
}

@ARTICLE{Sega7701:Modeling,
AUTHOR="A. Segall",
TITLE="The Modeling of Adaptive Routing in Data Communication Networks",
JOURNAL=ieeecom,
VOLUME="COM-25",
NUMBER=1,
PAGES="85-95",
MONTH=jan,
YEAR=1977,
ANNOTE="Routing.",
}

@ARTICLE{Wein7701:Echo,
AUTHOR="Steve Weinstein",
TITLE="Echo cancellation in the telephone network",
JOURNAL=ieeecm,
VOLUME=15,
NUMBER=1,
PAGES="9-15",
MONTH=jan,
YEAR=1977,
KEYWORDS="speech transmission; echo cancellation",
ABSTRACT="Echoes attenuated 40 dB may still be objectionable. The hybrid
coupler has an attenuation of only 15 dB from input to output port. Echo
suppressors, in use since the late 1920's, work by disconnecting the far
party when the near party is talking. They are successful on lines with
less than about 100 ms round-trip delay. An echo canceller simulates the
echo channel through the hybrid, which depends on the 2-wire circuit
connected to the hybrid. The use of an adaptive transversal filter was
first proposed in 1966. The weights of the filter are update to minimize
the mean squared error. Weight adaptation is inhibited during double
talking. A center clipper removes small signal amplitudes.",
}

@ARTICLE{Suns7701:Source,
AUTHOR="C. A. Sunshine",
TITLE="Source routing in computer networks",
JOURNAL=ccr,
VOLUME=7,
NUMBER=1,
PAGES="29-33",
MONTH=jan,
YEAR=1977,
KEYWORDS="routing; source routing; internetworking",
ABSTRACT="As plans for network interconnection develop, the problems of
internet routing and addressing become increasingly important. In one
popular model of internet addressing, a hierarchical form of network and
local (within network) address is used, with the source providing only
the destination address while the intermediate network(s) and/or
gateways between networks take care of routing packets to that
destination by various paths. This and related techniques requiring some
form of routing table and knowledge at intermediate nodes are more fully
discussed elsewhere. This paper considers another technique for internet
routing in which the source of internet packets specifies the complete
internet route. When the entire route accompanies each internet packet,
no routing decisions or tables are required at gateways, but the packet
format is complicated and overhead increases. In particular, the packet
must carry a varying number of intermediate addresses depending on the
path and destination. This overhead may be reduced by setting up a fixed
route with connection tables when a connection is established.",
}

@TECHREPORT{Wolf7701:Modellierungssystem,
AUTHOR="B. Wolfinger",
TITLE="Modellierungssystem zur globalen Simulation des
{HMI-Rechnernetzes}",
INSTITUTION="Institut für Datenverarbeitung in der Technik",
ADDRESS="Karlsruhe, Germany",
PAGES=141,
MONTH=jan,
YEAR=1977,
LANGUAGE="German",
REFERENCES=9,
KEYWORDS="model; simulation; SIMULA; communication network",
ANNOTE="Als wesentlicher Teil der im Rahmen eines Kooperationsvertrags
zwischen der GFK (IDT) und dem Hahn-Meitner-Institut durchzuführenden
Arbeiten waren die beiden, in den Berichten Nr. IDT/115/04
dokumentierten, modellierungssysteme zu einem Gesamtmodell zu
integrieren. Dabei entstand das im vorliegenden Bericht präsentierte
Modellierungssystem zur umfassenden Analyse sämtlicher Ebenen der
Protokollhierarchie des HMI-rechnernetzes.",
}

@ARTICLE{Ng7701:Multiaccess,
AUTHOR="S. Ng and J. W. Mark",
TITLE="A multiaccess model packet switching with a satellite having some
processing capability",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="128-134",
MONTH=jan,
YEAR=1977,
REFERENCES=13,
KEYWORDS="Satellite radio; ALOHA; model; packet switching; multiple
access",
ABSTRACT="A multiaccess model for packet switching with a satellite
having the capability of interrogating the uplink header and creating
the downlink header is proposed. The satellite broadcasts slot
assignments, based on the users' reported queue status, to the users for
transmission in the next frame. With the protocols being done at both
the earth stations and at the satellite, the proposed multiaccess model
avoids collisions that are prevalent",
}

@ARTICLE{Gavi7701:Computer,
AUTHOR="Bezalel X Gavish and A. G. Konheim",
TITLE="Computer communication via satellites - a queuing model",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="140-147",
MONTH=jan,
YEAR=1977,
}

@ARTICLE{Kahn7701:Organization,
AUTHOR="R. E. Kahn",
TITLE="The organization of computer resources into a packet radio
network",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="169-178",
MONTH=jan,
YEAR=1977,
}

@ARTICLE{Klei7701:Throughput,
AUTHOR="L. Kleinrock and H. Opderbeck",
TITLE="Throughput in the {ARPANET-protocols} and measurements",
JOURNAL=ieeecom,
VOLUME="COM-25",
NUMBER=1,
PAGES="95-104",
MONTH=jan,
YEAR=1977,
}

@ARTICLE{Anon7701:Notes,
AUTHOR="Anonymous",
TITLE="Notes on the Meeting of {IFIP} {WG6.1}",
JOURNAL=ccr,
VOLUME=7,
NUMBER=1,
MONTH=jan,
YEAR=1977,
}

@ARTICLE{Pouz7701:Restructuring,
AUTHOR="L. Pouzin",
TITLE="A Restructuring of {X.25} into {HDLC}",
JOURNAL=ccr,
VOLUME=7,
NUMBER=1,
MONTH=jan,
YEAR=1977,
}

@TECHREPORT{Stid7701:GI,
AUTHOR="S. Stidham",
TITLE="The {GI/M/1} Queue with Controlled Arrivals",
TYPE="Draft",
INSTITUTION="IMSOR, Technical University of Denmark",
ADDRESS="Lyngby, Denmark",
PAGES=26,
MONTH=jan,
YEAR=1977,
KEYWORDS="Gi/m/1",
}

@MASTERSTHESIS{Bell7702:Estimation,
AUTHOR="Martin Glen Bello",
TITLE="The Estimation of Delay Gradients for Purposes of Routing in
Data-Communication Networks",
SCHOOL="Electronic Systems Laboratory, Massachusetts Institute of
Technology",
ADDRESS="Cambridge, Massachusetts",
MONTH=feb,
YEAR=1977,
KEYWORDS="Routing",
}

@ARTICLE{Kucz7702:Method,
AUTHOR="Anatol Kuczura and Dinesh Bajaj",
TITLE="A Method of Moments for the Analysis of a Switched Communication
Network's Performance",
JOURNAL=ieeecom,
VOLUME="COM-25",
NUMBER=2,
PAGES="185-193",
MONTH=feb,
YEAR=1977,
KEYWORDS="queueing theory; loss system",
ABSTRACT="The proposed method of moments is an approximation scheme
consisting of a simple iteration algorithm which converges to the
network's point-to-point blocking probabilities. The following are the
key steps. First, the total traffic stream (obtained by combining the
individually offered overflow and Poissonian streams under the
assumption of independence) offered to any trunk (channel) group in the
network is approximated by a renewal process of a specific type. The
total overflow from the trunk group is obtained using the generalized
Erlang loss function. After suitably apportioning the lost load among
the individually offered streams, each stream's blocking on the trunk
group is computed. Finally, a point-to-point probability linear graph is
constructed from the alternate routing scheme and the point-to-point
blocking is computed assuming independent blocking in the links.
Numerical results are presented for a simple three-node network with
Poissonian point-to-point demand and comparison is made between the
three-moment methods and simulation. The results indicate that the
three-moment method is sufficiently accurate for engineering purposes.",
}

@TECHREPORT{Wolf7702:Modellierungssystem,
AUTHOR="B. Wolfinger and  Marker",
TITLE="Modellierungssystem für die Transportebene des
{HMI-Rechnernetzes} (interaktive Version) - {MOTIV}",
INSTITUTION="Institut für Datenverarbeitung in der Technik",
ADDRESS="Karlsruhe, Germany",
PAGES="1-78",
MONTH=feb,
YEAR=1977,
LANGUAGE="German",
REFERENCES=7,
KEYWORDS="Model; simulation; simula; graphics; interactive mode",
ABSTRACT="Der vorliegende Bericht gibt eine Übersicht über eine
interaktive Version des in Bericht Nr.  Idt/115/02 vorgestellten
Modellierungssystems fuer die Transportebene des HMI-Rechnernetzes.
Dieses Modellierungssystem ermöglicht sowohl ein steuerndes eingreifen
in die simulation während eines experimentlaufs als auch die graphische
AUsgabe von experimentresultaten am Bildschirm.",
}

@BOOK{Scho7702:Decentralized,
AUTHOR="Frederik Carel Schoute",
TITLE="Decentralized Control in Computer Communication",
INSTITUTION="Harvard University",
PUBLISHER="Ph.D. Thesis",
ADDRESS="Cambridge, Massachusetts",
MONTH=feb,
YEAR=1977,
KEYWORDS="corridor optimal control",
}

@ARTICLE{Suns7702:Efficiency,
AUTHOR="C. A. Sunshine",
TITLE="Efficiency of Interprocess Communication Protocols for Computer
Networks",
JOURNAL=ieeecom,
PAGES="287-293",
MONTH=feb,
YEAR=1977,
KEYWORDS="Protocol engineering",
}

@ARTICLE{Dick7703:Lowly,
AUTHOR="G. M. Dick",
TITLE="The Lowly Modem",
JOURNAL=datamation,
VOLUME=23,
PAGES="69-73",
NOTE="also in \cite{Abra80:Computer}",
MONTH=mar,
YEAR=1977,
}

@INPROCEEDINGS{Benn7703:Numerical,
AUTHOR="A. W. Bennett and R. Ed. Vichnevetsky",
TITLE="Numerical methods for differential equations and simulation",
BOOKTITLE="IMACS (IACA)",
ADDRESS="Blacksburg, Virginia",
PAGES="1-222",
MONTH=mar,
YEAR=1977,
KEYWORDS="Numerical method; differential equation; simulation;
optimization; special issue",
ANNOTE="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{Chan7704:Product,
AUTHOR="K. M. Chandy and John H. Howard and Donald F. Towsley",
TITLE="Product Form and Local Balance in Queueing Networks",
JOURNAL=jacm,
VOLUME=24,
NUMBER=2,
PAGES="250-263",
MONTH=apr,
YEAR=1977,
}

@ARTICLE{Spra7704:Simple,
AUTHOR="J. D. Spragins",
TITLE="Simple derivation of queuing formulas for loop systems",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="446-448",
MONTH=apr,
YEAR=1977,
}

@ARTICLE{Payn7704:Formalised,
AUTHOR="A. J. Payne",
TITLE="A Formalised Technique for Expressing Message Generators",
JOURNAL=ccr,
VOLUME=7,
NUMBER=2,
MONTH=apr,
YEAR=1977,
}

@ARTICLE{Anon7704:Augmented,
AUTHOR="Anonymous",
TITLE="Augmented {ASCII} Standard--Comments Solicited",
JOURNAL=ccr,
VOLUME=7,
NUMBER=2,
MONTH=apr,
YEAR=1977,
}

@ARTICLE{McQu7704:Graph,
AUTHOR="J. M. McQuillan",
TITLE="Graph Theory Applied to Optimal Connectivity in Computer
Networks",
JOURNAL=ccr,
VOLUME=7,
NUMBER=2,
MONTH=apr,
YEAR=1977,
}

@ARTICLE{Boda7704:Observations,
AUTHOR="H. Bodard and J. P. Guerineau and P. Le Gall and P. De Bussy",
TITLE="Observations Expérimentales de l'Écoulement du Trafic
Téléphonique dans un Autocommutateur {(CP} 400)",
JOURNAL="Commutation and Electronique",
NUMBER=57,
PAGES="57-67",
MONTH=apr,
YEAR=1977,
KEYWORDS="Traffic measurement; measurement tool",
}

@ARTICLE{Floc7704:Observation,
AUTHOR="F. Floc'h and C. Penn and J. W. Roberts",
TITLE="Observation du Comportement des Abonnés L'équipement Octopus
{II}",
JOURNAL="Commutation and Electronique",
ADDRESS="France",
NUMBER=57,
PAGES="55-66",
MONTH=apr,
YEAR=1977,
LANGUAGE="French",
KEYWORDS="Measurement; Traffic Measurement; Resource Utilization; PABX",
}

@ARTICLE{Gold7705:Earliest,
AUTHOR="Henry M. Goldberg",
TITLE="Analysis of the Earliest Due Data Scheduling Rule in Queueing
Systems",
JOURNAL=mor,
VOLUME=2,
NUMBER=2,
PAGES="145-154",
MONTH=may,
YEAR=1977,
KEYWORDS="queueing theory",
ANNOTE="Single-server system, preemptive and non-preemptive.",
}

@ARTICLE{Turo7705:Meeting,
AUTHOR="Murray Turoff and Starr Roxanne Hiltz",
TITLE="Meeting Through Your Computer",
JOURNAL=ieeespec,
VOLUME=14,
PAGES="58-64",
MONTH=may,
YEAR=1977,
KEYWORDS="computer conferencing",
}

@ARTICLE{Turn7705:Guidelines,
AUTHOR="M. A. Turnquist and J. M. Sussman",
TITLE="Towards guidelines for designing experiments in queuing
simulation",
JOURNAL="Simulation",
VOLUME=28,
NUMBER=5,
PAGES="137-144",
MONTH=may,
YEAR=1977,
KEYWORDS="Simulation; statistical technique",
}

@MASTERSTHESIS{Luni7705:Simple,
AUTHOR="Allen W. Luniewski",
TITLE="A Simple and Flexible System Initialization Mechanism",
SCHOOL="Massachusetts Institute of Technology",
ADDRESS="Cambridge, Massachusetts",
MONTH=may,
YEAR=1977,
}

@ARTICLE{Cerf7705:Future,
AUTHOR="V. G. Cerf and A. Currun",
TITLE="The Future of Computer Communications",
JOURNAL=datamation,
VOLUME=23,
PAGES="105-114",
NOTE="also in \cite{Abra80:Computer}",
MONTH=may,
YEAR=1977,
}

@INPROCEEDINGS{Cott7705:Computer,
AUTHOR="I. W. Cotton",
TITLE="Computer Network Interconnection",
BOOKTITLE="2nd Berkeley Workshop on Distributed Data Management and
Computer Networks",
PAGES="3-18",
NOTE="also in \cite{Abra80:Computer}",
MONTH=may,
YEAR=1977,
}

@ARTICLE{Mann7705:Homogeneous,
AUTHOR="E. Manning and R. W. Peebles",
TITLE="A Homogeneous Network for Data-Sharing Communications",
JOURNAL=cn,
PAGES="211-224",
NOTE="also in \cite{Thur81:Tutorial}",
MONTH=may,
YEAR=1977,
}

@INPROCEEDINGS{Forg7706:Efficient,
AUTHOR="James W. Forgie and A. G. Nemeth",
TITLE="An efficient packetized voice/data network using statistical flow
control",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
PAGES="38.2-44-38.2-48",
MONTH=jun,
YEAR=1977,
KEYWORDS="packet voice; integrated services",
ABSTRACT="This paper describes a packetized virtual circuit (PVC) scheme
for integrating voice and data traffic in a communications system. A PVC
network combines features of both circuit and packet switched networks.
Based on experience with packet speech transmission, it handles voice
and data in an essentially uniform fashion. Short fixed length packets
with abbreviated headers to achieve usable levels of efficiency are
transmitted along routes established when virtual connections are set up
between subscribers. The assignment of connections to links is done in
such a way as to keep the probability of internal queue overflows to
values which are small so that such overflows may be handled on an
exception basis. This mechanism together with limits on peak and average
data rates at the periphery constitute a statistical flow control policy
which is a new and untested aspect of the PVC concept. To test this
policy a model for a PVC communication link has been developed and
subjected to a combination of computer simulation and queueing analysis.
The simulation uses a statistical model for talkspurt and silence
durations to provide a voice load for the link. Assuming that voice
traffic has priority on link usage, and that data packets are sent only
when there are no voice packets waiting, measured values from the voice
load simulation can be used to estimate the distribution for service
times on the residual channel. Assuming Poisson arrivals for data
packets an M/G/1 queueing model may be used to estimate waiting times
and buffer requirements for the data traffic. Results indicate voice
delay characteristics for a PVC net comparable to those expected in a
TDMA circuit switched net but with somewhat superior traffic handling
capability because the PVC net takes advantage of the on-off statistics
of the voice traffic. High levels of link utilization are predicted with
modest requirements for buffering of the data traffic. At the same time
most of the desirable characteristics of packet switching for data users
have been retained. The success of the PVC concept in the important area
of communication line efficiency suggests further work to explore its
effectiveness relative to other criteria for the evaluation of proposals
for integrated network design.",
ANNOTE="ATM-like concept of small, fixed length (128 bits) packet",
}

@INPROCEEDINGS{Gitm7706:Integrated,
AUTHOR="I. Gitman and H. Frank and B. Occhiogrosso and W. Hsieh",
TITLE="Issues in integrated network design",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
PAGES="38.1-36-38.1-43",
MONTH=jun,
YEAR=1977,
KEYWORDS="integrated services",
ABSTRACT="Recent advances in voice digitization techniques, the
successful demonstration of the packet switching concept for data
communications, the relative inefficiency of conventional switching
techniques for diverse traffic applications, and the advances in digital
switching and transmission technologies, have focused attention on
integrated communications networks, and has given rise to new problem
areas in communications network design. The issues, tradeoffs, and
problem areas in the analysis and design of integrated communications
networks are the subject of this paper.",
}

@INPROCEEDINGS{Saue7706:RESQ,
AUTHOR="C. H. Sauer and M. Reiser and E. A. MacNair",
TITLE="{RESQ} -- a package for solution of generalized queueing
networks.",
BOOKTITLE=ncc,
EDITOR="R. R. Korfhage",
ADDRESS="Dallas",
PAGES="977-986",
MONTH=jun,
YEAR=1977,
KEYWORDS="Computer tool; performance evaluation",
}

@ARTICLE{Schm7706:Versatile,
AUTHOR="B. W. Schmeiser and S. J. Deutsch",
TITLE="A versatile four parameter family of probability distributions
suitable for simulation",
JOURNAL="AIIE Transactions",
VOLUME=9,
NUMBER=2,
PAGES="176-182",
MONTH=jun,
YEAR=1977,
KEYWORDS="random variate generation",
}

@ARTICLE{Vauc7706:Distribution,
AUTHOR="J. G. Vaucher",
TITLE="On the distribution of event times for the notices in a
simulation event list",
JOURNAL=infor,
VOLUME=15,
NUMBER=2,
PAGES="171-182",
MONTH=jun,
YEAR=1977,
KEYWORDS="Simulation; event set",
}

@TECHREPORT{Clar7706:Ancillary,
AUTHOR="D. D. Clark",
TITLE="Ancillary Reports: Kernel Design Project",
INSTITUTION="Massachusetts Institute of Technology",
ADDRESS="Cambridge, Massachusetts",
NUMBER="TM-87",
MONTH=jun,
YEAR=1977,
}

@TECHREPORT{Schr7706:Final,
AUTHOR="M. D. Schroeder and D. D. Clark and J. H. Saltzer and D. H.
Wells",
TITLE="Final Report of the Multics Kernel Design Project",
INSTITUTION="Massachusetts Institute of Technology",
ADDRESS="Cambridge, Massachusetts",
NUMBER="LCS-TR-196",
MONTH=jun,
YEAR=1977,
}

@ARTICLE{Smit7706:Database,
AUTHOR="Jonathan Smith and D. G. Smith",
TITLE="Database Abstractions: Aggregation and Generalization",
JOURNAL=tods,
VOLUME=2,
NUMBER=2,
PAGES="105-133",
MONTH=jun,
YEAR=1977,
}

@ARTICLE{Ferg7707:Approximate,
AUTHOR="M. J. Ferguson",
TITLE="An approximate analysis of delay for fixed and variable length
packets in an isolated {ALOHA} channel",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="644-653",
MONTH=jul,
YEAR=1977,
}

@ARTICLE{Barb7707:Role,
AUTHOR="D. Barber",
TITLE="The Role and Nature of a Virtual Terminal",
JOURNAL=ccr,
VOLUME=7,
NUMBER=3,
MONTH=jul,
YEAR=1977,
}

@ARTICLE{Anon7707:Proposal,
AUTHOR="Anonymous",
TITLE="Proposal for a Scroll Mode Virtual Terminal",
JOURNAL=ccr,
VOLUME=7,
NUMBER=3,
MONTH=jul,
YEAR=1977,
}

@ARTICLE{Dunk7707:Symmetry,
AUTHOR="A. Dunki and P. Schicker",
TITLE="Symmetry and Attention Handling: Comments on a Virtual Terminal",
JOURNAL=ccr,
VOLUME=7,
NUMBER=3,
MONTH=jul,
YEAR=1977,
}

@ARTICLE{Barb7707:Virtual,
AUTHOR="D. Barber",
TITLE="A Virtual Terminal Protocol Based on the Use of Zones",
JOURNAL=ccr,
VOLUME=7,
NUMBER=3,
MONTH=jul,
YEAR=1977,
}

@ARTICLE{Day7707:RJE,
AUTHOR="John Day and Gary R. Grossman",
TITLE="An {RJE} Protocol for a Resource Sharing Network",
JOURNAL=ccr,
VOLUME=7,
NUMBER=3,
MONTH=jul,
YEAR=1977,
}

@ARTICLE{Anon7707:Current,
AUTHOR="Anonymous",
TITLE="The Current Status of Data Communications in Japan",
JOURNAL=ccr,
VOLUME=7,
NUMBER=3,
MONTH=jul,
YEAR=1977,
}

@ARTICLE{Gavi7708:Markovian,
AUTHOR="Bezalel X Gavish and P. Schweitzer",
TITLE="The Markovian Queue with Bounded Waiting Time",
JOURNAL=ms,
VOLUME=23,
NUMBER=12,
PAGES="1349-1357",
MONTH=aug,
YEAR=1977,
KEYWORDS="queueing theory",
}

@ARTICLE{Hugg7708:Speech,
AUTHOR="A. W. F. Huggins and R. Viswanathan and J. Makhoul",
TITLE="Speech-quality testing of some variable-frame-rate {(VFR)}
linear-predictive {(LPC)} vocoders",
JOURNAL=jasa,
VOLUME=62,
NUMBER=2,
PAGES="430-434",
MONTH=aug,
YEAR=1977,
KEYWORDS="speech coding; VBR; variable-rate codec; subjective
evaluation",
ABSTRACT="VFR transmission of LPC coefficients is a technique developed
to reduce the average transmission rate without appreciable loss of
quality. The technique transmits parameters at a variable rate in
accordance with the changing characteristics of the speech signal. In
order to assess the effectiveness of VFR transmission, we performed an
experiment to compare it with two other methods for reducing the bit
rate: (a) reducing the number of poles, and (b) increasing the
quantization step size of the LPC coefficients (log-area ratios).
Thirty-two stimulus sentences were prepared by passing four utterances
(2 sentences by 2 speakers) through eight vocoder systems in a $2 \times
2 \times 2$ factorial design; two values were assigned to each of the
three parameters: average frame rate, number of poles, and quantization
step size. Eight listeners made seven-point category ratings of quality
degradation. The results of the experiment show that, of the three
methods studied, the VFR technique produced the highest quality at any
given transmission rate (or, equivalently, yielded the lowest bit rate
for a fixed level of speech quality.).",
}

@ARTICLE{McQu7708:ARPA,
AUTHOR="J. M. McQuillan and D. C. Walden",
TITLE="The {ARPA} network design decisions",
JOURNAL=cn,
VOLUME=1,
NUMBER=5,
PAGES="243-289",
MONTH=aug,
YEAR=1977,
KEYWORDS="ARPAnet; network architecture; IMP",
ABSTRACT="A number of key decisions made in the design of the ARPA
network over a five-year period serve as the context for an analysis of
the fundamental properties and requirements of packet-switching networks
and formulations of the fundamental criteria for evaluating network
performance. The decision described fall into the three major areas of
network equipment design, store-and-forward subnetwork system design,
and source-to-destination system design, and each decision is examined
in detail.",
}

@INPROCEEDINGS{Balb7708:Customer,
AUTHOR="G. Balbo and S. C. Bruell and H. D. Schwetman",
TITLE="Customer classes and closed network models -- a solution
technique",
BOOKTITLE="IFIP 7th World Computer Congress",
ADDRESS="Toronto",
PAGES="559-564",
MONTH=aug,
YEAR=1977,
KEYWORDS="Queueing network; product form; analysis",
}

@INPROCEEDINGS{John7708:Elliptically,
AUTHOR="M. E. Johnson and J. S. Ramberg",
TITLE="Elliptically symmetric distributions: Characterizations and
random variate generation",
BOOKTITLE="Annual Meeting of the American Statistical Association",
ADDRESS="Chicago",
PAGES="262-265",
MONTH=aug,
YEAR=1977,
KEYWORDS="random variate generation",
}

@INPROCEEDINGS{Krze7708:Multiclass,
AUTHOR="A. Krzesinski and S. Gerber and P. Teunissen",
TITLE="A multiclass network model of a multiprogramming timesharing
computer system",
BOOKTITLE="IFIP 7th World Computer Congress",
ADDRESS="Toronto",
PAGES="481-486",
MONTH=aug,
YEAR=1977,
KEYWORDS="Queueing network; analysis",
}

@INPROCEEDINGS{Sevc7708:Priority,
AUTHOR="K. C. Sevcik",
TITLE="Priority scheduling disciplines in queueing network models of
computer systems",
BOOKTITLE="IFIP 7th World Computer Congress",
ADDRESS="Toronto, Canada",
PAGES="565-570",
MONTH=aug,
YEAR=1977,
KEYWORDS="Queueing network; analysis",
}

@INPROCEEDINGS{Tadi7708:Rejection,
AUTHOR="P. R. Tadikamalla and M. E. Johnson",
TITLE="Rejection methods for sampling from the normal distribution",
BOOKTITLE="1st International Conference on Mathematical Modeling",
EDITOR="X. J. R.",
ADDRESS="St. Louis",
VOLUME=2,
PAGES="573-578",
MONTH=aug,
YEAR=1977,
KEYWORDS="random variate generation",
}

@INPROCEEDINGS{Porg7708:MIT,
AUTHOR="K. T. Porgan and D. P. Reed",
TITLE="The {MIT} Laboratory for computer science network",
BOOKTITLE="Report of a workshop on local area networking held at the
NBS",
PAGES="20-22",
MONTH=aug,
YEAR=1977,
}

@ARTICLE{Lisk7708:Abstraction,
AUTHOR="B. Liskov and A. Snyder and R. Atkinson and C. Schaffert",
TITLE="Abstraction Mechanisms in {CLU}",
JOURNAL=cacm,
VOLUME=20,
PAGES="564-576",
MONTH=aug,
YEAR=1977,
}

@ARTICLE{Wirt7708:Toward,
AUTHOR="Niklaus Wirth",
TITLE="Toward a discipline of real-time programming",
JOURNAL=cacm,
VOLUME=20,
NUMBER=8,
PAGES="577-583",
MONTH=aug,
YEAR=1977,
REFERENCES=6,
KEYWORDS="real-time systems; operating systems; multiprogramming;
real-time programming; process synchronization; processor sharing;
program validation; Modula",
ABSTRACT="Programming is divided into three major categories with
increasing complexity of reasoning in program validation: sequential
programming, multiprogramming, and real-time programming. By adhering to
a strict programming discipline and by using a suitable high-level
language molded after this discipline, the complexity of reasoning about
concurrency and execution time constraints may be drastically reduced.
This may be the only practical way to make real-time systems
analytically verifiable and ultimately reliable. A possible discipline
is outlined and expressed in terms of the language Modula.",
}

@ARTICLE{Rich7709:Buffer,
AUTHOR="Marc A. Rich and M. Schwartz",
TITLE="Buffer Sharing in Computer-Communication Network Nodes",
JOURNAL=ieeecom,
VOLUME="COM-25",
NUMBER=9,
PAGES="958-970",
MONTH=sep,
YEAR=1977,
KEYWORDS="queueing theory",
ABSTRACT="This paper discusses a technique of sharing extra storage
buffers among a number of nodes (for example concentrators) or among a
number of output lines in a single node (for example, in a message
switching center). Buffer sharing can be used to reduce the probability
that a message is blocked, while at the same time buffer storage cells
can be conserved. In addition, buffer sharing reduces sensitivity to
variations in traffic. Althought the improvement increases as the size
and complexity of the buffer sharing system increases, significant
improvement is possible even for relatively simple system. --- In
modeling these systems, a precise model would use data unit storage.
However, a simpler model using message unit storage is easier to
analyze. A linear relationship can be used for converting message
storage into data unit storage.",
}

@ARTICLE{Ross7709:Approaches,
AUTHOR="Myron J. Ross and Arthur C. Tabbot and John A. Waite",
TITLE="Design Approaches and Performance Criteria for Integrated
Voice/Data Switching",
JOURNAL=ieeeproc,
VOLUME=65,
NUMBER=9,
PAGES="1283-1295",
MONTH=sep,
YEAR=1977,
KEYWORDS="packet voice; integrated service",
ANNOTE="describes moving-boundary switching of two traffic classes:
delay sensitive and loss sensitive.",
}

@INPROCEEDINGS{Davi7709:Arpanet,
AUTHOR="J. Davidson and W. Hathaway and J. B. Postel and N. W. Mimno and
R. Thomas and D. C. Walden",
TITLE="The Arpanet {TELNET} protocol: its purpose, principles,
implementation, and impact on host operating system design",
BOOKTITLE="5th Data Communications Symposium",
ORGANIZATION="ACM, IEEE",
ADDRESS="Snowbird, Utah",
PAGES="4-10-4-18",
MONTH=sep,
YEAR=1977,
KEYWORDS="network applications; terminal emulation; Internet; operating
systems",
}

@INPROCEEDINGS{Ulug7709:Statistical,
AUTHOR="M. E. Ulug and J. G. Gruber",
TITLE="Statistical multiplexing of data and encoded voice in a
transparent intelligent network",
BOOKTITLE="5th Data Communications Symposium",
ORGANIZATION="ACM, IEEE",
ADDRESS="Snowbird, Utah",
PAGES="6-14-6-20",
MONTH=sep,
YEAR=1977,
KEYWORDS="packet voice; packet audio",
ABSTRACT="The paper describes the work done so far in the development of
a means of statistically multiplexing data and encoded voice in a
transparent and intelligent network call TI-NET. A review of previous
work in packetized voice transmission in a conventional packet switched
network (ARPAnet) has revealed problems related to large fixed and
variable transmission delays. These problems result in degradations in
speech qualify in the form of time scale distortion and gaps due to very
late or lost packets. The paper shows that TI-NET has various features
which counter the above problems, and thereby make it appear very
suitable for encoded voice transmission. The paper describes a software
implementation of a protocol for encoded voice transmission which takes
advantage of the 60 to 65 \% idle time in conversations (one way) so
that only active period in speech need to be transmitted; this is not
possible with present frame synchronous vocoders which transmit
continuously. \ldots",
ANNOTE="Multiuser packets transmitted every 5 ms, consisting of
minipackets.",
}

@INPROCEEDINGS{Cohe7709:Issues,
AUTHOR="Danny Cohen",
TITLE="Issues in Transnet Packetized Voice Communications",
BOOKTITLE="5th Data Communications Symposium",
ORGANIZATION="ACM, IEEE",
ADDRESS="Snowbird, Utah",
PAGES="6-10-6-13",
MONTH=sep,
YEAR=1977,
KEYWORDS="packet voice; playout synchronization; Internet; LPC; CVSD",
ABSTRACT="In recent years, very important progress was made in both
real-time digital computer communication and real-time digital voice
communication, due to the growing importance of geographically
distributed computation, the growing need for resource sharing, and the
need for secure voice communication.  The progress in digital voice
communication - mainly aimed at low data rate and high fidelity speech
communication - has led to various vocoding techniques such as LPC and
CVSD.  The progress in real-time computer communication -- which is
mainly aimed at low delays, high bandwidth and high cost-effectiveness -
led to technologies such as packet switching, packet radio and satellite
communications, as well as intercomputer communication protocols.  It is
the natural result of the progress in both areas that the use of packet
switching technology be considered for voice communication.  In this
paper, the issues involved in the application of packet-switching
networks to real-time voice communication are identified and
explained.",
ANNOTE="Outlines delay components and graphs synchronization recovery,
describing tradeoffs between loss and discontinuity.",
}

@INPROCEEDINGS{Geor7709:Local,
AUTHOR="Nicolaos D. Georganas and A. Chatterjee and Pramode K. Verma",
TITLE="Local congestion control in computer-communication networks with
random routing",
BOOKTITLE="5th Data Communications Symposium",
ORGANIZATION="ACM, IEEE",
ADDRESS="Snowbird, Utah",
PAGES="5-19-5-24",
MONTH=sep,
YEAR=1977,
KEYWORDS="congestion control; routing",
ABSTRACT="This paper considers the problem of congestion in
message-switched, or packet-switched, networks, which employ
probabilistic routing schemes. A queueing model for the analysis of a
local congestion control with random routing is superior to similar
control with deterministic routing for a particular example worked out
here.",
ANNOTE="Eliminates external arrivals by reducing service rate.",
}

@INPROCEEDINGS{Hend7709:Message,
AUTHOR="thomas henderson and Theodore Myer",
TITLE="Issues in Message Technology",
BOOKTITLE="5th Data Communications Symposium",
ORGANIZATION="ACM and IEEE",
ADDRESS="Snowbird, Utah",
PAGES="6-1-6-9",
MONTH=sep,
YEAR=1977,
KEYWORDS="e-mail; messaging; ARPAnet",
ABSTRACT="Five years of collaborative development have established
message communication as a way of life on the ARPAnet. Many lessons were
learned in building the network-wide message system, and it does a
generally reliable and efficient job. However, the haste with which the
system was built has forced numerous compromises and left many questions
unresolved. This paper sketches the history and design of the system and
then explores conclusions, compromises and questions in four areas of
the technology: message form and structure, addressing, authentication
and protection, and the implications of a network environment.",
ANNOTE="history of early ARPAnet e-mail services",
}

@ARTICLE{Pete7709:Petri,
AUTHOR="James L. Peterson",
TITLE="Petri nets",
JOURNAL=acmcs,
VOLUME=9,
NUMBER=3,
PAGES="223-252",
MONTH=sep,
YEAR=1977,
KEYWORDS="Petri nets; system models; asynchronous concurrent events",
ABSTRACT="Over the last decade, the Petri net has gained increased usage
and acceptance as a basic model of systems of asynchronous concurrent
computation. This paper surveys the basic concepts and uses of Petri
nets. The structure of Petri nets, their markings and execution, several
examples of Petri net models of computer hardware and software, and
research into the analysis of Petri nets are presented, as are the use
of the reachability tree and the decidability and complexity of some
Petri net problems. Petri net languages, models of computation related
to Petri nets, and some extensions and subclasses of the Petri net model
are also briefly discussed.",
}

@ARTICLE{Cars7709:Simplified,
AUTHOR="R. T. Carsten",
TITLE="A Simplified Analysis of Scan Times in an Asymmetric Newhall Loop
with Exhaustive Service",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="951-957",
MONTH=sep,
YEAR=1977,
}

@INPROCEEDINGS{Camo7709:Mathematical,
AUTHOR="B. Camoin",
TITLE="A Mathematical Model of Traffic in Communication Networks",
BOOKTITLE="8th IFIP Conference on Optimization Techniques",
ADDRESS="Würzburg, Germany",
PAGES="454-463",
MONTH=sep,
YEAR=1977,
KEYWORDS="Traffic model; communication network",
}

@INPROCEEDINGS{Pau7709:Properties,
AUTHOR="L. F. Pau",
TITLE="Properties of Classification Rules Subject to Small Learning
Samples. Application to Quality control and Signal classifiaction with
Multivariate Measurements",
BOOKTITLE="Congrés International Analyse des Données et Informatique",
ADDRESS="IRIA, Rocquencourt, France",
PAGES=8,
MONTH=sep,
YEAR=1977,
KEYWORDS="Traffic measurement",
}

@ARTICLE{Webb7710:Use,
AUTHOR="S. A. Webber and C. R. Harris and J. L. Flanagan",
TITLE="Use of variable-quality coding and time-interval modification in
packet transmission of speech",
JOURNAL=bstj,
VOLUME=56,
NUMBER=8,
PAGES="1569-1573",
MONTH=oct,
YEAR=1977,
KEYWORDS="packet voice; speech processing",
ABSTRACT="We comment here upon a combination of variable-quality
encoding and time-interval modification that can efficiently load a
transmission facility and accomodate fluctuating demands on it.",
ANNOTE="Round-trip delays of up to 0.6 sec can be used. Within-sentence
silent time equal to about 15 can be usefully eliminated. Silence
interval modifications of the order of $\pm$ 50 percent are tolerable.
Interval lengthening of more than 200 percent, and shortening down to 0
percent are clearly not acceptable.",
}

@INPROCEEDINGS{Moss7710:Criteri,
AUTHOR="C. Mossotto and M. Romagnoli and A. Catavello and L. Musumerci",
TITLE="Criteri di scelta del codice ciclico per rivelazione di errore
nel sistema di segnalazione su canale comune {CCITT} Nr. 7",
BOOKTITLE="25th International Meeting on Transportation and
Communication",
ADDRESS="Genova",
MONTH=oct,
YEAR=1977,
KEYWORDS="Signalling; common channel; CCS; performance evaluation",
}

@ARTICLE{Abra7710:NBS,
AUTHOR="M. D. Abrams and  others",
TITLE="The {NBS} network measurement system",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="1189-1198",
MONTH=oct,
YEAR=1977,
}

@ARTICLE{Diri7710:Topological,
AUTHOR="H. Dirilten and R. W. Donaldson",
TITLE="Topological design of distributed data communication networks
using linear regression clustering",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="1083-1091",
MONTH=oct,
YEAR=1977,
}

@ARTICLE{Jone7710:Maximum,
AUTHOR="S. K. Jones and  others",
TITLE="On the maximum average throughput rate for a tandem mode
network",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="1240-1244",
MONTH=oct,
YEAR=1977,
}

@ARTICLE{Neri7710:Reliable,
AUTHOR="G. Neri and  others",
TITLE="A reliable control protocol for high-speed packet transmission",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="1203-1210",
MONTH=oct,
YEAR=1977,
}

@ARTICLE{Toba7710:Packet,
AUTHOR="F. A. Tobagi and L. Kleinrock",
TITLE="Packet switching in radio channels, Part {IV}",
JOURNAL=ieeecom,
VOLUME="COM-25",
PAGES="1103-1119",
MONTH=oct,
YEAR=1977,
}

@ARTICLE{Tray7710:SDLC,
AUTHOR="K. C. Traynham and R. F. Steen",
TITLE="{SDLC} and {BSC} on Satellite Links: A Performance Comparison",
JOURNAL=ccr,
VOLUME=7,
NUMBER=4,
MONTH=oct,
YEAR=1977,
}

@ARTICLE{Cose7710:X,
AUTHOR="Bernard Cosell and A. G. Nemeth and D. C. Walden",
TITLE="{X.25} Link Access Procedure",
JOURNAL=ccr,
VOLUME=7,
NUMBER=4,
MONTH=oct,
YEAR=1977,
}

@ARTICLE{Gost7710:Problem,
AUTHOR="Jack Gostl",
TITLE="A Problem with the {X.25} Link Access Procedure",
JOURNAL=ccr,
VOLUME=7,
NUMBER=4,
MONTH=oct,
YEAR=1977,
}

@ARTICLE{Bels7710:Problems,
AUTHOR="D. Belsnes and Ejvind Lynning",
TITLE="Some Problems with the {X.25} Packet Level Protocols",
JOURNAL=ccr,
VOLUME=7,
NUMBER=4,
MONTH=oct,
YEAR=1977,
}

@ARTICLE{Boch7710:Notes,
AUTHOR="Gregor V. Bochmann",
TITLE="Notes on the {X.25} Procedures for Virtual Call Establishment and
Clearing",
JOURNAL=ccr,
VOLUME=7,
NUMBER=4,
MONTH=oct,
YEAR=1977,
}

@ARTICLE{Anon7710:USA,
AUTHOR="Anonymous",
TITLE="{USA} Position on Datagram Service",
JOURNAL=ccr,
VOLUME=7,
NUMBER=4,
MONTH=oct,
YEAR=1977,
}

@INPROCEEDINGS{Beil77:Modelling,
AUTHOR="H. Beilner and E. Gelenbe",
TITLE="Modelling and performance evaluation of computer systems",
BOOKTITLE="International Workshop organized by the Commission of the
European Communities",
PAGES="1-516",
MONTH=oct,
YEAR=1977,
KEYWORDS="Performance evaluation; memory management; process management;
multiprogramming; hardware monitor; model; special issue",
ABSTRACT="Significantly broader in scope than the previously published
preprints, this volume treats such problems as memory management
strategies, task sequencing, queueing policies in multi-processor
computers, programmable hardware monitors and performance evaluation of
batch-time sharing computer systems.",
}

@INPROCEEDINGS{Ande7710:Measurements,
AUTHOR="K. E. Anders and R. Evers",
TITLE="Measurements of the Grade of Service and User Characteristics by
Monitoring Subscriber Lines",
BOOKTITLE="URSI, International Symposium on measurements in
Telecommunications",
ADDRESS="Lannion",
PAGES="286-291",
MONTH=oct,
YEAR=1977,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Boda7710:Analyseur,
AUTHOR="H. Bodard and L. Charoy and J. P. Guerineau",
TITLE="Analyseur D'Ecoulement du Trafic Dans les Organes Communs Rapides
des Autocommutateurs Telephoniques Crossbar. Projet {ESTOC.} Equipment
for the Analysis of Traffic in the Common Control of Crossbar E",
BOOKTITLE="URSI, International Symposium on measurements in
Telecommunications",
ADDRESS="Lannion",
PAGES="77-80",
MONTH=oct,
YEAR=1977,
KEYWORDS="traffic analysis; measurement tool; control system",
}

@INPROCEEDINGS{Farr7710:Grade,
AUTHOR="J. P. Farr",
TITLE="Grade of Service and Performance Monitoring of Traffic in the
Australian Telecommunication System",
BOOKTITLE="URSI, International Symposium on measurements in
Telecommunications",
ADDRESS="Lannion",
PAGES="37-42",
MONTH=oct,
YEAR=1977,
KEYWORDS="Gos",
}

@INPROCEEDINGS{Farr7710:Telecommunications,
AUTHOR="J. P. Farr",
TITLE="Telecommunications Traffic Measurements and Processing Methods
Used by Telecom Australia",
BOOKTITLE="URSI, International Symposium on measurements in
Telecommunications",
ADDRESS="Lannion, France",
PAGES="81-87",
MONTH=oct,
YEAR=1977,
KEYWORDS="Measurement; Traffic Measurement; Measurement Method",
}

@INPROCEEDINGS{Fred7710:Relationship,
AUTHOR="A. Fredericks and J. T. LaMacchia and G. A. Reisner",
TITLE="On the Relationship Between Telephone Service and Ineffective
Attempt Measurement",
BOOKTITLE="URSI, International Symposium on measurements in
Telecommunications",
ADDRESS="Lannion",
PAGES="68-70",
MONTH=oct,
YEAR=1977,
KEYWORDS="call reattempt",
ABSTRACT="Subscriber behaviour",
}

@INPROCEEDINGS{Hugo7710:L,
AUTHOR="J. Hugon and J. Agasse and C. Penn",
TITLE="L'Evolution Technologique des Appareils de Maintenance et
d'Observation de Trafic en communtation Téléphonique",
BOOKTITLE="URSI, International Symposium on measurements in
Telecommunications",
ADDRESS="Lannion, France",
PAGES="88-92",
MONTH=oct,
YEAR=1977,
LANGUAGE="French",
KEYWORDS="Traffic measurement",
}

@INPROCEEDINGS{Robe7710:Equipment,
AUTHOR="J. W. Roberts and F. Floc'h and C. Penn",
TITLE="L'Equipement Octopus {II} pour l'Observation du Comportement de
l'Abonne au Telephone",
BOOKTITLE="URSI Colloque International sur la Mesure en
Télécommuncations",
ADDRESS="Lannion, France",
PAGES=5,
MONTH=oct,
YEAR=1977,
LANGUAGE="French",
KEYWORDS="Traffic measurement",
}

@INPROCEEDINGS{Taze7710:Observation,
AUTHOR="H. Tazerout and A. Guerard and M. Guillemenet",
TITLE="Observation du Trafic. Surveillance et Maintenace
Electromecanique",
BOOKTITLE="URSI, International Symposium on measurements in
Telecommunications",
ADDRESS="Lannion, France",
PAGES="71-76",
MONTH=oct,
YEAR=1977,
LANGUAGE="French",
KEYWORDS="Traffic measurement",
}

@INPROCEEDINGS{Jaco7710:Systeme,
AUTHOR="J. B. Jacob",
TITLE="Systeme de Commutation Temporelle {E10.} Observation de Trafic,
Mesure de Surveillance de L'Etat D'Occupation et de la Qualite de
Service",
BOOKTITLE="URSI, International Symposium on measurements in
Telecommunications",
ADDRESS="Lannion, France",
PAGES="93-97",
MONTH=oct,
YEAR=1977,
LANGUAGE="French",
KEYWORDS="QOS; quality of service; traffic measurement",
}

@ARTICLE{Gopi7711:Discrete,
AUTHOR="B. Gopinath and J. A. Morrison",
TITLE="Discrete-Time Single Server Queues with Correlated Inputs",
JOURNAL=bstj,
VOLUME=56,
NUMBER=9,
PAGES="1743-1768",
MONTH=nov,
YEAR=1977,
KEYWORDS="discrete time queue",
ABSTRACT="A wide variety of queueing systems with a single server can be
modeled by the equation $b\_{n+1}=(b\_n-1)^++ z\_n$, where $b\_n$
denotes queue length and $z\_n$ the input. The usual assumption about
the sequence $\{z\_n\}$ is that it be a sequence of independent
identically distributed (i.i.d.) random variables. However, in many
applications, this is not really the case; $\{z\_n\}$ is a sequence of
correlated random variables. We show that with the help of a
transformation, a $(k+1)$-dimensional Markov process that suffices to
describe the queueing system may be found, where $k$ is the memory of
the input process. We derive an equation for the steady-state generating
function corresponding to the joint distribution of this vector process.
We find that a simple set of equations can be obtained for the marginal
distributions. In particular, the steady-state distribution of $b\_n$,
the queue length, can be obtained without solving for the joint
distribution.",
}

@INPROCEEDINGS{Schr7711:Multics,
AUTHOR="M. D. Schroeder and D. D. Clark and J. H. Saltzer",
TITLE="The Multics Kernel Design Project",
BOOKTITLE="ACM 6th Symposium on Operating Systems Principles",
PUBLISHER="ACM",
ADDRESS="Purdue University, Lafayette, Indiana",
NOTE="Published in ACM Operating System Review, 2 (5) 43-56",
MONTH=nov,
YEAR=1977,
}

@ARTICLE{Falk7711:Alternative,
AUTHOR="G. Falk and J. M. McQuillan",
TITLE="Alternative for Data Network Architectures",
JOURNAL=ieeecomp,
VOLUME=10,
PAGES="22-31",
NOTE="also in \cite{Abra80:Computer}",
MONTH=nov,
YEAR=1977,
}

@ARTICLE{Gree7711:Review,
AUTHOR="W. Greene and U. W. Pooch",
TITLE="A Review of Classification schemes for computer Communication
Networks",
JOURNAL=ieeecomp,
VOLUME=10,
PAGES="12-21",
NOTE="also in \cite{Abra80:Computer}",
MONTH=nov,
YEAR=1977,
}

@ARTICLE{Jone7711:Dynamic,
AUTHOR="S. K. Jones and R. K. Cavin",
TITLE="Dynamic modeling and control of digital communication networks",
JOURNAL=ieeecomp,
VOLUME=10,
PAGES="60-64",
MONTH=nov,
YEAR=1977,
}

@ARTICLE{Morg7711:Methods,
AUTHOR="D. E. Morgan and  others",
TITLE="A survey of methods for improving computer network reliability
and availability",
JOURNAL=ieeecomp,
VOLUME=10,
PAGES="42-51",
MONTH=nov,
YEAR=1977,
}

@ARTICLE{Yaji7711:Labolink,
AUTHOR="S. Yajima and Y. Kambayashi and S. Yoshida and K. Iwama",
TITLE="Labolink: An Optically Linked Laboratory Computer Network",
JOURNAL=ieeecomp,
VOLUME=10,
PAGES="52-59",
NOTE="also in \cite{Thur81:Tutorial}",
MONTH=nov,
YEAR=1977,
}

@INPROCEEDINGS{Mont7711:Measurements,
AUTHOR="Warren A. Montgomery",
TITLE="Measurements of Sharing in Multics",
BOOKTITLE=sosp,
PAGES="85-90",
MONTH=nov,
YEAR=1977,
}

@INPROCEEDINGS{McDa7711:Metric,
AUTHOR="Gene McDaniel",
TITLE="Metric: A Kernel Instrumentation System for Distributed
Environments",
BOOKTITLE=sosp,
PAGES="93-99",
MONTH=nov,
YEAR=1977,
}

@INPROCEEDINGS{Nish7711:Simulation,
AUTHOR="T. Nishigaki and C. Ikeda and H. Ikegaya",
TITLE="Simulation Studies of a Loop Free Technique in Adaptive Routing
in Message Switched Networks",
BOOKTITLE=itc9,
ADDRESS="Delft, Netherlands",
PAGES=19,
MONTH=nov,
YEAR=1977,
KEYWORDS="Simulation; adaptive routing",
}

@ARTICLE{Chat7712:Packet,
AUTHOR="A. Chatterjee and Nicolaos D. Georganas and Pramode K. Verma",
TITLE="Analysis of a Packet-Switched Network with End-to-End Congestion
Control and Random Routing",
JOURNAL=ieeecom,
VOLUME="COM-25",
NUMBER=12,
PAGES="1485-1489",
MONTH=dec,
YEAR=1977,
KEYWORDS="congestion control",
ABSTRACT="This concise paper extends the results of Pennotti and
Schwartz by proposing a queueing model of a communication network with
random routing and end-to-end congestion control. Using conventional
performance criteria, the performance of this model is compared with
that of a previously published model, where fixed routing was
employed.",
}

@ARTICLE{Gold7712:Digital,
AUTHOR="Bernard Gold",
TITLE="Digital speech networks",
JOURNAL=ieeeproc,
VOLUME=65,
NUMBER=12,
PAGES="1636-1658",
MONTH=dec,
YEAR=1977,
KEYWORDS="packet voice; LPC; voice coding; packetization; playout
synchronization; ARPAnet; bit dropping; congestion control; real-time
services",
ABSTRACT="Digital techniques, already widely used for the transmission
of data, are now being introduced in the field of voice communications.
By appreciating some of the long-range implications of this trend we can
help point the way towards appropriate usage of this developing
technology for improved customer service. This paper focuses on the
voice problem and the possibilities offered by complete digitization of
the voice signal immediately following the microphone. Included in the
discussion are a summary of the properties of the speech signal and its
potentialities for efficient transmission, a survey of the existing
voice digitization algorithms, some examples of voice digitization
implementations, and a brief treatment of voice packetization. There are
some comments, near the end of the paper, on the possibility of
digitized-voice inputting to, and outputting from, computers in an
integrated telephone-computer network.",
}

@ARTICLE{Payn7712:Normal,
AUTHOR="W. G. Payne",
TITLE="Normal random numbers: Using machine analysis to choose the best
algorithm",
JOURNAL=toms,
VOLUME=3,
NUMBER=4,
PAGES="346-358",
MONTH=dec,
YEAR=1977,
KEYWORDS="random variate generation",
}

@INPROCEEDINGS{Butt7712:Models,
AUTHOR="M. Butto",
TITLE="Models for the Performance Evaluation of a Packet Switching
Network with Retransmission Time-Out",
BOOKTITLE=ntc,
ORGANIZATION="IEEE",
PAGES="12:3/1-6",
MONTH=dec,
YEAR=1977,
}

@INPROCEEDINGS{Conr7712:Aspects,
AUTHOR="K. Conradsen",
TITLE="Some Aspects of the Analysis of Air Pollution Data",
BOOKTITLE="Transactions of the 7th Prague Conference on Information
Theory, Statistics",
PAGES="53-62",
MONTH=dec,
YEAR=1977,
}

@INPROCEEDINGS{Thyr7712:Bayes,
AUTHOR="P. Thyregod",
TITLE="On Bayes Decision Rules for Symmetric Finite Populations",
BOOKTITLE="Transactions of the Prague Conference on Information Theory,
Statistics",
ADDRESS="Prague, CS",
PAGES="521-526",
MONTH=dec,
YEAR=1977,
KEYWORDS="Statistics",
}

@TECHREPORT{Wall7712:Approximate,
AUTHOR="B. Wallström",
TITLE="Some Approximate Models for Overflow Systems with Pooled
Independent Input Streams",
INSTITUTION="University of Lund, Department of Telecommunications",
ADDRESS="Lund, Sweden",
PAGES=15,
MONTH=dec,
YEAR=1977,
KEYWORDS="Overflow traffic",
}