@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 analysis demonstrates the
positive effects of the proposed solutions, which, in turn, require only
slight modifications of the standardized hardware and software
structure.",
}

@ARTICLE{Boul92:VLSI,
AUTHOR="D. W. Bouldin",
TITLE="{VLSI} Designer's Interface",
JOURNAL="IEEE Circuits and Devices",
VOLUME=8,
NUMBER=1,
PAGES="9-10",
YEAR=1992,
REFERENCES=2,
KEYWORDS="Vlsi; design; tool",
ABSTRACT="Short description of SIS: An Interactive System for Sequential
Circuit Synthesis. Some features of User-Programmable ASICs.",
}

@INPROCEEDINGS{Bura92:Intelligent,
AUTHOR="M. Burak",
TITLE="Intelligent Interworking Units, I2Us: a proposal for the
{LAN/MAN/BISDN} environment",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina",
PAGES=7,
YEAR=1992,
REFERENCES=7,
KEYWORDS="Man; LAN; BISDN; interconnection",
ABSTRACT="The paper proposes a new interworking concept called
Intelligent Interworking Units (I2Us). This concept is applied to the
interconnection of IEEE 802.x LANs, DQDB, MANs and ATM based BISDN.
Between all the abouve mentioned network types Interworking Units (IWU)
are necessary to provide flexible communication capabilities. Today IWUs
use a fixed layering scheme and are thus classified in bridges, routers
or gateways.",
}

@INPROCEEDINGS{Casa92:DQDB,
AUTHOR="S. Casale and V. Catania and A. La Corte",
TITLE="Performance Evaluation of a {DQDB} Metropolitan Area Network for
Connection Oriented Services",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina",
PAGES=11,
YEAR=1992,
REFERENCES=19,
KEYWORDS="Dqdb; man",
ABSTRACT="The analysis and assessment of the access protocol of the DQDB
Metropolitan Area Network, has been the subject of inense research
activity in the last few years. One of the less investigated points is
that regarding the problems connected with the transport of connection
oriented services by using QA slots. In the paper the authors deal with
some aspects of ths subject. They present some results obtained by
simulation.",
}

@INPROCEEDINGS{Cata92:Field,
AUTHOR="F. Cataldi and D. D. Pino and G. D. Rienzo",
TITLE="Field-Trials on Public High-Speed Data Services in Italy",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina",
PAGES=14,
YEAR=1992,
REFERENCES=3,
KEYWORDS="Dqdb; LAN; MAN; field trial",
ABSTRACT="This paper describes the actual situation on public high-speed
services in Italy reffering to the various implemntations planned by SIP
in the short term and their evolution within the framework of developing
broadband network (BISDN). Starting from 1990 to 1993, the following
field-trial projects will be realized in Italy: C-LAN, MAN Turin, MAN
Trieste, MAN Pisa, MAN Florence and their interconnection.",
}

@ARTICLE{Chla92:Connection,
AUTHOR="I. Chlamtac and M. G. Kienzle",
TITLE="Connection Management in High-Speed Interconnection Systems",
JOURNAL=jhsn,
VOLUME=1,
NUMBER=2,
PAGES="145-166",
YEAR=1992,
REFERENCES=21,
KEYWORDS="Multitasking; control; hslan",
ABSTRACT="This paper examines the issue of connection management control
for these interconnection systems. It describes the interconnection
system environment, the characteristics of the traffic being carried,
and the ensuing problem of efficient connection management.",
}

@INPROCEEDINGS{Chri92:Stuttgart,
AUTHOR="P. Christ and R. Rühle",
TITLE="The Stuttgart {MAN} Field Trial",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina",
PAGES=6,
YEAR=1992,
REFERENCES=1,
KEYWORDS="HsLAN; MAN; LAN; dqdb",
ABSTRACT="Together with Daimler Benz AG and Porsche AG the University of
Stuttgart participates in one of the two MAN field trials of the
Deutsche Bundespost Telekom. This paper describes our experiences with
the MAN so far.",
}

@INPROCEEDINGS{Cont92:DQDB,
AUTHOR="M. Conti and Enrico Gregori and Luniano Lenzini",
TITLE="{DQDB} Modeling: Problem complexity reduction and solution via
Markov chains",
BOOKTITLE="IFIP Transactions C5 IFIP WG 7.3 Conference",
ISBN="0926-549X",
PAGES="47-62",
YEAR=1992,
REFERENCES=14,
KEYWORDS="Dqdb; MAN; LAN; Markov chain; analysis; analytical model",
ABSTRACT="This paper presents a novel approach to DQDB modeling; the
innovative aspect lies in the attempt to provide an accurate
representation of the process of the busy slots travelling on the
forward bus. We show in the paper that for aggregate loads exceeding
80\% of the medium capacity, the Bernoulli hypothesis generally used for
modeling the length of busy trains diverges greatly from the actual
behaviour.",
}

@ARTICLE{Cruz92:Service,
AUTHOR="Rene L. Cruz",
TITLE="Service Burstiness and Dynamic Burstiness Measures: A Framework",
JOURNAL=jhsn,
VOLUME=1,
NUMBER=2,
PAGES="105-127",
YEAR=1992,
REFERENCES=27,
KEYWORDS="Burstiness; leaky bucket; service discipline; statistical
multiplexing; queueing network",
ABSTRACT="We introduce a framework for characterizing service
disciplines in terms of service burstiness. A wide range of service
disciplines recently proposed for high-speed integrated services
networks fall within this unifying framework. We introduce dynamic
burstiness measures, and use them to describe the relationship between
the burstiness of traffic entering a server, the burstiness of traffic
exiting a server, the service burstiness of a server.",
}

@ARTICLE{Daig92:Queue,
AUTHOR="J. N. Daigle and S. K. Tang",
TITLE="The Queue Length Distribution for Multiserver Discrete Time
Queueswith Batch Markovian Arrivals",
JOURNAL=comstat,
VOLUME=8,
NUMBER=4,
PAGES="665-683",
YEAR=1992,
REFERENCES=20,
KEYWORDS="Dmap; batch arrival; delay system; multiserver; discrete time;
Markov chain; analysis; generating function; matrix analytic method",
}

@INPROCEEDINGS{DelR92:Throughput,
AUTHOR="E. Del Re and Romano Fantacci and N. Marsella and G.
Castellini",
TITLE="Throughput and Packet Loss Evaluation in Shufflenet Multihop
Network using different Routing Algorithms",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina",
PAGES=6,
YEAR=1992,
REFERENCES=5,
KEYWORDS="Shufflenet; throughput; routing algorithm",
ABSTRACT="The network throughput, the network mean time delay as well as
the loss probability for input packets and the loss probability for
recirculating packets are evaluated using the classical minimum hop
algorithm. Through simulations it has been highlighted that the minimum
hop algorithm causes unbalanced traffic in the network. In order to
obtain a better channel utilization, a simple adaptive routing algorithm
is proposed.",
}

@INPROCEEDINGS{DeSa92:CRMA,
AUTHOR="M. De Sanctis and L Proietti",
TITLE="{CRMA} protocol performance analysis for a centralized processing
architecture",
BOOKTITLE="5. IEEE Workshop on Metropolitan Area Networks",
ADDRESS="Taomina, Italy",
PAGES=9,
YEAR=1992,
KEYWORDS="CRMA; cyclic reservation multiple access; LAN; MAN; HSLAN;
protocol",
}

@INPROCEEDINGS{Diot92:Contribution,
AUTHOR="Christophe Diot",
TITLE="A Contribution to Transport Mechanism Enhancement Based on {OSI}
{TP4} and {XTP} Implementations Comparison",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina",
PAGES=15,
YEAR=1992,
REFERENCES=24,
KEYWORDS="Transport layer; transport protocol",
ABSTRACT="Based on the experience acquired in TP4 and XTP implementation
and modelling, this paper proposes first some enhancements that can be
brought to the OSI Transport Portocol to make it more convenient and
efficient. Those enhancements are mainly required to simplify Transport
mechanisms and to make the implementation easier.",
}

@ARTICLE{Dona92:Intelligent,
AUTHOR="A. Donahoe and T. Turner",
TITLE="Intelligent Networking - A Case Study",
JOURNAL="Telecommunication Journal of Australia",
VOLUME=42,
NUMBER=1,
PAGES="18-21",
YEAR=1992,
REFERENCES=2,
KEYWORDS="IN; intelligent network; economic evaluation; case study;
development",
}

@ARTICLE{Ecke92:Modularchitektur,
AUTHOR="P. Eckelmann",
TITLE="Modularchitektur für kompakte Kartensysteme",
JOURNAL="Elektronik",
VOLUME=5,
PAGES="148-153",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="Transputer; processor; bus",
}

@ARTICLE{Fala92:Traffic,
AUTHOR="S. O. Falaki and S.-A. Soerensen",
TITLE="Traffic Measurements on a Local Area Computer Network",
JOURNAL=comcom,
VOLUME=15,
NUMBER=3,
PAGES="192-197",
YEAR=1992,
REFERENCES=13,
KEYWORDS="LAN; Traffic Measurement; Ethernet",
ABSTRACT="The characteristics of data traffic on the Ethernet LAN at
UCL'sDepartment of Computer Science are investigated on the basis of
measurements. The analysis of the arrival pattern of packets on the
network is found not to be a Poisson process. Both Weibull and
hyperexponential distributions are found to be suitable candidates, with
the hyperexponential giving a slightly better fit. Packet arrivals are
found to exhibit a source locality",
}

@ARTICLE{Fohr92:Transputer,
AUTHOR="R. Föhr",
TITLE="Transputer - Verteilte Echtzeitsysteme",
JOURNAL="Elektronik",
VOLUME=5,
PAGES="154-164",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="Transputer; processor; real time; operating system",
ABSTRACT="Parallelverarbeitung in Echtzeitsystemen stellt den Ausweg aus
den Situationen dar, in denen bisher ein einsamer Mikroprozessor am
Rande der Leistungsfähigkeit mit seinem Zeitmanagement kämpft.",
}

@ARTICLE{Fran92:Extended,
AUTHOR="William R. Franta and J. P. Hughes",
TITLE="Extended High Speed Networks Employing {HIPPI} Switches, High
Speed {WANs,} and {FDDI} Rings",
JOURNAL=jhsn,
VOLUME=1,
NUMBER=2,
PAGES="167-192",
YEAR=1992,
REFERENCES=40,
KEYWORDS="FDDI; MAN; HSLAN; WDM; wavelength division multiplex;
interconnection",
ABSTRACT={Our focus in this paper is to concentrate on LAN/WAN networks
currently within reach that attempt to "follow suit", concentrating
specifically on FDDI- and HIPPI based LAN networks, new WAN offerings,
and concluding with speculations on next generation high speed
networking capabilities. Along the way we enumerate certain observations
relevant to the acquisition and use of extended high-speed networks.},
}

@INPROCEEDINGS{Gagn92:Analytical,
AUTHOR="M. Gagnaire",
TITLE="An Analytical Model for the General Distributed Queueing Protocol
Based on the M/G/m Queue",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina",
PAGES=14,
YEAR=1992,
REFERENCES=14,
KEYWORDS="Dqdb; fairness; MAN; m/g/n",
ABSTRACT="The Distributed Queueing protocol (DQ) is the access scheme
adopted for asynchronous traffic on the DQDB Metropolitan Area Network.
In previous papers, we have proposed an extension of this protocol
called general Distributed Queueing protocol (g-DQ) able to reduce the
well known DQDB unfairness. In this paper, we propose an approximate
analytical model of $g-DQ$ based on the M/G/m queue.",
}

@ARTICLE{Gauf92:Multi,
AUTHOR="L. Gauffin and L. Hakansson and B. Pehrson",
TITLE="Multi-Gigabit Networking Based on {DTM} - A {TDM} Medium Access
Technique With Dynamic Bandwidth Allocation",
JOURNAL=cnis,
VOLUME=24,
PAGES="119-130",
YEAR=1992,
KEYWORDS="LAN; bus; slot assignment; ATM",
}

@ARTICLE{Gerr92:Developing,
AUTHOR="P. Gerrand and G. Fidler",
TITLE="Developing an Australian Vision of the Future Intelligent
communications Market",
JOURNAL="Telecommunication Journal of Australia",
VOLUME=42,
NUMBER=1,
PAGES="3-8",
YEAR=1992,
REFERENCES=5,
KEYWORDS="IN; intelligent network; overview",
}

@ARTICLE{Gitl92:Broadband,
AUTHOR="R. D. Gitlin and Thomas B. London",
TITLE="Broadband Gigabit Research and the Luckynet Testbed",
JOURNAL=jhsn,
VOLUME=1,
NUMBER=1,
PAGES="1-47",
YEAR=1992,
REFERENCES=37,
KEYWORDS="ATM; BISDN; multichannel; congestion control",
ABSTRACT="This paper describes the motivation, architecture, initial
applications, and objectives for LuckyNet, an AT\&T Bell Labs gigabit
research network. Building upon the BISDN infrastructure of SONET
transport and the ATM packet protocol, LuckyNet will provide a fertile
testbed for investigating: broadband applications, network
architectures, gigabit packet switches and LANs, high-througput
protocols and interfces, and networkservices and operations",
}

@ARTICLE{Hams92:FFOL,
AUTHOR="Jim Hamstra and Robert L. Fink",
TITLE="{FFOL} Transmission Services - Issues for a Physical Layer
Protocol",
JOURNAL=comcom,
VOLUME=15,
NUMBER=5,
PAGES="305-310",
YEAR=1992,
REFERENCES=3,
KEYWORDS="FDDI; physical layer",
ABSTRACT="The FDDI Follow-On LAN (FFOL) standard is being developed as a
successor of FDDI. FFOL, like FDDI, consists of several standards, each
a part of the whole. The lower three layers of FFOL standards provide
the Transmission Services of FFOL. These are a Physical Layer Medium
Dependent (PMD) standard, a Physical Layer Protocol (PHY) standard, and
a Service Multiplexer (SMUX) standard.",
}

@ARTICLE{Hasc92:Hochgeschwindigkeits,
AUTHOR="W. Hascher",
TITLE="Hochgeschwindigkeits-Design mit dem Oszilloskop",
JOURNAL="Elektronik",
VOLUME=12,
PAGES="84-86",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="Measurement; measurement method",
ABSTRACT="Hier einige High-Speed-Meßbeispiele aus der Praxis.",
}

@ARTICLE{Herg92:PLD,
AUTHOR="H.-J. Hergel",
TITLE="{PLD-Programmiertechnologien}",
JOURNAL="Elektronik",
VOLUME=5,
PAGES="44-46",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="Technology",
ABSTRACT="Wo liegen die Unterschiede sowie die Vorteile und Nachteile
der einzelnen PLD-Technologien?",
}

@ARTICLE{Irsh92:Fully,
AUTHOR="M. I. Irshid and Mohsen Kavehrad",
TITLE="A Fully Transparent Fiber-Optic Ring Architecture For {WDM}
Networks",
JOURNAL=ieeejlt,
VOLUME="SAC-10",
NUMBER=1,
PAGES="101-108",
YEAR=1992,
REFERENCES=17,
KEYWORDS="WDM; wavelength division multiplex; ring; optical lan",
ABSTRACT="In this paper, we propose a fully transparent fiber-optic ring
architecture for wavelength division multiplexed (WDM) networks.",
}

@ARTICLE{Kaus92:Comparison,
AUTHOR="R. P. Kaushal and J. S. Bedi",
TITLE="Comparison of Hypercube, Hypernet, and Symmetric Hypernet
Architectures",
JOURNAL=acmcan,
VOLUME=20,
NUMBER=5,
PAGES="13-25",
YEAR=1992,
REFERENCES=11,
KEYWORDS="Hypercube; interconnection; multiprocessor system; topology",
ABSTRACT="Hypercube has been the most popular topology for developing
multiprocessor supercomputers because of its connectivity, regularity,
symmetry and algorithmic mapping properties. However, if a hypercube
needs to be expanded at some future time, both hardware configuration
and cammunication software of each node has to be altered because its
node degree is not constant. We propose a new topology called symmetric
hypernet.",
}

@INPROCEEDINGS{Kuhn92:Traffic,
AUTHOR="P. J. Kühn",
TITLE="Traffic Engineering for High Speed Networks",
BOOKTITLE="IFIP Transactions C5 IFIP WG 7.3 Conference",
ISBN="0926-549X",
PAGES="7-25",
YEAR=1992,
REFERENCES=8,
KEYWORDS="HsLAN; MAN; LAN; ISDN; ATM; interconnection",
ABSTRACT="The contribution reviews the principal service types,
multiplexing and switching concepts, architectural structures of LAN/MAN
and ATM networks and their interworking scenarios based on leased
channels, virtual connection, virtual path, MAN switching, and
connectionless service function concepts. The contribution concludes
with the identification of the key modelling and traffic engineering
aspects.",
}

@ARTICLE{Leon92:Silicon,
AUTHOR="M. Leonard",
TITLE="Silicon Chips Simplify Gigabit Data-Link Design",
JOURNAL="Electronic design",
PAGES="47-52",
YEAR=1992,
KEYWORDS="Hardware; interface; high speed",
}

@ARTICLE{Lett92:ECL,
AUTHOR="F. J. Lettang",
TITLE="{ECL} Clocks for High-Performance {RISC} Workstations",
JOURNAL="Hewlett-Packard-Journal",
PAGES="23-25",
YEAR=1992,
KEYWORDS="Bus; risc; hardware",
ABSTRACT="In the HP 9000 Series 700 workstations, clock signals are
distributed using differential ECL circuits, and the VLSI chips have
CMOS inputs operating at ECL levels. Critical clock delay signals are
routed on 50-ohm striplines on printed circuit board inner layers.",
}

@INPROCEEDINGS{Levy92:Connectionless,
AUTHOR="Roger P. Levy and S. Martini and L. Musumeci",
TITLE="Connectionless broadband data services: architectural aspects,
protocol, services",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina, Italy",
PAGES=13,
YEAR=1992,
REFERENCES=5,
KEYWORDS="ATM; connectionless service; switching; Bisdn",
ABSTRACT="This paper describes the strategy identified by ITALTEL and
AT\&T to support SMDS/CBDS. It is based on the BNS-2000 product, that is
a high throughput low delay, cell relay node. Both IEEE 802.6 and BISDN
technologies have been identified as appropriate for supporting
SDMDS/CBSD. Initially, BNS-2000 nodes allow the implementation of MANs
through IEEE 802.6 interfaces.",
}

@ARTICLE{Lu92:Single,
AUTHOR="J. Lu and L. Kleinrock",
TITLE="Performance Analysis of Single-Hop Wavelength Division Multiple
Access Networks",
JOURNAL=jhsn,
VOLUME=1,
NUMBER=1,
PAGES="61-77",
YEAR=1992,
REFERENCES=14,
KEYWORDS="Performance analysis; network; WDM; wavelength division
multiplex",
ABSTRACT="Wave length division multiple access (WDMA) provides a way to
tap the huge bandwidth of an optical fiber by simultaneously operating
on multiple channels at different wavelengths, with each channel running
at the speed of the electronics of an end user station. This paper
presents a mathematical model which approximates WDMA networks with
general hardware configurations and arbitrary traffic patterns.",
}

@INPROCEEDINGS{Luml92:High,
AUTHOR="J. Lumley",
TITLE="A High-Throughput Network Interface to a {RISC} Workstation",
BOOKTITLE="IEEE Workshop on the Architecture and Implementation of High
Performance Communication Subsystems",
ADDRESS="Tucson, Az.",
YEAR=1992,
REFERENCES=4,
KEYWORDS="Hardware; interface; architecture; LAN; protocol",
ABSTRACT="A high speed interface for the HP9000/700 workstations is
described.",
}

@BOOK{Marg92:I860,
AUTHOR="N. Margulis",
TITLE="Der i860: Architektur und Programmierung",
ISBN="3-89362-164-4",
PUBLISHER="te-wi",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="Processor",
}

@INPROCEEDINGS{Mark92:Object,
AUTHOR="J. G. Markopoulos and C. I. Costopoulou and Michalis Theologou
and E. Protonotarios",
TITLE="An object-oriented approach for quality of service and network
performance modeling",
BOOKTITLE="IFIP Transactions C5 IFIP WG 7.3 Conference",
ISBN="0926-549X",
PAGES="63-77",
YEAR=1992,
REFERENCES=14,
KEYWORDS="Object-oriented programming; qos; performance parameter",
ABSTRACT="The purpose of this paper is to describe the modeling of
Quality of Service and Network Performance in an object-oriented way, as
well as their representation inside different networks that lie one on
top of the other. It is shown that the Quality of Service and the
Network Performance object classes can be described in a straightforward
manner, giving a precise meaning to these two concepts.",
}

@ARTICLE{May92:Message,
AUTHOR="D. May and P. Thompson and P. Eckelmann",
TITLE="Message-Routing als Schlüsseltechnik",
JOURNAL="Elektronik",
NUMBER=24,
PAGES="58-66",
YEAR=1992,
LANGUAGE="German",
REFERENCES=6,
KEYWORDS="Transputer; message switching; routing; parallel computing",
ABSTRACT="In diesem Artikel wird das Kommunikationssystem der Transputer
T9000 mit den Router-Bausteinen C104 vorgestellt und untersucht.",
}

@INPROCEEDINGS{Mong92:New,
AUTHOR="G. Mongatti and M. Petri and G. Stefanutti",
TITLE="A new Metropolitan Area Network in Trieste: A Field Trial",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina",
PAGES=12,
YEAR=1992,
REFERENCES=4,
KEYWORDS="Dqdb; field trial; man",
ABSTRACT="The network architecture, chosen for Trieste's MAN, is based
on the Alcatel implemntation of the DQDB MAN. The initial topology
involves five customers, who present an open bus access network which
connects them directly to the network nodes. Purpose of this paper is to
present the Trieste field trial with particular focus on the design and
the installation phase of the project.",
}

@INPROCEEDINGS{Mont92:FASTPAC,
AUTHOR="M. J. Montgomery",
TITLE="{FASTPAC} - The Commercial Reality",
BOOKTITLE="Australian Broadband Switching and Services Symposium",
ADDRESS="Melbourne",
VOLUME=1,
PAGES="193-202",
YEAR=1992,
REFERENCES=7,
KEYWORDS="MAN; DQDB; application",
ABSTRACT="AOTC's FASTPAC service, based upon the QPSX developed DQDB
technology, will become a commercial reality with the launch of the
service in September this year. The subject of this paper isto describe
the first service offerings, the pricing and the applications that users
will be expected to run on the service. Perceptions of the current
customer trials will be discussed to emphasise user applications and
their requirements for high",
}

@ARTICLE{Mukh92:Alternative,
AUTHOR="B. Mukherjee and S. Banerjee",
TITLE="Alternative Strategies for Improving the Fairness in an an
Analytical Model of the {DQDB} Network",
JOURNAL=ieeetc,
VOLUME="C-",
PAGES=34,
YEAR=1992,
REFERENCES=15,
KEYWORDS="DQDB; hsLAN; MAN; LAN; analytical model; Markov chain;
fairness",
ABSTRACT="First, the unfairness problem of DQDB is addressed, and
several alternative solutions that can improve the network's fairness
are proposed. The second contribution of this paper is the development
of an analytical model of the DQDB network.",
}

@ARTICLE{Oie92:Nonblocking,
AUTHOR="Yuji Oie and M. Murata and Koji Kubota and H. Miyahara",
TITLE="Performance Analysis of Nonblocking Packet Switch with Input and
Output Buffers",
JOURNAL=ieeecom,
VOLUME="COM-40",
NUMBER=8,
PAGES="1294-1297",
YEAR=1992,
REFERENCES=9,
KEYWORDS="ATM; switching block; performance evaluation; analysis; loss
probability; input buffer; output buffer",
}

@ARTICLE{Pfab92:Herausforderung,
AUTHOR="S. Pfab",
TITLE={Herausforderung Submicron Design"},
JOURNAL=design_elekt,
VOLUME=9,
PAGES="30-34",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="Technology; design",
ABSTRACT="Submicron-ASIC-Design heißt nicht nur, welcher
Halbleiterhersteller die beste Technologie hat, sondern auch mit welcher
ASIC-Design-Methode neuen Anforderungen Rechnung getragen wird. Dazu
zäelen Gehäuseanforderungen, ``Pinning'', Verlustleistungsberechnung,
synchroner Schaltungsentwurf, ``floorplanning'', Taktbaumgenerierung,
Simulation mit ``Estimated'' und ``Postlayout''-Werten, statistische
Timinganalyse, ``Chip to Chip Delay'' und ASIC-Test.",
}

@BOOK{Pfef92:Beschreibung,
AUTHOR="D. Pfeffer",
TITLE="Beschreibung, Klassifikation und Bewertung paralleler Algorithmen
für die verteilte, zeitdiskrete Logiksimulation",
PUBLISHER="Universität Stuttgart, Institut für Parallele und Verteilte
Höchstleistungsrechner",
ADDRESS="Stuttgart",
PAGES=53,
YEAR=1992,
REFERENCES=52,
KEYWORDS="Distributed simulation; algorithm",
ABSTRACT="The basic simulation algorithms for distributed simulation are
presented and compared.",
}

@ARTICLE{Pich92:Hei,
AUTHOR="H. Pichlik",
TITLE="Heißes Eisen: Der Alpha-Prozessor von {DEC}",
JOURNAL=ct,
PUBLISHER="Heise Verlag",
ADDRESS="Hannover",
VOLUME=6,
PAGES="52-54",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="Processor; high speed",
ABSTRACT="Mit der Ankündigung des 'Alpha-Jets' hat DEC vor wenigen
Wochen alle etablierten Anbieter von CISC- und RISC-Prozessoren aus dem
Dornröschenschlaf gerissen, geht die Digital Equipment Corporation doch
mit einem wirklich 'heißen Eisen' ins Rennen. Peilt man hie noch 100 MHz
an, überraschen jene bereits mit einem 200-MHz-Design.",
}

@ARTICLE{Qu92:Parallelring,
AUTHOR="Y.-Z. Qu and Lawrence H. Landweber and M. Livny",
TITLE="Parallelring: A Token Ring {LAN} with Concurrent Multiple
Transmissions and Message Destination Removal",
JOURNAL=ieeecom,
VOLUME="COM-40",
NUMBER=4,
PAGES="738-745",
YEAR=1992,
REFERENCES=4,
KEYWORDS="LAN; protocol; token ring",
ABSTRACT="This paper introduces a new token ring local area network, the
parallelring. The ability to concurrently support multiple communication
paths on a single loop in an efficient and fair manner differentiates
the parallelring from earlier ring architectures. This is accomplished
by using a message destination removal scheme and hence, allowing more
than one station to transmit. Parallelring is in this paper explained
and compared with PRONET",
}

@ARTICLE{Rans92:VISTAnet,
AUTHOR="M. N. Ransom",
TITLE="The {VISTAnet} Gigabit Network Testbed",
JOURNAL=jhsn,
VOLUME=1,
NUMBER=1,
PAGES="49-60",
YEAR=1992,
REFERENCES=5,
KEYWORDS="ATM; BISDN; test",
ABSTRACT="This paper presents an overview of the VISTAnet gigabit
testbed. VISTAnet is one of a number of ``gigabit'' testbeds organized
by the Corporation for National Research Initiatives.",
}

@ARTICLE{Roeh92:Basiswissen,
AUTHOR="E. Roehm and M. Schütz",
TITLE="Basiswissen über {VHDL}",
JOURNAL="Markt and Technik",
VOLUME=23,
PAGES="55-60",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="Hardware design language",
ABSTRACT="Durch die Verwendung der Hardware-Beschreibungssprache VHDL
(VHSIC HArdware Description Language) wird es möglich, auf einer hohen
Abstraktionsebene Modelle zu erstellen und somit schnell zusimulieren.
Fehler können so früh erkannt werden. Ebenso ist aber auch die
Beschreibung sehr detaillierter Low-Level-Modellemöglich, dabei liegt
die Wahl der Genauigkeit beim Benutzer selbst.",
}

@INPROCEEDINGS{Roma92:AAL,
AUTHOR="Allyn Romanow",
TITLE="{AAL} 5 for {ATM} Networks",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina",
PAGES=8,
YEAR=1992,
REFERENCES=9,
KEYWORDS="ATM; layered protocol; protocol layer",
ABSTRACT="This paper describes AAL 5, comparing it with the AALs already
defined, and discusses ist motivation, history and current status.",
}

@ARTICLE{Ross92:Overview,
AUTHOR="Floyd E. Ross and Robert L. Fink",
TITLE="Overview of {FFOL} - {FDDI} Follow-On {LAN}",
JOURNAL=comcom,
VOLUME=15,
NUMBER=1,
PAGES="5-10",
YEAR=1992,
REFERENCES=3,
KEYWORDS="FDDI; LAN; high speed; standardization; future outlook;
ethernet; token ring",
ABSTRACT="FDDI has gained wide acceptance as the follow-on LAN for
Ethernet and Token Ring. LANs as higher performance is required. FDDI,
including FDDI-II isochronous services, will be widely deployed in the
1990s as both a backbone and desktop distribution LAN. But what will
follow FDDI? This paper serves as an introduction to FFOL, focusing on
FFOL requirements, project organization, and the architecture of FFOL.",
}

@MISC{Seib92:Beschreibung,
AUTHOR="W. Seibold",
TITLE="Beschreibung von parametrisierbaren Funktionsblöcken zur
Systemsmulation mit der Hardware-Beschreibungssprache {VHDL} (3 Bände)",
PUBLISHER="Institut für Nachrichtenvermittlung und Datenverarbeitung",
ADDRESS="Stuttgart",
PAGES=350,
YEAR=1992,
LANGUAGE="German",
REFERENCES=18,
KEYWORDS="Hardware design language; simulation language; simulation
model; discrete event simulation",
ABSTRACT="Im Rahmen der Diplomarbeit wurden Grundelemente elektronischer
Schaltungen auf Parametrisierbarkeit untersucht und ihr Verhalten mit
der Hardwarebeschreibungssprache VHDL beschrieben (u.a. Addierer,
digitale Filter, Multiplexer, Generatoren.). Die entstandenen
Basisblöcke wurden durch Simulation verifiziert.",
}

@ARTICLE{Sidh92:Congestion,
AUTHOR="Deepinder Sidhu and Shukri Abdallah and Raj Nair",
TITLE="Congestion Control in High Speed Networks via Alternate Path
Routing",
JOURNAL=jhsn,
VOLUME=1,
NUMBER=2,
PAGES="129-144",
YEAR=1992,
REFERENCES=8,
KEYWORDS="Routing algorithm; alternate routing; congestion control",
ABSTRACT="This paper presents a congestion control scheme based on
alternate path routing. In the scheme, if a node encounters congestion
or loses its preferred neighbor on its primary path to a destination, it
sends data packets to that destination over precomputed alternate
paths.",
}

@ARTICLE{Stan92:FDDI,
AUTHOR="S. Stanley",
TITLE="{FDDI-Chips} der zweiten Generation",
JOURNAL="Elektronik",
VOLUME=5,
PAGES="39-41",
YEAR=1992,
LANGUAGE="German",
REFERENCES=6,
KEYWORDS="FDDI; hardware; ring network; processor",
ABSTRACT="Der Vorteil von FDDI hat sich allgemein herumgesprochen, die
Anwendung beginnt aber eher schleppend wegen der noch relativ hohen
Kosten. Eine Senkung kommt mit den hier vorgestellten Chips in Sicht.
Sie stellen auf diesem Gebiet bereits die ``zweite Generation'' dar, mit
gegenüber der ersten wesentlich erweiterten Funktionen. Unter anderem
übernehmen sie jetzt auch die ``Uebersetzung'' von Daten zwischen
Ethernet-Netzen und dem FDDI-Netz.",
}

@INPROCEEDINGS{Taka92:Distributed,
AUTHOR="Akihiko. Takase and Jun-ichiro Yanagi",
TITLE="{MAN} with Distributed {ATM} Cross-Connect for Smooth
Introduction and Future Extension",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina",
PAGES=6,
YEAR=1992,
REFERENCES=4,
KEYWORDS="ATM; cross connect; MAN; BISDN",
ABSTRACT="This paper proposes a flexible network architecture aimed at
the early introduction of broadband communication services and the
smooth extension in future. To give the flexibility to the system, the
definite separation is necessary between the application dependent
portion and the basic ATM switching/transmission portion. A network with
the distributed ATM cross-connector is proposed to make the broadband
service introduction easier.",
}

@INPROCEEDINGS{Tonk92:Broadband,
AUTHOR="B. A. Tonkin and F. Symons",
TITLE="Broadband Applications and Services Trials Based on {FASTPAC}",
BOOKTITLE="Australian Broadband Switching and Services Symposium",
ADDRESS="Melbourne",
VOLUME=1,
PAGES="203-210",
YEAR=1992,
REFERENCES=8,
KEYWORDS="MAN; DQDB; Broadband; Application",
ABSTRACT="This paper describes a trial network enviroment that is very
suitable for providing demonstrations of the capabilities of broadband
networks such as FASTPAC. It discusses the importance of early trials
with leading edge users to develop and refine the broadband applications
and services.",
}

@BOOK{As92:Tutorial,
AUTHOR="H. van As",
TITLE="Tutorial on Media Access Mechanisms for High-Speed {LANs} and
{MANs:} The Evolution towards Terabit/s Networks",
PUBLISHER="Tutorium EFOC/LAN 92",
ADDRESS="Paris",
PAGES=173,
YEAR=1992,
REFERENCES=272,
KEYWORDS="DQDB; LAN; MAN; HSLAN; token bus; token ring; CRMA; cyclic
reservation multiple access",
}

@ARTICLE{Wall92:Gigabits,
AUTHOR="U. Wallenhorst",
TITLE="Gigabits sicher verbinden Steckverbinder in ultraschnellen
Bussystemen",
JOURNAL="Elektronik",
VOLUME=15,
PAGES="38-41",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="High speed; physical design; bus",
ABSTRACT="Infolge höchster Übertragungsfrequenzen können in
Kommunikationsnetzen unerwünschte elektromagnetische Effekte wie
Übersprechen und Verzerrung auftreten. Bevorzugte ``Probleme''-Stellen
sind dabei die Steckverbinder, die so extreme Forderungen wie geringste
Durchgangsdämpfung, verringerte Rasterabstände, höhere Polzahlen sowie
verbesserte Übersprechdämpfung beigleichzeitig steigenden
Übertragungsfrequenzen.erfüllen sollen",
}

@ARTICLE{Wang92:Intelligent,
AUTHOR="S. Wangmann and C. S. Roberts and R. Arden",
TITLE="Intelligent Network Services",
JOURNAL="Telecommunication Journal of Australia",
VOLUME=42,
NUMBER=1,
PAGES="9-17",
YEAR=1992,
KEYWORDS="IN; intelligent network; service characterization; overview",
}

@ARTICLE{Wink92:ASIC,
AUTHOR="R. Winkelmann and H. Hiller",
TITLE="{ASIC-Entwicklung} mit {VHDL}",
JOURNAL=design_elekt,
VOLUME=9,
PAGES="20-28",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="Hardware design language; design",
ABSTRACT="Grundlagen VHDL-basierender Entwurfstechnik, auch unter dem
Aspekt der Testbarkeit und Designsicherheit, werden in diesem Artikel
behandelt. Die Entwicklung eines CMOS-Gate-Array-Bausteins dient zur
Verdeutlichung der Arbeitsabläufe.",
}

@INPROCEEDINGS{Yoko92:Buffering,
AUTHOR="Tetsuya Yokotani and Toshihiro Shikama",
TITLE="The Buffering Strategies in {CLSFs} and Their Performance",
BOOKTITLE="5th IEEE workshop on MAN",
ADDRESS="Taormina",
PAGES=14,
YEAR=1992,
REFERENCES=9,
KEYWORDS="ATM; Buffered network; buffer management; CONNECTIONLESS
SERVICE",
ABSTRACT="This paper classifies networks in MAN and BISDN into three
types by location of the Connectionless Service Functions (CLSF) and
considers the strategies to handle the cells in CLSFs on every network
type. Moreover, as this paper shows the characteristic of each strategy
by queueing model analysis, it selects best scheme of them for realizing
a CLSF on every network type.",
}

@MISC{Zurf92:IBM,
AUTHOR="Erwin A. Zurfluh and P. Dill and R. Heller and W. Lemppenau and
Frank Müller",
TITLE="The {IBM} Zurich Research Laboratory's 1.13 Gb/s {LAN}
Prototype",
BOOKTITLE="5th IEEE Workshop on Metropolitan Area Networks",
ADDRESS="Taormina",
PAGES=18,
YEAR=1992,
KEYWORDS="CRMA; cyclic reservation multiple access; LAN; MAN",
}

@MISC{Gidr92:Centralized,
AUTHOR="R. Gidron and A. S. Acampora",
TITLE="Centralized and Distributed approaches to {ATM} Network",
PAGES="10 pages",
YEAR=1992,
KEYWORDS="gigabit ATM ATM switch switching; distributed vs. centralized
switch design",
ABSTRACT={Centralized and distributed approaches to the design and
implementation of a multigiga bits per second ATM switch are discussed.
The implementations constraints associated with a centralized switch are
demonstrated and an alternative distributed optical network architecture
is described. The distributed ATM switch fabric resides in small,
geographically dispersed access stations interconnected by a shared,
all-optical medium carrying many wavelength - multiplexed channels.
Although the underlying multihop architecture for the ATM network
produces a lower per-port throughput than that afforded by a large
centralized ATM switch, significant implementation advantages are noted.
Possible techniques to yield a higher per-port throughput approaching
that of a large centralized switch are also discussed. The distributed
approach exploits unique opportunities presented through the use of a
passive optical medium, including better modularity, higher reliability,
flexible connectivity among access stations, and provisions for
transmission format - independent "Clear Channels" to supplement the
basic ATM format capability. A network based on these principles
(TeraNet), has been implemented as part of the ACORN project at Columbia
University and it offers user access rates of 1 Gigabit/second.},
URL="ftp://pub/cell-relay/docs/ftp.ctr.columbia.edu/acorn/92/CID92a.ps.Z",
}

@TECHREPORT{Rond92:Predictive,
AUTHOR="Jose I. Ronda and A. Ortega and Angel Fernandez and Narciso.
Garcia",
TITLE="Predictive Control of Variable Bit Rate Coders",
TYPE="Technical Report",
INSTITUTION="CTR, Columbia University",
PAGES="1-4",
YEAR=1992,
ABSTRACT="VBR coder; predictive control; buffer control; dynamic
programming used to generate optimal policies for coder states;
practical overflow-free TV or HDTV coder; EUREKA-256 project; stochastic
vs. deterministic optimal control; video",
URL="ftp://ftp.ctr.columbia.edu/pub/papers/image/92/ron92.ps",
}

@TECHREPORT{Herl92:Wavelets,
AUTHOR="Cormac Herley and M. Vetterli",
TITLE="Wavelets Generated by {IIR} Filter Banks",
TYPE="Technical Report",
INSTITUTION="Center for Telecommunication Research, Columbia
University",
PAGES=4,
YEAR=1992,
ABSTRACT="infinite impulse response filter banks to construct general
orthonormal wavelet bases with infinite support but rapid decay;
derivation of wavelet bases for the space of piecewise polynomial
functions; design examples; spline spaces",
URL="ftp://ftp.ctr.columbia.edu/pub/papers/image/92/her92a.ps",
}

@TECHREPORT{Rama92:Best,
AUTHOR="Kannan Ramachandran and M. Vetterli",
TITLE="Best Wavelet Packet Bases using Rate-Distortion Criteria",
TYPE="Technical Report",
INSTITUTION="CTR, Columbia University",
PAGES="1-5",
YEAR=1992,
KEYWORDS="signal compression JPEG DCT (discrete cosine transform)
wavelet",
ABSTRACT={DCT "wavelet packet" basis quadtree segmentation described as
an image coding application in a JPEG environment with good improvement
shown over non-adaptive JPEG quantization; wavelet packets; fast tree
pruning algorithm.},
URL="ftp://ftp.ctr.columbia.edu/pub/papers/image/92/ram92a.ps",
}

@BOOK{Stal92:Advances,
AUTHOR="W. Stallings",
TITLE="Advances in iNtegrated services digital networks {(ISDN)} and
broadband {ISDN}",
ISBN="0-8186-2797-2",
PUBLISHER="IEEE Computer Society Press",
YEAR=1992,
KEYWORDS="ISDN; NISDN; ATM; BISDN",
}

@BOOK{Stal92:ISDN,
AUTHOR="W. Stallings",
TITLE="{ISDN} and broadband {ISDN}",
ISBN="0-02-415475-X",
PUBLISHER="Macmillan",
NOTE="TK5103.7.S73 1992",
YEAR=1992,
KEYWORDS="book; BISDN; ATM",
}

@MISC{Weis92:OPTICAL,
AUTHOR="Yitzhak Weissman",
TITLE="{OPTICAL} {NETWORK} {THEORY}",
ISBN="0-89006-509-8",
NOTE="CIP (Mar. 92), \$88.00 (US)",
YEAR=1992,
KEYWORDS="book Optical communication optics fiber optics lightwave
transmission systems",
ABSTRACT="Includes bibliographical references and index.",
}

@MISC{Midw92:OPTOELECTRONICS,
AUTHOR="J. E. Midwinter and Yuanbin Guo",
TITLE="{OPTOELECTRONICS} {AND} {LIGHTWAVE} {TECHNOLOGY}",
ISBN="0-471-92934-4",
NOTE="CIP (Jan. 92) TK5103.59.M53 1992, \$75.00 (US)",
YEAR=1992,
KEYWORDS="book Optical communication optics fiber optics lightwave
transmission systems",
ABSTRACT="Includes bibliographical references and index.",
}

@INCOLLECTION{Marc92:Groupware,
AUTHOR="Geoffrey Bock",
TITLE="Groupware; The Next Generation of Information Systems?",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
YEAR=1992,
KEYWORDS="CSCW; groupware",
}

@INCOLLECTION{Bull92:Learning,
AUTHOR="Christine Bullen and J. M. Bennett",
TITLE="Learning from User Experience With Groupware",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
NOTE="also in Proceedings of CSCW'90; October 1990",
YEAR=1992,
KEYWORDS="CSCW; groupware",
}

@INCOLLECTION{Elli92:Groupware,
AUTHOR="C. A. Ellis and S. Gibbs and G. Rein",
TITLE="Groupware; The Research and Development Issues",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
NOTE="revised and extended from CACM 34,1 (January 1991)",
YEAR=1992,
KEYWORDS="CSCW; groupware; communication; collaboration; coordination",
}

@INCOLLECTION{Cole92:Primer,
AUTHOR="P. Cole and J. Nast-Cole",
TITLE="Primer on Group Dynamics for Groupware Developers",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
YEAR=1992,
KEYWORDS="CSCW; groupware; group behavior; group evolution",
}

@INCOLLECTION{Enge92:Authorship,
AUTHOR="D. Engelbart",
TITLE="Authorship Provisions In Augment",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
NOTE="Proceedings of COMPCON'84; February 1984",
YEAR=1992,
KEYWORDS="CSCW; groupware; conceptual frameworks; augmentation",
}

@INCOLLECTION{Bxdk92:Computer,
AUTHOR="S. Bxdker and J. Knudsen and M. Kyng and P. Ehn and K. Madsen",
TITLE="Computer Support for Cooperative Design",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
NOTE="Proceedings of the 2nd Conference on Computer-Supported
Cooperative Work; September 1988",
YEAR=1992,
KEYWORDS="CSCW; groupware; language",
}

@INCOLLECTION{Malo92:What,
AUTHOR="Thomas W. Malone and K. Crowston",
TITLE="What Is Coordination Theory And How Can It Help Design
Cooperative Work Systems?",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
NOTE="Proceedings of CSCW'90; October 1990",
YEAR=1992,
KEYWORDS="CSCW; groupware; coordination",
}

@INCOLLECTION{Olso92:User,
AUTHOR="G. Olson and J. Olson",
TITLE="User-Centered Design of Collaboration Technology",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
NOTE="Journal of Organizational Computing 1 (1) 1991",
YEAR=1992,
KEYWORDS="CSCW; groupware; design methods; design as cognition",
}

@INCOLLECTION{Flor92:Computer,
AUTHOR="F. Flores and M. Graves and B. Hartfield and T. Winograd",
TITLE="Computer Systems and the Design of Organizational Interaction",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
NOTE="ACM Transactions on Office Information Systems, April 1988",
YEAR=1992,
KEYWORDS="CSCW; groupware; design as intervention",
}

@INCOLLECTION{Marc92:Augmenting,
AUTHOR="D. Marca",
TITLE="Augmenting {SADT} To Develop Computer-Supported Cooperative
Work",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
NOTE="Proceedings of the 13th International Conference on Software
Engineering, May 1990",
YEAR=1992,
KEYWORDS="CSCW; groupware",
}

@INCOLLECTION{Bore92:Power,
AUTHOR="N. Borenstein and C. A. Thyberg",
TITLE="Power, Ease of Use and Cooperative Work in a Practical Multimedia
Message System",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
NOTE="International Journal of Man-Machine Studies Vol 34, 1991",
YEAR=1992,
KEYWORDS="CSCW; groupware; enabling technlogies; system capabilities;
multimedia electronic mail",
}

@INCOLLECTION{Prin92:Relevance,
AUTHOR="Wolfgang Prinz and Paola Pennelli",
TITLE="Relevance of the {X.500} Directory to {CSCW} Applications",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
NOTE="Proceedings of 1st European Conference on CSCW, September 1989",
YEAR=1992,
KEYWORDS="CSCW; groupware; personal naming; X.500; directory services",
}

@INCOLLECTION{Kawe92:Replicated,
AUTHOR="L. Kawell and S. Beckhardt and T. A. Halvorsen and R. Ozzie and
I. Grief",
TITLE="Replicated Document Management in a Group Communication System",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
NOTE="Proceedings of CSCW'88, September 1988",
YEAR=1992,
KEYWORDS="CSCW; groupware; connectivity for conferencing",
}

@INCOLLECTION{Conk92:Hypertext,
AUTHOR="Jeff Conklin",
TITLE="Hypertext: An Introduction and Survey",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
NOTE="IEEE Computer, September 1987",
YEAR=1992,
KEYWORDS="CSCW; groupware; hypertext",
}

@INCOLLECTION{John92:Xerox,
AUTHOR="J. D. Johnson and T. Roberts and W. Verplank and D. G. Smith and
C. Irby and M. Beard and K. Mackey",
TITLE="The Xerox Star: A Retrospective",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
NOTE="also in IEEE Computer, September 1989",
YEAR=1992,
KEYWORDS="CSCW; groupware; enabling technologies; user interfaces;
desktop metaphor",
}

@INCOLLECTION{Hend92:Rooms,
AUTHOR="D. Henderson and S. Card",
TITLE="Rooms: The Use of Multiple Virtual Workspaces to Reduce Space
Contention in a Window-based Graphic User Interface",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
NOTE="also in ACM Transactions on Graphics, 5 (3), July 1986",
YEAR=1992,
KEYWORDS="CSCW; groupware; rooms metaphor",
}

@INCOLLECTION{Mads92:Approaching,
AUTHOR="C. Madsen",
TITLE="Approaching Group Communication By Means Of An Office Building
Metaphor",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
NOTE="also in Proceedings of 1st European Conference on CSCW, September
1989",
YEAR=1992,
KEYWORDS="CSCW; groupware; office building metaphor",
}

@INCOLLECTION{Stef92:Beyond,
AUTHOR="M. Stefik and Gregg Foster and D. Brobow and Kenneth Kahn and
Stan Lanning and Lucy Suchman",
TITLE="Beyond the Chalkboard; Computer Support for Collaboration and
Problem Solving in Meeting",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
NOTE="also in Communications of the ACM, January 1987",
YEAR=1992,
KEYWORDS="CSCW; groupware; computer supported meetings; face-to-face
meetings",
}

@INCOLLECTION{Nuna92:Electronic,
AUTHOR="J. F. Nunamaker and A. Dennis and J. Valacich and D. Vogel and
J. George",
TITLE="Electronic Meeting Systems to Support Group Work",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
NOTE="also in CACM 22 (7); July, 1991",
YEAR=1992,
KEYWORDS="CSCW; groupware; group interaction tools",
}

@INCOLLECTION{Mant92:Experiences,
AUTHOR="M. Mantei and R. Baecker",
TITLE="Experiences in the Use of a Media Space",
BOOKTITLE="Groupware --- software for computer-supported cooperative
work",
EDITOR="David. Marca and Geoffrey. Bock",
ISBN="0-8186-2637-2",
PUBLISHER="IEEE Computer Society Press",
YEAR=1992,
KEYWORDS="CSCW; groupware; distributed meetings",
}

@BOOK{Stra92:XTP,
AUTHOR="Timothy W. Strayer and Bert J. Dempsey and Alfred Weaver",
TITLE="{XTP} -- the xpress transfer protocol",
ISBN="0-201-56351-7",
PUBLISHER="Addison-Wesley Publishing Company",
PAGES="580 pages",
YEAR=1992,
KEYWORDS="book network protocol design network protocol analysis XTP
multicast",
ABSTRACT="Chapter 1 Foundations of the Xpress Transfer Protocol Section
1.1 Why ANY New Protocol? Section 1.1.1 Changes Below Section 1.1.2
Changes Above Section 1.1.3 Changes Within Section 1.1.4 Repair or
Replace? Section 1.2 Why THIS New Protocol Section 1.2.1 Functional
Enhancements Section 1.1.2 Performance Enhancements Section 1.3 History
of XTP Section 1.4 Organization of Book Chapter 2 Network Concepts and
the XTP Architectural Model Section 2.1 Network Concepts Section 2.1.1
The OSI Reference Model Section 2.1.2 Data Transfer Models Section 2.1.3
Services and Service Access Section 2.1.4 Transport Layer Section 2.1.5
Network Layer Section 2.2 XTP Architecture Section 2.2.1 XTP Transfer
Layer Architecture Section 2.2.2 XTP Data Communication Model Section
2.2.3 XTP Data Delivery Service Requirements Chapter 3 Influential
Protocols Section 3.1 Conventional Transport Section 3.1.1 TCP Section
3.1.2 ISO Transport Protocol Section 3.1.3 Conventional Mechanisms
Section 3.2 Delta-t Section 3.3 NETBLT Section 3.4 GAM-T-103 Military
Real-Time Local Area Network Architecture Section 3.5 Versatile Message
Transaction Protocol Section 3.6 Datakit and the Universal Receiver
Protocol Section 3.7 Summary Chapter 4 Protocol Procedures Section 4.1
Introduction Section 4.1.1 XTP Packet Structure Overview Section 4.1.2
XTP Packet Formats Section 4.1.3 XTP protocol Procedures Section 4.1.4
Conventional Notations Section 4.2 Association Management Procedures
Section 4.2.1 Establishing an Association Section 4.2.2 Maintaining an
Association Section 4.2.3 Terminating an Association Section 4.2.4
Interesting Paradigms Section 4.2.5 Multicast Association Section 4.3
Path Management Procedures Section 4.3.1 Path Establishment Section
4.3.2 Path Maintenance Section 4.3.3 Path Release Section 4.4 Data Flow
Procedures Section 4.5 Flow Control Procedures Section 4.6 Rate Control
Procedures Section 4.7 Error Control Procedures Section 4.7.1 Checksums
Section 4.7.2 Acknowledgements and Retransmissions Section 4.7.3 Timers
Section 4.7.4 Synchronizing Handshake Section 4.7.5 Time-to-Live Section
4.7.6 Error Notification Chapter 5 Packet Structures Section 5.1
Introduction Section 5.1.1 Notation Convention Section 5.1.2 Segments
Section 5.2 XTP Header Section 5.2.1 Route Field (route) Section 5.2.2
Time-to-Live Field (ttl) Section 5.2.3 Command Field (cmd) Section 5.2.4
Key Field (key) Section 5.2.5 Synchronize Field (sync) Section 5.2.6
Sequence Number Field (seq) Section 5.2.7 Delivered Sequence Number
Field (dseq) Section 5.2.8 Sort Field (sort) Section 5.2.9 Data Length
Field (dlen) Section 5.2.10 Header Checksum Field (hcheck) Section 5.3
XTP Trailer Section 5.4 Control Segment Section 5.4.1 Rate Control
Fields (rate and burst) Section 5.4.2 Synchronize Echo Field (echo)
Section 5.4.3 Time Synchronization Fields (time and techo) Section 5.4.4
Key Exchange Field (xkey) Section 5.4.5 Route Exchange Field (xroute)
Section 5.4.6 Allocation Field (alloc) Section 5.4.7 Received Sequence
Number Field (rseq) Section 5.4.8 Selective Retransmission Fields (nspan
and spans) Section 5.4.9 The Reserved Fields (rsvd) Section 5.5
Information Segment Section 5.5.1 Data Segment Section 5.5.2 Address
Segment Section 5.5.3 Data and Address Segments Section 5.5.4 Management
Segment Chapter 6 Packet Formats Section 6.1 FIRST Packet Section 6.2
DATA Packet Section 6.3",
}

@TECHREPORT{Anon92:Xpress,
AUTHOR="Anonymous",
TITLE="Xpress Transfer Protocol {(XTP)} Specification version 3.6",
INSTITUTION="{Protocol Engines}",
PAGES="98 pages",
YEAR=1992,
KEYWORDS="XTP; Xpress Transfer Protocol; network protocol; design
network protocol analysis; multicast",
ABSTRACT="This document defines XTP message formats and peer-to-peer
message exchanges. It assumes the reader is familiar with network
protocols such as Delta-T, NETBLT, and IP for the motivation,
philosophy, and explainations that are largely omitted here. It is also
assumed that the reader is familiar with the C programming language.
Synopsis. SECTION 1 of this document consists of background and
introductory material. Except for the glossary of terms it is separate
from the protocol specification which is contained in sections 2 and 3.
SECTION 2 defines the syntax of XTP - i.e. the packet formats,
addressing conventions and encapsulation formats - and also defines the
meaning and interpretation of control fields and state elements in
protocol messages. In some cases the definitions in section 2 include
procedures for generating or interpreting specific fields. Tables and
figures that define the syntax of XTP packets are collected together in
Appendix E for guick reference. SECTION 3 defines the end-to-end
protocol procedures. The description is modular and reflects the
structure of the design. The major sections are management procedures,
data flow procedures, multicast procedures, and timers. Subsections
within each of these major sections define the difference protocol
mechanisms such as flow control, rate control and error control. Several
appendices that further explain or enhance sections 2 and 3 are attached
to the document. These include a description of the checksum function,
detailed description of multicast heuristics, state tables for
connection management, a sample application interface, and the summary
of packet structures.",
URL="ftp://mythos.ucs.indiana.edu/pub/cell-relay/current/xtp3.6.ps.Z",
}

@BOOK{Rowd92:SPEECH,
TITLE="Speech processing",
EDITOR="Chris Rowden",
ISBN="0-07-707324-X",
PUBLISHER="McGraw-Hill Book Company",
PAGES="405 pages",
YEAR=1992,
KEYWORDS="speech processing voice processing",
ABSTRACT="Chapter 1 Speech Production and Perception Gill Waters,
University of Essex Section 1.1 Introduction Section 1.2 The human vocal
apparatus Section 1.3 Speech sounds Section 1.4 Acoustics and speech
production Section 1.5 Phoneme production Section 1.6 Sound variations
and combinations Section 1.7 Prosody and speaker variation Section 1.8
Feedback mechanisms Section 1.9 Speech perception Section 1.10 The
physiology of the ear Section 1.11 The auditory nerve Section 1.12
Loudness perception Section 1.13 Pitch perception Section 1.14 Frequency
selectivity and masking Section 1.15 The currect view of hearing and
speech perception References and other reading Chapter 2 Analysis Chris
Rowden, University of Essex Section 2.1 Levels of speech analysis
Section 2.2 Speech waveforms Section 2.3 Analysis at the signal
level--stream processing Section 2.4 Analysis at the segment level--
block processing Section 2.5 Separation of vocal tract resonances from
speech excitation Section 2.6 Analysing speech at the utterance level
References Chapter 3 Waveform coding for digital telephony Edwin Jones,
University of Essex Section 3.1 Current practice Section 3.2 Design
objectives Section 3.3 Waveform sampling Section 3.4 Waveform quantizing
Section 3.5 Differential coding Section 3.6 Comparisons and trends
References Chapter 4 Waveform coding--digital audio Malcolm Hawksford,
University of Essex Section 4.1 Introduction Section 4.2 The case for
oversampling and noise shaping Section 4.3 Decimation and interpolation
filter techniques Section 4.4 Noise shaping Section 4.5 Application of
mild oversampling in ADC and DAC Section 4.6 Applocations of high
oversampling in ADC and DAC Section 4.7 Conclusion References and
further reading Acknowledgements Chapter 5 Parametric coding of speech
Chris Rowden, University of Essex Stephen Hall, Dindima Group, Australia
Section 5.1 Parametric coding Section 5.2 An overview of linear
predictive coding Section 5.3 Linear predictive analysis Section 5.4
Synthesis method for LPC speech Section 5.5 Coding the predictor
parameters Section 5.6 Coding the residual sequence Section 5.7
Interaction between coding of filter parameters and coding of the
residual Section 5.8 Sub-band coding--a hybrid between parametric and
waveform coding References Chapter 6 Synthesis Chris Rowden, University
of Essex Section 6.1 Introduction Section 6.2 An overview of
text-to-speech synthesis Section 6.3 Textual input-to-speech systems
Section 6.4 Converting words to phonemes (phonetic transcription)
Section 6.5 Concatenation of stored speech units Section 6.6 Prosody
Section 6.7 Electronic analogues of the vocal tract Section 6.8 Summary
References Chapter 7 Recognition--the stochastic modelling approach
Roger Moore, Royal Signals and Radar Establishment Section 7.1
Introduction Section 7.2 Early approaches to automatic speech
recognition Section 7.3 Towards a methodology Section 7.4 Speech pattern
modelling Section 7.5 Future directions References and further reading
Chapter 8 Pattern recognition and its application to speech Graham
Leedham Section 8.1 Introduction Section 8.2 Pattern recognition
techniques Section 8.3 Approaches to speech recognition Section 8.4
Isolated word recognition Section 8.5 Keyword spotting in connected
speech Section 8.6 Connected word recognition Section 8.7 Speaker
identification and verification Section 8.8 Summary References and
further reading",
}

@BOOK{Daig92:Queueing,
AUTHOR="J. N. Daigle and Virginia Polytechnic Institute and State
University",
TITLE="Queueing Theory for Telecommunications",
ISBN="0-201-06755-2",
PUBLISHER="Addison-Welsey Publishing Company",
PAGES="310 pages",
YEAR=1992,
KEYWORDS="queueing theory; queue; M/G/1 queue; G/M/1",
ABSTRACT="(Taken from the book's cover leaf) ``Queueing Theory for
Telecommunications'' is a modern and efficient introduction to the
fundamental concepts and principals underlying the study of the queueing
behavior of telecommunications systems. The thrust is to provide the
reader with sufficient background to be able to appreciate the major
papers currently appearing in the applications literature and to extend
the results. The analysis of computer communication is the driving force
behind this text. In the first two chapters, a foundation is provided by
introducing the topics of queueing theory and computer communication
networks. The exponential distribution and the Poisson process are
introduced. Chapter 3 discusses the analysis of systems modeled by birth
and death models and quasi-birth and death models. The distributions of
the phase type are also introduced. These distributions find broad
application in the computer communication area, especially in defining
interarrival times for integrated communications systems. The M/G/1
queueing system and some of its variants, including vacation models, are
examined in chapter 4. The analysis, although primarily based on
transforms, is oriented toward development of an intuitive understanding
of the underlying process. The composition principals are used
extensively to simplify development. Chapter 5 discusses the M/G/1 and
G/M/1 paradigms and provides several examples that illustrate how the
M/G/1 paradigm can be used to obtain fumdamental insight about the
behavior of slotted-time queueing systems that represent statistical
multiplexing systems. The final chapter summarizes the material in the
previous chapters and comments of areas for further study. Mastering the
material in this text will furnish the reader with the appropriate tools
to model many interesting, nonstandard, engineering problems associated
with network design and obtain useful results. Thus, the book should be
a valuable addition to the library of the practicing engineer as well as
to the student.",
}

@INCOLLECTION{Hofm92:Generating,
AUTHOR="Bernd Hofmann and W. Effelsberg",
TITLE="Generating Parallel Code from Estelle Specifications",
BOOKTITLE="Formale Beschreibungstechniken für verteilte Systeme",
EDITOR="D. Hogrefe",
SERIES="Informatik Aktuell",
PUBLISHER="Springer Verlag, Heidelberg",
PAGES="22-34",
YEAR=1992,
}

@TECHREPORT{Kori92:Flow,
AUTHOR="Yannis Korilis and Aurel A. Lazar",
TITLE="Why is Flow Control Hard: Optimality, Fairness, Partial and
Delayed Information",
INSTITUTION="Center for Telecommunications Research, Columbia
University",
ADDRESS="New York, NY",
YEAR=1992,
ANNOTE="An extensive survey in the flow control literature. The focus is
on optimal flow control, under a game theoretic framework. A number of
important efforts to define and study fairness in the flow control
context are discussed. The final part of the survey is devoted to
studies on the effect of delayed information on flow control mechanisms,
in wide-area, very-high-speed networks.",
URL="ftp://ftp.ctr.columbia.edu/CTR-Research/comet/public/papers/92/KOR92.ps.gz",
}

@ARTICLE{Bovo92:Effect,
AUTHOR="Andreas Bovopoulos and Aurel A. Lazar",
TITLE="The Effect of Delayed Feedback Information on Network
Performance",
JOURNAL="Annals of Operations Research",
VOLUME=36,
PAGES="101-124",
YEAR=1992,
}

@ARTICLE{Nevi92:Current,
AUTHOR="George V. Neville-Neil",
TITLE="Current efforts in client/server audio",
JOURNAL="X Resource",
VOLUME=8,
PAGES="69-86",
YEAR=1992,
REFERENCES=17,
KEYWORDS="packet audio; AudioFile; X; distributed systems; continuous
media; XMedia; NCDAudio",
ABSTRACT="With the success of the X Window system, and its use of
client/server communication, researchers and developers are now building
systems for continuous media based on the client/server model. Recently,
audio has been the target for many of these efforts. Several
client/server-based systems are now available that attempt to provide a
model for audio similar to that currently available for graphical user
interface systems. This paper presents an overview of the current
efforts in client/server audio and discusses where these systems are in
the evolutionary process with respect to the history of the X Window
System.",
}

@ARTICLE{Moff9202:Economical,
AUTHOR="Alistair Moffat",
TITLE="Economical Inversion of Large Text Files",
JOURNAL="Computing Systems",
VOLUME=5,
NUMBER=2,
PAGES="125-139",
MONTH="Spring",
YEAR=1992,
REFERENCES=9,
KEYWORDS="indexing; inversion",
ABSTRACT="To provide keyword-based access to a large text file it is
usually necessary to invert the file and create an inverted index that
stores, for each word in the file, the paragraph or sentence numbers in
which that word occurs. Inverting a large file using traditional
techniques may take as much temporary disk space as is occupied by the
file itself, and consume a great deal of cpu time. Here we describe an
alternative technique for inverting large text files that requires only
a nominal amount of temporary disk storage, instead building the
inverted index in compressed form in main memory. A program implementing
this approach has created a paragraph level index of a 132 Mbyte
collection of legal documents using 13 Mbyte of main memory; 500 kByte
of temporary disk storage; and approximately 45 cpu-minutes on a Sun
SPARCstation 2.",
}

@ARTICLE{McKe9202:Efficient,
AUTHOR="Paul McKenney and Ken F. Dove",
TITLE="Efficient demultiplexing of incoming {TCP} packets",
JOURNAL="Computing Systems",
VOLUME=5,
NUMBER=2,
PAGES="141-157",
MONTH="Spring",
YEAR=1992,
REFERENCES=11,
KEYWORDS="OLTP; BSD; TCP; protocol implementation; caching; packet
train",
ABSTRACT="Many recent protocol optimizations put forth for the TCP/IP
protocol suite assume that a large component of the traffic is bulk data
transfers, which result in packet trains. These packet trains favor
simple caching algorithms such as those found in the BSD implementation
of TCP. Although BSD's algorithms have been very successful in many
situations, applications that do not form packet trains can cause these
algorithms to perform very poorly. Examples of such applications are
quite common in the area of heads-down data entry into on-line
transaction processing (OLTP) systems. OLTP systems make heavy use of
computer communication networks; this use is typically characterized by
a large number of connections, low per-connection packet rate, large
aggregate packet rate, and small packets. This combination of
characteristics results in an extremely low incidence of packet trains.
This paper demonstrates that this causes BSD's caching algorithm to be
ineffective. It will analyze some alternative optimizations, one of
which performs more than an order of magnitude better than BSD's for
OLTP applications, with almost no performance penalty for other
applications.",
}

@ARTICLE{Atki9202:Experiences,
AUTHOR="M. S. Atkins and Yunfei Chen and Florina Olariu",
TITLE="Experiences: overcoming data transfer bottlenecks across
{SUN-transputer} interfaces",
JOURNAL="Computing Systems",
VOLUME=5,
NUMBER=2,
PAGES="159-192",
MONTH="Spring",
YEAR=1992,
REFERENCES=13,
KEYWORDS="transputer; interface; Sun; workstation architecture",
ABSTRACT="In many computationally intensive tasks such as medical image
reconstruction for which transputers can be used, the data communication
rate between a display host such as a SUN-workstation and the transputer
network becomes a constraint on system performance. Our goal is to
maximize the SUN-transputer data exchange rate. We use several kinds of
transputers connected to the VME-bus of the host SUN and this paper
explores alternatives for designing their interfaces. We also use a
VME-bus memory module memory-mapped to both the SUN and the transputers.
Device drivers for the transputers connected by serial links must
implement the required blocking semantics of the transputer links. There
are two major designs for programmed i/o serial link interfaces --
``polled'' interfaces, and ``interrupting'' interfaces which work with a
process scheduler to block the invoking process until the desired
condition is true. We measured both kinds, expecting that the transputer
hard link throughput would limit the performance. However, we found that
the SUN's cpu cycles limit the performance of an unbuffered byte
interface: a SUN4/110 is only capable of transferring 457,000
bytes/second. By reducing the software overhead in the SUN using a
buffered FIFO block transfer we can increase throughput to 888,000
bytes/second. Now the bottleneck is the byte-wide VME-bus access mode
used for the serial links. Throughput between the SUN and the
transputers, using shared 32-bit wide VME-memory, is four times the
throughput of the serial links. Hence, for optimum throughput, we use
the transputer links for synchronization of data which is exchanged in
bulk using the shared memory. Further performance increases are only
possible using different hardware interfaces which support the VME-bus
block transfer mode.",
}

@ARTICLE{Renn92:MuX,
AUTHOR="Earl Rennison and Richard L. Baker and DooHyun Kim and Y. Lim",
TITLE="MuX: an X co-existent time-based multimedia {I/O} server",
JOURNAL="The X Resource",
VOLUME=1,
PAGES="213-233",
MONTH="Winter",
YEAR=1992,
REFERENCES=11,
KEYWORDS="X; window server; multimedia server; synchronization",
ABSTRACT="A multimedia input/output (I/O) server, MuX, is being jointly
developed by SRI International and the Electronics and
Telecommunications Research Institute (ETRI), Korea. Currently, the MuX
server is a co-existent server to the X window system server that
provides support for integration and synchronization of time-based
media. The MuX server is based on the abstract concept of media
multiplexer or mixer. Key features of the MuX include a well-developed
media integration model; a scripting capability to specify time, space,
and relationships among the media relative to a logical time system
(LTS) for media integration; abstractions for multimedia operations; and
fine-grained media synchronization. This paper presents an overview of
the MuX and is primarily focused on describing the concepts and models
upon which the MuX is based. It does not address MuX implementation
issues. It also includes a brief discussion of the design goals and
functionality of the MuX server. The media integration model and the
synchronization mechanism employed by the MuX server are described. The
concept of network-transparent access to multimedia data is introduced.
A simple ASCII-based scripting language, MuXScript, is introduced and
described. The grammar of the script language and an example script are
provided. A brief description of the client-server interface is also
provided. This paper concludes with a discussion of related work, a
summary of the current status, and future research directions.",
}

@ARTICLE{Jone92:Multi,
AUTHOR="Oliver Jones",
TITLE="Multi-user applications software using Xt",
JOURNAL="X Resource",
VOLUME=3,
PAGES="55-75",
MONTH="Summer",
YEAR=1992,
REFERENCES=3,
KEYWORDS="X; windowing system; application sharing; Xt; Xlib",
ABSTRACT="Because X is inherently network-transparent, the X environment
is ideal for cooperative multi-user applications. One good way to
implement such applications is by using a single X client process to
handle input from multiple simultaneous users. This is done by
connecting the client to multiple X servers. This tutorial article
describes and gives an example of using Xt and Xlib to implement
multiple-display clients, and examines some of the considerations which
apply to making such client software perform rapidly and reliably.",
}

@BOOK{Stev92:Advanced,
AUTHOR="W. Richard Stevens",
TITLE="Advanced programming in the Unix Environment",
ISBN="0-201-56317-7",
PUBLISHER="Addison-Wesley",
ADDRESS="Reading, Massachusetts",
YEAR=1992,
KEYWORDS="Unix; operating system; programming; BSD; SVR4",
}

@ARTICLE{Rekh9202:Injecting,
AUTHOR="Y. Rekhter and B. Chinoy",
TITLE="Injecting Inter-Autonomous System Routes into Intra-Autonomous
System Routing: A Performance Analysis",
JOURNAL=internet,
VOLUME=3,
PAGES="189-202",
NOTE="also Computer Communication Review, January 1992",
YEAR=1992,
KEYWORDS="routing; policy routing",
URL="ftp://ftp.sdsc.edu/pub/sdsc/anr/papers/inject.ps.Z",
}

@ARTICLE{Brau9203:Hochgeschwindigkeits,
AUTHOR="T. Braun and O. Rose",
TITLE="Hochgeschwindigkeits-Transportprotokolle: Architekturen und
Mechanismen",
JOURNAL=pik,
VOLUME=15,
NUMBER=3,
PAGES="136-144",
YEAR=1992,
REFERENCES=27,
KEYWORDS="protocols; high-speed networks; TCP; TP4; XTP",
ABSTRACT="Der Übergang zu glasfaserbasierten Kommunikationsnetzen leitet
eine neue Ära der Telekommunikationstechnologie ein. Im Licht der
veränderten Randbedingungen hinsichtlich des unterliegenden Mediums
(Datenraten im Bereich einiger Gigabit pro Sekunde - auch im
Weitverkehrsbereich - bei Bitfehlerraten der Größenordnung 10e-13) und
der in solchen Hochgeschwindigkeitsnetzen realisierbar gewordenen neuen
Anwendungen stellt sich jedoch immer drängender die Frage, inwiefern
traditionelle Protokolle (wie TCP und OSI-TP4) diesen Veränderungen
gewachsen sind. Der vorliegende Artikel versucht, dem Leser einen
Eindruck über die Konsequenzen der rasch stattfindenden Verbreitung
dieser modernen Technologie zu vermitteln. Innerhalb des ersten Teils
werden zunächst die modifizierten Randbedingungen, wie sie in
Hochgeschwindigkeitsnetzen vorgefunden werden, dargelegt. Weiterhin
werden einige der sich bereits abzeichenden neuen Anwendungen
vorgestellt, welche sich die zur Verfügung stehende extrem große
Bandbreite zunutze machen. Anschließend erfolgt eine Diskussion der
Schwierigkeiten, die für traditionelle Protokolle in einer solchen
Umgebung auftreten. Der zeite Teil führt den Leser in eine Reihe von
Protokollen ein, die speziell im Hinblick auf die modifizierten
Anforderungen neuer Anwendungen und Hochgeschwindigkeitsnetze entwickelt
worden sind. Anhand dieser Beispiele wird aufgezeigt, mit welchen
Methoden die im ersten Abschnitt angesprochenen Probleme gelöst werden
sollen. Den Abschluß bildet ein kurzer Ausblick auf die derzeit
innerhalb der Normungsgremien hinsichtlich
Hochgeschwindigkeitsprotokollen beginnenden Aktivitäten.",
}

@ARTICLE{Geih9204:OMG,
AUTHOR="Kurt Geihs",
TITLE="{OMG} Object Request Broker",
JOURNAL=pik,
VOLUME=15,
NUMBER=4,
PAGES="244-245",
YEAR=1992,
REFERENCES=1,
KEYWORDS="OMG; ORB; Object Managment Group; Object Request Broker",
}

@ARTICLE{Phil9204:HiPPI,
AUTHOR="R. H. Philipp",
TITLE="{HiPPI} und {FCS}",
JOURNAL=pik,
VOLUME=15,
NUMBER=4,
PAGES="246-249",
YEAR=1992,
REFERENCES=12,
KEYWORDS="HiPPI; FCS; High Performance Computing; High-speed Networks;
Fiber Channel",
ABSTRACT="HiPPI, High Performance Parallel Interface, wurde Mitte der
80er Jahre definiert, um den Bedürfnissen nach schnellen
Ein-/Ausgabekanälen in einer High Performance Computing (HPC) -Umgebung
Rechnung zu tragen. Erste Anwendungen im Bereich Multimedia
(realzeitvideo, Visualisierungen) benötigten Durchsatzleistungen, die
von den damals verfügbaren Kanalverbindungen (typischerweise mit
Durchsätzen in der Größenordnung von 4 MByte/s) nicht erbracht werden
konnten. Um teure Peripherie (Festspeicherplatten,
Visualisierungsgeräte, Dateiserver, etc.) für mehrere
Hochleistungsrechner gleichzeitig verwenden zu können, wurden außerdem
Forderungen nach herstellerunabhängigen Hochgeschwindigkeitsnetzen in
einer HPC-Umgebung laut. Dies führte zu der Definition von HiPPI, das
derzeit als ANSI- und teilweise auch als ISO Standard vorliegt; erst
heute sind jedoch die ersten HiPPI-Produkte implementiert und werden die
ersten Erfahrungen mit HiPPI-Installationen gemacht. Dabei stellt sich
jetzt zwangsläufig die Frage, ob man HiPPI noch implementieren sollte,
das ja (entsprechend dem technologischen Stand von 1978) noch auf
herkömmlicher Kupferübertragungstechnik beruht. Denn es zeichnet sich
bereits ein neuer Standard ab, der Hochgeschwindigkeitsvernetzung auf
optischer Übertragungstechnologie ermöglichen wird, der Fiber Channel
Standrd, FCS. In diesem Beitrag wird ein Überblick über HiPPI und FCS
gegeben; wir werden weiterhin aufzeigen, daß FCS kein ``Showstopper''
für HiPPI ist, sondern eine Migration von Kupfer- auf optische
Übertragungstechnologie ermöglichen wird. Damit werden die Investitionen
in verteilte HPC-Anwendungen für die Zukunft gesichert.",
}

@INPROCEEDINGS{Broc92:Search,
AUTHOR="Frank M. Brochin and H. Saito and Hiroshi Yamada",
TITLE="In search of the economical and technical optimum: a dimensioning
study of the {ATM} networks",
BOOKTITLE="Networks",
ORGANIZATION="IEEE",
ADDRESS="Kobe, Japan",
YEAR=1992,
KEYWORDS="Traffic control; ATM; BISDN; queueing theory; network design",
}

@ARTICLE{Bogi9204:Switching,
AUTHOR="K. Bogineni and Krishna M. Sivalingam and Patrick W. Dowdls",
TITLE="Switching Latency impact on star-coupled {WDM} photonic network
pre-allocation protocol performance",
JOURNAL=jhsn,
VOLUME=1,
NUMBER=4,
PAGES="289-314",
YEAR=1992,
KEYWORDS="switching latency; Media Access Control Protocol; performance
analysis; time and wavelength division multiplexing; photonic network
architecture",
ABSTRACT="This paper evaluates the performance of two pre-allocation
protocols when the switching latency of the wavelength tunable optical
devices required for WDM networks is not negligible. The channels are
pre-allocated to the nodes with the approach, where each node has a home
channel that it uses either for all data packet transmissions or all
data packet receptions. This approach reduces the resulting system
complexity since both tunable transmitters and receivers are not
required, and also has the advantage of being applicable to systems
where there are many more nodes than wavelength channels. Switching
latency is the time required by the tunable optical devices to tune to
the required destination wavelength. The performance impact of switching
latency on a generalized random access protocol is compared to an
approach based on interleaved time multiplexing. Both protocols are
designed to operate in a multiple-channel multiple-access environment
and require each node to possess a tunable transmitter and a fixed \( or
slow tunable \) receiver. Semi-markov analytic models are developed to
investigate the performance of the two protocols. The analytic models
are validated through extensive simulation. The performance is evaluated
in terms of network throughput and packet delay with variations in the
number of nodes, data channels, packet generation rate, and switching
latency.",
}

@ARTICLE{Jian9201:Routing,
AUTHOR="X. Jiang",
TITLE="Routing broadband multicast streams",
JOURNAL=comcom,
VOLUME=15,
NUMBER=1,
PAGES="45-51",
MONTH="January/February",
YEAR=1992,
}

@PROCEEDINGS{92:5th,
TITLE="5th {IFIP} {WG6.1} Intern. Workshop on Protocol Test Systems,
Montreal, Quebec, Canada",
BOOKTITLE="5th IFIP WG6.1 International Workshop on Protocol Test
Systems, Montreal, Quebec, Canada",
EDITOR="G. v.Bochmann and R. Dssouli and A. Das",
SERIES="IFIP Transactions",
PUBLISHER="North-Holland",
YEAR=1992,
}

@MANUAL{ISO92:9646.3,
AUTHOR="I. S. O",
TITLE="{IS} 9646 Part 3: The Tree and Tabular Combined Notation
{(TTCN)}",
YEAR=1992,
}

@MANUAL{ISO92:9646.6,
AUTHOR="I. S. O",
TITLE="Draft {IS} 9646 Part 6: Protocol Profile Test Specification",
YEAR=1992,
}

@PROCEEDINGS{RJLi92:12th,
TITLE="12th Intern. Symposium on Protocol Specification, Testing and
Verification, Lake Buena Vista, Florida, {U.S.A.}",
BOOKTITLE="12th International Symposium on Protocol Specification,
Testing and Verification, Lake Buena Vista, Florida, U.S.A.",
EDITOR="and M. Ü. Uyar",
SERIES="IFIP Transactions",
PUBLISHER="North-Holland",
YEAR=1992,
}

@PHDTHESIS{Tret92:Formal,
AUTHOR="J. Tretmans",
TITLE="A Formal Approach to Conformance Testing",
SCHOOL="University of Twente, Enschede",
YEAR=1992,
}

@INPROCEEDINGS{Cava92:Automated,
AUTHOR="A. R. Cavalli and  others",
TITLE="Automated Protocol Conformance Test Generation Based on Formal
Methods for {LOTOS} Specifications",
BOOKTITLE="5th IFIP WG6.1 International Workshop on Protocol Test
Systems, Montreal, Quebec, Canada",
EDITOR="G. v.Bochmann and R. Dssouli and A. Das",
SERIES="IFIP Transactions",
PUBLISHER="North-Holland",
YEAR=1992,
}

@INPROCEEDINGS{Kste92:ISO,
AUTHOR="R. Köster and M. Dicks",
TITLE="{ISO} Conformance Testing of the {GSM} Mobile Network System",
BOOKTITLE="5th IFIP WG6.1 International Workshop on Protocol Test
Systems, Montreal, Quebec, Canada",
EDITOR="G. v.Bochmann and R. Dssouli and A. Das",
SERIES="IFIP Transactions",
PUBLISHER="North-Holland",
PAGES="263-273",
YEAR=1992,
}

@INPROCEEDINGS{Walt92:Operational,
AUTHOR="T. Walter and B. Plattner",
TITLE="An Operational Semantics for Concurrent {TTCN}",
BOOKTITLE="5th IFIP WG6.1 International Workshop on Protocol Test
Systems, Montreal, Quebec, Canada",
EDITOR="G. v.Bochmann and R. Dssouli and A. Das",
SERIES="IFIP Transactions",
PUBLISHER="North-Holland",
PAGES="131-146",
YEAR=1992,
}

@INPROCEEDINGS{Conc92:Approach,
AUTHOR="M. de Concetto and G. Marino and E. Merli and F. Zizza",
TITLE="An Approach to the Test of an {ATM-Based} Signalling
Application",
BOOKTITLE="5th IFIP WG6.1 International Workshop on Protocol Test
Systems, Montreal, Quebec, Canada",
EDITOR="Gregor V. Bochmann and R. Dssouli and A. Das",
SERIES="IFIP Transactions",
PUBLISHER="North-Holland",
PAGES="119-130",
YEAR=1992,
}

@INPROCEEDINGS{Mill92:Generating,
AUTHOR="Russ Miller and Sunil Paul",
TITLE="Generating Conformance Test Sequences for Combined Control and
Data Flow of Communication Protocols",
BOOKTITLE="12th International Symposium on Protocol Specification,
Testing and Verification, Lake Buena Vista, Florida, U.S.A.",
EDITOR="and M. Ü. Uyar",
SERIES="IFIP Transactions",
PUBLISHER="North-Holland",
PAGES="13-28",
YEAR=1992,
}

@INPROCEEDINGS{Yi92:Testing,
AUTHOR="W. Yi and K. Larsen",
TITLE="Testing Probabilistic and Nondeterministic Processes",
BOOKTITLE="12th International Symposium on Protocol Specification,
Testing and Verification, Lake Buena Vista, Florida, U.S.A.",
EDITOR="and M. Ü. Uyar",
SERIES="IFIP Transactions",
PUBLISHER="North-Holland",
PAGES="29-46",
YEAR=1992,
}

@TECHREPORT{Jain92:Comparison,
AUTHOR="Raj Jain",
TITLE="A Comparison of Hashing Schemes for Address Lookup in Computer
Networks",
INSTITUTION="DEC",
YEAR=1992,
ABSTRACT="This is a more detailed version of the paper with the same
title published in the IEEE Transactions on Communications, October
1992.",
URL="http://www.cis.ohio-state.edu/~jain/papers/hash\_ps.ps",
}

@ARTICLE{Jain92:Myths,
AUTHOR="Raj Jain",
TITLE="Myths about Congestion Management in High Speed Networks",
JOURNAL=internet,
VOLUME=3,
PAGES="101-113",
YEAR=1992,
ABSTRACT="Weaknesses in several recently proposed ideas about congestion
control and avoidance in high-speed netwroks are identified. Both sides
of the debate concerning prior reservation of resources versus walk-in
service, open-loop control versus feedback control, rate control versus
window control, and router-based control versus source-based control are
presented. The circumstances under which backpressure is useful or not
are discussed, and it is argued that a single congestion scheme is not
sufficient, but that a combination of several schemes is required for
complete congestion management in a network.",
URL="http://www.cis.ohio-state.edu/~jain/papers/cong\_myths.ps",
}

@TECHREPORT{Hopp92:Feasibility,
AUTHOR="Andrew Hopper and A. E. Jones and Roderick Augur and Martyn Fice
and Simon Blyth and Hassan M. Ahmed",
TITLE="A Feasibility Study for the Fabrication of Planar Silicon
Multichip Modules Using Electron Beam Lithography for Precise Location
and Interconnection of Chips",
TYPE="Technical Report",
INSTITUTION="Olivetti Research Laboratory (ORL)",
ADDRESS="Cambridge, England",
NUMBER="TR 92-4",
NOTE="IEEE Transactions of Components, Hybrids, and Manufacturing
Technology, Vol. 15, No. 1, February 1992",
YEAR=1992,
ABSTRACT="A technique for fabricating multichip modules (MCM's) by
mounting chips in holes etched into silicon motherboards is described.
With this approach the fron faces of the chips are coplanar with the
fron of the motherboard, and hence, the connections between the chips
and the motherboards may be made by standard thin film processes. A
method for fabricating such modules using electron beam lithography to
locate the chips and to define the interconnections between the chips
and the motherboard is discussed. The feasibility of the processes is
demonstrated with measurements on a module designed and fabricated to
test the stability of the processes.",
}

@TECHREPORT{Karl92:How,
AUTHOR="Roland Karlsson",
TITLE="How build your own {OR-parallel} Prolog System",
TYPE="Technical Report",
INSTITUTION="Swedish Institute of Computer Science (SICS)",
ADDRESS="Kista, Sweden",
NUMBER="R92-03",
YEAR=1992,
ABSTRACT="This paper shows how to extend an existing Prolog system to
automatically exploit OR-parallelism. The description starts with
parallelizing pure Prolog, a Prolog version without either cut or side
effects. The model is incrementally refined until finally reaching an
efficient OR-parallel system for full Prolog with extra non-Prolog
features. I have tried to keep the text as general as possible. When the
text becomes too {SICStus} (my target Prolog system) specific some hints
for the ordinary WAM is given. The chosen OR-parallel model is the Muse
model. It is relatively straightforward using this model to extend most
existing Prolog systems.",
URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--89-16--SE.ps.Z",
}

@TECHREPORT{Khay92:Engine,
AUTHOR="Mohammed Ali Khayri and Roland Karlsson",
TITLE="The Engine-Scheduler Interface used in the Muse {OR-parallel}
Prolog System",
TYPE="Technical Report",
INSTITUTION="Swedish Institute of Computer Science (SICS)",
ADDRESS="Kista, Sweden",
NUMBER="R92-04",
YEAR=1992,
ABSTRACT="Almost any sequential Prolog system is in principle easy to
extend for OR-parallelism, using the Muse execution model. To reduce
your programming effort we have implemented the Muse scheduler, with a
clean interface to the Prolog sequential engine. This interface is
implemented as a set of C macros. The sequential Prolog system to be
parallelized uses some of those macros provided by the Muse scheduler
and must also provide some macros for the Muse scheduler. This chapter
paper contains a definition and description of the required macros,
emphasizing information needed by the Prolog engine programmer.",
URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--92-04--SE.ps.Z",
}

@TECHREPORT{Aron92:Methodology,
AUTHOR="Martin Aronsson",
TITLE="Methodology and Programming Techniques in {GCLA} {II}",
TYPE="Technical Report",
INSTITUTION="Swedish Institute of Computer Science (SICS)",
ADDRESS="Kista, Sweden",
NUMBER="R92-05",
YEAR=1992,
ABSTRACT="We will demonstrate various implementation techniques in the
language GCLA. First an introduction to GCLA is given, followed by some
examples of program developments, to demonstrate the development
methodology. Other examples are also given to show various
implementation techniques and properties of the system.",
URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--92-05--SE.ps.Z",
}

@TECHREPORT{Khay92:Muse,
AUTHOR="Mohammed Ali Khayri and Roland Karlsson and Shyam Mudambi",
TITLE="Performance of Muse on Switch-Based Multiprocesor Machines",
TYPE="Technical Report",
INSTITUTION="Swedish Institute of Computer Science (SICS)",
ADDRESS="Kista, Sweden",
NUMBER="R92-07",
YEAR=1992,
ABSTRACT="The Muse (multiple sequential Prolog engines) approach has
been used to make a simple and efficient OR-parallel implementation of
the full Prolog language. The performance results of the Muse system on
bus-based multiprocessor machines have been presented in previous
chapters, papers. This chapter paper discusses the implementation and
performance results of the Muse system on switch-based multiprocessors
(the BBN Butterfly GP1000 and TC2000). The results of Muse execution
show that high real speedups can be achieved for Prolog programs that
exhibit coarse-grained parallelism. The scheduling overhead is
equivalent to around 8 -- 26 Prolog procedure calls per task on the
TC2000. The chapter paper also compares the Muse results with
corresponding results for the Aurora OR-parallel Prolog system. For a
large set of benchmarks, the results are in favor of the Muse system.",
URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--92-07--SE.ps.Z",
}

@TECHREPORT{Erik92:Finitary,
AUTHOR="Lars-Henrik Eriksson",
TITLE="A finitary version of the calculus of partial inductive
definitions",
TYPE="Technical Report",
INSTITUTION="Swedish Institute of Computer Science (SICS)",
ADDRESS="Kista, Sweden",
NUMBER="R92-08",
YEAR=1992,
ABSTRACT="The theory of partial inductive definitions is a mathematical
formalism which has proved to be useful in a number of different
applications. The fundamentals of the theory is shortly described.
Partial inductive definitions and their associated calculi are
essentially infinitary. To implement them on a computer, they must be
given a formal finitary representation. We present such a finitary
representation, and prove its soundness. The finitary representation is
given in a form with and without variables. Without variables,
derivations are unchanging entities. With variables, derivations can
contain logical variables that can become bound by a binding environment
that is extended as the derivation is constructed. The variant with
variables is essentially a generalization of the pure GCLA programming
language.",
URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--92-08--SE.ps.Z",
}

@TECHREPORT{Sjol92:Using,
AUTHOR="Thomas Sjöland",
TITLE="Using {SICStus} Objects in the design of Graphical User
Interfaces",
TYPE="Technical Report",
INSTITUTION="Swedish Institute of Computer Science (SICS)",
ADDRESS="Kista, Sweden",
NUMBER="R92-10",
YEAR=1992,
ABSTRACT="The functionalities of {SICStus} Objects, a system allowing
object oriented programming in {SICStus} Prolog are shown and an example
is presented: support software for building graphical user interfaces.
This text assumes a basic knowledge about Prolog programming in
{SICStus} Prolog and some intuition about object oriented programming.
{SICStus} Objects was implemented as an embedded language in {SICStus}
Prolog by Seif Haridi and Kent Boortz. {SICStus} Prolog is developed and
maintained by Mats Carlsson, Stefan Andersson and Kent Boortz at SICS
with support from Ellemtel Utvecklings AB.",
URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--92-10--SE.ps.Z",
}

@TECHREPORT{Gamb92:Lexical,
AUTHOR="Björn Gambäck",
TITLE="Lexical acquisition: the Swedish {VEX} System",
TYPE="Technical Report",
INSTITUTION="Swedish Institute of Computer Science (SICS)",
ADDRESS="Kista, Sweden",
NUMBER="R92-12",
YEAR=1992,
ABSTRACT="The paper describes S-VEX, the lexical acquisition component
of the Swedish Core Language Engine (S-CLE). A shorter version of this
paper appears in L.Ahrenberg (ed.): Papers from the Third Nordic
Conference on Text Comprehension in Man and Machine , Link Sweden, 1992.
The S-CLE is a general purpose natural language processing system for
Swedish developed from its English counter-part, the SRI Core Language
Engine. In parallel with the development of the S-CLE, a Swedish version
of the English VEX (Vocabulary EXpander) system was designed. S-VEX
allows for the creation of lexicon entries by users with knowledge of an
application domain but not of linguistics or of the detailed workings of
the system. The approach taken is based on eliciting grammaticality
judgments and information of inflected forms interactively from the
user. The S-VEX system and the lexicon of the S-CLE is described, as
well as the problems of the specific lexical acquisition task and their
solutions.",
URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--92-12--SE.ps.Z",
}

@TECHREPORT{Gamb92:Swedish,
AUTHOR="Björn Gambäck and Manny Rayner",
TITLE="The Swedish Core Language Engine",
TYPE="Technical Report",
INSTITUTION="Swedish Institute of Computer Science (SICS)",
ADDRESS="Kista, Sweden",
NUMBER="R92-13",
YEAR=1992,
ABSTRACT="The paper describes a Swedish-language customization (S-CLE)
of the SRI Core Language Engine, A shorter version of this paper appears
in L.Ahrenberg (ed.): Papers from the Third Nordic Conference on Text
Comprehension in Man and Machine , Link Sweden, 1992. which has been
developed at SICS from the original English-language version by
replacing English-specific modules with corresponding Swedish-language
versions. The S-CLE is intended to be used as a building block in a
broad range of applications, such as data-base query system, machine
translation systems, NL front-ends, speech-to-text/text-to-speech
systems, and so on. Examples of the first two types of application
already exist. The main part of the S-CLE is an extensive Swedish
grammar that is compiled into parsing and generation modules. The
grammar formalism is a type of unification grammar loosely based on
Generalized Phrase Structure Grammar (GPSG). Generation is performed
using the Semantic-Head-Driven algorithm. Analysis turns sentences into
``Quasi-Logical Form'' (QLF), a logical-form representation, while
generation works in the opposite direction. Intermediate stages include
processing of morphology, syntax and semantics. For knowledge-base
applications, a separate module can convert QLFs into conventional
scoped logical forms. After two-and-a-half years of work (approximately
45 person months), the first prototype system has a vocabulary of about
1900 words and covers a fairly broad range of possible grammatical
constructions. Based on our experience in this project, we present in
this paper detailed arguments to support the claim that customization of
an English-language NLP system is a highly cost-effective way of
constructing Swedish language systems with corresponding
functionality.",
URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--92-13--SE.ps.Z",
}

@TECHREPORT{Gamb92:Question,
AUTHOR="Björn Gambäck and Stefan Ljung",
TITLE="Question Answering in the Swedish Core Language Engine",
TYPE="Technical Report",
INSTITUTION="Swedish Institute of Computer Science (SICS)",
ADDRESS="Kista, Sweden",
NUMBER="R92-14",
YEAR=1992,
ABSTRACT="The paper describes how the Swedish Core Language Engine
(S-CLE), a general-purpose natural-language processing system was
extended to process questions posed to a Prolog database. Previous work
on the S-CLE has included processing up to the level of quasi-logical
form (QLF); here we address the problems encountered when extending that
processing to ``pure'' logical form (LF) and translating the logical
forms into questions to the SNACK-85 reginal database. We also show how
some natural-language answers were generated from the original
question-QLFs and the answers obtained from the database.",
URL="ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--92-14--SE.ps.Z",
}

@BOOK{Sysk92:First,
AUTHOR="R. Syski",
TITLE="First Passage Times in Markov Chains",
PUBLISHER="IOS Press",
ADDRESS="Amsterdam, Netherlands",
YEAR=1992,
}

@INPROCEEDINGS{Moya92:Women,
AUTHOR="Ann Moyal",
TITLE="Women Calling! The Gendered Use Of The Telephone",
BOOKTITLE="TeleGeography",
YEAR=1992,
REFERENCES=16,
KEYWORDS="telephone; social impact; women's issues",
URL="http://www.telegeography.com/Publications/moyal.html",
}

@BOOK{Fisc92:America,
AUTHOR="Claude S. Fischer",
TITLE="America Calling: A Social History of the Telephone to 1940",
PUBLISHER="University of California Press",
ADDRESS="Berkeley, California",
YEAR=1992,
KEYWORDS="social impact; telephone; history",
}

@TECHREPORT{Ladk92:Interpreting,
AUTHOR="P. B. Ladkin and S. Leue",
TITLE="Interpreting Message Sequence Charts",
TYPE="Internal report",
INSTITUTION="IBM Almaden Research Center",
ADDRESS="San Jose, CA",
NUMBER="IBM RJ 8965",
YEAR=1992,
KEYWORDS="Msc",
}

@MANUAL{Site92:Alpha,
AUTHOR="R. L. Sites",
TITLE="Alpha Architecture Reference Manual",
ORGANIZATION="Digital Press",
ADDRESS="Burlington, Massachusetts",
NOTE="Order number EY-L520E-DP",
YEAR=1992,
}

@INPROCEEDINGS{Oech92:ALI,
AUTHOR="Ph. Oechslin and V. Kumar and J. O'Neill and E. Ouellette and C.
Petitpierre",
TITLE="{ALI:} A Versatile Interface Chip for {ATM} Systems",
BOOKTITLE=globecom,
PUBLISHER="{IEEE} Communication Society Press",
PAGES="1282-1287",
YEAR=1992,
}

@INPROCEEDINGS{Hein92:XTP,
AUTHOR="Bernd Heinrichs",
TITLE="{XTP} specification and parallel implementation",
BOOKTITLE="International Workshop on Advanced Communications and
Applications for High Speed Networks",
PUBLISHER="Siemens AG, Munich",
PAGES="77-84",
YEAR=1992,
KEYWORDS="Xtp",
}

@INCOLLECTION{Guar92:Evolution,
AUTHOR="R. Guarneri and F. Zizza",
TITLE="Evolution of modelling techniques for communication protocols in
{B-ISDN}",
BOOKTITLE="IFIP TC6 Workshop on Broadband Communications",
PUBLISHER="Elsevier Science Publishers (North-Holland)",
ADDRESS="Estoril, Portugal",
PAGES="385-397",
YEAR=1992,
KEYWORDS="B-ISDN; specification; modelling",
}

@INCOLLECTION{Dant92:New,
AUTHOR="A. Danthine",
TITLE="A New Transport Protocol for the Broadband Environment",
BOOKTITLE="Broadband Communications",
PUBLISHER="Elsevier Science Publishers (North-Holland)",
PAGES="337-361",
YEAR=1992,
}

@UNPUBLISHED{Cata92:Parallel,
AUTHOR="V. Catanian and S. Cavalieri and Antonio Puliafito and L. Vita",
TITLE="A Parallel Hardware Approach to Implement Network Protocols",
NOTE="to be published in ICC 93",
YEAR=1992,
KEYWORDS="parallel; implementation; hardware",
}

@TECHREPORT{Tsch92:ComScript,
AUTHOR="C. F. Tschudin and M. Muhrimanya and D. Solana and J. J. Harms",
TITLE="ComScript Concept and Language",
TYPE="Internal Report",
INSTITUTION="{CUI} University of Geneva",
YEAR=1992,
KEYWORDS="comscript; implementation; configuration",
}

@INPROCEEDINGS{Leun92:Multimedia,
AUTHOR="W. H. Leung and Thomas Baumgartner and Yeou H. Hwang",
TITLE="Multimedia conferencing capabilities in an experimental fast
packet network",
BOOKTITLE=iss,
YEAR=1992,
REFERENCES=12,
KEYWORDS="multimedia conferencing; conference configuration; room
metaphor",
ABSTRACT="We report on recent results implemented in an experimental
fast packet network to support multimedia conferencing. These results
allow a user to engage in several multimedia conferences at the same
time, each conference can have several conferees using an arbitrary
number of information channels of varying bandwidth. The end-user can
set up, tear down and change the conference configuration in real time.
Adding and dropping information channels from a conference, merging and
splitting conferences are special cases of what a user can do in
changing the conference configurations. Furthermore, the user can
specify that an information channel to be shared by a subset of the
conferees and restrict a conferee's access to an information channel.
These capabilities follow a generalized model of multimedia
conferencing. We address two further issues in this paper: (1) a user
interface which allows the user to conveniently invoke and manage these
capabilities and (2) network layer conference configuration
transformation methods to support these capabilities. These capabilities
work with our previous results such as the ability to share UNIX
programs (e.g., screen editor) and to record a multimedia conference in
progress.",
}

@ARTICLE{Grav9202:Simultaneity,
AUTHOR="A. Gravey and G. Herbuterne",
TITLE="Simultaneity in discrete-time single server queues with Bernoulli
inputs",
JOURNAL=pe,
ADDRESS="Netherlands",
VOLUME=14,
NUMBER=2,
PAGES="123-131",
YEAR=1992,
REFERENCES=4,
KEYWORDS="Queueing system; ATM; discrete time; GEO/G/1; GEO/D/1",
ABSTRACT="The present work focuses on the scheduling of arrivals and
departures in discrete-time queues with Bernoulli arrivals and general
independent service times.",
}

@INPROCEEDINGS{Reim92:Optimal,
AUTHOR="M. I. Reiman",
TITLE="Optimal trunk reservation for a critically loaded link",
BOOKTITLE="13th int. teletraffic cong.",
ISBN=0444888664,
ADDRESS="Copenhagen, Denmark",
VOLUME=14,
PAGES="247-252",
YEAR=1992,
REFERENCES=13,
KEYWORDS="Reservation; blocking; circuit switching; optimization; mixed
traffic",
ABSTRACT="We consider a model consisting of a single link with N
circuits which is offered two types of calls. Two problems are treated.
In the first, each accepted type i call generates a reward, optimizing
the long run average reward. In the second the objective is to minimize
the blocking of type 2 calls, subject to a grade of service constraint
on type 1.",
}

@ARTICLE{Copp92:Optimal,
AUTHOR="P. Coppo and M. D'Ambrosio and R. Melen",
TITLE="Optimal Cost/Performance Design of {ATM} Switches",
JOURNAL=infocom,
ADDRESS="Florence, Italy",
VOLUME=1,
PAGES="446-458",
YEAR=1992,
REFERENCES=38,
KEYWORDS="ATM; switching; multistage interconnection network;
nonblocking; blocking; routing algorithm; performance evaluation;
analysis; simulation; implementation; cost",
ABSTRACT="The paper proposes a mthodology for performing an evaluation
and optimization of the cost of an ATM switching architecture under
performance constraints given in terms of virtual connection blocking
probalility. An alalysis of blocking networks is developed, and combined
with known results of nonblocking networks, provides a theoretical model
whichs relates traffic characteristics , network topology and blocking
probability.",
}

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

@ARTICLE{Krne92:Approximate,
AUTHOR="Hans Kröner and M. Eberspächer and T. H. Theimer and P. J. Kühn
and U. Briem",
TITLE="Approximate Analysis of the End-to-End Delay in {ATM} Networks",
JOURNAL=infocom,
ADDRESS="Florence, Italy",
PAGES="978-986",
YEAR=1992,
REFERENCES=20,
KEYWORDS="ATM; end-to-end delay; performance evaluation; analysis;
approximation; decomposition; M/D/1/S; fluid flow model; tandem queue",
ABSTRACT="An essential network performance parameter for services
requiring real-time information transfer is the variable portionof the
end-to-end delay addressed in this paper. An analytical approach for an
isolated network node as well as for a whole reference connection is
presented for bursty input traffic. The approximation results are in
good agreement with simulation results and indicate that the jitter is
in the range of the ...",
}

@ARTICLE{Li92:Generating,
AUTHOR="Song Li",
TITLE="Generating Function Approach for Discrete Queueing Analysis with
decomposable Arrival and Service Markov Chains",
JOURNAL=infocom,
ADDRESS="Florence, Italy",
PAGES="2168-2177",
YEAR=1992,
REFERENCES=28,
KEYWORDS="G/D/1; queueing system; infinite queue; discrete time; bulk
service; bursty traffic; performance evaluation; analysis; Markov chain;
generating function",
ABSTRACT="This paper uses generating function approach with spectral de-
composition to analyze discrete queues with arrival and service
processes characterized by Markov chain. Both generating func- tion and
distribution function of the queue are constructed fromvanishing and
non-vanishing roots. The vanishing roots are used to obtain linear
solutions for the boundary probabilities; each non-vanishing root
constructs a geometric term in the queue dist",
}

@ARTICLE{Ren92:Bandwidth,
AUTHOR="Zhixing Ren and J. S. Meditch",
TITLE="Bandwidth Allocation for Broadband Multichannel Systems",
JOURNAL=infocom,
ADDRESS="Florence, Italy",
PAGES="1051-1060",
YEAR=1992,
REFERENCES=21,
KEYWORDS="ATM; switching system; multichannel; architecture; bandwidth
allocation; Batcher-Banyan; input buffer; performance evaluation;
analysis",
ABSTRACT="In this paper, we examine an optimal bandwidth allocation
schemefor multichannel systems to switch trunk groups. This new
multi-channel switching system features a simple architecture, high
throughput, high channel utilization and other properites such as
preserving packet sequence, being robust to unbalanced input traffic
loads, providing fair access to network transmission resources, and fast
packet processing via a pipeline structure.",
}

@ARTICLE{Wei92:Multiple,
AUTHOR="Sherry X. Wei and V. Kumar",
TITLE="On the Multiple Shared Memory Module Approach to {ATM}
Switching",
JOURNAL=infocom,
ADDRESS="Florence, Italy",
VOLUME=1,
PAGES="116-123",
YEAR=1992,
REFERENCES=13,
KEYWORDS="ATM; switching; architecture; central buffer; control",
}

@ARTICLE{Chen9206:Markov,
AUTHOR="Jinghu Chen and R. Guérin and T. E. Stern",
TITLE="Markov-modulated flow model for the output queues of a packet
switch",
JOURNAL="IEEE trans. on commun.",
VOLUME="COM-40",
NUMBER=6,
PAGES="1098-1110",
YEAR=1992,
REFERENCES=21,
KEYWORDS="Packet switching; switching; output buffer; performance
evaluation; analysis; bursty traffic; fluid flow model; Markov chain",
ABSTRACT="In this paper, we study the output queues of an MxN packet
switch using a Markov-modulated flow model. The switching ele- ment is a
central server which sequentially routes packets from the inputs to the
outputs. We focus on systems where the server speed is such that the
bulk of the queueing takes place in the output queues. For such systems,
accurate sizing of the output buffers is an important design issue and
requires a correct ...",
}

@ARTICLE{Ren9201:Two,
AUTHOR="Zhixing Ren and J. S. Meditch",
TITLE="A two-layer congestion control protocol for broadband {ISDN}",
JOURNAL=pe,
ADDRESS="Netherlands",
VOLUME=16,
NUMBER="1-3",
PAGES="85-106",
YEAR=1992,
REFERENCES=33,
KEYWORDS="ATM; congestion control; traffic source model; matrix
geometric method; simulation",
ABSTRACT="In this paper we present a new, effective connection-oriented
congestion control protocol for B-ISDN.",
}

@INPROCEEDINGS{Anas92:CRMA,
AUTHOR="G. Anastasi and M. Conti and Enrico Gregori and Luniano
Lenzini",
TITLE="{CRMA} Media Access Control Protocol: A Simulative Analysis",
BOOKTITLE="5. IEEE Workshop on Metropolitan Area Networks",
ADDRESS="Taormina, Italy",
PAGES=20,
YEAR=1992,
REFERENCES=9,
KEYWORDS="LAN; MAN; protocol; HSLAN; CRMA",
ABSTRACT="This paper reports on an extended simulation analysis of the
CRMA MAC protocol. The analysis is divided into two parts. In the first
part we study CRMA in underload conditions, i.e., when the offerd load
is lower than the medium capacity. In the second part we study CRMA in
overload conditions, i.e., when the offered load is higher than the
medium capacity.",
}

@ARTICLE{Ausi9202:Computation,
AUTHOR="G. Ausiello and G. F. Italiano and A. M. Spaccamela and U.
Nanni",
TITLE="On-line computation of minimal and maximal length path",
JOURNAL="Theor.Comput.Sci., Elsevier Science Publisher",
ADDRESS="Netherlands",
VOLUME=95,
NUMBER=2,
PAGES="245-261",
YEAR=1992,
REFERENCES=21,
KEYWORDS="Graph theory; routing algorithm; shortest path; reconfigurable
network",
ABSTRACT="The considered problem is to maintain minimum length paths in
a directed graph G=(V,E) with n nodes while inserting new arcs. A data
structure for the add and minpath operation is given, that supports a
O(k) worst case time, where k<n is the length of the returned path. The
same algorithm can be used to find the maximum length path when the
digraph is acyclic and add operations preserve acyclicity.",
}

@ARTICLE{Erds9201:Distributed,
AUTHOR="P. Erdös and D. Hsu",
TITLE="Distributed loop network with minimum transmission delay",
JOURNAL="Theor.Comput.Sci., Elsevier Science Publisher",
ADDRESS="Netherlands",
VOLUME=100,
NUMBER=1,
PAGES="223-241",
YEAR=1992,
REFERENCES=25,
KEYWORDS="Graph theory; loop system; topology; ring; transmission
delay",
ABSTRACT="In a distributed loop network, each of the N nodes, i, is
connected to l other nodes, i+1, i+s2, i+s3,...,i+sl (mod N) by
unidirectional links. The nodes are thus cyclically symmectric and
contain at least one ring (like the daisy chain or the chordal rin g
network). For l=2 a method for constructing networks with minimum
diameter is given, for l>=3 a suboptimal recursive strategy is
described.",
}

@ARTICLE{Esti9204:Adaptive,
AUTHOR="V. Estivill-Castro and D. C. Wood",
TITLE="A Survey of Adaptive Sorting Algorithms",
JOURNAL="ACM Comp. Surveys",
VOLUME=24,
NUMBER=4,
PAGES="441-476",
YEAR=1992,
REFERENCES=76,
KEYWORDS="Algorithm; Sorting; Search Tree",
ABSTRACT="In this survey the basic notions and concepts of adaptive
sorting and the state of the art of adaptive sorting algorithm are
presented. It gives the description of the complexity of a sorting
algorithm not only in term of a size of a problem but also in terms of
the disorder of a given problem instance and the introduction od new
sorting algorithms that take advantage of the existing order in the
input sequence.",
}

@ARTICLE{Abat9204:Numerical,
AUTHOR="J. Abate and W. Whitt",
TITLE="Numerical Inversion of Probability Generating Functions",
JOURNAL=orl,
VOLUME=12,
NUMBER=4,
PAGES="245-251",
YEAR=1992,
KEYWORDS="numerical integration; probability; generating function; DFT",
ABSTRACT="Computational probability; Fourier-series method; Poisson
summation formula",
}

@ARTICLE{Abba9204:Local,
AUTHOR="M. Abbas and Z. A. Ahmad and D. G. Smith and A. R. Daud",
TITLE="Local Congestion Control Scheme Using Priority Jumping Technique
with Movable-Threshold",
JOURNAL=elet,
ADDRESS="Great Britain",
VOLUME=28,
NUMBER=4,
PAGES="425-427",
YEAR=1992,
KEYWORDS="digital communication; communication protocol",
ABSTRACT="This letter addresses the need for maintaining a better
performance for two types of service class (i.e. delay-sensitive and
loss-sensitive) namely voice and data in an integrated services packet
network. A proposed scheme called priority jump with a movable threshold
(PJ-MT) is used to control this traffic. Results are presented from a
computer simulation study of the scheme. Furthermore, a comparative
performance study",
}

@ARTICLE{Akiy9212:Teletraffic,
AUTHOR="M. Akiyama and Shohei Sato",
TITLE="Teletraffic Studies in Japan",
JOURNAL=ieice_communications,
ADDRESS="Japan",
VOLUME="75-B",
NUMBER=12,
PAGES="1237-1244",
YEAR=1992,
KEYWORDS="traffic theory; history; teletraffic studies in Japan",
ABSTRACT="This paper surveys the developments and achievements of
teletraffic studies in Japan.  It briefly covers the period preceeding
1970, then focuses on the period after 1970.  Rather than attempting to
cover the entire field of teletraffic engineering, it places its
emphasis on basic models.",
}

@ARTICLE{Alak92:Using,
AUTHOR="A. Alakrishnan and K. Altinkemer",
TITLE="Using a Hop-Constrained Model to Generate Alternative
Communication Network Design",
JOURNAL="ORAS Journal on computing",
VOLUME=4,
NUMBER=2,
PAGES="192-205",
YEAR=1992,
KEYWORDS="Network design; communication network",
}

@ARTICLE{Albe9202:Deflection,
AUTHOR="G. Albertengo and P. L. Civero and Renato {Lo Cigno} and 
others",
TITLE="Deflection Network: Principles, Implementation, Services",
JOURNAL="ETT - European Transactions on Telecommunications",
ADDRESS="Italy",
VOLUME=3,
NUMBER=2,
PAGES="195-206",
YEAR=1992,
KEYWORDS="Data network; switching network; deflection network",
ABSTRACT="This paper deals with slotted data networks routing packets
with a deflection technique.  In particular regular mesh topologies that
can be mapped on toroidal surfaces are analyzed.  First an introduction
to the concept of deflection routing is given, then many routing
algorithms are considered and compared by means of their performance in
terms of maximum attainable throughput and efficiency.",
}

@ARTICLE{Asmu92:Light,
AUTHOR="S. Asmussen",
TITLE="Light Traffic Equivalence in Single Server Queues",
JOURNAL="The Annals of Applied Probability",
VOLUME=2,
NUMBER=3,
PAGES="555-574",
YEAR=1992,
KEYWORDS="low traffic approximation; random walk; GI/G/1; phase-type
model; Cox distribution",
}

@ARTICLE{Bagu9205:Comparison,
AUTHOR="Yves Baguette and A. Danthine",
TITLE="Comparison of {TP4,} {TCP} and {XTP.} Part 1: Connection
Management Mechanisms",
JOURNAL="European Transactions on Telecommunications",
ADDRESS="Italy",
VOLUME=3,
NUMBER=5,
PAGES="523-533",
YEAR=1992,
KEYWORDS="Network management; tcp/ip; xtp; transport protocol",
}

@ARTICLE{Beau92:Application,
AUTHOR="N. Beaumont",
TITLE="An Application of Reliability Theory to a Telephone Network",
JOURNAL="Asia-Pacific Journal of Operational Research",
VOLUME=9,
PAGES="45-53",
YEAR=1992,
KEYWORDS="Reliability; network; telephony; application",
}

@ARTICLE{Bern92:Guaranteed,
AUTHOR="F. Bernabai and Laura Gratta and M. Listanti",
TITLE="Guaranteed Bandwidth Transport Service in Multihop Networks",
JOURNAL="ETT - European Transactions on Telecommunications",
VOLUME=3,
NUMBER=2,
PAGES="207-215",
YEAR=1992,
KEYWORDS="Multihop; resource allocation; protocol specification; LAN;
MAN; bandwidth allocation; bandwidth switching",
ABSTRACT="This paper deals with the feasibility of a Guaranteed
Bandwidth Transport Service (GBTS), usually employed for the handling of
isochronous and/or data services with real time requirements, on
Multihop Networks (MHNs). A Resource Allocation Protocol (RAP) for the
set-up of GB calls is proposed. This protocol allows the low cost
requirements of a LAN/MAN node to be satisfied, together with a high
flexibility in bandwidth allocation.",
}

@ARTICLE{Bisd92:IEEE,
AUTHOR="C. Bisdikan",
TITLE="A Performance Analysis of the {IEEE} 802.6 {(DQDB)} Subnetwork
with the Bandwidth Balancing Mechanism",
JOURNAL=cnis,
VOLUME=24,
PAGES="367-385",
YEAR=1992,
KEYWORDS="DQDB; IEEE 802.6; man; high speed",
}

@ARTICLE{Bitr92:Review,
AUTHOR="G. R. Bitran and S. Dasu",
TITLE="A Review of Open Queueing Network Models of Manufacturing
Systems",
JOURNAL=qs,
VOLUME=12,
PAGES="95-134",
YEAR=1992,
KEYWORDS="open queueing network; approximation; decomposition;
approximation; optimization; control; system design",
ABSTRACT="Job shops; Parametric decompositionapproach; Review.",
}

@ARTICLE{Blan92:Optimal,
AUTHOR="J. P. Blanc and P. de Waal and P. Nain and Donald F. Towsley",
TITLE="Optimal Control of Admission to a Multiserver Queue with Two
Arrival Streams",
JOURNAL=ieeeac,
VOLUME=37,
NUMBER=6,
PAGES="785-797",
YEAR=1992,
KEYWORDS="Optimal control; m/m/n; arrival process; poisson process;
traffic parameter; traffic source model; service time",
ABSTRACT="The problem of finding an optimal admission policy to an M/M/c
queue with one controlled and one uncontrolled arrival stream is
addressed in this paper. There are two streams of customers (customer of
class 1 and 2) that are generated according to independent Poisson
processes with constant arrival rates. The service time probability
distribution is exponential and does not depend on the class of the
customers. Upon arriv",
}

@ARTICLE{Blon92:Discrete,
AUTHOR="C. Blondia",
TITLE="A Discrete-Time Batch Markovian Arrival Process as {B-ISDN}
Traffic Model",
JOURNAL="Belgian Journal of Operations Research, Statistics and Computer
Science",
VOLUME=32,
NUMBER="3-4",
PAGES="3-23",
YEAR=1992,
KEYWORDS="Markov process; traffic model; finite state Markov chain;
finite capacity; finite queue; finite capacity queue",
ABSTRACT="In this paper, a class of versatile discrete-time Markovian
arrival processes (D-BMAP's) is introduced.  A model for the
superposition of video sources, both with uniform and multiple activity
levels, belongs to this class.  Formula for the correlation between
arrivals in the D-BMAP are derived.  Observing the D-BMAP/G(1/N queue at
departure epochs results in a finite Markov chain of M/G/1 type.",
}

@ARTICLE{Blum92:Control,
AUTHOR="J. Blume and L. Hansson and P. Haegg and L. Sundin",
TITLE="Control and Operation of {SDH} Network Elements",
JOURNAL="Ericsson Review, No. 3",
PAGES="62-77",
YEAR=1992,
KEYWORDS="Sdh",
}

@ARTICLE{Buza92:Queueing,
AUTHOR="J. A. Buzacott and J. G. Shantikumar",
TITLE="Queueing Models of Manufacturing Systems",
JOURNAL="Queueing Systems, Theory and Applications",
VOLUME=12,
PAGES=213,
YEAR=1992,
KEYWORDS="Queueing system; manufacturing system",
ABSTRACT="Ref. VBI-003583 - VBI003586.",
}

@ARTICLE{Buza92:Manufacturing,
AUTHOR="J. A. Buzacott and J. G. Shantikumar",
TITLE="Design of Manufacturing Systems Using Queueing Models",
JOURNAL=qs,
VOLUME=12,
PAGES="135-214",
YEAR=1992,
KEYWORDS="queueing network; manufacturing system; design; optimization;
second order properties; convexity; supermodularity; tranposition
increasingness; Schur convexity",
ABSTRACT="Design issues in various types of manufacturing systems such
as flow lines, automatic transfer lines, job shops, flexible machining
systems, flexible assembly systems and multiple cell systems are
addressed in this paper. Approaches to resolving these design issues of
these systems using queueing models are reviewed. In par",
}

@ARTICLE{Cala92:Optimal,
AUTHOR="J. M. Calabrese",
TITLE="Optimal Workload Allocation in Open Networks of Multiserver
Queues",
JOURNAL=ms,
VOLUME=38,
NUMBER=12,
PAGES="1792-1802",
YEAR=1992,
KEYWORDS="queueing network; network design; workload; bottleneck;
analysis; flexible manufacturing system",
ABSTRACT="In this paper, we examine the general problem of workload
allocation in an open Jackson network of multiserver queues.  We show
that use of the open network model leads to a separable, convex
formulation of the problem with relatively simple optimality conditions.
Using these conditions, we prove in general that server groups with the
same number of servers should be loaded equally and larger groups should
be loaded",
}

@ARTICLE{Chau92:Unified,
AUTHOR="M. L. Chaudhry and P. K. Kapur",
TITLE="A Unified Approach to Finding Exact and Numerical Solutions of
the First Two Moments of the Number of Renewals in Discrete Time",
JOURNAL="Department of Mathematics and Computer Science, Royal Military
College of Canada, Kingston, Ontario",
ADDRESS="Canada",
PAGES=13,
YEAR=1992,
KEYWORDS="Renewal Process; Discrete Time",
}

@ARTICLE{Chau92:Discrete,
AUTHOR="M. L. Chaudhry and P. K. Kapur and J. G. C. Templeton",
TITLE="Discrete-time Transient Solutions for a Class of Problems in
Queueing Theory: {Geom(n)/Geom(n)/r/N}",
JOURNAL="Department of Mathematics and Computer Science, Royal Military
College of Canada, Kingston, Ontario",
ADDRESS="Canada",
PAGES=22,
YEAR=1992,
KEYWORDS="Geometric Modeling; Discrete Time; Transient Analysis",
}

@ARTICLE{Chau92:Computing,
AUTHOR="M. L. Chaudry",
TITLE="Computing Stationary Queueing-Time Distributions of {GI/D/1} and
{GI/D/c} Queues",
JOURNAL="Naval Research Logistics",
VOLUME=39,
PAGES="975-996",
YEAR=1992,
KEYWORDS="Queueing system; GI/D/1",
ABSTRACT="This article gives closed-form analytic expressions as well as
the exact computational analysis of stationary queueing-time
distribution for the GI/D/1 queue.  By exploiting the relationship
between the distributions of queueing times of GI/D/1 and GI/D/c queues,
the computational analysis of the queueing-time distribution of GI/D/c
queue is also done.  Numerical results are presented for (i) the",
}

@ARTICLE{Chau92:Exact,
AUTHOR="M. L. Chaudry and P. K. Kapur",
TITLE="On Exact Computations of the Mean and Variance of the Number of
Renewals: A Unified Approach",
JOURNAL="Department of Mathematics and Computer Science, Royal Military
College of Canada, Kingston, Ontario",
ADDRESS="Canada",
PAGES=19,
YEAR=1992,
KEYWORDS="Renewal Process; Discrete Time",
}

@ARTICLE{Chia92:Improving,
AUTHOR="Stanley Chia",
TITLE="Improving the Handover Performance for Mixed Cell System",
JOURNAL=elet,
VOLUME=28,
NUMBER=7,
PAGES="678-679",
YEAR=1992,
KEYWORDS="cellular system; mobile radio; handover",
}

@ARTICLE{Coff92:Service,
AUTHOR="E. G. Coffman and Edgar N. Gilbert",
TITLE="Service by a Queue and a Cart",
JOURNAL=ms,
VOLUME=38,
NUMBER=6,
PAGES="867-883",
YEAR=1992,
KEYWORDS="batch processing; production system; queueing system",
ABSTRACT="Batch-sizing problems; Production scheduling",
}

@ARTICLE{Conn92:General,
AUTHOR="D. Connolly",
TITLE="General Purpose Simulated Annealing",
JOURNAL=jors,
NUMBER=5,
PAGES="495-505",
YEAR=1992,
KEYWORDS="Optimization; Method",
}

@ARTICLE{Crav92:Applications,
AUTHOR="J. Craveirinha and J. Climaco",
TITLE="A Survey of Applications of Mathematical Programming to
Circuit-Switched Network Planning Problems",
JOURNAL="European Transactions on Telecommunications",
VOLUME=3,
NUMBER=5,
PAGES="499-515",
YEAR=1992,
KEYWORDS="Network Planning; Math. Programming Technique",
}

@ARTICLE{Dall92:Manufacturing,
AUTHOR="Y. Dallery and S. B. Gershwin",
TITLE="Manufacturing Flow Line Systems: A Revies of Models and
Analytical Results",
JOURNAL=qs,
VOLUME=12,
PAGES="3-94",
YEAR=1992,
KEYWORDS="manufacturing system; blocking; failure; modeling; performance
evaluation; analysis; approximation; analysis; analytical methods; exact
analysis",
ABSTRACT="The most important models and results of the manufacturing
flow line literature are described.  These include the major classes of
models (asynchronous, synchronous, and continuous); the major features
(blocking, processing times, failures and repairs); the major properties
(conservation of flow, flow rate-idle time, reversibility, and others);
and the relationships among different model",
}

@ARTICLE{Trev92:Time,
AUTHOR="S. de Treville",
TITLE="Time is Money",
JOURNAL="OR/MS Today, vol 19, :5, 30-34",
YEAR=1992,
KEYWORDS="case study; queueing theory",
}

@ARTICLE{Eich92:Inversive,
AUTHOR="J. Eichenauer-Herrmann",
TITLE="Inversive Congruential Pseudorandom Numbers: a Tutorial",
JOURNAL="International Statistical Review",
VOLUME=60,
NUMBER=2,
PAGES="167-176",
YEAR=1992,
KEYWORDS="test; statistics; pseudo-random generator; random number;
discrepancy; equidistribution; inverse congruential method; lattice
structure; serial test; statistical independence; uniform pseudorandom
numbers",
ABSTRACT="The inversive congruential method for generating uniform
pseudorandom numbers is a particularly promising alternative to linear
congruential generators with their well known deficiencies.  The present
paper gives a complete survey of the work on this topic in the last few
years.",
}

@ARTICLE{Glas92:Guidelines,
AUTHOR="Paul Glasserman and D. D. Yao",
TITLE="Some Guidelines and Guarantees for Common Random Numbers",
JOURNAL=ms,
VOLUME=38,
NUMBER=6,
PAGES="884-908",
YEAR=1992,
KEYWORDS="variance reduction; random number",
ABSTRACT="Stochastic ordering",
}

@ARTICLE{Hint92:How,
AUTHOR="G. E. Hinton",
TITLE="How Neural Networks Learn from Experience",
JOURNAL="Scientific American",
VOLUME=267,
NUMBER=3,
PAGES="105-109",
YEAR=1992,
KEYWORDS="Survey; Tutorial; Neural Network",
ABSTRACT="Networks of artificial neurons can learn to represent
complicated information. Such neural networks may provide insights into
the learning abilities of the human brain.",
}

@ARTICLE{Ilia92:Moment,
AUTHOR="I. Iliadis and S. W. Fuhrmann",
TITLE="Moment Relationships for Queues with Poisson Input",
JOURNAL=qs,
VOLUME=12,
PAGES="243-256",
YEAR=1992,
KEYWORDS="moment; FIFO; LIFO; server vacation; priority; polling",
}

@PHDTHESIS{Jun92:Study,
AUTHOR="H. Jun",
TITLE="A Study on Queueing Theory and Teletraffic Models",
SCHOOL="Southeast University, Nanjing, China, and Concordia University",
ADDRESS="Canada",
PAGES=128,
YEAR=1992,
KEYWORDS="Queueing theory",
}

@ARTICLE{Just9201:Fejlkorrigerende,
AUTHOR="J. Justesen and K. Larsen and E. Paaske",
TITLE="Fejlkorrigerende Kodning",
JOURNAL="Teleteknik",
ADDRESS="Stockholm, Sweden",
NUMBER=1,
PAGES="54-67",
YEAR=1992,
LANGUAGE="Swedish",
KEYWORDS="coding theory",
ABSTRACT="I mange moderne kommunikationssystemer anvendes fejlkor-
rigerende kodning, f.eks. i satellitkommunikation og GSM- systemet.
Denne artikel giver en introduktion til fejl- korrigerende kodning, der
muligg r forståelse af de mest anvendte fejlkorrigerende koder.
Hovedvægten i artiklen er lagt på strukturer i fejlkorrigerende koder og
implementering af algoritmer for kodning og dekodning. Teorien om
fejlkorrigerende koder er",
}

@ARTICLE{Kilv9203:Svitsteori,
AUTHOR="K. A. Kilvik",
TITLE="Svitsteori anvendt på nettstrukturer",
JOURNAL="Teletronikk",
ADDRESS="Stockholm, Sweden",
NUMBER=3,
PAGES="46-53",
YEAR=1992,
LANGUAGE="Swedish",
KEYWORDS="switching network",
}

@ARTICLE{Klei92:Pseudorandom,
AUTHOR="J. P. Kleijnen and B. Annink",
TITLE="Pseudorandom number generators for supercomputers and classical
computers: A practical introduction",
JOURNAL="European Journal of Operational Research",
VOLUME=63,
PAGES="76-85",
YEAR=1992,
KEYWORDS="simulation; Monte Carlo simulation; parallel algorithm; random
number; software",
ABSTRACT="When the cycle of a multiplicative congruental generator with
a modulus that is a power of two is split into two parts, then the
pseudorandom numbers across parts turn out to lie on only two parallel
lines.  These 'long range' correlations have consequences for computers
with a traditional or a new architecture.  For vector computers, simple
alternative computer implementations are presented.  These
implementations are faster",
}

@ARTICLE{Ko92:Calculations,
AUTHOR="King-Tim Ko",
TITLE="Calculations of Call Congestion in Multilayer Cellular Network",
JOURNAL=elet,
VOLUME=28,
NUMBER=3,
PAGES="332-333",
YEAR=1992,
KEYWORDS="digital communication; mobile radio",
ABSTRACT="The parallel between the channel assignment of multilayer
cellular networks and grading designs first used in analogue telephone
exchanges is drawn. This allows the use of approximated results
developed for grading designs to the calculation of call congestion in
multilayer cellular networks. In addition, approximations based on the
equivalent random method are developed for the case of a two-layer
cellular network.",
}

@ARTICLE{Lin92:New,
AUTHOR="F. Lin and James Yee",
TITLE="A New Multiplier Adjustment Procedure for the Distributed
Computation of Routing Assignments in Virtual Circuit Data Networks",
JOURNAL="ORSA Journal on Computing",
VOLUME=4,
NUMBER=3,
PAGES="250-266",
YEAR=1992,
KEYWORDS="communication; routing; distributed computing system; network;
graph theory",
ABSTRACT="Virtual circuit data networks; Multicommodity flows",
}

@ARTICLE{Logo92:Centralized,
AUTHOR="M. Logothetis and Shigeo Shioda",
TITLE="Centralized Virtual Path Bandwidth Allocation Scheme for {ATM}
Networks",
JOURNAL=ieice_communications,
VOLUME="E75-B",
NUMBER=10,
PAGES="1071-1080",
YEAR=1992,
KEYWORDS="ATM; virtual path; bandwidth allocation; loss calculation",
}

@ARTICLE{Lund92:Frame,
AUTHOR="K. Lundfall",
TITLE="Frame Relay - for Faster and More Efficient Data Communication",
JOURNAL="Ericsson Review No. 1-2",
PAGES="3-11",
YEAR=1992,
KEYWORDS="frame relay",
}

@ARTICLE{Lymb92:Cellular,
AUTHOR="D. Lymberopoulos and S. Kotsopoulos and M. Koukias",
TITLE="Cellular Mobile Radio Communication Network Design on the Basis
of Analytical Traffic Measurements",
JOURNAL="Electronics Letter",
VOLUME=28,
NUMBER=15,
PAGES="1425-1426",
YEAR=1992,
KEYWORDS="mobile radio; simulation",
ABSTRACT="A cellular land mobile communication network (CMCN) optimal
design, based on realistic simulation procedures, is presented. The
input of the employed simulation model comprised parameters obtained
from field and real traffic telephone measurements. The output of the
model was the MCCN traffic load estimation and system performance
evaluation. The CMCN design concerns the evolution of the communication
network in the Patra",
}

@ARTICLE{Ma92:Modular,
AUTHOR="Jun Ma",
TITLE="Modular Packet Switch with Multiple Phases and Replicated
Planes",
JOURNAL=elet,
ADDRESS="Great Britain",
VOLUME=28,
NUMBER=15,
PAGES="1435-1437",
YEAR=1992,
KEYWORDS="switching; network; digital communication",
ABSTRACT="Some modular switches for BISDN have recently been proposed.
They can achieve high performance with output queueing and they can be
implemented by using small modules. However, they have either high
overall complexity or other problems. In the Letter, a new modulator
switch is proposed that has high performance and low complexity.",
}

@ARTICLE{Mura92:Considerations,
AUTHOR="Hideyo Murakami and Tadahiro Yokoi and Masahiro Taka",
TITLE="Considerations on {ATM} Network Performance Planning",
JOURNAL=ieice_communications,
VOLUME="E75-B",
NUMBER=7,
PAGES="563-571",
YEAR=1992,
KEYWORDS="ATM; performance evaluation; B-ISDN; delay; loss calculation",
ABSTRACT="In an ATM network, there are quality impairments particular to
the ATM network such as cell loss and delay variations.  During ATM
network planning, therefore, various causes of quality impairments
should be clarified.  This paper overviews ATM network performance
issues, and discusses performance requirements for the SDH network which
will be applied as a physical layer of the ATM network.  It also
presents ATM network performance",
}

@ARTICLE{Neut92:Two,
AUTHOR="M. F. Neuts",
TITLE="Two Further Closure Properties of {PH-Distributions}",
JOURNAL="Asia-Pacific Journal of Operational Research",
VOLUME=9,
PAGES="77-85",
YEAR=1992,
KEYWORDS="phase-type model; time to completion; reliability",
}

@ARTICLE{Neut92:Models,
AUTHOR="M. F. Neuts",
TITLE="Models based on the Markovian Arrival process",
JOURNAL=ieice_communications,
VOLUME="75-B",
NUMBER=12,
PAGES="1255-1265",
YEAR=1992,
KEYWORDS="Markov process; matrix analytic method; breakdown; algorithm;
probability; modulated arrival streams; platooning; server breakdowns",
ABSTRACT="This is a partly expository paper discussing how point
processes with certain ``bursty'' features can be qualitatively modelled
by the Markovian arrival process, a generalization of the Poisson or
Bernoulli processes which can be used to obtain algoritmically tractable
matrix solutions to a variety of problems in probability models.",
}

@ARTICLE{Ono92:Recent,
AUTHOR="K. Ono and Y. Watanabe",
TITLE="Recent Advances in Principles and Algorithms for Communications
network Design and Planning",
JOURNAL=ieice_communications,
VOLUME="E75-B",
NUMBER=7,
PAGES="556-562",
YEAR=1992,
KEYWORDS="network optimization; network engineering; network
flexibility",
ABSTRACT="The introduction of Integrated Services Digital Networks
(ISDNs) poses a variety of new questions on telecommunications network
design and planning. Furthermore, the formulation of traditional network
design and planning problems need to be revisited in the ISDN context.
This paper presents an overview of the recent progress and new
challenges in developing ISDN design and planning",
}

@ARTICLE{Panz92:Transputer,
AUTHOR="H. Panzer and M. Söllner and E. Wehrhahn",
TITLE="A Transputer-Based Multiprocessor System for Simulating Complex
Signalling Protocols",
JOURNAL="Philips Telecommunication Review",
ADDRESS="Netherlands",
VOLUME=50,
YEAR=1992,
KEYWORDS="Protocol simulation; SDL",
}

@ARTICLE{Pins92:Exact,
AUTHOR="E. Pinsky and A. E. Conway",
TITLE="Exact Computation of blocking Probabilities in State-Dependent
Multi-Facility Blocking Models",
EDITOR="T. Hasegawa and H. Takagi and Y. Takahashi",
JOURNAL="Performace of Distributed Systems and Integrated Communications
Networks",
PUBLISHER="North-Holland",
PAGES="383-392",
NOTE="IFIP Transactions C-5",
YEAR=1992,
KEYWORDS="multiserver",
ABSTRACT="In this paper, we develop a new general-purpose recursive
algorithm for the exact computation of blocking probabilities in
multi-facility blocking models with some forms of state-dependent
arrival rates.  The recursion is cast in terms of the partition function
of a product-form model.  A dynamic scaling procedure is also proposed
to avoid numerical",
}

@ARTICLE{Pins92:Computational,
AUTHOR="E. Pinsky and A. E. Conway",
TITLE="Computational Algorithms for Blocking Probabilities in
Circuit-Switched Networks",
JOURNAL="Annals of Operations Research",
VOLUME=35,
PAGES="31-41",
YEAR=1992,
KEYWORDS="multiserver; convolution algorithm",
ABSTRACT="In this paper, we develop two new general purpose recursive
algorithms for the exact computation of blocking probabilities in
multi-rate product-form circuit-switched networks with fixed routing.
The first algorithm is a normalization constant approach based on the
partition function of the state distribution. The second is a
mean-values type of algorithm with a recursive cast in terms of blocking
probabilities and condit",
}

@ARTICLE{Pour92:Routing,
AUTHOR="B. Pourbabai and A. Seidmann",
TITLE="Routing and Buffer Allocation Models for a Telecommunication
System with Heterogeneous Devices",
JOURNAL="European Journal of Operational Research",
VOLUME=63,
PAGES="423-431",
YEAR=1992,
KEYWORDS="System design; queueing system; optimization",
}

@ARTICLE{Pujo9201:Commutateurs,
AUTHOR="Guy Pujolle",
TITLE="Commutateurs {ATM:} Classification et Architecture",
JOURNAL="Technique et Science Informatique",
VOLUME=11,
NUMBER=1,
PAGES="11-29",
YEAR=1992,
LANGUAGE="French",
KEYWORDS="ATM; switching network; Banyan network; classification; space
division multiplex; TDM; bus",
ABSTRACT="ATM cell switch is becoming a very important piece of future
broadband networks. To understand very well such structures it is
necessary to classify them following several important criteria. Here,
we propose a classification under five criteria. It turns out a proposal
based on a time division switching architecture using an internal bus
structure. Two examples of such an architecture are proposed in the last
section of",
}

@ARTICLE{Riva92:Preliminary,
AUTHOR="G. Riva",
TITLE="Preliminary Results on Traffic Overflow from Microcells to
Macrocell",
JOURNAL=elet,
VOLUME=28,
NUMBER=15,
PAGES="1462-1463",
YEAR=1992,
KEYWORDS="mobile radio",
ABSTRACT="Forthcoming mobile radio systems are based on a mixed layout
(microcells plus a superimposed macrocell grid). In the Letter, results
on the overflow traffic from microcells to macrocell are presented,
based on a traffic model considering call statistics and mobility
statistics and on simple geometric considerations.",
}

@ARTICLE{Scha92:BCD,
AUTHOR="R. Schasssberger",
TITLE="The {BCD} Queue and Its Ramifications",
JOURNAL=qs,
VOLUME=11,
NUMBER=4,
PAGES="377-393",
YEAR=1992,
KEYWORDS="queueing system; birth-death process; reversibility; processor
sharing; LIFO; insensitivity; quasireversibility; LCFS",
ABSTRACT="We introduce a process similar to the birth-death process and
use it as a starting point for defining queueing models much in the same
way as the birth-death process can be used for this purpose.
Steday-state distributions for this process and the corresponding queues
are derived. Generalizations allowing nonexponential service times are
also studied.",
}

@ARTICLE{Scho92:Prioritised,
AUTHOR="John Schormans and Eric Scharf and Jonathan Pitts",
TITLE="Prioritised {GEO/D/1} Telecommunications Switch Model",
JOURNAL=elet,
VOLUME=28,
NUMBER=6,
PAGES="597-598",
YEAR=1992,
KEYWORDS="Switching block; queueing theory; algorithm",
ABSTRACT="Algorithms are developed for the calculation of steady state
waiting time probabilities in a prioritised time slotted
telecommunications switch, in which the transmitted cells have one of an
arbitrary number of priority levels.  This generalises recent work on
GEO/D/1 switch model with two levels of time priority, and further
extends the original work by Louvion et al., presented at the 1988
ITC.",
}

@ARTICLE{Seni92:New,
AUTHOR="J. M. Senior and D. S. Rehal and A. N. Wiseman",
TITLE="New Modelling Strategy for Representing Asymmetric Traffic Loads
on {LANs}",
JOURNAL=elet,
VOLUME=28,
NUMBER=13,
PAGES="1191-1193",
YEAR=1992,
KEYWORDS="modeling; LAN",
ABSTRACT="A new technique for modelling asymmetric traffic load
distributions on local area networks (LANs) is presented. The traffic
model which is analytical and easy to implement into discrete event
computer simulations also has the benefit of providing expressions for
the higher mathematical moments of the traffic load distribution.",
}

@ARTICLE{Shin92:Advanced,
AUTHOR="M. Shinohara",
TITLE="Advanced Dimensioning Tool for Circuit-Switched Networks",
JOURNAL=ieice_communications,
VOLUME="E75-B",
NUMBER=7,
PAGES="594-600",
YEAR=1992,
KEYWORDS="network optimization; network design; circuit switching;
algorithm",
ABSTRACT="Network dimensioning; Design tool",
}

@ARTICLE{Sima9204:Numerical,
AUTHOR="H. P. Simao and W. B. Powell",
TITLE="Numerical Methods for Simulating Transient, Stochastic Queueing
Networks - {I:} Methodology",
JOURNAL="Transportation Science",
VOLUME=26,
NUMBER=4,
PAGES="296-311",
YEAR=1992,
KEYWORDS="Instationary Process; simulation",
}

@ARTICLE{Sofi92:Queueing,
AUTHOR="S. Sofianopoulou",
TITLE="A Queueing Network Application to a Telecommunications
Distributed System",
JOURNAL="Recherche Operationelle - Operations Research",
VOLUME=26,
NUMBER=4,
PAGES="409-420",
YEAR=1992,
KEYWORDS="queueing network; distributed processing; process;
allocation",
ABSTRACT={The purpose of this paper is to present a solve a particular
class of a telecommunications related Process Allocation Problem. The
problem deals with the allocation of processes to a network of
processors with the aim to minimize a "trade-off" objective function
composed of (a) the queueing delays overhead which is formed in the
underlying queueing network and (b) the communication costs incurred
between processes residin},
}

@ARTICLE{Stad92:Loss,
AUTHOR="W. Stadje",
TITLE="On a Loss system with a Given Number of Customers",
JOURNAL=qs,
VOLUME=12,
PAGES="325-332",
YEAR=1992,
KEYWORDS="single server; loss system; service time; uniform variate;
arrival process; probability; deterministic service times; conditionally
uniform arrivals; state probability; number of served customers",
ABSTRACT="A one-server loss system with Poisson arrival stream and
deterministic service time is considered conditional on the number of
customers who appeared up to a given T.  This condition implies thet the
arrival times form a sample of the uniform distribution on (0,T).  We
derive several characteristics of interest, such",
}

@ARTICLE{Stav92:Property,
AUTHOR="C. N. Stavropoulos and E. Sykas",
TITLE="Property of Optimal Resource Sharing Policy in systems with N
Types of Competing Customer",
JOURNAL=elet,
VOLUME=27,
NUMBER=15,
PAGES="1356-1358",
YEAR=1992,
KEYWORDS="channel capacity; optimization; multiserver",
ABSTRACT="The problem of capacity allocation to a number of different
types of customer is considered. The model is an N-dimensional
generalisation of the Erlang loss model. Assuming infinite population
for each type of customer, the problem is to improve the system
performance which is measured as loss probability. A structural property
of the optimal policy is derived. It follows that the optimal scheduled
system will have, with",
}

@ARTICLE{Stee92:Teletraffic,
AUTHOR="Raymond Steele and M. Nofal",
TITLE="Teletraffic Performance of Microcellular Personal Communication
Networks",
JOURNAL="IEE Proceedings-I",
VOLUME=139,
NUMBER=4,
PAGES="448-461",
YEAR=1992,
KEYWORDS="traffic theory; communication network",
ABSTRACT="Teletraffic performance of a personal communication network
(PCN) based on city street microcells catering for pedistrian mobile
users is analysed.  By opting for microcells, the network capacity
dramatically increases as well as the spectrum efficiency, but the
network must be able to accomodate substantial increases in the number
and rate of call handovers.  A teletraffic analysis is performed to
determine the new",
}

@ARTICLE{Stew92:Numerical,
AUTHOR="W. J. Stewart and Wei Wu",
TITLE="Numerical Experiments with Iteration and Aggregation for Markov
Chains",
JOURNAL="ORSA Journal on Computing",
VOLUME=4,
NUMBER=3,
PAGES="336-350",
YEAR=1992,
KEYWORDS="Markov chain; near complete decomposability; iterative method;
aggregation; numerical evaluation; large Markov chain models; iteration
and aggregation; numerical experiment",
ABSTRACT="This paper describes an iterative aggregation/disaggregation
method for computing the stationary probability vector of a nearly
completely decomposable Markov chain.  The emphasis is on the
implementation of the algorithm and on the results that are obtained
when it is applied to three modelling examples that have been used in
the analysis of computer",
}

@ARTICLE{Sumi92:Modeling,
AUTHOR="S. Sumita",
TITLE="Modeling and Performance Analysis of {SPC} Switching Systems",
JOURNAL=ieice_communications,
VOLUME="75-B",
NUMBER=12,
PAGES="1277-1286",
YEAR=1992,
KEYWORDS="call processor capacity; overload control; clock schedule;
distributed control; memory; contention; interprocessor communications;
memory access contention",
ABSTRACT="Modeling and performance analysis have played an important
role in the economical design and efficient operation of switching
systems, and is currently becoming more important because the switching
systems should handle a wide range of traffic characteristics, meeting
the grade of service requirements of each traffic type.  Without these
techniques we could no longer",
}

@ARTICLE{Taki92:Average,
AUTHOR="T. Takine and Toshiharu Hasegawa",
TITLE="Average Waiting Time of a Symmetric Polling System under
Bernoulli Scheduling",
JOURNAL=orl,
VOLUME=10,
PAGES="535-539",
YEAR=1992,
KEYWORDS="M/G/1; cyclic service; scheduling; Bernoulli scheduling",
ABSTRACT="We consider a system of multiple queues served in cyclic order
by a single server.  At a visit of a server to each queue, the server
works according to the Bernoulli scheduling service discipline.  The
system is assumed to be symmetric.  By using both the stochastic
decomposition property and an imbedded Markov chain, we derive an
explicit expression of the average waiting time.",
}

@ARTICLE{Tani92:Restricted,
AUTHOR="T. Taniai and A. Miki and T. Kojima and I. Sasase and S. Mori",
TITLE="Restricted Overflow Strategy in Integrated Services Network",
JOURNAL=ieice_communications,
VOLUME="E75-B",
NUMBER=7,
PAGES="649-655",
YEAR=1992,
KEYWORDS="ISDN; overflow",
ABSTRACT="Restricted overflow strategy; Threshold",
}

@ARTICLE{Voll92:Interaction,
AUTHOR="M. Volle",
TITLE="Interaction Between Data Analysis and Telecommunications",
JOURNAL="Applied Stochastic Models and Data Analysis",
VOLUME=8,
PAGES="57-65",
YEAR=1992,
KEYWORDS="Statistics; data analysis; VAN",
ABSTRACT="Value added services",
}

@ARTICLE{Whit92:Understanding,
AUTHOR="W. Whitt",
TITLE="Understanding the Efficiency of Multi-Server Service Systems",
JOURNAL=ms,
VOLUME=38,
NUMBER=5,
PAGES="708-723",
YEAR=1992,
KEYWORDS="queueing system; multiserver; utilization; approximation;
probability; delay; peakedness",
ABSTRACT="service systems; economy of scale; Hayward's approximation",
}

@ARTICLE{Yama92:Precise,
AUTHOR="Naoaki Yamanaka and Y. Sato and K. Sato",
TITLE="Precise {UPC} Scheme suitable for {ATM} Networks Characterized by
Widely Ranging Traffic Parameter Values",
JOURNAL=ieice_communications,
ADDRESS="Japan",
VOLUME="75B",
PAGES="1367-1372",
YEAR=1992,
KEYWORDS="ATM; B-ISDN; policing function; traffic engineering; UPC;
traffic management",
ABSTRACT="This letter proposes a new UPC (Usage Parameter Control)
method suitable for monitoring/controlling the ATM cell streams of VCs
(Virtual Channels) and VPs (Virtual Paths) specified with a wide-range
of traffic parameter values.  The method, named the 2-phase T-X method,
combines two credit window type monitoring circuits that are shifted in
phase by T/2.  The proposed method achieves the best of both",
}

@ARTICLE{Yama92:Traffic,
AUTHOR="Naoaki Yamanaka and Y. Sato and K. Sato",
TITLE="Traffic Shaping for {VBR} Traffic in {ATM} Networks",
JOURNAL=ieice_communications,
VOLUME="E75-B,10",
PAGES="1105-1108",
YEAR=1992,
KEYWORDS="ATM; B-ISDN; traffic shaping; bandwidth allocation; cell
space",
ABSTRACT="The effectiveness of traffic shaping for VBR traffic is
analyzed.  Evaluation results prove that traffic shaping can improve
link efficiency for most forms of Bursty VBR traffic and that link
efficiency gains of more than 250\% can be expected without the shaping
delay imposing any significant QOS deterioration.  Traffic shaping
increases the link eficiency to about 80\% for traffic with short burst
repetition periods.",
}

@ARTICLE{Yang9202:Cox,
AUTHOR="T. Yang and M Posner and J. G. C. Templeton",
TITLE="The Cox/M/s/m Retrial Queue: A Computational Approach",
JOURNAL="ORSA Journal on Computing",
VOLUME=4,
NUMBER=2,
PAGES="182-191",
YEAR=1992,
KEYWORDS="Queueing system",
}

@ARTICLE{Zand92:Capacity,
AUTHOR="J. Zander and M. Frodigh",
TITLE="Capacity Allocation and Channel Assignment in Cellular Radio
Systems Using Reuse Partitioning",
JOURNAL=elet,
VOLUME=28,
NUMBER=5,
PAGES="438-440",
YEAR=1992,
KEYWORDS="mobile radio; digital communication",
ABSTRACT="Reuse partitioning is a technique for providing more efficient
spectrum reuse in cellular radio systems. A cell is such a system
divided into concentric zones, each associated with an overlaid cell
plan. For these schemes an optimum channel assignment strategy is
proposed. Numeric examples show capacity improvements of about 50 \%
compared to conventional systems.",
}

@ARTICLE{Zane9201:Intelligent,
AUTHOR="A. Zanettin",
TITLE="Intelligent Private Packet-Switched Networks",
JOURNAL="Philips Telecommunication Review",
ADDRESS="Netherlands",
VOLUME=50,
NUMBER=1,
PAGES="26-33",
YEAR=1992,
KEYWORDS="Packet switching",
}

@TECHREPORT{Frit92:Artificial,
AUTHOR="T. Fritsch and M. Mittler and P. Tran-Gia",
TITLE="Artificial neural net applications in telecommunication systems",
INSTITUTION="Universität Würzburg, Institut für Informatik III",
ADDRESS="Würzburg, Germany",
VOLUME=52,
PAGES=38,
YEAR=1992,
REFERENCES=52,
KEYWORDS="Neural network; application; communication network",
}

@INPROCEEDINGS{Bono92:ATM,
AUTHOR="F. Bonomi and S. Montagna and R. Paglino",
TITLE="Performance Analysis of an {ATM} statistical Multiplexer with
Heterogeneous Bursty Traffic",
BOOKTITLE="11. International Conference on Computer Communications;
Genova, Italy, 1992",
ADDRESS="Genova, Italy",
PAGES="737-742",
YEAR=1992,
REFERENCES=18,
KEYWORDS="ATM; multiplexer; ND/D/1; performance evaluation",
ABSTRACT="In this paper we study a model of a statistical multiplexer
withnon-homogeneous bursty traffic, in order to investigate its ste ady
state behavior. Our study represents an effort to widen our perspective
on the advantages and pitfalls of statistical multiplexing, by
considering a set of issues not yet deeply covered inthe available
literature. Our overall conclusions indicate that the full advantages
promised by statistical multiplexing cannot",
}

@BOOK{Gram92:Simulation,
AUTHOR="T. Grams",
TITLE="Simulation - strukturiert und objektorientiert programmiert",
ISBN="3-41-15631-7",
PUBLISHER="BI-Wiss.-Verl., Mannheim, Leipzig, Wien, Z rich",
ADDRESS="Mannheim, Germany",
PAGES=222,
YEAR=1992,
LANGUAGE="German",
REFERENCES=79,
KEYWORDS="Simulation; programming",
ABSTRACT="Sign. 09 92 01916",
}

@ARTICLE{Allm9202:Konzept,
AUTHOR="S. Allmis and N. Vogt and G. W”hlbier and W. Prange",
TITLE="Das Konzept Synchrones Netz - Teil 1: Strategischer Teil",
JOURNAL="Der Fernmelde-Ingenieur",
ADDRESS="Germany",
VOLUME=46,
NUMBER=2,
PAGES="1-39",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="SDH; Network Management; Cross Connect; Multiplexer",
ABSTRACT="Das Konzept Synchrones Netz wird in zwei Teilbereichen
vorgestellt und befaát sich mit dem Aufbau und der Gestaltung eines
neuenund modernen šbertragungsnetzes. Es wurde unter dem Projektnamen
SYNET (Synchrones Netz) erarbeitet und wird beginnend mit dem Jahr 1992
realisiert. Der erste Teil umfaát im wesentlichen die strategischen
Anteile des Konzeptes.",
}

@BOOK{Sieg92:Grundlagen,
AUTHOR="G. Siegmund",
TITLE="Grundlagen der Vermittlungstechnik",
ISBN="3-7685-4892-9",
PUBLISHER="R. v. Decker Verlag",
ADDRESS="Heidelberg, Germany",
VOLUME="2. Aufl.",
PAGES=505,
YEAR=1992,
LANGUAGE="German",
REFERENCES=43,
KEYWORDS="Isdn; survey; switching network; traffic theory; circuit
switching; packet switching; datex-l; datex-p; signalling; d-channel;
ccs; b-isdn; atm",
ABSTRACT="Das Buch enth„lt eine allgemeine Einf�hrung in die
Vermittlungstechnik mit einem kleinen Anteil (6 Seiten) Verkehrstheorie
sowieeiner ausf�hrlicheren Darstellung des ISDN: Nachrichtenvermittlung,
Fernsprechvermittlung, Datenvermittlung, ISDN-Grundlagen, Signalisierung
(D-Kanal, ZGS Nr.7), ISDN-Endger„te und -TK-Anlagen, B-ISDN (O: IfN-BM:
95.8 58066 001)",
}

@INPROCEEDINGS{Badr92:Locating,
AUTHOR="Badri Nath and T. Imielinski and A. Virmani",
TITLE="Locating Strategies for Personal Communication Networks",
BOOKTITLE="IEEE Globecom 92 Workshop on Networking of Personal
Communications Applications 1992",
ADDRESS="Orlando, USA",
PAGES="??",
YEAR=1992,
REFERENCES=16,
KEYWORDS="Cellular system; database; distributed database; mobile radio;
optimization; simulation",
ABSTRACT="... The impact of mobility will be the significant search cost
and the flood of location updates. This paper examines strategies that
can reduce the search cost and at the same time control the volume of
location updates by employing user profiles. ...",
}

@ARTICLE{Berm92:Perspective,
AUTHOR="R. K. Berman and J. H. Brewster",
TITLE="Perspective on the {AIN} Architecture",
JOURNAL="IEEE Communications Magazine, IEEE",
ISBN="0163-6804",
ADDRESS="New York",
VOLUME="1,2",
PAGES="27-32",
YEAR=1992,
KEYWORDS="Architecture; history; in; intelligent network; survey",
ABSTRACT="This article will examine the advanced Intelligent Network
(AIN) from a variety of perspectives: historical, present day
architecture and future evolution.",
}

@INPROCEEDINGS{Bond92:Minimally,
AUTHOR="A. B. Bondi and V. Y. Jin",
TITLE="Performance Analysis of a Minimally Replicated Distributed
Database for Universal Personal Telecommunications Services",
BOOKTITLE="8th ITC Specialist Seminar on Universal Personal
Telecommunication, IAC of ITC",
ADDRESS="Santa Margherita Lig, Italy",
PAGES="131-140",
YEAR=1992,
REFERENCES=13,
KEYWORDS="Database; distributed database; fail safe; performance
evaluation; response time; robustness",
ABSTRACT="... The UPT profile database would be partitioned into as many
disjoint fragments as there are geographically distinct nodes. Each
fragment would be stored at two of the nodes, subject to the constraint
that no pair of fragments would be stored at more than one node. This
constraint ensures that the load which would have been carried by
afailed node is spreasd to two other nodes instead of one, thus reducing
risk of overload. We use a performan",
}

@INPROCEEDINGS{Camb92:Service,
AUTHOR="E. Cambre",
TITLE="Service Management in Intelligent Networks",
BOOKTITLE="Int. Council for Computer Communication Intelligent Networks
Conf. (Ed. P.W. Bayliss)",
PAGES="420-429",
YEAR=1992,
KEYWORDS="In; intelligent network",
ABSTRACT="Network management has become a major topic in todays
telecommunication. The need to operate and to maintain a network
globally and the services within that network is stressed continuously
by all involved parties. Particularly easiness and human friendliness is
a key element in the demands for the different domains of management
activities. Management actions imply manipulation of data. It is
mandatory that data integrity is guaranteed and tha",
}

@ARTICLE{Carb92:Einfluß,
AUTHOR="J.-C. Carballes",
TITLE="Einfluß der optischen Kommunikation",
JOURNAL="Elektrisches Nachrichtenwesen, ALCATEL",
ADDRESS="Stuttgart, Germany",
VOLUME=4,
PAGES="4-11",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="Fiber optics; network",
ABSTRACT="Geschichte der optischen Kommunikation (Glasfaser,
Bauelemente, Systeme, Netze)",
}

@PROCEEDINGS{Casa92:Workshop,
TITLE="Workshop on Broadband Communications",
EDITOR="A. Casaca",
PUBLISHER="IFIP Technical Committee",
ADDRESS="Estoril, Portugal",
YEAR=1992,
KEYWORDS="ATM; B-ISDN; broadband; communication; DQDB; LAN; MAN; network
architecture; network control system; policing function; protocol;
public network; signalling; switching",
}

@ARTICLE{Cata92:Role,
AUTHOR="F. Cataldi and F. Ferrero and A. Proietti",
TITLE="The role of high-speed network field trials for the assessment
ofearly availabe products",
JOURNAL="CSELT Technical reports",
ADDRESS="Italy",
VOLUME="20,6",
PAGES="479-486",
YEAR=1992,
REFERENCES=18,
KEYWORDS="Field trial; hslan; man",
ABSTRACT="Field trials have been settled or are planned in several
countries, to evaluate the impact of the new systems and services in
terms of users acceptability, network configuration, installationand
operation issues, including the approach to billing and accounting.
[...] The paper reviews the broadband communication worldwide
experiments where MAN and ATM technologies are used. The emphasis is
then put on the field trails carried out in Italy.",
}

@ARTICLE{Chla92:Reservation,
AUTHOR="I. Chlamtac and A. Fumagalli",
TITLE="Performance of Reservation Based (Quadro) {WDM} Star Networks",
JOURNAL=infocom,
ADDRESS="Florence, Italy",
PAGES="2115-2123",
YEAR=1992,
REFERENCES=6,
KEYWORDS="Performance model; reservation access; star network; wdm",
ABSTRACT="This paper summarizes the original and the Quadro reservation
star operation and then introduces a common modeling framework allowing
us to develop tractable analytic models. System performance is derived
using the introduced models and it is shown that reservation based
optical stars can provide high throughput and low delays with small
buffering requirements.",
}

@ARTICLE{Chla92:Lightpath,
AUTHOR="I. Chlamtac and A. Ganz and G. Karmi",
TITLE="Lightpath Communications: An Approach to High Bandwidth Optical
{WANs}",
JOURNAL=ieeecom,
VOLUME="40,7",
PAGES="1171-1182",
YEAR=1992,
REFERENCES=32,
KEYWORDS="Channel assignment; heuristics; network architecture;
tutorial; wan; wdm",
ABSTRACT="In this paper we propose a novel architectural approach that
meets the high bandwidth requirements by introducing a communication
architecture based on lightpaths, optical transmission paths in the
network. Since lightpaths form the building block of the proposed
architecture, its performance hinges on their efficient establishment
and management. We show that although the problem of optimally
establishing lightpaths is NP-complete, simple heur",
}

@INPROCEEDINGS{Dary92:Object,
AUTHOR="P. Daryani and I. Faynberg and Stephen J. Griesmer and Michael
Kaplan and  others",
TITLE="Object-Oriented Modelling of the Intelligent Network and its
applicatioin to Universal Personal Telecommunications Service",
BOOKTITLE="Int. Council for Computer Communication Intelligent Networks
Conf. (Ed. P.W. Bayliss)",
PAGES="391-406",
YEAR=1992,
REFERENCES=18,
KEYWORDS="In; intelligent network; modeling; object-oriented
programming",
ABSTRACT="The Intelligent Network (IN) community has started an effort
to model a distributed exectuion environment that combines two separate
technologies: Telephony and Information Technology (IT). In parallel to
this effort, the general study of distributed processing environments is
currently progressing both in ISO and CCITT. Although applications of
Open Systems Interconnection (OSI) and Open Distributed Processing (ODP)
concepts to telecommunicati",
}

@INPROCEEDINGS{Deak92:Introducing,
AUTHOR="T. Deak",
TITLE="Introducing Intelligent Networks into the {PSTN}",
BOOKTITLE="Int. Council for Computer Communication Intelligent Networks
Conf. (Ed. P.W. Bayliss)",
PAGES="300-315",
YEAR=1992,
KEYWORDS="Charging; in; intelligent network; network; network
architecture; public network; signalling; telephony",
ABSTRACT="... This means that the PSTN will make demands on IN to be
compatible and interwork within the existing infrastructure. ... This
paper discusses network-related issues such as - inter exchange
signaling - network services network billing mechanisms which need to be
addressed when introducing IN within the PSTN. ...",
}

@ARTICLE{Meer92:Introduction,
AUTHOR="J. de Meer and R. Roth and Son Vuong",
TITLE="Introduction to algebraic specifications based on the language
{ACT} {ONE}",
JOURNAL=cnis,
ADDRESS="Netherlands",
VOLUME=23,
PAGES="363-392",
YEAR=1992,
REFERENCES=19,
KEYWORDS="Abstract data type; formal technique",
ABSTRACT="The tutorial will give an introduction to algebraic methods
for system specifications. It will explain the basic mathematical
theory. But the main emphasis will remain on the exposition of the
methodological principles by which specifications are constructed. The
concepts will be introduced on the basis of the specification language
ACT ONE. We will demonstrate the use of ACT ONE with an example from the
OSI area.",
}

@ARTICLE{Doms92:Dual,
AUTHOR="P. Domschitz and M. Siegel",
TITLE="Dual ring usage in {FDDI}",
JOURNAL="Computer Communications, Butterworth-Heinemann Ltd.",
VOLUME="15,5",
PAGES="447-457",
YEAR=1992,
REFERENCES=32,
KEYWORDS="Fddi; hslan; lan; man",
ABSTRACT="This paper describes possible concepts using both rings in
FDDIunder normal working conditions, without losing the fault-tolerance
provided by ring reconfiguration around error situations. Consequences
for management and system structure are outlined. Particular attention
is given to the broad spectrum of standard-conformant possibilities of
FDDI modes and topologies. Finally, wepresent our concept for an FDDI
station which uses both rings.",
}

@INPROCEEDINGS{Drag92:Intelligent,
AUTHOR="L. Dragoni and L. Gabrielli and P. Marchese",
TITLE="Intelligent Network Service Testing",
BOOKTITLE="Int. Council for Computer Communication Intelligent Networks
Conf. (Ed. P.W. Bayliss)",
PAGES="92-102",
YEAR=1992,
REFERENCES=5,
KEYWORDS="In; intelligent network; testing",
ABSTRACT="The introduction of the Intelligent Network in Italy is a
primary objective for SIP, the Italian telecommunication operator,
starting from 1992. In order to support the testing phase of national IN
deployment, SIP and CSELT have promoted an extensive testing project
covering all relevant IN testing areas, also including protocol and
service testing as well as system and network performance evaluation.
Particular care has been devoted to service",
}

@ARTICLE{Dupr92:Zukunft,
AUTHOR="J. Dupraz and J. M. Gabriagues and J. B. Jacob and P. Speier",
TITLE="Zukunft der optischen Vermittlung",
JOURNAL="Elektrisches Nachrichtenwesen, ALCATEL",
ADDRESS="Stuttgart, Germany",
VOLUME=4,
PAGES="72-77",
YEAR=1992,
LANGUAGE="German",
REFERENCES=8,
KEYWORDS="Fiber optics; network; optical switching; technology",
ABSTRACT="Stand optischer Vermittlungstechnik (insbes. Technologie)
1992",
}

@INPROCEEDINGS{Fuji92:STATE,
AUTHOR="R. M. Fujimoto and D. M. Nicol",
TITLE="{STATE} {OF} {THE} {ART} {IN} {PARALLEL} {SIMULATION}",
BOOKTITLE="Winter Simulation Conference 1992",
PAGES="246-254",
YEAR=1992,
REFERENCES=74,
KEYWORDS="Distributed simulation; overview; parallel computing; survey",
ABSTRACT="This tutorial surveys topics that presently define the state
ofthe art in parallel simulation. Included in the tutorial are
discussions on hardware support for parallel simulation, load balancing
algorithms, dynamic memory management for optimistic synchronization,
new protocols, mathematical performance analysis, and the time
parallelism.",
}

@ARTICLE{Fuji92:Method,
AUTHOR="M. Fujinaga and Takeshi Kato and Ken-Ichi Suzuki",
TITLE="An Implementation Method of {IN} Functional Entities on Top of
Distributed Operating System and Its Performance Evaluation Using
Experimental System",
JOURNAL=ieice_communications,
ADDRESS="Japan",
VOLUME="E75-B",
PAGES="1043-1051",
YEAR=1992,
REFERENCES=20,
KEYWORDS="In; intelligent network",
ABSTRACT="In order to make the implementation of network components
flexible and cost effective, it is required to use widely available
technologies asw the implementation platform. The distributed operating
systems can be adopted as such a platform, because they allow to
implement a network component using multiple computers connected through
a local area network. In this paper, we focus on the Intelligent Network
(IN) whose network components are model",
}

@ARTICLE{Gerl92:Fault,
AUTHOR="M. Gerla and P. Camarda and G. Chiaretti",
TITLE="Fault Tolerant {PON} Topologies",
JOURNAL=infocom,
ADDRESS="Florence, Italy",
PAGES="49-56",
YEAR=1992,
REFERENCES=11,
KEYWORDS="Fault tolerance; network topology",
ABSTRACT="In this paper we propose a redundant, tree structured PON
configuration which can withstand all single and most double link
failures. The redundant configuration results from the superposition of
two physically separate, diverse-routed trees.This redundancy is
transparent to the user. It does not require switching elements nor
special controls inside the network. Furthermore, it permits easy
identification of the fault by the NCC. Fault toleran",
}

@INPROCEEDINGS{Guar92:GSM,
AUTHOR="E. Guarene and M. C. Ciancetta and T. Di Stefano",
TITLE="{IN} and {GSM} integration for Personal Communication Services
provision",
BOOKTITLE="Int. Council for Computer Communication Intelligent Networks
Conf. (Ed. P.W. Bayliss)",
PAGES="290-299",
YEAR=1992,
KEYWORDS="In; intelligent network; service integration",
ABSTRACT="The Personal Communication Services (PCS) will make available
to users the ability to tailor telecommunication services in a manner
which will satisfy the user's individual needs at any time and
independently from the user's current location. At this point in time
the pan-European mobile service (GSM) is being a reality; on the other
hand Intelligent Networks are developed in many countries, looking for
providing IN services in a short time. Un",
}

@BOOK{Hals92:Data,
AUTHOR="F. Halsall",
TITLE="Data Communications, Computer Networks and Open Systems: 3rd
edition",
ISBN="0-201-56506-4",
PUBLISHER="Electronic Systems Engineering Series, Addison-Wesley",
ADDRESS="Wokingham, Great Britain",
YEAR=1992,
KEYWORDS="Computer network; data communication; interconnection; open
system; osi; protocol; tcp/ip",
ABSTRACT="The new edition of this very successful book has been
extensively updated to keep abreast with the rapid developments that
have taken place in the fields of Data Communications, Computer Networks
and Computer Communications. These include dynamic data compression,
digital leased circuits, high-speed networks (FDDI and DQDB), bridges
and routers, and the increasingly important subject of internetworking.
The TCP/IP protocol suite has now been ad",
}

@BOOK{Hero92:LEX,
AUTHOR="H. Herold",
TITLE="{LEX} und {YACC}",
ISBN="3-89319-382-0",
PUBLISHER="Addison-Wesley",
ADDRESS="Bonn, Germany",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="Application; compiler; parsing method; programming; software;
survey; unix",
}

@INPROCEEDINGS{Imie92:Querying,
AUTHOR="T. Imielinski and Badri Nath",
TITLE="Querying in highly mobile distributed environments",
BOOKTITLE="18th Very Large Databases (VLDB) Conference",
ADDRESS="Vancouver, Brit. Co., Canada",
YEAR=1992,
KEYWORDS="Distributed database; mobile radio; performance evaluation;
simulation",
ABSTRACT="New challenges to the database field brought about by the
rapidly growing area of wireless personal communication are presented.
Preliminary solutions to two of the major problems, control of update
volume and integration of query processing and data acquisition, are
discussed along with the simulation results.",
}

@INPROCEEDINGS{John92:Test,
AUTHOR="L. A. Johns",
TITLE="Test Strategies for Rapid Service Creation",
BOOKTITLE="Int. Council for Computer Communication Intelligent Networks
Conf. (Ed. P.W. Bayliss)",
PAGES="183-191",
YEAR=1992,
KEYWORDS="In; intelligent network; testing",
ABSTRACT="This article presents considerations for testing strategies in
support of rapid service creation. Service creation in today's
intelligent telecommunications networks requires excessive time and
expense. Timely entry of highly reliable services into the market with
acceptable price performance characteristics requires careful risk
assessment at each phase of service development. full product testing
assures that all aspects of the service perfor",
}

@INPROCEEDINGS{Koli92:Personal,
AUTHOR="M. V. Kolipakam and B. P. Murphy",
TITLE="Personal communications services using the intelligent network",
BOOKTITLE="Int. Council for Computer Communication Intelligent Networks
Conf. (Ed. P.W. Bayliss)",
PAGES="384-390",
YEAR=1992,
REFERENCES=7,
KEYWORDS="In; intelligent network; mobile radio; network architecture;
standardization",
ABSTRACT="This paper explores the driving forces behind Personal
Communications an how the Intelligent Network (IN) architecure can be
used to support Personal Communications Services.",
}

@ARTICLE{Lamb92:Perspectives,
AUTHOR="Livio Lambarelli and R. Melen and Daniele Roffinella",
TITLE="Perspectives on high speed networks and services",
JOURNAL="CSELT Technical reports",
ADDRESS="Italy",
VOLUME="20,6",
PAGES="465-471",
YEAR=1992,
REFERENCES=8,
KEYWORDS="Hslan; service characterization",
ABSTRACT="The paper analyzes the present evolution trends of high speed
networks. The market factors influencing the demand for high speed
services coming from the business customer segment are brieflyreview. A
review is made of the key technologies on which the evolution of the
public high speed networks will be based, emphasizing the early
availability of equipments and the situation of standards.",
}

@PHDTHESIS{Lee92:Formal,
AUTHOR="Andrew Lee",
TITLE="Formal Specification and Analysis of Intelligent Network Services
and their Interaction",
SCHOOL="University of Queensland, Philosophy",
ADDRESS="Australia",
YEAR=1992,
KEYWORDS="Formal technique; intelligent network; interaction model;
specification; specification language; switching system; telephony",
ABSTRACT="The main goal of this thesis is to demonstrate the use of
formal specifications of services to analyse interaction. The thesis
also has two secondary goals, namely, 1. to demonstrate how an existing
system, such as the basic telephone network, can be formally specified,
and 2. to demonstrate the use of object-oriented principles to extend
the bspecification of a basic system to include additional services.",
}

@BOOK{Leig92:Parallel,
AUTHOR="F. T. Leighton",
TITLE="Introduction to parallel algorithms and architectures: arrays,
trees, hypercubes",
ISBN="1-55860-117-1",
PUBLISHER="Morgan Kaufmann Publishers",
ADDRESS="San Mateo, California",
YEAR=1992,
REFERENCES=263,
KEYWORDS="Array processor; computer architecture; hypercube; parallel
algorithm; shuffle exchange; tree network",
}

@INPROCEEDINGS{Mizu92:Service,
AUTHOR="Osamu Mizuno and Y. Niitsu and M. Okamoto",
TITLE="Service Specification Description and Service Logic Program
Generation for Intelligent Networks",
BOOKTITLE="Int. Council for Computer Communication Intelligent Networks
Conf. (Ed. P.W. Bayliss)",
PAGES="430-440",
YEAR=1992,
REFERENCES=6,
KEYWORDS="Automatic program generation; in; intelligent network;
specification",
ABSTRACT="This paper describes a comuter-aided service creation
environemnt (CSCE) which is used for new service creation in INs and is
designed for use by telephone companies. It consists of a multi-step
service specification description system for the planing and design
stage, a stepwise scenario generation system for the coding stage and a
prototyping system for the testing stage. The multi-step service
specification description system allows service",
}

@BOOK{Moul92:GSM,
AUTHOR="M. Mouly and M.-B. Pautet",
TITLE="The {GSM} System for Mobile Communications",
PUBLISHER="published by the authors",
ADDRESS="France",
YEAR=1992,
KEYWORDS="Architecture; mobile radio; network management; overview;
radio channel; signalling; standardization",
}

@ARTICLE{Neuf92:Overview,
AUTHOR="G. W. Neufeld and Son Vuong",
TITLE="An overview of {ASN.1}",
JOURNAL=cnis,
ADDRESS="Netherlands",
VOLUME=24,
PAGES="393-415",
YEAR=1992,
KEYWORDS="Asn.1; formal technique; protocol specification",
ABSTRACT="In order for communication to occur, it is necessary to
specify the type and format of the information to be exchanged. In
general, distributed application protocols use very complex types of
information. It is therefore useful to have a formal tool that permits
the precise definition of the types of information exchanged. It is also
useful to have a set of rules that specify the format of the values for
each of the types. Each instance or valu",
}

@ARTICLE{Niit92:Computer,
AUTHOR="Y. Niitsu and Osamu Mizuno",
TITLE="Computer Aided Stepwise Service Creation for the Intelligent
Network",
JOURNAL=ieice_communications,
ADDRESS="Japan",
VOLUME="E75-B",
PAGES="969-977",
YEAR=1992,
REFERENCES=8,
KEYWORDS="In; intelligent network",
ABSTRACT="This paper describes a computer-aided service creation
environment (CSCE) for the intelligent network which supports easier
graphical specification description for services designers of various
skill levels, and service logic program (SLP) generation, message
sequence chart description language (LSDL: Layered Service Specification
Description Language), computer-aided sophisticated interface (IEDs:
Intelligent Editors), automatic specification",
}

@MANUAL{Anon92:Handbuch,
AUTHOR="Anonymous",
TITLE="{IT-Sicherheitshandbuch:} Handbuch für die sichere Anwendung der
Informationstechnik, Version 1.0",
PUBLISHER="BSI; 7105, (Bundesamt für Sicherheit)",
ADDRESS="Bonn, Germany",
YEAR=1992,
LANGUAGE="German",
REFERENCES=32,
KEYWORDS="Information system; security",
ABSTRACT="Das hier vorgelegte IT-Sicherheitshandbuch gehört mit den
IT-Sicherheitskriterien und dem IT-Evaluationshandbuch zu den drei
Grundlagenwerken der IT-Sicherheit, die vom Bundesamt für Sicherheit in
der Informationstechnik herausgegeben worden sind.",
}

@INPROCEEDINGS{ORei92:GTE,
AUTHOR="Peter O'Reilly and R. Sivey",
TITLE="{GTE's} Intelligent Network Testbed",
BOOKTITLE="Int. Council for Computer Communication Intelligent Networks
Conf. (Ed. P.W. Bayliss)",
PAGES="114-127",
YEAR=1992,
REFERENCES=11,
KEYWORDS="In; intelligent network; testing",
ABSTRACT="An Intelligent Network Testbed under development by GTE is
described in this paper. The Testbed is based on the Advanced
Intelligent Network (AIN) Release 1 architecture, as proposed by
Bellcore, and includes prototypes of AIN Switch Capabilities (on a GTD-5
switching system), Service Logic Execution Environment, Service Creation
Environment, and Service Management System. The Call Model implemented
in the first phase of Testbed development rep",
}

@ARTICLE{Ohns92:Optoelektronische,
AUTHOR="H. Ohnsorge and H. Haupt and P. Desombre",
TITLE="Optoelektronische Bauelemente und Systeme von morgen",
JOURNAL="Elektrisches Nachrichtenwesen, ALCATEL",
ADDRESS="Stuttgart, Germany",
VOLUME=4,
PAGES="78-84",
YEAR=1992,
LANGUAGE="German",
REFERENCES=42,
KEYWORDS="Fiber optics; network; optical switching; technology",
}

@BOOK{Petk92:INGRES,
AUTHOR="D. Petkovic",
TITLE="{INGRES} Das relationale Datenbanksystem mit Knowledge-Base und
Object-Base",
ISBN="3-89319-385-5",
PUBLISHER="Addison-Wesley",
ADDRESS="Germany",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="Database; software",
ABSTRACT="Das Thema des Buches sind folgende INGRES-Produkte: -
INGRES/SQL, - INGRES/QBF, - INGRES/RBF und Report-Writer, -
INGRES/VIGRAPH, ESQL/C bzw. ESQL/COBOL, - Knowledge Management, - Object
Management, - INGRES/NET bzw. INGRES/STAR und - INGRES/Gateways, in der
Version 6.3",
}

@INPROCEEDINGS{Ratn92:Pricing,
AUTHOR="J. Ratnatunga and J. de Silva and P. Tam",
TITLE="Pricing in Intelligent Routing Networks",
BOOKTITLE="Int. Council for Computer Communication Intelligent Networks
Conf. (Ed. P.W. Bayliss)",
PAGES="524-551",
YEAR=1992,
KEYWORDS="In; intelligent network",
ABSTRACT="The exponential growth in demand for international
communication services has resulted in capacity constraints and
congestion in existing networks. Simultaneously the practice of
installing additional capacities to service demand in the form of
traditional direct links tends to reduce the overall network
utilisatioin and return on investment. The development of intelligent
routing information systems, such as the Asia Pacific
Telecommunications",
}

@ARTICLE{Rede92:Abschied,
AUTHOR="B. Reder",
TITLE="Abschied vom Kabel?",
JOURNAL="Elektronik",
ADDRESS="Germany",
VOLUME=3,
PAGES="58-65",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="Mobile radio; packet radio",
ABSTRACT="Der Trend in Richtung drahtlose Datenubertragung hat nicht nur
die Telefone erfaßt. Mittlerweile gibt es auch bei lokalen Netzen (LANs)
eine Reihe von Systemen, die ohne Kabel auskommen. Zwei Technologien
dominieren gegen- wärtig: Einige Hersteller setzen auf Funk, die anderen
auf Infrarot. Wer letztendlich das Rennen ma- chen wird, ist noch
offen.",
}

@BOOK{Reha92:Fachwörterbuch,
AUTHOR="J. P. Rehahn",
TITLE="Fachwörterbuch Telekommunikation Englisch-Deutsch-Französisch",
PUBLISHER="Verlag Alexandre Hatier",
ADDRESS="Germany",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="Communication; dictionary; reference",
}

@INPROCEEDINGS{Rose92:European,
AUTHOR="K.-H. Rosenbrock",
TITLE="European Standards for the Intelligent Network",
BOOKTITLE="Int. Council for Computer Communication Intelligent Networks
Conf. (Ed. P.W. Bayliss)",
PAGES="2-16",
YEAR=1992,
KEYWORDS="In; intelligent network; standard; standardization",
ABSTRACT="In order to properly deal with the title of this paper, the
contribution will be divided into three main parts: (1) an introduction
into the European Telecommunications Standards Institute (ETSI), its
history, objectives, members, structure and its management as well as
the results achieved so far, (2) a short description of the main
characteristics of an intelligent network, and (3) ETSI's contribution
to the international standardisation of a",
}

@ARTICLE{Schd92:CRMA,
AUTHOR="W. Schödl and M. Tangemann",
TITLE="Performance evaluation of {CRMA}",
JOURNAL="Proceedings of the EFOC/LAN 92",
PAGES="170-174",
YEAR=1992,
KEYWORDS="Crma; hslan; lan; performance evaluation",
}

@ARTICLE{Schu92:Deutsche,
AUTHOR="K. Schulz and H. Kaufer and B. Heilig",
TITLE="The Deutsche Bundespost Telekom Implements {IN}",
JOURNAL="IEEE Communications Magazine Intelligent Networks",
VOLUME="1,2",
PAGES="90-96",
YEAR=1992,
KEYWORDS="Implementation; in; intelligent network",
}

@INPROCEEDINGS{Vand92:Distributed,
AUTHOR="W. Van den Broek and E. Buitenwerf",
TITLE="Distributed database for third generation mobile systems",
BOOKTITLE="Int. Council for Computer Communication Intelligent Networks
Conf. (Ed. P.W. Bayliss)",
PAGES="333-347",
YEAR=1992,
REFERENCES=9,
KEYWORDS="Cellular system; data; database; distributed database;
distributed system; IN; intelligent network; mobile radio; network
architecture",
ABSTRACT="... This paper briefly describes the basic concepts of UMTS,
and focuses on the results achieved in the area of the UMTS distributed
database. ... In particular, this paper describes the fragmentation of
user and terminal related data, the allocation of fragments onto the
nodes of the distributed database, and the locating strategy ... The
Intelligent Network (IN) seems to be themost suitable vehicle for
implementing UMTS. ...",
}

@BOOK{Wolf92:Meßtechnik,
AUTHOR="A. Wolf",
TITLE="Meßtechnik für das {BISDN}",
PUBLISHER="vde verlag",
ADDRESS="Germany",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="B-isdn; coding theory; measurement",
}

@BOOK{Wolf92:Keine,
AUTHOR="C. Wolfinger",
TITLE="Keine Angst vor {UNIX}",
PUBLISHER="VDI Verlag",
ADDRESS="Germany",
YEAR=1992,
LANGUAGE="German",
KEYWORDS="Operating system; overview",
}

@BOOK{Wu92:Fiber,
AUTHOR="T.-H. Wu",
TITLE="Fiber Network Service Survivability",
ISBN="0-89006-469-5",
PUBLISHER="The Artech House Telecommunications Library, Artech House",
ADDRESS="Boston, Massachusetts",
YEAR=1992,
KEYWORDS="Atm; cross connect; dynamic reconfiguration; fiber optics;
network planning; optical switching; reconfigurable network; SDH;
virtual path",
ABSTRACT="The increased deployment of optical fiber transmission systems
with very large cross-connections supported on a few strands of fiber
and the trend toward more sophisticated software-controlled networks
have increased concern about the survivability of high-capacity fiber
communications networks for any single point of failure. This concern
arises because service disruption causes both tangible and intangible
loss for users as well as for servi",
}

@ARTICLE{Toma9201:Desert,
AUTHOR="Joseph S. Toma",
TITLE="Desert Storm Communications:",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=1,
PAGES="19-21",
MONTH="Jan",
YEAR=1992,
KEYWORDS="Desert Storm Communications; military communications",
ABSTRACT="Building a high-traffic military communications system in a
few weeks was a triumph of technology, training, and streamlined
joint-command relationships.",
}

@ARTICLE{Slup9201:DISA,
AUTHOR="Jean M. Slupik",
TITLE="{DISA} Comes Through",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=1,
PAGES="22-25",
MONTH="Jan",
YEAR=1992,
KEYWORDS="DISA; Defense Information Systems Agency; military
communications",
ABSTRACT="The Defense Information Systems Agency merged commercial and
military communications systems into a fully integrated network for the
world's highest-technology battlefield.",
}

@ARTICLE{Frak9201:Point,
AUTHOR="Patrick F. Frakes",
TITLE="The Point of the Spear",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=1,
PAGES="26-29",
MONTH="Jan",
YEAR=1992,
KEYWORDS="military communications",
ABSTRACT="Command and control communications was no theoretical exercise
for the 24th Infantry Division during Operation Desert Storm",
}

@ARTICLE{ONei9201:Rapid,
AUTHOR="David P. O'Neil",
TITLE="The Rapid Deployment Digital Satellite Network",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=1,
PAGES="30-35",
MONTH="Jan",
YEAR=1992,
KEYWORDS="Digital Satellite Network; military communications",
ABSTRACT="The Ground Mobile Forces satellite digital multichannel radio
provided the U.S. Marine Corps with the primary transmission links for
its Switched Backbone.",
}

@ARTICLE{Sale9201:Desert,
AUTHOR="Donald Salerno and Thomas F. I. I. Washer",
TITLE="Desert Storm: Air Assault Communications",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=1,
PAGES="36-41",
MONTH="Jan",
YEAR=1992,
KEYWORDS="Air Assault Communications; Military communications",
ABSTRACT="From a single telephone extension, the 10lst Airborne's
communications system quickly grew to support offensive operations deep
inside Iraq",
}

@ARTICLE{Mcke9201:Air,
AUTHOR="Duncan D. Mckenzie",
TITLE="{U.S.} Air Force Communications in Desert Storm",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=1,
PAGES="42-47",
MONTH="Jan",
YEAR=1992,
KEYWORDS="U.S. Air Force; Communications; Desert Storm; military",
ABSTRACT="The largest tactical communications system ever assembled was
crucial to the overwhelming defeat of the Coalition's adversaries.",
}

@ARTICLE{Tutt9201:C4I,
AUTHOR="Jerry O. Tuttle",
TITLE="{C4I} For The 21st Century",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=1,
PAGES="48-51",
MONTH="Jan",
YEAR=1992,
KEYWORDS="C4I; global security",
ABSTRACT="A complex new world order demands new tech- nology, new
doctrine, and new approaches to global security.",
}

@ARTICLE{Gibs9201:Developing,
AUTHOR="Tim Gibson",
TITLE="Developing a Command and Control System in War",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=1,
PAGES="52-57",
MONTH="Jan",
YEAR=1992,
KEYWORDS="Command and Control System; War; military communications",
ABSTRACT="The latest advances in computer communications technology were
put to their first wartime test during Operation Desert Storm.",
}

@ARTICLE{Wall9201:HF,
AUTHOR="Michael A. Wallace",
TITLE="{HF} Radio in Southwest Asia",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=1,
PAGES="58-61",
MONTH="Jan",
YEAR=1992,
KEYWORDS="HF Radio; Southwest Asia; satellite communications",
ABSTRACT="United States Marines who mastered the operational lessons of
the 1980s made HF radio a valuable alternative to satellite
communications during Desert Storm.",
}

@ARTICLE{Bren9201:Tactical,
AUTHOR="Joseph A. Brendler",
TITLE="Tactical Military Communications",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=1,
PAGES="62-72",
MONTH="Jan",
YEAR=1992,
KEYWORDS="Military Communications",
ABSTRACT="The U.S. Army's ``Battlefield Information Architecture'' will
make today's systems look as primitive as the grease pencils and
crank-to-ring telephones of thirty years ago look to us.",
}

@ARTICLE{Berm9202:Perspectives,
AUTHOR="R. K. Berman and J. H. Brewster",
TITLE="Perspectives on the {AIN} Architecture",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=2,
PAGES="27-33",
MONTH="Feb",
YEAR=1992,
KEYWORDS="AIN Architecture; Advanced Intelligent Network",
ABSTRACT="History, architecture, and evolution provide three points from
which to view the Advanced Intelligent Network.",
}

@ARTICLE{Dura9202:International,
AUTHOR="J. M. Duran and J. Visser",
TITLE="International Standards for Intelligent Networks",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=2,
PAGES="34-43",
MONTH="Feb",
YEAR=1992,
KEYWORDS="International Standards; Intelligent Networks; IN",
ABSTRACT="The CCITT's Capability Set 1 Defines the Scope and Content of
INs for the Near Term without Curtailing Subsequent Growth",
}

@ARTICLE{Cain9202:Managing,
AUTHOR="Michael Cain",
TITLE="Managing Run-Time Interactions Between Call-Processing Features",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=2,
PAGES="44-51",
MONTH="Feb",
YEAR=1992,
KEYWORDS="Call-Processing",
ABSTRACT="Separating features from their interactions provides a robust
feature set",
}

@ARTICLE{Bran9202:Handling,
AUTHOR="Jorge A. Brana and Anand S. Ramani and Pantelis H. Vapheas",
TITLE="Handling Switch-Detected Application-Level Errors in {AIN}",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=2,
PAGES="52-57",
MONTH="Feb",
YEAR=1992,
KEYWORDS="advanced intelligent network; Switch-Detected;
Application-Level Errors; AIN",
ABSTRACT="Application-Level Errors in AIN The advanced intelligent
network permits the rapid introduction of custom services, but requires
a consistent and robust error-handling strategy",
}

@ARTICLE{Pezz9202:Operations,
AUTHOR="David A. Pezzutti",
TITLE="Operations Issues for Advanced Intelligent Networks",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=2,
PAGES="58-63",
MONTH="Feb",
YEAR=1992,
KEYWORDS="AIN; Advanced Intelligent Networks",
ABSTRACT="AIN's software-defined services provide efficient,
cost-effective network operations",
}

@ARTICLE{Jabb9202:Intelligent,
AUTHOR="Bijan Jabbarin",
TITLE="Intelligent Network Concepts in Mobile Communications",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=2,
PAGES="64-69",
MONTH="Feb",
YEAR=1992,
KEYWORDS="Intelligent Network; Mobile Communications",
ABSTRACT="An examination of IN as it is currently being employed in
mobile cellular networks",
}

@ARTICLE{Homa9202:Intelligent,
AUTHOR="J. Homa and S. J. Harris",
TITLE="Intelligent Networks for Personal Communications Services",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=2,
PAGES="70-77",
MONTH="Feb",
YEAR=1992,
KEYWORDS="Intelligent Networks; Personal Communications Services",
ABSTRACT="INs need the components that will get PCS off to a fast,
profitable start",
}

@ARTICLE{Hase9202:Service,
AUTHOR="E. F. Haselton",
TITLE="Service-Creation Environments for Intelligent Networks",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=2,
PAGES="78-81",
MONTH="Feb",
YEAR=1992,
KEYWORDS="Service-Creation Environments; Intelligent Networks",
ABSTRACT="Service-creation environments promise far-reaching advances in
IN telecommunications technology",
}

@ARTICLE{Coll9202:Intelligent,
AUTHOR="P. Collet and Roberto Kung",
TITLE="The Intelligent Network in France",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=2,
PAGES="82-89",
MONTH="Feb",
YEAR=1992,
KEYWORDS="Intelligent Network;IN; France",
ABSTRACT="IN is a key element of France Telecom's network, but major
technical issues must be solved to ensure IN's successful evolution.",
}

@ARTICLE{Ravi9203:Telecommunications,
AUTHOR="N. Ravi",
TITLE="Telecommunications in India",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=3,
PAGES="24-29",
MONTH="Mar",
YEAR=1992,
KEYWORDS="Telecommunications; India",
ABSTRACT="Pent-up demand, partial deregulation, and new technology have
set the stage for rapid telecom growth on the subcontinent",
}

@ARTICLE{Arre9203:Future,
AUTHOR="Gaston A. Arredondo",
TITLE="The Future of Subrate Data Private Line Networking",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=3,
PAGES="30-35",
MONTH="Mar",
YEAR=1992,
KEYWORDS="Subrate Data Private Line Networking; telecommunications",
ABSTRACT="This old technology fills niches in today's telecommunications
landscape with impressive cost-effectiveness",
}

@ARTICLE{Zerb9203:Considering,
AUTHOR="Zerbiec",
TITLE="Considering the Past and Anticipating the Future for Private Data
Networks",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=3,
PAGES="36-47",
MONTH="Mar",
YEAR=1992,
KEYWORDS="Private Data Networks",
ABSTRACT="Private networks now carry more data than voice, and
depreciation periods are measured in years instead of decades",
}

@ARTICLE{Cava9203:Applying,
AUTHOR="James P. Cavanagh",
TITLE="Applying the Frame Relay interface to Private Networks",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=3,
PAGES="48-65",
MONTH="Mar",
YEAR=1992,
KEYWORDS="Frame Relay interface; Private Networks",
ABSTRACT="This standardized interface provides economical multiplexed
access to backbone networks",
}

@ARTICLE{Tayl9203:Frame,
AUTHOR="Steven A. Taylor",
TITLE="Frame Transport Systems",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=3,
PAGES="66-71",
MONTH="Mar",
YEAR=1992,
KEYWORDS="Frame Transport Systems; private networks",
ABSTRACT="Are speed and efficiency enough to make frame transport
systems the next generation of private networks?",
}

@ARTICLE{Bros9203:Virtual,
AUTHOR="Jeffery J. Brosemer and Deborah J. Enright",
TITLE="Virtual Networks: Past, Present and Future",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=3,
PAGES="80-85",
MONTH="Mar",
YEAR=1992,
KEYWORDS="Virtual Networks",
ABSTRACT="Virtual networks offer many more features than physical
networks and cost a lot less",
}

@ARTICLE{Pyle9203:Planning,
AUTHOR="Raymond H. Pyle and Sidney J. Yules",
TITLE="Planning Corporate Networks for an Integrated Information
Environment",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=3,
PAGES="86-89",
MONTH="Mar",
YEAR=1992,
KEYWORDS="Corporate Networks; Integrated Information Environment",
ABSTRACT="Data is a critical corporate asset that is most valuable in an
integrated information environment",
}

@ARTICLE{Klei9204:LatencylBandwidth,
AUTHOR="L. Kleinrock",
TITLE="The LatencylBandwidth Tradeoff in Gigabit Networks",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=4,
PAGES="36-41",
MONTH="Apr",
YEAR=1992,
KEYWORDS="Latency; Bandwidth Tradeoff; Gigabit Networks",
ABSTRACT="Gigabit networks really are different!",
}

@ARTICLE{McDo9204:Public,
AUTHOR="John McDonald",
TITLE="Public Networks -- Dependable?",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=4,
PAGES="110-112",
MONTH="Apr",
YEAR=1992,
KEYWORDS="Public Networks; network quality",
ABSTRACT="In this keynote address to the 1991 ICC, a Communications
Society Past President discusses the reliability of public networks, and
proposes a measurement for network quality.",
}

@ARTICLE{Kret9205:Standardizing,
AUTHOR="Francis Kretz and Francoise Colaitis",
TITLE="Standardizing Hypermedia Information Objects",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=5,
PAGES="60-71",
MONTH="May",
YEAR=1992,
KEYWORDS="Standardization; Hypermedia Information Objects; real-time;
interactive communication",
ABSTRACT="ISO's Multimedia and Hypermedia Information Coding Expert
Group is establishing standards for real-time interactive communicating
applications.",
}

@ARTICLE{Wimm9206:Global,
AUTHOR="Klaus Wimmer and John Jones",
TITLE="Global Development of {PCS}",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=6,
PAGES="22-27",
MONTH="Jun",
YEAR=1992,
KEYWORDS="Global Development; PCS",
ABSTRACT="Technical developments will revolutionize worldwide
person-to-person communication -- once spectrum and incumbency issues
are resolved.",
}

@ARTICLE{Sand9206:New,
AUTHOR="Britton Sanderford Jr",
TITLE="New Markets Emerge as {PCN} Reduces Wireless Link Costs",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=6,
PAGES="28-33",
MONTH="Jun",
YEAR=1992,
KEYWORDS="PCN; Wireless Link Costs",
ABSTRACT="If system goals are not overspecified, spread-spectrum
performance can be optimized at a minimal system cost.",
}

@ARTICLE{Lipm9206:Leaping,
AUTHOR="Andrew D. Lipman",
TITLE="Leaping from the Barricades",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=6,
PAGES="34-37",
MONTH="Jun",
YEAR=1992,
KEYWORDS="spectrum allocation; telecommunications",
ABSTRACT="The U.S. FCC's initiative to allocate spectrum for emerging
technologies puts the United States on the brink of a telecommunications
revolution.",
}

@ARTICLE{Orme9206:Ideal,
AUTHOR="John Ormerod and Alex Butterworth",
TITLE="The Ideal Communications Service",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=6,
PAGES="38-43",
MONTH="Jun",
YEAR=1992,
KEYWORDS="PCN; European telecommunications; Communications Service",
ABSTRACT="The European telecommunications industry can harvest large
profits by implementing PCN in Europe - and gain a preeminent position
for implementing the technology in other world markets.",
}

@ARTICLE{Adam9206:WARC,
AUTHOR="Danny E. Adams and Colin Frank",
TITLE="{WARC} Embraces {PCN}",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=6,
PAGES="44-47",
MONTH="Jun",
YEAR=1992,
KEYWORDS="Warc; pcn",
ABSTRACT="An eleventh-hour compromise broke a U.S.-European deadlock at
the recent World Administrative Radio Conference.",
}

@ARTICLE{Tayl9206:PCS,
AUTHOR="J. Taylor",
TITLE="{PCS} in the {U.S.} and Europe",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=6,
PAGES="48-52",
MONTH="Jun",
YEAR=1992,
KEYWORDS="PCS; U.S.; wireless",
ABSTRACT="Goaded by Europe and fearful of Japan, the U.S. has leaped
onto the wireless bandwagon.",
}

@ARTICLE{Hard9206:Personal,
AUTHOR="G. Todd Hardy",
TITLE="Personal Communications Services",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=6,
PAGES="53-55",
MONTH="Jun",
YEAR=1992,
KEYWORDS="Personal Communications Services",
ABSTRACT="PCS will compete with wired and cellular networks by offering
unique services -- if the FCC licenses them.",
}

@ARTICLE{Erce9206:Urban,
AUTHOR="Vinko Erceg and Saeed S. Ghassemzadeh and M. C. Taylor and Dong
Li and Donald L. Schilling",
TITLE="Urban/Suburban Out-of-Sight Propagation Modeling",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=6,
PAGES="56-61",
MONTH="Jun",
YEAR=1992,
KEYWORDS="Urban; Suburban; Out-of-Sight Propagation Modeling",
ABSTRACT="Urban thoroughfares are mean streets for 2-GHz propagation,
but a new model can help designers.",
}

@ARTICLE{Kher9207:Managing,
AUTHOR="Shaygan Kheradpir and Willis Stinson and Renu Chipalkatti and
greg Bossert",
TITLE="Managing the Network Manager",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=7,
PAGES="12-21",
MONTH="Jul",
YEAR=1992,
KEYWORDS="Network Manager; network management simulators",
ABSTRACT="As networks grow in complexity and intelligence, network
management simulators will help NMs grow with the networks they
manage.",
}

@ARTICLE{Sher9207:Standards,
AUTHOR="M. H. Sherif and Duncan Sparrell",
TITLE="Standards and innovation in Telecommunications",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=7,
PAGES="22-29",
MONTH="Jul",
YEAR=1992,
KEYWORDS="standards; Telecommunications",
ABSTRACT="The decreasing role of central authorities enhances the need
for timely and exacting voluntary standards.",
}

@ARTICLE{Ford9207:Public,
AUTHOR="Warwick S. Ford and Brian O'Higgins",
TITLE="Public-Key Cryptography and Open Systems interconnection",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=7,
PAGES="30-35",
MONTH="Jul",
YEAR=1992,
KEYWORDS="Public-Key Cryptography; Open Systems interconnection",
ABSTRACT="Interconnectivity offers users remarkable possibilities, but
it must not compromise the security of users' resources.",
}

@ARTICLE{Suth9207:Residential,
AUTHOR="Joe Sutherland and Larry Litteral",
TITLE="Residential Video Services",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=7,
PAGES="36-41",
MONTH="Jul",
YEAR=1992,
KEYWORDS="Residential Video Services",
ABSTRACT="Delivering video information to the home has changed little in
40 years, but digital video may soon change the TV-watching
experience--and the players delivering the software.",
}

@ARTICLE{Yazi9207:Congestion,
AUTHOR="Setiadi Yazid and Hussein Mouftah",
TITLE="Congestion Control Methods for {BISDN}",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=7,
PAGES="42-47",
MONTH="Jul",
YEAR=1992,
KEYWORDS="Congestion Control Methods for BISDN",
ABSTRACT="When several traffic classes are provided on a multimedia
communication network, congestion control must provide different service
guarantees for each class.",
}

@ARTICLE{Habi9207:Multimedia,
AUTHOR="Ibrahim Habib and T. N. Saadawi",
TITLE="Multimedia Traffic Characteristics in Broadband Networks",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=7,
PAGES="48-55",
MONTH="Jul",
YEAR=1992,
KEYWORDS="Multimedia Traffic; Broadband Networks; congestion-control
algorithms",
ABSTRACT="Practical congestion-control algorithms require knowledge of
traffic correlations and burstiness.",
}

@ARTICLE{Soko9207:Telecommunications,
AUTHOR="N. Sokolov",
TITLE="Telecommunications in Russia",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=7,
PAGES="66-70",
MONTH="Jul",
YEAR=1992,
KEYWORDS="Telecommunications; Russia",
ABSTRACT="The need for additional capacity, improved quality, and
enhanced technology is a serious problem - and a vast opportunity.",
}

@ARTICLE{Bete9208:Working,
AUTHOR="Vincent L. Betes",
TITLE="Working at Home",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=8,
PAGES="14-16",
MONTH="Aug",
YEAR=1992,
KEYWORDS="Working at Home; ISDN; Telecommuting",
ABSTRACT="Telecommuting and ISDN could do a lot for each other -- but
nobody seems to realize it.",
}

@ARTICLE{Take9208:Personalizing,
AUTHOR="Takebayashi",
TITLE="Personalizing {ISDN}",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=8,
PAGES="17-19",
MONTH="Aug",
YEAR=1992,
KEYWORDS="Isdn",
ABSTRACT="ISDN can offer great benefits to personal and small-business
users, but only if those benefits come with a flexibility and analog
compatibility.",
}

@ARTICLE{Hunt9208:ISDN,
AUTHOR="John D. Hunter and William W. Ellington",
TITLE="{ISDN:} A Customer Perspective",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=8,
PAGES="20-23",
MONTH="Aug",
YEAR=1992,
KEYWORDS="Isdn",
ABSTRACT="Large customers still want ISDN, but they need a common global
protocol, a consistent API, and an attractive cost-benefits ratio.",
}

@ARTICLE{Edwa9208:Computer,
AUTHOR="Larry Edwards",
TITLE="Computer-Assisted Applications",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=8,
PAGES="38-41",
MONTH="Aug",
YEAR=1992,
KEYWORDS="Computer-Assisted Applications",
ABSTRACT="Companies that link their telephone systems to computers can
offer improved customer service while obtaining greater productivity.",
}

@ARTICLE{Waki9208:North,
AUTHOR="S. Wakid and Kamie Roberts",
TITLE="North American Agreements on {ISDN}",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=8,
PAGES="42-47",
MONTH="Aug",
YEAR=1992,
KEYWORDS="North American Agreements; ISDN",
ABSTRACT="The North American ISDN Users Forum is helping the various
interested parties in North America converge on a single abstract ISDN
specification.",
}

@ARTICLE{Temi9208:Numeris,
AUTHOR="Jean-Pierre Temime",
TITLE="{Numeris--ISDN} in France",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=8,
PAGES="48-53",
MONTH="Aug",
YEAR=1992,
KEYWORDS="ISDN; France",
ABSTRACT="Available nationwide since December 1990, France's explosively
growing ISDN network is sparking a lively business in ISDN products.",
}

@ARTICLE{Inou9208:Japan,
AUTHOR="Osamu Inoue",
TITLE="Implementation in Japan",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=8,
PAGES="54-57",
MONTH="Aug",
YEAR=1992,
KEYWORDS="Japan; ISDN",
ABSTRACT="NTT works closely with ISDN customers and equipment vendors to
develop more versatile applications and overcome obstacles to
increasingly widespread adoption.",
}

@ARTICLE{Ande9209:Neural,
AUTHOR="Jon Anderson",
TITLE="Neural-Network Leaning and Mark Twain's Cat",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=9,
PAGES="16-23",
MONTH="Sep",
YEAR=1992,
KEYWORDS="Neural networks",
ABSTRACT="Neural networks are remarkably good at answering questions
about things they haven't learned.",
}

@ARTICLE{Bezd9209:Computing,
AUTHOR="James C. Bezdek",
TITLE="Computing with Uncertainty",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=9,
PAGES="23-37",
MONTH="Sep",
YEAR=1992,
KEYWORDS="Neural networks; pattern recognition; fuzzy model",
ABSTRACT="Combining fuzzy models with computational neural networks
often improves computer performance in pattern recognition problems.",
}

@ARTICLE{Carp9209:Self,
AUTHOR="G. A. Carpenter and Stephen Grossberg",
TITLE="A Self-Organizing Neural Network For Supervised Learning,
Recognition, and Prediction",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=9,
PAGES="38-49",
MONTH="Sep",
YEAR=1992,
KEYWORDS="neural networks",
ABSTRACT="Can neural networks learn to recognize new objects without
forgetting familiar ones?",
}

@ARTICLE{Klim9209:Neural,
AUTHOR="Casimir C. Casey Klimasauskas",
TITLE="Neural Networks: An Engineering Perspective",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=9,
PAGES="50-",
MONTH="Sep",
YEAR=1992,
KEYWORDS="Neural Networks",
ABSTRACT="A hard-nosed engineer really can find applications in which
neural computing provides an advantage.",
}

@ARTICLE{Davi9210:Technologies,
AUTHOR="John Davis and N. Dinn and W. E. Falconer",
TITLE="Technologies for Global Communications",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=10,
PAGES="35-43",
MONTH="Oct",
YEAR=1992,
KEYWORDS="Global Communications",
ABSTRACT="The interaction of market demand for services and technical
innovation energizes the development of global communications.",
}

@ARTICLE{Hemr9210:Building,
AUTHOR="Christine Hemrick",
TITLE="Building Today's Global Computer Internetworks",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=10,
PAGES="44-49",
MONTH="Oct",
YEAR=1992,
KEYWORDS="Global Computer Internetworks",
ABSTRACT="Vendors must serve a worldwide customer base with
internetworking solutions that not only adapt to change, but exploit and
perpetuate it.",
}

@ARTICLE{Heil9210:Global,
AUTHOR="George H. Heilmeier",
TITLE="Global Begins at Home",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=10,
PAGES="50-57",
MONTH="Oct",
YEAR=1992,
KEYWORDS="information networking",
ABSTRACT="U.S. movement toward information networking is chaotic. A
national sense of purpose is required.",
}

@ARTICLE{Corr9210:Worldwide,
AUTHOR="F. P. Corr and J. J. Hunter",
TITLE="Worldwide Communications and Information Systems",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=10,
PAGES="58-63",
MONTH="Oct",
YEAR=1992,
KEYWORDS="Worldwide Communications; Information Systems; International
networks",
ABSTRACT="International networks have changed commercial and daily life;
the revolution has just begun.",
}

@ARTICLE{Toma9210:Global,
AUTHOR="Keisuke Tomaru and Toshiaki Tanaka and Takeki Katsube",
TITLE="Global Corporate Networks in Japan",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=10,
PAGES="64-69",
MONTH="Oct",
YEAR=1992,
KEYWORDS="Global Corporate Networks; Japan",
ABSTRACT="Global networks constructed by Japanese firms in the 1980s
have been essential to their success, but new technology is needed for
the 1990s.",
}

@ARTICLE{Rick9210:Regional,
AUTHOR="W. Rickard",
TITLE="{U.S.} Regional Holding Companies Reach Out to the World",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=10,
PAGES="70-73",
MONTH="Oct",
YEAR=1992,
KEYWORDS="worldwide communications network; NYNEX",
ABSTRACT="NYNEX and other RHCs, with their local partners, are
contributing to the development of a worldwide communications network.",
}

@ARTICLE{Lieb9210:Competition,
AUTHOR="Richard T. Liebhaber",
TITLE="Competition, Cooperation, and Change",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=10,
PAGES="74-77",
MONTH="Oct",
YEAR=1992,
KEYWORDS="Techonology; global telecommunications",
ABSTRACT="Technology, customer demand, and competition are creating a
revolution in global telecommunications that will dwarf the changes of
the 1980s.",
}

@ARTICLE{Gilb9210:Five,
AUTHOR="William E. Gilbert",
TITLE="The Five Challenges of Managing Global Networks",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=10,
PAGES="78-83",
MONTH="Oct",
YEAR=1992,
KEYWORDS="Global Networks",
ABSTRACT="To reach international markets, firms must use and manage
global networks more effectively.",
}

@ARTICLE{Radl9210:Vive,
AUTHOR="Peter Radley",
TITLE="Vive la difference!",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=10,
PAGES="84-89",
MONTH="Oct",
YEAR=1992,
KEYWORDS="telecommunication; worldwide network",
ABSTRACT="A healthy differentiation of telecommunication services --
especially in Europe -- must be based on a common infrastructure, but
the cooperative tradition of maintaining worldwide network integrity is
coming under strain.",
}

@ARTICLE{Rush9210:How,
AUTHOR="Charles M. Rush",
TITLE="How {WARC} '92 Will Affect Mobile Services",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=10,
PAGES="90-96",
MONTH="Oct",
YEAR=1992,
KEYWORDS="WARC '92; Mobile Services",
ABSTRACT="The recent international conference allocated frequencies to
improve mobile services; the U.S. must now adjust to the new
allocations.",
}

@ARTICLE{Taka9211:Engineering,
AUTHOR="Noriyuki Takahashi",
TITLE="Engineering Education in Japan",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=11,
PAGES="28-37",
MONTH="Nov",
YEAR=1992,
KEYWORDS="Engineering Education; Japan",
ABSTRACT="Japanese intellectuals want a change to more individualized
and creative education. Meta-engineering is a way to start.",
}

@ARTICLE{Dugg9211:Engineering,
AUTHOR="Terry V. Duggan",
TITLE="Engineering Education in Europe",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=11,
PAGES="38-43",
MONTH="Nov",
YEAR=1992,
KEYWORDS="Engineering Education; Europe",
ABSTRACT="The rich diversity of engineering education in Europe is a
great asset, but engineers must acquire special characteristics to
perform effectively in an integrated Europe.",
}

@ARTICLE{Mesa9211:French,
AUTHOR="Francois Mesa and Michel Savio and Antoine Sorba",
TITLE="The French System of Engineering Formation",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=11,
PAGES="44-49",
MONTH="Nov",
YEAR=1992,
KEYWORDS="French System; Engineering Education",
ABSTRACT="Deeply rooted in history, the unique French system of
engineering education has retained many of its original (if somewhat
confusing) characteristics.",
}

@ARTICLE{Habe9211:Engineering,
AUTHOR="Georg Habenicht and Georg Habenicht",
TITLE="Engineering Training in Germany",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=11,
PAGES="50-51",
MONTH="Nov",
YEAR=1992,
KEYWORDS="Engineering Training; Germany",
ABSTRACT="The university systems in the eastern and western parts of
Germany must be integrated; other changes in these mature systems will
be evolutionary.",
}

@ARTICLE{Rosk9211:Forming,
AUTHOR="Tamas Roska",
TITLE="Forming an Information Technology Department in Turbulent Times",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=11,
PAGES="52-57",
MONTH="Nov",
YEAR=1992,
KEYWORDS="Information Technology; Hungary",
ABSTRACT="Department in Turbulent Times In Hungary in 1990 a new kind of
engineering department was created as part of an exciting national
educational initiative.",
}

@ARTICLE{Fili9211:Engineering,
AUTHOR="J. Filipiak and A. R. Pach",
TITLE="Engineering Education in Poland",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=11,
PAGES="58-65",
MONTH="Nov",
YEAR=1992,
KEYWORDS="Engineering Education; Poland",
ABSTRACT="Poland's underfinanced system provides an excellent grounding
in mathematics and physics, but needs a modern curriculum and modern
laboratory equipment.",
}

@ARTICLE{Tell9211:History,
AUTHOR="Pedro Carlos da Silva Telles",
TITLE="A History of Engineering Education in Brazil",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=11,
PAGES="66-71",
MONTH="Nov",
YEAR=1992,
KEYWORDS="Engineering Education; Brazil",
ABSTRACT="The bicentennial of formal engineering education in Brazil is
a year of national educational crisis.",
}

@ARTICLE{Filh9211:Humanistic,
AUTHOR="Roberto Miscow Filho",
TITLE="Humanistic Education for the Lives of Today's Engineers",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=11,
PAGES="72-74",
MONTH="Nov",
YEAR=1992,
KEYWORDS="Humanistic Education",
ABSTRACT="If engineering faculty appreciated the benefits of
non-pragmatic education, they could better prepare young engineers for
our modern world.",
}

@ARTICLE{Ali9203:Frame,
AUTHOR="M. S. Ali",
TITLE="Frame Relay in Public Networks",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=3,
PAGES="72-79",
MONTH="Mar",
YEAR=1992,
KEYWORDS="Frame Relay; Public Networks",
ABSTRACT="Relaying variable-length data frames through a network offers
enhanced throughput at reduced cost",
}

@ARTICLE{Lee9211:Taiwan,
AUTHOR="L. Lee",
TITLE="Taiwan: Meeting the New Challenges",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=11,
PAGES="18-27",
MONTH="Nov",
YEAR=1992,
KEYWORDS="Taiwan; technology",
ABSTRACT="Cultural and political commitments to engineering education
have fueled the Taiwanese technological miracle.",
}

@ARTICLE{Cox9212:Wireless,
AUTHOR="Donald Cox",
TITLE="Wireless Network Access for Personal Communications",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=12,
PAGES="96-115",
MONTH="Dec",
YEAR=1992,
KEYWORDS="Wireless Network Access; Personal Communications",
ABSTRACT="Tetherless personal communications is a ``paradigm shift''
that requires completely new economic and regulatory models.",
}

@ARTICLE{Zolz92:Customized,
AUTHOR="Pietro Zolzettich and Arye R. Ephrath",
TITLE="Customized Service Creation: A New Order for Telecommunications
Services",
JOURNAL=infocom,
ADDRESS="Florence, Italy",
PAGES="1014-1019",
YEAR=1992,
REFERENCES=4,
KEYWORDS="intelligent network;advanced intelligent
network;IN;AIN;service creation",
ABSTRACT="Since the dawn of telecommunications, telephone companies have
been offering few standard services and the customers needs had to fit
these services.  Today, the Advanced Intelligent Network is
revolutionizing this idea.  This paper describes the evolution from the
Intelligent Network to the Advanced Intelligent Network (AIN).  The
concept behind AIN and its architecture are then introduced.  Finally,
the paper illustrates a Bellcore product for the AIN: the SPACE\&tm;
system.  It shows how its user friendly programming language, its
service creation platform, its multiple-services application, and its
reliable node platform make the SPACE system a powerful AIN product.",
}

@INPROCEEDINGS{Ofek92:Integration,
AUTHOR="Y. Ofek and K. Sohraby and Ho-Ting Wu",
TITLE="Integration of Synchronous and Asynchronous Traffic on the
MetaRing Architecture and Its Analysis",
BOOKTITLE=icc,
PAGES="147-153",
YEAR=1992,
ABSTRACT="In this paper, we describe and evaluate a protocol for
integrating two types of traffic on the MetaRing Architecture.
Synchronous (reserved or real-time) traffic which is periodic and
requires a connection set-up and will have guaranteed bandwidth and
bounded delay, and asynchronous or bursty traffic with no real-time
constraints that can use the remainder of the bandwidth in a fair
manner. The integration mechanism is functionally equivalent to the
Timed-Token Function in FDDI, which is a shared media ring protocol. The
MetaRing is a slotted or buffer insertion ring with fairness and spatial
bandwidth reuse. Concurrent access and spatial bandwidth reuse enable
the simultaneous transmissions over disjoint segments of a
bi-directional ring and therefore, can increase the effective throughput
in each direction. The fairness mechanism for this architecture is
simple and robust, and it is based on a 1-bit control signal that
regulates the access to the ring. A Markovian state space formulation of
the integration protocol is given. This compact and efficient
formulation which uses only a few state equations is used for the
simulation of the network with arbitrary number of nodes. An upper bound
on the delay of the synchronous traffic is provided to demonstrate the
importance of the integration algorithm. Simulation results are also
presented to show the effects of the fairness and flow control signals
on the performance of the network.",
}

@INPROCEEDINGS{Clos92:Media,
AUTHOR="F. Closs and Y. Ofek",
TITLE="Media Access Protocols for Gb/s {LANs} with Spatial Reuse,
Fairness, and Isochronous Service",
BOOKTITLE="37th Annual IEEE International Computer Conference",
PAGES="239-246",
YEAR=1992,
ABSTRACT="The authors describe the design principles of a ring-based LAN
(local area network) with spatial bandwidth reuse and support of
isochronous channels. The network uses buffer insertion which, in
contrast to token passing principles, allows concurrent media access.
Spatial bandwidth reuse and concurrent access allow simultaneous packet
transmissions over disjoint segments of the ring. As a result, the
potential aggregate throughput of a dual ring can be 8 times the data
rate of a single link. Buffer insertion coupled with spatial bandwidth
reuse can cause unfairness. The author describes two algorithms to
eliminate this deficiency: (i) a flow-based fairness algorithm and (ii)
a reservation-based fairness algorithm. Conventional buffer insertion
introduces variable amounts of delay and is therefore not directly
suitable for isochronous traffic. A novel method to combine asynchronous
(packet-oriented) and isochronous traffic on the same buffer insertion
ring is outlined.",
}

@INPROCEEDINGS{Ofek92:MetaNet,
AUTHOR="Y. Ofek and M. Yung",
TITLE="MetaNet: an Arbitrary Topology {LAN} for Data Acquisition and
Processing",
BOOKTITLE="2nd Conference on Electronics for Future Colliders",
YEAR=1992,
ABSTRACT="In this paper we present gigabit network architecture, called
MetaNet, for interconnecting both the on-line and the off-line data
acquisition and processing. In our solution we concentrate on how to
interconnect the front-end (ADCs and level 1 and 2 triggers) with the
on-line (real-time) event processing. We propose that the on-line
solution will be extended into the off-line data processing and
mass-storage. As a result, this solution provides a single uniform
structure which will simplify the overall system. The MetaNet is a local
area network (LAN) architecture with an 'arbitrary topology' and switch
at each node (a switch based LAN). Its design provides on one hand a
service in which any node can try to transmit asynchronously, in a
bursty manner without reservation, as much as it can, and on the other
hand the network access and flow control will ensure the following
properties: (1) no packet loss due to congestion, (2) fair access to the
network, (3) no deadlocks, (4) dynamic self-routing, and (5)
broadcast-with-feedback. The switching over this network requires only a
(6) single buffer per link for the transmission of variable size frames
or fix size cells.",
}

@ARTICLE{Lehm9206:Starburst,
AUTHOR="T. J. Lehman and E. Shekita and Luis Felipe Cabrera",
TITLE="An Evaluation of Starburst's Memory Resident Storage Component",
JOURNAL="{IEEE} Transactions on Knowledge and Data Engineering",
VOLUME=4,
NUMBER=6,
PAGES="555-566",
YEAR=1992,
}

@BOOK{Gree92:Handbook,
AUTHOR="Jr. Green",
TITLE="The Business One Irwin Handbook of Telecommunications",
EDITION="2nd",
ISBN="1-55623-333-7",
PUBLISHER="Business One Irwin",
ADDRESS="Homewood, Illinois",
YEAR=1992,
KEYWORDS="handbook; telecommunications; PSTN; POTS; telephone system;
PBX features",
}

@BOOK{ATT92:Events,
AUTHOR="AT\&T Communications",
TITLE="Events in telecommunications history",
ISBN=9993928933,
PUBLISHER="AT\&T Communications",
YEAR=1992,
KEYWORDS="telephony; history",
}

@UNPUBLISHED{Magn92:Efficient,
AUTHOR="Peter S. Magnusson",
TITLE="Efficient Simulation of Parallel Hardware",
NOTE="Masters thesis. Royal Instiute of Technology (KTH), Stockholm,
Sweden",
YEAR=1992,
ABSTRACT="Instruction-level simulators, also called register level
simulators, are a crucial component in developing and analyzing computer
architectures and system software. This thesis describes the essential
components of a Tadpole multi-processor simulator, a Motorola 88000
RISC-based computer. The simulator is sufficiently accurate to boot the
monitor program, and runs approximately 30 times slower than the real
machine. Possible extensions to improve this slowdown, and some of the
issues that will arise when the simulator is extended to simulate a
shared-memory multiprocessor, is discussed. The thesis of the author is,
in part, to demonstrate for a particular parallel architecture that
several of the uses of a simulator can be partially or fully satisfied
in a single program. In other words, functionality need not compromise
efficiency to the extent previously supposed. A discussion and critique
of previous work in the area is presented. Efficient ways of simulating
MC88100 instructions and of representing them internally is dealt with
in some detail.",
URL="http://www.sics.se/simics/publications/psm-msc-thesis.ps.Z",
}

@MISC{Hager:diss,
AUTHOR="Erik Hagersten",
TITLE="Towards Scalable Cache Only Memory Architectures",
HOWPUBLISHED="SICS Dissertation series 08",
YEAR=1992,
}

@ARTICLE{Hager:ddm,
AUTHOR="Erik Hagersten and Anders Landin and Seif Haridi",
TITLE="{DDM} - a Cache-Only Memory Architecture",
JOURNAL=ieeecomp,
MONTH="SEP",
YEAR=1992,
}

@INPROCEEDINGS{Wilk92:Angel,
AUTHOR="Tim Wilkinson and T. Stiemerling and P. Osmon and Ashley
Saulsbury and P. T. Kelly",
TITLE="Angel: A Proposed Multiprocessor Operating System Kernel",
MONTH="MAR",
YEAR=1992,
}

@INPROCEEDINGS{Parrow:multi,
AUTHOR={Joachim Parrow and P. Sj{\"o}di},
TITLE="Multiway synchronization verified with coupled simulation",
BOOKTITLE="of CONCUR '92",
YEAR=1992,
URL="http://www.sics.se/~peter/papers/cs-mway.ps",
}

@MISC{Mag:these,
AUTHOR="Peter S. Magnusson",
TITLE="Efficient Simulation of Parallel Hardware",
HOWPUBLISHED="MSc thesis",
YEAR=1992,
ABSTRACT="Instruction-level simulators, also called register level
simulators, are a crucial component in developing and analyzing computer
architectures and system software. This thesis describes the essential
components of a Tadpole multi-processor simulator, a Motorola 88000
RISC-based computer. The simulator is sufficiently accurate to boot the
monitor program, and runs approximately 30 times slower than the real
machine. Possible extensions to improve this slowdown, and some of the
issues that will arise when the simulator is extended to simulate a
shared-memory multiprocessor, is discussed. The thesis of the author is,
in part, to demonstrate for a particular parallel architecture that
several of the uses of a simulator can be partially or fully satisfied
in a single program. In other words, functionality need not compromise
efficiency to the extent previously supposed. A discussion and critique
of previous work in the area is presented. Efficient ways of simulating
MC88100 instructions and of representing them internally is dealt with
in some detail.",
}

@INPROCEEDINGS{Sau:impl,
AUTHOR="Ashley Saulsbury and T. Stiemerling and Tim Wilkinson",
TITLE="Implementing {DVSM} on the {TOPSY} multicomputer",
BOOKTITLE="Symposium on Experience with Distributed Multicomputer
Systems III",
MONTH="MAR",
YEAR=1992,
}

@INPROCEEDINGS{Denz:high,
AUTHOR="W. Denzel and A. Engbersen and Ilias Iliadis and Gunnar
Karlsson",
TITLE="A Highly Modular Packet Switch for Gb/s Rates",
BOOKTITLE="in Proceedings of the XIV International Switching Symposium",
MONTH="OCT",
YEAR=1992,
}

@TECHREPORT{Perk92:Short,
AUTHOR="Charles E. Perkins and Y. Rekhter",
TITLE="Short-cut Routing for Mobile Hosts",
INSTITUTION="IBM T. J. Watson Research Center",
YEAR=1992,
}

@INPROCEEDINGS{Carl92:Routing,
AUTHOR="Ken Carlberg",
TITLE="A Routing Architecture that Supports Mobile End Systems",
BOOKTITLE="IEEE Proceedings of the Military Communications Conference,
MILCOM '92",
VOLUME=1,
PAGES="159-164",
YEAR=1992,
}

@TECHREPORT{Scho9201:ConnectionArchitecture,
AUTHOR="Eve Schooler",
TITLE="The Connection Control Protocol: Architecture Overview (Version
1.0)",
TYPE="Technical Report",
INSTITUTION="USC/Information Sciences Institute",
ADDRESS="Marina del Ray, California",
MONTH=jan,
YEAR=1992,
KEYWORDS="multimedia; conferencing; session control; connection
establishment; application layer; packet voice",
URL="ftp://ftp.isi.edu/pub/hpcc-papers/mmc/ccp\_arch.ps",
}

@TECHREPORT{Scho9201:Connection,
AUTHOR="Eve Schooler",
TITLE="The Connection Control Protocol: Specification (Version 1.1)",
TYPE="Technical Report",
INSTITUTION="USC/Information Sciences Institute",
ADDRESS="Marina del Ray, California",
MONTH=jan,
YEAR=1992,
KEYWORDS="multimedia; conferencing; session control; connection
establishment; application layer; packet voice",
URL="ftp://ftp.isi.edu/pub/hpcc-papers/mmc/ccp\_spec.ps",
}

@ARTICLE{Land9201:Computer,
AUTHOR="Lawrence H. Landweber",
TITLE="Computer networking courses at the University of Wisconsin,
Madison",
JOURNAL=ccr,
VOLUME=22,
NUMBER=1,
PAGES="52-61",
MONTH=jan,
YEAR=1992,
REFERENCES=6,
KEYWORDS="networking course",
URL="http://www.acm.org/sigcomm/ccr/archive/1992/jan92/landweber.ps",
}

@ARTICLE{Nart9201:Introductory,
AUTHOR="Thomas Narten and R. Yavatkar",
TITLE="An introductory course in computer communication and networks",
JOURNAL=ccr,
VOLUME=22,
NUMBER=1,
PAGES="62-81",
MONTH=jan,
YEAR=1992,
REFERENCES=14,
KEYWORDS="curriculum; networking course",
ABSTRACT="This paper reports on the curriculum contents and experience
obtained in the teaching of a semester-long introductory course in
computer communication networks. The course is aimed at first year
graduate and senior undergraduate students and covers a broad survey of
networking issues. We focus on all seven layers of the OSI reference
model and assign four major programming projects to reinforce the ideas
covered in lectures. Projects include writing the client side of a
client-server program that implements a sliding window data-link layer
protocol complete with acknowledgements and retransmissions, writing
client and server programs that interact via remote procedure calls, and
writing client and server programs that use UDP datagrams to locate and
register services with a name server utility and TCP to actually invoke
services registered with the name server.",
URL="http://www.acm.org/sigcomm/ccr/archive/1992/jan92/narten.ps",
}

@ARTICLE{Want9201:Active,
AUTHOR="Roy Want and Andrew Hopper and Veronica Falcao and J. A.
Gibbons",
TITLE="The active badge location system",
JOURNAL=tois,
VOLUME=10,
NUMBER=1,
PAGES="91-102",
NOTE="also Olivetti Research Limited Technical Report ORL 92-1",
MONTH=jan,
YEAR=1992,
KEYWORDS="active badges; location system; PBX; privacy issues; tagging
systems; human factors; office automation",
ABSTRACT="A novel system for the location of people in an office
environment is described. Members of staff wear badges that transmit
signals providing information about their location to a centralized
location service, through a network of sensors. The paper also examines
alternative location techniques, system design issues and applications,
particularly relating to telephone call routing. Location systems raise
concerns about the privacy of an individual, and these issues are also
addressed.",
}

@MISC{Inco9201:XTP,
AUTHOR="Protocol Engines Incorporated",
TITLE="{XTP} protocol definition Revision 3.6",
MONTH=jan,
YEAR=1992,
KEYWORDS="XTP; transport protocol",
}

@TECHREPORT{Pike9201:Hello,
AUTHOR="Rob Pike and Ken Thompson",
TITLE="Hello World or $K\alpha\lambda\eta\mu\acute\\epsilon\\rho\alpha$
$\kappa\o\sigma\mu\epsilon$ or \dots",
INSTITUTION="AT\&T Bell Laboratories",
ADDRESS="Murray Hill, New Jersey",
MONTH=jan,
YEAR=1992,
KEYWORDS="Plan 9; operating systems; UTF; Unicode; character set",
ABSTRACT="Plan 9 from Bell Labs has recently been converted from ASCII
to an ASCII-compatible variant of Unicode, a 16-bit character set. In
this paper we explain the reasons for the change, describe the character
set and representation we chose, and present the programming models and
software changes that support the new text format. Although we stopped
short of full internationalization -- for example, system error messages
are in Unixese, not Japanese -- we believe Plan 9 is the first system to
treat the representation of all major languages on a uniform, equal
footing throughout all its software.",
URL="ftp://research.att.com/dist/plan9man/09utf.ps.Z",
}

@UNPUBLISHED{Jaco9201:LNAT,
AUTHOR="V. Jacobson",
TITLE="{LNAT} --- large scale {IP} via network address translation",
NOTE="Lawrence Berkeley Laboratory; working draft",
MONTH=jan,
YEAR=1992,
KEYWORDS="IP; address translation; routing; NAT",
}

@ARTICLE{Part9201:Implementation,
AUTHOR="Craig Partridge and Stephen Pink",
TITLE="An implementation of the revised {Internet} stream protocol
{(ST-2)}",
JOURNAL=internet,
VOLUME=3,
NUMBER=1,
PAGES="27-54",
MONTH=jan,
YEAR=1992,
KEYWORDS="ST-2; stream protocol; protocol implementation; ST-II;
Internet; resource reservation; BSD",
ABSTRACT="ST-2 is a revision of an experimental protocol designed to
support applications which require guaranteed network service. ST-2
provides mechanisms for creating streams, tree-shaped delivery paths
with performance guarantees, for applications which require such
guarantees. As part of the MultiG project, the authors implemented ST-2
in the BSD Unix system. The twin goals of this implementation were to
see how easily a novel protocol like ST-2 could be incorporated into the
BSD networking model, and, more importantly, to thoroughly evaluate the
ST-2 protocol. Our conclusions are that the BSD model proved quite
general, requiring only modest changes (changes which were largely
invisible to the application), but that the ST-2 protocol itself needs
some reworking.",
}

@ARTICLE{Lowe9201:Data,
AUTHOR="S. J. Lowe and Victor B. Lawrence",
TITLE="Data Communications",
JOURNAL=ieeespec,
PUBLISHER="IEEE",
VOLUME=29,
NUMBER=1,
PAGES="39-41",
MONTH=jan,
YEAR=1992,
ANNOTE="The US house and Senate have passed legislation enabling an
ultragigabit per second National Research and Education Network (NREN)
backcone to be built. The NSFNet backbone is the first network in the US
to make use of 'unchannelised' 45Mbit/s T3 links. Public Frame Relay was
started in the US in 1991 by WilTel Inc. ``Todays gigabit - and
tomrrow's terabit - networks are beign designed for high bandwidth, low
delay and a low error rate.'' In high speed networks it may be advisable
to sacrafice some bandwidth for improved protocol processing
efficiency.",
}

@ARTICLE{Woli92:Modelling,
AUTHOR="Adam M Wolisz and R. Popescu-Zeletin",
TITLE="Modelling End-to-End Protocols Over Interconnected Heterogeneous
Networks",
JOURNAL=comcom,
VOLUME=15,
NUMBER=1,
PAGES="11-22",
MONTH=jan,
YEAR=1992,
}

@TECHREPORT{Stra9201:XTP,
AUTHOR="W. Timothy Strayer and Alfred Weaver",
TITLE="Is {XTP} suitable for distributed real-time systems?",
TYPE="Technical Report",
INSTITUTION="Computer Science Department, University of Virginia",
ADDRESS="Charlottesville, Virginia",
NUMBER="TR-92-02",
MONTH=jan,
YEAR=1992,
REFERENCES=21,
KEYWORDS="XTP; real-time systems; real-time protocols; transport
protocols",
ABSTRACT="XTP is already recognized as a transport layer protocol for
next-generation distributed systems; in this paper we examine the Xpress
Transfer Protocol's suitability for distributed real-time systems. 
Distributed real-time systems require a high degree of functionality as
well as performance from their communication subsystem.  In distributed
real-time systems performance gains are typically made at the expense of
service functionality.  As a consequence many communication subsystems
supporting real-time applications are based on MAC layer services. XTP
promises high performance at the transport layer through ef cient design
and an eventual VSLI implementation, as well as a high degree of
functionality, much of which is useful for distributed real-time
systems.  We discuss the requirements on a subsystem in order to support
communication in the real-time environment.  We examine the features and
functionality of XTP.  Finally, we conjecture about how XTP meets the
requirements of a distributed real-time, and where it fails to do so.",
URL="ftp://uvacs.cs.virginia.edu/pub/techreports/CS-92-02.ps.Z",
}

@INPROCEEDINGS{Rath9201:Policing,
AUTHOR="Erwin P. Rathgeb",
TITLE="Policing of realistic {VBR} video traffic - a case study",
BOOKTITLE="IFIP workshop on broadband communications",
ADDRESS="Estoril",
PAGES=16,
MONTH=jan,
YEAR=1992,
REFERENCES=30,
KEYWORDS="ATM; source policing; VBR; variable bitrate coding; traffic
source model; measurement",
ABSTRACT={The sources used in this paper are directly based on measured
"real life" video data.},
}

@INPROCEEDINGS{Iver9201:Traffic,
AUTHOR="V. B. Iversen and Annemarie B. Nielsen",
TITLE="Traffic management in {ATM} networks based on a counting
mechanism",
BOOKTITLE="IFIP workshop on broadband communications",
ADDRESS="Estoril",
MONTH=jan,
YEAR=1992,
REFERENCES=3,
KEYWORDS="ATM; source policing; connection admission control; G/D/1/S;
eaky bucket",
ABSTRACT="jumping leaky bucket mechanism",
}

@ARTICLE{Bier9201:Simulation,
AUTHOR="Ernst Biersack",
TITLE="A Simulation Study of Forward Error Correction in {ATM}
Networks",
JOURNAL=ccr,
VOLUME=22,
NUMBER=1,
PAGES="36-47",
MONTH=jan,
YEAR=1992,
REFERENCES=18,
KEYWORDS="ATM FEC (forward error correction); ARQ (Automatic Repeat
reQuest)",
ABSTRACT="If the packet loss rate in a network is higher than the loss
rate requested by an application, the transport protocol must make up
for the difference in loss rate. In high bandwidth delay-product
networks the latency introduced by retransmission-based error recovery
schemes may be too high for applications with latency constraints. In
this case, Forward Error Correction (FEC) can be used. FEC allows
recovery from loss without retransmission. The amount of loss recovered
strongly depends on the loss behavoir of the network. FEC works best if
losses are dispersed. We use simulation to study the loss behavior of an
output buffered multiplexer for three different traffic scenarios. Our
results show how the loss behavior of the multiplexer is affected by the
traffic mix and the statistics of the sources. The more bursty the
sources are the larger the loss rate and the higher the probability that
losses will occur in bursts. We then investigate the effectiveness of an
FEC scheme that can recover a fixed number of lost packets within a
block of consecutive packets. For a heterogeneous traffic scenario
consisting of video and burst sources, this scheme reduces the loss rate
for the video sources by several orders of magnitude.",
URL="http://www.acm.org/sigcomm/ccr/archive/1992/jan92/biersack.ps",
}

@ARTICLE{Wang9201:Simple,
AUTHOR="Zhen Wang and Jon Crowcroft and Ian Wakeman",
TITLE="A Simple {TCP} Extension for High Speed Paths",
JOURNAL=ccr,
VOLUME=22,
NUMBER=1,
PAGES="48-51",
MONTH=jan,
YEAR=1992,
REFERENCES=6,
KEYWORDS="MSL (maximum segment lifetime) piggybacking TOS (type of
service); IP IP precedence",
ABSTRACT={RFC-1072 and RFC-1185 have proposed a new TCP option
"Echo/Echo Reply", in which timestamps are carried in TCP headers to aid
in extending the sequence number space beyond 32 bits. However, such an
extension will add an extra 64 bits to the TCP header and will require
option processing for each packet at both ends. In this paper we propose
a simpler TCP extension that expands the sequence number space without
increasing the size of the TCP header.},
URL="http://www.acm.org/sigcomm/ccr/archive/1992/jan92/wang.ps",
}

@INPROCEEDINGS{Pehr9201:Design,
AUTHOR="B. Pehrson and F. Reichert and Per Lindgren and Christer Bohm
and Lars Hakansson and Lotten Elmstedt and Per von Knorring and L.
Gauffin",
TITLE="The Design of the {MultiG} Dual Fiber Network",
BOOKTITLE="IFIP TC6 Workshop on Broadband Communications, Estoril,
Portugal",
VOLUME=1,
MONTH=jan,
YEAR=1992,
ABSTRACT="The optical fiber network used in the MultiG/DTM project is
planned to operate at a final data rate of 2.4 Gbit/sec.  Each network
node will be attached to up to three pairs of unidirectional buses. In a
first step the topology and necessary hardware will support a lower rate
of 622 Mbit/sec.  The components discussed in this article will include
the physical fiber attachment unit up to the media access layer.",
URL="ftp://gaia.electrum.kth.se/Reports/Telecommunication-Systems/MultiG/92.IFIP.Estoril.DTM.ps",
}

@ARTICLE{Pehr9201:Multi,
AUTHOR="B. Pehrson and S. Pink and P. Gunningberg",
TITLE="MultiG: a Research Program on Distributed Multimedia Applications
and Gigabit Networks",
JOURNAL=ieeenet,
VOLUME=6,
NUMBER=1,
MONTH=jan,
YEAR=1992,
}

@INPROCEEDINGS{Laza9201:Integration,
AUTHOR="Aurel A. Lazar",
TITLE="The Integration of Real-Time Control with Management in Broadband
Networks",
BOOKTITLE="Workshop on Broadband Communications",
ADDRESS="Estoril, Portugal",
MONTH=jan,
YEAR=1992,
URL="ftp://ftp.ctr.columbia.edu/CTR-Research/comet/public/papers/92/LAZ92a.ps.gz",
}

@TECHREPORT{Mukh9201:New,
AUTHOR="A. Mukherjee and Jaffar Rehman",
TITLE="New Algorithms for Capacity Allocation and Scheduling of
Multiplexed Variable Bit Rate Video Sourcews",
TYPE="Technical Report",
INSTITUTION="University of Pennsylvania",
ADDRESS="Philadelphia",
NUMBER="MS-CIS-92-08",
MONTH=jan,
YEAR=1992,
KEYWORDS="queuing virtual clock compression real time networks",
}

@INPROCEEDINGS{Alan9201:Archie,
AUTHOR="Peter Deutsch Alan Emtage",
TITLE="archie - An Electronic Directory Service for the {Internet}",
BOOKTITLE=usenixw,
ORGANIZATION="Usenix",
ADDRESS="San Francisco, California",
PAGES="93-110",
MONTH=jan,
YEAR=1992,
KEYWORDS="archie; resource discovery; Internet",
ABSTRACT="The huge size and continued rapid growth of the Internet
offers a particular challange to systems desingers and service providers
in this new environment. Before a user can effectively exploit any of
the services offered by the interner community or access any information
provided by such services, that user must be aware of both the existence
of the service and the host or hosts on which it is available.
Adequately addressing this resource discovery problem is a central
challenge for both service providers and users wishing to capitalize on
the possibilities of the Internet. This paper describes archie, our
attempts at an on-line resource service for an internetworked
environment. The current implementation of archie automatically indexes
and makes available all filenames stored at known anonymous FTP sites.
The filename information is updated automatically ensuring users access
to authorative information. The system also makes available the names
and descriptions of several thousand packages found on the Internet.",
}

@INPROCEEDINGS{Scha9201:Realtime,
AUTHOR="Robin Schaufler",
TITLE="Realtime Workstation Performance for {MIDI}",
BOOKTITLE=usenixw,
ORGANIZATION="Usenix",
ADDRESS="San Francisco, California",
PAGES="139-151",
MONTH=jan,
YEAR=1992,
KEYWORDS="MIDI; real-time; multimedia",
ABSTRACT="MIDI studio applications require 1 millisecond accuracy in
timing transmissions and receipt of MIDI messages. Past MIDI
implementations on UNIX have either used an Roland MPU-401 coprocessor,
to do accurate timing, or have not had timing tests published for them.
Timing MIDI I/O on the host processor allows for more flexible
scheduling policies than the MPU-401, but many people expressed
skepticism that it could be done with sufficient accuracy and efficiency
because of UNIX virtual memory and pre-emptive scheduling. This paper
describes studies we did on providing millisecond accuracy on the host
processor of a Silicon Graphics Iris Indigo running IRIX, the Silicon
Graphics version of UNIX. Our measurements show that millisecond
accuracy is feasable on IRIX without modifying the kernel. The paper
goes on to describe how the studies relate to other time based media.
With a small set of real time features, UNIX can really sing.",
}

@INPROCEEDINGS{Room9201:3DFS,
AUTHOR="W. D. Roome",
TITLE="{3DFS:} A Time-Oriented File Server",
BOOKTITLE=usenixw,
ORGANIZATION="Usenix",
ADDRESS="San Francisco, California",
PAGES="405-419",
MONTH=jan,
YEAR=1992,
KEYWORDS="file system; juke box; optical disk; backup",
ABSTRACT="3DFS is a network file server thet provides time-oriented
access to files and directories. 3DFS allows a user to read the version
of a file as it existed on a particular day in the past, or to list the
files in a directory on sone prior date. 3DFS saves daily incremental
backups form other file systems (Sun file servers, Vaxen,\ldots), and
creates an on-line file system from these dumps. 3DFS uses optical disks
in an automated jukebox, so no operator intervention is required. 3DFS
uses the Sun NFS protocol, and looks like any other NFS server. Any UNIX
command can read files in 3DFS, and users mount 3DFS just like any file
server. Because 3DFS provides on-line access to old versions, user can
access those versions in-place, without copying them to megnetic disk.
This paper describes 3DFS, its implementation, and our experiences with
it.",
}

@INPROCEEDINGS{Bore9201:Multimedia,
AUTHOR="N. Borenstein",
TITLE="Multimedia Mail From the Buttom Up or Teaching Dump Mailers to
Sing",
BOOKTITLE=usenixw,
ORGANIZATION="Usenix",
ADDRESS="San Francisco, California",
PAGES="79-91",
MONTH=jan,
YEAR=1992,
KEYWORDS="multimedia; mail; MIME",
ABSTRACT="Multimedia mail systems have exhibited great potential, but
the widespread use of multimedia mail has so far been inhibited by the
lack of interchange standards and the heterogenity of mail-reading
software.  This paper describes a new approach that seeks to break the
existing log-jam and make multimedia mail a practical reality.  The
paper begins with a brief summary of the state of the art in multimedia
mail systems.  It then outlines the new, bottom-up approach, and
describes the configuration mechanism that is central to its opration. 
Next, it describes a prototype implementation and its deployment on top
of over a dozen different mail-reading programs at Bellcore and
elsewhere.  Finally, problems in the prototype installation are
discussed, along with future prospects for multimedia mail using this
approach.  The paper ends by outlining a vision of a new and better
lowest common denominator for electronic mail.",
}

@TECHREPORT{Alle9201:Expanded,
AUTHOR="Brian D. Alleyne and Isaac Scherson",
TITLE="Expanded Delta Networks for Very Large Parallel Computers",
TYPE="Technical Report",
INSTITUTION="University of California, Irvine, Department of Information
and Computer Science",
NUMBER="ICS-TR-92-02",
PAGES=28,
MONTH=jan,
YEAR=1992,
ABSTRACT="In this paper we analyze a generalization of the traditional
delta network, introduced by Patel [21], and dubbed Expanded Delta
Network (EDN). These networks provide in general multiple paths that can
be exploited to reduce contention in the network resulting in increased
performance. The crossbar and traditional delta networks are limiting
cases of this class of networks. However, the delta network does not
provide the multiple paths that the more general expanded delta networks
provide, and crossbars are too costly to use for large networks. The
EDNs are analyzed with respect to their routing capabilities in the MIMD
and SIMD models of computation. The concepts of capacity and clustering
are also addressed. In massively parallel SIMD computers, it is the
trend to put a larger number processors on a chip, but due to I/O
constraints only a subset of the total number of processors may have
access to the network. This is introduced as a Restricted Access
Expanded Delta Network of which the MasPar MP-1 router network is an
example.",
}

@TECHREPORT{Coll9201:Self,
AUTHOR="Zeev Collin and R. Dechter and S. S. Katz",
TITLE="Self-Stabilizing Distributed Constraint Satisfaction",
TYPE="Technical Report",
INSTITUTION="University of California, Irvine, Department of Information
and Computer Science",
NUMBER="ICS-TR-92-67",
PAGES=30,
MONTH=jan,
YEAR=1992,
ABSTRACT="This paper characterizes connectionist-type architectures that
allow a distributed solution for classes of constraint satisfaction
problems, and presents such solutions. We first consider whether there
exists a uniform model of computation that guarantees convergence to a
solution from every initial state of the system, whenever such a
solution exists. Even for relatively simple constraint networks, such as
rings, we show that there is no general solution that guarantees
convergence from every initial state of the system using a completely
uniform, asynchronous model. However, some restricted topologies such as
trees can accommodate the uniform, asynchronous model and a protocol
demonstrating this fact is presented. An almost-uniform, asynchronous,
network consistency protocol is also presented. Subprotocols are given
to make an undirected tree directed and to traverse a graph. We show
that the algorithms are guaranteed to be self-stabilizing, which makes
them suitable for dynamic or error-prone environments.",
}

@ARTICLE{Mend9201:Detection,
AUTHOR="T. D. Mendez",
TITLE="Detection of Pathological {TCP} Connections Using a Segment Trace
Filter",
JOURNAL=ccr,
VOLUME=22,
NUMBER=1,
PAGES="28-35",
MONTH=jan,
YEAR=1992,
REFERENCES=2,
}

@ARTICLE{Paol9201:Department,
AUTHOR="L. M. Paoletti",
TITLE="The Department of Defense Communications in the 21st Century",
JOURNAL=ccr,
VOLUME=22,
NUMBER=1,
PAGES="82-87",
MONTH=jan,
YEAR=1992,
REFERENCES=5,
ABSTRACT="The Department of Defense (DoD) is one of the biggest users of
communications in the world.  Communications systems are used not only
for the administration of the Department, but, most critically, for the
command and control of force structures.  To this end, the Defense
Communications Agency (DCA) strives to ensure that the Department's
missions are carried out with state-of-the-art communications systems.
In this article an architecture is postulated to achieve the
Department's  objective of rapid, reliable, secure exchange of
information at an affordable price.  The goal is one system for all
communications services (data, voice, video, imagery) including Office
Automation (OA) needs. This article was written with the view toward
communications systems which are commonly referred to as fixed systems
used on military bases and for long-haul transport of information,
rather than tactical communications systems used on mobile platforms
such as armored vehicles, ships, and airplanes.  However, due to
advances in VLSI and flexibilities afforded by new transmission
frameworks and switching fabrics, the concepts described in this article
could apply to tactical systems as well. The views contained in this
article are those of the author and should not be interpreted as
necessarily representing the official policies, either expressed or
implied, of DCA and DoD.",
}

@ARTICLE{Alae9201:MaRS,
AUTHOR="C. Alaettinoglu and K. Dussa-Zieger and I. Matta and A. U.
Shankar and O. Gudmundsson",
TITLE="{MaRS--A} Routing Testbed",
JOURNAL=ccr,
VOLUME=22,
NUMBER=1,
PAGES="95-96",
MONTH=jan,
YEAR=1992,
REFERENCES=5,
URL="http://www.acm.org/sigcomm/ccr/archive/1992/jan92/MaRS-announcment.ps",
}

@TECHREPORT{Ewin9201:Measurement,
AUTHOR="David J. Ewing and Richard S. Hall and M. Schwartz",
TITLE="A Measurement Study of {Internet} File Transfer Traffic",
INSTITUTION="University of Colorado, Boulder",
NUMBER="CU-CS 571-92",
MONTH=jan,
YEAR=1992,
}

@INPROCEEDINGS{Emta9201:Archie,
AUTHOR="Alan Emtage and Peter Deutsch",
TITLE="archie: An electronic Directory Service for the {Internet}",
BOOKTITLE=usenixw,
PAGES="93-110",
MONTH=jan,
YEAR=1992,
}

@INPROCEEDINGS{Bern9201:World,
AUTHOR="Tim Berners-Lee and Robert Cailliau and Jean-François Groff and
Bernd Pollermann",
TITLE="World-Wide Web: An Information Infrastructure for High-Energy
Physics",
BOOKTITLE="Workshop on Software Engineering, Artificial Intelligence and
Expert Systems for High Energy and Nuclear Physics",
MONTH=jan,
YEAR=1992,
}

@INPROCEEDINGS{Munt9201:Multi,
AUTHOR="D. Muntz and P. Honeyman",
TITLE="Multi-Level Caching in Distributed File Systems - or - Your Cache
Ain't Nuthin' But Trash",
BOOKTITLE=usenixw,
ADDRESS="San Francisco, California",
PAGES="305-313",
MONTH=jan,
YEAR=1992,
KEYWORDS="Center for Information Technology Integration; The University
of Michigan distributed caching; measurements",
}

@ARTICLE{Crow9201:Layering,
AUTHOR="Jon Crowcroft and Ian Wakeman and Zhen Wang and D. Sirovica",
TITLE="Is Layering Harmful?",
JOURNAL=ieeenet,
PAGES="20-24",
MONTH=jan,
YEAR=1992,
KEYWORDS="layering; optimize; optimization; harmful; tcp; rpc",
}

@ARTICLE{Desu9201:Lightwave,
AUTHOR="E. Desurvire",
TITLE="Lightwave Communications: The Fifth Generation",
JOURNAL="Scientific American,",
PAGES="96-103",
MONTH=jan,
YEAR=1992,
KEYWORDS="Fiber Optics; Transmission",
ABSTRACT="Optical fibers doped with erbium and powered by tiny laser
chips are revolutionizing the way signals are regenerated for
transcontinental communications and for fast data transmission over
fiber-optic networks.",
}

@ARTICLE{Marc9201:Finite,
AUTHOR="Brian Marcus and Paul H. Siegel and J. Wolf",
TITLE="Finite-State Modulation Codes for Data Storage",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="5-37",
MONTH=jan,
YEAR=1992,
REFERENCES=63,
ABSTRACT="This paper provides a self-contained exposition of modulation
code design methods based upon the state splitting algorithm. The
techniques are applied to the design of several codes of interest in
digital data recording.",
}

@ARTICLE{Cide9201:PRML,
AUTHOR="Roy Cideciyan and François Dolivo and Reto Hermann and W. Hirt
and Wolfgang Schott",
TITLE="A {PRML} System for Digital Magnetic Recording",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="38-56",
MONTH=jan,
YEAR=1992,
REFERENCES=52,
ABSTRACT="Application of partial-response (PR) signaling and maximum
likelihood sequence detection (MLSD) to digital magnetic recording has
been shown in theory and practice to further increase the storage
densities and reliability that systems using run-length limited (RLL)
coding and peak detection (PD)-still the prevalent signal processing
techniques today-can currently achieve. In this paper, the realization
of a digital recording system using PR class-IV signaling with MLSD
(PRML) is described. To perform MLSD at the high data rates encountered
in recording systems, a simple implementation of the Viterbi detector is
developed based on a difference-metric algorithm. We present decision-
directed schemes for gain control and timing recovery, for tracking
variation of the gain and timing phase during data readback, and for
fast initial adjustment from a known preamble. The dynamic behavior of
the control algorithms is studied by computer simulations. Coding is
used to facilitate timing recovery and gain control, to limit the path
memory length of the Viterbi detector, and to allow fast and reliable
startup of receiver. The design and properties of rate-8/9 constrained
codes are examined. Finally, the problem of equalization is addressed,
and analog and combined analog/digital filter implementations are
developed. A simple adaptive equalizer capable of compensating
variations of the recording channel characteristics with track radius
and/or head-to- medium distance is described.",
}

@ARTICLE{Robe9201:Channels,
AUTHOR="Jr Robert T. Lynch",
TITLE="Channels and Codes for Magnetooptical Recording",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="57-72",
MONTH=jan,
YEAR=1992,
REFERENCES=49,
ABSTRACT="Optical recording has advanced rapidly over the past decade,
but many of the component parts are still evolving. The data recording
channel-how user data are written and recovered-is no exception. This
tutorial paper outlines the technology used in the optical recording
channel (concentrating on magnetooptical recording), and describes some
of the major formats, codes, and data detection methods which are being
developed. Many of these are new enough ideas that hardware demonstrates
and measurements are not yet available. We use, therefore, a
sophisticated software model of the optical recording channel to make
comparisons of the performance that can be expected from various
channels of interest.",
}

@ARTICLE{Eto9201:Signal,
AUTHOR="Yoshizumi Eto",
TITLE="Signal Processing for Future Home-Use Digital {VTR's}",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="73-79",
MONTH=jan,
YEAR=1992,
REFERENCES=28,
ABSTRACT="Recording technologies for future home-use digital VTR's are
reviewed with respect to both current TV and HDTV systems. High-density
recording and bit-rate reduction are the major technologies needed for
digital video recording with small cassettes. Recent experiments show
that the technical problems, except those of equipment size and cost,
have almost been solved.",
}

@ARTICLE{Umem9201:Professional,
AUTHOR="Masuo Umemoto",
TITLE="Professional {HDTV} Digital Recorder",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="80-85",
MONTH=jan,
YEAR=1992,
REFERENCES=20,
ABSTRACT="Some of the essential technology for record/playback systems
in professional HDTV digital recorders is described. The full bandwidths
of 1125/60 HDTV signals, namely 30 MHz for luminance and 15 MHz each for
the two color difference signals, are recorded. An 8-8 mapping channel
code and integrated detection are used. A special PLL to cope with
picture search functions was developed. At the high data rate of 148.5
Mb/s per channel and the high linear density of 0.345$\mu$m per bit, the
recorder operates with a word error rate of less than 10^-4.",
}

@ARTICLE{Veld9201:Bit,
AUTHOR="Raymond Veldhuis",
TITLE="Bit Rates in Audio Source Coding",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="86-96",
MONTH=jan,
YEAR=1992,
REFERENCES=27,
ABSTRACT="Waveform coding of audio signals at low bit rates generally
results in coding errors. In high-quality applications these must remain
inaudible. The bit rate required to both code audio signals without
audible errors depends on both the signal's power spectral density
function and masking properties of the human ear. It is shown how rate
distortion theory and psychoacoustic models of hearing can be used to
compute lower bounds to the bit rate of audio signals with inaudible
distortion. Subband coding applications to magnetic recording and
transmission are discussed in some detail. Performance bounds for this
type of subband coding systems are derived.",
}

@ARTICLE{With9201:Data,
AUTHOR="Peter de With and Marcel Breeuwer and Peter van Grinsven",
TITLE="Data Compression Systems for Home-Use Digital Video Recording",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="97-121",
MONTH=jan,
YEAR=1992,
REFERENCES=72,
ABSTRACT="Newly developed communication- and information networks offers
a large number of services which make use of image data, leading to an
increasing demand for image storage systems. This paper focuses on a new
emerging technology, namely image data compression techniques for
digital recording. Image coding for storage equipment covers a large
variety of systems because the applications differ considerably in
nature. In this paper, video coding systems suitable for digital TV and
HDTV recording and digital electronic still picture storage are
considered. In addition, attention is paid to picture coding for
interactive systems, such as the compact-disc interactive system. The
relative between the recording system boundary conditions and the
applied coding techniques is outlined. The main emphasis is on picture
coding techniques for digital consumer recording.",
}

@ARTICLE{Kino9201:Mb,
AUTHOR="Taizo Kinoshita and Tomoko Nakahashi",
TITLE="A 130 Mb/s Compact {HDTV} {CODEC} Based on a Motion-Adaptive
{DCT} Algorithm",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="122-129",
MONTH=jan,
YEAR=1992,
REFERENCES=10,
ABSTRACT="High-speed and high-density digital data records for packaging
and sorting HDTV signals are required for future consumers. Data
compression techniques are necessary to realize these applications.
However, these techniques are seriously limited due to high-speed
sampling clocks and the features of recording systems. In this paper, we
describe the principle and implementation of a 130 Mb/s compact HDTV
CODEC based on a motion-adaptive DCT algorithm. First, we describe a
data compression algorithm using motion-adaptive (motion processing over
5 or 10 frames) intrafield two-dimensional (8 x 8) DCT coding and
block-adaptive quantization with eight modes which is suitable for
recording systems. Next, the hardware of the developed CODEC using a
parallel signal processing architecture and three types of gate-array
LSI's is explained. Finally, the picture quality evaluation is
discussed, and sufficient picture quality for distortion use is
confirmed.",
}

@ARTICLE{Brue9201:New,
AUTHOR="Fons A. M. L. Bruekers and Ad van den",
TITLE="New Networks for Perfect Inversion and Perfect Reconstruction",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="130-137",
MONTH=jan,
YEAR=1992,
REFERENCES=7,
ABSTRACT="In some applications, such as transform source coders, it is
important that the cascade of the forward and the inverse transform give
the identity exactly (perfect inversion), although the coefficients and
the intermediate results are quantized. In subband coders, for example,
the split and merge filter banks should preferably have perfect
reconstruction. It is advantageous if perfect reconstruction can be
accomplished even when the coefficients and the intermediate results are
quantized. This paper presents a new network type that structurally
induces perfect inversion and perfect reconstruction. This network has a
ladder-like shape and a predescribed symmetry between the forward and
inverse network or between the split and merge bank. In some parts of
this ladder network almost any function is allowed. Due to the
predescribed symmetry, the property of perfect inversion or perfect
reconstruction is structurally assured.",
}

@ARTICLE{Iwad9201:Kb,
AUTHOR="Masahiro Iwadare and Akihiko K. Sugiyama and Fumie Hazu and
Akihiro Hirano and T. Nishitani",
TITLE="A 128 kb/s Hi-Fi Audio {CODEC} Based on Adaptive Transform Coding
with Adaptive Block-Size {MDCT}",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="138-144",
MONTH=jan,
YEAR=1992,
REFERENCES=19,
ABSTRACT="A hi-fi audio CODEC with an improved adaptive transform coding
(ATC) algorithm is developed using digital signal processors (DSP's). An
audio signal with a 20 kHz bandwidth sampled at 48 kHz is coded at a
rate of 128 kb/s. The algorithm utilizes adaptive block size selection,
which is effective for pre-echo suppression. A modified discrete cosine
transform (MDCT) with a simple window set is employed to reduce block
boundary noise without decreasing the performance of transform coding.
In addition, a fast MDCT calculation algorithm, based on a fast Fourier
transform, is adopted. Weighted bit allocation is employed to quantize
the transformed coefficients. The CODEC is realized by a multiprocessor
system composed of newly developed DSP boards. Subjective tests with the
CODEC show that the coding quality is comparable to that of compact disc
signals.",
}

@ARTICLE{Heeg9201:Bounding,
AUTHOR="Chris Heegard and Lawrence Ozarow",
TITLE="Bounding the Capacity of Saturation Recording: The Lorentz Model
and Applications",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="145-156",
MONTH=jan,
YEAR=1992,
REFERENCES=20,
ABSTRACT="This paper concerns the problem of bounding the information
capacity of saturation recording. The bounds apply to a variety of
systems such as magnetic tape recorders, magnetic disks, and optical
data disks. The superposition channel with additive Gaussian noise is
used as a model for recording. This model says that for a saturation
input signal, x(t), (i.e., one that can assume only one of two levels)
the output can be expressed as y(t)=x~(t) + z(t) where x~(t) is a
filtered version of the input x(t) and z(t) is additive Gaussian noise.
The channel is described by the impulse response of the channel filter,
h(t), and by the autocorrelation function of the noise. A specific
example of such a channel is the differentiated Lorentz channel; this
model is often used to describe magnetic recording [2]-[6]. Certain
autocorrelation and spectrum expressions for a general Lorentz channel
are derived. Upper and lower bounds on the capacity of saturation
recording channels are described. The bounds are explicitly computed for
the differentiated Lorentz channel model. Finally, it is indicated how
the derived bounds can be applied in practice using physical
measurements from a recording channel.",
}

@ARTICLE{Berg9201:SNR,
AUTHOR="Jan Bergmans",
TITLE="{SNR} Merits of Binary Modulation Codes in Equalized Digital
Recording Systems",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="157-167",
MONTH=jan,
YEAR=1992,
REFERENCES=23,
ABSTRACT="For a digital recording system with binary modulation encoder
and linearly dispersive channel with additive noise, this paper
determines optimum mean-square performances of the linear,
partial-response, and decision-feedback equalizers. The analysis
revolves around the power spectral density A($\omega$) of the code and
the folded signal-to-noise ratio X($\omega$) of the channel. The latter
function is analyzed for stylized optical and magnetic recording
channels. For all equalizers it is shown that the effect of coding is
akin to increasing X($\omega$) by an additive portion 1/A($\omega$).
This favors depressions of A($\omega$) to have any depressions, the
signaling rate must be increased with respect to uncoded storage, and
this inevitably degrades X($\omega$). At high information densities the
degradation is often too large for coding to be rewarding. Examples
serve to illustrate these results.",
}

@ARTICLE{Abbo9201:Combined,
AUTHOR="William L. Abbott and John Cioffi",
TITLE="Combined Equalization and Coding for High-Density Saturation
Recording Channels",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="168-181",
MONTH=jan,
YEAR=1992,
ABSTRACT="Combined equalization and coding approaches which
significantly outperform previous techniques are presented for binary
Lorentzian channel with additive Gaussian noise.  We develop a technique
based on the concatenation of standard trellis codes with an
``equalization code'' and a block decision feedback equalizer (BDFE).
Signal sets for the trellis code are generated by partitioning BDFE
output vectors according to four- and eight-dimensional lattices.  We
also investigate the combination of a decision feedback that this system
provides theoretical coding gains from 1 to 3 dB in the high linear
recording density range of $2 \leq pw\_{50} / T \leq 3$.  Although the
BDFE with trellis code system does not perform as well as the DFE with
CC system at high densities, it does produce substantial coding gains at
low linear recording densities.",
}

@ARTICLE{Haeb9201:Trellis,
AUTHOR="R. Haeb and Lynch, Jr., Robert T.",
TITLE="Trellis Codes for Partial-Response Magnetooptical Direct
Overwrite Recording",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="182-190",
MONTH=jan,
YEAR=1992,
REFERENCES=17,
ABSTRACT="We present conditions on the error sequences between channel
input sequences which guarantee certain lower bounds on the free
Euclidian distance at the output of a partial-response (PR) class I or
II channel. From these expressions, trellis codes are derived which
improve performance of binary signaling over noisy PR channels with
reduced complexity maximum-likelihood sequence detection. They are shown
to be compatible with the input restriction. They are shown to be
compatible with the input restriction caused by the magnetooptical
resonant coil direct overwrite recording scheme. The codes achieve high
signal-to-noise ratio coding gains of 3 dB (on PR class I) and 2.2 dB
(on PR class II) with rates as close to, but strictly less than, the
capacity of the initial input restriction as desired. The performance of
these codes is analyzed with an optical channel simulation system which
shows that one code has the rare but highly desirable property that its
maximum- likelihood sequence detector (MLSD) is less complex than the
MLSD of the reference system and still achieves an error rate
performance gain of 1.8 dB.",
}

@ARTICLE{Stik9201:Bit,
AUTHOR="Eduard F. Stikvoort and Jeannet A. C. v. Rens",
TITLE="An All-Digital Bit Detector for Compact Disc Players",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="191-200",
MONTH=jan,
YEAR=1992,
REFERENCES=9,
ABSTRACT="A bit detector is described which is suitable for integration
using digital VLSI technology. In the bit detector the signal is sampled
at a fixed clock frequency which is not related to the bit rate of the
input signal. The incoming bits are detected by comparing to the
digitized input signal with the output of an all-digital PLL, which
regenerates the bit clock that is present in the input signal. The
design must be sufficiently robust to handle deviations in the physical
size of the pits and disturbances like dropouts. Experimental
optimization of the bit detector is performed with the aid of a hardware
realization.",
}

@ARTICLE{Liu9201:Jitter,
AUTHOR="Minkui Liu",
TITLE="Jitter Model and Signal Processing Techniques for High-Density
Optical Data Storage",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="201-213",
MONTH=jan,
YEAR=1992,
REFERENCES=24,
ABSTRACT="This paper discusses a jitter model and signal processing
techniques for data recovery in pulse width modulation (PWM) optical
recording. In PWM, information is stored through modulating size of
sequential marks alternating in magnetic polarization or in material
structure. Jitter, defined as the deviation from the original mark size
in the time domain, will result in error detection if it is excessively
large. This paper takes a new approach in data recovery by first using a
high-speed counter clock to convert time-marks to amplitude-marks, and
uses signal processing techniques to minimize jitter according to the
jitter model. The jitter model considered in this paper takes into
account jitter from both the write and read process, and the signal
processing techniques include: 1) velocity and intersymbol interference
equalization; 2) differential interleaving detection (DID); 3) additive
interleaving detection (AID); 4) differential interleaving modulation
(DIM); and 5) additive interleaving modulation (AIM). These techniques
are found to be effective in reducing the mark error rate (MER). Various
modulation codes can be used in addition to the signal processing
techniques to achieve better modulation efficiency.",
}

@ARTICLE{Immi9201:Prefix,
AUTHOR="Kees A. Immink and Henk D. L. Hollmann",
TITLE="Prefix-Synchronized Run-Length-Limited Sequences",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="214-222",
MONTH=jan,
YEAR=1992,
REFERENCES=17,
ABSTRACT="Run-length-limited sequences, or (d,k) sequences, are used in
recording systems to increase the efficiency of the channel.
Applications are found in digital recording devices such as
sophisticated computer disk files and numerous domestic electronics such
as stationary- and rotary-head digital audio tape recorders, the compact
disc, and floppy disk drives. In digital recorders, the coded
information is commonly grouped in large blocks, called frames. Each
frame starts with a synchronization pattern, or marker, used by the
receiver to identify the frame boundaries and to synchronize the
decoder. In most applications, the sync pattern follows the prescribed
(d,k) constraints, and it is unique; that is, in the encoded sequence,
no block of information will agree with the sync pattern except those
specifically transmitted at the beginnings of the frames. Usually, the
above arrangement is termed prefix-synchronized format. The
prefix-synchronized format imposes an extra constraint on the encoded
sequences, and will therefore result in a loss of capacity. There is an
obvious loss in capacity resulting from the fact that the sender is
periodically transmitting sync patterns, and there is a further loss in
capacity since the sender is not permitted to transmit patterns equal to
the sync pattern during normal transmission. The relative reduction in
channel capacity associated with the imposition of this additional
channel constraints is calculated. Examples of (d,k) codes that permit
the prefix-synchronization format, based for the purpose of illustration
on the sliding-block coding algorithm, are presented.",
}

@ARTICLE{Howe9201:Shift,
AUTHOR="Dennis Howe and Hugh M. Hilden",
TITLE="Shift Error Propagation in 2, 7 Modulation Code",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="223-232",
MONTH=jan,
YEAR=1992,
ABSTRACT="In digital recording, the channel data errors that are caused
by noise and distortion increase with temporal data rate and spatial
storage density. These channel data errors are essentially",
}

@ARTICLE{Ragh9201:Cutoff,
AUTHOR="Sreenivasa A. Raghavan and J. Wolf and L. B. Milstein",
TITLE="On the Cutoff Rate of a Discrete Memoryless Channel with (d,k)-
Constrained Input Sequences",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="233-241",
MONTH=jan,
YEAR=1992,
REFERENCES=14,
ABSTRACT="The cutoff rate of a discrete memoryless channel whose input
sequences are from a (d,k) encoder is investigated. A rational rate
(d,k) encoder is considered as a finite state machine and
maximum-likelihood decoding is used to compute the cutoff rate. Some
commonly used (d,k) codes, such as the rate 1/2 (1,3) code with a
two-state encoder, the IBM rate 2/3 (1,7) code having a five-state
encoder, the IBM rate 1/2 (2,7) code with a seven-state encoder, are
used to illustrate the cutoff rate computation. Results are presented
for both the binary symmetric channel (BSC) and the Gaussian noise
channel. The performance of a decoder designed for noiseless
transmission of (1,3) code is compared to that of a maximum-likelihood
decoder for the (1,3) code. It is also shown that for the case of the
Gaussian noise channel, we gain about 1.7 dB in signal-to-noise ratio by
using 3-bit soft decisions over hard decisions.",
}

@ARTICLE{Kerp9201:Maximum,
AUTHOR="Kenneth Kerpez and Ayis Gallopoulos and Chris Heegard",
TITLE="Maximum Entropy Charge-Constrained Run-Length Codes",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="242-253",
MONTH=jan,
YEAR=1992,
ABSTRACT="This paper presents a study of runlength-limiting codes that
have a null at ``zero frequency'' or ``dc.'' The class of codes or
sequences considered is specified by three parameters: (d, k, c). The
first two constraints, d and k, put lower and upper bounds on the
runlengths, while the ``charge constraints,'' c, is responsible for the
spectral null. A description of the combined (d, k, c) constraints, in
term of a variable length graph, and its adjacency matrix, A(D), are
presented. This new approach to describing these constraints leads to a
concise description of many properties of the charge-constrained codes.
The maximum entropy description of the constraint described by a
runlength graph is presented as well as the power spectral density. The
results are used to study several examples of (d, k, c) constraints: the
(d=0, k=1, c=1) constraint (which is equivalent to the ``FM''
code),the(d=1, k=3, c=3) constraint (which has capacity 1/2), and the
(0ódó2, k=3, c=2) constraints. The procedures of finding the
maxi-entropy distribution and power spectral density involve the
determination of certain eigenvalues and eigenvectors of an associated
with adjacency matrix A(D). The eigenvalues and eigenvectors of the
classes of (d, k=2c-1, c) and (d, k=d+1, c) constraints for (c =
1,2,...), are shown to satisfy certain second-order recursive equations.
These equations are solved using the theory of Tchebysheff polynomials.
The results obtained are useful tools to compute the maximum entropy
distributions and power spectral densities of many constraints.",
}

@ARTICLE{Marc9201:Two,
AUTHOR="Michael W. Marcelin and H. Weber",
TITLE="Two-Dimensional Modulation Codes",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="254-266",
MONTH=jan,
YEAR=1992,
REFERENCES=13,
ABSTRACT="A new class of run-length-limited codes is introduced. These
codes are called two-dimensional or multitrack modulation codes. Two-
dimensional modulation codes provide substantial data storage density
increases for multitrack recording systems by operating on multiple
tracks in parallel. Procedures for computing the capacity of these new
codes are given along with fast algorithms for implementing these
procedures. Examples of two-dimensional codes are given to provide a
comparison between the encoding rates obtainable with multitrack and
traditional single-track codes.",
}

@ARTICLE{Hawt9201:Error,
AUTHOR="Christopher R. Hawthorne and Elvino S. Sousa and A. Leon-Garcia
and Jui L. Yen",
TITLE="An Error-Correction Scheme for a Helical-Scan Magnetic Data
Storage System",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="267-276",
MONTH=jan,
YEAR=1992,
REFERENCES=14,
ABSTRACT="An error-correction scheme for a helical-scan magnetic
recording system is presented. The system consists of a commercial VHS
video cassette recorder with the front-end electronics adapted for
high-speed digital recording. Error statistics have been collected and
show a bursty error recording channel both within each track and from
track-to-track. The proposed error-correction scheme uses interleaving
Reed-Solomon codes. The interleaving function consists of a two-level
interleaver performing tract interleaving and byte interleaving. An
efficient interleaver implementation is presented.",
}

@ARTICLE{Spen9201:Simulated,
AUTHOR="Richard Spencer",
TITLE="Simulated Performance of Analog Viterbi Detectors",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="277-288",
MONTH=jan,
YEAR=1992,
REFERENCES=23,
ABSTRACT="The reasons for pursuing analog implementations of the Viterbi
algorithm for detection are presented. Some of the tradeoffs to be
considered in choosing an analog architecture are discussed, and a
suitable architecture for investigation is given. Simulation results
based on the chosen architecture are presented and clearly show that
analog implementations are worth pursuing. In addition, the simulation
results provide quantitative guidelines for establishing the required
specifications of the individual circuit blocks required to construct a
Viterbi detector.",
}

@ARTICLE{Pai9201:Simple,
AUTHOR="Patrick Pai and A. A. Abidi and Ramon A. Gomez",
TITLE="A Simple Continuous-Time Equalizer for Use in Magnetic Storage
Read Channels",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=1,
PAGES="289-299",
MONTH=jan,
YEAR=1992,
REFERENCES=28,
ABSTRACT="A four-pole continuous-time equalizer has been developed to
minimize the error rate in rigid-disk magnetic storage channels
employing peak detector at high recording densities. The equalizer
outperforms more complex structures proposed for this task, and is well
suited for implementation as an analog CMOS active filter with low power
dissipation. The filter has been designed using measured waveforms of
signal and noise in different types of disk drives, and its
constellation of four poles and a zero appears to be useful for several
types of magnetic media.",
}

@ARTICLE{Li9201:Space,
AUTHOR="Song Li",
TITLE="Performance of a Non-Blocking Space-Division Packet Switch with
Correlated Input Traffic",
JOURNAL=ieeecom,
MONTH=jan,
YEAR=1992,
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 source on a link
supports one call at a time. Each call experiences the alternation of ON
and OFF periods, and generates packets periodically while in ON period.
The stochastic property of each call does not have to be identical.
Packets from each individual call are destined to the same output. The
output address of each call is assumed to be uniformly assigned in
random. In this multimedia corrrelated input traffic environment, we
derive both upper and lower bounds of the maximum throughput at system
saturation. Our study indicates that, if the source access rate is
substantially lower than the link transmission rate, the effect of input
traffic correlation on the output contentions can generally be ignored.
Notet that the large disparity between link transmission rate and source
access rate always exist in most practical systems. Therefore, not only
the input traffic correlation can be neglected in the maximum throughput
analysis, but also the analysis of each input queue becomes separable
from the rest of the switch. The service time of each input queue in the
separate analysis is characterized by an independent renewal process.
The same study is carrired out with nonuniform call address
assignement.",
URL="http://www.ece.utexas.edu/~sanqi/papers.html",
}

@TECHREPORT{Want9202:Active,
AUTHOR="Roy Want and Andrew Hopper",
TITLE="Active badges and personal interactive computing objects",
TYPE="Technical Report",
INSTITUTION="Olivetti Research",
ADDRESS="Cambridge, England",
NUMBER="ORL 92-2",
NOTE="also in {\em IEEE Transactions on Consumer Electronics}, Feb.
1992",
MONTH=feb,
YEAR=1992,
KEYWORDS="active badges; mobile computing; user location",
ABSTRACT="This paper describes a family of personal active badges
developed for location of people and devices in the computer
environment. Applications include location and paging of individuals as
well as control of computer systems. Active badges are one type of a
range of portable computers connected to cordless communicatio systems
that can now be made. Because of their small size and application such
devices are referred to as personal interactive computing objects or
PiCOs. A speculative discussion of how such devices may be used in the
traditional computing environment is given.",
ANNOTE="infrared-based devices transmitting every 15 seconds; 9600-baud
slave station with FIFO attached to wired-or serial bus; added 150 kHz
radio responder for challenge/response authentication",
}

@TECHREPORT{Auds9202:Applying,
AUTHOR="N. C. Audsley and A. Burns and M. F. Richardson and K. Tindell
and A. J. Wellings",
TITLE="Applying New Scheduling Theory to Static Priority Preemptive
Scheduling",
INSTITUTION="Department of Computer Science, University of York",
NUMBER="RTRG/92/120",
MONTH=feb,
YEAR=1992,
}

@TECHREPORT{Chan9202:Stability1,
AUTHOR="C. J. Chang",
TITLE="Stability, queue length and delay, part {I:} deterministic
queueing networks",
TYPE="Research Report",
INSTITUTION="IBM Resarch Division",
ADDRESS="Yorktown Heights, New York",
NUMBER="RC 17708 (\#77962)",
MONTH=feb,
YEAR=1992,
KEYWORDS="stability; queueing theory; queueing networks; bounding",
ABSTRACT="In this paper we identify conditions for deterministic queuing
networks that render bounded delays for customers. These conditions are
referred to as stability conditions for deterministic queues. Parallel
to the three classical stability conditions, stationarity, ergodicity
and the traffic condition, for queue with random inputs, we use the
notions of envelope process, subadditivity and the traffic condition as
the stability conditions for deterministic queues. An envelope process
is a bounding process for an input process with respect to an arbitrary
shift of time. This shift invariant condition is similar to the
stationarity condition in a stochastic setting. Analogous to ergodicity,
subadditivity guarantees the existence of an average rate for an
envelope process. We show that the delay in a single queue is bounded
under a work-conservative scheduling policy if the mimimum envelope
rate, which is the average rate of the smallest envelope process, is
less than the capacity. Moreover, the delay cannot be bounded if the
minimum envelope rate is larger than the capacity. Similar results are
extended to multiclass networks with feedforward routing. For networks
with nonfeedforward routing, we show that the stability result holds for
networks with a single class of customers under the First Come First
Served (FCFS) policy. Various scheduling policies that stabilize
multiclass networks with nonfeedforward routing are discussed, and a
sufficient condition for the stability under the FCFS policy is given.",
}

@TECHREPORT{Chan9202:Stability2,
AUTHOR="C. J. Chang",
TITLE="Stability, queue length and delay, part {II:} stochastic queueing
networks",
TYPE="Research Report",
INSTITUTION="IBM Research Division",
ADDRESS="Yorktown Heights, New York",
NUMBER="RC 17709 (\#77963)",
MONTH=feb,
YEAR=1992,
KEYWORDS="stability; queueing networks; effective bandwidth; queueing
theory; bounds; access control",
ABSTRACT="In this paper, we extend our results in Part I from
deterministic to stochastic networks. Our objectives are (i) to provide
a tool to compute simple bounds for the tail distributions of delays and
queue lengths and (ii) to answer stability problems similar to those in
deterministic queueing networks. We say a random variable $X$ is bounded
exponentially with respect to $\theta$ $(0<\theta \infty)$ if the
$\theta$-norm of $\exp(X)$ is finite, or equivalently the moment
generating function of $X$ is finite with respect to $\theta$. Parallel
to the development in deterministic queueing networks, we consider
envelope processes and derive input-output relations between arrival
processes and departure processes. Based on these input-output
relations, we show that the queue length can (resp. cannot) be bounded
exponentially with respect to $\theta$ if the minimum envelope rate is
smaller (resp. larger) than the capacity. Similar results hold for the
delays of customers if the scheduling policy is First Come First Served
(FCFS), and can be extended to acyclic networks with multiclasses of
customers. Moreover, when restricting to two-state Markov modulated
arrival processes, the minimum envelope rate are shown to be equivalent
to the recently developed notion of effective bandwidths in
communication networks. For a single class nonfeedforward network with
i.i.d. Bernoulli routing, the queue length at each queue can be bounded
exponentially with respect to $\theta$ if a certain traffic condition is
satisfied. Under a weaker traffic condition, we show that the total
number of customers in the system can be bounded exponentially with
respect to $\theta/I$, where $I$ is the number of queues in the network.
As an application, we propose a tentative solution to the access control
problem of communication networks.",
}

@ARTICLE{Cohe9202:Exocentric,
AUTHOR="Michael Cohen and Nobuo Koizumi",
TITLE="Exocentric control of audio imaging in binaural
telecommunication",
JOURNAL=ieice_fundamentals,
VOLUME="E75-A",
NUMBER=2,
PAGES="164-170",
MONTH=feb,
YEAR=1992,
KEYWORDS="audio windows; CSCW; groupware; sound field control;
teleconferencing; audio localization; sound localization; stereo",
ABSTRACT="Sound field telecommunication describes a voice communication
system, intended to implement a virtual meeting, in which participants
at distant sites experience the sensation of sharing a single room for
conversation. Binaural synthesis reconstructs the sound propagation
pattern of a particular room or environment in the vicinity of each ear,
which seems appropriate for a personal multimedia environment.
Localization cues in spatial hearing comprise both a sink's transfer
function and source attenuation. Sink directional cues are captured by
binaural head related transfer function (HRTFs). Source attenuation is
modeled as a frequency-independent function of the direction,
dispersion, and distance of the source, capturing sensitivity,
amplification, and mutual position. Audio windows, aural analogues of
video windows, can be thought of as a user interface to binaural sound
presentation for a teleconferencing system. Exocentric representation of
audio window entities allows manipulation of all teleconferees in a
projected egalitarian medium. We are implementing a system that combines
dynamically selected HRTFs with dynamically determined source and sink
positions, azimuth, focus and size parameters, controlled via iconic
manipulation in a graphical window. With such an interface, users may
arrange a virtual conference environment, steering the virtual position
of the teleconferees.",
}

@ARTICLE{Haya9202:Increase,
AUTHOR="S. Hayashi",
TITLE="Increase in binaural articulation score by simulated localization
using head-related transfer function",
JOURNAL=ieice_fundamentals,
VOLUME="E75-A",
NUMBER=2,
PAGES="149-154",
MONTH=feb,
YEAR=1992,
KEYWORDS="head-related transfer function; audio localization; phoneme
articulation; stereo; cocktail party effect; inverse filter;
teleconferencing",
ABSTRACT="Binaural effects in two measures are studied. One measure is
the detectable limen of click sounds under lateralization of diotic or
dichotic noise signals, and the other is phoneme articulation score
under localization or lateralization of speech and noise signals. The
experiments use a headphones system with listener's own head related
transfer function (HRTF) filters. The HRTF filter coefficients are
calculated individually from the impulse responses due to the listeners
HRTF measured in a slightly sound reflective booth. The frequency
response of the headphone is compensated for using an inverse filter
calculated from the response at the subject's own ear canal entrance
point. Considering the speech frequency band in tele-communication
systems is not sufficiently wide, the bandwidth of the HRTF filter is
limited below 6.2 kHz. However, the experiments of the localization
simulation in the horizontal plane show that the sound image is mostly
perceived outside the head in the simulated direction. Under simulation
of localization or lateralization of speech and noise signals, the
phoneme articulation score increases when the simulation spatially
separates the phonemes from the noise signals while the total signal to
noise ratio for both ears is maintained constant. This result shows the
binaural effect in speech intelligibility under the noise disturbance
condition, which is regarded as a part of the cocktail party effect.",
}

@ARTICLE{Wald9202:Spawn,
AUTHOR="Carl A. Waldspurger and Tad Hogg and Bernardo A. Huberman and J.
O. Kephart and W. Scott Stornetta",
TITLE="Spawn: A Distributed Computational Economy",
JOURNAL=ieeese,
VOLUME=18,
NUMBER=2,
PAGES="103-117",
MONTH=feb,
YEAR=1992,
}

@PHDTHESIS{Pare9202:Generalized,
AUTHOR="Abhay Parekh",
TITLE="A Generalized Processor Sharing Approach to Flow Control in
Integrated Services Networks",
SCHOOL="Laboratory for Information and Decision Systems, Massachusetts
Institute of Technology",
ADDRESS="Cambridge, Mass.",
NUMBER="LIDS-TH-2089",
MONTH=feb,
YEAR=1992,
}

@INPROCEEDINGS{Hofm9202:Parallel,
AUTHOR="Bernd Hofmann and W. Effelsberg and Thomas Held and H. König",
TITLE="On the Parallel Implementation of {OSI} Protocols",
BOOKTITLE="IEEE Workshop on the Architecture and Implementation of High
Performance Communication Subsystems (HPSC)",
ADDRESS="Tucson, Arizona",
MONTH=feb,
YEAR=1992,
}

@TECHREPORT{Lee9206:Scalable,
AUTHOR="E. Lee and Pi-Chun Chen and John Hartman and A. L. Drapeau and
Ethan L. Miller and Randy H. Katz and G. A. Gibson and D. A. Patterson",
TITLE="{RAID-II:} A Scalable Storage Architecture for High-Bandwidth
Network File Service",
INSTITUTION="University of California at Berkeley",
NUMBER="UCB/CSD 92/672",
MONTH=feb,
YEAR=1992,
URL="ftp://ftp.cs.berkeley.edu/ucb/raid/papers/tech92\_672.ps.Z",
}

@TECHREPORT{Alle9202:Lowest,
AUTHOR="Brian D. Alleyne and Chi-Kai Chien and Isaac Scherson",
TITLE="Lowest Common Ancestor Interconnection Networks",
TYPE="Technical Report",
INSTITUTION="University of California, Irvine, Department of Information
and Computer Science",
NUMBER="ICS-TR-92-19",
PAGES=17,
MONTH=feb,
YEAR=1992,
ABSTRACT="Lowest Common Ancestor (LCA) networks are built using switches
capable of connecting $u+d$ inputs/outputs in a permutation pattern. 
For $n$ source nodes and $l$ stages of switches, $n/d$ switches are used
in stage $l-1,(n/d)-(u/d)$ in stage $l-2$, and in general,
$(n-u^(l-i-1))/d^(l-i)$ switches in stage $i$.  The resulting
hierarchical structure posseses interesting connectivity and
permutational properties.  A full characterization of LCA networks is
presented together with a permutation routing algorithm for a family of
LCA networks.  The algorithm uses the network itself to collect and
disseminate information about the permutation.  A schedule of $O(dp
\log\_(d/u) n)$ passes is obtained with a switch set-up cost factor of
$O(\log\_(d/u) n)$ ($p$ is the minimum number of passes that an
algorithm with global knowledge schedules).",
}

@TECHREPORT{Danz9202:Probabilistic,
AUTHOR="Peter Danzig",
TITLE="Probabilistic Error Checkers: Fixing {DNS}",
INSTITUTION="USC",
MONTH=feb,
YEAR=1992,
URL="ftp://catarina.usc.edu/pub/danzig/nsfnet.ps.Z",
}

@ARTICLE{Yama9202:Limitation,
AUTHOR="Naoaki Yamanaka and Y. Sato and K. Sato",
TITLE="Performance Limitation of Leady Bucket Algorithm for Usaga
Parameter Control and Bandwidth Allocation Methods",
JOURNAL=ieice_communications,
VOLUME="E75-B",
NUMBER=2,
PAGES="82-86",
MONTH=feb,
YEAR=1992,
KEYWORDS="leaky bucket; homogeneous; stochastic; multiplex; tri-state;
worst case",
}

@TECHREPORT{Burk9202:Refined,
AUTHOR="Anthony N. Burkitt and Peer Ueberholz",
TITLE="Refined pruning Techniques for Feed-Forward Neural Networks",
INSTITUTION="Dept. of Computer Science, Australian National University",
ADDRESS="Canberra 0200 ACT, Australia",
NUMBER="TR-CS-92-01",
MONTH=feb,
YEAR=1992,
}

@TECHREPORT{Kvol9202:Traffic,
AUTHOR="Kenn S. Kvols and Søren Blaabjerg",
TITLE="Traffic Characterization and {QOS} Estimation Methods in
{B-ISDN}",
INSTITUTION="KTAS",
ADDRESS="Copenhagen, Denmark",
PAGES=6,
MONTH=feb,
YEAR=1992,
KEYWORDS="ATM; traffic source model",
ABSTRACT="This paper considers traffic characterization and QOS
estimation in B-ISDN.  First the issues of traffic parameters is
considered, and it is suggested to introduce an ordering between the
parameters negotiated at connection setup, the parameters used by the
traffic enforcement function, and the parameters used for admission
control, to ensure a flexibility in the choice of traffic enforcement
function.",
}

@INPROCEEDINGS{Golu9202:Chained,
AUTHOR="L. Golubchik and J. C.S. Lui and R. R. Muntz",
TITLE="Chained Declustering: Load Balancing and Robustness to Skew and
Failure",
BOOKTITLE="RIDE-TQP Workshop",
MONTH=feb,
YEAR=1992,
}

@TECHREPORT{Lunt9202:Real,
AUTHOR="T. Lunt and A. Tamaru and F. Gilham and R. Jagannathan and P.
Neumann and H. Javitz and A. Valdes and T. Garvey",
TITLE="A Real-time Intrusion Detection Expert System {(IDES)} - final
technical report",
INSTITUTION="Computer Science Laboratory, SRI International",
ADDRESS="Menlo Park, California",
MONTH=feb,
YEAR=1992,
}

@ARTICLE{Abra9202:Fundamentals,
AUTHOR="N. Abramson",
TITLE="Fundamentals of Packet Multiple Access for Satellite Networks",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=2,
PAGES="309-316",
MONTH=feb,
YEAR=1992,
REFERENCES=24,
ABSTRACT="The fundamental objectives which guide the design of a packet
multiple access technique for satellite networks with large numbers of
earth stations are explained. Among these objectives are low peak power
in the transmitters, low average power from the satellite transponder,
high channel capacity, and low complexity of the multiple access
receiver. In this paper we review the fundamentals of satellite packet
multiple access and relate these fundamentals of satellite packet
multiple access and relate these fundamentals to the objective listed
above. Code division multiple access (CDMA) and ALOHA multiple access
are described in terms of fundamentals. Finally, we describe a simple
linear transformation of conventional ALOHA access, called spread ALOHA.
For the case of a low signal-to-noise ratio in the receiver and a low
duty cycle of individual and identical transmitters, it is not possible
to find a multiple access method at the same average power and the same
bandwidth which is more efficient than spread ALOHA.",
}

@ARTICLE{Wang9202:Frequency,
AUTHOR="Q. R. Wang and Yuying Chao",
TITLE="Frequency-Hopped Multiple Access Communications with Coding and
Side Information",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=2,
PAGES="317-327",
MONTH=feb,
YEAR=1992,
REFERENCES=14,
ABSTRACT="In this paper, we consider frequency-hopped spread-spectrum
multiple access communications employing M-ary modulation and error
correlation coding. Our major concerns are multiple access interference
and the network capacity in terms of the number of users that can
transmit simultaneously for a given level of codeword error probability.
While the first part of the performance analysis applies to any M-ary
modulation scheme, M-ary FSK is of special interest for it has been
considered for EHF satellite communications. Block coding is studied in
detail. We first consider the use of Q-ary Reed-Solomon (RS) codes in
combination with M-ary modulation with mismatched alphabets so that Q >
M, which is most likely in practice. It is shown that the network
capacity is drastically reduced in comparison with the system with
matched alphabets. As a remedy, we propose the use of matched M-ary BCH
codes as an alternative to mismatched RS codes. It is shown that when
the number of users in the system is large, a BCH code outperforms an RS
code with a comparable code rate and decoding complexity. The larger the
number of users, the better the BCH code performs. It has been known
that the perfect information regarding whether a hop is hit by other
users can remarkably increase the network capacity. In reality, however,
such perfect side information cannot to be obtained. In this paper, we
consider the use of a robust technique for generation of reliable side
information based on a radio-threshold test. We analyze its performance
in conjunction with MFSK and error-erasure correction decoding. It is
shown that this nonideal ratio-threshold method can surprisingly
increase the network capacity in comparison with the system with perfect
side information.",
}

@ARTICLE{Gaud9202:Bandlimited,
AUTHOR="Riccardo De Gaudenzi and Carlo Elia and Roberto Viola",
TITLE="Bandlimited Quasi-Synchronous {CDMA:} A Novel Satellite Access
Technique for Mobile and Personal Communication Systems.",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=2,
PAGES="328-343",
MONTH=feb,
YEAR=1992,
REFERENCES=16,
ABSTRACT="Recent trends in digital communications are opening commercial
applications to code division multiple access (CDMA). In this paper, a
novel access technique based on bandlimited quasi-synchronous CDMA
(BLQS-CDMA) is described, showing all the advantages of synchronizing
conventional direct sequence CDMA to drastically reduce the effect of
self-noise. Bandlimitation is achieved with no detection loss by means
of Nyquist chip shaping, leading to a simple all-digital demodulator
structure. Detection losses due to imperfect carrier frequency and chip
timing synchronization are analytically derived and numerical results
checked by computer simulations. Impairments due to satellite
transponder distortions are also evaluated. The full digital modem
structure is presented together with possible application to mobile and
VSAT satellite communications.",
}

@ARTICLE{Kim9202:Frequency,
AUTHOR="Sang Wu Kim",
TITLE="Frequency-Hopped Spread-Spectrum Random Access with
Retransmission Cutoff and Code Rate Adjustment",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=2,
PAGES="344-349",
MONTH=feb,
YEAR=1992,
REFERENCES=8,
ABSTRACT="A transmission policy is examined for frequency-hopped spread-
spectrum random access communication systems, in which the
retransmission of a blocked packet at each station is determined as a
function of that station's own collision experience. For stability
considerations and for channel throughput increase, the information
packet is encoded by a Reed-Solomon code. An equilibrium analysis is
employed to show that undesirable bistable behavior can be avoided if
packets are rejected after a certain number of transmission attempts and
the code rate is adjusted accordingly. The region of code rate and
number of transmission attempts pairs that guarantees the network
stability is investigated. The packet rejection probability, average
packet delay, and maximum stable throughput are evaluated.",
}

@ARTICLE{Nee9202:Direct,
AUTHOR="Richard {Van Nee} and Howard S. Misser and Ramjee - Prasad",
TITLE="Direct-Sequence Spread Spectrum in a Shadowed Rician Fading
Land-Mobile Satellite Channel",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=2,
PAGES="350-357",
MONTH=feb,
YEAR=1992,
REFERENCES=17,
ABSTRACT="The performance of a direct sequence spread-spectrum land-
mobile satellite transmission system, using binary phase shift keying
(BPSK) modulation, is analyzed. The satellite channel is modeled as
having shadowed Rician fading characteristics. The bit error probability
is evaluated, considering both the envelope and the phase variation.
Assuming a Gaussian approximation for the interference, numerical
results are obtained for both spread-spectrum and narrowband land-mobile
satellite communication systems with BPSK modulation. A comparison of
the two systems is made for light, average, and heavy shadowing.",
}

@ARTICLE{Levi9202:Rain,
AUTHOR="Barry K. Levitt",
TITLE="Rain Compensation Algorithm for {ACTS} Mobile Terminal",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=2,
PAGES="358-363",
MONTH=feb,
YEAR=1992,
REFERENCES=14,
ABSTRACT="Having successfully completed the L-band mobile satellite
experiment (MSAT-X), the Jet Propulsion Laboratory is now developing a
system to demonstrate Ka-band land-mobile satellite communication
technologies in conjunction with NASA's Advanced Communication
Technology Satellite (ACTS). The experiment will involve two-way
communications between a fixed terminal (FT) in Cleveland and a van-
mounted ACTS mobile terminal (AMT) using the satellite in a bent-pipe
(30 GHz uplink, 20 GHz downlink) relay mode. Although AMT will initially
be located in the greater Los Angeles area, it is designed to operate
satisfactorily anywhere within the contiguous United States (CONUS). To
a far greater extent than MSAT-X, AMT must cope with the impact of
propagation effects on link performance, with particular concern for
rain attenuation. This paper describes a novel technique for
ameliorating the effects of rain fading on AMT communications by varying
the data rate in response to real-time power measurements of the pilot
signal received by AMT and the ACT beacons received by the FT. the AMT
rain-compensation algorithm (RCA) employs both fade and fade-rate
statistics to determine the appropriate data rate, and uses empirical
frequency-scaling formulas, described herein, to accommodate any
differences between the measured fading signal and the communications
link. A worst-month rain attenuation model is used to argue that the RCA
will boot the AMT-ACTS-FT link availability, defined as the percentage
of time that the performance margin exceeds 3 dB, from 97.2\% when the
AMT is in Los Angeles, and from 90.5\% to 98.1\% in Portland, ME where
rain events are more of a factor.",
}

@ARTICLE{Varm9202:Incremental,
AUTHOR="A. Varma and Suresh Chalasani",
TITLE="An Incremental Algorithm for {TDM} Switching Assignments in
Satellite and Terrestrial Networks",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=2,
PAGES="364-377",
MONTH=feb,
YEAR=1992,
REFERENCES=12,
ABSTRACT="We present an increment algorithm for scheduling traffic in a
general class of time division multiplexed (TDM) switching systems
employed in satellite and terrestrial communication networks. This class
of switching systems, known as hierarchical switching systems (HSS's),
has a three-tiered structure with one stage of concentration followed by
switching and distribution. Instead of recomputing the time slot
assignment (TSA) for each frame of traffic, our algorithm computes a TSA
for a new frame by modifying the known TSA of the previous frame. The
algorithm takes O(M^2 + cM) time for finding an optimal TSA in
hierarchical switching system, where M is the number of users and c the
number of changes between the traffic demands of two consecutive frames.
The algorithm uses a two-step process. The first step transforms the TSA
problem in the HSS into an equivalent TSA problem in a simple TDM
switching system. The second step uses an incremental algorithm to find
a TSA for the latter. The second step exploits the correspondence
between the TSA problem and the rearrangement problem in a Clos
three-stage network. When the traffic demands in consecutive frames
overlap to a significant extent, the incremental algorithm provides
considerable speedup over previous algorithms.",
}

@ARTICLE{Elha9202:New,
AUTHOR="A. K. Elhakeem and Stephen Bohm and Mohamed Hachicha and Tho
Le-Ngoc and Hussein Mouftah",
TITLE="Analysis of a New Multiaccess/Switching Techinque for Multibeam
Satellites in a Prioritized {ISDN} Environment",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=2,
PAGES="378-390",
MONTH=feb,
YEAR=1992,
REFERENCES=15,
ABSTRACT="In this paper, we pursue a performance analysis to compute the
various packet loss, call blocking, and packet delays of a typical user
in an integrated voice data-video satellite internetworking environment.
The uplink technique employed is a hybrid packet/circuit switched
approach of the Demand Assignment type, which the downlink is a TDM
technique. On board the satellite, a baseband nonblocking (NXN) switch
is employed to route the packets from input to output ports. Various
amount of input and output buffering as well as priority rules and
blocking resolution algorithms are employed. In the following, we
conduct a performance analysis for the problems at hand and identify the
best ranges for the different parameters involved.",
}

@ARTICLE{Shin9202:SS,
AUTHOR="Hideyuki Shinonaga and Y. Ito",
TITLE="{SS/FDMA} Router for Flexible Satellite Communications Networks",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=2,
PAGES="391-400",
MONTH=feb,
YEAR=1992,
REFERENCES=6,
ABSTRACT="The subchannel switched frequency-division multiple access
(SS/FDMA) system improves the routing flexibility of transponder banks
in channelized multibeam satellites. This system can efficiently be
utilized to construct a VSAT (very small aperture terminal) network
and/or a business satellite communications network using small aperture
terminals. The present paper addresses the application of the SS/FDMA
system to such networks. A proof-of-concept (POC) model of an SS/FDMA
on-board equipment called the SS/FDMA router is described in terms of
its configuration and measured electrical performance. Results of
transmission experiments using the POC model as well as computer
simulation are presented. In addition, a redundant SS/FDMA router
configuration is proposed, and its reliability is calculated for a
15-year satellite mission time. Finally, estimated values of volume,
mass, and dc power consumption of the redundant SS/FDMA router are
presented.",
}

@ARTICLE{Palm9202:Personal,
AUTHOR="L. Palmer and Enrique Laborde and Alan Stern and Philip Y.
Sohn",
TITLE="A Personal Communications Network Using a Ka-Band Satellite",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=2,
PAGES="401-417",
MONTH=feb,
YEAR=1992,
REFERENCES=10,
ABSTRACT="The feasibility of a personal communications network using
portable terminals that can provide 4.8 Kb/s voice communications to a
hub station via a Ka-band geosynchronous satellite has been
investigated. Tradeoffs are examined so that the combined system of hub
and gateway earth stations, the satellite, and the personal terminals
can provide a competitive service in terms of cost, availability, and
quality. A baseline system that uses a spacecraft with approximately 140
spot beams to cover CONUS and 5 W power amplifiers in each beam is
described. Satellite access in both the forward and return directions
uses frequency division multiple access/ code division multiple access
(FDMA/CDMA) with a chip rate of 2.5 Mchip/s. The development of such a
system at Ka-band can follow only after technological developments in
the areas of critical RF elements including antennas and high-power
amplifiers (HPA's) at 30 GHz and experiments to demonstrate some of the
features of the portable terminal concept.",
}

@ARTICLE{Kani9202:Global,
AUTHOR="Jaidev Kaniyil and Jun Takei and S. Shimamoto and Y. Onozato and
Tomonori Usui and Ikuo Oka and Takashi Kawabata",
TITLE="A Global Message Networking Employing Low Earth-Orbiting
Satellites",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=2,
PAGES="418-427",
MONTH=feb,
YEAR=1992,
REFERENCES=10,
ABSTRACT="A global message communication network for low density
traffic, employing satellite at low altitudes, is the subject of this
paper. This network affords round the clock service to any part of the
globe, including the polar regions. Such a network can accommodate
static and mobile user terminals simultaneously. The oblate globe is
modeled as a regular polyhedron with 12 facets for setting up the
orbits. Satellite are positioned uniformly in low-altitude symmetrical
orbits. The symmetrical orbits are those whose axes are symmetrical in
the three- dimensional space. We study the coverage aspects of the
6-orbit scheme and the 10-orbit scheme, each with satellites deployed at
an altitude of 5000 km. At this altitude, the terrestrial user terminals
can access over the cross-links is considered to be the slotted ALOHA
scheme. For low density traffic, the down-link and up-link throughput
rates are estimated. Simulation results agree with these analytical
estimations for low values of network offered load.",
}

@ARTICLE{Yang9202:Modeling,
AUTHOR="Oliver Yang and Xin Yao and K. M. S. Murthy",
TITLE="Modeling and Performance Analysis of File Transfer in a Satellite
Wide Area Network",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=2,
PAGES="428-436",
MONTH=feb,
YEAR=1992,
REFERENCES=13,
ABSTRACT="This paper deals with the network modeling and performance
analysis of multimedia file transfer between (LAN's). The LAN's are
linked by a satellite wide area network (SWAN) with a high bandwidth and
high path delay. Our contributions lie in four areas: 1) development of
a fairly accurate interconnection network elements; 2) derivation of
tight upper and lower bounds for the network throughput for both
error-free and error-prone channels using mean value analysis; 3)
validation of the model using computer simulation; and 4) analysis of
the SWAN performance using numerical results for a range of parameters
(file sizes, window size, BER, number of workstations, etc.) for the
case of multimedia satellite wide area network (M-SWAN). Based on the
analysis, performance bottlenecks were also identified for different
operating conditions that could be used to evolve design criteria for
better overall system performance.",
}

@ARTICLE{Tasa9202:Link,
AUTHOR="S. Tasaka",
TITLE="Link-Level Connection Control Schemes in a High-Speed Satellite
Data Network: A Performance Comparison",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=2,
PAGES="437-446",
MONTH=feb,
YEAR=1992,
REFERENCES=11,
ABSTRACT="This paper makes a performance comparison between a
connection- oriented (CO) Logical Link Control (LLC) protocol and a
connectionless (CL) LLC protocol in a high-speed satellite packet
network with the TDMA- Reservation multiple access protocol. In
particular, we examine how the channel transmission rate affects the
performance of the two LLC protocols and then determine which LLC
protocol is more suitable for any given system environment. The
comparison indicates that the CL-LLC protocol has more advantages over
the CO-LLC protocol as the channel transmission rate increases and that
the suitable region for the CL-LLC protocol becomes wider as the
receiver-buffer capacity increases and as the network load decreases.",
}

@ARTICLE{Ohnu9202:New,
AUTHOR="Masahumi Ohnuki and M. Umehira and Hiroshi Nakashima and S.
Kato",
TITLE="A New Satellite Communication System Integrated into Public
Switched {Networks-DYANET}",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=2,
PAGES="447-455",
MONTH=feb,
YEAR=1992,
ABSTRACT="A new system concept of a ``common alternative routing
system'' is proposed for reducing total network costs by integrating
satellite communications into public switched networks, where satellite
systems carry overflow traffic from terrestrial systems through common
satellite channels.  This concept has been realized by a new satellite
communication system called DYANET (dynamic channel assigning and
routing satellite aided digital networks), which provides trunk circuits
in combination with terrestrial systems.  The key technologies developed
for DYANET are a centralized network control system and a transponder
hopping demand assignment TDMA (time division multiple access) system,
to assure single- hop connection and to use satellite channels
efficiently.  This paper describes the system concept and configuration,
the network control system, and the results of its commercial use.",
}

@ARTICLE{Kato9202:TDMA,
AUTHOR="S. Kato and M. Morikura and Shuji Kubota and Hiroshi Kazama and
K. Enomoto and M. Umehira",
TITLE="A {TDMA} Satellite Communication System for {ISDN} Services",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=2,
PAGES="456-464",
MONTH=feb,
YEAR=1992,
REFERENCES=10,
ABSTRACT="This paper proposes a TDMA (time division multiple access)
satellite communication system suitable for both basic and primary ISDN
services in addition to B-channel transmission lines among ISDN
switcher. To provide these service economically and efficiently, the
proposed system employs an offset QPSK burst modem coupled with high-
coding gain and rate forward error correction, demand assignment
technology for each data burst, and a transmission and reception
transponder (carrier) hopping scheme which is the most sophisticated
hopping scheme which is the most sophisticated hopping scheme ever
utilized. Moreover, to realize cost-effective transmission and
subscriber lines and to increase reliability of TDMA terminals, major
functions of TDMA terminals have been implemented in large-scale
integrated circuits (LSIC's), monolithic IC's (MIC's), and hybrid IC's
(HIC's). The experimental results show narrow spectrum transmission with
little bit error probability (Pe) degradation for the offset QPSK burst
modem and perfect operation of demand assignment and carrier hopping
capability of the developed system. These results guarantee the first
use of an offset QPSK burst modem in commercial systems and full
deployment of the developed system to offer ISDN services all over
Japan.",
}

@ARTICLE{Petr9202:Modeling,
AUTHOR="David Petr and K. M. S. Murthy and Victor S. Frost and Lyn A.
Neir",
TITLE="Modeling and Simulation of the Resource Allocation Process in a
Bandwidth-on-Demand Satellite Communications Network",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=2,
PAGES="465-477",
MONTH=feb,
YEAR=1992,
REFERENCES=5,
ABSTRACT="This paper describes the modeling and simulation of an FDMA
satellite bandwidth-on-demand (BOD) service. The class of resource
allocation processes to which the satellite BOD application belongs is
identified and contrasted with more common resource allocation
processes. Within this class, the bidirectional and possibly asymmetric
nature of resource requests, the existence of both booked (advance
notification) and immediate resource requests, the allowing of
modifications to resource requests, and the multiple resource
constraints (e.g., bandwidth and power) present unique modeling
challenges. We divide the modeling problem for this class of problems
into three fundamental components: modeling the resource requests,
modeling the fundamental resource allocation algorithm, and modeling the
processing of individual resource requests. These modeling components
are illustrated with the satellite BOD application. In addition,
simulation of the resource allocation requires three additional
components: an easy-to-use user input interface, performance measures
and statistics gathering, and presentation of simulation results (user
output interface). We present the architecture of our simulation
software (resource allocation analysis program or RAAP^TR) in terms of
these six components. In order to illustrate RAAP's capabilities,
example simulation results are given.",
}

@ARTICLE{Jabb9202:Demand,
AUTHOR="B. Jabbari and David McDysan",
TITLE="Performance of Demand Assignment {TDMA} and Multicarrier {TDMA}
Satellite Networks",
JOURNAL=ieeejsac,
VOLUME=10,
NUMBER=2,
PAGES="478-486",
MONTH=feb,
YEAR=1992,
REFERENCES=19,
ABSTRACT="Demand assignment can be implemented in widely used time
division multiple access (TDMA) and multiple carrier TDMA (MC-TDMA)
system to make efficient use of transmission resources. We develop an
analytical model of satellite communication networks using TDMA and
MC-TDMA to support circuit-switched traffic. The model defines the
functions required to implement fixed assignments (FA), variable
destinations (VD) and demand assignments (DA). Each of these schemes is
considered with and without using traffic activity compression
techniques like digital speech interpolation (DSI). We introduce the
concept of pooling of the satellite capacity resource., for example, in
larger DA systems using TDMA, MC-TDMA, or satellite switched TDMA, so
that the network can have either disjoint pools or combined pools.
Expressions for the required satellite capacity for specified traffic
and performance are derived and some numerical results are presented.
Through the modeling effort it is shown that in thin route applications,
a VD system provides significant efficiency improvements in satellite
capacity utilization over an FA system. DA provides further efficiency,
particularly when there are significant fluctuations in the earth
station traffic. Also, with a sufficiently large assigned portion of the
transmit pool, the required satellite capacity can be further reduced by
employing DSI. Additionally, we demonstrate that the proper pooling of
capacity has a significant impact on the maximum traffic supportable by
the total satellite capacity. We also consider the implementation issues
in MC-TDMA and consider two configurations of single channel per burst
and multiple channel per burst. Although the TDMA and MC-TDMA demand
assignment methods have been discussed within the framework of
communications satellites, nevertheless the analysis and results are
applicable to other fields using these techniques (for example, wireless
radio communications). These results provide the network designer with
the capacity to perform the tradeoffs between efficiency improvements
and the complexity of assignment schemes.",
}

@TECHREPORT{Ofek9202:Integration,
AUTHOR="Y. Ofek and K. Sohraby and Ho-Ting Wu",
TITLE="Integration of Synchronous and Asynchronous Traffic on the
MetaRing Architecture and Its Analysis",
TYPE="Research Report",
INSTITUTION="IBM",
NUMBER=17718,
MONTH=feb,
YEAR=1992,
ABSTRACT="In this paper, we describe and evaluate a protocol for
integrating two types of traffic on the MetaRing Architecture.
Synchronous (reserved or real-time) traffic which is periodic and
requires a connection set-up and will have guaranteed bandwidth and
bounded delay, and asynchronous or bursty traffic with no real-time
constraints that can use the remainder of the bandwidth in a fair
manner. The integration mechanism is functionally equivalent to the
Timed-Token Function in FDDI, which is a shared media ring protocol. The
MetaRing is a slotted or buffer insertion ring with fairness and spatial
bandwidth reuse. Concurrent access and spatial bandwidth reuse enable
the simultaneous transmissions over disjoint segments of a
bi-directional ring and therefore, can increase the effective throughput
in each direction. The fairness mechanism for this architecture is
simple and robust, and it is based on a 1-bit control signal that
regulates the access to the ring. A Markovian state space formulation of
the integration protocol is given. This compact and efficient
formulation which uses only a few state equations is used for the
simulation of the network with arbitrary number of nodes. An upper bound
on the delay of the synchronous traffic is provided to demonstrate the
importance of the integration algorithm. Simulation results are also
presented to show the effects of the fairness and flow control signals
on the performance of the network.",
}

@INPROCEEDINGS{Ahlg9202:Host,
AUTHOR="Bengt Ahlgren",
TITLE="A Host Interface to the {DTM} High Speed Network",
BOOKTITLE="IEEE Workshop on the Architecture and Implementation of High
Performance Communication Subsystems",
ADDRESS="Tucson, Arizona, USA",
MONTH=feb,
YEAR=1992,
LANGUAGE="English",
}

@INPROCEEDINGS{Roet9203:Improving,
AUTHOR="Jürgen Röethig",
TITLE="Improving {DQDB} behavior combining bandwidth balancing and
priority mechanisms",
BOOKTITLE="Computer Science Conference (CSC)",
ORGANIZATION="ACM",
ADDRESS="Kansas City, Kansas",
PAGES="267-274",
MONTH=mar,
YEAR=1992,
KEYWORDS="DQDB; MAN",
ABSTRACT="DQDB is a new standard for MANs. We first present the DQDB
standard. Previous investigations have shown that the combination of BWB
and the priority mechanism in a DQDB network does not work correctly. We
shall analyze that behavior and develop some solutions to overcome the
problems. The principle ideas of the proposed solutions were developed
when focusing on aspects of network management. They were short outlined
and published in Seitz 91. In this paper they shall be explained in
detail and simulation results shall show how the various mechanisms
affect DQDB behavior.",
}

@INPROCEEDINGS{Full9203:TCP,
AUTHOR="C. L. Fullmer and Brent Auernheimer and III Morris",
TITLE="A {TCP/IP} network facsimile system built from publicly available
software",
BOOKTITLE="Computer Science Conference",
ORGANIZATION="ACM",
ADDRESS="Kansas City, Kansas",
PAGES="525-532",
MONTH=mar,
YEAR=1992,
KEYWORDS="fax; facsimile; TCP/IP; system integration",
ABSTRACT="A network desktop facsimile system was developed from
inexpensive hardware and publicly available software. This system allows
users on a TCP/IP network to develop documents and have them FAXed
without printing out the document and using a manual FAX machine. The
desktop facsimile system also receives FAXes. Schemes for electronic
routing of incoming faxes are outlined. The system is written in C and
uses TCP/IP network protocols. Existing standards, system development
and integration of publicly available software are discussed.",
}

@ARTICLE{Edem9203:Low,
AUTHOR="Brian Edem and Avi Barel and K. R. Parker",
TITLE="Low-cost routers can tame complex global internets",
JOURNAL="Electronic design",
VOLUME=40,
NUMBER=6,
PAGES="61-72",
MONTH=mar,
YEAR=1992,
KEYWORDS="router; implementation",
ABSTRACT="Describes router implementation with four Ethernet and one
FDDI port, based on NS32GX320 controller.",
}

@ARTICLE{Heym9203:Statistical,
AUTHOR="Daniel P. Heymann and Ali Tabatabei and T. V. Lakshman",
TITLE="Statistical analysis and simulation study of video teleconference
traffic in {ATM} networks",
JOURNAL=ieeecsvt,
VOLUME=2,
NUMBER=1,
PAGES="49-59",
MONTH=mar,
YEAR=1992,
KEYWORDS="packet video; traffic modeling; autoregressive model; MMPP;
gamma distribution",
ABSTRACT="This paper presents results of our study of some of the source
modeling and performance issues related to providing video
teleconference services over asynchronous transfer mode (ATM) networks.
Unlike most previous studies that have used very short sequences, our
statistical analysis and simulation study uses a long (30 min) sequence
of real video teleconference data. Our major results are: 1) Under
certain circumstances, traffic periodicity (due to the constant video
frame rate) can cause different sources with identical statistical
characteristics to experience cell-loss rates that can differ from each
other by several orders of magnitude. For a single-stage multiplexer
model, some of this source-periodicity effect can be mitigated by
appropriate buffer scheduling and we present one effective scheduling
policy. 2) Unlike some previous studies, for the video teleconference
sequence that we analyzed (without scene changes or scene cuts and with
moderate motion), the number of cells per frame is not normally
distributed. Instead, it follows a gamma (or negative binomial)
distribution. Also, the number of cells per frame is a stationary
stochastic process. 3) For the traffic studies, neither an
autoregressive model of order 2 nor a two-state Markov chain model is
good because they do not model correctly (either underestimate or
overestimate) the occurrence of frames with a large number of cells and
these frames with a large number of cells are a primary factor in
determining cell-loss rates. The order 2 autoregressive model, however,
fits the data well in a statistical sense. 4) A multistate Markov chain
model that can be derived from three traffic parameters (mean,
correlation, and variance) is sufficiently accurate for use in traffic
studies.",
}

@ARTICLE{Clar92:European,
AUTHOR="W. J. Clark",
TITLE="The European {``MIAS''} system for {ISDN} multimedia
conferencing",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="12-13",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia",
ABSTRACT="A demonstration ISDN based multipoint multimedia conferencing
system is described, together with a proposed protocol architecture for
such applications.",
ANNOTE="Uses multipoint control unit to bridge several audio visual
terminals. Protocol stack: Gp4 fax/still-frame TV, file transfer,
interactive editing; pointing; X.208; LapB; H.221 (2B+D). Token
negotiation between terminals.",
}

@ARTICLE{Yava9203:Coordination,
AUTHOR="R. Yavatkar",
TITLE="Issues of coordination and temporal synchronization in multimedia
communication (extended abstract)",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="77-78",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; synchronization",
ABSTRACT="We examine here the issues of coordination and temporal
synchronization of traffic over related data streams or flows in a
distributed multimedia application.",
ANNOTE="distinguishes intra-flow and inter-flow coordination",
}

@ARTICLE{Li9203:Real,
AUTHOR="L. Li and Ahmed Karmouch and Nicolaos D. Georganas",
TITLE="Real-time synchronization control in multimedia distributed
systems",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="79-87",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; packet voice; packet video; synchronization",
ABSTRACT="Two basic synchronization problems are involved in distributed
multimedia systems. One of them is the simultaneous real-time data
delivery. Simultaneous real time data delivery (SRTDD) refers to
delivering multimedia data in different data streams belonging to the
same time interval simultaneously. In this paper, an entire SRTDD
control scheme for multimedia transmission is established. We propose a
layered architecture which can be mapped to the OSI model to support the
SRTDD control. The segment delivery protocol for real-time multimedia
data streams are addressed. A practical segmentation method is also
developed for real-time voice and video.",
ANNOTE="Distinguishes E policy, which waits for late arrivals, and I
policy, which does not.",
}

@ARTICLE{Yama9203:Usage,
AUTHOR="Naoaki Yamanaka and Y. Sato and K. Sato",
TITLE="Usage parameter control and bandwidth methods for {ATM-based}
{BISDN}",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="61-62",
MONTH=mar,
YEAR=1992,
KEYWORDS="admission control; traffic characterization; QOS; ATM; BISDN;
VBR; bandwidth allocation",
ABSTRACT="This paper proposes an ATM traffic management scheme that
utilizes a deterministic traffic source descriptor, a deterministic
usage parameter control (UPC) algorithm and a conservative statistical
bandwidth allocation method. The scheme not only guarantees the QOS of
all connections but also allows for large statistical multiplexing gain.
The proposed method, therefore, creates an effective BISDN that offers
cost-effective broadband variable bit-rate services.",
ANNOTE="Describes three traffic measurement devices: leaky bucket, T-X
($X/X0$ packets in $T/T0$ time), dangerous bridge (no more than $X$
packets during $T$)",
}

@ARTICLE{Litt9203:Protocols,
AUTHOR="T. D.C. Little",
TITLE="Protocols for bandwidth-constrained multimedia traffic",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="47-48",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; scheduling",
ABSTRACT="We describe a scheduling mechanism for supporting
bandwidth-constrained multimedia traffic and outline protocols to
provide intermedia synchronization of data originating from independent
sources. The work is intended for both stored and live-data application
scenarios which are bandwidth constrained.",
}

@ARTICLE{Gini9203:Experimental,
AUTHOR="Athula Ginige and A. Seneviratne and R. C. Gonzalez and S.
Chandra",
TITLE="An Experimental Multimedia System",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="37-38",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; network architecture; workstation architecture",
ABSTRACT="The aim of our project is to develop a multimedia information
system based on a network of computer workstations. The overall project
was partitioned into four subprojects. These are to develop multimedia
workstation architecture, a network architecture and protocols, a
distributed multimedia database and an authoring system and
application.",
ANNOTE="Mentions novel video coding scheme based on graphic primitives
that allow real-time display of 352 by 288 color images on a
SPARCstation II. Protocol is based on NETBLT and suited for
non-real-time multimedia transport by adapting to fluctuations in
transmitted traffic (how?).",
}

@ARTICLE{Cord9203:Access,
AUTHOR="R. Cordes and Hauke Peyn and T. Kummerow and Thomas Töpperwien
and Thomas Weidenfeiler",
TITLE="Access methods for distributed multimedia information systems
based on private broadband communication networks",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="75-76",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia",
ABSTRACT="The main objective of the DAMS (dynamically adaptable
multiservice system) is to address the problems associated with the
integration of services which are based on either circuit-switched or
packet-switched techniques within the business environment.",
}

@ARTICLE{Scho9203:Architecture,
AUTHOR="Eve Schooler and Stephen Casner",
TITLE="An architecture for multimedia connection management",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="73-74",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; connection setup; conference control",
ABSTRACT="This paper discusses an overall connection architecture and
configuration management for multimedia conferences.",
ANNOTE="Abstract of \cite{Scho9204:Architecture}",
}

@ARTICLE{Phua9203:Developing,
AUTHOR="Vincent Phuah and Jose Diaz-Gonzalez and Russell Sasnett and
Steven Gutfreund",
TITLE="Developing distributed multimedia applications",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="57-60",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia",
ABSTRACT="This paper describes the ongoing research and development
efforts at GTE Labs. Our research goal is not developing distributed
multimedia applications per se, but more towards in providing a
development support environment where applications could be built more
quickly and easily. Nevertheless, the development of this environment is
being influenced by practical results derived from our experience in
building several realistic applications of this nature. We have built a
multimedia network testbed to help us with this task, and are now
starting to investigate how we could migrate to a fully integrated ATM
(asynchronous transfer mode)-based broadband computing setting.",
ANNOTE="narrowband ISDN; analog video",
}

@ARTICLE{Ohmo9203:Distributed,
AUTHOR="Toyoko Ohmori and Kazutoshi Maeno and S. Sakata and Hideyuki
Fukuoka and Kazuo Watabe",
TITLE="Distributed cooperative control for application sharing based on
multiparty and multimedia desktop conferencing system: {MERMAID}",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="39-40",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; session control; groupware; floor passing",
ABSTRACT="A multiparty and multimedia desktop conferencing system,
called MERMAID (multimedia environment for remote multiple interactive
decision-making), was developed as a groupware platform, supporting a
wide range of group cooperative work effectively and efficiently.
Sharing applications means that when application programs execute any
input from participants, all execution results are shared among all
participants. This paper concerns the control scheme for sharing
applications using MERMAID.",
ANNOTE="single application manager per workstation",
}

@ARTICLE{Aran9203:Touring,
AUTHOR="Mauricio Arango and P. Bates and G. Gopal and N. Griffeth and G.
Herman and T. Hickey and Will Leland and V. Mak",
TITLE="Touring Machine: a software infrastructure to support multimedia
communications",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="53-54",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; session control; API",
ABSTRACT="The Touring Machine project comprises a series of system
experiments that address key technical questions important to realizing
a public communications infrastructure in support of multimedia
applications. The current version of Touring Machine includes desk-top
video and audio devices connected through a network of multiple switches
and other specialized hardware resources.",
}

@ARTICLE{Adde9203:VideoWindow,
AUTHOR="Eric Addeo and Steve Weinstein",
TITLE="VideoWindow: experimentation with a more natural form of
audio/video teleconferencing",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="7-9",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; video",
ABSTRACT={Technical and behavioral experiments have been carried out
over several years with new forms of open, large-screen, audio/video
teleconferencing. The VideoWindow research prototype is the realization
of a service concept for easy, informal video and audio communication,
which can be augmented with visual aids and shared computer
applications, between areas where people congregate and interact. It
consists of a large video display (45" by 80" in the current prototype),
set into a wall at each location. The display is illuminated by a
reverse-scanned video projector hidden behind the wall. An innovative
audio system provides wideband (7 kHz) sound with complete freedom for
simultaneous hands-free talking (and listening) at each location. Users,
seated comfortably on a sofa or in armchairs, converse with users at
another location as if they were seeing through a large window.},
ANNOTE="spectral shaping and pitch shifting avoids echo and feedback",
}

@ARTICLE{Roth9203:Multimedia,
AUTHOR="U. Röthlisberger",
TITLE="A multimedia network interface",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="27-28",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; video; audio",
ABSTRACT="The ETH multimedia interactive communication system (ETHMICS)
is a platform for experimentation with multimedia communication in a
high speed networking environment. It supports formal as well as
informal communication at the office workplace. ETHMICS consists of
advanced multimedia workstations, interconnected by a high speed fiber
optic network that provides multimedia communication services. In
addition to data like text, graphics and pictures, it supports the
transfer of time-constrained data, such as voice and video, which
imposes severe restrictions on the network protocol.",
}

@ARTICLE{Hein9203:Versatile,
AUTHOR="Bernd Heinrichs",
TITLE="Versatile protocol processing for multimedia communications",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="49-50",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia",
ANNOTE="Presents general motherhood-and-apple pie guidelines for
protocol design. Briefly describes efforts on parallelizing protocols in
layers 3 through 6.",
}

@ARTICLE{Masa9203:Promising,
AUTHOR="Shigeki Masaki and Tomohiko Arikawa and Hideya Ichihara and
Masao Tanbara and Kazunori Shimamura",
TITLE="A promising groupware system for broadband {ISDN:} {PMTC}",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="55-56",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; teleconferencing; sound localization; stereo",
ABSTRACT="PMTC is a groupware system with a full featured scheme that
allows a user to easily initiate and control a sophisticated
teleconference with up to twenty participants. It supports multimedia
teleconferences including texts, telewriting, telepointing, bit map
images, high quality full motion video, and high quality voice.",
ANNOTE="Uses 155 Mb/s ATM. Media type is indicated in AAL byte. Uses
layered video coding. Audio with sound localization.",
}

@ARTICLE{Chan9203:Compositing,
AUTHOR="Shih-Fu Chang and D. Messerschmitt",
TITLE="Compositing motion-compensated video within the network",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="16-17",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; video coding; motion compensation; compositing",
ABSTRACT="Video sources produced at different locations or at different
times can be composited into a single scene. We study the pros and cons
of compositing video objects in the network nodes rather than in the
final receiver sites. Tradeoffs exist between communication cost and
other performance factors such as video quality and computational
complexity.",
}

@ARTICLE{Ahuj9203:Call,
AUTHOR="S. R. Ahuja and J. R. Ensor",
TITLE="Call and connection management: making desktop conferencing
systems a real service",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="10-11",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; teleconferencing; session control",
ABSTRACT="First, we examine user models and the call control structures
present in conferencing system interfaces, as well as the logical
network architectures needed to support such calls. Second, we look at
the available network capabilities and what new functionality is needed
to match the needed logical architecture. We discuss these issues
specifically in light of our experience with Rapport, a desktop
multimedia conferencing system developed at AT\&T Bell Laboratories.",
ANNOTE="``Each Rapport conversation takes place in an electronic
equivalent of a room. \ldots We are now examining issues of interactions
among multiple VMR servers. These interactions occur when two separate
meetings need to be merged into one. Issues of VMR naming and global
name finding service that allows users to both find active VMR's and
join them.''",
}

@ARTICLE{Hosh9203:Integrated,
AUTHOR="Tohru Hoshi and Yutaka Takahashi and Kenjiro Mori",
TITLE="An integrated multimedia desktop communication and collaboration
platform for broadband {ISDN:} the broadband {ISDN} group tele-working
system",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="14-15",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; teleconferencing",
ABSTRACT="This paper describes the architecture and implementation of
the broadband ISDN group tele-working system, as well as some of the
concepts behind it. The BISDN group tele-working system is a desktop
multimedia communication and collaboration platform for use over BISDN.
It supports visual communication and facilitates realtime collaboration
between people who are geographically distributed.",
ANNOTE="ATM-based",
}

@ARTICLE{Chen9203:Software,
AUTHOR="M.-S. Chen and T. P. Barzilai and Harrick Vin",
TITLE="Software architecture of DiCE: a distributed collaboration
environment",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="51-52",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; teleconferencing; floor control; session control",
ABSTRACT="DiCE is a multimedia collaboration environment that is being
developed at the IBM T. J. Watson research center. In DiCE, we define a
collaboration as an aggregation of conferences, where a conference
refers to interactions among multiple agents (representing either humans
or software services). In the most basic form, a conference ends when
all its applications are terminated, or it has less than two
participants. A more involved semantics requires that a conference ends
when any of its critical participants leave or any of its critical
applications ends. The process of establishing a conference consists of
three phases: (1) invitation and arbitration, (2) negotiation, and (3)
setup. We have developed a permit distribution system for floor control.
The control is robust in that it can recover from loss of permits due to
unintended separation of participants (due to network failures).",
}

@ARTICLE{Bres9203:Exploiting,
AUTHOR="L. Breslau and Deborah Estring and D. Zappala and L. Zhang",
TITLE="Exploiting locality to provide adaptive routing of real-time
flows in global internets: abstract",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="45-46",
MONTH=mar,
YEAR=1992,
KEYWORDS="routing; quality of service; aggregation",
ABSTRACT="This paper addresses the role of routing in supporting
real-time applications across large integrated services internetworks.
The increasing speed of underlying transmission media is enabling new,
and perhaps more importantly, integrated applications.",
}

@ARTICLE{Miya9203:Multimedia,
AUTHOR="Yoshihiro Miyamoto and M. Ohta and Masatsugu Yano and T.
Nishitani",
TITLE="A multimedia system based on {MPEG} video coding algorithm",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="18-19",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; video coding; MPEG; CD-ROM",
ABSTRACT="A multimedia player system has been developed. The player is a
playback system of video, audio, and graphics recorded on a CD-ROM or
received through an ISDN primary rate service. Both CD-ROM and ISDN
primary rate service can carry about 1.5 Mbit/sec information, but this
rate is too low compared with the original video rate. Therefore, video
data compression techniques are needed for realizing such systems.
Coding algorithm of video and associated audio has been discussed by
MPEG (motion picture expert group) in ISO-IEC/JTC1. In our system, video
decoding algorithm is based on the MPEG standardized method. Only CD-ROM
interface is provided because of limited availability of ISDN
applications at present.",
}

@ARTICLE{Nahr9203:Integrated,
AUTHOR="K. Nahrstedt and Jonathan Smith",
TITLE="An integrated multimedia architecture for high-speed networks
(extended abstract)",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="25-26",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; ATM",
ABSTRACT="We propose an integrated multimedia message format (I-MM),
which contains discrete media such as text and graphics, as well as
continuous media such as video and voice. In our terminology, discrete
media possess interelement sequencing, but lack interelement timing;
continuous media add interelement timing requirements.",
}

@ARTICLE{Stei9203:Multimedia,
AUTHOR="R. Steinmetz and Thomas Meyer",
TITLE="Multimedia synchronization techniques: experiences based on
different system structures",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="90-91",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; synchronization",
ABSTRACT="Based on the experiences in DiME and HeiTS, we document the
implications of using a hybrid or a unified system structures on the
required techniques for implementing synchronization.",
ANNOTE="Audio can be played ahead of video for about 120 msec, and video
can be displayed ahead of audio for about 240 msec.",
}

@ARTICLE{Eldr9203:Rate,
AUTHOR="Charles A. Eldridge",
TITLE="Rate controls in standard transport layer protocols",
JOURNAL=ccr,
VOLUME=22,
NUMBER=3,
PAGES="106-120",
MONTH=mar,
YEAR=1992,
KEYWORDS="flow control; rate control",
ABSTRACT="Flow control mechanisms in current datagram switching networks
currently have several responsibilities, including avoiding congestion
and avoiding overruns. In particular, networks and end-systems rely
heavily upon the window mechanism specified in current transport
protocol standards such as TCP and TP4. These responsibilities will
increase in future systems. This paper develops a connection model in
order to assess the extent to which transport protocol data rates can be
controlled using this available mechanism. Under very low delays,
window-based flow control is not effective in slowing the rates at which
a sender introduces data into the network or internetwork. Therefore,
direct rate controls will be needed to enforce policies or to optimize
performance across a variety of users and media.",
}

@TECHREPORT{Hopp9203:Improving,
AUTHOR="Andrew Hopper",
TITLE="Improving communications at the desktop",
TYPE="Technical Report",
INSTITUTION="Olivetti Research Limited",
ADDRESS="Cambridge, England",
NUMBER="ORL 92-3",
MONTH=mar,
YEAR=1992,
KEYWORDS="multimedia; user location service; badge; workstation
architecture; packet video",
ABSTRACT="The use of two systems which improve communications at the
desktop is presented. The first deals with desktop cameras attached to
networked workstations (Pandora). The most popular applications are
video phone and video mail. The second deals with location of personnel
in a building using infra-red (Active Badge). The system has proved
popular because by making the information widely available at every
desktop the amount of time spent locating others has been reduced. By
extrapolating to newer technologies, a framework is outlined for the
design of a system which makes the desktop virtual by using location
information to personalize the communications environment.",
}

@ARTICLE{Jurg9203:Digital,
AUTHOR="Ronald K. Jurgen",
TITLE="Digital Video",
JOURNAL=ieeespec,
VOLUME=29,
NUMBER=3,
PAGES="24-30",
MONTH=mar,
YEAR=1992,
}

@TECHREPORT{Parr9203:Mechanism,
AUTHOR="Colin Parris and Hui Zhang and D. Ferrari",
TITLE="A Mechanism for Dynamic Re-routing of Real-time Channels",
TYPE="Technical Report",
INSTITUTION="Institute of Computer Science",
ADDRESS="Berkeley, California",
NUMBER="TR-92-053",
MONTH=mar,
YEAR=1992,
ABSTRACT="Various solutions have been proposed to provide real-time
services (i.e., services with guaranteed performance requirements) in
packet-switched networks. These solutions usually require fixed routing
and resource reservation for each conversation. The routing and
reservation decisions, combined with load fluctuations, introduce the
problems of network unavailability and loss of network management
flexibility. We believe that these problems can be alleviated by
properly balancing the network load. In this paper, we present a
mechanism that dynamically reroutes a real-time channel without
disruption of service to the clients. This mechanism is one component in
a framework to investigate load balancing in a real-time internetwork.
We show that the mechanism can be incorporated into the Tenet real-time
protocol suite with minimal changes and overhead.",
URL="ftp://tenet.berkeley.edu/pub/tenet/Papers/PaZhFe92.ps",
}

@ARTICLE{DePr9203:ATM,
AUTHOR="M. de Prycker",
TITLE="{ATM} switching on demand",
JOURNAL=ieeenet,
VOLUME=6,
NUMBER=2,
PAGES="25-28",
MONTH=mar,
YEAR=1992,
KEYWORDS="ATM; virtual circuit; virtual path; network architecture",
ABSTRACT="Either virtual channels or virtual paths can implement virtual
connections in a BISDN ATM layer.",
}

@ARTICLE{Bier9203:Gigabit,
AUTHOR="Ernst Biersack and C. Cotton and David C. Feldmeier and Anthony
McAuley and W. Sincoskie",
TITLE="Gigabit networking research at Bellcore",
JOURNAL=ieeenet,
VOLUME=5,
NUMBER=2,
PAGES="42-48",
MONTH=mar,
YEAR=1992,
KEYWORDS="network testbed; high-speed networks; transport protocols; ATM
switch",
ABSTRACT="The AURORA gigabit network is a cooperative testbed connecting
Philadelphia, Morristown, Yorktown Heights, and Cambridge.",
}

@ARTICLE{Rans9203:Applications,
AUTHOR="M. N. Ransom and D. R. Spears",
TITLE="Applications of public gigabit networks",
JOURNAL=ieeenet,
VOLUME=5,
NUMBER=2,
PAGES="30-40",
MONTH=mar,
YEAR=1992,
KEYWORDS="high-speed networks",
ABSTRACT="World-wide attention is focused on high-performance networks
that can transfer information at speeds in excess of 1 Gb/s",
}

@TECHREPORT{Bane9203:Queueing,
AUTHOR="A. Banerjea and S. Keshav",
TITLE="Queueing delays in rate-controlled networks",
TYPE="Technical Report",
INSTITUTION="International Computer Science Institute",
ADDRESS="Berkeley, California",
NUMBER="ICSI TR-92-015",
MONTH=mar,
YEAR=1992,
KEYWORDS="end-to-end analysis; performance evaluation; bounds; queueing
theory; fluid flow model",
ABSTRACT="This paper addresses the problem of finding the worst case
end-to-end delay and buffer occupancy bounds in networks of
rate-controlled, non-work conserving servers. The calculations are based
on a simple fluid model, but care is taken so that the computed delay
and buffer occupancy values are upper bounds on actual values. A simple
algorithm is presented to perform these calculations in linear time.
Simulation results compare the computed worst case delays with the
actual delays obtained on some simple network topologies. The algorithm
is found to predict node delays well for bursty input traffic, but
poorly for smooth input traffic. Buffer requirements are predicted well
in both cases.",
URL="ftp://tenet.berkeley.edu/pub/tenet/Papers/BanKes92.ps",
}

@TECHREPORT{Parr9203:Framework,
AUTHOR="Colin Parris and S. Keshav and D. Ferrari",
TITLE="A Framework for the Study of Pricing in Integrated Networks",
TYPE="Technical Report",
INSTITUTION="Institute of Computer Science",
ADDRESS="Berkeley, California",
NUMBER="TR-92-016",
MONTH=mar,
YEAR=1992,
KEYWORDS="pricing; access control",
ABSTRACT="Integrated networks of the near future are expected to provide
a wide variety of services, which could consume widely differing
resources. We present a framework for pricing services in integrated
networks, and study the effect of pricing on user behavior and network
performance. We first describe a network model that is simple, yet
models details such as the wealth distribution in society, different
classes of service, peak and off-peak traffic and call blocking due to
budgetary constraints. We then perform experiments to study the effect
of setup, per packet, and peak load prices on the blocking probability
of two classes of calls passing through a single node enforcing
admission control. Some selected results are that a) increasing prices
first increases the net revenue to a provider, then causes a decrease b)
peak-load pricing spreads network utilization more evenly, raising
revenue while simultaneously reducing call blocking probability.
Finally, we introduce a novel metric for comparing pricing schemes, and
prove that for the most part, a pricing scheme involving setup prices is
better than a pricing scheme with no setup cost.",
URL="ftp://tenet.berkeley.edu/pub/tenet/Papers/PaKeFe92.ps",
}

@TECHREPORT{Parr9203:Resource,
AUTHOR="Colin Parris and D. Ferrari",
TITLE="A Resource Based Pricing Policy for Real-Time Channels in a
Packet-Switching Network",
TYPE="Technical Report",
INSTITUTION="International Computer Science Institute",
ADDRESS="Berkeley, California",
NUMBER="TR-92-018",
MONTH=mar,
YEAR=1992,
KEYWORDS="pricing; real-time communications",
ABSTRACT="In the packet switching networks of the future the need for
guaranteed performance on a wide variety of traffic characteristics will
be of paramount importance. The generation of revenue, to recover costs
and provide profit, and the multiple type of services offered will
require that new pricing policies be implemented. This paper presents a
resource based pricing policy for real-time channels (ie., channels with
guaranteed performance) in a packet switching network. The policy is
based on a set of specific criteria, and the charges for any channel are
based on the resources reserved for use by the channel. This reservation
charge is based on the type of service requested, the time of day during
which the channel exists, and the lifetime of the channel. We argue that
the traditional resources are not sufficient to determine a fair
reservation charge for a channel offering guaranteed delay bounds, and
we introduce the notion of a delay resource in our charging formula. The
type of service requested is thus characterized by the amount of the
bandwidth, buffer space, CPU, and delay resources reserved. The analysis
of this pricing policy is reduced to the analysis of a single node of
the network, assuming a homogeneous network. This single-node
characteristic increases the scalability and flexibility of the policy.
An example of an implementation of this policy is provided.",
URL="ftp://tenet.berkeley.edu/pub/tenet/Papers/ParFer92.ps",
}

@INPROCEEDINGS{Floy9203:Flexible,
AUTHOR="S. Floyd",
TITLE="Issues in flexible resource management for datagram networks",
BOOKTITLE="3rd Workshop on Very High Speed Networks",
ORGANIZATION="IEEE",
ADDRESS="Maryland",
MONTH=mar,
YEAR=1992,
KEYWORDS="resource control; datagram networks; rate control",
URL="ftp://ftp.ee.lbl.gov/papers/slides\_92.ps",
}

@TECHREPORT{Drus9203:High,
AUTHOR="P. Druschel and L. L. Peterson",
TITLE="High-Performance Cross-Domain Data Transfers",
INSTITUTION="Department of Computer Science, University of Arizona",
NUMBER="92--11",
MONTH=mar,
YEAR=1992,
URL="ftp://cs.arizona.edu/xkernel/fbufs.ps",
}

@INPROCEEDINGS{Davi9203:AC,
AUTHOR="G. W. Davidson and Marina BOSI",
TITLE="{AC-2:} high quality digital audio coding for broadcast and
storage",
BOOKTITLE="NAB Broadcast Engineering Conference Proccedings",
ORGANIZATION="National Association of Broadcasters",
MONTH=mar,
YEAR=1992,
KEYWORDS="audio coding; AC-2",
ABSTRACT="A family of wideband digital audio transform coders suitable
for use in broadcast applications is presented. The coders operate at a
variety of bit-rates ranging from 192 to 64 kb/sec per channel, and
offer various tradeoffs in bit-rate, coding delay, and audio bandwidth.
In particular, a next generation audio coder is introduced in which both
frequency domain and temporal masking effects of human hearing are
exploited during bit-rate reduction. The coder employs a new filterbank
which dynamically adjusts frequency and time resolution on a signal
dependent basis. Current and future applications of the coding family
are described.",
}

@PHDTHESIS{Part9203:Late,
AUTHOR="C. Partridge",
TITLE="Late-Binding {RPC:} A Paradigm for Distributed Computation in a
Gigabit Environment",
SCHOOL="Computer Science, Harvard University, Cambridge, Massachusetts",
MONTH=mar,
YEAR=1992,
ABSTRACT="Computers and data networks continue to get faster. However
computers and networks are geting faster in different ways. This
difference is best illustrated by an example. Consider the problem of
making a car faster. A 100-times improvement in speed would imply cars
with cruising speeds of about 600 miles per hour. Computers are getting
faster like cars get faster; they perform more instructions per second.
Now imagine giving the car more storage space, while keeping its maximum
speed constant. A 100-times improvement yeilds a ca that can hold
100-tomes more luggage, but stilll only goes 60 miles per hour. Networks
are getting faster like larger cars, they send more bitss per packet
because the speed of limit limits how fast a packet can get from one
place to another. This thesis examines the implcations of this
difference for the future of distributed computing. The thesis
identifies four major implication: \begin{itemize} \item The performance
difference is permanent. The speed of light is constant and there is no
hope of reducing the network delay. \item The time spent waiting for
data to cross the network will soon become the largest part of most
programs' run-time. A single exchange of packets will take far more time
than executing all the application's instructions. \item Due to their
differing latencies, LANs and WANs will probably continue to exhibit
different performance characteristics for some time to come. \item
Popular distributed computing paradigms such as RPC do not appear to
scale well to an environment in which network delays are long.
\end{itemize} The thesis also presents a novel paradigm for distributed
computation call {\em late-binding} in which applications send arbitrary
pieces of code to arbitrary remote systems for evaluation. It is argued
that this paradigm can give optimal performance in the number of network
transits required to complete a computation. A model of distributed
computation is developed and used to show that optimizing network
transits will usually be the determining factor for the performance of
distributed applications. Finally, it is shown that implementing {\em
late-binding} is feasible.",
}

@ARTICLE{Gree9203:Computer,
AUTHOR="P. E. Green",
TITLE="An All-Optical Computer Network: Lessons Learned",
JOURNAL=ieeenet,
MONTH=mar,
YEAR=1992,
}

@PROCEEDINGS{Beth9204:System,
TITLE="System security",
EDITOR="Thomas Beth and Whitfield Diffie and Gustavus J. Simmons",
ORGANIZATION="Dagstuhl Seminar Report",
ADDRESS="Dagstuhl, Germany",
MONTH=mar,
YEAR=1992,
KEYWORDS="security; encryption; authentication",
}

@INPROCEEDINGS{Koba9203:Behavior,
AUTHOR="H. Kobayashi and Q. Ren",
TITLE="Non-stationary behavior of statistical multiplexing for multiple
types of traffic",
BOOKTITLE="Twenty-sixth annual conference on information sciences and
systems",
MONTH=mar,
YEAR=1992,
REFERENCES=21,
KEYWORDS="Statistical multiplexing; performance evaluation;
communication network",
ABSTRACT="We develop a general theory to derive the non-stationary (or
transient) behavior of a statistical multiplexer, which combines data
that are generated from a heterogeneous set of information sources. The
problem is motivated by performance analysis and control of a
multi-media communication network in the future BISDN environment, where
multiple types of information traffic will be integrated and transported
over high speed links.",
}

@INPROCEEDINGS{Ren9203:Transient,
AUTHOR="Q. Ren and H. Kobayashi",
TITLE="Transient solutions for the buffer behavior in statistical
multiplexing",
BOOKTITLE="26th Annual Conference on Information Sciences and Systems",
MONTH=mar,
YEAR=1992,
REFERENCES=19,
KEYWORDS="ATM; buffer; statistical multiplexing; mathematical model",
ABSTRACT="We present time dependent (or transient) solutions for a
mathematical model of statistical multiplexer. The problem is motivated
by the need to better understand the performance of fast packet
switching in asynchronous transfer mode (ATM), which will be adopted in
the broadband ISDN. The transient solutions will be of critical value in
understanding dynamic behavior of the multiplexer, and loss
probabilities at the cell (or packet) level.",
}

@ARTICLE{Fink9203:Following,
AUTHOR="F. Fink and Robert Ross",
TITLE="Following the Fiber Distributed Data Interface",
JOURNAL=ieeenet,
VOLUME=6,
NUMBER=2,
PAGES="30-40",
MONTH=mar,
YEAR=1992,
KEYWORDS="FDDI FDDI; FFOL ANSI X3T9.5 FDDI; FDDI-II FDDI; PMD FDDI; PHY
FDDI; SMUX FDDI; AMAC FDDI; IMAC FDDI; SMT FDDI; ATMR SuperLAN
MetaRing/Orbit CRMA FDDI; Spacial re-use ATM BISDN",
ABSTRACT="FDDI will be widely deployed in the early 1990s. The FDDI
Follow-on LAN Project (FFOL) will tell us what comes next.",
}

@INPROCEEDINGS{Laza9203:Real,
AUTHOR="Aurel A. Lazar",
TITLE="A Real-Time Management, Control and Information Transport
Architecture for Broadband Networks",
BOOKTITLE="International Zurich Seminar on Digital Communications",
ADDRESS="Zurich, Switzerland",
MONTH=mar,
YEAR=1992,
URL="ftp://ftp.ctr.columbia.edu/CTR-Research/comet/public/papers/92/LAZ92b.ps.gz",
}

@TECHREPORT{Schm9203:Computing,
AUTHOR="Douglas Schmidt and T. Suda",
TITLE="Computing Infrastructure Issues in Distributed Communications
Systems",
TYPE="Technical Report",
INSTITUTION="University of California, Irvine, Department of Information
and Computer Science",
NUMBER="ICS-TR-92-26",
PAGES=49,
MONTH=mar,
YEAR=1992,
ABSTRACT="The performance of distributed applications (such as file
transfer, remote login, tele-conferencing, full-motion video, and
scientific visualization) is influenced by several facytors that
interact in complex ways. In particular, application performance is
significantly affected both by communication infrastructure factors and
computing infrastructure factors. Several communication infrastructure
factors include channel speed, bit-error rate, and congestion at
intermediate switching nodes. Computing infrastructure factors include
(among other things) both protocol processing activities (such as
connection management, flow control, error detection, and
retransmission) and general operating system factors (such as memory
latency, CPU speed, interrupt and context switching overheads, process
architecture, and message buffering). Due to a several orders of
magniture increase in network channel speed and an increase in
application diversity, performance bottlenecks are shifting from the
network factors to the transport system factors. This paper defines an
abstraction called an ``Operating System Transport System Architecture''
(OSTSA) that is used to classify the major components and services in
the computing infrastructure. End-to-end network protocols such as TCP,
TP4, VMTP, XTP, and Delta-t typically run on general-purpose computers,
where they utilize various operating system resources such as
processors, virtual memory, and network controllers. The OSTSA provides
services that integrate these resources to support distributed
applications running on local and wide area networks. A taxonomy is
presented to evaluate OSTSAs in terms of their support for protocol
processing activities. We use this taxonomy to compare and contrast five
general-purpose commercial and experimental operating systems including
System V UNIX, BSD UNIX, the x-kernel, Choices, and Xinu.",
}

@TECHREPORT{Pink9203:Improved,
AUTHOR="Gadi Pinkas and R. Dechter",
TITLE="An Improved Connectionist Activation Function for Energy
Minimization",
TYPE="Technical Report",
INSTITUTION="University of California, Irvine, Department of Information
and Computer Science",
NUMBER="ICS-TR-92-62",
PAGES=6,
MONTH=mar,
YEAR=1992,
ABSTRACT="Symmetric networks that are based on energy minimization, such
as Boltzmann machines or Hopfield nets, are used extensively for
optimization, constraint satisfaction, and approximation of NP-hard
problems. Nevertheless, finding a global minimum for the energy function
is not guaranteed, and even a local minimum may take an exponential
number of steps. We propose an improvement to the standard activation
function used for such networks. The improved algorithm guarantees that
a global minimum is found in linear time for tree-like subnetworks. The
algorithm is uniform and does not assume that the network is a tree. It
performs no worse than the standard algorithms for any network topology.
In the case where there are trees growing from a cyclic subnetwork, the
new algorithm performs better than the standard algorithms by avoiding
local minima along the trees and by optimizing the free energy of these
trees in linear time. The algorithm is self-stabilizing for trees
(cycle-free undirected graphs) and remains correct under various
scheduling demons. However, no uniform protocol exists to optimize trees
under a pure distributed demon and no such protocol exists for cyclic
networks under central demon.",
}

@ARTICLE{Danz9203:Artificial,
AUTHOR="Peter Danzig and S. Jamin and R. Caceres and Danny J. Mitzel and
D. Estrin",
TITLE="An artificial workload model of {TCP/IP} Internetworks",
JOURNAL=internet,
VOLUME=3,
NUMBER=1,
PAGES="1-26",
MONTH=mar,
YEAR=1992,
URL="ftp://catarina.usc.edu pub/jamin/traffic/",
}

@TECHREPORT{Bren9203:Periods,
AUTHOR="R. P. Brent",
TITLE="On the Periods of Generalized Fibonacci Recurrences",
INSTITUTION="Dept. of Computer Science, Australian National University",
ADDRESS="Canberra 0200 ACT, Australia",
NUMBER="TR-CS-92-03",
NOTE="(rpb133)",
MONTH=mar,
YEAR=1992,
}

@TECHREPORT{Bren9203:Uniform,
AUTHOR="R. P. Brent",
TITLE="Uniform Random Number Generators for Vector and Parallel
Computers",
INSTITUTION="Dept. of Computer Science, Australian National University",
ADDRESS="Canberra 0200 ACT, Australia",
NUMBER="TR-CS-92-02",
NOTE="Revision appeared in Proceedings Fifth Australian Supercomputer
Conference, Melbourne, Dec. 1992, 95-104. (rpb132)",
MONTH=mar,
YEAR=1992,
}

@INPROCEEDINGS{Doul9203:Survey,
AUTHOR="C. Douligeris and Lakshmana Kumar",
TITLE="A Survey into the Unfairness Problem in the Networking
Environment",
BOOKTITLE="2nd ORSA Telecommunications Conference",
ADDRESS="Boca Raton, Florida",
MONTH=mar,
YEAR=1992,
}

@ARTICLE{Wang9204:Shortest,
AUTHOR="Zhen Wang and Jon Crowcroft",
TITLE="Analysis of shortest-path routing algorithms in a dynamic network
environment",
JOURNAL=ccr,
VOLUME=22,
NUMBER=2,
PAGES="63-71",
MONTH=apr,
YEAR=1992,
REFERENCES=15,
KEYWORDS="routing; shortest-path algorithm; stability",
ABSTRACT="In a dynamic network environment under heavy traffic load,
shortest-path routing algorithms, particularly those that attempt to
adapt to traffic changes, frequently exhibit oscillatory behaviors and
cause performance degradation. In this paper we first examine the
problems from the perspective of control theory and decision making, and
then analyze the behaviors of the shortest-path routing algorithms in
details.",
URL="http://www.acm.org/sigcomm/ccr/archive/1992/apr92/wang/final-wang-shortest-path.ps",
}

@ARTICLE{Wang9204:Eliminating,
AUTHOR="Zhen Wang and Jon Crowcroft",
TITLE="Eliminating periodic packet losses in the 4.3-Tahoe {BSD} {TCP}
congestion control algorithm",
JOURNAL=ccr,
VOLUME=22,
NUMBER=2,
PAGES="9-16",
MONTH=apr,
YEAR=1992,
REFERENCES=16,
KEYWORDS="transport protocols; congestion control; TCP; BSD; oscillatory
behavior",
ABSTRACT="The congestion control algorithm embedded in the 4.3-Tahoe BSD
TCP implementation has dramatically improved congestion control over the
Internet. However, several recent simulation studies on the dynamics of
this algorithm have revealed that the algorithm exhibits clear
oscillatory patterns in sending window size, round trip delay and
bottleneck queue length. We present a new congestion control scheme and
a dual traffic adjustment strategy. Simulation results show that our
modifications can eliminate the periodic packet losses and substantially
reduce the traffic oscillation.",
URL="http://www.acm.org/sigcomm/ccr/archive/1992/apr92/wang/final-wang-tcp.ps",
}

@ARTICLE{Rose9204:Q,
AUTHOR="O. Rose",
TITLE="The Q-bit Scheme: Congestion Avoidance using Rate Adaptation",
JOURNAL=ccr,
VOLUME=22,
NUMBER=2,
PAGES="29-42",
MONTH=apr,
YEAR=1992,
REFERENCES=22,
KEYWORDS="congestion control; DECbit; rate control; congestion
avoidance",
ABSTRACT="Modern protocols designed for high-speed networks mostly adapt
the rate at which packets are transmitted to control the flow of data
between a sender and a receiver, and to control the load put upon the
underlying network. In this article, the use of rate-adaptation to
realize congestion avoidance, a recently proposed highly sophisticated
technique to control overload conditions in networks is examined. With a
simple analytical model of the system, expressions which help to tune it
are derived. By directly comparing the resulting system to the
well-known DECbit scheme which uses a window to adapt the load it is
shown that most of the limitations of this scheme can be eliminated
while preserving its advantages. More specifically, because of the
direct adaptation of a rate, fairness can be guaranteed in general
topologies. This is possible without the need to put the burden of
enforcing fairness on the routers, already heavily taxed in a high-speed
network. Finally, the system can better adapt to varying packet sizes,
thus offering greater robustness and efficiency when used in real
networks.",
URL="http://www.acm.org/sigcomm/ccr/archive/1992/apr92/qbit.ps",
}

@INPROCEEDINGS{Scho9204:Architecture,
AUTHOR="Eve Schooler and Stephen Casner",
TITLE="An architecture for multimedia connection management",
BOOKTITLE="4th IEEE ComSoc International Workshop on Multimedia
Communications",
ADDRESS="Monterey, California",
PAGES=5,
NOTE="also as ISI reprint ISI/RS-92-294",
MONTH=apr,
YEAR=1992,
KEYWORDS="multimedia; connection setup; conference control",
ABSTRACT="This paper discusses an overall connection architecture and
configuration management for multimedia conferences.",
URL="ftp://ftp.isi.edu/pub/hpcc-papers/mmc/mm92.ps",
}

@ARTICLE{Borg9204:Deflection,
AUTHOR="F. Borgonovo and L. Fratta",
TITLE="Deflection networks: architectures for metropolitan and wide area
networks",
JOURNAL=cnis,
VOLUME=24,
NUMBER=2,
PAGES="171-183",
MONTH=apr,
YEAR=1992,
KEYWORDS="deflection routing; hot potato routing; metropolitan area
network; circuit service; services integration; guaranteed bandwidth;
distributed call acceptance; admission control; MAN",
ABSTRACT="Deflection networks are very attractive communication systems,
since they are capable to extend to metropolitan and wide area networks
most of the positive features of LANs such as the great flexibility in
bandwidth assignment and the absence of internal congestion. In
addition, deflection networks do not present the drawbacks typical of
LANs. They are based on mesh topologies which provide multiple paths
between sources and destinations, offer very high connection reliability
and traffic-handling capability and easily grow according to needs and
traffic requirements. The core of these networks, the deflection
routing, was introduced as a routing technique on regular mesh
topologies, but it has been soon recognized able to work under any
topology, even changing in time, if coupled to the backward learning
technique. This paper reviews the basic capabilities of the
bi-directional deflection networks, which can exploit at best the
intrinsic features of deflections such as the ability to dynamically
adapt to failures. It also introduces and analyzes a new access
mechanism capable to provide guaranteed bandwidth and an end-to-end
circuit service build on top of the basic network mechanism which is
intrinsically datagram.",
}

@ARTICLE{Kubo9204:Congestion,
AUTHOR="Koji Kubota and M. Murata and H. Miyahara and Yuji Oie",
TITLE="Congestion control for bursty video traffic in {ATM} networks",
JOURNAL=ecij1,
VOLUME=75,
NUMBER=4,
PAGES="13-19",
MONTH=apr,
YEAR=1992,
KEYWORDS="ATM networks; multimedia traffic; congestion control;
policing; call admission",
ABSTRACT="In an ATM network, congestion controls as well as traffic
controls, e.g., call admission control and policing control, are
important to efficiently transmit multimedia traffic while satisfying
their different required grade-of-services. This paper analyzes a
congestion control scheme required for ATM networks. With the control
scheme, when the buffer queue length in an ATM switch exceeds a certain
threshold, congestion control is applied and cells from lower priority
traffic such as voice are rejected. As a result, higher-priority traffic
such as compressed video can be transferred with good quality. Cell loss
probabilities are analyzed for each multimedia traffic at a switching
machine buffer and the effectiveness of the congestion control is
studied. By numerical examples it is shown that the threshold value to
apply the congestion control is an important parameter for effectively
transferring multimedia traffic.",
}

@TECHREPORT{Rama9204:Quality,
AUTHOR="Jean Ramaekers and G. Ventre",
TITLE="Quality-of-service negotiation in a real-time communication
network",
TYPE="Technical Report",
INSTITUTION="International Computer Science Institute (ICSI)",
ADDRESS="Berkeley, California",
NUMBER="TR-92-023",
MONTH=apr,
YEAR=1992,
KEYWORDS="quality of service; negotiation; real-time communications",
ABSTRACT="In the recent years new protocols and algorithms have been
proposed to guarantee performance and reliability in exchanging data in
real-time communication networks, and new services have been presented
to allow cooperative office work, distributed conferencing, etc. Less
attention has been paid to how applications and, more generally, clients
of real-time communication services can interact with the network in
order to specify and negotiate the quality-of-service of a connection.
We believe that this problem is going to become a key issue for the
success of future distributed systems, since it affects both client and
network performances. In this paper we present a new mechanism for the
establishment of real-time connections in a quality-of-service network
developed for the Tenet real-time protocol suite. By improving the
information exchanged between the network and the clients, the model
allows to reduce the complexity and the time required to establish a
real-time connection, and increases the network utilization.
Additionally, we introduced a new class of real-time communication
service to support adaptive quality-of-service, in order to enhance the
possibilities of the network to face congestion situations.",
URL="ftp://tenet.berkeley.edu/pub/tenet/Papers/RamVen92a.ps",
}

@INPROCEEDINGS{Aner9204:Multiprocessor,
AUTHOR="Nikos G. Aneroussis and Aurel A. Lazar and Mitsuru Tsuchida",
TITLE="A multiprocessor architecture for real-time emulation of
management and control of broadband networks",
BOOKTITLE="IEEE Network Operations and Management Symposium (NOMS)",
ORGANIZATION="IEEE",
ADDRESS="Memphis, TN",
PAGES="346-360",
MONTH=apr,
YEAR=1992,
KEYWORDS="network management; emulator; transputer; traffic control",
ABSTRACT="An architecture for real-time monitoring and control of
broadband networks is presented. It embeds the management, the traffic
control and the information transport architectures. A multiprocessor
real-time emulator is developed in order to evaluate the correctness and
performance characteristics of the model. The emulator provides
functions for real-time traffic generation, information transport and
storage. It implements the traffic control architecture as a set of
distributed algorithms that exchange information through the network
database. A network management center is used to implement OSI
management protocols and to present network operating information in
real-time.",
URL="ftp://ftp.ctr.columbia.edu/CTR-Research/comet/public/papers/92/ANE92.ps.gz",
}

@ARTICLE{Bern9204:World,
AUTHOR="Tim Berners-Lee and Robert Cailliau and Jean-François Groff and
Bernd Pollermann",
TITLE="World-wide web: the information universe",
JOURNAL="Electronic Networking: Research, Applications and Policy",
VOLUME=2,
NUMBER=1,
PAGES="52-58",
MONTH=apr,
YEAR=1992,
KEYWORDS="resource discovery; world-wide web; WAIS; electronic
publishing; hypertext",
ABSTRACT="The World-Wide Web ($W^3$) initiative is a practical project
to bring a global information universe into existence using available
technology. This article describes the aims, data model, and protocols
needed to implement the ``web'', and compares them with various
contemporary systems.",
}

@ARTICLE{Niu9204:Packet,
AUTHOR="Z. Niu and H. Akimaru and F. Machihara and Ichiro Ide",
TITLE="Performance evaluation of packet voice multiplexer with selective
packet-discarding control",
JOURNAL=ecij1,
VOLUME=75,
NUMBER=4,
PAGES="37-45",
MONTH=apr,
YEAR=1992,
KEYWORDS="phase-type distribution; quasi-birth-death process;
multiplexer; packet dropping; matrix-analytic method; selective packet
discarding; packet voice; ATM",
ABSTRACT="This paper evaluates the performance of packet voice
multiplexer with selective packet discarding (SPD) control. The control
scheme is based on the embedded ADPCM coding technology wherein the
modulated information is grouped into two separate parts: a more
significant part (MSP) and a less significant part (LSP). When the
buffer length exceeds a certain threshold, the LSPs of the incoming
packets will be discarded to relieve the congestion. By assuming that
the voice packets (cells) arrive at the multiplexer in phase-type Markov
renewal process (PH-MRP) and that they are all of the fixed length, we
model the system under consideration as
$\mbox{PH-MRP}^{(x)}/E\_k/1/m(m\_1)$ with sufficiently large $k$. Using
the matrix-analytic method, recursion formulas and effective computation
algorithms for the performance measures of interest are derived.
Numerical examples are illustrated.",
}

@ARTICLE{Gauf9204:Multi,
AUTHOR="L. Gauffin and L. H. Ckansson and B. Pehrson",
TITLE="Multi-gigabit networking based on {PTM}",
JOURNAL=cnis,
PUBLISHER="North Holland",
ADDRESS="Amsterdam, Netherlands",
VOLUME=24,
NUMBER=2,
PAGES="119-130",
MONTH=apr,
YEAR=1992,
REFERENCES=8,
ANNOTE="''The bandwidth which the next generation of workstations seems
to require is in the range from 50Mbit/sec to 1Gbit/sec''. STM is a TDM
techinqiue currently heavily used for isochronous traffic but which
requires fixed bandwidth allocations which are not economical due to
dynamic variations in users bandwidth demands. ''The emerging
ATM-oriented techniques may be hard to implement in the multigigabit/s
range due to the processing needed to route every cell in every node.''
The DTM MAC protocol from the MultiG project has the advantage of being
a hybrid between STM and ATM systems. DTM does not require optical
termination in the nodes and the actual fibre medium can carry data in
the Terabit/s range whilst nodes only have to process in the Gigabit/s
range. DTM is also capable of supporting wavelength division
multiplexing, although that would require more complicated optical
termination. ''The four most important QOS-parameters are bandwidth,
delay, jitter and immediate access''. Jitter in DTM is negligably small
as it acts as an STM system during the data transfer phase. Points for
further research with DTM include protocol validation, fault-tolerence,
capacity under high traffic load, fairness and internetworking
especially with slower networks.",
}

@ARTICLE{Gird9204:TeraNet,
AUTHOR="R. Girdon",
TITLE="TeraNet: multigigabits per second {ATM} network",
JOURNAL=comcom,
PUBLISHER="Butterworth-Heinemann Ltd",
ADDRESS="Oxford, UK",
VOLUME=15,
NUMBER=3,
MONTH=apr,
YEAR=1992,
ANNOTE="This paper describes the TeraNet optical fibre gigabit network
designed at the Centre for Telecommunications Research, Columbia
University as part of the ACORN (Advanced Communications Organisation
for Research Networks) project. ''The network is aimed at supporting
services such as HDTV, computer graphics, video teleconferencing,
imaging and other bandwidth intensive applications.'' ''While the
inherent bandwidth of optical media is in the terabits/s range, this
huge capacity hs not been utilized in existing optical networks due to
speed constraints imposed by digital electronics and electro-optical
(E/O) converters.'' TeraNet channels use a two level assignment
technique called WDMA/Subcarrier FDMA (WD/SFDMA) which increases a WDMA
network's capacity by adding multiple microwave subcarrier channels into
each optical waveband. 'TeraNet supports the standard bodies
recommendations for asynchronous transfer mode (ATM)''. TeraNet Network
Interface Units (NIUs) are managed by a dedicated NIU Control Processor
(NCP) which is an embedded microprocessor with 256K of program SRAM.",
}

@ARTICLE{Rich9204:Gigabit,
AUTHOR="I. Richer and G. Baehr",
TITLE="Gigabit Networks \ldots Stay Tuned \ldots Film at 11",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=4,
PAGES="18-35",
MONTH=apr,
YEAR=1992,
ABSTRACT="This month's issue focuses on gigabit networks, offereing an
overview of research now underway. The cover illustration represents the
interconnected ``backbone'' networks of NSF, NASA and DOW, together with
selected client regional and campus area networks. Gigabit testbed
research is aimed at technologies and applications that will define the
next-generation national network.",
ANNOTE="``The changes now beginning will forever alter the availability
and services commonly associated with the term ''network''.'' Four
forces are behind the change in networking towards gigabit speeds: - The
introduction of gigabit networks will leapfrog the conventional capacity
bottleneck and disparagy between network and computing speeds, - Text
based applications currently in use on networks are to be replaced by
image and graphics based applications, possibly using multimedia
techniques which require very high bandwidth, - The widespread
investment in fibre optics made by telcos which can, through the use of
gigabit networking techniques, give economic access to large quantities
of bandwidth, - Major funding of research by the US government which has
been planned for a number of years. ``[...] delays through gigabit
networks are dominated by the propagation delay, so communications
techniques and protocols for megabit networks would be inefficient or
ineffective for gigabit networks. (Might this mean that after solutions
are developed for gigabit networks, nothing new will be needed because
the propagation delays will also predominate in terabit and faster
networks?)'' In gigabit networks, the majority of the anticipated
applications produce a steady output at gigabit rates, with a few having
bursty outputs.",
}

@ARTICLE{Klei9204:Latency,
AUTHOR="L. Kleinrock",
TITLE="The Latency/Bandwidth Tradeoff in Gigabit Networks",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=4,
PAGES="36-40",
MONTH=apr,
YEAR=1992,
REFERENCES=14,
ABSTRACT="Gigabit Networks really are different",
ANNOTE="The parameters of interest in a data network are (C)apacity of
the network in Mb/s, the number of (B)its in a data packet and the
(L)ength of the network in miles or kilometres. A single crtical system
parameter (a) is derived from the parameters by the function $a\_LC/b$
which is the ratio of the latency of the channel to the time required to
place one packet on the network. ``[...] we have passed from the regime
[...] in which we were capacity limited, to the new regime of being
latency limited in the post-gigabit world.'' Gigabit speeds do not help
reduce responce time over megabit speeds with mean packet lengths of
128bytes, even if the propagation delay is taken to be zero.",
}

@ARTICLE{Catl9204:Search,
AUTHOR="C. E. Catlett",
TITLE="In Search of Gigabit Applications",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=4,
PAGES="42-51",
MONTH=apr,
YEAR=1992,
REFERENCES=13,
KEYWORDS="high-speed networks; network architecture; visualization;
network applications",
ABSTRACT="Gigabit networks will allow application designers to treat
multiple computing resources as a single, distributed environment.",
ANNOTE="``Gigabit networks will allow the application designer to treat
multiple computing resources as a single system rather than a network of
computers.'' A metacomputer is a multiprocessing machine that uses very
high bandwidth networks to permit large parallel supercomputers to be
built out of commodity parts. Applications in which gigabit networks
provide useful support or a stimulus for new working methods lie in
three areas: - Computational Science (applications requiring massive
computational resources), - Data Navigation (the depiction of the
results of experiments presented in a way to allow scientists to
understand them better), - Collaborative Environments and Instrument
Control (many users cooperating in real over a network to work on shared
workspaces, control remote instruments, etc). Application areas within
the field of Computational Science are fluid dynamics, atmopspheric and
oceanic weather models, chemical flowsheeting (the laying out of the
parts of a chemical plant in an optimal fashion) and molecular dynamics
(modelling the motion of molecules). Application areas within the field
of Data Navigation are the Human Genome project, the Earth Observation
System, distributed atmospheric Visualisation, geological multidatabase
integration and imaging and satellite data derived terrain navigation.
Application areas within the field of Collaborative Environments and
Instrument Control include radiation treatment planning, radio astronomy
and CSCW distributed interactive collaborative environments.",
}

@ARTICLE{Lyle9204:Emerging,
AUTHOR="Bryan Lyles and Daniel C. Swinehart",
TITLE="The Emerging Gigabit Environment and the Role of the Local
{ATM}",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=4,
PAGES="52-58",
MONTH=apr,
YEAR=1992,
REFERENCES=12,
KEYWORDS="network architecture; high-speed networks; requirements; local
area networks",
ABSTRACT="The key to affordable gigabit networks is the presence of
affordable 150 Mb/s networks and applications on every desktop.",
ANNOTE="The authors argue that certain application areas, mainly
connected with CSCW and multimedia technologies, can only progress if
network technology development takes a revolutionary as opposed to
evolutionary approach. There is a need for the aggresive deployment of
very high bandwidth, office or desk area LANs in order to support the
high data rates generated or required locally by devices such as video
cameras, CD-quality sound and high resolution image scanning.
``Essentially, ATM is a high-speed, virtual-circuit-oriented packet
switching (or cell relay) methodology.'' ATM systems have been designed
from the outset to be interoperable with both higher and lower speed
networking standards. ATM switching hardware intrinstically supports the
creation of real time channels and point-to-multipoint communications.
ATM services can be provided in both the wide, metropolitan, local and
desk area networks, with speeds up to 600Mb/s currently. A Local ATM
(LATM) switch must cost no more than around \$1000 per port if it is to
be cost effective for use with the ever decreasing prices and increasing
specifications of the workstations to which it will be attached. Unlike
a public WAN ATM switch, a LATM does not need to have be able to support
thousands of ports, or be optimised to enable the use of the last few
percent of the bandwidth of a link (as it is assumed that bandwidth is
cheap). In desk and local area networks, the transmissions delays are
almost negligable and it is the delays within the switches that will
predominate the timing equation.",
}

@ARTICLE{Cheu9204:Infrastructure,
AUTHOR="N. K. Cheung",
TITLE="The Infrastructure for Gigabit Computer Networks",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=4,
PAGES="60-68",
MONTH=apr,
YEAR=1992,
REFERENCES=19,
ABSTRACT="The future SONET/ATM public network can provide economical
end-to-end transport for Gigabit applications.",
ANNOTE="The SONET (Synchronous Optical NETwork) (known internationally
as the Synchronous Digital Heirarchy (SDH)) recommendations define a
standard set of optical interfaces for network transport. Work on the
SONET recommendations began in 1984, and Phase 1 was completed in 1988.
SONET was original designed by the Industry Carriers Compatibility Forum
(ICCF) but standardisation to SDH was undertaken with the CCITT. SONET
optical speeds are multiples of 51.48Mb/s and are known as OC-$n$ where
$n$ is the number of multiples of 51.48Mb/s in the signal. The
electrical equivalent of OC-n is called the Synchronous Transport Signal
at Level $n$ (STS-$n$). Important SONET rates are OC-1, OC-3, OC-12,
OC-24, OC-48 and OC-192 Local exchange networks can be made out of
self-healing gigabit SONET rings which improves performance, reliability
and survivability, whilst reducing the amount of switching and
transmission equipment required. Although SONET rates are specified in
multiples of 51.48Mb/s, the use of ATM as the transport, multiplexing
and switching technique permits the available bandwidth to be flexibly
shared between competing streams at the same time. ``ATM is a
connection-oriented protocol that supports both connection-oriented and
connectionless services, with constant bit rate (CBR) and variable bit
rate (VBR) traffic characteristics.'' The advantages of the ATM scheme
are that it provides a consistent interface even to services with
different requirements, has flexible allocation of cells based upon
asynchronous multiplexing and unique connection identifies placed within
each crell's header and is easily implemented in hardware through the
use of fixed length cells. An application for high bandwidth SONET/ATM
WANs and MANs is the extension of HiPPI (High Performance Parallel
Interface) links between geographically distributed high performance
computing equipment. The HiPPI-ATM-SONET (HAS) interface is a key
component of the Nectar Gigabit Testbed being undertaken in
collaboration between Carnegie Mellon Univeristy and Bellcore. The
prototype HAS data interface operates at gigabit speeds and makes use of
out-board protocol processors off of the supercomputers involved in
order to speed up protocol processing. The WAN section of the Nectar/HAS
testbed use a public 2.488Gb/s (OC-48) switching network, and is an
example of one use of the future BISDN services.",
}

@ARTICLE{McEa9204:Gigabit,
AUTHOR="J. A. McEachern",
TITLE="Gigabit Networking on the Public Transmission System",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=4,
PAGES="70-78",
MONTH=apr,
YEAR=1992,
ABSTRACT="Bandwidth concatenation in SONET can provide true gigabit
services to a large population within three years.",
ANNOTE="``In spite of transmission rates in excess of 2Gb/s, current
networks are exploiting less than 0.1\% of the potential capacity of a
single-mode optical fibre.'' ``The optical bandwidth available on
current single-mode fibres in the 1200-1700nm low-loss window is about
60THz''. The current research problems lie not in the limitations of
optical transmitters which are already capable of speeds in excess of
10Gb/s but in the design and theoretical limits of circuits and
electronic devices operating at the required speeds to support these
transmitters. ``It has been projected that the amount of bandwidth
required to support these applications [LAN interconnect, image and file
transfer] will be five to ten times that of voice by the year 2000''.
One method of using the extra bandwidth is to use wavelength
multiplexing.",
}

@ARTICLE{Kung9204:Gigabit,
AUTHOR="H. T. Kung",
TITLE="Gigabit Local Area Networks: A Systems Perspective",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=4,
PAGES="79-89",
MONTH=apr,
YEAR=1992,
REFERENCES=25,
KEYWORDS="ATM; BISDN; real-time communications",
ABSTRACT="Their burstiness and large bandwidth mis-matches demand new
network architectures but gigabit LANs offer enormous payoffs.",
ANNOTE="Giagbit LANS will be used to support high speed backbones
between slower LANs, high performance computing environments and
distributed computing. Even with gigabit LANs there is a need to prevent
transient network congestions from occuring as this can cause the LAN to
collapse. Statistical Load Prediction, which is used for congestion
control in WANs, is not suitable for use in Gigabit LANs because there
are few streams and thus they can not be modelled accurately
statistically. Highly bursty, high capacity demand traffic such as HDTV
frames and multimedia sessions preclude the use of using
over-specification of network capacity as a congestion control method.
Admission control congestion control stategies are ineffective in
Gigabit LANs because, without the use of a fast feedback mechanism,
bandwidth hungry applications are likely to only acquire a small
fraction of the amount required at call set up time and network
bandwidth would result in being wasted. The authors contend that future
Gigabit LANs will make use of switches with fast, direct congestion
feedback mechanisms based upon link-by-link flow control, cell level
multiplexing and virtual connections, resulting in the creation of
Virtual Connection Network (VCN). Link-by-link flow control operates by
having the receiver send buffer status information back to the
transmitter to ensure that the transmitter never sends more information
than the receiver can handle. Virtual connections in VCNs are different
from virtual channels found in ATM systems because they have
link-by-link flow control and can also exist as point-to-multipoint as
well as point-to-point. Virtual connections are only effective in MANs
and LANs where the propagation delay time is relatively small because
the link-by-link flow control replies on timely network back pressure to
work. As packet reception times in a Gigabit LAN range from 1us to 10us
for 100byte to 1KB packets, there will only be time for 20 to 200
instructions executed on a 50ns cycle CPU for protocol processing. The
largest long term performance bottleneck is likely to me in memory
systems rather than processing speeds (though surely the memory speeds,
even if only caching memory speeds, must keep up with CPUs to keep the
instruction and data pipelines feed?).",
}

@ARTICLE{Newm9204:ATM,
AUTHOR="P. Newman",
TITLE="{ATM} Technology for Corporate Networks",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=4,
PAGES="90-101",
MONTH=apr,
YEAR=1992,
REFERENCES=79,
ABSTRACT="Corporate ATM networks will enable simpler network solutions
and stimulate the development of new communication applications.",
ANNOTE="ATM networks, designed for mixed traffic class public data
networks, are also suitable for use as a private WAN, a campus backbone
and a high speed LAN. ``The majority of desktop applications are
unlikely to require individual access much in excess of 100 or 200
Mb/s.''. Time division ATM switching fabrics can use either shared bus
or ring networks or a shared memory space through which all cells flow
from inputs to outputs. Space divison switching systems allow multiple
input to output paths to be active concurrently but require some form of
routing of cells to be implemented. ``Most current data traffic is
extremely variable and will become increasingly so at higher speeds.''
``The initial commercial applications [of ATM switches for corporate
networks] will be a high-capacity backbone to relieve the bandwidth
bottleneck that is beginning to constrain current solutions.'' ``Nor
have appropriate simple traffic descriptors, or algorithms to compute
the effective bandwidth [required by applications using an ATM based
network], yet been defined.''",
}

@ARTICLE{Nata9204:Framework,
AUTHOR="N. Natarajan and G. Slawsky",
TITLE="A Framework Architecture for Information Networks",
JOURNAL=ieeecm,
VOLUME=30,
NUMBER=4,
PAGES="102-109",
MONTH=apr,
YEAR=1992,
REFERENCES=11,
ABSTRACT="Bellcore, in collaboration with Regional Bell Operating
Companies and industry vendors, is developing an INA Architecture based
on current advances in distributed computing and broadband
communications.",
ANNOTE="The INA Architecture is an object based system with client
server based services which is being designed by Bellcore, the RBOCs and
industry to manage operations and network applications in the future.",
}

@ARTICLE{Joli9204:Porting,
AUTHOR="William Jolitz and Lynne G Jolitz",
TITLE="Porting {UNIX} to the 386: Device Drivers",
JOURNAL=drdobbs,
VOLUME=17,
NUMBER=4,
PAGES="64-68",
MONTH=apr,
YEAR=1992,
KEYWORDS="Unix; operating systems; 386BSD; Intel; PC; Berkeley Unix;
device driver",
}

@INPROCEEDINGS{Tsch9204:Performance,
AUTHOR="Volker Tschammer and Markus Walch and Adam M Wolisz",
TITLE="The Performance of Multiple Traders Operating in the same
Domain",
BOOKTITLE="3rd IEEE Workshop on Future Trends in Distributed Computing",
ORGANIZATION="IEEE",
ADDRESS="Taipei, Taiwan",
MONTH=apr,
YEAR=1992,
}

@PROCEEDINGS{Elli9204:Distributed,
TITLE="Distributed Cooperation in Integrated Information Systems",
EDITOR="Clarence A. Ellis and Matthias Jarke",
ORGANIZATION="Dagstuhl Seminar Report",
ADDRESS="Dagstuhl, Germany",
MONTH=apr,
YEAR=1992,
KEYWORDS="distributed systems; CSCW",
}

@ARTICLE{Moda9204:Overview,
AUTHOR="A. R. Modarressi and R. A. Skoog",
TITLE="An overview of signaling system No. 7",
JOURNAL=ieeeproc,
VOLUME=80,
NUMBER=4,
PAGES="590-606",
MONTH=apr,
YEAR=1992,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Wils9204:Signaling,
AUTHOR="D. R. Wilson",
TITLE="Signaling system No. 7, {IS-41} and cellular telephony
networking.",
JOURNAL=ieeeproc,
VOLUME=80,
NUMBER=4,
PAGES="644-652",
MONTH=apr,
YEAR=1992,
KEYWORDS="Signalling; common channel; CCS",
}

@TECHREPORT{Mora9204:Continuous,
AUTHOR="Mark Moran and B. Wolfinger",
TITLE="Design of a Continuous Media Data Transport Service and
Protocol",
TYPE="Technical Report",
INSTITUTION="ICSI, University of California at Berkeley",
MONTH=apr,
YEAR=1992,
KEYWORDS="realtime CM (continuous media) transport protocol",
ABSTRACT="Applications with real-time data transport requirements fall
into two categories: those which require transmission of data units at
regular intervals, which we call continuous media (CM) clients, e.g.
video conferencing, voice communication, high-quality digital sound; and
those which generate data for transmission at relatively arbitrary
times, which we call real-time message-oriented clients. Because CM
clients are better able to characterize their future behavior than
message-oriented clients, a data transport service dedicated for CM
clients can use this a priori knowledge to more accurately predict their
future resource demands. Therefore, a separate transport service can
potentially provide a more cost-effective service along with additional
functionality to support CM clients. The design of such a data transport
service for CM clients and its underlying protocol (within the BLANCA
gigabit testbed project) will be presented in this document. This
service provides unreliable, in-sequence transfer (simplex, periodic) of
so-called stream data units (STDUs) between a sending and a receiving
client, with performance guarantees on loss, delay, and throughput.",
URL="ftp://icsi-ftp.Berkeley.edu/pub/techreports/1992/tr-92-019.ps.Z",
}

@TECHREPORT{Beig9204:Communicating,
AUTHOR="Richard Beigel",
TITLE="Communicating with Low-Diffraction Lasers and Mirrors",
TYPE="Technical Report",
INSTITUTION="ICSI, U. of California at Berkeley",
MONTH=apr,
YEAR=1992,
KEYWORDS="optics laser optical interconnection network",
ABSTRACT="Optical interconnection networks, in which each processor
contains a set of lasers for communication with other processors, have
long been studied. In the ``regular optics'' model of Murdocca a bounded
number of planar mirrors are used to redirect light beams, and each
processor has a bounded number of lasers directed at a fixed set of
angles, independent of the processor. It is theoretically interesting to
ignore diffraction, and assume that lasers beams travel in a straight
line. In the regular optical model, we present elegant layouts for
processor networks including the shuffle, grids, and Margulis' expander
graph. We also disprove the existence of a certain kind of 3-dimensional
layout for shuffles. Using slightly more complicated optical devices,
such as beam splitters, we design a ``light guide,'' which allows
simultaneous broadcasts, subject only to the limitations of light
sensors. In particular, the light guide can perform single broadcasts.
Given accurate enough clocks, it can perform arbitrary permutations.",
URL="ftp://icsi-ftp.Berkeley.EDU/pub/techreports/1992/tr-92-024.ps.Z",
}

@INPROCEEDINGS{Sory9204:Segmented,
AUTHOR="M. Soryami and R. T. Clarke",
TITLE="Segmented Coding of Digital Image Sequences",
BOOKTITLE="IEE Communications, Speech and Vision",
PUBLISHER="IEE",
VOLUME=139,
MONTH=apr,
YEAR=1992,
KEYWORDS="motion compensation region encoding",
}

@INPROCEEDINGS{Clar9204:New,
AUTHOR="R. T. Clarke and  others",
TITLE="A New Motion Compensated Image Sequence Coding Scheme at 64
kbit/s",
BOOKTITLE="IEE Communications, Speech and Vision",
PUBLISHER="IEE",
VOLUME=139,
MONTH=apr,
YEAR=1992,
KEYWORDS="motion compensation region encoding",
ABSTRACT="Performs better than h.261",
}

@ARTICLE{Anan9204:Survey,
AUTHOR="A. Ananda and B. H. Tay and E. K. Koh",
TITLE="A survey of asynchronous remote procedure calls",
JOURNAL=acmosrev,
VOLUME=26,
NUMBER=2,
PAGES="92-109",
MONTH=apr,
YEAR=1992,
REFERENCES=28,
KEYWORDS="RPC; operating systems; asynchronous RPC; remote procedure
call; distributed systems; at-most-once; maybe",
ABSTRACT="Remote procedure call (RPC) is a popular paradigm for
interprocess communication in distributed systems. It is simple,
flexible and powerful. However, most of the RPC systems today are
synchronous in nature, and hence fail to exploit fully the parallelism
inherent in distributed applications. In view of this, various
asynchronous RPC systems have been designed and implemented to achieve
higher parallelism while retaining the familiarity and simplicity of
synchronous RPC. Asynchronous RPC calls do not block the caller (client)
and the replies can be received as and when they are needed, thus
allowing the client execution to proceed locally in parallel with the
callee (server) invocation. Asynchronous RPC calls can be classified
into two types depending on whether the calls return a value. Most
asynchronous RPC systems only support calls that do not return a value,
and few support both classes. In this paper, an analysis and comparison
of various asynchronous RPC systems are presented.",
}

@INPROCEEDINGS{Jeff9204:Kernel,
AUTHOR="K. Jeffay",
TITLE="On Kernel Support for Real-Time Multimedia Applications",
BOOKTITLE="3rd IEEE Workshop on Workstation Operating Systems",
ADDRESS="Key Biscayne, Florida",
PAGES="39-46",
MONTH=apr,
YEAR=1992,
REFERENCES=14,
ABSTRACT="Real-time operating system services are required to support
multimedia systems that rely heavily on the workstation processor for
control of the audio and video processors and movement of audio and
video data. Such services are typically not available in existing
workstation operating systems. This note comments on the requirements
for such services and briefly describes the YARTOS kernel; an operating
system kernel that provides real-time communication and computation
services.",
ANNOTE="The issue of the need for an operating system used for
multimedia applications to support real-time guarantees is addressed
here. Rather than develop real-time support for existing existing
operating systems, the approach is to develop a new operating system for
which real-time is an integral part. The YARTOS kernel is used. The key
feature is that QoS (for real-toime guarantees) can be specified and
negotiated via the kernel interface. Resources are managed by the kernel
in order to make guarantees possible (e.g., by preventing priority
inversion). [Ao]",
}

@TECHREPORT{Hadl9204:Efficient,
AUTHOR="Tedd Hadley and Allen C-H Wu and Daniel D. Gajski",
TITLE="An Efficient Multi-View Design Model for Real-Time Interactive
Synthesis",
TYPE="Technical Report",
INSTITUTION="University of California, Irvine, Department of Information
and Computer Science",
NUMBER="ICS-TR-92-35",
PAGES=20,
MONTH=apr,
YEAR=1992,
ABSTRACT="This report describes an efficient multi-view design model for
real-time interactive synthesis of behavioral descriptions into layout
data. We present a hybrid data structure which combines all of the
design data needed throughout multiple levels of abstraction, including
behavior, structure, and floorplan, into a single unified view. We also
give a detailed time and space complexity analysis of the proposed
design model, showing that it provides fast updating capabilities for
incremental design changes but does not require an exorbitant amount of
memory space. These features make this design model ideal for
user-controlled synthesis systems that support incremental design and
re-design tasks. Furthermore, the simplicity of the data structure
allows easy implementation, maintenance, and extendibility.",
}

@TECHREPORT{Huan9204:Measurement,
AUTHOR="H. Huang and T. Suda",
TITLE="Design, Implementation and Measurement of a Collision Avoidance
Multiple Broadcast Tree Network",
TYPE="Technical Report",
INSTITUTION="University of California, Irvine, Department of Information
and Computer Science",
NUMBER="ICS-TR-92-37",
PAGES=35,
MONTH=apr,
YEAR=1992,
ABSTRACT="Packet collisions and their resolution create a performance
bottleneck in random access LANs. Collision avoidance switches are a
hardware solution to this problem. Collision avoidance switches allow
the implementation of random access protocols without the penalty of
collisions among packets. In this paper, we describe a design and
implementation of a local area network architecture based on collision
avoidance, called the Collision Avoidance Multiple Broadcast (CAMB) tree
networks. Our implementation follows the protocol layering architecture
of the IEEE 802 local area networks, and includes CAMB tree switches,
station/network interface boards, and support of transport protocols. We
also present the performance measurements of our experimental CAMB tree
network.",
}

@TECHREPORT{Chie9204:Self,
AUTHOR="Chi-Kai Chien and Isaac Scherson",
TITLE="Self-Routing Lowest Common Ancestor Networks",
TYPE="Technical Report",
INSTITUTION="University of California, Irvine, Department of Information
and Computer Science",
NUMBER="ICS-TR-92-31",
PAGES=22,
MONTH=apr,
YEAR=1992,
ABSTRACT="Multistage interconnection networks (MIN's) allow
communication between terminals on opposing sides of a network. Lowest
Common Ancestor Networks (LCAN's) [1] have switches capable of
connecting bi-directional links in a permutation pattern that
additionally permits communication between terminals on the same side.
Self-routing LCAN's have interesting permutation routing capabilities
and are highly partionable. This paper characterizes self-routing LCAN's
and analyzes their permutation routing capabilities. It is shown that
the routing network of the CM-5 is a particular instance of an LCAN.",
}

@ARTICLE{Kowt9204:Realization,
AUTHOR="Sitaram Kowtha and Dhadesugoor R. 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",
MONTH=apr,
YEAR=1992,
REFERENCES=20,
KEYWORDS="ATM traffic models; broadband ISDN; ATM traffic generators",
ABSTRACT="Carefully selected traffic generators enable accurate
simulation of integrated broad band 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 level 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
source (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
aggregated traffic behaviour.",
}

@ARTICLE{Rekh9204:IDRP,
AUTHOR="Y. Rekhter",
TITLE="{IDRP} Protocol Analysis: Storage Complexity",
JOURNAL=ccr,
VOLUME=22,
NUMBER=2,
PAGES="17-28",
MONTH=apr,
YEAR=1992,
REFERENCES=13,
ABSTRACT="IDRP is an inter-domain routing protocol that is based on the
path-vector routing algorithm.  This paper analyses storage complexity
of the protocol and suggests possible local techniques for reducing
it.",
URL="http://www.acm.org/sigcomm/ccr/archive/1992/apr92/rekhter.ps",
}

@ARTICLE{Newn9204:SE,
AUTHOR="O. Newnan",
TITLE="{SE-OSI:} A Prototype Support Environment for Open Systems
Interconnection",
JOURNAL=ccr,
VOLUME=22,
NUMBER=2,
PAGES="43-62",
MONTH=apr,
YEAR=1992,
REFERENCES=25,
ABSTRACT="SE-OSI is a prototype of a support environment (SE) for Open
Systems Interconnection (OSI).  Written in the C++ programming language,
it demonstrates object-oriented application programming interface (APIs)
for OSI as well as Open Distributed Processing (ODP) and investigates
transparent transition to OSI and ODP through use of common APIs. 
Preliminary benchmarks suggest that the SE-OSI approach is suitable for
real-time applications. This approach is contrasted with communications
APIs currently being developed in standards bodies and consortiums, with
recommendations made as to future directions for standardization of APIs
and supporting environments.",
URL="http://www.acm.org/sigcomm/ccr/archive/1992/apr92/se-osi.ps",
}

@ARTICLE{Fran9204:Semantically,
AUTHOR="R. B. France",
TITLE="Semantically Extended Data {FLow} Diagrams: A Formal
Specification Tool",
JOURNAL=ieeese,
VOLUME=18,
NUMBER=4,
PAGES="329-346",
MONTH=apr,
YEAR=1992,
KEYWORDS="data flow; formal; fdt; dfm",
}

@TECHREPORT{Burk9204:Constructing,
AUTHOR="Anthony N. Burkitt",
TITLE="Constructing Feed-Forward Neural Networks using
Back-Propagation",
INSTITUTION="Dept. of Computer Science, Australian National University",
ADDRESS="Canberra 0200 ACT, Australia",
NUMBER="TR-CS-92-07",
MONTH=apr,
YEAR=1992,
}

@TECHREPORT{John9204:Appropriate,
AUTHOR="C. W. Johnson",
TITLE="Appropriate Use of Computing Technology",
INSTITUTION="Dept. of Computer Science, Australian National University",
ADDRESS="Canberra 0200 ACT, Australia",
NUMBER="TR-CS-92-06",
MONTH=apr,
YEAR=1992,
}

@TECHREPORT{Popp9204:SHYSTER,
AUTHOR="James Popple",
TITLE="{SHYSTER} and the calculation of Distance between Cases",
INSTITUTION="Dept. of Computer Science, Australian National University",
ADDRESS="Canberra 0200 ACT, Australia",
NUMBER="TR-CS-92-05",
MONTH=apr,
YEAR=1992,
}

@TECHREPORT{Zell9204:Porting,
AUTHOR="Markus Zellner",
TITLE="Porting Programs from the iPSC/860 to the {AP1000}",
INSTITUTION="Dept. of Computer Science, Australian National University",
ADDRESS="Canberra 0200 ACT, Australia",
NUMBER="TR-CS-92-04",
MONTH=apr,
YEAR=1992,
}

@TECHREPORT{Asmu9204:Renewal,
AUTHOR="S. Asmussen and M. Bladt",
TITLE="Renewal Theory and Queueing Algorithms for Matrix-Exponential
Distributions",
INSTITUTION="The Univ.  of Aalborg, Institute for Electronic Systems,
Department of Mathematics and Computer Science",
NUMBER="R 92-2004",
PAGES=20,
MONTH=apr,
YEAR=1992,
KEYWORDS="matrix; exponential distribution; phase-type model; Laplace
transform; renewal process; GI/G/1; waiting time; matrix-exponential
distribution; minimal represent