@INCOLLECTION{Jeff91:YARTOS,
AUTHOR="K. Jeffay and D. Stone and D. Poirier",
TITLE="{YARTOS:} kernel support for efficient, predictable real-time
systems",
BOOKTITLE="Real-Time Programming",
EDITOR="Wolfgang A. Halang and K. Ramamritham",
PUBLISHER="Pergamon Press",
PAGES="7-12",
YEAR=1992,
REFERENCES=14,
KEYWORDS="operating system; real-time systems; scheduling; multimedia;
real-time computer system; processor and resource allocation",
ABSTRACT="YARTOS is an experimental real-time operating system kernel
that provides guaranteed response times to tasks. It is currently used
as a vehicle for research in the design, analysis and implementation of
real-time applications. It is a micro-kernel with an underlying formal
model based on sporadic tasks with response time requirements and shared
software resources. It is distinguished by the programming model it
supports and by its use of a novel processor scheduling and resource
allocation policy. The implementation of YARTOS is outlined and two
real-time applications  that run under YARTOS are described.",
}

@ARTICLE{Lee92:TES,
AUTHOR="D. Lee and B. Melamed and Andrew Reibman and B. Sengupta",
TITLE="{TES} Modeling for Analysis of a Video Multiplexer",
JOURNAL=pe,
VOLUME=16,
NUMBER="1--3",
PAGES="21-34",
YEAR=1992,
KEYWORDS="packet video; source model; video coding; simulation",
ABSTRACT="The transport of video images is likely to be a major
application of high-speed networks of the future. These applications are
capable of utilizing the high bandwidths that will become available with
the advent of BISDN. In this paper, we propose a new methodology (called
TES) for modeling video sources. The main characteristic of this method
is that it can model an arbitrary marginal distribution and approximate
the autocorrelation structure of the random bitrate process generated by
compressed frames. We present a modeling example utilizing this method,
based on data from a video coding algorithm employing a layering
technique. Using the source model, we develop a simulation model of a
multiplexer of video sources. We show that this model can be used to
address a number of design issues that arise in this class of problem.
In particular, we show that for a layered video coding algorithm, it is
possible to have a gain in the number of sources multiplexed at the cost
of some loss of low priority packets.",
}

@TECHREPORT{Ferr92:Sequoia,
AUTHOR="D. Ferrari and J. Pasquale and George C. Polyzos",
TITLE="Network issues for Sequoia 2000",
INSTITUTION="University of California, Berkeley",
YEAR=1992,
KEYWORDS="network architecture; network testbed; real-time services",
ABSTRACT="The goals of the Sequoia 2000 network are to provide high
throughput for the massive observation input data and image output data
characterizing global change applications, as well as real-time services
for animations and collaboration tools such as video conferencing. The
first phase of the network will be based on a T3 (45 Mb/s) backbone and
FDDI for local distribution. The research issues we are focusing on
include protocols that provide deterministic and statistical performance
guarantees and take advantage of hierarchical coding of information, and
the design of I/O system software that integrates process and device
communication software with network protocol software.",
}

@MISC{Wite92:Alpha,
AUTHOR="Rich Witek and Dick Sites",
TITLE="Alpha architecture and {EV4} - The first implementation",
YEAR=1992,
}

@TECHREPORT{Pare92:Generalized,
AUTHOR="Abhay Parekh and Robert Gallager",
TITLE="A generalized processor sharing approach to flow control in
integrated services networks: the multiple node code",
TYPE="Manuscript",
INSTITUTION="Massachusetts Institute of Technology",
ADDRESS="Cambridge, Massachusetts",
NOTE="submitted to ACM/IEEE Transactions on Networking",
MONTH="Summer",
YEAR=1992,
KEYWORDS="queueing theory; leaky bucket; delay bounds",
ABSTRACT="Worst-case bounds on delay and backlog are derived for leaky
bucket constrained sessions in arbitrary topology networks of
generalized processor sharing (GPS) servers. The inherent flexibility of
the service discipline is exploited to analyze broad classes of
networks. When only a subset of the sessions are leaky bucket
constrained, we give succinct per-session bounds that are independent of
the behavior of the other sessions and also of the network topology.
However, these bounds are only shown to hold for each session that is
guaranteed a backlog clearing rate that exceeds the token arrival rate
of its leaky bucket. A much broader class of networks, called consistent
relative session treatment (CRST) networks is analyzed for the case in
which all of the sessions are leaky bucket constrained. First, an
algorithm is presented that characterizes the internal traffic in terms
of average rate and burstiness, and it is shown that all CRST networks
are stable. Next, a method is presented that yields bounds on session
delay and backlog given this internal traffic characterization: The
session $i$ route is treated as a whole, yielding tighter bounds than
those that result from adding the worst-case delays (backlogs) at each
of the servers in the route. The bounds on delay and backlog for each
session are efficiently computed from a universal service curve, and it
is shown that these bounds are achieved by ``staggered'' greedy regimes
when an independent sessions relaxation holds. Propagation delay is also
incorporated into the network. Finally, the analysis of arbitrary
topology GPS networks is related to packet GPS networks (PGPS). For
small packet sizes, the behavior of the two schemes is seen to be
virtually identical, and the effectiveness of PGPS in guaranteeing
worst-case session delay is demonstrated under rate proportional
processor sharing assignments.",
}

@ARTICLE{Sher92:Overview,
AUTHOR="M. H. Sherif and D. O. Bowker and G. Bertocci and B. A. Orford
and G. A. Mariano",
TITLE="Overview and performance of {CCITT/ANSI} embedded {ADPCM}
algorithm",
JOURNAL=ieeecom,
YEAR=1992,
KEYWORDS="ADPCM; G.727; voice coding; embedded coding; variable bit rate
coding",
ABSTRACT="Embedded adaptive differential pulse code modulation (ADPCM)
algorithms quantize the difference between the input signal and the
estimated signal into core bits and enhancement bits. This feature gives
them an advantage over non-embedded algorithms because they allow an
intermediate node to drop the enhancement bits without having to
exchange control messages with the transmitting end. CCITT
recommendation G.727 describes embedded ADPCM encoding algorithms with
5, 4, 3 and 2 core bits; it is virtually identical to the correspoding
ANSI standard T1.310. This paper highlights the main features of
G.727/T1.310 and presents results on its performance. A formal
subjective evaluation of the speech performance of embedded ADPCM
algorithms indicates that a mid-rise quantizer provides better voice
transmission performance than its mid-tread counterpart when two core
bits are used. The subjective data also show that the performance of the
40-kbit/s mid-rise ADPCM algorithm with two feedback bits is
indistinguishable from that of 64-kbit/s pulse code modulation (PCM) for
up to four tandem encodings. Embedded algorithms are therefore
recommended for flexible congestion control of integrated traffic in
multi-node networks.",
}

@ARTICLE{Tows92:Congestion,
AUTHOR="Donald F. Towsley and S. Fdida and H. Santoso",
TITLE="Congestion avoidance in high-speed interconnection systems",
JOURNAL=cnis,
VOLUME=24,
PAGES="185-195",
YEAR=1992,
KEYWORDS="approximate analysis; interconnection networks; congestion
avoidance; metropolitan area networks; congestion control",
ABSTRACT="In this paper we study the problem of scheduling packets
through a network interconnecting several slow devices. Such a system
might be high speed local area network (HSLAN) or geographically compact
metropolitan area network (MAN) interconnecting several low speed LANs.
The system under study is modeled by several input queues feeding data
through the interconnection (IN) to an output queue. We concern
ourselves with the avoidance or minimization of overflow at the inputs
and output. We study the behavior of four congestion avoidance policies
that differ from each other according to the type of information passed
between the queues. The most complex protocols use queue length
information whereas the simpler protocols use either no information or
packet age information. We compare the performance of these policies
through a combination of analysis and simulation under the assumption of
negligible delays through the IN. We observe that the more detailed the
information, the better the performance. However, if most of the buffers
are allocated to the output queue, there is little difference between
these policies. This suggests that simple protocols may work well under
such an allocation. We also study the issue of fairness when the arrival
process to the input queues are not identical. We observe that the
policies based on queue length information provide fairer treatment when
the performance metric is probability of loss and that simple policies
provide fairer treatment in the case of mean packet delay. Last, we
discuss the potential impact of our results to a system in which transit
delays within the IN are not negligible.",
}

@INPROCEEDINGS{Ahlg92:Host,
AUTHOR="B. Ahlgren",
TITLE="A Host Interface to the {DTM} High Speed Network",
BOOKTITLE="IEEE Workshop on Architecture and Implementation of High
Performance Communication Systems",
ADDRESS="Tucson, Arizona",
YEAR=1992,
}

@TECHREPORT{Ahlg9201:Host,
AUTHOR="B. Ahlgren and S. Pink and P. Gunningberg",
TITLE="A Host Interface to the {DTM} Network",
TYPE="Technical Report",
INSTITUTION="Swedish Institute of Computer Science (SICS)",
ADDRESS="Kista, Sweden",
NUMBER="R92-01",
YEAR=1992,
ABSTRACT="DTM, dynamic synchronous transfer mode, is a new time division
multiplexing technique for fiber networks currently being developed and
implemented at the Royal Institute of Technology in Stockholm, Sweden.
This paper describes the hardware and software aspects of the design of
an SBus host interface to the DTM network for a Sun SPARCstation. The
interface is based on a dual port memory residing on the interface card
and accesible over the SBus from the host CPU. The host operating system
allocates message buffers directly in this memory. The interface has
hardware support for segmenting and reassembling packets to and from the
data units of the DTM. The software part of the interface manages the
shared memory and the virtual circuits provided by the DTM network.",
URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--92-01--SE.ps.Z",
}

@INPROCEEDINGS{Aras92:Segmented,
AUTHOR="Caglan M. Aras and Ren C. Luo and Douglas Reeves",
TITLE="The Segmented Bus: A Dynamically Segmentable Interprocessor
Communication Network for Intelligent Mobile Robot Systems",
BOOKTITLE="IEEE/RSJ International Conference on Intelligent Robots and
Systems",
ADDRESS="Raleigh, North Carolina",
VOLUME=1,
PAGES="309-316",
YEAR=1992,
}

@BOOK{Bert92:Data,
AUTHOR="D. P. Bertsekas and Robert Gallager",
TITLE="Data Networks",
EDITION=2,
PUBLISHER="Prentice-Hall",
ADDRESS="Englewood Cliffs, New Jersey",
YEAR=1992,
}

@INPROCEEDINGS{Davi92:ATM,
AUTHOR="B. S. Davie",
TITLE="An {ATM} Network Interface for High Speed Experimentation",
BOOKTITLE="IEEE Workshop on Architecture and Implementation of High
Performance Communication Systems",
ADDRESS="Tucson, Arizona",
YEAR=1992,
}

@INPROCEEDINGS{Morr92:Approximate,
AUTHOR="T. D. Morris and Harry Perros",
TITLE="Approximate Analysis of a Discrete-time tandem network of
cut-through queues with blocking and bursty traffic",
BOOKTITLE="2nd International Workshop on Queueing Networks with
Blocking",
ADDRESS="Research Triangle Park, North Carolina",
YEAR=1992,
}

@INPROCEEDINGS{Turn92:Transferring,
AUTHOR="Colin Turner and L. L. Peterson",
TITLE="Transferring Images Over High-Speed Wide-Area Networks",
BOOKTITLE="IEEE Workshop on Architecture and Implementation of High
Performance Communication Systems",
ADDRESS="Tucson, Arizona",
YEAR=1992,
}

@ARTICLE{Zhen92:Ability,
AUTHOR="Qin Zheng and Kang G. Shin",
TITLE="On the Ability of Establishing Real-Time Channels in Point to
Point Packet Switched Networks",
JOURNAL=ieeecom,
YEAR=1992,
KEYWORDS="real-time communication; point-to-point packet switched
networks; delivery guarantees; deadline scheduling",
ABSTRACT="There are numerous applications which require packets to be
delivered within prespecified delay bounds in point-to-point
packet-switched networks. To meet this requirement, we define a
real-time channel as a unidirectional connection between two nodes in
such a network that guarantees every packet to be delivered before a
user-defined, end-to-end deadline. The main goal of this paper is to lay
a formal basis for the problem of establishing real-time channels by (i)
deriving a necessary and sufficient condition for the schedulability of
a set of channels over a link, and (ii) developing an efficient method
for computing the minimum delay over a link for each channel. Given the
traffic characteristics of a channel, our results can be used to check
whether or not every packet will be delivered within a prespecified
delay bound via the links over which the channel runs. The results are
also applicable to a wide variety of real-time task scheduling
problems.",
}

@INPROCEEDINGS{Zhen92:Fault,
AUTHOR="Qin Zheng and Kang G. Shin",
TITLE="Fault-Tolerant Real-Time Communication in Distributed Computing
Systems",
BOOKTITLE="22nd Annual International Symposium on Fault-Tolerant
Computing",
YEAR=1992,
KEYWORDS="real-time communications; hard real-time; call set-up;
admission control; routing; fault tolerance",
ABSTRACT="The delivery delay in a point-to-point packet switching
network is difficult to control due to the contention among
randomly-arriving packets at each node and multihops a packet must
travel between its source and destination. Despite this difficulty,
there is an increasing number of applications that require packets to be
delivered reliably within prespecified delay bounds. This paper shows
how this can be achieved by using real-time channels which make 'soft'
reservations of network resources to ensure the timely delivery of
real-time packets. We first present algorithms for the establishment of
real-time channels and then show how the basic real-time channels can be
enhanced to be fault-tolerant using the multiple paths between a pair of
communicating nodes. The contribution of the former is a tighter
schedulability condition which makes more efficient use of network
resources than any other existing approach, and that of the latter is a
significant improvement in fault-tolerance over the basic real-time
channel which is inherently susceptible to component failures.",
ANNOTE="peak rate allocation; per-link guarantees; deadline scheduling",
}

@INPROCEEDINGS{Zhen92:Real,
AUTHOR="Qin Zheng and Kang G. Shin",
TITLE="Real-Time Communication in Local Area Networks",
BOOKTITLE=lcn,
ADDRESS="Minneapolis, Minnesota",
YEAR=1992,
KEYWORDS="local area networks; medium access; real-time services; FDDI;
token ring; real-time channel; LAN; timed token protocol",
ABSTRACT="Timed token protocols are almost exclusively used for medium
access control in local area ring networks. We consider in this paper
the feasibility of using buffered transmission which has the advantages
of eliminating the token passing overhead and relieving the network
interface from the complex token handling operations. By establishing
real-time channels (each of which is a unidirectional virtual
connection), the end-to-end delivery delay of real-time packets can also
be controlled more flexibly than the timed token protocols. We first
review the concept of real-time channel (RTC) and the RTC establishment
procedure. Its performance is then compared with the FDDI timed token
protocol. Our simulation results show that the buffered transmission in
local area ring networks equipped with real-time channels enhances both
the networks throughput and the ability to support heterogeneous
real-time traffic. The implementation of the network interface is also
examined with an example design showing the feasibility of real-time
channels in high-speed local area networks.",
}

@TECHREPORT{Fish92:Simpack,
AUTHOR="Paul A. Fishwick",
TITLE="Simpack: getting started with simulation programming in C and
{C++}",
TYPE="Technical Report",
INSTITUTION="University of Florida",
ADDRESS="Gainesville, Florida",
NUMBER="TR92-022",
YEAR=1992,
KEYWORDS="simulaton; modeling; software",
ABSTRACT="SimPack is a collection of C and C++ libraries and executable
programs for computer simulation. In this collection, several different
simulation algorithms are supported including discrete event simulation,
continuous simulation and combined (multimodel) simulation. The purpose
of the SimPack toolkit is to provide the user with a set of utilities
that illustrate the basics of building a working simulation from a model
description. We demonstrate that special purpose simulation programming
languages can be easily constructed using language translation software
with the SimPack utilities which act as the ``assembly language''. We
present several different dynamical sytem model forms and overview the
methods used in SimPack for executing these models. SimPack includes
some fairly extensive simulation facilities, and is in use by various
instructors, rsearchers and industrial analysts for their modeling and
simulation experiments.",
}

@ARTICLE{Dupu9207:Protocols,
AUTHOR="Sylvie Dupuy and Wassim Tawbi and E. Horlait",
TITLE="Protocols for high-speed multimedia communications networks",
JOURNAL=comcom,
VOLUME=15,
NUMBER=6,
PAGES="349-358",
MONTH="July/August",
YEAR=1992,
KEYWORDS="multimedia; protocols; high-speed networks; quality of
service; FDDI; DQDB; ST-II; TCP; TP4; Delta-t; TP5; Datakit; NETBLT;
XTP; VMTP; TP++",
ABSTRACT="This paper surveys protocols and networks for multimedia
applications. The first section defines the most important needs of
multimedia applications, and expresses their requirements as quality of
service (QoS) parameters. A second part describes current high-speed
networks and the services they offer. Protocols providing stream
services in packet switching networks are introduced in the third part.
Finally, several existing transport protocols are presented and their
main features are analyzed.",
ANNOTE="''network client needs are growing and applications such as file
transfer and electronic mail are not sufficient to meet these needs''
This paper briefly covers threee LAN/MAN technologies, ATM and STM
networks, protocols which provide guaranteees in packet switch networks
and transport protocols. Protocols which provide guarantees include
ST-II (STream protocol version II) and the Session Reservation Protocol
(SRP). ST-II uses streams over datagram based networks and is organised
with a tree of streams rooted at the sender. SRP is part of the DSAH
architecture and is based on workload and resource reservation.
Transport protocols covered in this paper include TCP, TP4, TP5,
Delta-t, Universal Receiver protocol from AT\&T's Datakit protocol
suite, NETBLT, XTP, VMTP and TP++. TP5 is an extension to the ISO TP4
transport protocol to handle optional real time, no retransmission
traffic. [Kn]",
}

