@ARTICLE{Barn90:Traffic,
AUTHOR="J. A. Barnes and R. L. Disney",
TITLE="Traffic Processes in a Class of Finite Markovian Queues",
JOURNAL=qs,
VOLUME=6,
NUMBER=3,
PAGES="311-326",
YEAR=1990,
KEYWORDS="queueing theory",
ANNOTE="Arrival, input, output, departure and overflow processes",
}

@BOOK{Bens90:Television,
AUTHOR="K. Blair Benson and Jerry C. Whitaker",
TITLE="Television and Audio Handbook for Technicians and Engineers",
PUBLISHER="McGraw-Hill",
ADDRESS="New York",
YEAR=1990,
KEYWORDS="packet voice",
ANNOTE="CD data: 14.12; TV systems of the world: p. 17.16",
}

@ARTICLE{Bran90:Single,
AUTHOR="A. Brandt and Manfred Brandt and Hannelore Sulanke",
TITLE="A Single Server Model for Packetwise Transmission of Messages",
JOURNAL=qs,
VOLUME=6,
NUMBER=3,
PAGES="287-310",
YEAR=1990,
KEYWORDS="discrete time queue",
ANNOTE="Batch arrivals (time-dispersed)",
}

@UNPUBLISHED{Liew90:Comparison,
AUTHOR="S. C. Liew and K. W. Lu",
TITLE="Comparison of Buffering Strategies for Asymmetric Packet Switch
Modules",
NOTE="Bellcore memorandum",
YEAR=1990,
KEYWORDS="fast packet switches",
ANNOTE="Asymmetric packet-switch modules with channel grouping and input
or output buffers.",
}

@UNPUBLISHED{Yama90:Control,
AUTHOR="Makoto Yamamoto and H. Okada",
TITLE="Control Ahead {ATM} Switch Architecture using Broadband
Transmission Media",
NOTE="Seminar presentation Univ. of Mass. August 1990",
YEAR=1990,
KEYWORDS="fast packet switching",
ANNOTE="CASCH switch: separation of data and header.",
}

@ARTICLE{Verm9009:Novel,
AUTHOR="Mahendra K. Verma and Dimitrios P. Prezas and Jr. Russell and
Mostafa Hashem Sherif and Reed Thorkildsen",
TITLE="Novel Applications of Speech Processing in {AT\\&T} Network
Systems Products",
JOURNAL=atttj,
VOLUME=69,
NUMBER=5,
PAGES="77-86",
MONTH="September/October",
YEAR=1990,
KEYWORDS="packet voice; speech coding; speech recognition",
ABSTRACT="In this paper, we discuss speech processing applications in
the integrated access and cross-connect system, digital cellular
telephone system, operator services position system, and intelligent
networks. These applications are used to show how the AT\\&T Network
Systems product line allows telephone companies and business customers
to implement solutions based on end-user characteristics, expectations,
and requirements.",
ANNOTE="Wideband packet network IACS classifies traffic into voice,
voiceband data and data, with support for G.721/G.723 ADPCM and G.727
embedded ADPCM. Compares speech coder complexity in MIPS. Also describes
speech recognition for operator assistance.",
}

@INPROCEEDINGS{Chen90:Optimal,
AUTHOR="Wei-Peng Chen and R. R. Muntz",
TITLE="Optimal Routing for Closed Queueing Networks",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="3-17",
YEAR=1990,
}

@INPROCEEDINGS{Conw90:New,
AUTHOR="A. E. Conway",
TITLE="A New Method of Parametric Analysis for Product Form Queueing
Networks",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="19-33",
YEAR=1990,
}

@INPROCEEDINGS{Akyi90:Exact,
AUTHOR="Ian Akyildiz and N. van Dijk",
TITLE="Exact Solution for Networks of Parallel Queues with Finite
Buffers",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="35-49",
YEAR=1990,
}

@INPROCEEDINGS{Dijk90:Insensitive,
AUTHOR="N. van Dijk",
TITLE="An Insensitive Product Form for Discrete-Time Communication
Networks",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="77-89",
YEAR=1990,
}

@INPROCEEDINGS{Sado90:Tail,
AUTHOR="John Sadowsky and W. Szpankowski",
TITLE="On the Analysis of the Tail Queue Length and Waiting Time
Distributions of a $GI/G/c$ Queue",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="93-107",
YEAR=1990,
}

@INPROCEEDINGS{Taki90:Resequencing,
AUTHOR="T. Takine and T. Hasegawe",
TITLE="Resequencing Delay in Preemptive Priority {$M/M/2$} Queues",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="109-121",
YEAR=1990,
}

@INPROCEEDINGS{Fuhr90:Second,
AUTHOR="S. W. Fuhrmann",
TITLE="Second Moment Relationships for Waiting Times in Queueing Systems
with Poisson Input",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="123-129",
YEAR=1990,
}

@INPROCEEDINGS{Reim90:Allocation,
AUTHOR="M. I. Reiman",
TITLE="Some Allocation Problems for Critically Loaded Loss Systems with
Independent Links",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="145-158",
YEAR=1990,
}

@INPROCEEDINGS{Evan90:Optimal,
AUTHOR="Steve Evans",
TITLE="Optimal Resource Management and Capacity Allocation in a
Broadband Integrated Services Network",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="159-173",
YEAR=1990,
}

@INPROCEEDINGS{Gunt90:Bilinear,
AUTHOR="N. Gunther",
TITLE="Bilinear Model of Blocking Transients in Large Circuit Switching
Networks",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="175-189",
YEAR=1990,
}

@INPROCEEDINGS{Leun90:Response,
AUTHOR="K. K. Leung",
TITLE="Response Time for an Additional Job Served by an Execution/Sleep
Scheduling Policy in Priority Systems",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="209-220",
YEAR=1990,
}

@INPROCEEDINGS{Epem90:Mean,
AUTHOR="D. H. J. Epema",
TITLE="Mean Waiting Times in a General Feedback Queue with Priorities",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="221-35",
YEAR=1990,
}

@INPROCEEDINGS{Fric90:Memory,
AUTHOR="C. Fricker and P. Robert",
TITLE="A Memory Reference Model for the Analysis of Cache Memories",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="255-269",
YEAR=1990,
}

@INPROCEEDINGS{Rego90:Band,
AUTHOR="V. Rego",
TITLE="A Band and Bound Technique for Simple Random Algorithms",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="271-278",
YEAR=1990,
}

@INPROCEEDINGS{Shen90:Efficient,
AUTHOR="S. Shenker",
TITLE="Efficient Network Allocations with Selfish Users",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="279-285",
YEAR=1990,
}

@INPROCEEDINGS{Mass90:Heavy,
AUTHOR="W. A. Massey and R. Srinivasan",
TITLE="A Heavy Traffic Analysis for Semi-Open Networks",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="289-300",
YEAR=1990,
}

@INPROCEEDINGS{Kouv90:Product,
AUTHOR="D. D. Kouvatsos and N. Tabet-Aouel",
TITLE="Product-Form Approximations for an Extended Class of General
Closed Queueing Networks",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="301-315",
YEAR=1990,
}

@INPROCEEDINGS{Sidi90:Customer,
AUTHOR="M. Sidi and H. M. Levy",
TITLE="Customer Routing in Polling Systems",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="319-331",
YEAR=1990,
}

@INPROCEEDINGS{Leun90:Waiting,
AUTHOR="K. K. Leung",
TITLE="Waiting Time Distributions for Token-Passing Systems with
Limited-$k$ Service via Discrete Fourier Transforms",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="333-347",
YEAR=1990,
}

@INPROCEEDINGS{Boxm90:Optimization,
AUTHOR="O. J. Boxma and H. M. Levy and J. A. Weststrate",
TITLE="Optimization of Polling Systems",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="349-361",
YEAR=1990,
}

@INPROCEEDINGS{Taka90:Effects,
AUTHOR="H. Takagi",
TITLE="Effects of the Target Token Rotation Time on the Performance of a
Timed-Token Protocol",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="363-370",
YEAR=1990,
}

@INPROCEEDINGS{Hofr90:Exact,
AUTHOR="M. Hofri and Y. Kogan",
TITLE="Exact and Asymptotic Analysis of Large Multiple Bus
Multiprocessor Systems",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="373-389",
YEAR=1990,
}

@INPROCEEDINGS{Nels90:Contention,
AUTHOR="Randolph D. Nelson and Mark S. Squillante",
TITLE="Analysis of Contention in Multiprocessor Scheduling",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="391-405",
YEAR=1990,
}

@INPROCEEDINGS{Ghod90:Parallel,
AUTHOR="M. Ghodsi and K. Kant",
TITLE="Performance Analysis of Parallel Search Algorithms on
Multiprocessors",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
PAGES="407-421",
YEAR=1990,
}

@PROCEEDINGS{King90:,
TITLE="Performance",
BOOKTITLE="Performance",
EDITOR="P. J. B. and I. Mitrani and R. J. Pooley",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Holland",
YEAR=1990,
}

@ARTICLE{Sher90:Wideband,
AUTHOR="M. H. Sherif and  Malaret-Collazo and M. C. Gruensfelder",
TITLE="Wideband packet technology in the integrated access and
cross-connect system {(IACS)}",
JOURNAL="International Journal of Satellite Communications",
VOLUME=8,
PAGES="437-444",
YEAR=1990,
KEYWORDS="voice and data integration; wideband packet technology;
bandwidth on demand; congestion control; packet cross-connection;
network management; virtual private network; LADP; ADPCM; voice
packetization; packet voice",
ABSTRACT="The integrated access and cross-connect system (IACS) is an
AT\\&T product based on the wideband packet technology. The IACS has two
compoenents: the integrated access terminal (IAT) and the integrated
access controller (IAC). The IAC provides centralized control,
operations and maintenance for a network of IATs. An IAT provides direct
digital connectivity at 1.536 Mb/s or 2.048 Mb/s to customer terminals
and to circuit- and packet-switched networks. It integrates voice,
voiceband data, facsimile traffic, digital data, signalling, image and
network control into packets of common format. It allows networking in
both the circuit and packet domains, offers bandwidth on demand, and
achieves graceful degradation of voice quality during congestion.",
ANNOTE="three queue priorities: exhaustive non-preemptive for signalling
and control; other queues are services until empty or timer expires;
queue 0 can preempt other queues; timers range from 0 to 30 ms. Block
dropping depends on the current fill of packet queues, computed as a
weighted sum of the queue 1 and 2 fill values.",
}

@ARTICLE{Sher90:CCITT,
AUTHOR="M. H. Sherif and Russell J. Clark and G. P. Forcina",
TITLE="{CCITT/ANSI} voice packetization protocol",
JOURNAL="International Journal of Satellite Communications",
VOLUME=8,
NUMBER=6,
PAGES="429-436",
YEAR=1990,
KEYWORDS="packet voice; G.764",
ABSTRACT="This paper introduces the packetized voice protocol
G.PVNP/T1.PVP which is being standardized in both the CCITT and T1Y1. At
layer 2, G.PVNP/T1.PVP extends the ISDN LAPD protocol to include
packetized voice, thereby potentially allowing the integration of voice
and data traffic. Layer 3 specifies procedures to deal with voice-band
data traffic and to handle channel-associated signaling.",
ANNOTE="CCITT recommended delay limit for international circuits: 400
ms.",
}

@BOOK{Moor90:Elements,
AUTHOR="F. R. Moore",
TITLE="Elements of Computer Music",
ISBN="0-13-252552-6",
PUBLISHER="Prentice Hall",
ADDRESS="Englewood Cliffs, New Jersey",
YEAR=1990,
KEYWORDS="computer music; computer sound processing; stereophonic
perception",
}

@TECHREPORT{Hopp90:Pandora,
AUTHOR="Andrew Hopper",
TITLE="Pandora -- an experimental system for multimedia applications",
TYPE="Technical Report",
INSTITUTION="Olivetti Research Limited",
ADDRESS="Cambridge, England",
NUMBER="90-1",
YEAR=1990,
KEYWORDS="multimedia; packet voice; packet video; workstation
architecture",
ABSTRACT="Pandora is a joint project between Olivetti Research Cambridge
and the University of Cambridge Computer Laboratory. The project is
investigating the use of multimedia workstations in a working
environment with particular emphasis on digital video. It endeavours to
place a camera on the desktop to make generation of multimedia documents
as easy as producing text. We are aiming to produce a number of new
applications as well as to provide insights into the way computer
systems should be designed. The project is in three stages. In the first
a peripheral, Pandora's Box, has been designed. This box can be attached
to any one of a range of workstations and provides multimedia features.
In the second stage a number of such systems are being deployed amongst
a community of system developers and application writers. Finally we
will use the experimental system in our daily work to evaluate new
applications. From the users point of view the normal workstation
environment is maintained but additional features are available. This
paper describes the design decisions which must be taken when
incorporating video in a workstation. A description of the Pandora's Box
peripheral which provides multimedia features is given. Finally, the
distributed system under construction is discussed.",
}

@INCOLLECTION{Camp90:DoD,
AUTHOR="Andrew T Campbell and Thomas E. Tremain and Vanoy C. Welch",
TITLE="The {DoD} 4.8 kbps standard (Proposed Federal Standard 1016)",
BOOKTITLE="Advances in Speech Coding",
EDITOR="B. Atal and V. Cuperman and A. Gersho",
CHAPTER="4.1",
PUBLISHER="Kluwer Academic Publishers",
YEAR=1990,
KEYWORDS="speech coding; CELP",
}

@ARTICLE{Camp9004:Proposed,
AUTHOR="Andrew T Campbell and Thomas E. Tremain and Vanoy C. Welch",
TITLE="The Proposed Federal Standard 1016 4800 bps voice coder: {CELP}",
JOURNAL=speecht,
VOLUME=5,
NUMBER=2,
PAGES="58-64",
MONTH="April/May",
YEAR=1990,
KEYWORDS="voice coding; CELP",
}

@TECHREPORT{OTS90:Telecommunications,
AUTHOR="Office of Technology and  Standards",
TITLE="Telecommunications: Analog to Digital Conversion of Radio Voice
by 4,800 bit/second Code Excited Linear Prediction {(CELP)}",
TYPE="Federal Standard",
INSTITUTION="GSA",
ADDRESS="Room 6654; 7th \\& D Street SW; Washington, DC 20407
(+1-202-708-9205)",
NUMBER="FS-1016",
YEAR=1990,
KEYWORDS="CELP; low-rate speech coding; packet voice",
}

@MISC{Kohl90:SunGraph,
AUTHOR="M. A. Kohler",
TITLE="SunGraph",
ORGANIZATION="National Security Agency",
ADDRESS="Fort Meade, Virginia",
YEAR=1990,
KEYWORDS="graphing; digital signal processing; tools",
}

@INPROCEEDINGS{Atha90:Physically,
AUTHOR="William C. Athas",
TITLE="Physically Compact, High Performance Multicomputers",
BOOKTITLE="7th MIT Conference on Advanced Research in VLSI",
ADDRESS="Boston, Massachusetts",
PAGES="302-313",
YEAR=1990,
}

@ARTICLE{BaiQ90:Dynamically,
AUTHOR="Xu BaiQiang and Nathan Ida",
TITLE="A Dynamically Segmented Bus Architecture",
JOURNAL="Computers and Electrical Engineering",
VOLUME=16,
NUMBER=3,
PAGES="139-158",
YEAR=1990,
}

@ARTICLE{El90:Scheduling,
AUTHOR="Hesham El-Rewini and T. G. Lewis",
TITLE="Scheduling Parallel Program Tasks onto Arbitrary
Target-Machines",
JOURNAL=jpdc,
VOLUME=9,
PAGES="138-153",
YEAR=1990,
}

@ARTICLE{Fan90:Simultaneous,
AUTHOR="Zhenqiang Fan and Kam Hoi Cheng",
TITLE="Design and Analysis of Simultaneous Priority Queues",
JOURNAL=jpdc,
VOLUME=9,
NUMBER=4,
PAGES="387-397",
YEAR=1990,
}

@BOOK{Hage90:Task,
AUTHOR="Gregory D. Hager",
TITLE="Task-Directed Sensor Fusion and Planning: a computational
approach",
PUBLISHER="Kluwer Academic Publishers",
ADDRESS="Boston",
YEAR=1990,
}

@INCOLLECTION{Harm90:Robots,
AUTHOR="S. Y. Harmon",
TITLE="Robots, Mobile",
BOOKTITLE="Encyclopaedia of Artificial Intelligence",
PUBLISHER="John Wiley",
PAGES="957-963",
YEAR=1990,
}

@INCOLLECTION{Hawl90:Futurebus,
AUTHOR="David Hawley",
TITLE="Futurebus",
BOOKTITLE="Digital Bus Handbook",
PUBLISHER="McGraw-Hill",
ADDRESS="New York",
YEAR=1990,
}

@INPROCEEDINGS{Luo90:Intelligent,
AUTHOR="Ren C. Luo and Tai-Jee Pan and Caglan M. Aras",
TITLE="An Intelligent Motion Planning System operating in a Factory
Floor",
BOOKTITLE="IEEE Workshop on Intelligent Motion Control",
ADDRESS="Istanbul, Turkey",
VOLUME=1,
YEAR=1990,
}

@ARTICLE{Onyu90:Markovian,
AUTHOR="Ibrahim Onyuksel and K. B. Irani",
TITLE="Markovian Queueing Network Models for Performance Analysis of a
Single-Bus Multiprocessor System",
JOURNAL=ieeetc,
VOLUME=39,
NUMBER=7,
PAGES="975-980",
YEAR=1990,
}

@ARTICLE{Perr90:Approximation,
AUTHOR="Harry Perros",
TITLE="Approximation Algorithms for Open Queueing Networks with
Blocking",
JOURNAL="Stochastic Analysis of Computer and Communication Systems",
VOLUME="TR-89-16",
PAGES="451-498",
YEAR=1990,
}

@INPROCEEDINGS{Ragh90:Fine,
AUTHOR="R. Raghavan and K. K. Jung and H. Q. Nguyen",
TITLE="Fine Grain Parallel Processors and Real-Time Applications: {MIMD}
{Controller/SIMD} Array",
BOOKTITLE="10th International Conference on Pattern Recognition",
ADDRESS="Atlantic City, New Jersey",
VOLUME=2,
PAGES="324-331",
YEAR=1990,
}

@INPROCEEDINGS{Rind90:Preemptive,
AUTHOR="Andrew J Rindos and Jeffrey Haag and I. Viniotis",
TITLE="Analysis of The Preemptive Resume Policy With Nonzero Overhead",
BOOKTITLE="IEEE Southeatcon",
PAGES="861-865",
YEAR=1990,
}

@INPROCEEDINGS{Sha90:Real,
AUTHOR="L. Sha and Ragunathan Rajkumar and John Lehocszky",
TITLE="Real-Time Scheduling Support in Futurebus+",
BOOKTITLE="11th Real-Time Systems Symposium",
ADDRESS="Lake Buena Visa, Florida",
VOLUME=1,
YEAR=1990,
}

@INCOLLECTION{Lidi90:Requirements,
AUTHOR="W. P. Lidinsky",
TITLE="Network requirements for data traffic",
BOOKTITLE="Perspectives on packetized voice and data communications",
EDITOR="William Lidinsky and David Vlack",
SERIES="Frontiers in Communications",
PUBLISHER="IEEE Press",
ADDRESS="New York",
PAGES="5-10",
YEAR=1990,
KEYWORDS="data networks; requirements; client-server",
ABSTRACT="The computing community has recently evolved an additional
computer system paradigm often referred to as the ``client-server''
model. Fueled by the explosive growth of both personal computers and
local area networks, computing systems based on this model are
flourishing. The data communications needs of these systems are
currently being satisfied by low delay, connectionless networks with
broadcast capabilities (e.g., local area networks). Such networks
provide services that are substantially different from virtual circuit
networks. This paper examines both present and future computing and
explores trends in computing technology. It examines the data
communications needs of four classes of computing systems:
terminal-timesharing, transaction, mainframe, and client-server.
Finally, it discusses in detail the communications network
characteristics necessary for client-server systems.",
}

@INCOLLECTION{Lidi90:Packet,
AUTHOR="W. P. Lidinsky",
TITLE="Packet network interfaces and implementations",
BOOKTITLE="Perspectives on packetized voice and data communications",
EDITOR="William Lidinsky and David Vlack",
SERIES="Frontiers in Communications",
PUBLISHER="IEEE Press",
ADDRESS="New York",
PAGES="11-15",
YEAR=1990,
KEYWORDS="data networks; requirements; client-server; connectionless;
connection-oriented; implementation",
}

@BOOK{Lidi90:Perspectives,
TITLE="Perspectives on packetized voice and data communications",
EDITOR="William Lidinsky and David Vlack",
SERIES="Frontiers in Communications",
ISBN="0-87942-233-5",
PUBLISHER="IEEE Press",
ADDRESS="New York",
YEAR=1990,
KEYWORDS="data networks; packet voice",
}

@INPROCEEDINGS{Oust90:Tcl,
AUTHOR="J. Ousterhout",
TITLE="Tcl: an embeddable command language",
BOOKTITLE=usenixw,
ORGANIZATION="Usenix",
PAGES="133-146",
YEAR=1990,
KEYWORDS="Tcl; command language; widget set; programming tools",
ABSTRACT="Tcl is an interpreter for a tool command language. It consists
of a library package that is embedded in tools (such as editors,
debuggers, etc.) as the basic command interpreter. Tcl provides (a) a
parser for a simple textual command language, (b) a collection of
built-in utility commands, and (c) a C interface that tools use to
augment the built-in commands with tool-specific commands. Tcl is
particularly attractive when integrated with the widget library of a
window system: it increases the programmability of the widgets by
providing mechanisms for variables, procedures, expressions, etc.; it
allows users to program both the appearance and the actions of widgets;
and it offers a simple but powerful communication mechanism between
interactive programs.",
}

@ARTICLE{Sait90:Departure,
AUTHOR="H. Saito",
TITLE="The departure process of an {$N/G/1$} queue",
JOURNAL=pe,
VOLUME=11,
PAGES="241-251",
YEAR=1990,
REFERENCES=23,
KEYWORDS="departure process; $N$-process; packet voice; packet video;
ATM; integrated services; queueing theory; N/G/1; ATM; performance
evaluation; queueing system",
ABSTRACT="The departure process of an $N/G/1$ queue is investigated. The
arrival process called an $N$ process is a versatile point process and
includes, for example, a Markov-modulated Poisson process, which is
comprised of models of packetized voice and video traffic arrival
processes. The first passage analysis yields LSTs of distributions of
the interdeparture times. Emphasis is on the interdeparture times of an
$N/D/1$ queue. Numerical examples show that correlation of interarrival
times is likely to be preserved in interdeparture times, and that the
departure of a voice packet multiplexer can be expected to be smoothed
for a normal load. The result in this paper enables evaluation of the
smoothing effect of burst traffic through nodes in asynchronous transfer
mode networks.",
}

@UNPUBLISHED{Cido90:Control,
AUTHOR="I. Cidon and I. Gopal",
TITLE="Control mechanisms for high speed networks",
NOTE="IBM T. J. Watson Research Center",
YEAR=1990,
KEYWORDS="PARIS; network control; fast packet switching",
ABSTRACT="The high speed communication links and the altered nature of
carried traffic has considerably impacted the design and implementation
of packet switched networks. In this paper we explore the impact on the
control procedures within the network, specifically focusing on the
lessons that we have learned from the prototype PARIS network. We
believe that most of the conclusions are general and can be applied to
any network including ATM based systems.",
}

@TECHREPORT{Ahma90:Dynamic,
AUTHOR="Hazim Ahmadi and Jinghu Chen and R. Guérin",
TITLE="Dynamic routing and call control in high-speed integrated
networks",
TYPE="Technical Report",
INSTITUTION="IBM Research Division, T. J. Watson Research Center",
ADDRESS="Yorktown Heights, New York",
YEAR=1990,
KEYWORDS="routing; call control; admission control",
ABSTRACT="High-speed networks, based on fast-packet switching, are being
proposed and implemented that are capable of carrying a wide variety of
connections with different bandwidth requirements and traffic
characteristics. This new environment, because of its increased
flexibility, poses new problems to the network designer. In particular,
the issues of bandwidth allocation, dynamic route computations and call
control policies are substantially more complex than in the traditional
circuit-switched or packet-switched environments. This paper focuses on
dynamic routing and admission control of connections with different
traffic requirements. These issues are studied by means of simulations,
assuming a bandwidth allocation procedure developed in a companion
paper. A routing strategy is proposed that attempts to maximize network
throughput while, in the mean time, providing the lowest possible
end-to-end delay. This is achieved by accounting for the impact of
routing a connection on both link loads and required network resources.
In addition, a threshold-based call admission policy, similar in spirit
to trunk reservation, is also investigated. The results indicate this
call admission policy can help prevent some of the potential unfairness
of dynamic routing. However, because of the general network topology
assumed, its efficiency is more limited than in the traditional
circuit-switched network environment. New policies need to be developed
to accomodate these more general networks.",
}

@TECHREPORT{Cido90:New,
AUTHOR="I. Cidon and I. Gopal and S. Kutten",
TITLE="New models and algorithms for future networks",
TYPE="Technical Report",
INSTITUTION="IBM T. J. Watson Research Center",
ADDRESS="Yorktown Heights, New York",
NOTE="also in the proceedings of the 7th ACM Symposium on Principles of
Distributed Computing, Toronto, Canada, August 1988 and in the
Proceedings of the 4th Workshop on Distributed Algorithms, Bari, Italy,
September 1990.",
YEAR=1990,
KEYWORDS="ATM; network architecture; distributed algorithms; leader
election; routing",
ABSTRACT="In future networks transmission and switching capacity will
dominate processing capacity. In this paper we investigate the way in
which distributed algorithms should be changed in order to operate
efficiently in this new environment. We introduce a class of new models
for distributed algorithms which make explicit the difference between
switching and processing. Based on these new models, we define
``message'' and time complexity measures which capture the true costs in
high speed networks more accurately than traditional measures. In order
to demonstrate the capabilities of the new model we examine three
problems in distributed computation. For the problem of maintaining
network topology we devise a broadcast algorithm which takes $O(n)$
``messages'' and $O(\log n)$ time. For the problem of leader election we
present a simple algorithm that uses $O(n)$ ``messages'' and $O(n)$
time. A matching lower bound for a certain class of algorithms is also
provided. The third problem, distributed computation of a globally
sensitive function, demonstrates some important features and trade-offs
in the new network model and emphasizes the differences with the
traditional network model. All algorithms described in this paper are
better than the best existing algorithms under the new network model.",
}

@TECHREPORT{Kapl90:Slick,
AUTHOR="Michael Kaplan",
TITLE="Slick Transport Protocol -- {RTP}",
TYPE="Technical Report",
INSTITUTION="IBM Watson Research Labs",
ADDRESS="Yorktown Heights, New York",
NUMBER="90 01",
YEAR=1990,
KEYWORDS="STP; transport protocol",
ABSTRACT="STP is a new high-performance reliable data transport protocol
whose guiding philosophical principles are: be optimistic, be fast, be
as straightforward as is consistent with the first two principles.
Prototype file transfer and remote command execution applications are
now running ``on top of'' our STP prototype code. This paper will
briefly describe STP.",
ANNOTE="implicit connection establishment with data",
}

@TECHREPORT{Cido90:Metaring,
AUTHOR="I. Cidon and Y. Ofek",
TITLE="Metaring -- a full-duplex ring with fairness and spatial reuse",
TYPE="Technical Report",
INSTITUTION="IBM T. J. Watson Research Center",
ADDRESS="Yorktown Heights, New York",
YEAR=1990,
KEYWORDS="local area networks; ring networks; multiple access; slot
reuse; synchronous traffic; asynchronous traffic",
ABSTRACT="We describe the design principles of a ring network with
spatial reuse. Our goal is to provide the same functions of existing
designs that do not permit spatial reuse and concurrent transmission. A
distributed fairness mechanism for this architecture is presented. The
basic fairness mechanism can be extended for implementing multiple
priority levels and integration of asynchronous with synchronous
traffic. The ring is full duplex and has two basic modes of operation:
buffer insertion mode for variable size packets and slotted mode for
fixed-size packets. As a result, this architecture is suitable for a
wide range of applications and environments. Concurrent access and
spatial reuse enable the simultaneous transmissions over disjoint
segments of a bidirectional ring, and therefore, can increase the
effective throughput, by a factor of four or more. The efficiency of
this architecture does not degrade as the bandwidth and physical size of
the system increases. The combination of a full-duplex ring, spatial
reuse, reliable fairness mechanism and the exploitation of the recent
advances in fiber-optic technology are the basis for the Metaring
network architecture. This network is currently being prototyped at the
IBM T. J. Watson Research Center.",
}

@TECHREPORT{Jone90:IMS,
AUTHOR="Gareth Jones",
TITLE="{IMS} {T9000} transputer: benchmark performance",
TYPE="Technical Note",
INSTITUTION="SGS-Thomson/Inmos",
ADDRESS="Bristol, UK",
NUMBER=72,
YEAR=1990,
KEYWORDS="transputer; performance; benchmarks; Whetstone; Dhrystone;
T9000",
ABSTRACT="This document describes the performance of the IMS T9000
transputer with regard to the execution of some common benchmark
programs. The aim of these benchmarks is to show the performance that
can be achieved using current generation transputer compilers. The
benchmarks used to show performance relative to other processors are the
Whetstone and Dhrystone benchmarks. These are both synthetic benchmarks,
which, although being subject to what has become known as 'benchmark
targeted engineering', are still often quoted with regard to relative
processor performance. In order to show the performance that is quite
easily achievable using the TMS T9000 transputer, two programs have been
used. The first program is a 1024 point complex FFT illustrating
floating point performance. The second shows integer performance and is
based on the colour transform mathematics required to convert a red,
green, blue color image into a cyan, magenta, yellow image which can
then be printed.",
}

@ARTICLE{Wein90:Scheduling,
AUTHOR="L. M. Wein",
TITLE="Scheduling Networks of Queues - Heavy Traffic Analysis of a 2-
Station Network with Controllable Inputs",
JOURNAL=or,
PUBLISHER="Operations Research Society of America",
VOLUME=38,
NUMBER=6,
PAGES="1065-1078",
YEAR=1990,
}

@ARTICLE{Warf90:Prospects,
AUTHOR="B. Warfield and P. Sember",
TITLE="Prospects for the Use of Artificial Intelligence in Real Time
Network Traffic Management",
JOURNAL=cnis,
PUBLISHER="North-Holland",
VOLUME=20,
NUMBER="1-5",
PAGES="163-169",
YEAR=1990,
}

@ARTICLE{Kash90:Robust,
AUTHOR="A. Kashper and S. S. Katz and G. R. Ash",
TITLE="Robust design for switched digital services in a worldwide
intelligent network",
JOURNAL=cnis,
PUBLISHER="North-Holland",
ADDRESS="Amsterdam, Netherlands",
VOLUME=20,
NUMBER="1-5",
PAGES="81-88",
YEAR=1990,
}

@ARTICLE{Gers90:Joint,
AUTHOR="A. Gersht and R. Weihmayer",
TITLE="Joint Optimisation of Data Network Design and Facility
Selection",
JOURNAL=ieeejsac,
PUBLISHER="IEEE",
VOLUME=8,
NUMBER=9,
PAGES="1667-1681",
YEAR=1990,
ANNOTE="Deals with a method of capacity planning and allocation in
network design",
}

@ARTICLE{Netr90:Implementation,
AUTHOR="A. N. Netravali and W. D. Roome and K. Sabnani",
TITLE="Design and Implementation of a High Speed Transport Protocol",
JOURNAL=ieeecom,
VOLUME=38,
NUMBER=11,
PAGES="2010-2024",
YEAR=1990,
KEYWORDS="transport protocol; SNR; flow control",
ABSTRACT="This paper describes a transport protocol designed for
high-speed (> 1 Gbit/s), high-latency (> 60 ms R. T. D.) networks.  With
a 60 ms RTD on a 1 Gbit/s line, using Go-back-N or a windowing flow
control protocol, upto 60Mbits have to be retransmitted if an overflow
occurs.  The authors new protocol supports three modes of operation: 1)
No error and no flow (suitable for lightwieght virtual circuits for
terminals) 2) No error control (suitable for packetised voice and video
where small errors can go undetected) 3) Full error and flow control
(suitable for traditional file transfer etc) Connection establishment is
based upon a three way handshake.  Prenegotiated buffers are setup which
are larger than the RTD $x$ the negotiated bandwidth.  State information
is passed regularly and frequently between communicating systems as this
supposedly makes protocol processing easier.  The authors envisage a
heirarchially organised multiprocessor based outboard protocol
processor, which would link several hosts each with many logical
channels to the network.  Most performance constraints are to do with
the movement of data between the host and the protocol processor and bus
contention in the protocol processor.  Packets may be grouped together
in blocks to simplify the processing.  Selective retransmission is used
for error recovery to keep down the retransmission costs.",
}

@ARTICLE{Lync9006:Growth,
AUTHOR="C. A. Lynch",
TITLE="The growth of Computer Networks: A Status Report",
JOURNAL=basis,
VOLUME=16,
NUMBER=5,
PAGES="10-11",
MONTH="June -- July",
YEAR=1990,
ABSTRACT="This paper describes some computer networks on the national
level that serve the research and higher education communities. BITNET
and Internet connect institutions and have overseas affiliates. These
networks are used for electronic mail, file transfers and access to
database servers. Networks available to the general public through
telephone companies are in the trial stages. Another development is the
linking of a number of electronic mail services into wha will become a
national system. Some policy and management issues are raised in the
paper such as where the funding will come from and how to insure network
security. The proposed National Research and Education Network (NREN) is
described. This network would provide access to the advanced science
equipment such as the space telescope, the superconducting supercollider
and national supercomputing centres.",
}

@INPROCEEDINGS{Cisl90:National,
AUTHOR="S. Cisler",
TITLE="The National Research and Education Network",
BOOKTITLE="Online/CD-ROM Conference",
PUBLISHER="Online Inc.",
ADDRESS="Weston, Connecticut",
PAGES="31-35",
YEAR=1990,
REFERENCES=5,
ABSTRACT="This paper outlines the history of the National Research and
Education Network (NREN) effort. Internet is defined as the network of
networks serving governmental, research and academic communities in the
United States and around the world. The wide bandwidth research network
is suggested as the successor to the Internet. The National High
Performance Computer Technology Act of 1989 is examined.",
}