@ARTICLE{Shep9207:Protocol,
AUTHOR="D. Shepherd and D. Hutchinson and Francisco Garcia and G.
Coulson",
TITLE="Protocol support for distributed multimedia applications",
JOURNAL=comcom,
VOLUME=15,
NUMBER=6,
PAGES="359-366",
MONTH="July/August",
YEAR=1992,
KEYWORDS="multimedia; protocol support; distributed systems",
ABSTRACT="In this work we describe on-going work in protocol support for
distributed multimedia applications. This work concerns the provision of
suitable transport mechanisms to convey multimedia information (text,
and digital voice and video) between multimedia workstations in a
distributed system. There are two parts to the Lancaster multimedia
work. First, we have developed an abstract model for multimedia
communications based on the use of streams; and second, we have built an
experimental system on which to test the implementation of protocols
based on this model. This paper reports on both aspects of the Lancaster
work, describing the results so far and identifying areas to be
investigated further.",
}

@ARTICLE{Ferr9207:Delay,
AUTHOR="D. Ferrari",
TITLE="Delay jitter control scheme for packet-switching internetworks",
JOURNAL=comcom,
VOLUME=15,
NUMBER=6,
PAGES="367-373",
MONTH="July/August",
YEAR=1992,
KEYWORDS="synchronization; real-time channel; jitter control; quality of
service",
ABSTRACT="Delay jitter is the variation of the delays with which packets
travelling on a network connection reach their destination. For good
quality of reception, continuous-media (video, audio, image) streams
require that the jitter be kept below a sufficiently small upper bound.
This paper proposes a distributed mechanism for controlling delay jitter
in a packet-switched network. The mechanism can be applied to an
internetwork that satisfies the conditions detailed in the paper, and
can coexist with other schemes (including the absence of any scheme) for
jitter control within same network, the same node, and even the same
real-time channel. The mechanism makes the distribution of buffer space
requirements more uniform over a channel's route, and reduces by a
non-negligible amount the total buffer space needed by a channel. The
paper argues that if these advantages are sufficient to justify the
higher costs of the distributed jitter control mechanism with respect to
a non-distributed one, it would be useful to offer to the network's
users a jitter control service based on the mechanism proposed here.",
}

@ARTICLE{Rose9207:Presenting,
AUTHOR="J. Rosenberg and Gil C. Cruz and Thomas Judd",
TITLE="Presenting multimedia documents over a digital network",
JOURNAL=comcom,
VOLUME=15,
NUMBER=6,
PAGES="374-380",
MONTH="July/August",
YEAR=1992,
KEYWORDS="multimedia; digital network; digital media support",
ABSTRACT="This paper discusses an experimental prototype system for
presenting integrated multimedia documents over a digital network. This
prototype is the first in a series investigating the requirements placed
on the network in support of applications presenting multimedia
information. The information consists of multiple media in digital form,
including multi-font text, geometric graphics, photographic images,
audio and motion video. The paper describes the motivation for this line
of research and the initial focus and goals of our first prototype. We
describe the hardware comprising this prototype and the current status
of our efforts. This is followed by a discussion of some early results
we have obtained in dealing with integrated digital media, including
motion video, with off-the-shelf components. Finally, we draw some
conclusions about required support for digital media.",
ANNOTE="describes video hardware used for compression",
}

@ARTICLE{Litt9207:Scheduling,
AUTHOR="T. D.C. Little and A. Ghafoor",
TITLE="Scheduling of bandwidth-constrained multimedia traffic",
JOURNAL=comcom,
VOLUME=15,
NUMBER=6,
PAGES="381-387",
MONTH="July/August",
YEAR=1992,
KEYWORDS="scheduling; multimedia; bandwidth requirements",
ABSTRACT="Multimedia applications describe unique requirements that must
be met by computer network and operating system components. In
particular, the time-dependencies of multimedia data require mechanisms
to ensure timely and predictable delivery of data from their sources to
destinations. For single medium applications which have relatively
constant bandwidth utilization, connections from source to destination
can be tailored to moderate ranges of data rates. On the other hand, due
to the large variation in multimedia object sizes and concurrency in
object presentation, multimedia applications can require a
correspondingly large variation in required bandwidth over the life of
the connection. Data of these types may not arrive in time to meet the
intended playout schedule when the capacity of the channel is exceeded.
In this paper we present an approach to remedying this situation by
effectively smoothing the bandwidth over time via a scheduling
mechanism.",
}

@ARTICLE{Jeff9207:Kernel,
AUTHOR="K. Jeffay and D. Stone and Donelson F. Smith",
TITLE="Kernel support for live digital audio and video",
JOURNAL=comcom,
VOLUME=15,
NUMBER=6,
PAGES="388-395",
MONTH="July/August",
YEAR=1992,
KEYWORDS="multimedia; operating system kernel; real-time; digital audio;
digital video; scheduling",
ABSTRACT="We have developed a real-time operating system kernel which
has been used to support the transmission and reception of streams of
live digital audio and video in real-time as part of a workstation-based
conferencing application. An experimental environment consisting of a
number of workstations interconnected with a 16 Mbit token ring has been
created and used to evaluate quantitatively the performance of the
kernel and conferencing application, as well as the quality of the
conferences they are capable of supporting. Our early experiences with
these systems are described.",
}

@ARTICLE{Smit92:Evolution,
AUTHOR="Thomas W. Smith",
TITLE="The evolution of audiographics teleconferencing for continuing
engineering education at the University of Wisconsin - Madison",
JOURNAL="International Journal for Continuing Engineering Education",
YEAR=1992,
KEYWORDS="multimedia; education",
ABSTRACT="The University of Wisconsin pioneered the use of audiographic
teleconferencing for Continuing Engineering Education. Modern
audiographics systems provide a cost-effective, flexible and interactive
platform for distance education delivery. The University has capitalized
on these advantages and uses audiographics to dehver a variety of
courses in-house to large and small industries and to a network of
public sites across the state. Student and faculty acceptance and
student performance has been very good and the use of the system is
expanding.",
}

@ARTICLE{Boye92:Reservation,
AUTHOR="P. Boyer and D. Tranchier",
TITLE="A reservation principle with applications to the {ATM} traffic
control",
JOURNAL=cnis,
VOLUME=24,
PAGES="321-324",
YEAR=1992,
KEYWORDS="ATM; burst control; admission control; burst-level
reservation; fast reservation protocols; on/off sources; bursty traffic;
traffic control",
ABSTRACT="In a network based upon the asynchronous transfer mode (ATM),
stepwise variable bit rate traffic sources can be efficiently
multiplexed without significant degradation of the transfer quality by
introducing an access control at an intermediate burst (step) level.
This multiplexing is based upon a peak bit rate reservation in the
switching elements of the general network. Two fast reservation
protocols (FRPs) are presented based upon mono-cell bandwidth management
messages processed ``on the fly'' in the switching elements. The first
protocol is FRP/DT which could be run to multiplex file banking calls
and LAN-to-LAN interconnection using leased lines. The second is FRP/IT
and could be run to multiplex connectionless servers and some real-time
codecs. Evaluation of the hardware complexity and performance are
addressed.",
}

@ARTICLE{Ferr92:Real,
AUTHOR="D. Ferrari",
TITLE="Real-Time Communication in an Internetwork",
JOURNAL=jhsn,
VOLUME=1,
NUMBER=1,
PAGES="79-103",
YEAR=1992,
KEYWORDS="real-time services; scheduling; network architecture",
ABSTRACT="Can end-to-end communication performance be guaranteed by a
packet-switching internetwork? This paper addresses the question by
examining the feasibility of extending to an internetwork the Tenet
approach to real-time communication service design. The conditions to be
satisfied by an internetwork so that the approach can be extended to it
are investigated. These include conditions for the scheduling discipline
to be used in the nodes of the internetwork. The original Tenet approach
to real-time communication applies to a network consisting of hosts,
homogeneous nodes (or switches), and physical links connecting nodes and
hosts in an arbitrary topology. The nodes are store-and-forward, and are
scheduled by a multi-class version of the Earliest Due Date
deadline-based policy. The discussion presented in this paper results in
extendibility conditions that are quite broad; hence, the Tenet approach
may be used to establish and run real-time channels in a vast class of
internetworks. A case study is also discussed, involving a simple
network, whose nodes are scheduled by FCFS-based disciplines, and the
connection of such a network to an internetwork with deadline-based and
hierarchical round robin scheduling.",
URL="ftp://tenet.berkeley.edu/pub/tenet/Papers/Ferrari92.ps",
}

@TECHREPORT{Pike92:UseName,
AUTHOR="Rob Pike and David Leo Presotto and Ken Thompson and Howard
Trickey and Phil Winterbottom",
TITLE="The use of name spaces in Plan 9",
INSTITUTION="AT\&T Bell Laboratories",
YEAR=1992,
KEYWORDS="Plan 9; operating systems; naming; file system",
ABSTRACT="Plan 9 is a distributed system built at the Computing Sciences
Research Center of AT\&T Bell Laboratories over the last few years. Its
goal is to provide a production-quality system for software development
and general computation using heterogeneous hardware and minimal
software. A Plan 9 system comprises CPU and file servers in a central
location connected together by fast networks. Plan 9 argues that given a
few carefully implemented abstractions it is possible to produce a small
operating system that provides support for the largest systems on a
variety of architectures and networks. The foundations of the system are
built on two ideas: a per-process name space and a simple
message-oriented file system protocol.",
URL="ftp://research.att.com/dist/plan9man/10names.ps.Z",
}

@TECHREPORT{Pike92:Various,
AUTHOR="Rob Pike",
TITLE="The various ports",
INSTITUTION="AT\&T Bell Laboratories",
ADDRESS="Murray Hill, New Jersey",
YEAR=1992,
KEYWORDS="Plan 9",
URL="ftp://research.att.com/dist/plan9man/01port.ps.Z",
}

@BOOK{Inmo92:Transputer,
AUTHOR="Inmos",
TITLE="The Transputer Databook",
EDITION="3rd",
PUBLISHER="SGS-Thomson",
ADDRESS="Bristol, United Kingdom",
YEAR=1992,
KEYWORDS="transputer; computer architecture",
}

@ARTICLE{Robe92:Jitter,
AUTHOR="J. W. Roberts and F. Guillemin",
TITLE="Jitter in {ATM} networks and its impact on peak rate
enforcement",
JOURNAL=pe,
VOLUME=16,
PAGES="35-48",
YEAR=1992,
KEYWORDS="ATM; jitter; leaky bucket; jumping window; peak rate
enforcement; policing; network access",
ABSTRACT="Cells arriving to an ATM network experience random delays due
to queueing in upstream multiplexing stages, notably in customer
premises. This is the phenomenon of jitter and the aim of the present
paper is to study its influence on peak rate enforcement. We first
introduce some general characterizations of jitter and then, describe
two models of jittered flows based on simple queueing systems. We
discuss the objectives of peak rate enforcement and study the impact of
jitter on the dimensioning of jumping window and leaky bucket
mechanisms. A useful synthetic characterization of jitter appears to be
a remote quantile of the cell delay distribution expressed in units of
the initial inter-cell interval.",
}

@UNPUBLISHED{Pres92:Organization,
AUTHOR="David Leo Presotto and Phil Winterbottom",
TITLE="The organization of networks in Plan 9",
NOTE="Plan 9 manual",
YEAR=1992,
KEYWORDS="Plan 9; distributed systems",
ABSTRACT="In a distributed system networks are of paramount importance.
This paper describes the implemention, design philosophy and
organization of network support in Plan 9. Topics include network
requirements for distributed systems, our kernel implementation, network
naming, user interfaces and performance. We also observe that much of
this organization is relevant to current systems.",
}

@UNPUBLISHED{Pike92:UsePlan,
AUTHOR="Rob Pike",
TITLE="How to use the Plan 9 C Compiler",
NOTE="Plan 9 Manual",
YEAR=1992,
KEYWORDS="compiler; Plan 9; operating systems",
}

@INPROCEEDINGS{Khan92:Realtime,
AUTHOR="S. Khanna and Michael Sebrée and John Zolnowsky",
TITLE="Realtime scheduling in {SunOS} 5.0",
BOOKTITLE=usenixw,
PAGES="375-390",
YEAR=1992,
KEYWORDS="realtime support; scheduling; kernel; SunOS; Solaris",
ABSTRACT="We describe the fundamental mechanisms in SunOS 5.0 to provide
realtime scheduling functionality. Our primary goal was to provide
bounded behavior for dispatching or blocking threads. To achieve this
goal we have modified the kernel to be fully preemptive, guaranteeing
dispatch after both synchronous and asynchronous wakeups. We have also
worked toward controlling priority inversion in the kernel. The result
is a kernel capable of delivering realtime scheduling and bounded
response to a large class of user level applications.",
URL="http://computing.soongsil.ac.kr/~jmchoi/Realtime-Scheduling-in.html",
}

@BOOK{Schw92:C,
AUTHOR="W. D. Schwaderer",
TITLE="C Programmer's Guide to NetBIOS, {IPX,} and {SPX}",
PUBLISHER="SAMS (Prentice Hall)",
ADDRESS="Carmel, Indiana",
YEAR=1992,
KEYWORDS="IPX; SPX; Novell; local area networks; LAN; protocols",
}

@ARTICLE{Asth92:Gigabit,
AUTHOR="Abhaya Asthana and Catherine Delph and H. V. Jagadish and Paul
Krzyzanowski",
TITLE="Towards a gigabit {IP} router",
JOURNAL=jhsn,
VOLUME=1,
NUMBER=4,
PAGES="281-288",
YEAR=1992,
KEYWORDS="multiprocessor; network protocol; internet routing;
intelligent memory; high performance computation; IP; router",
ABSTRACT="We illustrate the application of SWIM's active storage
elements (ASE) module in constructing high performance IP routers. The
logic associated with each ASE is a wide-instruction-word
micro-programmable engine, that has been especially designed to
efficiently perform operations such as pointer dereferencing, memory
indirection, bounds checking, and so forth. This makes it well suited to
performing operations such as parsing of the IP header, routing table
lookup, checksum computation and exception processing. Our results show
that a single ASE running at 20 MHz can process 400,000 packets per
second: well over that required to sustain a gigabit router. Multiple
ASEs can be used in parallel to achieve even higher processing rates.",
}

@ARTICLE{Cido9204:Critique,
AUTHOR="I. Cidon and Jeffrey H. Derby and I. Gopal and Bharath K.
Kadaba",
TITLE="A critique of {ATM} from a data communications perspective",
JOURNAL=jhsn,
VOLUME=1,
NUMBER=4,
PAGES="315-336",
YEAR=1992,
KEYWORDS="ATM; PTM; fast packet switching; gigabit networks; data",
ABSTRACT="Fast packet switching is emerging as the preferred technology
for future high speed, integrated networks. Asynchronous transfer mode
(ATM) is an approach to FPS that is in the process of standardization
and is the preferred approach of the carrier community. Concurrently,
alternative approaches to FPS based on variable sized packets have been
proposed by segments of the data communications industry. These
approaches include frame relay and an approach developed by IBM called
PARIS. The purpose of this paper is to examine the suitability of ATM
for data communications relative to some of these alternative
approaches.",
ANNOTE="Uses 9-byte ATM per-cell overhead; arguments: header/padding
overhead; extra delay due to higher overhead; adaptation layer
processing; cell discarding during overload (avalanche effect)",
}

@ARTICLE{Kowt92:Realization,
AUTHOR="Sitaram Kowtha and R. Dhadesugoor Vaman and G. Djuknic",
TITLE="Realization of a multimedia traffic generator based on $(\mu,
\sigma)$ buffer occupancy analysis",
JOURNAL=jhsn,
VOLUME=1,
NUMBER=4,
PAGES="337-351",
YEAR=1992,
REFERENCES=20,
KEYWORDS="ATM traffic models; broadband ISDN; source modeling; ATM
traffic generators",
ABSTRACT="Carefully selected traffic generators enable accurate
simulation of integrated broadband networks. Simulation tools are
crucial in analysis of traditional as well as new protocols and
algorithms designed for optimum network management in the era of
high-speed integrated ATM-based networks. In this paper, we survey
proposed ATM traffic models and traffic generators derived from them for
the purposes of representing voice, data, and video traffic. We then
compare $(\mu, \sigma)$ buffer occupancy levels at a statistical
multiplexer due to traffic generated from various traffic generators and
show that the generator based on $K$-superposition of identical on/off
sources ($K$-on-off model) possesses desirable characteristics as a
general multimedia traffic model. The $K$-on-off generator has been
implemented and used to represent voice, data, or video sources as well
as aggregrated traffic behavior.",
}

@BOOKLET{Jone92:Buyer,
AUTHOR="T. H. Jones and Ken Rehbehn and Ellen Jennings",
TITLE="The Buyer's Guide to Frame Relay Networking",
PUBLISHER="Netrix Corporation",
ADDRESS="Herndon, Virginia",
YEAR=1992,
KEYWORDS="frame relay; network architecture",
}

@BOOK{ISOI92:ISO,
AUTHOR="I. F. IP WG6. 1",
TITLE="{ISO/IEC} {DIS} 11172: Information technology --- coding of
moving pictures and associated audio for digital storage media up to
about 1.5 Mbit/s",
PUBLISHER="{International Organization for Standardization} and
{International Electrotechnical Commission}",
YEAR=1992,
KEYWORDS="MPEG; standards; ISO; IEC; picture coding; multimedia",
}

@MANUAL{Cant92:OBJECTIVE,
AUTHOR="Michael R. Cantone",
TITLE="{OBJECTIVE} Programmer's Guide",
TYPE="Manual",
ORGANIZATION="AT\&T Bell Laboratories",
ADDRESS="Murray Hill, New Jersey",
YEAR=1992,
KEYWORDS="GUI; graphical user interface builders; programming
environments; structured editor; graphics",
}

@ARTICLE{Schw92:Comparison,
AUTHOR="M. Schwartz and Alan Emtage and B. Kahle and B. Clifford
Neuman",
TITLE="A comparison of {Internet} resource discovery approaches",
JOURNAL=comp_sys,
VOLUME=5,
NUMBER=4,
PAGES="461-493",
MONTH="Fall",
YEAR=1992,
KEYWORDS="Internet; archie; Prospero; World-wide web; Gopher; WAIS;
whois; information systems; resource discovery",
ABSTRACT="In the past several years, the number and variety of resources
available on the Internet have increased dramatically. With this
increase, many new systems have been developed that allow users to
search for and access these resources. As these systems begin to
interconnect with others through ``information gateways'', the
conceptual relationships between the systems come into question.
Understanding these relationships is important, because they address the
degree to which systems can be made to interoperate seamlessly, without
the need for users to learn the details of each system. In this paper we
present a taxonomy of approaches to resource discovery. The taxonomy
provides insights into the interrelated problems of organizing, browsing
and searching for information. Using this taxonomy, we compare a number
of resource discovery systems, and examine several gateways between
existing systems.",
}

@ARTICLE{Neum92:Prospero,
AUTHOR="B. Clifford Neuman",
TITLE="The Prospero file system: a global file system based on the
virtual system model",
JOURNAL=comp_sys,
VOLUME=5,
NUMBER=4,
PAGES="407-432",
MONTH="Fall",
YEAR=1992,
KEYWORDS="Prospero; distributed systems; information services;
directory; index; Internet; file systems; operating systems",
ABSTRACT="Distributed file systems play an important role in today's
computer systems. Many allow files to be accessed over large geographic
areas and across organizational boundaries. However, few systems to date
have given much thought to how information should be organized in such a
global environment. This paper describes the Prospero File System, a
file system based on the Virtual System Model, a model for building
large systems within which users construct their own virtual systems by
selecting and organizing the objects and services of interest. This
customized view of a global file system makes it easier for users to
keep track of files that they have identified as being of interest.",
}

@ARTICLE{Danz92:Distributed,
AUTHOR="Peter Danzig and Song Li and K. Obraczka",
TITLE="Distributed indexing of autonomous {Internet} services",
JOURNAL=comp_sys,
VOLUME=5,
NUMBER=4,
PAGES="433-459",
MONTH="Fall",
YEAR=1992,
KEYWORDS="Indie; resource discovery; archie; networked information
services; data broker; directory services; consistency; distributed
database",
ABSTRACT="This paper describes the architecture and the design decisions
behind a resource discovery tool that we prototyped to knit together the
Internet's resource discovery fabric. We call the architecture
distributed indexing or Indie for short. Indie consists of a directory
of services and an unlimited number of broker databases that index their
own data, data stored in other brokers, and data available from other
resource discovery services. The indexing mechanism doubles as a lazily
consistent data replication mechanism that can replicate the directory
of services or any other broker at will. An Indie broker automatically
clusters references to related objects stored in other autonomous
discovery and database services. Since Indie brokers cluster related
information skimmed from thousands of scattered services, efficient
exhaustive search is possible. This centralization led to the success of
the archie file location service. In a way, Indie is a generalized
archie that locates autonomously maintained data stored in different
discovery services. We believe that other discovery tools can benefit
from the architectural principles that Indie illustrates and the ability
to cluster related information that Indie provides.",
}

@TECHREPORT{Cace92:Multiplexing,
AUTHOR="R. Caceres",
TITLE="Multiplexing Traffic at the Entrance to Wide-Area Networks",
TYPE="Technical Report",
INSTITUTION="Computer Science Division, University of California",
ADDRESS="Berkeley, California",
YEAR=1992,
KEYWORDS="Internet; multiplexing; WAN",
ABSTRACT="Many application-level traffic streams, or conversations, are
multiplexed at the points where local-area networks meet the wide-area
portion of an internetwork.  Multiplexing policies and mechanisms acting
at these points should provide good performance to each conversation,
allocate network resources fairly among conversations, and make
efficient use of network resources.  In order to characterize wide-area
network traffic, we have analyzed traces from four Internet sites.  We
identify characteristics common to all conversations of each major type
of traffic, and find that these characteristics are stable across time
and geographic site.  Our results contradict many prevalent beliefs. 
For example, previous simulation models of wide-area traffic have
assumed bulk transfers ranging from 80 Kilobytes to 2 Megabytes of data.
 In contrast, we find that up to 90\% of all bulk transfers involve 10
Kilobytes or less.  This and other findings may affect results of
previous studies and should be taken into account in future models of
wide-area traffic.  We derive from our traces a new workload model for
driving simulations of wide-area internetworks.  It generates traffic
for individual conversations of each major type of traffic.  The model
accurately and efficiently reproduces behavior specific to each traffic
type by sampling measured probability distributions through the inverse
transform method.  Our model is valid for network conditions other than
those prevalent during the measurements because it samples only
network-independent traffic characteristics.  We also describe a new
wide-area internetwork simulator that includes both our workload model
and realistic models of network components.  We then present a
simulation study of policies for multiplexing datagrams over virtual
circuits at the entrance to wide-area networks.  We compare schemes for
mapping conversations to virtual circuits and queueing disciplines for
scheduling datagrams onto virtual circuits.  We find that networks
should establish one virtual circuit per type of traffic flowing between
two network points of presence, and provide round-robin service to
transmission resources shared by virtual circuits.  This multiplexing
policy exhibits good performance and consumes moderate amounts of
resources at the expense of some fairness among traffic sources of the
same type.  In particular, it maintains interactive delay nearly
constant and close to the possible minimum, and maintains bulk transfer
throughput near the possible maximum, even as network load increases
beyond saturation.  Furthermore, it results in bottleneck buffer
consumption that rises slowly with offered load. Other multiplexing
policies exhibit interactive delay that increases with offered load, and
buffer consumption that rises quickly with offered load.  Again using
our traffic characterization, we evaluate mechanisms for multiplexing
variable-sized datagrams onto small fixed-size cells.  Cells offer
performance and implementation advantages to networks that service many
types of traffic, but they incur bandwidth inefficiencies due to
protocol headers and cell fragmentation.  We find that cell-based
networks using standard protocols are inefficient in carrying wide-area
data traffic.  For example, ATM-based networks using SMDS and IEEE 802.6
protocols lose more than 40\% of their bandwidth to overhead at the
network level and below.  Furthermore, we find that viable compression
techniques can significantly improve efficiency.  For example, a
combination of three compression techniques can regain more than 20\% of
the bandwidth previously lost to overhead.",
URL="ftp://tenet.berkeley.edu/pub/tenet/Papers/Caceres92.ps",
}

@ARTICLE{Kali92:OSI,
AUTHOR="T. Kalin and D. Barber",
TITLE="Has the {OSI} opportunity been fully realized?",
JOURNAL=cnis,
VOLUME=25,
PAGES="227-239",
YEAR=1992,
KEYWORDS="OSI; standards; history",
ABSTRACT="This paper suggests that the enormous effort that has been put
into the development of today's Open System Standards has not been
really cost effective in providing a coherent set of implementable,
efficient standards. It argues that the rapid developments in technology
over the past decade have not been matched by the appearance of
corresponding ``Open Standards'', due largely to the long-winded
procedures of the present standardization processes. The paper then
briefly reviews the evolution of present Open System Interconnection
standards and considers the motivation for trying to achieve such
standards. Next, it outlines some possible future developments, which
could stem from the impact of emerging technology on distributed
multimedia systems, and tries to identify what kinds of associated new
standards may soon be required. Finally, it proposes some new approaches
to the creation of user-oriented Open Standards that might be more
effective than the present approaches.",
}

@BOOK{Perl92:Interconnections,
AUTHOR="R. Perlman",
TITLE="Interconnections -- Bridges and Routers",
ISBN="0-201-56332-0",
PUBLISHER="Addison-Wesley",
ADDRESS="Reading, Massachusetts",
YEAR=1992,
KEYWORDS="bridges; routers; internetworking; network architecture;
routing",
}

@ARTICLE{Gong92:Application,
AUTHOR="Wei-Bo Gong and Henning Schulzrinne",
TITLE="Application of smoothed perturbation analysis to probabilistic
routing",
JOURNAL="Mathematics and Computers in Simulation",
VOLUME=32,
PAGES="467-485",
YEAR=1992,
KEYWORDS="perturbation analysis; routing",
ABSTRACT="The on-line estimation of derivatives is of fundamental
importance in gradient-based routing algorithms for data networks and
other applications. Smoothed perturbation analysis as proposed in this
paper requires minimal knowledge about the system statistics. It is
shown that smoothed perturbation analysis provides asymptotically
unbiased estimates of derivatives. We determine bias and variance of the
estimate experimentally and compare them to those of a likelihood ratio
estimator.",
URL="ftp://gaia.cs.umass.edu/pub/Gong92:Application.ps.gz",
}

@TECHREPORT{Arno92:Self,
AUTHOR="Richard Arnott and Marvin Kraus",
TITLE="Self-Financing of Congestible Facilities in a Dynamic
Environment",
INSTITUTION="Economics Department, Boston College",
YEAR=1992,
}

@TECHREPORT{Arno92:Financing,
AUTHOR="Richard Arnott and Marvin Kraus",
TITLE="Financing Capacity on the Bottleneck Model",
INSTITUTION="Department of Economics, Boston College",
YEAR=1992,
}

@BOOK{Beth92:Public,
AUTHOR="T. Beth and Markus Frisch and G. J. Simmons",
TITLE="Public-key cryptography: state of the art and future directions",
PUBLISHER="Springer-Verlag",
ADDRESS="New York",
YEAR=1992,
}

@INCOLLECTION{Bran92:Information,
AUTHOR="Lewis M. Branscombe",
TITLE="Information Infrastructure for the 90's: A Public Policy
Perspective",
BOOKTITLE="Building Information Infrastructure",
EDITOR="Brian Kahin",
PUBLISHER="McGraw-Hill Primis",
YEAR=1992,
}

@TECHREPORT{Cava92:Internetworking,
AUTHOR="John R. Cavanaugh and Timothy J. Salo",
TITLE="Internetworking with {ATM} {WANs}",
INSTITUTION="Minnesota Supercomputer Center, Inc.",
YEAR=1992,
}

@TECHREPORT{Claf92:Traffic,
AUTHOR="Kimberly Claffy and George C. Polyzos and H. Braun",
TITLE="Traffic Characteristics of the {T1} {NSFNET} Backbone",
INSTITUTION="UCSD",
NUMBER="CS92-252",
YEAR=1992,
}

@BOOK{USPo92:Domestic,
AUTHOR="United States General Accounting Office",
TITLE="Domestic Mail Manual",
PUBLISHER="U.S. Government Printing Office",
ADDRESS="Washington, DC",
NOTE="HE6361, 4118, no. 43.",
YEAR=1992,
}

@INCOLLECTION{Faul92:Pricing,
AUTHOR="Gerald Faulhaber",
TITLE="Pricing Internet: The Efficient Subsidy",
BOOKTITLE="Building Information Infrastructure",
EDITOR="Brian Kahin",
PUBLISHER="McGraw-Hill Primis",
YEAR=1992,
}

@ARTICLE{Gild92:Fibersphere,
AUTHOR="George Gilder",
TITLE="Into the Fibersphere",
JOURNAL="Forbes",
VOLUME="xx",
PAGES="111-124",
YEAR=1992,
}

@ARTICLE{Hoff92:NSFNET,
AUTHOR="Ellen Hoffman",
TITLE="{T-1} {NSFNET} Passes into History as {T-3} Takes Over",
JOURNAL="Information Technology Digest",
VOLUME=2,
NUMBER=1,
PAGES="7-8",
YEAR=1992,
}

@INCOLLECTION{Hoga92:Energy,
AUTHOR="Wiliam W. Hogan",
TITLE="Energy and Information Network Infrastructures",
BOOKTITLE="Building Information Infrastructure",
EDITOR="Brian Kahin",
PUBLISHER="McGraw-Hill Primis",
YEAR=1992,
}

@INCOLLECTION{Kahi92:Overview,
AUTHOR="Brian Kahin",
TITLE="Overview: Understanding the {NREN}",
BOOKTITLE="Building Information Infrastructure",
EDITOR="Brian Kahin",
PUBLISHER="McGraw-Hill Primis",
ADDRESS="NY",
YEAR=1992,
}

@INCOLLECTION{Kahi92:NREN,
AUTHOR="Brian Kahin",
TITLE="The {NREN} as Information Market: Dynamics of Publishing",
BOOKTITLE="Building Information Infrastructure",
EDITOR="Brian Kahin",
PUBLISHER="McGraw-Hill Primis",
YEAR=1992,
}

@BOOK{Kahi92:Building,
AUTHOR="Brian Kahin",
TITLE="Building Information Infrastructure",
PUBLISHER="McGraw-Hill Primis",
ADDRESS="New York",
YEAR=1992,
}

@INCOLLECTION{Kapo92:Building,
AUTHOR="Mitchell Kapor and Jerry Berman",
TITLE="Building the Open Road: the {NREN} as Test-Bed for the {NPN}",
BOOKTITLE="Building Information Infrastructure",
EDITOR="Brian Kahin",
PUBLISHER="McGraw-Hill Primis",
YEAR=1992,
}

@INCOLLECTION{Klei92:Technology,
AUTHOR="L. Kleinrock",
TITLE="Technology Issues in the Design of {NREN}",
BOOKTITLE="Building Information Infrastructure",
EDITOR="Brian Kahin",
PUBLISHER="McGraw-Hill Primis",
YEAR=1992,
}

@INCOLLECTION{Klin92:Coming,
AUTHOR="Ken Klingenstein",
TITLE="A Coming of Age: The Design of the Low-End {Internet}",
BOOKTITLE="Building Information Infrastructure",
EDITOR="Brian Kahin",
PUBLISHER="McGraw-Hill Primis",
YEAR=1992,
}

@BOOK{Krol92:Whole,
AUTHOR="Ed Krol",
TITLE="The Whole {Internet}",
PUBLISHER="O'Reilly \& Associates, Inc.",
ADDRESS="Sebastopol, California",
YEAR=1992,
}

@TECHREPORT{Lehr92:Compatibility,
AUTHOR="William H. Lehr",
TITLE="Compatibility Standards and the {Internet}",
INSTITUTION="Graduate School of Business, Columbia University",
YEAR=1992,
}

@INCOLLECTION{Mand92:Strategic,
AUTHOR="Richard Mandelbaum and Paulette A. Mandelbaum",
TITLE="The Strategic Future of the Mid-Level Networks",
BOOKTITLE="Building Information Infrastructure",
EDITOR="Brian Kahin",
PUBLISHER="McGraw-Hill Primis",
YEAR=1992,
}

@INCOLLECTION{McGa92:Alternative,
AUTHOR="Terrence P. McGarty",
TITLE="Alternative Networking Architectures: Pricing, Policy, and
Competition",
BOOKTITLE="Building Information Infrastructure",
EDITOR="Brian Kahin",
PUBLISHER="McGraw-Hill Primis",
YEAR=1992,
}

@INCOLLECTION{McKn92:European,
AUTHOR="Lee McKnight",
TITLE="European and Japanese Research Networks: Cooperating to Compete",
BOOKTITLE="Building Information Infrastructure",
EDITOR="Brian Kahin",
PUBLISHER="McGraw-Hill Primis",
YEAR=1992,
}

@INCOLLECTION{Mech92:State,
AUTHOR="Jerry Mechling",
TITLE="A State-Level View of Information Infrastructure",
BOOKTITLE="Building Information Infrastructure",
EDITOR="Brian Kahin",
PUBLISHER="McGraw-Hill Primis",
YEAR=1992,
}

@ARTICLE{Moul92:Serial,
AUTHOR="Herve Moulin and S. Shenker",
TITLE="Serial Cost Sharing",
JOURNAL="Econometrica",
VOLUME=60,
NUMBER=5,
PAGES="1009-1037",
YEAR=1992,
}