@ARTICLE{Acam9006:Architecture,
AUTHOR="A. S. Acampora",
TITLE="Architecture and technologies for Terabit Lightwave Networks",
JOURNAL=basis,
VOLUME=16,
NUMBER=5,
PAGES="15-16",
MONTH="June -- July",
YEAR=1990,
ABSTRACT="This paper examines a recent research goal in optical
technologies - a Terabit lightwave network that assumes the properties
of an ``optical ether'', with geographical separation between users
being spanned by passive optical components. The oprical ther supports
the creation of broadband channels, and since it is devoid of speed
contstrining electronics, the channels ma operate autonomously, moving
vastamounts of information. All routing and control functions are
performed in electronics situated in the network interface units. Some
applications of Terabit lightwave networks are telecommunications,
distribution of high quality graphics, document and picture archiving
and retrieval, access to electronically stored databases and publishing
services and the interconnection of supercomputers.",
}

@INPROCEEDINGS{Cruz90:Iterative,
AUTHOR="J. R. Cruz and S. Stidham",
TITLE="Iterative methods for determining derivatives of stationary
distributions of finite Markove chains",
BOOKTITLE="1st International Conference on the Numerical Solution of
Markov Chains",
ADDRESS="Raleigh, North Carolina",
PAGES="142-164",
YEAR=1990,
REFERENCES=22,
KEYWORDS="Markov chain; steady state probability; distribution",
ANNOTE="Algorithms for obtaining derivatives of steady state
probabilitydistributions of finite Markov chains are presented.  The
focus is on a conceptually simple approach for developing such
algorithms from established methods of computing steady state
proba-bility distributions.  The prototyp is briefly discussed and the
results are presented of applying the approach to LOPSI (Lopsided
Iteration) and Neut's Matrix Geometric Methods.",
}

@INPROCEEDINGS{Elwa90:Theory,
AUTHOR="A. I. Elwalid and D. Mitra and T. E. Stern",
TITLE="A Theory of Statistical Multiplexing of Markovian Sources:
Spectral Expansions and Algorithms",
BOOKTITLE="1st International Conference on the Numerical Solution of
Markov Chains",
ADDRESS="Raleigh, North Carolina",
PAGES="238-257",
YEAR=1990,
REFERENCES=21,
KEYWORDS="Markov chain; efficient computer algorithm; theory",
ANNOTE="This paper considers the problem of exactly calculating the
stationary state distribution of a system which statistically
multiplexes the output of $K$ sources.  Each source is an N-state Markov
chain and its Poisson rate of packet generation is deter-mined by its
state.",
}

@INPROCEEDINGS{Huli90:Comparison,
AUTHOR="Zbigniew Hulicki",
TITLE="Performance Comparison of Multistage Cube-Type Interconnection
Networks",
BOOKTITLE="International Zurich Seminar on Digital",
ADDRESS="Zurich, Switzerland",
PAGES="213-219",
YEAR=1990,
REFERENCES=30,
KEYWORDS="ATM; switching system; multistage interconnection network",
}

@INPROCEEDINGS{Krie90:Loss,
AUTHOR="U. R. Krieger",
TITLE="Analysis of a loss system with mutual overflow in a Markovian
environment",
BOOKTITLE="1st International Conference on the Numerical Solution of
Markov Chains",
ADDRESS="Raleigh, North Carolina",
PAGES="328-348",
YEAR=1990,
REFERENCES=45,
KEYWORDS="Markov system; analysis; loss system; overflow; overview",
ABSTRACT="A loss system modelling mutual overflow between two fully
available trunk groups is investigated.  Assuming exponentially
distributed call holding times and two independent Markov
modulatedPoisson processes to be offered as arrival streams, a Markovian
model is derived and its steady-state distribution is computed by
numerical methods.  Formulas for the call-congestion rates of of the
arrival streams are derived.",
}

@INPROCEEDINGS{Naka90:Steady,
AUTHOR="A. Nakasis and Anthony Ephremides",
TITLE="Steady state behaviour of interacting queues - a numerical
approach",
BOOKTITLE="1st International Conference on the Numerical Solution of
Markov Chains",
ADDRESS="Raleigh, North Carolina",
PAGES="547-568",
YEAR=1990,
REFERENCES=25,
KEYWORDS="Markov chain; steady state analysis; interaction model",
ANNOTE="In this paper the authors consider the case of $M$ queues that
in-teract according to the model of multiple access transmissions over a
collision channel; that is, each queue receives messages that it
attempts to transmit in a classical slotted ALOHA fashion. A numerical
approach is proposed that permits the calculationwithin any desired
accuracy, of the joint queue size distribution as well as of the
moments.",
}

@ARTICLE{Yoon90:Multibuffered,
AUTHOR="H. Yoon and K. Y. Lee and Minkui Liu",
TITLE="Performance analysis of multibuffered packet switching in
multiprocessor systems",
JOURNAL=ieeetc,
VOLUME="C-39",
NUMBER=3,
PAGES="319-327",
YEAR=1990,
REFERENCES=18,
KEYWORDS="Packet switching; interconnection network; delta network",
ANNOTE="We present a new analytic model and analytic results for the
performance of multibuffered packet switching interconnection networks
in multiprocessor systems. For multibuffered interconnection networks
only simulation results of delta networks are known (1). We first model
the wsingle-buffered delta networks using the state transition diagram
of a buffer. It is then extended to multibuffering. The analysis is
compared with simulation results.",
}

@TECHREPORT{Gebe90:Paketvermittlungstechnik,
AUTHOR="H. Gebehenne",
TITLE="Paketvermittlungstechnik",
TYPE="Unterrichtsblätter der DBP",
INSTITUTION="Deutsche Bundespost",
VOLUME=43,
NUMBER=4,
PAGES=27,
YEAR=1990,
LANGUAGE="German",
REFERENCES=12,
KEYWORDS="Packet switching; survey; ISO reference model",
}

@ARTICLE{Jage90:Zusammenhang,
AUTHOR="R. Jäger",
TITLE="Zusammenhang zwischen Gebühren und Einnahmen im
Telekommunikationsbereich",
JOURNAL=fernmelde,
ISBN="0015-010-X",
ADDRESS="Erlangen, Germany",
VOLUME=44,
NUMBER="1/2",
PAGES=41,
YEAR=1990,
LANGUAGE="German",
REFERENCES=7,
KEYWORDS="Traffic source model; parameter estimation; tariff",
}

@ARTICLE{Knes90:Asymptotic,
AUTHOR="Ch. Knessl and C. Tier",
TITLE="Asymptotic expansions for large closed queuing networks",
JOURNAL=jacm,
VOLUME=37,
NUMBER=1,
PAGES="144-174",
YEAR=1990,
REFERENCES=19,
KEYWORDS="Closed queueing network; BCMP; analysis; approximation",
ANNOTE="A new asmptotic method is developed for analyzing closed BCMP
queueing networks with a single class (chain) consisting of a large
number of customers, a single infinite server queue, and a large number
of single server queues with fixed (state independent) service rates.",
}

@ARTICLE{Ghos90:Dataflow,
AUTHOR="D. Ghosal and L. Bhuyan",
TITLE="Performance evaluation of a dataflow architecture",
JOURNAL=ieeetc,
VOLUME="C-39",
NUMBER=5,
PAGES="615-627",
YEAR=1990,
REFERENCES=29,
KEYWORDS="Closed queueing network; performance evaluation; data flow",
ANNOTE="This paper deales with formulation and validation of an
analytical approach for the performance evaluation of the Manchester
dataflow compputer. The analytical approach is based on closed queueing
network models. The average parallelism of the dataflow graph being
executed on the dataflow architecture is shown to be related to the
population of the closed network.",
}

@ARTICLE{Krit90:Generalised,
AUTHOR="P. S. Kritzinger",
TITLE="A generalised analysis of {ARQ} protocol performance in a
multiprocess environment",
JOURNAL=pe,
VOLUME=11,
NUMBER=1,
PAGES="31-44",
YEAR=1990,
REFERENCES=18,
KEYWORDS="ARQ; MVA; protocol engineering; performance evaluation",
ANNOTE="Comparison of stop-and-wait and selective repeat in a
multiprocess environment",
}

@TECHREPORT{Lin90:Determining,
AUTHOR="Y. Lin and E. D. Lazowska",
TITLE="Determining the global virtual time in a distributed simulation",
INSTITUTION="University of Washington",
ADDRESS="Seattle, Washington",
PAGES=23,
YEAR=1990,
REFERENCES=15,
KEYWORDS="distributed simulation; time warp",
ABSTRACT="The virtual time paradigm is a method of organizing and
synchronizing distributed systems. An implementation of this paradigm,
called the time warp mechanism, is one of the most important simulation
protocols. This paper proposes a new algorithm that does not require
acknowledgement messages.",
}

@PHDTHESIS{Klut90:Multiprozessorarchitekturen,
AUTHOR="B. Kluth",
TITLE="Multiprozessorarchitekturen mit funktionsorientierter
Parallelisierung für die stochastische Simulation",
ISBN="3-925038-62-0",
SCHOOL="RWTH Aachen",
ADDRESS="Aachen, Germany",
PAGES=178,
YEAR=1990,
LANGUAGE="German",
REFERENCES=83,
KEYWORDS="Simulation; distributed simulation; model; RNG; SIMULA; C++",
}

@ARTICLE{Berb90:Application,
AUTHOR="I. Berberana",
TITLE="Application of extreme value theory to the analysis of a network
simulation",
JOURNAL=sigsim,
VOLUME=20,
PAGES="105-121",
NOTE="Proc. 23rd Annual Simulation Conference",
YEAR=1990,
REFERENCES=15,
KEYWORDS="Communication network; queueing network; ATM; simulation",
ANNOTE="The objective of this work is to estimate the finite buffer size
of the queues such that cells arring to the system at a lower rate than
one fixed have a very low probability, usually less than 10E-8, to be
rejected. To carry out this task by simulation would require very much
computer time. Extreme value theory is employed to estimate, from the
results of a reduced simulation, thenecessary buffer sizes.",
}

@ARTICLE{Kas90:Intelligente,
AUTHOR="B. Käs and M. Körkel",
TITLE="Intelligente Netze - Spezifische verkehrstheoretische und
wirtschaftliche Gesichtspunkte bei der Planung",
JOURNAL=fernmelde,
PUBLISHER="Verlag für Wissenschaft und Leben (G. G. Heidecker)",
ADDRESS="Erlangen, Germany",
VOLUME=44,
NUMBER=5,
PAGES="1-27",
YEAR=1990,
LANGUAGE="German",
REFERENCES=18,
KEYWORDS="IN; intelligent network; queueing network; overload control",
ANNOTE="Verschiedene Methoden der Überlastabwehr im Zeichengabenetz
werden entwickelt und simulativ untersucht. Außerdem werden
kostengünstige Standorte für die IN-Einrichtungen ermittelt.",
}

@TECHREPORT{Vill90:RESTART,
AUTHOR="M. Villen-Altamirano and J. Villen-Altamirano",
TITLE="{RESTART:} a method for accelerating rare event simulations",
TYPE="COST Technical document",
INSTITUTION="Telefonica (TID)",
ADDRESS="Madrid, Spain",
NUMBER="224 TD(90)017",
PAGES=11,
YEAR=1990,
REFERENCES=5,
KEYWORDS="Simulation; time series analysis; importance sampling",
ANNOTE="REpetitive Simulation Trials After Reaching Thresholds",
}

@ARTICLE{Kim90:Buffered,
AUTHOR="H. Kim and A. Leon-Garcia",
TITLE="Performance of buffered Banyan networks under nonuniform traffic
patterns",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=5,
PAGES="648-658",
YEAR=1990,
REFERENCES=10,
KEYWORDS="Interconnection Network; buffered Banyan network; switching",
ABSTRACT="This paper presents an analytical method to evaluate the
performance of the bufferd Banyan packet-switching network under
nonuniform traffic patterns. It is shown that the nonuniform traffic can
have a detrimental effect on the performance of the network. The
analytical model is extended to evaluate the performance of multibuffer
and parallel Banyan networks. These modified networ ks are shown to have
better throughput capacity.",
}

@ARTICLE{Gorg90:Further,
AUTHOR="C. Görg",
TITLE="Further results on a new combined strategy based on the {SRPT}
principle",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=5,
PAGES="568-570",
YEAR=1990,
REFERENCES=7,
KEYWORDS="Queueing discipline; performance evaluation; SRPT; shortest",
ABSTRACT="A short introduction to the method of analysis for SRPT/RR is
given and it is shown that this combined strategy preserves the
essential advantages of the SRPT principle",
}

@ARTICLE{Ozaw90:Alternating,
AUTHOR="T. Ozawa",
TITLE="Alternating service queues with mixed exhaustive and K-limited
services",
JOURNAL=pe,
VOLUME=11,
NUMBER=3,
PAGES="165-175",
YEAR=1990,
REFERENCES=20,
KEYWORDS="Queueing system; polling; exhaustive service",
ANNOTE={A single server model with two queues is analyzed. The service
discipline used in one queue is "exhaustive" and that in the other queue
is K-limited.},
}

@ARTICLE{Kauf90:Approximate,
AUTHOR="J. S. Kaufman and Wai-Choong Wong",
TITLE="Approximate analysis of a cyclic queuing network with
applications to a simultaneous resource posession problem",
JOURNAL=pe,
VOLUME=11,
NUMBER=3,
PAGES="187-200",
YEAR=1990,
REFERENCES=7,
KEYWORDS="Closed queueing network",
}

@ARTICLE{Scho90:Open,
AUTHOR="Frederik Carel Schoute",
TITLE="Open-loop versus closed-loop control of processor loading",
JOURNAL=pe,
VOLUME=11,
NUMBER=3,
PAGES="201-208",
YEAR=1990,
REFERENCES=5,
KEYWORDS="Queueing system; overload control; SPC",
}

@ARTICLE{Dall90:Approximate,
AUTHOR="Y. Dallery",
TITLE="Approximate analysis of general open queuing networks with
restricted capacity",
JOURNAL=pe,
VOLUME=11,
NUMBER=3,
PAGES="165-175",
YEAR=1990,
REFERENCES=43,
KEYWORDS="Open queueing network; finite capacity; performance",
ANNOTE="We consider an open queueing network having general service time
distributions. The total number of customers simultaneously in the
network cannot exceed the capacity of the network.",
}

@INPROCEEDINGS{Gree90:Unboundedly,
AUTHOR="A. G. Greenberg and B. D. Lubachevsky and I. Mitrani",
TITLE="Unboundedly parallel simulations via recurrence relations",
BOOKTITLE="Conference on Measurement and Modeling",
ADDRESS="Boulder, Colorado",
PAGES="1-12",
YEAR=1990,
REFERENCES=31,
KEYWORDS="Distributed simulation",
ANNOTE="Abandoning the distributed event list approach, the simulation
problem is posed using recurrence relations. We bring three algorithmic
ideas to bear on parallel simulation: parallel prefix computation,
parallel merging, and iterative folding.",
}

@ARTICLE{Bind90:Atmospheric,
AUTHOR="B. Binder and P. S. Yu and J. Shapiro",
TITLE="An Atmospheric Optical Ring Network",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=1,
PAGES="74-81",
YEAR=1990,
KEYWORDS="Optical switching; ring network",
ANNOTE="An experimental 10 Mbits/s token-ring local area network that
uses atmospheric optical communication links is described. Objektive and
subjektiveve performance results are reported for operation over a
170m-long outdoor path. These data support the following hypoteses.
Atmospheric optical communications may find LAN applications as bridges
between buildings containing cable subnetworks or as temporary
quick-connects for new outlying hosts",
}

@ARTICLE{Chen90:Addressing,
AUTHOR="M.-S. Chen and Kang G. Shin and D. Kandlur",
TITLE="Addressing, Routing, and Broadcasting in Hexagonal Mesh
Multiprocessors",
JOURNAL=ieeetc,
VOLUME="C-39",
NUMBER=1,
PAGES="10-18",
YEAR=1990,
KEYWORDS="Multiprocessor system; routing algorithm; interconnection",
ANNOTE="A family of 6-regular graphs, called is considered as a
multiprocessor interconnection network. Processing nodes on the periphe
ry of an H-mesh are first wrapped around to achieve regularity and
homogeneity. The diameter of a wrapped $H$-mesh is shown to be of
$O(p)$, where $p$ is the number of nodes in the $H$-mesh. An elegant,
distributed routing scheme is developeds for wrapped $H$-meshesso that
each node in an H-mesh can compute shortes paths from",
}

@ARTICLE{Choi90:Adaptive,
AUTHOR="M. H. Choi and C. M. Krishna",
TITLE="An Adaptive Algorithm to Ensure Differential Service in a
Token-Ring Network",
JOURNAL=ieeetc,
VOLUME="C-39",
NUMBER=1,
PAGES="19-33",
YEAR=1990,
KEYWORDS="LAN; token ring; voice/data integration",
ANNOTE="We present a distributed and adaptive token-passing algorithm
which can be used to maintain the values of a designated performance
parameter at the hosts of a token-ring network at a prescribed ratio.
The algorithm is simple to implement. We demonstrate its application in
keeping the mean waiting times at the varioushosts in a prespecified
ratio, in maintaining a designated throughput differential between
different classes of customer.",
}

@ARTICLE{Chou90:Synchronizing,
AUTHOR="Chien-Chun Chou and I. Cido and I. Gopal and Shmuel Zaks",
TITLE="Synchronizing Asynchronous Bounded Delay Networks",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=2,
PAGES="144-147",
YEAR=1990,
KEYWORDS="Communication network; synchronization",
ANNOTE="An efficient way to synchronize an asynchronous network with a
bounded delay message delivery is presented. Two types of
synchronization algorithms are presented. Both types require an
initializing phase that costs messages. The first requires an additional
bit in every message and increases the time complexity by a factor of 2.
The second does not require any additional bits but increases the time
complexity by a factor of 3.",
}