@INCOLLECTION{Perr92:Market,
AUTHOR="Perritt, Jr., Henry H.",
TITLE="Market Structures for Electronic Publishing and Electronic
Contracting",
BOOKTITLE="Building Information Infrastructure",
EDITOR="Brian Kahin",
PUBLISHER="McGraw-Hill Primis",
YEAR=1992,
}

@ARTICLE{Sand92:Asynchronous,
AUTHOR="B. Sanders",
TITLE="An Asynchronous, Distributed Flow Control Algorithm for Rate
Allocation in Computer Networks",
JOURNAL=ieeetc,
VOLUME=37,
PAGES="1067-1072",
YEAR=1992,
}

@INCOLLECTION{Smar92:Life,
AUTHOR="Larry Smarr and C. E. Catlett",
TITLE="Life After Internet: Making Room for New Applications",
BOOKTITLE="Building Information Infrastructure",
EDITOR="Brian Kahin",
PUBLISHER="McGraw-Hill Primis",
YEAR=1992,
}

@TECHREPORT{Stah92:Economic,
AUTHOR="Dale O. Stahl and Andrew B. Whinston",
TITLE="An Economic Approach to Client-Server Computing with Priority
Classes",
INSTITUTION="University of Texas at Austin",
YEAR=1992,
}

@ARTICLE{Woo92:Authentication,
AUTHOR="Tai-Kuo Woo and S. S. Lam",
TITLE="Authentication for Distributed Systems",
JOURNAL=ieeecomp,
VOLUME=25,
NUMBER=1,
PAGES="39-52",
YEAR=1992,
}

@TECHREPORT{Schi92:Operational,
AUTHOR="I. Schieferdecker and Adam M Wolisz",
TITLE="Operational Semantics of Timed Interacting Systems: an Algebraic
Performance Oriented Formal Description Technique",
INSTITUTION="Department of Computer Science, Technical University
Berlin",
NUMBER="92/19",
YEAR=1992,
KEYWORDS="formal description technique; real-time modelling; operational
semantics",
ABSTRACT="Extending formal description techniques so as to support
direct performance analysis out of the formal specification is an
appealing idea in the communication protocol engineeirng.  Recently, a
new proposal fro such an extension of the process algebraic
specification called Timed Interacting Systems (TIS) has been
formulated.  TIS includes the notion of time consumed before and during
a communication event, quantification of nondeterminism via assigning
probabilities to alternative communication events as well as a specific
concpet of resources needed to execute a communication event.  In this
report we present the operational semantics for a major subset of TIS.",
URL="ftp://ftp.fokus.gmd.de/pub/step/papers/SchiWoli.X92.Operational.ps.gz",
}

@INPROCEEDINGS{Ditt92:Towards,
AUTHOR="Jürgen Dittrich and Adam M Wolisz",
TITLE="Towards Cooperative Use of Shared Data in open Distributed
Systems",
BOOKTITLE="IFIP Transactions on Open Distributed Processing",
EDITOR="J. deMeer and V. Heymer and R. Roth",
ORGANIZATION="IFIP",
PUBLISHER="North Holland",
VOLUME="C-1",
PAGES="179-190",
YEAR=1992,
}

@INPROCEEDINGS{Woli92:Performance,
AUTHOR="Markus Walch and Adam M Wolisz and R. Ruppelt",
TITLE="Performance of Connection Management Policies for a {LAN} to
Broadband {ISDN} Gateway",
BOOKTITLE="Performance of Distributed Systems and Integrated
Communication Systems",
EDITOR="T. Hasegawa and H. Takagi and Y. Takahashi",
SERIES="IFIP Transactions",
ORGANIZATION="IFIP",
PUBLISHER="North Holland",
VOLUME="C-5",
PAGES="79-98",
YEAR=1992,
}

@ARTICLE{Rodd92:Supporting,
AUTHOR="T. Rodden and J. A. Mariani and G. S. Blair",
TITLE="Supporting cooperative applications",
JOURNAL="Computer Supported Cooperative Work (CSCW)",
VOLUME=1,
NUMBER=1,
PAGES="41-67",
YEAR=1992,
REFERENCES=53,
KEYWORDS="CSCW; cooperative applications; database technology;
distributed systems; groupware; systems support",
ABSTRACT="Cooperative applications which have started to emerge from
CSCW research place new demands on the computer technology used to
support them. These demands raise a number of fundamental questions
about the way in which computing systems provide application support.
This paper examines a number of issues surrounding the support of
cooperative applications and how they impact both CSCW and computer
science research. In particular, the relationship between cooperative
applications and the supporting techniques of distributed systems and
database technology are investigated. Cooperative applications question
many of the design assumptions embodied within these techniques, and ask
far reaching questions of the technology. Traditionally, support systems
have been unaware of cooperative activities and have hidden the actions
of others from each user. This paper examines the implications of this
choice and the need to consider alternative approaches to the provision
of systems support. The paper concludes by highlighting a number of
issues which need to be addressed both by computer science and CSCW
researchers.",
}

@ARTICLE{Schm92:Taking,
AUTHOR="K. Schmidt and L. Bannon",
TITLE="Taking {CSCW} seriously -- supporting articulation work",
JOURNAL="Computer Supported Cooperative Work (CSCW)",
VOLUME=1,
NUMBER=1,
PAGES="7-40",
YEAR=1992,
REFERENCES=100,
KEYWORDS="CSCW; cooperative work; articulation work; common information
space",
ABSTRACT="The topic of computer supported cooperative work (CSCW) has
attracted much attention in the last few years. While the field is
obviously still in the process of development, there is a marked
ambiguity about the exact focus of the field. This lack of focus may
hinder its further development and lead to its dissipation. In this
paper we set out an approach to CSCW as a field of research which we
believe provides a coherent conceptual framework for this area,
suggesting that it should be concerned with the support requirements of
cooperative work arrangements. This provides a more principled,
comprehensive, and, in our opinion, more useful conception of the field
than that provided by the conception of CSCW as being focused on
computer support for groups. We then investigate the consequences of
taking this alternative conception seriously, in terms of research
directions for the field. As an indication of the fruits of this
approach, we discuss the concept of articulation work and its relevance
to CSCW. This raises a host of interesting problems that are
marginalized in the work on small group support but critical to the
success of CSCW systems 'in the large', i.e., that are designed to meet
current work requirements in the everyday world.",
}

@ARTICLE{Fisc92:Approximations,
AUTHOR="W. Fischer and D. A. Stanford",
TITLE="Approximations for the per-class waiting time and interdeparture
time in the Sum {GI/GI/1} queue",
JOURNAL=pe,
VOLUME=14,
NUMBER=2,
PAGES=19,
YEAR=1992,
REFERENCES=36,
KEYWORDS="Queueing system; GI/G/1; waiting time; approximation",
ABSTRACT="This article deals with an approximation for the first two
moments of the per-class waiting time distributions, the prob. of
delay,",
}

@ARTICLE{Kalt92:Verkehrskontrolle,
AUTHOR="B. Kaltenmorgen and R. Kleinewillinghöfer-Kopp",
TITLE="Verkehrskontrolle in {ATM-Netzen}",
JOURNAL=fernmelde,
VOLUME=46,
NUMBER=1,
PAGES="1-33",
YEAR=1992,
LANGUAGE="German",
REFERENCES=55,
KEYWORDS="ATM; source policing; connection admission control; overload
control; leaky bucket; survey",
}

@TECHREPORT{Zubi92:Traffic,
AUTHOR="Luis Zubieta",
TITLE="Traffic characteristics and switch architecture",
INSTITUTION="EPFL Laboratoire de telecommunications internal report TCOM
92-03",
ADDRESS="Lausanne",
PAGES=14,
YEAR=1992,
REFERENCES=4,
KEYWORDS="ATM; traffic source model; performance evaluation; switching
block",
ABSTRACT="This paper proposes the utilization of the granularity
parameter for dimensioning of switches; limited to output buffered
systems.",
}

@ARTICLE{Zhan92:Nonbifurcated,
AUTHOR="Z. Zhang and H. L. Hartmann",
TITLE="On the nonbifurcated routing in virtual circuit communication
networks",
JOURNAL=ett,
VOLUME=3,
NUMBER=1,
PAGES="45-53",
YEAR=1992,
REFERENCES=19,
KEYWORDS="Routing; flow control; optimization",
ABSTRACT="RMCF (related multicommodity flow) and SMCF (symmetrical)",
}

@ARTICLE{Yama92:Statistical,
AUTHOR="Hiroshi Yamada and F. Machihara",
TITLE="Performance analysis of a statistical multiplexer with control on
input and/or service processes",
JOURNAL=pe,
VOLUME=14,
NUMBER=1,
PAGES="21-41",
YEAR=1992,
REFERENCES=25,
KEYWORDS="ATM; statistical multiplexer; MMPP; performance evaluation;
matrix analytic method",
ABSTRACT="We propose a compound phase type Markov reneval process, which
includes an N-process, as well as MMPP to represent voice, data and
video packet streams and their superpositions.",
}

@ARTICLE{Klei92:Poisson,
AUTHOR="L. Kleinrock and F. Mehovic",
TITLE="Poisson winner queues",
JOURNAL=pe,
VOLUME=14,
NUMBER=2,
PAGES="79-101",
YEAR=1992,
REFERENCES=8,
KEYWORDS="Queueing system; multiserver; Markov chain; database",
ABSTRACT={We study "winner queues", in which all customers are served
concurrently. A customer in a winner will successfully finish his
service and leave, if no other customer leaves during his current
service. All other customers in service at that time "lose". There are
four disciplines considered: silent-redraw, silent-noredraw, broadcast
redraw, broadcast-noredraw.},
}

@ARTICLE{Lato92:Unified,
AUTHOR="G. Latouche and V. Ramaswami",
TITLE="A unified stochastic model for the packet stream from periodic
sources",
JOURNAL=pe,
VOLUME=14,
NUMBER=2,
PAGES="103-121",
YEAR=1992,
REFERENCES=13,
KEYWORDS="ATM; traffic source model; statistical multiplexer; phase-type
model",
ABSTRACT="Motivated by applications to performance analysis of packet
communication systems with synchronous slotted cells, a unified
stochastic model is developed to describe the packet stream generated by
periodic sources. The model permits the incorporation of the statistical
characteristics of the call setup instants as well as those of the
holding time and packet generation scenarios of individual calls.",
}

@ARTICLE{Brac92:TCP,
AUTHOR="A. Braccini and A. Del Bimbo and E. Vicario",
TITLE="{TCP/IP} measured performance over an Ethernet local network",
JOURNAL=ett,
VOLUME=3,
NUMBER=1,
PAGES="77-83",
YEAR=1992,
REFERENCES=14,
KEYWORDS="Communication protocol; TCP/IP; traffic measurement; traffic
generator; performance evaluation",
ABSTRACT="An evaluation of the performance of the Internet protocol
suite in the persence of background load is presented. A reproducible
experimental environment and a methodology to achieve accuray in
measurements were developed.",
}

@ARTICLE{Habe92:Aspekte,
AUTHOR="R. Habermann and G. Kettler and M. Sommer",
TITLE="Aspekte der {ATM-Vermittlung}",
JOURNAL=fernmelde,
ADDRESS="Darmstadt",
VOLUME=46,
NUMBER=3,
PAGES="1-24",
YEAR=1992,
LANGUAGE="German",
REFERENCES=8,
KEYWORDS="ATM; switching network; input buffer; output buffer; priority;
performance evaluation; simulation; connection admission control",
ABSTRACT="Survey on ATM techniques",
}

@ARTICLE{Wu92:Multistage,
AUTHOR="Chengke Wu and M. J. Lee",
TITLE="Performance analysis of multistage interconnection network
configurations and operations",
JOURNAL=ieeetc,
VOLUME="C-41",
NUMBER=1,
PAGES="18-27",
YEAR=1992,
REFERENCES=7,
KEYWORDS="Circuit switching; multistage interconnection network;
performance evaluation",
ABSTRACT="Performance evaluation, using both analytical and simulation
models of circuit-switching multistage interconnection networks in
aspects of configurations and operations is considered.",
}

@ARTICLE{Goya92:Unified,
AUTHOR="A. Goyal and P. Shahabuddin and P. Heidelberger and  others",
TITLE="A unified framework for simulating Markovian models of highly
dependable systems",
JOURNAL=ieeetc,
VOLUME="C-41",
NUMBER=1,
PAGES="36-51",
YEAR=1992,
REFERENCES=47,
KEYWORDS="Simulation; importance sampling; Markov system; variance
reduction",
ABSTRACT="We present a unfied framework for the simulation of highly
dependable systems. We show that a variance reduction technique called
Importance Sampling can be used to spedd up simulation by many orders of
magnitude.",
}

@INPROCEEDINGS{Guil92:Spacer,
AUTHOR="F. Guillemin and P. Boyer and L. Romoeuf",
TITLE="The Spacer-Controller: Architecture and First Assessment",
BOOKTITLE="Workshop on Broadband Communications",
ADDRESS="Estoril",
PAGES="294-304",
YEAR=1992,
REFERENCES=12,
KEYWORDS="ATM; traffic control; source policing",
ABSTRACT="The authors focus on the problem of peak rate enforcement.
They propose cell spacing as an efficient solution to the problem.
Therefore they use a so-called Spacer-Controller which is mainly
composed of two elements: a spacing algorithm supported by an
architecture. It turns out that a Spacer-Controller reduces the cell
delay variation equivalent to one multiplexing stage.",
}

@ARTICLE{Mele92:Current,
AUTHOR="R. Melen",
TITLE="Current architectures for {ATM} implementation",
JOURNAL=ett,
VOLUME=3,
NUMBER=2,
PAGES="145-155",
YEAR=1992,
REFERENCES=52,
KEYWORDS="ATM; switching network; survey; performance evaluation",
ABSTRACT="This paper is devoted to the classification and assessment of
the ATM switching architectures; a top down approach is attempted in the
classification of sw architectures, with the aim of giving an abstract
view of the possible options and setting a common, clearly
understandable framework for their comparison. This classification is
used as a guideline for a review of the currend trends in ATM
switching.",
}

@ARTICLE{Frat92:Congestion,
AUTHOR="L. Fratta and L. Musumeci and Giorgio Gallassi and L. Verri",
TITLE="Congestion control strategies in {ATM} networks",
JOURNAL=ett,
VOLUME=3,
NUMBER=2,
PAGES="183-193",
YEAR=1992,
REFERENCES=21,
KEYWORDS="ATM; connection admission control; congestion control;
performance evaluation; source policing; survey",
ABSTRACT="The paper reviews the major results on the analysis of the
control mechanisms: CAC, UPC, traffic shaping.",
}

@INPROCEEDINGS{Chan92:Traffic,
AUTHOR="J. Chandramohan",
TITLE="A traffic engineering model for trunk groups with digital circuit
multiplication systems-analysis and numerical results",
BOOKTITLE=itc13,
ISBN=0444888664,
ADDRESS="Copenhagen",
VOLUME=14,
PAGES="243-246",
YEAR=1992,
REFERENCES=4,
KEYWORDS="Circuit switching; network planning; traffic model; blocking;
voice communication; voice coding",
ABSTRACT="We present a traffic engineering model that analyzes the
performance of trunk groups equipped with digital circuit multiplication
systems (DCMS). We show that if voice band data (VBD) is a significant
traffic portion, trunk group blocking is dramatically higher than
expected under traditional traffic models.",
}

@INPROCEEDINGS{Gran92:Dynamic,
AUTHOR="G. Granel and S. Herranz and M. Eugenio",
TITLE="A dynamic assignment method for trunk reservation parameters in
circuit networks",
BOOKTITLE=itc13,
ISBN=0444888664,
ADDRESS="Copenhagen",
VOLUME=14,
PAGES="231-235",
YEAR=1992,
REFERENCES=14,
KEYWORDS="Circuit switching; channel assignment; dynamic resource
allocation; reservation",
ABSTRACT="This paper presents an algorithm optimizing trunk reservation
parameters, which can be able to be associated with a supervision system
for an adaptive assignment of values to these parameters in a circuit
network.",
}

@INPROCEEDINGS{Tiba92:Implied,
AUTHOR="K. Tibas and M. Lebourges",
TITLE="Implied costs behaviour and optimal modular dimensioning",
BOOKTITLE=itc13,
ISBN=0444888664,
ADDRESS="Copenhagen",
VOLUME=14,
PAGES="237-242",
YEAR=1992,
REFERENCES=8,
KEYWORDS="Circuit switching; network planning; network optimization",
ABSTRACT="A study of trunk-group implied costs in circuit-switched
networks. Implied costs for large capacity variations in closed form are
given. Network dimensioning is considered and simple optimality
criterion for modular dimensioning is given. A efficient short-term
planning rule is tested numerically.",
}

@ARTICLE{Ozaw92:Multiqueue,
AUTHOR="T. Ozawa",
TITLE="Analysis of a multiqueue model for an {ISDN} access interface",
JOURNAL=pe,
VOLUME=15,
NUMBER=2,
PAGES="65-76",
YEAR=1992,
REFERENCES=15,
KEYWORDS="D-channel; queueing theory; multiqueue; decomposition",
ABSTRACT="The D-channel access mechanism is modelled.",
}

@ARTICLE{Nish92:Approximate,
AUTHOR="T. Nishida",
TITLE="Approximate analysis for heterogeneous multiprocessor systems
with priority jobs",
JOURNAL=pe,
VOLUME=15,
NUMBER=2,
PAGES="77-88",
YEAR=1992,
REFERENCES=17,
KEYWORDS="Queueing system; approximation; preemptive priority;
nonpreemptive priority; multiserver",
ABSTRACT="This paper presents an approximate analysis for a
heterogeneous multiprocessor system with preemptive and nonpreemptive
priority discipline.",
}

@ARTICLE{Tedi92:Note,
AUTHOR="T. E. Tedijanto",
TITLE="A note on the comparison between Bernoulli and limited policies
in vacation models",
JOURNAL=pe,
VOLUME=15,
NUMBER=2,
PAGES="89-97",
YEAR=1992,
REFERENCES=12,
KEYWORDS="Queueing system; server vacation",
ABSTRACT="Two vacation policies are studied.",
}

@ARTICLE{Kauf92:Blocking,
AUTHOR="J. S. Kaufman",
TITLE="Blocking with retrials in a completely shared resource
environment",
JOURNAL=pe,
VOLUME=15,
NUMBER=2,
PAGES="99-113",
YEAR=1992,
REFERENCES=17,
KEYWORDS="Loss system; blocking; Erlang B formula",
ABSTRACT="A new generalization of the Erlang B formula is described.",
}

@ARTICLE{Schm92:Further,
AUTHOR="L. Schmickler",
TITLE="Further applications of the optimal strategy {SRPT} to media
access protocols in local area networks",
JOURNAL=ett,
ADDRESS="Milano",
VOLUME=3,
PAGES="0281-0288",
YEAR=1992,
KEYWORDS="LAN; CSMA/CD; FDDI; SRPT; shortest remaining processing time;
oken ring; token bus",
}

@ARTICLE{Nico92:Conservative,
AUTHOR="D. M. Nicol",
TITLE="Conservative parallel simulation of priority class queueing
networks",
JOURNAL=ieeepds,
VOLUME=3,
NUMBER=3,
PAGES="294-303",
YEAR=1992,
REFERENCES=13,
KEYWORDS="Distributed simulation; queueing system; priority;
synchronization",
ABSTRACT="This paper describes a conservative synchronization protocol
for the parallel simulation of queueing networks having C job priority
classes, where a job's class is fixed. Our solution is to skew the event
generation activity so that events for higher priority jobs are
generated farther ahead in time than lower priority jobs.",
}

@INPROCEEDINGS{Aane92:Cell,
AUTHOR="Eimert Aanen and J. van den and Rein de Vries",
TITLE="Cell Loss Performance of the Gauss {ATM} Switch",
BOOKTITLE=infocom,
ADDRESS="Florence",
PAGES="717-726",
YEAR=1992,
REFERENCES=7,
KEYWORDS="ATM; switching system; output buffer; speedup; performance
evaluation; analysis; loss probability; Markov chain",
}

@INPROCEEDINGS{Bass92:ATM,
AUTHOR="S. Bassi and M. Decina and Achille Pattavina",
TITLE="Performance Analysis of the {ATM} Shuffleout Switching
Architecture under Non-Uniform Traffic Patterns",
BOOKTITLE=infocom,
ADDRESS="Florence, Italy",
PAGES="735-742",
YEAR=1992,
REFERENCES=22,
KEYWORDS="ATM; switching system; multistage interconnection network;
self routing; unbalanced traffic; performance evaluation; analysis",
ABSTRACT="Shuffleout is a blocking multistage structure using shortest
path routing with deflection, in which output queues are connec-ted to
all stages. The analytical model computes the load on each interstage
link bytracing all the paths that a packet can follow, that is by taking
into account all the deflections from its shortest path it can receive.
Fairness in packet switching by Shuffleout is straightforwardly provided
by the model.",
}

@INPROCEEDINGS{Bian92:Nonblocking,
AUTHOR="R. Bianchini and H. Kim",
TITLE="Design of a Nonblocking Shared-Memory Copy Network for {ATM}",
BOOKTITLE=infocom,
ADDRESS="Florence",
PAGES="876-885",
YEAR=1992,
REFERENCES=17,
KEYWORDS="ATM; switching system; multicast; architecture; central
buffer; performance evaluation; simulation",
}

@ARTICLE{Blon92:ATM,
AUTHOR="C. Blondia",
TITLE="Performance Evaluation of an M/1-stage in an {ATM} Switching
element",
JOURNAL=pe,
VOLUME=15,
NUMBER=1,
PAGES="1-20",
YEAR=1992,
REFERENCES=22,
KEYWORDS="ATM; switching; output buffer; input buffer; analysis;
performance evaluation; bursty traffic; MAP/G/1; cyclic service; limited
service; server vacation; matrix analytic method",
}

@ARTICLE{Chao92:Shared,
AUTHOR="Hung-Po Chao and D. G. Smith",
TITLE="A Shared-Memory Virtual Channel Queue for {ATM} Broadband
Terminal adaptors",
JOURNAL="International Journal of Digital and Analog Communication
Systems",
VOLUME=5,
NUMBER=1,
PAGES="29-37",
YEAR=1992,
REFERENCES=10,
KEYWORDS="ATM; packet switching; terminal; broadband; reassembly; buffer
dimensioning; buffer management; performance evaluation; analysis",
ABSTRACT="The interface between computer hosts or LANs and the ATM
network(commonly called a broadband terminal adaptor, BTA) provides
thenecessary format conversion for the data packets and the ATM cells.
It is conceivable that multiple packets from different virtual channels
are interleaved as they arrive at the receiver-end BTA. The BTA must
have a sufficiently large buffer, called avirtual channel queue, to
temporarily store partially reveived",
}

@ARTICLE{Chau92:Computational,
AUTHOR="M. L. Chaudry and J. G. C. Templeton and J. Medhi",
TITLE="Computational Results of Multiserver Bulk-Arrival Queues with
constant Service Time",
JOURNAL=or,
VOLUME=40,
NUMBER=2,
PAGES="229-238",
YEAR=1992,
REFERENCES=13,
KEYWORDS="Queueing system; bulk arrival; batch arrival; multiserver;
constant service time; performance evaluation; analysis",
ABSTRACT="We present an algorithm for numerically finding the limiting
distribution of the number in the system for the bulk-arrival,
multiserver queueing system MX/D/c. Sample numerical results andgraphs
of various quantities of interest are also presented.",
}

@INPROCEEDINGS{Chen92:Buffer,
AUTHOR="D. X. Chen and J. W. Mark",
TITLE="A Buffer Management Scheme for the {SCOQ} Switch under Nonuniform
traffic",
BOOKTITLE=infocom,
ADDRESS="Florence",
VOLUME=1,
PAGES="132-140",
YEAR=1992,
REFERENCES=15,
KEYWORDS="ATM; switching; architecture; performance evaluation;
multistage interconnection network; Batcher-Banyan; analysis; output
buffer; unbalanced traffic; hot spot",
}

@INPROCEEDINGS{Clar92:Overview,
AUTHOR="D. D. Clark and B. S. Davie and  others",
TITLE="An Overview of the {AURORA} Gigabit Testbed",
BOOKTITLE=infocom,
ADDRESS="Florence",
PAGES="569-581",
YEAR=1992,
REFERENCES=17,
KEYWORDS="High speed; network; integrated network; test; ATM; packet
switching; architecture; application",
ABSTRACT="AURORA is one of five US testbeds charged with exploring
applications of, and technologies necessary for, networks operating at
gigabit per second or higher bandwidths.  AURORA is also an experiment
in collaboration, where government support has spurred interaction among
centers of excellence in industry, academia and government. This paper
provides an overview of the goals and methodologies employed in AURORA,
and preliminary results.",
}

@INPROCEEDINGS{Dork92:TMS,
AUTHOR="H. Dörken and R. Habermann and M. Sommer",
TITLE="{TMS} - Transputer Management System",
BOOKTITLE="3. Transputer Anwendertreffen",
EDITOR="W. Brauer",
ISBN="3-540-55386-X",
PUBLISHER="Springer Verlag",
ADDRESS="Aachen",
PAGES=338,
NOTE="in Informatik Fachberichte",
YEAR=1992,
LANGUAGE="German",
REFERENCES=7,
KEYWORDS="ATM; switching; multistage interconnection network;
performance evaluation; simulation; transputer; distributed simulation;
parallel software",
}

@ARTICLE{Eng92:Growable,
AUTHOR="K. Y. Eng and Mark Karol and Y.-S. Yeh",
TITLE="A Growable Packet {(ATM)} Switch Architecture: Design Principles
and Applications",
JOURNAL=ieeecom,
VOLUME="COM-40",
NUMBER=2,
PAGES="423-430",
YEAR=1992,
REFERENCES=18,
KEYWORDS="ATM; switching network; architecture; knockout switch;
multistage interconnection network; output buffer",
ABSTRACT="We propose and study a growable switch architecture based on
three key principles: a) a generalized knockout principle exploits the
statistical behaviour of packet arrivals and thereby reduces the
interconnect complexity, b) output queueing yields the best possible
delay/throughput performance, and c) distribu-ted intelligence in
routing packets through the interconnect fabric eliminates internal path
conflicts. Other attractive",
}

@ARTICLE{Gidr92:TeraNet,
AUTHOR="R. Gidron",
TITLE="TeraNet: A Multi-Gigabits per Second {ATM} Network",
JOURNAL=comcom,
VOLUME=15,
NUMBER=3,
PAGES="143-152",
YEAR=1992,
REFERENCES=22,
KEYWORDS="ATM; communication network; fiber optics; switching;
architecture",
ABSTRACT="TeraNet is an experimental network being built at the Center
forTelecommunications Research, Columbia University. The design
principles of TeraNet incorporate three main principles: a transmission
medium that contains multiple channels; a system architecture that
employs a multihop approach to routing packetsand a traffic control
architecture that supports multiple traffic classes.",
}

@INPROCEEDINGS{Goli92:Crosspoint,
AUTHOR="Praveen Goli and V. Kumar",
TITLE="Performance of a Crosspoint Buffered {ATM} Switch Fabric",
BOOKTITLE=infocom,
ADDRESS="Florence",
VOLUME=1,
PAGES="426-435",
YEAR=1992,
REFERENCES=10,
KEYWORDS="ATM; switching; multistage interconnection network; Banyan
network; performance evaluation; analysis; bursty traffic; simulation",
}

@ARTICLE{Guil92:Basic,
AUTHOR="F. Guillemin and A. Dupuis",
TITLE="A Basic Requirement for the Policing Function in {ATM} Networks",
JOURNAL=cnis,
VOLUME=24,
PAGES="311-320",
YEAR=1992,
REFERENCES=19,
KEYWORDS="ATM; congestion control; policing function; leaky bucket;
statistical multiplexer; performance evaluation; analysis; bursty
traffic; MMBP",
ABSTRACT="In this paper we draw attention to the fact that cell clusters
of a given connection can pass transparently at the multiplex rate
through some of the pickup policing mechanisms, giving riseto a bursty
component entering the network. The impact of this bursty component on
network performance is analyzed in a possib-le network configuration,
involving a switch based upon an output queueing architecture. It
appears that even slightly bursty",
}

@INPROCEEDINGS{Guil92:Limitation,
AUTHOR="F. Guillemin and Wei Monin",
TITLE="Limitation of Cell Delay Variation in {ATM} Networks",
BOOKTITLE=icct,
ADDRESS="Beijing",
YEAR=1992,
REFERENCES=12,
KEYWORDS="ATM; source policing; policing function; delay; jitter;
performance evaluation; analysis; simulation",
ABSTRACT="The initial time structure of any connection passing through
an ATM is altered by random delays experienced by cells due for example
to queueing in multiplexing stages. This phenomenon is known as cell
delay variation (CDV). We recall in the present paper its basic effects,
namely clumping and dispersion. We analyse their networking aspects and
we investigate how they canbe limited. In the case of clumping, we use
the concept of",
}

@INPROCEEDINGS{Hube92:Proposed,
AUTHOR="M. Huber and V. Frantzen and G. Maegerl",
TITLE="Proposed Evolutionary Path for {BISDN} Signalling",
BOOKTITLE=iss,
ADDRESS="Yokohama",
YEAR=1992,
REFERENCES=8,
KEYWORDS="BISDN; ATM; signalling protocol; network evolution",
ABSTRACT="In our paper we propose evolutionary paths for signalling
trans-fer and signalling applications. In order to meet the two goals -
early deployment of the ATM technology and and integration of any kind
of service into one network - we envisage a phased approach for BISDN
signalling. Our concept allows an independent evolution of signalling
transport and signalling applications. Therefore, other applications
like mobile communications",
}

@ARTICLE{Jabb92:Efficient,
AUTHOR="B. Jabbari and F. Yegenoglu",
TITLE="An Efficient Method for Computing Cell Loss Probability for
heterogeneous Bursty Traffic in {ATM} Networks",
JOURNAL="International Journal of Digital and Analog Communication
Systems",
VOLUME=5,
NUMBER=1,
PAGES="39-48",
YEAR=1992,
REFERENCES=15,
KEYWORDS="ATM; connection admission control; statistical multiplexing;
nalysis; loss probability; convolution algorithm; approximation; bursty
traffic",
ABSTRACT="In this paper, we present an approximation for the probability
of cell loss of heterogeneous bursty traffic in broadband integrated
packet networks based on the asynchronous transfer mode. The sources
considered here alternate between active and silent periods and are
characterized by the peak and average transmission rates. The cell loss
probability is obtained by conside-ring only the number of active
sources at a given time and.",
}

@ARTICLE{Kafk92:Coming,
AUTHOR="H. J. Kafka and Roger P. Levy and D. Schriftgiesser",
TITLE="The Coming Broadband Network",
JOURNAL="AT\&T Technology",
VOLUME=7,
NUMBER=1,
PAGES="18-25",
YEAR=1992,
KEYWORDS="BISDN; network evolution; data communication; SMDS; ATM;
switching system",
ABSTRACT="AT\&Ts view on the evolution to broadband",
}

@ARTICLE{Karl92:Adaptive,
AUTHOR="J. Karlsson and Harry Perros and I. Viniotis",
TITLE="Adaptive Polling Schemes for an {ATM} Bus with Bursty Arrivals",
JOURNAL=cnis,
VOLUME=24,
NUMBER=1,
PAGES="93-103",
YEAR=1992,
REFERENCES=6,
KEYWORDS="ATM; switching; architecture; bus; bus arbitration; polling;
service discipline; limited service; gated service; xhaustive service;
performance evaluation; simulation; bursty traffic; loss probability;
mean waiting time",
}

@ARTICLE{Kham92:Discrete,
AUTHOR="Asad Khamisy and M. Sidi",
TITLE="Discrete-time priority queues with two-state Markov modulated
arrivals",
JOURNAL="Stochastic Models",
VOLUME=8,
NUMBER=2,
PAGES="337-357",
YEAR=1992,
REFERENCES=10,
KEYWORDS="Queueing system; discrete time; priority; analysis;
multiqueue; batch arrival; Markov chain; infinite queue; generating
function",
ABSTRACT="A class of discrete-time priority queueing systems with Markov
Modulated arrivals is considered. In these systems, $N$ queues areserved
by a single server according to priorities that are pre-assigned to the
queues. Packet arrivals are modeled as discrete-time batch processes
with a distribution that depends on the state of an independent common
two-state Markov chain. We derivethe steady state joint generating
functions of the queue length",
}

@ARTICLE{Kim92:Call,
AUTHOR="C. Kim and T. T. Lee",
TITLE="Call Scheduling Algorithms in a Multicast Switch",
JOURNAL=ieeecom,
VOLUME="COM-40",
NUMBER=3,
PAGES="625-635",
YEAR=1992,
REFERENCES=9,
KEYWORDS="STM; circuit switching; multicast; switching; algorithm;
performance evaluation; analysis; blocking",
ABSTRACT="In this paper we develop and analyze call scheduling
algorithms for a multicast circuit switch. In particular, we examine two
general classes of scheduling algorithms: call packing algorithms and
call splitting algorithms. Performance improvement bycall packing
examined in this paper is shown to be negligible. in contrast, call
splitting algorithms can provide significantlylower blocking by reducing
the level of output port contention.",
}

@ARTICLE{Kim92:Nonblocking,
AUTHOR="H. Kim and A. Leon-Garcia",
TITLE="Nonblocking Property of Reverse Banyan Networks",
JOURNAL=ieeecom,
VOLUME="COM-40",
NUMBER=3,
PAGES="472-476",
YEAR=1992,
REFERENCES=11,
KEYWORDS="Multistage interconnection network; Banyan network;
nonblocking; traffic pattern; traffic distribution; ATM; fast packet
switching; switching network",
ABSTRACT="The nonblockong property of the Banyan network with a
particularinput traffic pattern is found and proved. This input packet
pattern consists of packets in the input ports with either increasing or
decreasing output addresses. In this paper, we present a newly found
nonblocking property of the reverse banyan network. If the input packets
have consecutive output address, modulo $N$, then the reverse banyan
network is nonblocking.",
}