@ARTICLE{Fdid90:Semaphore,
AUTHOR="S. Fdida and Harry Perros and A. Wilk",
TITLE="Semaphore Queues: Modeling Multilayered Window Flow Control
Mechanisms",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=3,
PAGES="309-317",
YEAR=1990,
KEYWORDS="Packet switching; flow control; queueing network",
ANNOTE="We present an open queueing network for analyzing multilayered
window flow control mechanisms consisting of different subnetworks. The
number of customers in each subnetwork is controlled by a seaphore
queue. The queueing network is analyzed approximately using
decomposition and aggregation. The approximation was validated against
exact numerical and simulation data, and it was found to have an
acceptable relative error.",
}

@ARTICLE{Ganz90:Linear,
AUTHOR="A. Ganz and I. Chlamtac",
TITLE="A Linear Solution to Queueing Analysis of Synchronous Finite
Buffer Networks",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=4,
PAGES="440-446",
YEAR=1990,
KEYWORDS="Queueing network; finite buffer",
ANNOTE={We present an approximate solution to slotted communication
system with finite population and finite buffer capacity. As in the past
we assume symmetric system and present for the first time a "linear"
solution involving linear equations whose number is a linear function of
the total buffer capacity. We show that the presented model can be
applied to existing multiaccess channel protocols in which a single
successful transmission can per slot.},
}

@ARTICLE{Keil90:Distributed,
AUTHOR="Julian Keilson and L. D. Servi",
TITLE="A Distributed Poisson Approximation for Preempt-Resume Clocked
Schedules",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=2,
PAGES="192-198",
YEAR=1990,
KEYWORDS="Queueing system; preemptive resume queue",
ABSTRACT="Many telecommunication systems with time-critical requirements
use a preempt-resume clocked schedule. An approximation to the ergodic
distribution of the time to completion of a low-priority task is
obtained by treating the priority service time distribution as the limit
of compound Poisson distributions. Explicit formulae for the mean and
variance are given which are highly accura",
}

@ARTICLE{Lim90:Markovian,
AUTHOR="Jae Lim and S. M. Meerkov",
TITLE="Performance of Markovian Access Protocols in Satellite Channels",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=3,
PAGES="273-276",
YEAR=1990,
KEYWORDS="Access control; satellite communication",
ABSTRACT="In this note, the theory developed in (1) is extended to
channels with long propagation delays. Specifically, the performance
characteristics of Markovian access control protocols in satellite
channels are evaluated. In particular, it is shown that the channel
propagation delay may lead to improvements in systems's behavior, to
elimination of the saturation effects and to stabilization of the
network in a steady state with relatively high chara",
}

@ARTICLE{Mats90:Effect,
AUTHOR="Y. Matsumoto and Yutaka Takahashi and Toshiharu Hasegawa",
TITLE="The Effect of Packet Size Distribution on Output and Delay
Processes of {CSMA/CD}",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=2,
PAGES="199-214",
YEAR=1990,
KEYWORDS="Lan; csma/cd",
ANNOTE="In this paper, an unslotted model of the nonpersistent CSMA/CD
protocol is considered an the effect of different packet size dis
tribution functions on the system performance is investigated. Under the
assumption that packet sizes obey a general distribution function, an
exact analysis of the oacket output process on the CSMA/CD channel and
the packet delay process at each homogeneous station is presented.",
}

@ARTICLE{Mats90:Probability,
AUTHOR="Y. Matsumoto and Yutaka Takahashi and H. Toshiharu",
TITLE="Probability Distribution of Interdeparture Time and Response Time
in Multipacket {CSMA/CD} System",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=1,
PAGES="54-66",
YEAR=1990,
KEYWORDS="LAN; CSMA/CD; performance evaluation; analysis",
ANNOTE="Carrier-sense multiple access with collision detection is well
know as a simple and efficient random access communication protocol in
local area networks. In this paper, we present an exact analysis of an
asynchronous multipacket CSMA/CD-DFT model and derive 1) the
Laplace-Stieltjes transform of the probability distribution function of
the pacet interdeparture time, 2) the LST of the pdf of the message
interdeparture time, .",
}

@ARTICLE{Rayc90:Dynamic,
AUTHOR="D. Raychuadhuri and J. Harmon",
TITLE="Dynamic Performance of {ALOHA-Type} {VSAT} Channels: a simulation
study",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=2,
PAGES="251-259",
YEAR=1990,
KEYWORDS="Access control; satellite communication; ALOHA; simulation;
performance evaluation",
ABSTRACT={This paper presents a simulation study of the dynamic behavior
of ALOHA-type protocols used in interactive-data very small aperture
terminal networks. A simulation model for quantitative evaluation of
random access channel stability in terms of the transient response to a
traffic overload pulse is described and the usefulness of a single
performance measure defined as "backlog fall time" is established.},
}

@ARTICLE{Stav90:Approximation,
AUTHOR="I. Stavrakakis and D. Kazakos",
TITLE="On the Approximation of the Output Process of Multiuser
Random-Access Communication Networks",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=2,
PAGES="172-178",
YEAR=1990,
KEYWORDS="Communication network; access control; output process",
ANNOTE="In this paper, Bernoulli and first-order Markov processes are
used to approximate the output process of a class of slotted multiuser
random-access communication networks. The output process is defined to
be the process of the successfully transmitted packets within the
network.",
}

@ARTICLE{Yabu90:Approximate,
AUTHOR="M. Yabusaki and Shuji Suzuki",
TITLE="Approximate Performance Analysis and Simulation Study for
Variable-Channel-Per-Burst {SS-TDMA}",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=3,
PAGES="318-326",
YEAR=1990,
KEYWORDS="burst switching; performance evaluation; simulation",
ABSTRACT="This paper analyzes traffic performance of a
variable-channel-per-burst satellite-switched TDMA which dynamically
reconfigures traffic bursts. An SS-TDMA system with an onboard baseband
switch is used as the VCPB application system. Bursts are assigned to
each earth station one-by-one. Idle channels of other bursts are
transferred to a burst having an insufficient number of idle channels by
reconfiguration on a call-by-call basis.",
}

@ARTICLE{Grav90:Geo,
AUTHOR="A. Gravey and Jean Raymond Louvion and P. Boyer",
TITLE="On the Geo/D/1 and Geo/D/1/n queues",
JOURNAL=pe,
VOLUME=11,
NUMBER=2,
PAGES="117-125",
YEAR=1990,
REFERENCES=13,
KEYWORDS="ATM; queueing system; GEO/D/1; GEO/D/1/N; waiting time",
ANNOTE="A discrete-time single server FIFO queue with Bernoulli arrivals
and deterministic service times is studied.",
}

@ARTICLE{Lee90:Modular,
AUTHOR="T. T. Lee",
TITLE="A modular architecture for very large packet switches",
JOURNAL=ieeecom,
VOLUME=38,
NUMBER=7,
PAGES="1097-1106",
YEAR=1990,
REFERENCES=23,
KEYWORDS="ATM; packet switching; switching network; modular",
}

@ARTICLE{Li90:Nonuniform,
AUTHOR="Song Li",
TITLE="Nonuniform traffic analysis on a nonblocking space-division
packet switch",
JOURNAL=ieeecom,
VOLUME=38,
NUMBER=7,
PAGES="1085-1097",
YEAR=1990,
REFERENCES=10,
KEYWORDS="ATM; packet switching; queueing system; GEO/PH/1; analysis",
ANNOTE="This paper studies the nonuniform traffic performance on a
nonblocking space division packet switch. When an output link is
simultaneously contended by multiple input packets, only one can succeed
and the rest will be buffered in the queues associated witheach input
link. Given the condition that the traffic on each output is not
dominated by individual inputs, our study indicates that the output
contention involved by packets.",
}

@ARTICLE{Ding90:Local,
AUTHOR="W. Ding and F. Schreiber",
TITLE="Local correlation properties of random sequences generated by
queueing system {M/M/1}",
JOURNAL=aeu,
VOLUME=44,
NUMBER=5,
PAGES="384-389",
YEAR=1990,
REFERENCES=18,
KEYWORDS="Queueing system; M/M/1; output process; correlation",
}

@INPROCEEDINGS{Garc90:Priorities,
AUTHOR="J. L. Garcia and O. Casals",
TITLE="Priorities in {ATM} networks",
BOOKTITLE="NATO advanced research workshop architecture and
performance",
ADDRESS="Sophia Antipolis, France",
PAGES=10,
YEAR=1990,
REFERENCES=8,
KEYWORDS="ATM; queueing system; priority; MMPP; performance; fast packet
switching; space priorities",
ANNOTE="In this paper we develop an exact model to evaluate the benefits
of using space priorities in an ATM network when the traffic source is
bursty. The buffer mechanism modelled is the partial buffer sharing. The
bursty source chosen is a Markov modulated Poisson process.",
}

@ARTICLE{Mark90:Simple,
AUTHOR="Z. Markov",
TITLE="A simple way for variance reduction of measured loss in
teletraffic simulation",
JOURNAL=aeu,
VOLUME=44,
NUMBER=5,
PAGES="399-401",
YEAR=1990,
REFERENCES=5,
KEYWORDS="Simulation; output analysis; variance reduction",
ANNOTE="The limitation of one random variable causes the variance
reduction of the other (dependent) random variable. This fact is used,
in a simple adaptation of the known teletraffic simulation roulette
method, to reduce the variance of the measured loss of calls.",
}

@ARTICLE{Nowi90:Analyse,
AUTHOR="K. Nowicki and T. Uhl",
TITLE="Analyse des Abgangsprozesses im M/G/1-Bulk-System",
JOURNAL=aeu,
VOLUME=44,
NUMBER=5,
PAGES="377-383",
YEAR=1990,
LANGUAGE="German",
REFERENCES=9,
KEYWORDS="Queueing system; Mx/G/1; output process; bulk system",
}

@INPROCEEDINGS{Sole90:Traffic,
AUTHOR="J. Sole and J. Domingo and J. L. Garcia",
TITLE="Traffic burstiness influence on {ATM} switching behavior",
BOOKTITLE="4th International Conference on Data Communications and their
Applications",
ADDRESS="Barcelona, Spain",
PAGES="133-147",
YEAR=1990,
REFERENCES=9,
KEYWORDS="ATM; traffic source model; burstiness; switching block",
ANNOTE="In this paper we present a study of switching blocks behaviour
with bursty cell streams.",
}

@ARTICLE{Dupu90:NEST,
AUTHOR="A. Dupuy and J. W. Schwartz and Y. Yemini and David F. Bacon",
TITLE="{NEST:} a network simulation and prototyping testbed",
JOURNAL=cacm,
VOLUME=33,
NUMBER=10,
PAGES="63-74",
YEAR=1990,
REFERENCES=14,
KEYWORDS="Simulation; communication network; protocol engineering",
ANNOTE="NEST is a graphical environment for simulation and rapid
prototyping of distributed networked systems and protocols.",
}

@ARTICLE{Fuji90:Parallel,
AUTHOR="R. M. Fujimoto",
TITLE="Parallel discrete event simulation",
JOURNAL=cacm,
VOLUME=33,
NUMBER=10,
PAGES="30-53",
YEAR=1990,
REFERENCES=98,
KEYWORDS="Distributed simulation; survey; time warp",
ANNOTE="This is a survey of the problems and current state of the in the
field.",
}

@ARTICLE{Glyn90:Likelihood,
AUTHOR="P. W. Glynn",
TITLE="Likelihood ratio gradient estimation for stochastic systems",
JOURNAL=cacm,
VOLUME=33,
NUMBER=10,
PAGES="75-84",
YEAR=1990,
REFERENCES=18,
KEYWORDS="Simulation; optimization; sensitity analysis",
}

@ARTICLE{LEcu90:Random,
AUTHOR="P. L'Ecuyer",
TITLE="Random numbers for simulation",
JOURNAL=cacm,
VOLUME=33,
NUMBER=10,
PAGES="85-97",
YEAR=1990,
REFERENCES=101,
KEYWORDS="RNG; RVG; survey; method",
ANNOTE="This paper gives a survey of the pros and cons of pseudo-RNGs",
}

@ARTICLE{Ciar90:Performability,
AUTHOR="G. Ciardo and Raymond Marie and B. Sericola and K. S. Trivedi",
TITLE="Performability analysis using semi-Markov reward process",
JOURNAL=ieeetc,
VOLUME="C-39",
NUMBER=10,
PAGES="1251-1264",
YEAR=1990,
REFERENCES=23,
KEYWORDS="Reliability; performability; graceful degradation",
ABSTRACT="Fault tolerance and degradable performance has given rise to
considerable interest in models for the combined evaluation of
performance and reliability. Beaudry [1] proposed a simple method. First
we generalize the method to semi-Markov reward process. Second, we
remove the restriction requiring the association of zero award to
absorbing states only. We illustrate the approach with three interesting
applications.",
}

@ARTICLE{Garc90:Discrete,
AUTHOR="M. Garcia",
TITLE="Discrete event simulation",
JOURNAL=sigsim,
VOLUME=21,
PAGES="3-13",
YEAR=1990,
REFERENCES=21,
KEYWORDS="Simulation; discrete event simulation; discrete event",
ABSTRACT="This overview on discrete event simulation discusses modeling
and its role in leading to a understanding of DES, a process for
developing models and simulations, mathematical framework to DES.",
}

@MASTERSTHESIS{Sack90:Verteilte,
AUTHOR="F. Sackmann",
TITLE="Verteilte Simulation diskreter Ereignisysteme: Parallele
Simulation von Teiltests auf einem Parallelrechnersystem
(Transputersystem)",
TYPE="Diplomarbeit",
SCHOOL="Lehrstuhl für Informatik VII, IMMD",
ADDRESS="Erlangen, Germany",
YEAR=1990,
LANGUAGE="German",
REFERENCES=44,
KEYWORDS="Simulation; discrete event simulation; output analysis",
ANNOTE="In der Arbeit wurde ein Ansatz zur Parallelisierung von
Simulationen (Statistische Lastteilung) verwirklicht, beidem die
einzelnen Teiltests eines Simulationslaufes parallel auf den Prozessoren
eine Multiprozessorsystems (Transputersystem) ausgeführt werden.",
}

@ARTICLE{Dori90:Erzeugung,
AUTHOR="H. Döring",
TITLE="Erzeugung normalverteilter Zufallsszahlen mit {16-bit-PC}",
JOURNAL=nte,
ADDRESS="Berlin, Germany",
VOLUME=40,
NUMBER=8,
PAGES="306-309",
YEAR=1990,
LANGUAGE="German",
REFERENCES=6,
KEYWORDS="Normal Distribution; Random Number; Comparison; Pascal; PC",
}

@ARTICLE{Sche90:Cut,
AUTHOR="R. Schehrer",
TITLE="On a Cut-Off Priority Delay-Loss System with Hysteresis",
JOURNAL=aeu,
VOLUME=44,
NUMBER=5,
PAGES="390-398",
YEAR=1990,
REFERENCES=22,
KEYWORDS="cut-off priority; delay loss model; overload control",
}

@INPROCEEDINGS{Scho90:Strategies,
AUTHOR="W. Schödl and M. Tangemann",
TITLE="Strategies for Interconnection {HSLANs} to {BISDN} and their
Performance",
BOOKTITLE="10th International Conference on Computer Communication",
YEAR=1990,
REFERENCES=21,
KEYWORDS="BISDN; HSLAN; performance evaluation; Comparison",
}

@ARTICLE{Ajmo90:GSPN,
AUTHOR="Marco {Ajmone Marsan} and S. Donatelli and F. Neri",
TITLE="{GSPN} models of Markovian multiserver multiqueue systems",
JOURNAL=pe,
VOLUME=11,
NUMBER=4,
PAGES="227-240",
YEAR=1990,
REFERENCES=18,
KEYWORDS="Queueing system; queueing theory; polling; GSPN; generalized
stochastic Petri net",
ANNOTE="Exact results for mean waiting times.",
}

@ARTICLE{Cros90:Product,
AUTHOR="S. Crosby and A. Krzesinski",
TITLE="Product form solutions for multiserver centres with concurrent
classes of customers",
JOURNAL=pe,
VOLUME=11,
NUMBER=4,
PAGES="265-282",
YEAR=1990,
REFERENCES=8,
KEYWORDS="Queueing network; product form; BCMP",
}

@ARTICLE{Rose90:Exponential,
AUTHOR="C. Rosenberg and R. Mazumdar and L. Kleinrock",
TITLE="On the analysis of exponential queuing systems with randomly
changing arrival rates: stability conditions and finite buffer scheme
with a resume level",
JOURNAL=pe,
VOLUME=11,
NUMBER=4,
PAGES="283-292",
YEAR=1990,
REFERENCES=14,
KEYWORDS="Queueing system; single server; arrival process",
ANNOTE="Random fluctuations in the arrival rate are considered.",
}

@ARTICLE{Harr90:Representation,
AUTHOR="P. G. Harrison and N. M. Patel",
TITLE="The representation of multistage interconnection networks in
queuing models of parallel systems",
JOURNAL=jacm,
VOLUME=37,
NUMBER=4,
PAGES="863-898",
YEAR=1990,
REFERENCES=28,
KEYWORDS="Closed queueing network; crossbar; delta network; flow",
ANNOTE="This paper considers analytical models of asynchronous,
circuit-switched INs in which partial paths are held during path
building, beginning with a single crossbar and extending recursivelyto
MINs. Since a path must be held between source and destination
processors before data can be transmitted, switching networks are
passive resources and queueing networks that include them do not
therefore have product-form solutions.",
}

@ARTICLE{Gora90:ASN,
AUTHOR="W. Gora",
TITLE="{ASN.1} Stand und Trends",
JOURNAL=datacom,
VOLUME=2,
PAGES="114-122",
YEAR=1990,
LANGUAGE="German",
KEYWORDS="ASN.1; abstract syntax notation one; survey",
ANNOTE="In dem Artikel werden die wichtigsten Eigenschaften von ASN.1
kurz vorgestellt, sowie auf die Erweiterungen von X.208 ueberblickartig
eingegangen.",
}

@MISC{Spaf90:Computer,
AUTHOR="Eugene Spafford and Kathleen A. Heaphy and David J. Ferbrache",
TITLE="Computer Viruses: Dealing with Electronic Vandalims and
Programmed Threats",
PUBLISHER="ADAPSO",
YEAR=1990,
}

@ARTICLE{Chan90:Distributed,
AUTHOR="Rajan G. Chandras",
TITLE="Distributed Message Passing Operating Systems",
JOURNAL=acmosrev,
VOLUME=24,
NUMBER=1,
PAGES="7-17",
YEAR=1990,
KEYWORDS="Distributed Systems",
}

@ARTICLE{Lore90:IPwatch,
AUTHOR="Mark J. Lorence and M. Saryanarayanan",
TITLE="{IPwatch:} A Tool for Monitoring Network Locality",
JOURNAL=acmosrev,
VOLUME=24,
NUMBER=1,
PAGES="58-80",
YEAR=1990,
KEYWORDS="Network Management",
}

@ARTICLE{Benn90:Experience,
AUTHOR="John K. Bennett",
TITLE="Experience with Distributed Smalltalk",
JOURNAL=spe,
VOLUME=20,
NUMBER=2,
PAGES="157-180",
YEAR=1990,
KEYWORDS="Distributed Programming",
}

@BOOK{Rose90:Open,
AUTHOR="Marshall T. Rose",
TITLE="The Open Book: A practical perspective on {OSI}",
ISBN="0-13-643016-3",
PUBLISHER="Prentice Hall",
ADDRESS="Englewood Cliffs, New Jersey",
YEAR=1990,
ANNOTE="A detailed examination of the OSI protocols from the
implementor's perspective.",
}

@MISC{Must90:Multicast,
AUTHOR="Ed. Mustaque",
TITLE="Multicast Communication in Distributed Systems",
PUBLISHER="IEEE",
YEAR=1990,
}

@MISC{Holz90:Validation,
AUTHOR="Gerard J Holzmann",
TITLE="Design and Validation of Computer Protocols",
PUBLISHER="Prentice Hall",
YEAR=1990,
}

@ARTICLE{Stra90:Information,
AUTHOR="D. W. Straub and Cynthia Mathis Beath",
TITLE="Information Delivery Systems in the 1990's: The Local Integrated
Knowledge Network {(LINKNET)}",
JOURNAL="Data Base",
PUBLISHER="Acm sigbdp",
VOLUME=21,
NUMBER=1,
PAGES="30-40",
YEAR=1990,
}

@ARTICLE{Spez90:Concurrent,
AUTHOR="G. Spezzano and D. Talia and M. Vanneschi",
TITLE="A Concurrent Programing Support for Distributed Systems",
JOURNAL=comp_sys,
PUBLISHER="Usenix assoc.",
VOLUME=3,
NUMBER=3,
PAGES="423-448",
YEAR=1990,
KEYWORDS="Distributed Systems",
}

@ARTICLE{Wagn90:Distributed,
AUTHOR="Bernhard Wagner",
TITLE="Distributed Spooling in a Heterogeneous Environment",
JOURNAL=comp_sys,
PUBLISHER="Usenix assoc.",
VOLUME=3,
NUMBER=3,
PAGES="449-478",
YEAR=1990,
KEYWORDS="Distributed Systems",
}

@ARTICLE{Brac90:Simulation,
AUTHOR="B. J. Brachman and S. T. Chanson",
TITLE="A Simulation Study of Application Level Message Transfer Using
Message Streams",
JOURNAL=cnis,
VOLUME=19,
NUMBER=2,
PAGES="79-94",
YEAR=1990,
KEYWORDS="Applications",
}

@ARTICLE{Gibs90:IEEE,
AUTHOR="R. W. Gibson",
TITLE="{IEEE} 802 Standards Efforts",
JOURNAL=cnis,
VOLUME=19,
NUMBER=2,
PAGES="95-104",
YEAR=1990,
KEYWORDS="LANs",
}

@ARTICLE{Ness90:Terminal,
AUTHOR="D. M. Nessett and G. Lee",
TITLE="Terminal Services in Heterogeneous Distributed Systems",
JOURNAL=cnis,
VOLUME=19,
NUMBER=2,
PAGES="105-128",
YEAR=1990,
KEYWORDS="Applications",
}

@ARTICLE{Brun90:Receiver,
AUTHOR="H. Bruneel and J. De Vriendt and C. Ysebaert",
TITLE="Receiver Buffer Behavior for the Selective-Repeat {ARQ}
Protocol",
JOURNAL=cnis,
VOLUME=19,
NUMBER=2,
PAGES="129-142",
YEAR=1990,
KEYWORDS="ARQ",
}

@ARTICLE{Mura90:Control,
AUTHOR="Kurenai Murakami and M. Katoh",
TITLE="Control Architecture for Next-Generation Communication Networks
Based on Distributed Databases",
JOURNAL=ieeejsac,
VOLUME=7,
NUMBER=3,
PAGES="418-423",
YEAR=1990,
}

@ARTICLE{Gbur90:Note,
AUTHOR="P. Gburzynski and P. Rudnicki",
TITLE="A Note on the Performance of {ENET} {II}",
JOURNAL=ieeejsac,
VOLUME=7,
NUMBER=3,
PAGES="424-426",
YEAR=1990,
}

@ARTICLE{Moll90:Comments,
AUTHOR="M. K. Molloy",
TITLE="Comments on {``A} Note on the Performance of {ENET} {II''}",
JOURNAL=ieeejsac,
VOLUME=7,
NUMBER=3,
PAGES="427-430",
YEAR=1990,
}

@ARTICLE{Gadr90:COS,
AUTHOR="J. Gadre and C. Rohrer and C. Summers and S. Symington",
TITLE="A {COS} Study of {OSI} Interoperability",
JOURNAL="Computer Standards and Interfaces",
VOLUME=9,
NUMBER=3,
PAGES="217-238",
YEAR=1990,
KEYWORDS="OSI",
}

@ARTICLE{Rama90:Terrestrial,
AUTHOR="Ravi Ramaswamy",
TITLE="Design of terrestrial/satellite computer communication networks
using Slotted {ALOHA} and {SS/TDMA} satellite systems",
JOURNAL="Space Communications - International Journal",
VOLUME=7,
PAGES="139-154",
YEAR=1990,
KEYWORDS="Network Design",
ABSTRACT="With the rate of growth of packet-switched computer
communication networks, the future networks are expected to comprise
hundreds or thousands of packet switching nodes. In view of the network
design and computational time requirements, ultimately the topological
design complexity of such large-scale computer communication networks
would grow exponentially with the size of the network. Therefore,
efficient procedures for the design and operation of large-scale
computer communication networks are required. In this paper, a
multi-level hierarchial approach is presented for the topological design
of a large-scale computer communication network using terrestrial and
Slotted ALOHA and Satellite Switched SS/TDMA satellite with terrestrial
or mixed-media systems. In this paper, for a given set of packet
switching nodal locations, the nodes are initially decomposed into an
M-level Hierarchial Clustering (MHC) structure Then, an M-level
Hierarchial Topological (MHT) structure is formed over the above MHC
structure. Finally, an M-level Hierarchical Routing (MHR) scheme is
presented for routing the messages between any source-destination
node-pair. Also, an expression for the average time delay of a message
in an M-level hierarchically clustered and topologically structured
terrestrial and satellite computer communication network is given.",
}

@MISC{Kong90:Computing,
AUTHOR="M. Kong and T. Dineen and P. J. Leach and E. Martin and N.
Mishkin and J. Pato and G. Wyant",
TITLE="Network Computing System Reference Manual",
PUBLISHER="Prentice Hall",
PAGES=416,
YEAR=1990,
}

@MISC{Misr90:Business,
AUTHOR="J. Misra and Byron Belitsos",
TITLE="Business Telecommunications: concepts, technologies and cases in
telematics",
PUBLISHER="Richard D. Irwin, Inc.",
ADDRESS="Homewood, Illinois",
PAGES=532,
YEAR=1990,
}

@BOOK{Stev90:UNIX,
AUTHOR="W. Richard Stevens",
TITLE="{UNIX} Network Programming",
ISBN="0-13-949876-1",
PUBLISHER="Prentice Hall",
YEAR=1990,
KEYWORDS="Unix; operating systems; network programming",
}

@MISC{Tane90:Amoeba,
AUTHOR="A. S. Tanenbaum and  others",
TITLE="The Amoeba Distributed Operating System",
YEAR=1990,
URL="ftp://midgard.ucsc.edu/",
}

@ARTICLE{Arno90:Economics,
AUTHOR="Richard Arnott and Andre de Palma and Robin Lindsey",
TITLE="Economics of a Bottleneck",
JOURNAL="Journal of Urban Economics",
VOLUME=27,
PAGES="111-130",
YEAR=1990,
}

@ARTICLE{MacK90:Optional,
AUTHOR="Jeffrey MacKie-Mason",
TITLE="Optional Time-of-Use Pricing Can be Pareto Superior or Pareto
Inferior",
JOURNAL="Economics Letters",
VOLUME=33,
YEAR=1990,
}

@TECHREPORT{Kahi90:Commericalization,
AUTHOR="Brian Kahin",
TITLE="Commericalization of the {Internet}",
INSTITUTION="JFK School, Harvard University",
NOTE="Report from Workshop held March 1--3, 1990",
YEAR=1990,
}

@ARTICLE{Mend90:Optimal,
AUTHOR="H. Mendelson and S. Whang",
TITLE="Optimal Incentive-Compatible Priority Pricing for the {M/M/1}
Queue",
JOURNAL=or,
VOLUME=38,
PAGES="870-883",
YEAR=1990,
}

@ARTICLE{Omur90:Novel,
AUTHOR="J. K. Omura",
TITLE="Novel Applications of Cryptography in Digital Communication",
JOURNAL=ieeecm,
VOLUME=28,
NUMBER=5,
PAGES="21-29",
YEAR=1990,
}

@ARTICLE{Kauc90:Aspects,
AUTHOR="E. Kaucher and Carsten Schulz-Rinne",
TITLE="Aspects of self-validating numerics in Banach spaces",
JOURNAL="Computer Arithmetic and Self-Validating Numerical Methods",
PAGES="269-299",
YEAR=1990,
KEYWORDS="Banach spaces; numerical mathematics; differential equation;
PDE",
ABSTRACT="Self-validating methods for two typical classes of partial
differential equations are discussed. In the first part implicit
formulas for solutions to systems of first order quasilinear PDEs with
initial and boundary conditions are developed. The goal is to find
expressions suitable for highly parallel computation, in connection with
E-verification. The achievable degree of parallelism depends essentially
on the type of the PDEs. The systems of PDEs are transformed into a
system of algebraic and/or ordinary differential equations which are
expanded in the space coordinates. Hence, the original problem may be
solved numerically or functionally in parallel for different space
coordinates. Furthermore, there exists powerful E-methods for algebraic
systems as well as for functoid systems and systems of ODEs. Therefore,
the E-verified numerical solution of the PDEs treated in this paper is
possible. In the second part, we discuss some iterative functoid
processes for the validated computation of parabolic PDEs with initial
and boundary conditions. Theoretical background are the W-principles
referred to in Walter which together with interval functoids deliver
so-called exclusion sets for solutions.",
}

@ARTICLE{Yang90:Integrated,
AUTHOR="Oliver Yang and J. W. Mark",
TITLE="Performance analysis of integrated services on a single server
system",
JOURNAL=pe,
VOLUME=11,
NUMBER=2,
PAGES="79-92",
YEAR=1990,
REFERENCES=15,
KEYWORDS="Queueing system; priority; correlation; analysis; vacation
time",
}

@BOOK{Knut90:TeX,
AUTHOR="D. E. Knuth",
TITLE="The TeX-Book (revised)",
PUBLISHER="Addison Wesley",
ADDRESS="Reading, Mass.",
YEAR=1990,
KEYWORDS="Text processing",
}

@ARTICLE{Uhl90:New,
AUTHOR="T. Uhl and B. Müller-Clostermann",
TITLE="Performance analysis of a new network access flow control method
in computer communication networks",
JOURNAL=ett,
VOLUME=1,
NUMBER=3,
PAGES="247-255",
YEAR=1990,
REFERENCES=24,
KEYWORDS="Packet switching; flow control; performance evaluation",
ANNOTE="A new flow control rule for the network access level is
introduced and its performance is investigated. The rule is based on
measurements of the temporal changes of the traffic intensity. The
admission of arriving local packets to a node is regulated dependent on
the variations of local and transit traffic and the loadin the
neighbouring nodes. The objective of the new rule is to maximize the
power for transit packets.",
}

@INPROCEEDINGS{Rath90:Policing,
AUTHOR="Erwin P. Rathgeb and T. H. Theimer",
TITLE="The policing function in {ATM} networks",
BOOKTITLE=iss,
ADDRESS="Stockholm",
YEAR=1990,
REFERENCES=8,
KEYWORDS="ATM; source policing; policing function; performance
evaluation",
}

@ARTICLE{Stre90:Moment,
AUTHOR="J. C. Strelen",
TITLE="Moment analysis for closed queuing networks and its linearizer",
JOURNAL=pe,
VOLUME=11,
NUMBER=2,
PAGES="127-142",
YEAR=1990,
REFERENCES=37,
KEYWORDS="Closed queueing network; queueing theory; MVA; multiclass
queueing network; approximation",
ANNOTE="Mean value analysis is further developed to become 'moment
analysis', a recursive evaluation scheme for moments of the queue
lengths and customers' sojourn times at FCFS centers.",
}

@ARTICLE{Bacc90:Execution,
AUTHOR="François Baccelli and Z. Liu",
TITLE="On the execution of parallel programs on multiprocessor systems -
a queuing theory approach",
JOURNAL=jacm,
VOLUME=37,
NUMBER=2,
PAGES="373-414",
YEAR=1990,
REFERENCES=44,
KEYWORDS="Multiprocessor system; queueing network; scheduling;
performance evaluation",
ABSTRACT="The new class of queueing models, called Synchronized Queueing
Networks, is proposed for evaluating the performance of multiprogrammed
and multitasked multiprocessor systems, where workloads consist of
parallel programs of similar structure and where the scheduling
discipline is FIFO.",
}

@ARTICLE{Rhee90:ATM,
AUTHOR="Jaap van der Rhee and Frederik Carel Schoute",
TITLE="{ATM} capacity modelling",
JOURNAL=ptr,
VOLUME=48,
NUMBER=2,
PAGES="24-32",
YEAR=1990,
REFERENCES=8,
KEYWORDS="ATM; traffic source model; connection admission control",
}

@TECHREPORT{Hubn90:Finite,
AUTHOR="F. Hübner",
TITLE="Analysis of a finite capacity asynchronous multiplexer with
periodic sources",
INSTITUTION="Universität Würzburg, Inst. für Imformatik",
ADDRESS="Würzburg, Germany",
VOLUME=14,
PAGES=13,
YEAR=1990,
REFERENCES=13,
KEYWORDS="ATM; queueing system; discrete time; traffic source model;
performance evaluation",
}

@ARTICLE{Lim90:Delay,
AUTHOR="Y. Lim and John Kobza",
TITLE="Analysis of a delay-dependent priority discipline in a integrated
multiclass traffic fast packet switch",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=5,
PAGES="659-665",
YEAR=1990,
REFERENCES=12,
KEYWORDS="Queueing system; HOL priority; single server",
ANNOTE="A dynamic packet transmission priority discipline,
head-of-the-line with priority jumps, is proposed and analyzed. It is
shown that it can make the tail probabilities for the different service
classes approximately the same.",
}

@ARTICLE{Bono90:Adaptive,
AUTHOR="F. Bonomi and A. Kumar",
TITLE="Adaptive optimal load balacing in a nonhomogeneous multiserver
system with a central job scheduler",
JOURNAL=ieeetc,
VOLUME="C-39",
NUMBER=10,
PAGES="1232-1250",
YEAR=1990,
REFERENCES=25,
KEYWORDS="Queueing system; multiserver; load balancing",
ANNOTE="Multiserver system with individual queues. Additionally a
general stream of jobs allocated by a job scheduler.",
}

@ARTICLE{Dasc90:Uberlaststrategien,
AUTHOR="B. Dasch",
TITLE="Überlaststrategien in der Paketvermittlung am Beispiel des
Systems {EWSP} / Congestion control strategies in packet switching
networks examined on the system {EWSP}",
JOURNAL=aeu,
VOLUME=44,
NUMBER=2,
PAGES="153-159",
YEAR=1990,
LANGUAGE="German",
REFERENCES=2,
KEYWORDS="Overload control; packet switching; switching system",
}