@INPROCEEDINGS{Lamb92:Circuit,
AUTHOR="Ioannis Lambadaris and Xiaopeng Chen and J. F. Hayes and F.
Ghazi-Moghaddam",
TITLE="Performance Evaluation of a Circuit-Switched Node with Queueable
overflow Traffic",
BOOKTITLE=icc,
ADDRESS="Chicago",
YEAR=1992,
REFERENCES=16,
KEYWORDS="Circuit switching; overflow traffic; delay loss model;
performance evaluation; analysis; approximation",
ABSTRACT="In this paper we present a performance analysis of a hybrid
circuit-switched transmission resource at a network node providing
service to two traffic streams. Type-1 messages gain access to the
system if the node capacity is not saturated, otherwise they overflow
into a buffer queue. Type-2 messages areassumed to to enter directly
into the buffer queue. The performance measure is the average number of
messages in the buffer.",
}

@ARTICLE{Lee92:New,
AUTHOR="T. T. Lee",
TITLE="Design and Analysis of a New Self-Routing Network",
JOURNAL=ieeecom,
VOLUME="COM-40",
NUMBER=1,
PAGES="171-177",
YEAR=1992,
REFERENCES=16,
KEYWORDS="ATM; switching network; Banyan network; self routing;
multistage interconnection network; performance evaluation; sorting;
analysis; unbalanced traffic; simulation",
ABSTRACT="A new self-routing network constructed from the sorting and
the routing cell is proposed. The complexity of the new network is
roughly twice as much as that of a pure banyan network. Its per-formance
under uniform and nonuniform traffic is analysed for the unbuffered
case. It is found that a higher degree of non-uniformity results in a
better performance for certain form of nonuniform traffic matrices.
Simulations are performed to obtain",
}

@INPROCEEDINGS{Lee92:Fair,
AUTHOR="T. T. Lee and S. Liu",
TITLE="A Fair High-Speed Copy Network for Multicast Packet Switch",
BOOKTITLE=infocom,
ADDRESS="Florence",
PAGES="886-894",
YEAR=1992,
REFERENCES=8,
KEYWORDS="ATM; switching system; multicast; architecture; multistage
interconnection network; Banyan network",
}

@ARTICLE{Li92:Nonblocking,
AUTHOR="Song Li",
TITLE="Performance of a Nonblocking Space-Division Packet Switch with
correlated Input Traffic",
JOURNAL=ieeecom,
VOLUME="COM-40",
NUMBER=1,
PAGES="97-108",
YEAR=1992,
REFERENCES=20,
KEYWORDS="ATM; switching block; input buffer; output buffer; speedup;
performance evaluation; analysis; bursty traffic; infinite queue; Markov
chain; unbalanced traffic",
ABSTRACT="This paper studies the performance of a nonblocking
space-division packet switch in a correlated input traffic environment. 
In constructing the input traffic model, we consider that each input is
a TDM link connecting to multiple sources.  Every sourceon a link
supports one call at a time.  Each call experiences thealternation of on
and off periods, and generates packets periodically while in the on
period.  The stochastic property of each",
}

@ARTICLE{Mase92:ATM,
AUTHOR="F. Masetti and Achille Pattavina and C. Sironi",
TITLE="The {ATM} Shuffleout Switching Fabric: Design and Implementation
issues",
JOURNAL=ett,
VOLUME=3,
NUMBER=2,
PAGES="65-73",
YEAR=1992,
REFERENCES=15,
KEYWORDS="ATM; switching network; architecture; design; multistage
interconnection network; output buffer; self routing; performance
evaluation; simulation",
ABSTRACT="This paper describes the design and implementation aspects of
the Shuffleout switch, a new class of switching fabric architec-tures.
The key points of this structure are the adoption of a memoryless
multistage interconnection network and a new packet routing strategy.
Compared to the basic multistage shuffle interconnection network of
Shuffleout, adopting 2x4 switching elements, three other architectures
of the interconnection",
}

@INPROCEEDINGS{Mont92:Multistage,
AUTHOR="A. Monterosso and Achille Pattavina",
TITLE="Performance Analysis of Multistage Interconnection Networks with
shared-Buffered Switching Elements for {ATM} Switching",
BOOKTITLE=infocom,
ADDRESS="Florence",
VOLUME=1,
PAGES="124-131",
YEAR=1992,
REFERENCES=17,
KEYWORDS="ATM; switching; architecture; performance evaluation;
multistage interconnection network; central buffer; analysis; Banyan
network",
}

@ARTICLE{Neut92:Local,
AUTHOR="M. F. Neuts and D. Liu and S. Narayana",
TITLE="Local Poissonification of the Markovian Arrival Process",
JOURNAL="Stochastic Models",
VOLUME=8,
NUMBER=1,
PAGES="87-129",
YEAR=1992,
REFERENCES=11,
KEYWORDS="MAP; stochastic process; point process; stochastic analysis;
eakedness; burstiness; bursty traffic",
ABSTRACT="In a novel approach to quantifying the burstiness of a
stationa-ry point process, the points in successive intervals of length
aare uniformly and independently redistributed over those intervals. As
the window size a is increased, we obtain new point processes which
increasingly mimic the local behaviour of the Poisson process. For the
Markovian arrival process, a number of mathematical descriptors of the
resulting processes, such as",
}

@INPROCEEDINGS{Nish92:Optical,
AUTHOR="J. Nishikido and M. Okuno and A. Himeno",
TITLE="Optical Routing Control using Coherent Pattern-Matching Circuit
for Photonic Self-Routing Switch",
BOOKTITLE=infocom,
ADDRESS="Florence",
VOLUME=1,
PAGES="459-467",
YEAR=1992,
REFERENCES=26,
KEYWORDS="ATM; switching; multistage interconnection network; self
routing; optical switching; implementation",
}

@ARTICLE{Okam92:Modular,
AUTHOR="S. Okamoto",
TITLE="Modular Expandable Multi-Stage {ATM} Cross-Connect System
architecture for {ATM} Broadband Networks",
JOURNAL=ieice_communications,
VOLUME="E75-B",
NUMBER=3,
PAGES="207-216",
YEAR=1992,
REFERENCES=19,
KEYWORDS="ATM; switching network; multistage interconnection network;
multicast; Banyan network; self routing; architecture; performance
evaluation; simulation",
ABSTRACT="This paper describes the design of a large capacity ATM
cross-connect system that has a multistage network structure which
requires only one type of switch module.  The capacity of the proposed
system can be easily increased without service interruptions.  To
realize cell sequence integrity, a time stamp is added to the
self-routing tag.  Required time stamp length and efficient module size
are discussed.",
}

@ARTICLE{Tobi92:Modulare,
AUTHOR="H. Tobiet",
TITLE="Modulare Testarchitektur für breitbandige {ATM-Netze}",
JOURNAL=ntz,
VOLUME=45,
NUMBER=2,
PAGES="88-97",
YEAR=1992,
LANGUAGE="German",
REFERENCES=1,
KEYWORDS="ATM; QOS; traffic measurement; measurement tool; traffic
generator",
ABSTRACT="In Anbetracht der Komplexität künftiger Breitbandnetze, der
mangelnden Präzision der heutigen Normen und der Fristen für
dInbetriebnahme von Pilotnetzen ist es unabdingbar, dass das Testsystem
parallel zum Netz erweitert und jederzeit an punktuelle Bedürfnisse
angepasst werden kann. Die im Rahmen des RACEProgramms entwickelte
Testarchitektur befindet sich zwar noch imPrototypstadium, ist aber
speziell mit dieser Zielsetzung",
}

@INPROCEEDINGS{Tode92:Multicast,
AUTHOR="H. Tode and Y. Sakai and Makoto Yamamoto and H. Okada and Y.
Tezuka",
TITLE="Multicast Routing Algorithm for Nodal Load Balancing",
BOOKTITLE=infocom,
ADDRESS="Florence",
PAGES="2086-2095",
YEAR=1992,
REFERENCES=11,
KEYWORDS="Multicast; routing algorithm; performance evaluation;
simulation",
ABSTRACT="In this paper we propose two multicast routing algorithms
which distribute copy operation of packets over all nodes along the
multicast path: a link added type algorithm and a loop construc-ted type
algorithm. Both algorithms, at first, derive an approximate solution for
minimum cost path, and then improve thesolution to prevent concentration
of packet copy operation at one switching node at a little sacrifice of
total cost along the",
}

@ARTICLE{Tran92:Polling,
AUTHOR="P. Tran-Gia",
TITLE="Analysis of Polling Systems with General Input Process and Finite
Capacity",
JOURNAL=ieeecom,
VOLUME="COM-40",
NUMBER=2,
PAGES="337-344",
YEAR=1992,
REFERENCES=25,
KEYWORDS="Polling system; multiqueue; cyclic service; discrete time;
renewal process; finite queue; discrete time analysis; approximation;
FFT; fast Fourier transform",
ABSTRACT="In this paper, an approximate discrete-time analysis of
polling systems with finite capacity of waiting places and limited-1
service is presented, considering general renewal input traffic. The
analysis method is based on the use of efficient discrete convolution
operations based on fast convolution algorithms, eg., FFT. To illustrate
the accuracy of the approximation and its de-pendency on system
parameters, numerical results are given.",
}

@INPROCEEDINGS{Widj92:Helical,
AUTHOR="I. Widjaja and A. Leon-Garcia",
TITLE="The Helical Switch: A Multipath {ATM} Switch which Preserves Cell
sequence",
BOOKTITLE=infocom,
ADDRESS="Florence",
PAGES="2489-2498",
YEAR=1992,
REFERENCES=13,
KEYWORDS="ATM; switching system; architecture; self routing; multistage
interconnection network; mean delay; performance evaluation; analysis;
throughput analysis",
ABSTRACT="This paper presents a new cell switching architecture for ATM-
based networks. The proposed helical switch is a multistage
interconnection network which implements the self-routing technique with
efficient buffer sharing. Although the switch may route cells along
different paths, the connection-oriented mode required by the ATM-based
network is supported. Cell sequence integrity is guaranteed by
introducing a virtual helix which",
}

@INPROCEEDINGS{Xion92:Statistical,
AUTHOR="Yongqiang Xiong and H. Bruneel",
TITLE="Performance of Statistical Multiplexers with Finite Number of
inputs and Train Arrivals",
BOOKTITLE=infocom,
ADDRESS="Florence",
PAGES="2036-2044",
YEAR=1992,
REFERENCES=14,
KEYWORDS="Statistical multiplexer; queueing system; single server;
bursty traffic; performance evaluation; analysis; generating function",
ABSTRACT="A slotted statistical multiplexer with a finite number of
input links is considered in this paper. Messages arriving on each input
link contain a fixed number of fixed-length packets and are carried to
the multiplexer in the form of a packet train at the rate of one packet
per slot. Several messages may arrive contiguously on an input link;
idle periods are geometrically distributed. By means of a generating
function approach, a",
}

@ARTICLE{Yama92:Limitation,
AUTHOR="Naoaki Yamanaka and Y. Sato and K. Sato",
TITLE="Performance Limitation of Leaky Bucket algorithms for Usage
parameter Control and Bandwidth Allocation Methods",
JOURNAL=ieice_communications,
VOLUME="E75-B",
NUMBER=2,
PAGES="82-86",
YEAR=1992,
REFERENCES=11,
KEYWORDS="ATM; BISDN; policing function; leaky bucket; bursty traffic;
bandwidth allocation; performance evaluation; simulation",
ABSTRACT="Simulation results show that the conventional statistical
bandwidth allocation method, which uses the most bursty pattern
permitted by the leaky bucket algorithm, can not guarantee the QOS of
established Virtual Channels/Paths.  As a result, the VC/VP bandwidth
allocation method based on the leaky bucket algorithm is proven to be
unsatisfactory.",
}

@INPROCEEDINGS{Yum92:TDM,
AUTHOR="T. S. Yum and Y.-W. Leung",
TITLE="A {TDM-Based} Multibus Packet Switch",
BOOKTITLE=infocom,
ADDRESS="Florence",
PAGES="2509-2515",
YEAR=1992,
REFERENCES=9,
KEYWORDS="ATM; switching system; architecture; bus; speedup; TDM; time
division multiplex; performance evaluation; simulation; analysis;
approximation; input buffer; output buffer",
ABSTRACT="A new packet switch architecture using two sets of time
divisionmultiplexed buses is proposed. The horizontal buses collect
packets from the input ports while the vertical buses distributethe
packets to the output ports. The two sets of buses are connected by a
set of switching elements which coordinate the connections between the
buses, so that each vertical bus is connec-ted to only one horizontal
bus at a time.",
}

@ARTICLE{Scho92:RATT,
AUTHOR="D. de Schoenmacker and P. Verbeeck",
TITLE="{RATT:} a glimpse of a broadband future",
JOURNAL="IEE electronics and communication journal",
VOLUME=4,
NUMBER=4,
PAGES="225-234",
YEAR=1992,
REFERENCES=13,
KEYWORDS="ATM; switching system; test; communication network; BISDN;
system design",
ABSTRACT="The ATM technology testbed being built by the partners of the
RACE project 1022 and due to be operational by mid 1993 is described.
Included in the paper is an overall description of the system and its
constituent building blocks, as well as an outline of the experiments
that will be performed on it.",
}

@ARTICLE{Pins92:Simple,
AUTHOR="E. Pinsky",
TITLE="A simple approximation for the {Erlang} losss function",
JOURNAL=pe,
VOLUME=15,
NUMBER=3,
PAGES="155-161",
YEAR=1992,
REFERENCES=20,
KEYWORDS="Erlang B formula; approximation",
ABSTRACT="A simple non-iterative computational procedure for
approximating B=f(A, N) is presented.",
}

@ARTICLE{Guil92:Burstiness,
AUTHOR="F. Guillemin and J. Boyer and A. Dupuis",
TITLE="Burstiness in broadband integrated networks",
JOURNAL=pe,
VOLUME=15,
NUMBER=3,
PAGES="163-176",
YEAR=1992,
REFERENCES=22,
KEYWORDS="ATM; arrival process; burstiness; MMBP; GI/D/1; performance
evaluation; mean waiting time",
ABSTRACT="We introduce a new class of arrival process, the $n$-stage
Markov modulated Bernoulli process MMBPn, and its peculiar case, the
n-stage hyper-Bernoulli process, denoted by HBPn. We numerically solve
the MMBPn/D/1/K queue and we compute the rejection probability and the
mean waiting time.",
}

@ARTICLE{Zhan92:Improvements,
AUTHOR="Bing Zhang and Yu-Chi Ho",
TITLE="Improvements in the likelihood ratio method for steady-state
sensivity analysis and simulation",
JOURNAL=pe,
VOLUME=15,
NUMBER=3,
PAGES="177-194",
YEAR=1992,
REFERENCES=17,
KEYWORDS="Simulation; output analysis; optimization",
ABSTRACT="an improved version of the LR method is described.",
}

@ARTICLE{Wall92:Calculation,
AUTHOR="J. F. E. Wallin and B. Sanders",
TITLE="The calculation of overflow moments in loss systems with
selective trunk reservation",
JOURNAL=pe,
VOLUME=15,
NUMBER=3,
PAGES="195-202",
YEAR=1992,
REFERENCES=22,
KEYWORDS="Overflow traffic; reservation; loss system",
ABSTRACT="The moments of the stream of overflowing calls from a simple
selective trunk reservation (STR) are calculated. Recurrence formulae
are found",
}

@ARTICLE{Nara92:First,
AUTHOR="S. Narayana and M. F. Neuts",
TITLE="The First Two Moment Matrices of the Counts for the Markovian
arrival Process",
JOURNAL=comstat,
VOLUME=8,
NUMBER=3,
PAGES="459-477",
YEAR=1992,
REFERENCES=10,
KEYWORDS="Stochastic process; MAP; batch arrival; Markov process; matrix
analytic method",
ABSTRACT="Analytic, asymptotic and algorithmic properties of the first
twomoment matrices of the counts during an interval (0, t] in the
Markovian arrival process (MAP) are discussed.",
}

@ARTICLE{Wang92:Trunk,
AUTHOR="Weihong Wang and T. N. Saadawi",
TITLE="Trunk Congestion Control in Heterogeneous Circuit Switched
Networks",
JOURNAL=ieeecom,
VOLUME="COM-40",
NUMBER=7,
PAGES="1156-1161",
YEAR=1992,
REFERENCES=5,
KEYWORDS="Circuit switching; multirate switching; blocking; resource
allocation; priority; loss system; performance evaluation; analysis;
Markov chain",
ABSTRACT="The integrated communications services have very different
traffic characteristics from those of conventional telephone calls. In
this letter, a circuit switched network with two typesof traffic is
modeled as a finite two-dimensional Markov chain. The problem of trunk
congestion under different routing schemes is analyzed. It is shown that
the trunk reservation technique can be used to alleviate trunk
congestion in this heterogeneous",
}