@TECHREPORT{Tran90:CRMA,
AUTHOR="P. Tran-Gia and R. Dittmann",
TITLE="Performance Analysis of the {CRMA-Protocol} in High-Speed
Networks",
INSTITUTION="Institute of Computer Science, University of Würzburg",
ADDRESS="Würzburg, Germany",
NUMBER=23,
PAGES=20,
YEAR=1990,
REFERENCES=13,
KEYWORDS="LAN; MAN; performance evaluation; protocol simulation; high
speed; G/G/1; M/G/1",
ANNOTE="In this paper a performance analysis of the CRMA (=cyclic
reservation multiple access) medium access protocol is presented. The
CRMA scheme is proposed as an access mechanism for high-speed LANs and
MANs. An approximate computational method is derived to obtain the
distribution functions of performance measures of interest like the
medium access delay in conjunction with G/G/1 queue with feedback and a
M/G/1 queue with server vacation.",
}

@ARTICLE{Boes90:Least,
AUTHOR="F. T. Boesch and A. Satyanarayana and C. L. Suffel",
TITLE="Least reliable networks and the reliability domination",
JOURNAL=ieeecom,
VOLUME=38,
NUMBER=11,
PAGES="2004-2009",
YEAR=1990,
KEYWORDS="Communication network; reliability; graph model; graph
theory",
ANNOTE="A well-know model in communication network reliability consists
of an undirected graph whose edges operate independently with the same
probability.",
}

@ARTICLE{Chem90:Integrated,
AUTHOR="Prosper Chemouil and J. Filipiak",
TITLE="Integrated network management and control",
JOURNAL=cnis,
VOLUME=20,
NUMBER="1-5",
PAGES="143-153",
YEAR=1990,
KEYWORDS="Circuit switching; network management; routing; congestion
control",
ANNOTE="Circuit switched telephone networks start to be used as provide
rs of transport services for intelligent networks with ISDN
capabilities. From the traffic point of view this situation is quitenew.
Traffic profiles in telephone networks are well predictable so that the
network can be dimensioned at the design stage.",
}

@ARTICLE{Chen90:Noncoherently,
AUTHOR="Chi-Ming Chen",
TITLE="Performance analysis of a noncoherently combined large aperture
optical heterodyne receiver",
JOURNAL=ieeecom,
VOLUME=38,
NUMBER=7,
PAGES="1013-1021",
YEAR=1990,
KEYWORDS="Communication system; performance evaluation",
ANNOTE="The performance of a noncoherently combined, multiplemirror
heterodyne receiver is analyzed. In the absence of atmospheric
turbulence, the performance of the noncoherently combined receiver
isshown to be inferior to that of a monolithic, diffraction-limi ted
receiver with equivalent aperture area. When atmospheric turbulence is
taken into consideration, however, the efficiency of a monolithie
aperture heterodyne receiver is limited .",
}

@ARTICLE{Colo90:Asynchronous,
AUTHOR="G. Colombo and C. Scarati and F. Settimo",
TITLE="Asynchronous control algorithm for increasing the efficiency of
three-stage connecting networks for multipoint services",
JOURNAL=ieeecom,
VOLUME=38,
NUMBER=6,
PAGES="898-905",
YEAR=1990,
KEYWORDS="Satellite radio; rearrangement; blocking; routing; multipoint
connection",
ANNOTE="This paper studies the problem of designing low complexity
control algoreithms for controlling three-stage connecting networks with
the objective of improving system performance, namely, blocking
probability. The chosen approach is based on the theory of connecting
networks and makes use of rearrangement algorithms. These algorithms are
applicable to a number of environments, three of which are multipoint
connections.",
}

@ARTICLE{Dall90:K,
AUTHOR="W. J. Dally",
TITLE="Performance analysis of $k$-ary $n$-cube interconnection
networks",
JOURNAL=ieeetc,
VOLUME="C-39",
PAGES="775-785",
YEAR=1990,
KEYWORDS="Interconnection network; performance evaluation",
ANNOTE="This paper analyzes communication networks of varying dimension
under the assumption of constant wire bisection. Expressions for the
latency, average case throughput, and hot-spot throughput of $k$-ary
n-cube networks with constant bisection are derived that agree closely
with experimental measurements. It is shown that low-dimensional
networks have lower latency and higher hot-spottroughput than
high-dimensional networks with the same bisection",
}

@ARTICLE{Dand90:Hierarchical,
AUTHOR="S. Dandamudi and D. L. Eager",
TITLE="Hierarchical Interconnection Networks for Multicomputer Systems",
JOURNAL=ieeetc,
VOLUME="C-39",
PAGES="786-797",
YEAR=1990,
KEYWORDS="Interconnection network",
ANNOTE="This paper proposes the use of hierarchical interconnection
networks to meet both these requirements. A performance analysis of a
class of hierarchical interconnection networks is presented. This
analysis includes both static analysis and queueing analy sis. In both
cases, the hierarchical networks are shown to have better cost-benefit
ratios. The queueing analysis is also validated by several simulation
experiments.",
}

@ARTICLE{Good90:Cellular,
AUTHOR="David J. Goodman",
TITLE="Cellular packet communications",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=8,
PAGES="1272-1280",
YEAR=1990,
KEYWORDS="Communication system; packet radio",
ANNOTE="Celluar mobile radio and residential cordless telephones are
twonew communication techniques with repidly growing public acceptance.
Present products and services use first-generation technology based on
analog voice transmission. Second-generation equipment, conforming to at
least five different sets of standards, is on the drawing boards. Based
on digital speech transmission.",
}

@ARTICLE{Haas90:Blazenet,
AUTHOR="Z. Haas and D. R. Cheriton",
TITLE="Blazenet: A packet-switched wide-are network with photonic data
path",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=6,
PAGES="818-829",
YEAR=1990,
KEYWORDS="WAN; packet switching; optical switching",
ANNOTE="High-performance wide-area networks area required to interconn
ect clusters of computers connected by local area and metropolitan area
networks. Optical fiber technology provides long distance channels in
the multigigabit per second range. The challenge is to provide switching
nodes that handle these data rates with minimum delay, and at reasonable
cost.",
}

@ARTICLE{Hage90:Rate,
AUTHOR="C. E. Sundberg",
TITLE="The performance of rate - compatible punctured convolutional
codesfor digital mobile radio",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=7,
PAGES="966-980",
YEAR=1990,
KEYWORDS="Mobile radio; coding theory; performance evaluation",
ANNOTE="In many source coding schemes, the effect of a channel error
varies significantly from one bit to another. Hence, to make the best
available use of the limited channel coding redudancy, unequ al error
protection is needed. In this paper, we study the unequal error
protection capabilities of convolutional codes belongi ng to the family
of rate-compatible punctured convolutional cod es.",
}

@ARTICLE{Jose90:Calculation,
AUTHOR="K. Joseph",
TITLE="Calculation of message length transition probabilities in selecti
ve reject {ALOHA} channels",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=8,
PAGES="1128-1132",
YEAR=1990,
KEYWORDS="Communication system; ALOHA; Poisson distribution; radio
channel; throughput analysis",
ANNOTE="A method is described for the exact calculation of message leng
th transition probabilities in asynchronous selective reject ALOHA,
channels with Poisson message arrivals. The formulas derivedare used for
exact calculation of the throughput characteristicsof example SREJ-ALOHA
channels which were previously analyzed using bounds or approximate
methode.",
}

@ARTICLE{Kall90:Type,
AUTHOR="Samir Kallel",
TITLE="Analysis of a type {II} hybrid {ARQ} scheme with code combining",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=8,
PAGES="1133-1137",
YEAR=1990,
KEYWORDS="Communication protocol; ARQ; coding theory; performance
evaluation",
ANNOTE="In this paper, we present an analysis of the selective-repeat
type II hybrid ARQ scheme, using convolutional coding and exploiting
code combining. With code combining, at successive decoding attempts for
a data packet, the decoder for error correction operates on a
combination of all received sequences for that packet, rather than only
on the two most recent received ones as in theconventional type II
hybrid ARQ scheme.",
}

@BOOK{Kanb90:ISDN,
AUTHOR="A. Kanbach and A. Körber",
TITLE="{ISDN} - Die Technik",
PUBLISHER="Hüthig Buch Verlag GmbH",
ADDRESS="Heidelberg",
PAGES="1-276",
YEAR=1990,
LANGUAGE="German",
KEYWORDS="ISDN; survey",
ANNOTE="- ISDN - das universelle Fernmeldenetz - Protokolle als
Grundlage der Zeichengabe - Bitübertragungsschicht -
Datensicherungsschicht - Realisierung von Dienstmerkmalen - Aufbau von
ISDN-Endsystemen - ISDN-spezifische Hardware-Komponenten",
}

@ARTICLE{Kash90:Flexible,
AUTHOR="A. Kashper",
TITLE="Introduction of flexible routing for international networks",
JOURNAL=cnis,
VOLUME=20,
NUMBER="1-5",
PAGES="137-141",
YEAR=1990,
KEYWORDS="Communication network; routing; cost function",
ANNOTE="This paper summarizes a deployment strategy for flexible
routingin international networks. In an earlier paper, we proposed to
define flexible routing for international networks based on DNR call
processing principles, including originating call control, common
channel signaling and crankback capabilities, and investigated the
problem of dimensioning multiservice bilateral networ ks assuming that
flexible routing is introduced by carriers.",
}

@ARTICLE{Kuro90:Stack,
AUTHOR="James F. Kurose and A. K. Shrivastava and Donald F. Towsley",
TITLE="Stack algorithms for random multiple-access networks in the prese
nce of asymmetric feedback",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=9,
PAGES="1308-1313",
YEAR=1990,
KEYWORDS="Random access; feedback; throughput analysis; delay analysis",
ANNOTE="We propose several possible modifications to the basic stack
algorithm for such environments and quantitatively examine the
performance of the variosus alternatives. An approximate Markov cha in
model is developed to analytically study the time delay vers us
throughput performance of the various alternatives and the analytic
results are validated through simulation. Representative performance
results are given for the alternative stac algoriths",
}

@ARTICLE{Lam90:Time,
AUTHOR="A. Lam and Dilip Sarwate",
TITLE="Time-hopping and frequency-hopping multiple-access packet
communications",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=6,
PAGES="875-888",
YEAR=1990,
KEYWORDS="Communication system; multiple access; collision detection;
throughput analysis",
ANNOTE="Time-hooping and frequency-hooping multiple-access packet
communication systems are proposed and investigated. In TH/FHMA
commmunication systems, a message packet is encoded into serveral
subpackets via a Reed-Solomon error correcting code. The subpackets are
transmitted over the channel using timehopping and frequency and
frequency-hooping patterns.",
}

@BOOK{Lehn90:Wissensbasierte,
AUTHOR="K. Lehner",
TITLE="Wissensbasierte Lehrsysteme",
ISBN="3-486-21377-6",
PUBLISHER="R. Oldenbourg Verlag",
ADDRESS="München",
PAGES="1-173",
YEAR=1990,
LANGUAGE="German",
KEYWORDS="Expert system",
ANNOTE="- Expertensysteme, intelligente Lehrprogramme, Hilfsmittel -
GUIDON - Recovery Boiler Tutor - NUGGET - GIST - Bewertung, Extrem-und
Problemfälle",
}

@ARTICLE{Levy90:Polling,
AUTHOR="H. M. Levy and M. Sidi",
TITLE="Polling systems: applications, modeling, and optimization",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=10,
PAGES="1750-1760",
YEAR=1990,
KEYWORDS="Polling; model; optimization; ARQ",
ANNOTE="Polling models have been extensively studied in the two decades.
As a result, a large body of knowledge has been built in this area and
they became a powerful tool for the performance analysis of a wide
variety of important applications. The goal of this paper is to expose
the application oriented reader to the modelingand analysis capabilities
of polling systems. We review the state-of-the-art in this field,
focusing on applications.",
}

@ARTICLE{Loo90:Digital,
AUTHOR="C. Loo",
TITLE="Digital transmission through a land mobile satellite channel",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=5,
PAGES="693-697",
YEAR=1990,
KEYWORDS="Satellite radio; mobile radio; error probability; performance
evaluation; throughput analysis",
ANNOTE="This paper describes an analytical derivation of the
probabilityof bit error of noncoherent FSK and coherent PSK signals
transmitted through a land mobile satellite channel. The channel
characteristics used in the analysis are based on a recently developed
model which includes the combined effects of fading and shodowing.
Analitical expression for the probability of bit error of FSK and CPSK
signals are obtained.",
}

@ARTICLE{Lu90:Self,
AUTHOR="M. Lu and D. Zhang and T. Murata",
TITLE="Analysis of Self-Stabilizing Clock Synchronization by Means of
Stochastic Petri Nets",
JOURNAL=ieeetc,
VOLUME="C-39",
PAGES="597-604",
YEAR=1990,
KEYWORDS="SPN; stochastic Petri net; synchronization",
ANNOTE="This paper develops a model for analyzing the FCS system of the
type supported by a statistical selfdiagnosis. A stochastic Pe tri net
model is constructed to derive the self-stability measures of such FCS
systems. An example is given to demonstrate the entire modeling and
analyzing procedure. The mapping from SPN mod el to Markov model shown
in the example can be automated by usi ng an SPN model is an excellent
tool in obtaining self.",
}

@ARTICLE{Magl90:Routing,
AUTHOR="B. Maglaris and R. R. Boorstyn and Shivendra Panwar and T.
Spirtos and John O'Reilly",
TITLE="Routing of voice and data in burst-switched networks",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=6,
PAGES="889-897",
YEAR=1990,
KEYWORDS="ISDN; TDM; time division multiplex; voice/data integration;
routing; burst switching",
ANNOTE="This paper addresses the static and centralized routing of voice
and data traffic in burst switched networks. Since voice and data have
markedly different traffic characteristics and performance requirements,
their interaction in a unified switching and transmission structure
greatly impacts their performance. Voice performance in a burst switched
network is primarily measured by end-to-end freeze-out while
figures-of-merit for data include.",
}

@ARTICLE{Mart90:ARQ,
AUTHOR="J. Martins and J. de Carvalho",
TITLE="{ARQ} protocols with adaptive block size perform better over a
wide range of bit error rates",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=6,
PAGES="737-739",
YEAR=1990,
KEYWORDS="Communication protocol; ARQ; error rate; throughput analysis",
ANNOTE="The throughput of conventionalARQ protocol, such as the
stop-and-wait, go-back-N, and selective repeat, can be improved by
dynamically adapting the protocol block length so that it approaches the
optimum value for varying channel bit error rates. A very simple
algorithm to implement such an adaptive scheme is presentedhere. The
algorithm assumes a known block error rate, estimates the bit error
rate.",
}

@ARTICLE{Morg90:Mean,
AUTHOR="Samuel P. Morgan and C.-C. Lo",
TITLE="Mean message delays for two {packet-FIFO} queueing disciplines",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=6,
PAGES="744-746",
YEAR=1990,
KEYWORDS="Delay analysis; queueing discipline; queueing system;
priority; message switching",
ANNOTE="We derive expressions for the mean message delay, as a function
of message length, when data messages of different lengths arrive
asynchronously at a trunk and are divided, as they come in, into packets
of some maximum length. The packet of different messages are
intermingled and are put onto the trunk either from a single
firstin-first-out queue, or from a high-priority and a low-priority
queue for single-packet and multiple-packet messages.",
}

@ARTICLE{Sato90:Broad,
AUTHOR="K. Sato and S. Ohta and Ikuo Tokizawa",
TITLE="Broad-band {ATM} network architecture based on virtual paths",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=8,
PAGES="1212-1222",
YEAR=1990,
KEYWORDS="Communication system; ATM; broadband; performance evaluation",
ANNOTE="This paper explores broad-band transport techniques and network
architectures based on the virtual path concept. ATM techniques, when
coupled with recent technological innovation, are expected to pave the
vay for future universal transport networks. The multiplexing and
transport benefits of the ATM have a great impacton network
architecture. The virtual path concept, which exploi ts the ATM's
capabilities.",
}

@BOOK{Savo90:Grundlagen,
AUTHOR="S. E. Savory",
TITLE="Grundlagen von Expertensystemen",
ISBN="3-486-21524-8",
PUBLISHER="R. Oldenbourg Verlag",
ADDRESS="München",
PAGES="1-308",
YEAR=1990,
LANGUAGE="German",
KEYWORDS="Expert system",
ANNOTE="- was sind Expertensysteme, und wozu sind sie gut - ICE -
notwendige theoretische Hintergrundkenntnisse - programieren in Logik -
Erstellung eines regelbasierten Systems in zehn Schritten - eine
alternative Wissensdarstellung - eine Perspektive für Wissenserwerb",
}

@ARTICLE{Stav90:Star,
AUTHOR="I. Stavrakakis and D. Kazakos",
TITLE="Performance analysis of a star topology of interconnected
networksunder 2nd-order Markov network output processes",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=10,
PAGES="1724-1731",
YEAR=1990,
KEYWORDS="Random access; interconnection network; performance
evaluation; star network; output process",
ANNOTE="In this paper, the ideal of approximating the output process of
slotted multiuser random access communication networks by a 2nd-order
Markov process is introduced. A method is developed to analytically
calculate the parameters of the approximate process for a class of
random access algorithms. The method is illustrated by considering a
specific random access algorithm from that class.",
}

@ARTICLE{Swid90:Functional,
AUTHOR="J. Swiderski",
TITLE="Functional dualism of local controllers with respect to
congestioncontrol and store- and-forward deadlock prevention in packet
networks",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=10,
PAGES="1732-1739",
YEAR=1990,
KEYWORDS="Packet switching; deadlock; congestion control",
ANNOTE="The problem of functional dualism of local flow controllers
usedin packet networks is investgated. At first, a method for examining
networks employing local congestion controllers for exposureto
store-and-forward deadlocks is presented. Then a simple analytical
approach to performance evaluation of hop-dependent controllers
preventing store-and-forward deadlocks is described. Numerical examples
given show that in some cases typical local",
}

@ARTICLE{Tsai90:Token,
AUTHOR="Z. h. Tsai and I. Rubin",
TITLE="Performance of token schemes supporting delay - constrained
priority traffic streams",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=11,
PAGES="1994-2003",
YEAR=1990,
KEYWORDS="Token ring; LAN; IEEE 802.5; performance evaluation",
ANNOTE={A symmetric priority-based token network is considered Messages
are divided into two priority classes. High-priority messages are
assumed to require tight delay constraints. As a result, each station is
allowed to establish, at any time, at most a single "real-time"
high-priority access connection. High-priority messages are guaranteed
access onto the channel within a prescribed limited period.},
}

@ARTICLE{Tsan90:Algorithms,
AUTHOR="D. Tsang and Keith W. Ross",
TITLE="Algorithms to determine exact blocking probabilities for
multiratetree networks",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=8,
PAGES="1266-1271",
YEAR=1990,
KEYWORDS="Circuit switching; blocking; tree network; performance
evaluation",
ANNOTE="We consider a circuit-switched network consisting of
multiple-access links connected to a common link. Each call requires
circuits on one access link and on the common link. The network supports
multiple classes of class specifies a bandwidth requirement, an arrival
rate, and a holding-time distribution. Based on a product-form solution
for these networks, four algorithms are developed to determine the exact
blocking probability for each.",
}

@BOOK{Wohl90:Planung1,
AUTHOR="G. Wöhlbier",
TITLE="Planung von Telekommunikationsnetzen, Bd. I",
ISBN="3-7685-1489-7",
PUBLISHER="R. v. Decker's Verlag, G. Schenck",
ADDRESS="Heidelberg",
PAGES="1-420",
YEAR=1990,
LANGUAGE="German",
KEYWORDS="Network planning; routing",
ANNOTE="1. Der Produktionsprozeß Fernmeldenetz und dessen Prognosen 2.
Die verkehrstechnische Gestaltung und Leitungsbedarfsvorhersa ge für das
Fernsprechnetz/ISDN 3. Die Planung des Linien- und Leitungsnetzes",
}

@ARTICLE{Wolf90:Optimum,
AUTHOR="R. Wolfe and M. C. Jeruchim and P. M. Hahn",
TITLE="On optimum and suboptimum biasing procedures for importance sampl
ing in communication simulation",
JOURNAL=ieeecom,
VOLUME="COM-38",
NUMBER=5,
PAGES="639-647",
YEAR=1990,
KEYWORDS="Performance evaluation; simulation; time series analysis",
ANNOTE="Importance sampling can significantly reduce simulation run
timein estimating the bit error probability of digital systems if a
suitable procedure is used. In this paper, we consider various aspects
of optimum and suboptimum biasing procedures. We show that the strict
optimum does not lead to a realistic procedure. Weexamine the subop
timal variations that are reasonably implementable.",
}

@ARTICLE{Beck90:Prospective,
AUTHOR="D. Becker and H. F. Savary and H. Verhille",
TITLE="Prospective Views on the Alcatel Broadband Architecture",
JOURNAL=ec,
ADDRESS="Paris",
VOLUME=64,
NUMBER=2,
PAGES="147-155",
YEAR=1990,
REFERENCES=2,
KEYWORDS="Switching system; architecture",
}

@ARTICLE{Berm90:Service,
AUTHOR="L. Bermejo and P. Parmentier and G. H. Petit",
TITLE="Service Characteristics and Traffic Models in a Broadband
{ISDN}",
JOURNAL=ec,
ADDRESS="Paris",
VOLUME=64,
NUMBER=2,
PAGES="132-138",
YEAR=1990,
REFERENCES=8,
KEYWORDS="ATM; traffic source model; traffic mix; connection admission
control",
}

@ARTICLE{Bott90:Alcatel,
AUTHOR="D. Böttle and M. A. Henrion",
TITLE="Alcatel {ATM} Switch Fabric and Its Properties",
JOURNAL=ec,
ADDRESS="Paris",
VOLUME=64,
NUMBER=2,
PAGES="156-165",
YEAR=1990,
REFERENCES=10,
KEYWORDS="Switching system; architecture; performance evaluation",
}

@ARTICLE{Bott90:Flexibles,
AUTHOR="D. Böttle and G. Eilenberger and K. J. Schrodi",
TITLE="Flexibles {ATM-Koppelfeldkonzept} für die
Breitbandkommunikation",
JOURNAL=ntz,
VOLUME=43,
NUMBER=11,
PAGES="810-815",
YEAR=1990,
LANGUAGE="German",
REFERENCES=6,
KEYWORDS="ATM; switching system; architecture",
ANNOTE="Entwicklung, Herstellung und Installation von
Vermittlungssyste-men mit ATM Koppelfeldern erfordern hohe Investitionen
bei den Herstellern und Betreibern dieser Systeme. Folglich sind die
Konzepte dieser Systeme so zu wählen, daß auch zukünftige, heutenoch
unbekannte Anforderungen durch relativ einfache Anpassungenkostengünstig
zu realisieren sind. Ein derartiges zukunftssiche-res Koppelfeldkonzept
wurde im Alcatel-Firmenverb. entwickelt.",
}

@ARTICLE{Coop90:Reasonable,
AUTHOR="C. S. Cooper and Kun I. Park",
TITLE="A Reasonable Solution to the Broadband Congestion Control
Problem",
JOURNAL="International Journal of Digital and Analog Communication
Systems",
VOLUME=3,
NUMBER=2,
PAGES="103-115",
YEAR=1990,
REFERENCES=16,
KEYWORDS="ATM; policing function; connection admission control;
priority",
}

@ARTICLE{DAgo90:Universal,
AUTHOR="S. D'Agostino and J. David and R. Heiß and Willem Verbiest",
TITLE="Universal {ATM} Video Coding Architecture",
JOURNAL=ec,
ADDRESS="Paris",
VOLUME=64,
NUMBER=2,
PAGES="186-193",
YEAR=1990,
REFERENCES=7,
KEYWORDS="ATM; video coding",
}

@ARTICLE{Day90:Australian,
AUTHOR="A. M. Day and D. M. Dorman",
TITLE="Towards an Australian Broadband Network Infrastructure",
JOURNAL="Telecommunication Journal of Australia",
VOLUME=40,
NUMBER=2,
PAGES="3-14",
YEAR=1990,
REFERENCES=11,
KEYWORDS="ATM; broadband; MAN; standardization; survey",
ANNOTE="This paper provides a broad perspective on the drives, impacts
of and evolution to broadband service support in Australia in the decade
ahead. It concludes that the 1990s will provide substantial uptake of
corporate broadband facilities but that wide-scale deployment of
residential switched broadband services willextend beyond the 1990s.",
}

@ARTICLE{Eckb90:Approach,
AUTHOR="A. E. Eckberg and Daniel Luan and David M. Lucantoni",
TITLE="An Approach to Controlling Congestion in {ATM} Networks",
JOURNAL="International Journal of Digital and Analog Communication
Systems",
VOLUME=3,
NUMBER=2,
PAGES="199-209",
YEAR=1990,
REFERENCES=18,
KEYWORDS="ATM; congestion control; policing function; leaky bucket; flow
control; error control",
}

@ARTICLE{Hira90:Traffic,
AUTHOR="Miki Hirano and Nayoa Watanabe",
TITLE="Traffic Characteristics and a Congestion Control Scheme for an
{ATMNetwork}",
JOURNAL="International Journal of Digital and Analog Communication
Systems",
VOLUME=3,
NUMBER=2,
PAGES="211-217",
YEAR=1990,
REFERENCES=6,
KEYWORDS="ATM; congestion control; bursty traffic; analysis; statistical
multiplexer; performance evaluation; packet voice; policing function;
leaky bucket",
}

@ARTICLE{Holz90:ATM,
AUTHOR="J. Hölzle and W. König and R. Rheinschmitt",
TITLE="{ATM-Teilnehmernetze} für integrierte Breitband-Kommunikation",
JOURNAL=ntz,
VOLUME=43,
NUMBER=11,
PAGES="802-809",
YEAR=1990,
LANGUAGE="German",
KEYWORDS="ATM; CPN; customer premises network; architecture",
ANNOTE="Mit der Einführung des BISDN wird sich für den Teilnehmer
einneues und breites Spektrum für neue Anwendungen und Endgeräteder
Telekommunikation eröffnen. Die Anwendung des Asynchronen
Übermittlungsverfahrens (ATM) und die Berücksichtigung der
An-forderungen an künftige Netze führen zu neuen Strukturen
fürbreitbandige Teilnehmernetze sowohl im Heimbereich als auch im
Büro-bereich.",
}

@ARTICLE{Hui90:Congestion,
AUTHOR="Joseph Hui",
TITLE="A Congestion Measure for Call Admission and Traffic Engineering
for Multi-Layer Multi-Rate Traffic",
JOURNAL="International Journal of Digital and Analog Communication
Systems",
VOLUME=3,
NUMBER=2,
PAGES="127-135",
YEAR=1990,
REFERENCES=14,
KEYWORDS="ATM; routing; connection admission control",
}

@ARTICLE{Jabb90:Connection,
AUTHOR="B. Jabbari",
TITLE="A Connection Control Strategy for Bursty Sources in Broadband
Packet Networks",
JOURNAL="International Journal of Digital and Analog Communication
Systems",
VOLUME=3,
NUMBER=4,
PAGES="351-356",
YEAR=1990,
REFERENCES=12,
KEYWORDS="ATM; connection admission control; loss system; performance
evaluation",
ABSTRACT="This paper proposes an admission strategy for
connection-oriented services at the access node of a broadband
integrated packet network based on ATM.  Based on an estimate of the
probability of cell loss and in the absence of buffering, we determine
the number of sources from different classes of bursty traffic which can
be accepted.  The parameters which are used to describe the traffic
sources are average and peak bit rate.",
}

@ARTICLE{Kosi90:ATM,
AUTHOR="R. Kositpaiboon and G. Woodruff and Philip Richards",
TITLE="{ATM} Traffic Control for Guaranteed Performance",
JOURNAL="International Journal of Digital and Analog Communication
Systems",
VOLUME=2,
NUMBER=3,
PAGES="117-125",
YEAR=1990,
REFERENCES=15,
KEYWORDS="ATM; statistical multiplexing; connection admission control",
}

@ARTICLE{Kowa90:Source,
AUTHOR="W. Kowalk",
TITLE="Source Policing in {ATD} Networks",
JOURNAL="International Journal of Digital and Analog Communication
Systems",
VOLUME=3,
NUMBER=3,
PAGES="267-276",
YEAR=1990,
REFERENCES=10,
KEYWORDS="ATM; policing function; formal technique",
ANNOTE="Different aspects of ATD are considered, particularly source
po-licing. This notion is defined, some source policing strategies
discussed in the literature are surveyed, including the control actions
required for network protection. The result of these studies is that
only one of the source policing mechanisms analysed is suitable to
protect ATD networks sufficiently.",
}

@ARTICLE{Laza90:Architecture,
AUTHOR="Aurel A. Lazar and A. Temple and R. Gidron",
TITLE="An Architecture for Integrated Networks that Guarantees Quality
ofService",
JOURNAL="International Journal of Digital and Analog Communication
Systems",
VOLUME=3,
NUMBER=2,
PAGES="229-238",
YEAR=1990,
REFERENCES=22,
KEYWORDS="ATM; congestion control; bandwidth allocation; switching
system",
}

@INPROCEEDINGS{Mels90:Neural,
AUTHOR="P. J. W. Melsa and J. B. Kenney and C. E. Rohrs",
TITLE="A Neural Network Solution for Call Routing with Preferential Call
Placement",
BOOKTITLE=globecom,
ADDRESS="San Diego, California",
PAGES="1377-1381",
YEAR=1990,
REFERENCES=8,
KEYWORDS="Neural network; path control; routing; switching network",
ANNOTE="This paper presents a neural network solution to the problem of
routing calls through a three stage interconnection network. Theneural
network solution has been shown to select an open path through the
network if one exists. The solution uses a Hopfield network with a
binary threshold rather than a sigmoidal function. An important feature
of this solution is that the weights of the neural network are fixed for
all time, and thus are independent",
}

@ARTICLE{Nies90:Leaky,
AUTHOR="G. Niestegge",
TITLE="The 'Leaky Bucket' Policing Method in the {ATM} (Asynchronous
Transfer Mode) Network",
JOURNAL="International Journal of Digital and Analog Communication
Systems",
VOLUME=3,
NUMBER=2,
PAGES="187-197",
YEAR=1990,
REFERENCES=7,
KEYWORDS="ATM; policing function; leaky bucket",
}

@ARTICLE{Palm90:Experimental,
AUTHOR="R. Palmer",
TITLE="An Experimental {ATM} Switch for {BISDN} Studies",
JOURNAL="International Journal of Digital and Analog Communication
Systems",
VOLUME=3,
NUMBER=4,
PAGES="341-349",
YEAR=1990,
REFERENCES=14,
KEYWORDS="ATM; switching network; Batcher-Banyan",
ABSTRACT="This paper describes the architecture, functionality and
performance of an experimental ATM switch being developed at the Telecom
Australia Research Laboratories as part of its investigations into the
broadband ISDN.  The proposed switch architecture consists of parallel
omega networks preceeded by a Batcher bitonic sorting network.  The
switching fabric has no internal cell buffering.  Cell buffering is
provided only at the outputs.",
}

@ARTICLE{Patt90:ATM,
AUTHOR="Achille Pattavina",
TITLE="Performance Evaluation of {ATM} Switches with Input and Output
Queueing",
JOURNAL="International Journal of Digital and Analog Communication
Systems",
VOLUME=3,
NUMBER=3,
PAGES="277-286",
YEAR=1990,
REFERENCES=18,
KEYWORDS="ATM; switching network; input buffer; output buffer;
performance evaluation; analysis",
ANNOTE="This paper analyses the performance of an ATM switch, in which
packet storage capability is provided both at inputs and outputsof the
switching fabric which is internally nonblocking. The switch model
adopted here jointly adopts internal rate speedup and output channel
grouping. The switch performance, for different speed-ups and channel
groupings, is evaluated in terms of maximum throughput, packet average
delay and loss rate.",
}

@ARTICLE{Petr90:Priority,
AUTHOR="David Petr and Victor S. Frost",
TITLE="Priority Cell Discarding for Overload Control in {BISDN/ATM}
Networks: An Analysis Framework",
JOURNAL="International Journal of Digital and Analog Communication
Systems",
VOLUME=3,
NUMBER=2,
PAGES="219-277",
YEAR=1990,
REFERENCES=18,
KEYWORDS="ATM; congestion control; priority; analysis",
}

@ARTICLE{Schn90:Wenn,
AUTHOR="H. Schneider",
TITLE="Wenn mit {ATM} zur Kommunikation zusätzlich das Bild kommt
\ldot",
JOURNAL=ntz,
VOLUME=43,
NUMBER=11,
PAGES="794-800",
YEAR=1990,
LANGUAGE="German",
REFERENCES=2,
KEYWORDS="ATM; survey",
ABSTRACT="Hochintegrierte und höchstintegrierte Mikroelektronikbausteine
sowie dieLichtwellenleitertechnik machen es möglich, dem Teilnehmer
aufwirtschaftliche Weise neben dem Dienst Telefonieren
zusätzlicheLeistungsmerkmale und neue Dienste anzubieten.  Dabei kann
auch dem Bedürfnis, zusätzlich zur Sprachkommunikation Texte, Datenund
Bilder mit dem Partner auszutauschen, entgegengekommen werden.  Eine
besondere Rolle wird dabei die ATM-Technik spielen.",
}

@INPROCEEDINGS{Schw90:VLSI,
AUTHOR="D. B. Schwartz and V. K. Samalam",
TITLE="{VLSI} for {ATM} Network Management",
BOOKTITLE=globecom,
ADDRESS="San Diego, California",
PAGES="1387-1392",
YEAR=1990,
REFERENCES=21,
KEYWORDS="ATM; congestion control; traffic measurement; traffic
prediction; neural network",
ANNOTE="In a broadband ATM network, the ratio of propagation delay to
cell transmission time makes traditional end-to-end flow controland
congestion control techniques unsuitable. Instead, the flow controller
will have to reside at the entry point to the networkand use its
knowledge of the source to make control decisions. To maintain the
flexibility which is ATM's most attractive property, such controllers
will have to use adaptive source model.",
}

@ARTICLE{Scot90:Getting,
AUTHOR="C. J. Scott and M. J. Biggar and D. M. Dorman",
TITLE="Getting the Picture - Integrated Video Services in {BISDN}",
JOURNAL="Telecommunication Journal of Australia",
VOLUME=40,
NUMBER=2,
PAGES="21-25",
YEAR=1990,
KEYWORDS="ATM; BISDN; video service; service integration",
ANNOTE="Services are the life blood of communication networks, they are
the reason such networks exist and the final arbiter of their success.
The success of broadband communications will be closelylinked to the
acceptability and applicability of the services offered.",
}