@ARTICLE{Egen92:Uber,
AUTHOR="F. J. Egenolf",
TITLE="Über den Informationsgewinn bei statistischen Experimenten",
JOURNAL=aeu,
PUBLISHER="Hirzel-Verlag",
ADDRESS="Stuttgart",
VOLUME=46,
NUMBER=3,
PAGES="131-141",
YEAR=1992,
LANGUAGE="German",
REFERENCES=10,
KEYWORDS="Bayes statistics; binomial distribution",
ABSTRACT="Das Bayessche Verfahren zur statistischen Abschätzung eines
unbekannten Parameters $p$ verlangt die Annahme einer sog.
Prior-Wahrscheinlichkeits-Dichtefunktion (DF) für den dann als ZV
aufzufassenden Parameter. Die vorliegende Arbeit benutzt einen
informationstheoretischen Ansatz zur Entwicklung eines Auswahlkriteriums
für diese Prior-DF.",
}

@ARTICLE{Uhl92:Analytische,
AUTHOR="T. Uhl",
TITLE="Analytische Methode zur Leistungsanalyse von Signalisierverfahren
in {MKS-Netzen}",
JOURNAL=aeu,
PUBLISHER="Hirzel-Verlag",
ADDRESS="Stuttgart",
VOLUME=46,
NUMBER=6,
PAGES="415-419",
YEAR=1992,
LANGUAGE="German",
REFERENCES=11,
KEYWORDS="Signalling protocol; saturation routing; algorithm;
performance evaluation; iterative method",
ABSTRACT="iterativer Algorithmus.",
}

@ARTICLE{Blon92:Statistical,
AUTHOR="C. Blondia and O. Casals",
TITLE="Statistical multiplexing of {VBR} sources: A matrix-analytic
approach",
JOURNAL=pe,
VOLUME=16,
NUMBER="1-3",
PAGES="5-20",
YEAR=1992,
REFERENCES=30,
KEYWORDS="ATM; VBR; variable bitrate coding; DMAP; matrix analytic
method",
ABSTRACT="In this paper we propose a versatile point process as a model
for a large class of variable bit rate sources and their superpositions.
The process belongs to the class of discrete-time batch Markovian
arrival processes (D-BMAP).",
}

@ARTICLE{Lee92:Transient,
AUTHOR="D. Lee and Song Li",
TITLE="Transient analysis of multi-server queues with Markow-modulated
Poisson arrivals and overload control",
JOURNAL=pe,
VOLUME=16,
NUMBER="1-3",
PAGES="49-66",
YEAR=1992,
REFERENCES=37,
KEYWORDS="Queueing system; overload control; transient analysis;
multiserver; MMPP",
ABSTRACT="This paper studies the transient behaviour of a
Markov-modulated Poisson arrival queue under overload control.",
}

@ARTICLE{Broc92:Cell,
AUTHOR="Frank M. Brochin",
TITLE="A cell spacing device for congestion control in {ATM} networks",
JOURNAL=pe,
VOLUME=16,
NUMBER="1-3",
PAGES="107-127",
YEAR=1992,
REFERENCES=31,
KEYWORDS="ATM; traffic shaping; source policing",
ABSTRACT="In this paper we study a cell spacing method of congestion
control in ATM networks. This device does not interfere with cells that
find the queue empty and arrive a sufficiently long time after the last
departure but spaces apart those which arrive too closely to each other.
We analyze the statistical properties of the output traffic of such a
cell spacer when the input process is modeled a a compound-MMPP.",
}

@ARTICLE{Mukh92:Journey,
AUTHOR="B. Mukherjee and C. Bisdikian",
TITLE="A journey through the {DQDB} network literature",
JOURNAL=pe,
VOLUME=16,
NUMBER="1-3",
PAGES="129-158",
YEAR=1992,
REFERENCES=103,
KEYWORDS="DQDB; MAN; survey; bibliography; IEEE 802.6; priority",
ABSTRACT="Since there has been a literature explosion on DQDB, this
article is intended to extract the significant features of various
DQDB-based investigations.",
}

@ARTICLE{Tran92:Discrete,
AUTHOR="P. Tran-Gia and R. Dittmann",
TITLE="A discrete-time analysis of the cyclic reservation multiple
access protocol",
JOURNAL=pe,
VOLUME=16,
NUMBER="1-3",
PAGES="185-200",
YEAR=1992,
REFERENCES=12,
KEYWORDS="CRMA; cyclic reservation multiple access; M/G/1; G/G/1; server
vacation",
ABSTRACT="In this paper a PE of the CRMA MAC protocol is presented. An
approximate computational method is derived to derive the PDF of the
medium access delay and the packet transfer time.",
}

@INPROCEEDINGS{Danz92:Wide,
AUTHOR="Peter Danzig and K. Obraczka and A. Kumar",
TITLE="An analysis of wide-area name server traffic",
BOOKTITLE=sigcomm,
ADDRESS="Baltimore, Maryland",
PAGES="281-292",
NOTE="also in ACM CCR 22 (4)",
YEAR=1992,
REFERENCES=14,
KEYWORDS="Performance evaluation; algorithm",
ABSTRACT="This paper explores the performance of DNS (Domain Name
System) based on two 24-hour traces of traffic destined to one of these
root name servers. It considers the effectiveness of name caching and
retransmission timeout calculation, shows how algorithms to increase
DNS's resiliency lead to disastrous behavior when servers fail or when
certain implementation faults are triggered, explains the paradoxically
high fraction of wide-area DNS packets",
}

@INPROCEEDINGS{Fabe92:Dynamic,
AUTHOR="Theodore Faber and Lawrence H. Landweber and A. Mukherjee",
TITLE="Dynamic time windows: Packet admission control with feedback",
BOOKTITLE=sigcomm,
ADDRESS="Baltimore, Maryland",
PAGES="124-135",
NOTE="also in ACM CCR 22 (4)",
YEAR=1992,
REFERENCES=13,
KEYWORDS="WAN; variance; feedback",
ABSTRACT="We present a feedback congestion control method, Dynamic Time
Windiws, for use in high speed wide area networks based on controlling
source variants. The method consists of a packet admission control
system and a feedback system to dynamically control source burstiness.",
}

@ARTICLE{Grah92:Comparison,
AUTHOR="W. J. Graham",
TITLE="A comparison of four pseudo random number generators implemented
in {ADA}",
JOURNAL=sigsim,
PAGES="3-18",
MONTH="Fall",
YEAR=1992,
REFERENCES=11,
KEYWORDS="Comparison; pseudo-random generator; ADA; implementation",
ABSTRACT="Four random number generators implemented in ADA are compared
in terms of their equidistribution, independence, speed and period. Each
generator is described and it's code presented. First, a stream of
random numbers generated were checked for equidistribution by means of a
chi-square test. Next, the numbers were checked for independence by
means of a serial test. The code was then timed for a certain number of
iterations.",
}

@ARTICLE{Gree92:Fair,
AUTHOR="A. G. Greenberg and N. Madras",
TITLE="How fair is fair queuing?",
JOURNAL=jacm,
VOLUME=39,
NUMBER=3,
PAGES="568-598",
YEAR=1992,
REFERENCES=20,
KEYWORDS="Queueing theory; design; performance evaluation; verification;
network operating system; process management",
ABSTRACT="In this paper, we consider two variants of the fair queuing
discipline, and rigorously establish their fairness via sample path
comparisons with the head-of-line processor sharing discipline, a
mathematical idealization that provides a fairness paradigm. An
efficient implementation of one of the fair queuing disciplines is
presented. In passing, a new, fast method for simulating processor
sharing is derived. Simulation results are presented.",
}

@ARTICLE{Koba92:Mathematical,
AUTHOR="H. Kobayashi and Q. Ren",
TITLE="A mathematical theory for transient analysis of communication
networks",
JOURNAL=ieice_communications,
PAGES="1-25",
YEAR=1992,
REFERENCES=32,
KEYWORDS="Queueing theory; mathematics; transient analysis;
communication network",
ABSTRACT="In the present paper we present a mathematical theory for the
transient analysis of probabilistic models relevant to communication
networks.",
}

@ARTICLE{Kuma92:Simulation,
AUTHOR="A. Kumar and S. Singh",
TITLE="Simulation based performance study of a dynamic routing
algorithm",
JOURNAL=sigsim,
PAGES="28-38",
MONTH="Summer",
YEAR=1992,
REFERENCES=9,
KEYWORDS="Simulation; performance evaluation; dynamic routing; routing
algorithm; communication network",
ABSTRACT="This paper discusses a new distributed, dynamic routing
approach for communication networks. At each node, the best available
route to the destination is selected and the message is forwarded to the
next node on that route. The best route is evaluated at the new node
again. The choice of the best route is based on a parameter $K$, defined
in the paper. This approach does not have the counting to infinity
problem and is loop-free.",
}

@ARTICLE{McGe92:Analyzing,
AUTHOR="C. McGeoch",
TITLE="Analyzing algorithms by simulation: Variance reduction techniques
and simulation speedups",
JOURNAL=acmcs,
VOLUME=24,
NUMBER=2,
PAGES="195-212",
YEAR=1992,
REFERENCES=42,
KEYWORDS="Analysis; algorithm; simulation; variance reduction; variance;
speedup",
ABSTRACT="This paper documents the power of variance reduction
techniques for algorithm problems and provides tutorial discussion.
Since even complex heuristic algorithms tend to have precise
mathematical specifications and a great deal of structure, there is much
potential for exploiting partial understanding of the underlying
model.",
}

@ARTICLE{Sili92:Approximate,
AUTHOR="C. B. Silio and Hatem M. Ghafir and M. R. Parikh",
TITLE="An approximate method for the performance analysis of playthrough
rings",
JOURNAL=ieeetc,
ISBN="0018-9340",
VOLUME="C-41",
NUMBER=9,
PAGES="1137-1155",
YEAR=1992,
REFERENCES=40,
KEYWORDS="Method; approximation; performance evaluation; ring; LAN; link
layer; data link; protocol; circuit switching; M/G/1; distributed
control; discrete event simulation; media access control",
ABSTRACT="Analytical models are presented and shown to approximate
adequately simulation results for average message queueing time, service
time, and control frame round trip time on ring topology local area
networks that use a PLAYTHROUGH protocol. PLAYTHROUGH is a data link
layer medium access control protocol that uses a perpetually circulating
control frame",
}

@INPROCEEDINGS{Stir92:Asychronous,
AUTHOR="P. Stirpe and E. Pinsky",
TITLE="Performance analysis of an asychronous multi-rate crossbar with
bursty traffic",
BOOKTITLE=sigcomm,
ADDRESS="Baltimore, Maryland",
PAGES="150-160",
NOTE="also in ACM CCR 22(4)",
YEAR=1992,
REFERENCES=34,
KEYWORDS="Performance evaluation; crossbar; bursty traffic; algorithm;
witching network; circuit switching; traffic load",
ABSTRACT="In this paper we present an analysis of an $N1\times N2$
asynchronous crossbar switch model for all-optical circuit-switching
networks that incorporates multi-rate arrival traffic with varied
arrival distributions. We compare the model behaviour using traffic
loads derived from the Binomial, Pascal, and Poisson statistical
distributions. We give efficient algorithms to compute the performance
measures.",
}

@ARTICLE{Zafi92:Modeling,
AUTHOR="M. Zafirovic-Vukotic and I. G. Niemegeers",
TITLE="A performance modeling and evaluation of the Cambridge fast
ring",
JOURNAL=ieeetc,
ISBN="0018-9340",
VOLUME="C-41",
NUMBER=9,
PAGES="1110-1125",
YEAR=1992,
REFERENCES=38,
KEYWORDS="Cambridge ring; performance model; performance evaluation",
ABSTRACT="The Cambridge Fast Ring (CFR) is a high speed slotted ring.
The features that make it suitable for use at very large transmission
rates are the synchronous transmission, the simplicity of the protocol,
and the possibility of immediate retransmission of erronous minipackets.
Performance of the CFR with normal slots is studied in this paper.",
}

@ARTICLE{Klei92:Sensitivity,
AUTHOR="J. P. Kleijnen",
TITLE="Sensitivity analysis and optimization of simulation experiments,
including case studies",
JOURNAL="EUROSIM Simulation News Europe ARPE Simulation News",
PUBLISHER="Computer Center University Vienna",
ADDRESS="Vienna",
PAGES="5-7",
YEAR=1992,
REFERENCES=4,
KEYWORDS="Simulation; output analysis; optimization; modeling",
ABSTRACT="Gives a survey of what-if analysis and optimization of
simulation models, using statistical techniques for the design and
analysis of experiments with thes models.",
}

@ARTICLE{Gend92:Algorithm,
AUTHOR="M. Gendreau and B. Sanso and F. Soumis",
TITLE="An algorithm for network dimensioning under reliability
considerations",
JOURNAL="Annals of Operations Research",
PUBLISHER="J.C. Baltzer",
ADDRESS="Basel",
VOLUME=36,
PAGES="263-274",
YEAR=1992,
REFERENCES=24,
KEYWORDS="Reliability; circuit switching; routing",
ABSTRACT="In this paper we introduce a new methodology to adjust link
capacities in circuit switched networks taking into account the costing
policy and reliability considerations. The proposed procedure, which is
shown to converge to a global optimum for the dimensioning/routing
problem, has been tested on a 14 undirectedarc problem for various
levels of link failure probability.",
}

@ARTICLE{Gupt92:Modeling,
AUTHOR="S. C. Gupta and Keith W. Ross",
TITLE="Performance modeling of heterogeneous data networks",
JOURNAL="Annals of Operations Research",
PUBLISHER="J.C. Baltzer AG",
ADDRESS="Basel",
VOLUME=35,
PAGES="125-151",
YEAR=1992,
REFERENCES=19,
KEYWORDS="LAN; packet switching; MAN; bursty traffic; round robin",
ABSTRACT="A heterogeneous data network consists of LANs interconnected
with either leased lines, packet-switched networks, MANs, or
combinations thereof. Heterogeneous networks are characterized by bursty
traffic, nested segmentation and reassembly of packets, window flow
control and round-robin channel access. We develop a performance
methodology for estimating user perceived delay and buffer overflow in
heterogeneous data networks.",
}

@ARTICLE{Shro92:Virtual,
AUTHOR="Ness Shroff and Magda El Zarki",
TITLE="Performance analysis of virtual circuit connections for bursty
data sources in {ATM} networks",
JOURNAL="Annals of Operations Research",
PUBLISHER="J.C. Baltzer AG",
ADDRESS="Basel",
VOLUME=35,
PAGES="297-323",
YEAR=1992,
REFERENCES=6,
KEYWORDS="Performance evaluation; ATM; bursty traffic",
ABSTRACT="In this paper, we provide an analytical approach for
determining the performance of a virtual circuit connection for data
transmission in a high-speed ATM network with finite buffers at the
network nodes. The analysis assumes that the network operates using the
best effort delivery strategy and that the end-to-end virtual circuit is
responsible for guaranteeing the integrity of the connection.",
}

@ARTICLE{Eich92:New,
AUTHOR="J. Eichenauer-Herrmann and H. Grothe",
TITLE="A new inversive congruential pseudorandom number generator with
the power of two modulus",
JOURNAL=tomacs,
VOLUME=2,
NUMBER=1,
PAGES="1-11",
YEAR=1992,
REFERENCES=29,
KEYWORDS="RNG; uniform variate; linear congruential generator",
ABSTRACT="A new inversive congruential generator with the power of two
modulus is presented.",
}

@ARTICLE{Cota92:Modification,
AUTHOR="B. A. Cota and R. G. Sargent",
TITLE="A modification of the process interaction world view",
JOURNAL=tomacs,
VOLUME=2,
NUMBER=2,
PAGES="109-129",
YEAR=1992,
REFERENCES=33,
KEYWORDS="Simulation method; process interaction; discrete event
simulation",
ABSTRACT="A formal definition of the process inetraction world view is
reviewed. A modification of the world view is that supports modularity
and encapsulation is presented, and its advantages are discussed",
}

@ARTICLE{Asmu92:Stationary,
AUTHOR="S. Asmussen and P. W. Glynn and H. Thorisson",
TITLE="Stationary detection in the initial transient problem",
JOURNAL=tomacs,
VOLUME=2,
NUMBER=2,
PAGES="130-157",
YEAR=1992,
REFERENCES=33,
KEYWORDS="Simulation method; output analysis; transient behaviour;
regenerative simulation",
ABSTRACT="Several methods to detect the end of the initial transient in
a simulation run are discussed.",
}

@ARTICLE{Amma92:Time,
AUTHOR="H. H. Ammar and S. Deng",
TITLE="Time warp simulation using time scale decomposition",
JOURNAL=tomacs,
VOLUME=2,
NUMBER=2,
PAGES="158-177",
YEAR=1992,
REFERENCES=26,
KEYWORDS="Distributed simulation; simulation method; decomposition; time
warp",
ABSTRACT="We consider time scale decomposition as well as spatial
decomposition to induce massive parallelism and reduce overhead in
distributed discrete-event simulations. we confine our study to the Time
Warp strategy and to systems where the durations of activities differ by
several orders of magnitude (i.e. systems with fast and slow
activities).",
}

@ARTICLE{Torr92:Algorithms,
AUTHOR="D. Torrieri",
TITLE="Algorithms for finding an optimal set of short disjoint paths in
a communication network",
JOURNAL=ieeecom,
VOLUME="COM-40",
NUMBER=11,
PAGES="1698-1702",
YEAR=1992,
REFERENCES=7,
KEYWORDS="Network planning; routing; shortest path; disjoint path",
ABSTRACT="Three efficient algorithms, one that constructs an optimal set
and two that construct approximations, are presented.",
}

@ARTICLE{Mats92:Twisted,
AUTHOR="M. Matsumoto and Y. Kurita",
TITLE="Twisted {GFSR} generators",
JOURNAL=tomacs,
VOLUME=2,
NUMBER=3,
PAGES="179-194",
YEAR=1992,
REFERENCES=20,
KEYWORDS="Shift register sequences",
ABSTRACT="This paper presents the twisted GFSR, a slightly but
essentially modified of the GFSR of Lewis and Payne.",
}

@ARTICLE{Vaak92:Massively,
AUTHOR="P. Vaakili",
TITLE="Massively parallel and distributed simulation of a class of
discrete event systems: a different perspective",
JOURNAL=tomacs,
VOLUME=2,
NUMBER=3,
PAGES="214-238",
YEAR=1992,
REFERENCES=25,
KEYWORDS="Distributed simulation",
ABSTRACT="We are interested in a large number of medium sized systems.",
}

@ARTICLE{Lin92:Parallelism,
AUTHOR="Y. Lin",
TITLE="Parallelism analyzers for parallel discrete event simulation",
JOURNAL=tomacs,
VOLUME=2,
NUMBER=3,
PAGES="239-264",
YEAR=1992,
REFERENCES=22,
KEYWORDS="Distributed simulation",
ABSTRACT="This paper describes three critical path analysis algorithms
based based on different event scheduling (process scheduling)
policies.",
}

@INPROCEEDINGS{Addi92:Gaussian,
AUTHOR="R. G. Addie and Moshe Zukerman",
TITLE="Performance Evaluation of a {Gaussian} Queue with a Finite
Buffer",
BOOKTITLE="7th Australian Teletraffic Research Seminar",
ADDRESS="Adelaide",
YEAR=1992,
REFERENCES=16,
KEYWORDS="queueing system; analysis; finite queue",
ABSTRACT="We consider a finite buffer queue where its net input process
ismodelled by a stationary ergodic Gaussian discrete-time process. Such
a model is general and is closed under superposition. We review results
obtained earlier for a Gaussian queue with infinite buffer, and we show
how these earlier results lead to an accurate approximation for the loss
probability in the finitebuffer case. As in the infinite buffer case,
the loss",
}

@INPROCEEDINGS{Bell92:Telecommunications,
AUTHOR="A. Bellini and M. Capurro and D. Giuli and F. Pirri and E.
Tassini",
TITLE="Telecommunications Network Planning Methodology",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina",
PAGES=22,
YEAR=1992,
REFERENCES=13,
KEYWORDS="Planning; network planning",
ABSTRACT="Network planning is approached in a top-down fashion using a
method called P-chart. P-charts are a visual formalism based on graph
theory used to model the structure of the planning process. The method
is aimed at highlighting th fundamental, derived and target elements of
the problem on hand. P-charts undergo modular decomposition through
aggregation of elements and arrow connections between elements located
even at different levels.",
}

@ARTICLE{Bels92:Intelligent,
AUTHOR="D. Belshaw and G. Fidler",
TITLE="Intelligent Networking in the Future",
JOURNAL="Telecommunication Journal of Australia",
VOLUME=42,
NUMBER=1,
PAGES="22-26",
YEAR=1992,
KEYWORDS="IN; intelligent network; prediction; overview",
}

@INPROCEEDINGS{Anto92:Bounded,
AUTHOR="T. Antonakopoulos and J. Koutsonikos and V. Makios",
TITLE="Bounded Transfer Delays in Buffer Insertion Rings using
Load-Controlled Scheduling of Traffic",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina",
PAGES=16,
YEAR=1992,
REFERENCES=6,
KEYWORDS="Ring; ring network; LAN; HSLAN; protocol; MAN",
ABSTRACT="The use of a modified Buffer Insertion Access method in the
Metropolitan Area Network environment is examined in this paper. This
method has been modified using a simple Load-Controlled Scheduling of
Traffic protocol, which overrides its intrinsic disadvantages and
achieves the adaptation of the offered load to the network conditions.
Each station independently adjusts its asynchronous traffic to the
available bandwidth.",
}

@ARTICLE{Aoya92:Strategy,
AUTHOR="Takahisa Aoyama and Ikuo Tokizawa and K. Sato",
TITLE="Introduction Strategy and Technologies for {ATM} {VP-Based}
Broadband Networks",
JOURNAL=ieeejsac,
VOLUME="SAC-10",
NUMBER=9,
PAGES="1434-1447",
YEAR=1992,
REFERENCES=41,
KEYWORDS="ATM; virtual path; introduction strategy",
ABSTRACT="In order to pave the way to BISDN, one of the most critical
issues for network providers is to identify the introduction strategies
that are possible. This paper describes a credible introduction
strategy; the first step is the introduction of ATM techniques into the
path layer. The bulk of this paper highlights the latest technical
advances that will allow us to reap the benefits of ATM.",
}

@INPROCEEDINGS{Bane92:Near,
AUTHOR="S. Banerjee and B. Mukherjee",
TITLE="Near-Optimal Photonic Ring Configurations",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina",
PAGES=20,
YEAR=1992,
REFERENCES=10,
KEYWORDS="HSLAN; MAN; ring network; optical LAN",
ABSTRACT="Promising developments in lightwave technology indicate that
the huge bandwidth offered by a single optical fiber can be carved up
into smaller-capacity channels, each of which can operate parallelly and
concurrently at peak end-user speed. The focus of the paper is on the
photonic impementation of 'adaptive' and 'near-optimal' ring structures
which can be constructed on arbitrary physical network topologies.",
}

@ARTICLE{Bane92:Incorporating,
AUTHOR="S. Banerjee and B. Mukherjee",
TITLE="Incorporating continuation-of-message information, slot reuse,
and fairness in {DQDB} networks",
JOURNAL=cnis,
VOLUME=24,
PAGES="153-169",
YEAR=1992,
REFERENCES=16,
KEYWORDS="Dqdb; fairness; hsLAN; LAN; MAN; performance improvement",
ABSTRACT="Several important modifications to the distributed queue dual
bus (DQDB) protocol for metropolitan area networks (MANs) are proposed.
These modifications are aimed at improving not only the throughput and
delay performance of the network but also its fairness performance.",
}

@INPROCEEDINGS{Bane92:Heuristic,
AUTHOR="S. Banerjee and B. Mukherjee and D. Srkar",
TITLE="Heuristic Algorithms for Constructing Near-Optimal Structures of
Linear Multihop Lightwave Networks",
BOOKTITLE=infocom,
PAGES=10,
YEAR=1992,
REFERENCES=10,
KEYWORDS="Multihop; hsLAN; MAN; LAN; star network; heuristics",
ABSTRACT="The specific problem addressed in this paper is one on
topological design, and it can be stated as follows: Given that the
network nodes must be connected linearly and that the node positions in
the network can be adjusted by properly tuning their (optical)
transmitters and receivers, what is the best pattern for interconnecting
them?",
}

@INPROCEEDINGS{Barb92:High,
AUTHOR="C. Barbuio and R. Caldarella",
TITLE="High speed network {C-LAN:} field trial and operational
experience",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina",
PAGES=10,
YEAR=1992,
KEYWORDS="LAN; hsLAN; MAN; wan",
ABSTRACT="Short description of the C-LAN installation in Italy. The
paper is very flat, no details about the C-LAN protocol are given in
this paper.",
}

@INPROCEEDINGS{Ajmo92:Cycles,
AUTHOR="Marco {Ajmone Marsan} and L. de Moraes and S. Donatelli and F.
Neri",
TITLE="Cycles and waiting times in symmetric exhaustive and gated
multiserver multiqueue systems",
BOOKTITLE=infocom,
ADDRESS="Florence",
VOLUME=3,
PAGES="1-10",
YEAR=1992,
KEYWORDS="Queueing system; cyclic service; analysis",
}

@INPROCEEDINGS{Bafu92:Capacity,
AUTHOR="M. Bafutto and P. J. Kühn and G. Willmann and J. Zepf",
TITLE="A capacity and performance planning tool for signalling networks
based on {CCITT} signalling system No. 7",
BOOKTITLE="International Council for Computer Communication Intelligent
Networks Conference",
EDITOR="P. W. Bayliss",
ADDRESS="Tampa, Fl",
PAGES="368-379",
YEAR=1992,
KEYWORDS="Signalling; common channel; CCS; network planning",
}

@ARTICLE{Bahl92:Evolving,
AUTHOR="M. Bahl and J. Daane and R. O'Grady",
TITLE="The evolving intelligent interexchange network -- an {SS7}
perspective",
JOURNAL=ieeeproc,
VOLUME=80,
NUMBER=4,
PAGES="637-643",
YEAR=1992,
KEYWORDS="Signalling; common channel; CCS; intelligent network",
}

@INPROCEEDINGS{Bart92:Computer,
AUTHOR="A. Bartolomé and T. Brea and J.-M. Garcia",
TITLE="A computer tool for planning and performance analysis of common
channel signaling \#7 networks",
BOOKTITLE="5th International Network Planning Symposium (NETWORKS)",
ADDRESS="Kobe, Japan",
PAGES="259-264 (13.3)",
YEAR=1992,
KEYWORDS="Signalling; common channel; CCS; network planning",
}

@ARTICLE{Birm92:Asymptotic,
AUTHOR="A. Birman and Y. Kogan",
TITLE="Asymptotic evaluation of closed queueing networks with many
stations",
JOURNAL=comstat,
VOLUME=8,
NUMBER=3,
PAGES="543-563",
YEAR=1992,
KEYWORDS="queueing network; product form; analysis",
}

@ARTICLE{Blan92:Algorithmic,
AUTHOR="J. P. Blanc",
TITLE="An algorithmic solution of polling models with limited service
disciplines",
JOURNAL=ieeecom,
VOLUME="COM-40",
NUMBER=7,
PAGES="1152-1155",
YEAR=1992,
KEYWORDS="Polling; limited service",
}

@TECHREPORT{Bosc92:Kopplung,
AUTHOR="M. Bosch",
TITLE="Kopplung von Kommunikationsnetzen: Architekturen,
Leistungsuntersuchungen und eine Beispielrealisierung",
TYPE="Bericht über verkehrstheoretische Arbeiten",
INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung,
Universität Stuttgart",
ADDRESS="Stuttgart, Germany",
NUMBER=52,
YEAR=1992,
LANGUAGE="German",
}

@ARTICLE{Brow92:Common,
AUTHOR="Rick Brown and C. V. Holmes and M. D. Lanoux and T. P.
Marciani",
TITLE="Common channel signaling in the {AT\&T} {U.S.} {5ESSR} switch",
JOURNAL=ieeeproc,
VOLUME=80,
NUMBER=4,
PAGES="618-627",
YEAR=1992,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Camb92:Signaling,
AUTHOR="G. K. Cambron",
TITLE="Signaling system No. 7 local exchange deployment",
JOURNAL=ieeeproc,
VOLUME=80,
NUMBER=4,
PAGES="628-636",
YEAR=1992,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Cao92:New,
AUTHOR="Xi-Ren Cao and D.-J. Ma",
TITLE="New performance sensitivity formulae for a class of product-form
queueing networks",
JOURNAL="Discrete Event Dynamic Systems: Theory and Applications",
VOLUME=1,
NUMBER=3,
PAGES="289-313",
YEAR=1992,
KEYWORDS="Queueing network; product form",
}

@ARTICLE{Chan92:Mean,
AUTHOR="K. Chang and D. Sandhu",
TITLE="Mean waiting time approximations in cyclic-service systems with
exhaustive limited service policy",
JOURNAL=pe,
VOLUME=15,
NUMBER=1,
PAGES="21-40",
YEAR=1992,
KEYWORDS="Queueing system; cyclic service; analysis",
}

@INPROCEEDINGS{Choi92:Approximate,
AUTHOR="H. Choi and K. S. Trivedi",
TITLE="Approximate performance models of polling systems using
stochastic Petri nets",
BOOKTITLE=infocom,
ADDRESS="Florence",
VOLUME=3,
PAGES="1-9 (paper 2)",
YEAR=1992,
KEYWORDS="Queueing system; cyclic service; analysis",
}

@ARTICLE{Dall92:Operational,
AUTHOR="Y. Dallery and Xi-Ren Cao",
TITLE="Operational analysis of stochastic closed queueing networks",
JOURNAL=pe,
VOLUME=14,
NUMBER=1,
PAGES="43-61",
YEAR=1992,
KEYWORDS="Queueing network; product form; operational analysis",
}

@ARTICLE{Dowd92:Single,
AUTHOR="L. W. Dowdy and B. M. Carlson and A. T. Krantz and Satish K.
Tripathi",
TITLE="Single-class bounds of multi-class queuing networks",
JOURNAL=jacm,
VOLUME=39,
NUMBER=1,
PAGES="188-213",
YEAR=1992,
KEYWORDS="Queueing network; product form",
}

@INPROCEEDINGS{Biga92:LAN,
AUTHOR="O. Bigalli and A. Bellini and F. Pirri",
TITLE="{LAN-MAN} Interconnection through P-Net",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina",
PAGES=12,
YEAR=1992,
REFERENCES=12,
KEYWORDS="LAN; MAN; protocol; DQDB; hslan",
ABSTRACT="A private-area network, named P-Net, whose main aim is LAN
interconnection, is described. P-Net proposes a trade-off between cost
and performance in the interconnection of LANs in large buildings,
university campuses and enterprises through a high-speed backbone. P-Net
uses the DQDB protocol but modifies the priority mechanism to allow a
lower cost implementation of the physical interface and to give limited
access time to all priorities.",
}

@ARTICLE{Jabb92:Routing,
AUTHOR="B. Jabbari",
TITLE="Routing and congestion control in common channel signaling system
No. 7",
JOURNAL=ieeeproc,
VOLUME=80,
NUMBER=4,
PAGES="607-617",
YEAR=1992,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Kant92:MVA,
AUTHOR="K. Kant",
TITLE="{MVA} approximations for {SJN} scheduling",
JOURNAL=pe,
VOLUME=15,
NUMBER=1,
PAGES="41-61",
YEAR=1992,
}

@ARTICLE{Knes92:Asymptotic,
AUTHOR="Ch. Knessl and C. Tier",
TITLE="Asymptotic expansions for large closed queueing networks with
multiple job classes",
JOURNAL=ieeecom,
VOLUME="COM-41",
NUMBER=4,
PAGES="480-488",
YEAR=1992,
KEYWORDS="Queueing network; product form; analysis",
}

@INPROCEEDINGS{Konh92:Efficient,
AUTHOR="A. G. Konheim",
TITLE="Efficient analysis of polling systems",
BOOKTITLE=infocom,
ADDRESS="Florence",
PAGES="1-7 (paper 4)",
YEAR=1992,
KEYWORDS="Queueing system; cyclic service; analysis",
}

@INPROCEEDINGS{Laws92:Signalling,
AUTHOR="J. J. Lawser and M. S. Mui",
TITLE="Signalling system No. 7 realization for global intelligent
network services",
BOOKTITLE="International Council for Computer Communication Intelligent
Networks Conference",
EDITOR="P. W. Bayliss",
ADDRESS="Tampa, Fl",
PAGES="350-357",
YEAR=1992,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Meye92:Performability,
AUTHOR="J. Meyer",
TITLE="Performability: A retrospective and some pointers to the future",
JOURNAL=pe,
VOLUME=14,
NUMBER="3-4",
PAGES="139-155",
YEAR=1992,
KEYWORDS="Performability; survey",
}

@ARTICLE{Mitr92:Asymptotically,
AUTHOR="D. Mitra",
TITLE="Asymptotically optimal design of congestion control for high
speed data networks",
JOURNAL=ieeecom,
VOLUME="COM-40",
NUMBER=2,
PAGES="301-311",
YEAR=1992,
}

@ARTICLE{Plac92:Kommunikation,
AUTHOR="J. Placht",
TITLE="Kommunikation sichern im Signalisierungsnetz",
JOURNAL=siemenstr,
ADDRESS="München",
VOLUME=15,
NUMBER=5,
PAGES="230-231",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="Signalling; common channel; CCS",
}

@BOOK{Sach92:Angewandte,
AUTHOR="L. Sachs",
TITLE="Angewandte Statistik: Anwendung statistischer Methoden",
PUBLISHER="Siebente Auflage, Springer-Verlag, Berlin",
ADDRESS="Berlin",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="Statistics",
}

@ARTICLE{Szcz92:Combined,
AUTHOR="H. Szczerbicka",
TITLE="A combined queueing network and stochastic Petri-net approach for
evaluating the performability of fault-tolerant computer systems",
JOURNAL=pe,
VOLUME=14,
NUMBER=3,
PAGES="217-226",
YEAR=1992,
}

@INPROCEEDINGS{Bore92:DQDB,
AUTHOR="A. Borella and D. Broglio and G. Cancellieri and F. Chiaraluce",
TITLE="{DQDB} Protocol Modification for Improving the Access of
Multi-Priority Traffic",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina",
PAGES=32,
YEAR=1992,
REFERENCES=21,
KEYWORDS="DQDB; priority; MAN",
ABSTRACT="This paper proposes two new efficient mechanisms for improving
the DQDB performance in overload traffic conditions. Many results are
obtained by numerical simulations and their analys