@INPROCEEDINGS{Taka90:Experimental,
AUTHOR="Yutaka Takahashi and K. Ando and H. Inoue and E. Amada",
TITLE="An Experimental Photonic {ATM} Switching System Using an {InP}
Semiconductor Optical Switch",
BOOKTITLE=globecom,
ADDRESS="San Diego, California",
PAGES="1586-1589",
YEAR=1990,
REFERENCES=5,
KEYWORDS="ATM; optical switching; switching system; architecture",
ANNOTE="A prototype of a photonic ATM switching system is fabricated
andevaluated. It uses a space division type optical switch array for
switching optical signals. Each of its highways contains two1.2 Gb/s
signals (wavelength division multiplexed) and it has 4x4 optical switch
ports. It can realize a total capacity of 9.6Gb/s. An optical signal
format and retiming architecture for bitand cell synchronization are
proposed. Measurements of basic",
}

@INPROCEEDINGS{Thyl90:Switch,
AUTHOR="L. Thylen and P. Granestrand",
TITLE="Switch Arrays for Photonic Switching: Status Review and
Prospects",
BOOKTITLE=globecom,
ADDRESS="San Diego, California",
PAGES="1296-1300",
YEAR=1990,
REFERENCES=13,
KEYWORDS="Optical switching; switching system",
ANNOTE="The purpose of this paper is to review the status and prospects
of LiNbO3 switch arrays in view of system requirements. An experimental
switching system is also desribed. Finally, the potential of
semiconductor devices with reference to recently reported results, is
briefly discussed.",
}

@ARTICLE{Tirt90:Layered,
AUTHOR="E. Tirtaatmadja and C. J. Scott",
TITLE="A Layered Modelling of {ATM,} {SDH} and {MAN} Technologies in
Broadband {ISDN}",
JOURNAL="Telecommunication Journal of Australia",
VOLUME=40,
NUMBER=2,
PAGES="15-20",
YEAR=1990,
KEYWORDS="ATM; MAN; SDH; synchronous digital hierarchy; broadband;
modeling",
ANNOTE="This paper considers the roles and relationships between three
major new technologies which will be key factors in the evolution of
BISDN: the Synchronous Digital Hierarchy (SDH), Metropo-litan Area
Networks (MAN) and Asynchronous Transfer Mode (ATM). A layered model is
proposed as the basis of analysis and comparison of the three
technologies. The model uses four layers to define network functions
above the physical transport media.",
}

@ARTICLE{Wall90:Connection,
AUTHOR="E. Wallmeier",
TITLE="A Connection Acceptance Algorithm for {ATM} Networks Based on
Mean and Peak Bit Rates",
JOURNAL="International Journal of Digital and Analog Communication
Systems",
VOLUME=3,
NUMBER=2,
PAGES="143-153",
YEAR=1990,
REFERENCES=16,
KEYWORDS="ATM; connection admission control",
}

@INPROCEEDINGS{Yama90:Experimental,
AUTHOR="M. Yamaguchi and T. Matsunaga and M. Okuno",
TITLE="Experimental Photonic Multimedia Switching System using
Integrated8x8 Silica-Based Guided-Wave Crossbar Switch",
BOOKTITLE=globecom,
ADDRESS="San Diego, California",
PAGES="1301-1305",
YEAR=1990,
REFERENCES=11,
KEYWORDS="Optical switching; switching system; crossbar; architecture",
ANNOTE="An experimental 8-line photonic space-division switching system
is demonstrated using a new 8x8 optical crossbar switch. This switch
consists of 112 switch elements monolithically integratedby silica-based
waveguid techniques. Average insertion loss of aswitch package board is
16.3 dB, and the ratio of signal to accumulated crosstalk averages 7.2
dB. Four types of connections: G4 fax, CSMA/CD lan, NTSC TV, and HD
video are successfully",
}

@INPROCEEDINGS{Youn90:Physical,
AUTHOR="K. C. Young and T. C. Banwell and Sheng Chen and R. C. others.
Estes",
TITLE="Physical design issues for very large {ATM} switching systems",
BOOKTITLE=globecom,
ADDRESS="San Diego, California",
PAGES="1590-1593",
YEAR=1990,
REFERENCES=3,
KEYWORDS="Broadband; switching system; physical design",
ANNOTE="In this paper we examine the physical design issues associated
with terabit-per-second switching and identify some limitations of
current technology. We propose a novel, three-dimensional structure that
alleviates some of the connectivity problems and we assess the power
delivery and thermal management requirementsof these large switching
systems.",
}

@TECHREPORT{Hui90xx:Switching,
AUTHOR="Joseph Hui",
TITLE="Switching Integrated Broadband Services by Sort-Banyan Networks",
INSTITUTION="Department of Electrical and Computer Engineering, Rutgers
University",
ADDRESS="Piscataway, New Jersey",
NUMBER="90-04",
PAGES=23,
YEAR=1990,
REFERENCES=18,
KEYWORDS="ATM; fast packet switching; switching network; architecture;
Batcher-Banyan; sorting network; self routing; input buffer",
URL="http://www.ece.rutgers.edu",
}

@INPROCEEDINGS{Ajmo90:Comparison,
AUTHOR="Marco {Ajmone Marsan} and F. Neri",
TITLE="Performance Comparison of four {MAC} Protocols for Integrated
{MANs}",
BOOKTITLE="ITS, International Telecomm Symposium",
ADDRESS="Rio de Janeiro",
PAGES="104-112",
YEAR=1990,
REFERENCES=13,
KEYWORDS="DQDB; FDDI-II; MAN; HSLAN; performance evaluation; simulation;
delay; throughput",
ANNOTE="The performance of four MAC sublayer protocols proposed for
applications in extended LANs and/or MANs integrating different types of
traffic are compared: EXPRESSNET, FASNET, QPSX/DQDB, FDDI-II.
Performance results in terms of of average and variance packet access
delay, channel utilization and percentage of packet loss due to lack of
buffers are obtained through simulation for severeal parameters.",
}

@INPROCEEDINGS{Grav90:Double,
AUTHOR="D. J. Graves",
TITLE="The Double-Slot Slotted Ring Protocol {(DSR)}",
BOOKTITLE="ITS, International Telecomm Symposium",
ADDRESS="Rio de Janeiro",
PAGES="238-242",
YEAR=1990,
REFERENCES=9,
KEYWORDS="Protocol; HSLAN; MAN; slotted ring; reservation; fairness",
ANNOTE="The paper describes the 'double-slot' slotted ring protocol
which combines a multilevel priority and fairness guarantee mechanism
over a destination release slotted ring. The protocl shall ensure fair
bandwidth allocation within each priority level througha distributed
reservation algorithm in the media access control layer.",
}

@ARTICLE{Karo90:High,
AUTHOR="Mark Karol and R. D. Gitlin",
TITLE="High-Performance Optical Local and Metropolitan Area Networks:
Enhancements of {FDDI} and {IEEE802.6} {DQDB}",
JOURNAL=ieeejsac,
VOLUME="SAC-8",
PAGES="1439-1448",
YEAR=1990,
REFERENCES=29,
KEYWORDS="Protocol; HSLAN; MAN; DQDB; FDDI; Shufflenet",
ANNOTE="The paper presents several ways to increase throughput and
lowerend-to-end delay on the basis of dqdb and fddi without increasing
the number of receivers and transmitters at a node. The paper
concentrates an a mutliconnected ring architecture which uses a
shufflenet scheme as connection topology. This topology providesa highly
concurrent logical interconnection patternof nodes while the end-to-end
delays are claimed to be reduced by more effici",
}

@TECHREPORT{Mukh90:Scheduling,
AUTHOR="B. Mukherjee and A. E. Kamal",
TITLE="Scheduling Variable-Length Messages on Slotted, High-Speed Fiber
Optic {LANs/MANs} Using the Continuation-Bit Approach",
INSTITUTION="University of California, Davis",
ADDRESS="Davis, California",
NUMBER="CSE-90",
YEAR=1990,
REFERENCES=23,
KEYWORDS="Protocol; performance evaluation; simulation; delay; MAN;
HSLAN",
ANNOTE="The paper describes the continuation-bit approach and its
application to high-speed LANs/MANs. Overhead is analyzed and
comparedwith that of a conventional slotted system. Then the approach is
applied to the Pi-persistent protocol, which is an efficient
unity-capacity protocol proposed for HSLANs/MANs. Specifically,
approximate models are formulated for light and heavy traffic loads.
From these models the proper network operating parameters",
}

@INPROCEEDINGS{As90:Major,
AUTHOR="H. van As",
TITLE="Major Performance Characteristics of the {DQDB} {MAC} Protocol",
BOOKTITLE="ITS, International Telecomm Symposium",
ADDRESS="Rio de Janeiro, Brazil",
PAGES="113-120",
YEAR=1990,
REFERENCES=14,
KEYWORDS="DQDB; QPSX; MAN; HSLAN; performance evaluation; delay;
throughput; simulation",
ABSTRACT="The paper shows major performance characteristics of the dqdb
mac protocol in different environments. It addresses throughput
unfairness under heavy load and and the consequences for the priority
mechanism. Then the socalled bandwidth balancing mechanism is considered
with respect to the positioning of heavy and low load stations. Finally
symmetric and asymmetric traffic environments are compared.",
}

@INPROCEEDINGS{Zitt90:Parallel,
AUTHOR="M. Zitterbart",
TITLE="Parallel Protocol Implementations for High Speed Networks",
BOOKTITLE="ITS, International Telecomm Symposium",
ADDRESS="Rio de Janeiro",
PAGES="260-264",
YEAR=1990,
REFERENCES=15,
KEYWORDS="Protocol; parallel computing; protocol implementation",
ANNOTE="The paper describes an approach to overcome the upcoming
processing bottleneck of communication protocols. The approach is
basedon the use of multiprocessor architectures. Several parallel
concepts inside network nodes like pipeline and array constructs are
outlined and different memory concepts are suggested. Performance
measurements of protocol implementations on transputer networks are
given in the final section.",
}

@BOOK{Stal90:Handbook,
AUTHOR="W. Stallings",
TITLE="Handbook of Computer-Communications: {LAN} Standards",
ISBN="0-672-22698-7",
PUBLISHER="Howard W. Sams and Company",
ADDRESS="North College",
VOLUME=2,
YEAR=1990,
KEYWORDS="Communication network; LAN; standardization; OSI",
ANNOTE="1. Local Network Technology 2. Local Network Standards 3. IEEE
802.2 Logical 4. IEEE 802.3 CSMA/CD 5. IEEE 802.4 Token Bus 6. IEEE
802.5 Token Ring 7. Fiber Distributed Data Interface.",
}

@INPROCEEDINGS{Bioc90:Architectural,
AUTHOR="A. Biocca and G. Freschi and A. Forcina and R. Melen",
TITLE="Architectural Issues in the Interoperability between {MANs} and
the {ATM} Network",
BOOKTITLE=iss,
ADDRESS="Stockholm",
PAGES="4A.3",
YEAR=1990,
REFERENCES=15,
KEYWORDS="ATM; connectionless service; architecture; interconnection",
ANNOTE="In this paper the following two concepts are examined: ATM and
MANs. An evolution strategy is outlined which exploits their synergies.
Furthermore, some technical issues concerning the interworking of MANs
and the ATM network are addressed.",
}

@ARTICLE{Burg90:Dynamic,
AUTHOR="J. L. Burgin",
TITLE="Dynamic Capacity Management in the {BISDN}",
JOURNAL="International Journal of Digital and Analog Communication
Systems",
VOLUME=3,
NUMBER=2,
PAGES="161-165",
YEAR=1990,
REFERENCES=10,
KEYWORDS="ATM; bandwidth allocation; capacity assignment; virtual path;
dynamic resource allocation",
ANNOTE="Use of virtual paths (VPs) in BISDN presents network operators
with the ability to make processing intensive resource management
decisions for flows of traffic instead of individual connections.
Altering the amount of capacity assigned to different VPs provides the
ability to reconfigure the network dynamically to respnd to changes in
traffic demand. This paper studies the dynamic behaviour of some
algorithms for assigning capacity to VPs.",
}

@INPROCEEDINGS{Croc90:Interworking,
AUTHOR="P. Crocetti and Giorgio Gallassi and M. Gerla",
TITLE="Interworking of {MANs} and {ATM}",
BOOKTITLE="7th ITC Specialist Seminar",
ADDRESS="Morristown, New Jersey",
PAGES="6.3",
YEAR=1990,
REFERENCES=4,
KEYWORDS="MAN; ATM; connectionless service; interconnection; bandwidth
allocation; traffic control",
ANNOTE="The authors focus on MAN/ATM interconnection supported by a
connectionless service within the ATM network. For the problem of
allocating bandwidth to the VPs connecting the gateways they propose a
solution which is based on available bandwidth information on the path
periodically supplied by the network to the gateway (bandwidth
advertising).",
}

@INPROCEEDINGS{Lela90:LAN,
AUTHOR="Will Leland",
TITLE="{LAN} Traffic Behaviour from Milliseconds to Days",
BOOKTITLE="7th ITC Specialist Seminar",
ADDRESS="Morristown, New Jersey",
PAGES="6.1",
YEAR=1990,
REFERENCES=12,
KEYWORDS="LAN; traffic measurement",
ANNOTE="The authors present results on measurements of LAN traffic
(Ethernet) within Bellcore's Morris Research and Engineering Center
during August 1989 through January 1990.",
}

@ARTICLE{Pavl90:Basic,
AUTHOR="G. Pavlou and G. Knight",
TITLE="Basic Rate {ISDN} Workstation Traffic Pattern",
JOURNAL=comcom,
VOLUME=13,
NUMBER=10,
PAGES="587-594",
YEAR=1990,
KEYWORDS="LAN; traffic measurement",
}

@INPROCEEDINGS{Ujih90:Architecture,
AUTHOR="Y. Ujihashi and Toshihiro Shikama and Kazuji Watanabe and K.
Oshima and S. Aoyama",
TITLE="An Architecture for Connectionless Data Service in {BISDN}",
BOOKTITLE=globecom,
ADDRESS="San Diego, California",
PAGES="900.3",
YEAR=1990,
REFERENCES=8,
KEYWORDS="ATM; connectionless service; architecture; routing;
performance evaluation",
ANNOTE="This paper proposes a method to support a connectionless service
within BISDN directly via CLSFs. Furthermore, they compare their method
with a virtual ring topology in terms of the traffic load within the
network and the processing load within the CLSFs.",
}

@INPROCEEDINGS{Yama90:Connectionless,
AUTHOR="Katsuyuki Yamazaki and Y. Ikeda",
TITLE="Connectionless Cell Switching Schemes for Broadband {ISDN}",
BOOKTITLE=iss,
ADDRESS="Stockholm",
PAGES="2A.9",
YEAR=1990,
REFERENCES=8,
KEYWORDS="ATM; connectionless service; architecture",
ANNOTE="This paper discusses the objectives of connectionless cell
switching services within BISDN. Topics especially discussed are
architectural issues, addressing and routing mechanisms, andmessage
based connectionless cell transfer.",
}

@INPROCEEDINGS{Berr90:ATM,
AUTHOR="L. T. M. Berry",
TITLE="{ATM} Traffic Modelled by a Semi-Markov Point Process Source",
BOOKTITLE="Australian Video Communications Workshop",
ADDRESS="Melbourne",
PAGES="27-35",
YEAR=1990,
REFERENCES=11,
KEYWORDS="ATM; source model; packet video; correlation; bursty traffic;
semi Markov process",
ANNOTE="In this paper some previously studied bursty traffic models are
generalized to induce additional correlation possibilities. The purpose
of the study is to attempt to define a class of models which may be
suitable for characterizing variable bit rate videotraffic both within a
continuous and a discrete time context. A semi-Markov framework is
chosen in an attempt to retain reasonable tractability.",
}

@INPROCEEDINGS{Chan90:Multiplexing,
AUTHOR="A. Chandan and Nicolaos D. Georganas",
TITLE="Multiplexing Multimedia {ATM} Sources: A Cell Loss Analysis",
BOOKTITLE="IEEE MULTIMEDIA",
ADDRESS="Bordeaux",
YEAR=1990,
REFERENCES=4,
KEYWORDS="ATM; statistical multiplexing; performance evaluation; bursty
traffic; analysis; approximation",
}

@INPROCEEDINGS{Desm90:Discrete,
AUTHOR="E. M. Desmet and G. H. Petit",
TITLE="Performance Analysis of the Discrete Time Multiserver Queueing
system {Geo(N)/D/c/K}",
BOOKTITLE="RACE Workshop on Traffic and Performance Aspects in IBCN",
ADDRESS="Munich",
PAGES=20,
YEAR=1990,
REFERENCES=7,
KEYWORDS="ATM; switching; output buffer; multiserver; analysis;
performance evaluation; Markov chain; discrete time; numerical method;
finite queue; waiting time; loss probability",
ANNOTE="The performance characteristics (system contents and delay
distributions, queue overflow probability) are obtained by numerical
means. The results are validated against simulations. The relationship
between overflow probability and queue size fora range of traffic
intensities and for a selected number of servers and inlets are
illustrated and discussed.",
}

@INPROCEEDINGS{Liao90:Heuristic,
AUTHOR="K. Liao and L. G. Mason",
TITLE="A Heuristic Approach for Performance Analysis of {ATM} Systems",
BOOKTITLE=globecom,
ADDRESS="San Diego",
YEAR=1990,
REFERENCES=22,
KEYWORDS="ATM; statistical multiplexing; performance evaluation;
analysis; approximation; G/D/1; fluid flow model; delay distribution",
ANNOTE="We consider in this paper a heuristic approach which is based
onthe fluid approximation. In order to remove the possible inaccuracy of
the fluid approximation in light to moderate traffic, we propose a G/D/1
adjustment. The performance analysispredicts the buffer content and
packet delay distribution which usually have stringent requirements.