@ARTICLE{Jaya9109:Coding,
AUTHOR="Nuggehally S. Jayant and Victor B. Lawrence and Dimitrios P.
Prezas",
TITLE="Coding of Speech and Wideband Data",
JOURNAL=atttj,
VOLUME=69,
NUMBER=5,
PAGES="25-41",
MONTH="September/October",
YEAR=1991,
KEYWORDS="packet voice; speech coding",
ABSTRACT="Advances in coding algorithms and digital signal processing
have led to sophisticated technologies for speech communication for a
variety of applications, as well as to greater flexibilities in the
design of ISDN terminals for integrated communication of speech, images,
and data. For traditional telephony with a signal bandwidth of 3.2 kHz,
the transmission rate for network-quality speech is now down to 16 kb/s.
Robust communications-quality speech appropriate for cellular radio has
been realized at 8 kb/s. Research attention is shifting towards 4 kb/s,
focused on improved speaker identification and the naturalness of coded
speech. For wideband audio with a signal bandwith of 7 kHz, high-quality
coding is now possible at 32 kb/s, which implies stereo teleconferencing
or dual-language programming over a 64-kb/s channel. Transparent coding
of 20-kHz audio has been demonstrated at 128 kb/s, with near-transparent
performance at rates as low as 64 kb/s for some classes of signals.",
ANNOTE="Speech quality and delay considerations of waveform and
model-based speech coding algorithms from 2.4 kb/s (LPC) to 128 kb/s.",
}

@TECHREPORT{Ferr91:Buffer,
AUTHOR="D. Ferrari and Dinesh Verma",
TITLE="Buffer space allocation for real-time channels in a packet
switching network",
TYPE="Technical Report",
INSTITUTION="Computer Science Division, Department of Electrical
Engineering and Computer Sciences, University of California",
ADDRESS="Berkeley, California",
YEAR=1991,
KEYWORDS="real-time communications; Tenet; buffer allocation",
ABSTRACT="Broadband integrated networks will have to offer real-time
communication services; that is, they will have to transport information
with performance guarantees. A paper previously published by the authors
presented a scheme for establishing real-time channels in a pure
packet-switching network; that scheme did not include any method for
allocating buffer space in the network's nodes to the channels being
established. This paper completes the description and evaluation of that
scheme, since it presents one such method, and some of the results of
the extensive simulations performed to test it. The method is found to
be correct and to have a low overhead. While the utilization of the
buffer space allocated to the statistical channels is often quite low,
thereby indicating that our worst-case approach tends to overallocate
space to those channels, the space our method gives to deterministic
channels seems to be reasonably well utilized.",
}

@MISC{Moha91:Effect,
AUTHOR="B. P. Mohanty and Christos Cassandras",
TITLE="The Effect of Model Uncertainty on Optimal Routing",
YEAR=1991,
KEYWORDS="routing",
ANNOTE="optimal routing in a system of parallel queues with uncertain
system time distribution.",
}

@MISC{Ping91:Scheduling,
AUTHOR="Shridhar Pingali and James F. Kurose",
TITLE="On Scheduling Two Classes of Real Time Traffic with Identical
Deadlines",
YEAR=1991,
KEYWORDS="discrete time queue; packet video; minimum laxity",
ABSTRACT="The problem of scheduling two classes of real-time traffic
with correlated time constraints is considered. Three scheduling
disciplines are studied: a priority discipline which gives strict
priority to one class of traffic, a threshold-based scheme in which
priority is given to one class of traffic when the minimum laxity of its
queued packets falls below some threshold, and a ``balancing'' scheme
which assigns priority on the basis of the differences in minimum
laxities in the two classes of traffic. Analytic results are obtained by
using a discrete time model to obtain the state occupancy probabilities
for the system. Here, the state is defined using the laxities of the
queued real-time packets. Parameters are defined to study the tradeoff
in the performance of the two classes of traffic. Results are obtained
to demonstrate how the balancing scheme permits us to achieve
significant improvement in the performance of one class of traffic with
only minimal effect on the performance of the other class. A video
application is suggested for this work.",
URL="ftp://gaia.cs.umas.edu/pub/Ping91:Scheduling.ps.Z",
}

@UNPUBLISHED{Yee91:Convergence,
AUTHOR="James Yee and M. J. Lee",
TITLE="Convergence of an Iterative Method for {ATM} Networks",
NOTE="submitted to {\em IEEE Transactions on Information Theory}",
YEAR=1991,
ABSTRACT="In this paper, the authors present a flow model for evaluating
the performance of a network of ATM switches. The performance measures
used include the link and end-to-end cell loss probabilities as well as
the link (nodal) and end-to-end cell delays. In the model, the routing
assignments are assumed to be given. The assumed form of routing
assignments may be used to represent either virtual circuit or datagram
service. Due to the nonlinear relationship between cell losses and
offered flows, the flow model is a system of nonlinear equations. We
develop a sufficient condition for the existence of a unique solution to
the nonlinear system of equations. We present an iterative method and
prove that it converges to a unique fixed point provided the sufficient
condition is satisfied. The unique fixed point corresponds to the unique
solution of the flow model. We applied the iterative method to evaluate
the performance of a 61-node wide area ATM network. Four typical routing
strategies were compared with respect to the end-to-end delays and
throughputs. In this example, 99\% of the end-to-end delay was due to
the propagation delay.",
ANNOTE="Discrete-time queues.",
}

@ARTICLE{Kish9108:HDTV,
AUTHOR="R. Kishimoto and Ichiro Yamashita",
TITLE="{HDTV} communication Systems in Broadband Communication
Networks",
JOURNAL=ieeecm,
VOLUME=29,
NUMBER=8,
PAGES="28-35",
MONTH="Aug",
YEAR=1991,
KEYWORDS="HDTV communication systems; broadband communication networks;
packet video; subband coding; DPCM; DCT",
ABSTRACT="Society is rapidly moving into the information age. Demand is
growing for a high-quality telecommunication system that supports a wide
variety of services. High Definition Television (HDTV) is the coming
standard for the television of the future. HDTV will be one of the
market forces driving fiber optic cables into the home. Therefore, a
nationwide HDTV transmission and distribution network must be developed
in order to offer economical HDTV services to the customer.",
ANNOTE="120 Mb/s",
}

@ARTICLE{Nino9108:HDTV,
AUTHOR="Yuichi Ninomiya",
TITLE="{HDTV} Broadcasting Systems",
JOURNAL=ieeecm,
VOLUME=29,
NUMBER=8,
PAGES="15-22",
MONTH="Aug",
YEAR=1991,
KEYWORDS="HDTV broadcasting systems; high definition television; packet
video; MUSE; HD-MAC",
ABSTRACT="High definition television (HDTV) systems are now reaching the
stage of practical use. In Japan, daily HDTV broadcasting by the
Multiple Sub-Nyquist Sampling Encoding (MUSE) system has been going on
for more than two years on an experimental basis. This will be increased
to nearly full scale test broadcasting late this year, preceding the
start of a regular service. As regards software, many programs have
already been produced in the U.S., Europe, and Japan, a large number of
which have been presented at the Electronic Cinema Festival, which is
held almost every year and has a good reputation with audiences. Several
have been screened in theaters on a commercial basis.",
}

@MANUAL{Zilo91:Datacom,
AUTHOR="Zilog",
TITLE="Datacom {ICs}",
ORGANIZATION="Zilog",
ADDRESS="Campbell, California",
YEAR=1991,
}

@ARTICLE{Eckb9109:Controlling,
AUTHOR="A. E. Eckberg and B. T. Doshi and Richard Zoccolillo",
TITLE="Controlling Congestion in {B-ISDN/ATM:} Issues and Strategies",
JOURNAL=ieeecm,
VOLUME=29,
NUMBER=9,
PAGES="64-74",
MONTH="Sep",
YEAR=1991,
KEYWORDS="Congestion control; B-ISDN; ATM",
ABSTRACT="A layered and distributed congestion-control framework can
realize the high-level goals of simplicity, robustness, flexibility, and
controllability.",
}

@ARTICLE{Robe9109:Variable,
AUTHOR="J. W. Roberts",
TITLE="Variable-Bit-Rate Traffic Control in {B-ISDN}",
JOURNAL=ieeecm,
VOLUME=29,
NUMBER=9,
PAGES="50-57",
MONTH="Sep",
YEAR=1991,
KEYWORDS="Variable-Bit-Rate Traffic Control; B-ISDN",
ABSTRACT="The three-way relationship between traffic descriptors,
admission control, and rate enforcement determine the kinds of traffic
control that can guarantee quality-of-service.",
ANNOTE="Traffic control. Distinguishes cell and burst component of
buffer saturation probability.",
}

@TECHREPORT{Cido91:Bandwidth,
AUTHOR="I. Cidon and I. Gopal and R. Guérin",
TITLE="Bandwidth management and congestion control in {plaNET}",
TYPE="Technical Report",
INSTITUTION="High Performance Computing and Communications Directorate,
IBM T. J. Watson Research Center",
ADDRESS="Yorktown Heights, New York",
YEAR=1991,
KEYWORDS="ATM; plaNET; leaky bucket; congestion control; admission
control",
ABSTRACT="In this paper we describe the algorithms, protocols and
concepts that make up the bandwidth management and congestion control in
the plaNET gigabit/second wide area network. Most of the concepts are
relatively general and can be applied to any high speed integrated
network, including ATM based systems. We will implement and
experimentally validate the ideas presented in this paper in several
test-beds and field trials planned over the course of the next year.",
}

@TECHREPORT{Ferr91:Guaranteeing,
AUTHOR="D. Ferrari and Dinesh Verma and Hui Zhang",
TITLE="Guaranteeing delay jitter bounds in packet-switching networks",
INSTITUTION="TENET Group, CS Division of the University of California
and the International Computer Sciences Institute",
ADDRESS="Berkeley, California",
PAGES="1-6",
YEAR=1991,
KEYWORDS="queueing theory; congestion control",
ANNOTE="Delay and jitter bounds for VCs by reconstructing input pattern
at each node. Contract specifies minimum and average spacing between
packets. Scheduler delays until delay bound at each node. Shows some
numerical results.",
}

@BOOK{Come91:Internetworking1,
AUTHOR="D. Comer and David L. Stevens",
TITLE="Internetworking with {TCP/IP}",
ISBN="0-13-468505-9",
PUBLISHER="Prentice Hall",
ADDRESS="Englewood Cliffs, New Jersey",
VOLUME=1,
YEAR=1991,
KEYWORDS="computer networks; TCP/IP; internet",
}

@BOOK{Wils91:Berkeley,
AUTHOR="James R. Wilson",
TITLE="Berkeley Unix -- A Simple and Comprehensive Guide",
ISBN="0-471-61582-X",
PUBLISHER="John Wiley and Sons",
ADDRESS="New York",
YEAR=1991,
KEYWORDS="Unix; operating systems",
}

@UNPUBLISHED{Gopa91:Transparency,
AUTHOR="I. Gopal and R. Guérin",
TITLE="Network transparency: the {plaNET} approach",
INSTITUTION="IBM T. J. Watson Research Center",
ADDRESS="Yorktown Heights, New York",
NOTE="unpublished memorandum",
YEAR=1991,
KEYWORDS="ATM; network architecture",
ABSTRACT="Asynchronous transfer mode (ATM) is being suggested as the
basis for future high speed, ``universal'' networks. Unfortunately, the
standardization process and the subsequent delay anticipated in
deployment make it likely that ATM will not be widely available till the
late 1990's. We argue in this paper that by this time a key requirement
for networks will be ``transparency,'' i.e., for the network to alter or
manipulate the user information as little as possible. A ``transparent''
tranport mechanism, plaNET, based on extensions of the current ATM
standard and IBM earlier PARIS technology, is proposed. It is shown that
plaNET can satisfy the ``universal'' transport requirement of ATM, while
avoiding some demonstrated deficiencies. In fact, it is claimed that
plaNET can be viewed as an enhanced version of ATM that may be more
suitable for the late 1990's than the current standard.",
ANNOTE="argues for use of variable-size packets; AURORA",
}

@INPROCEEDINGS{Wein91:Virtual,
AUTHOR="A. Weinrib and L. T. Wu",
TITLE="Virtual clocks and leaky buckets: flow control protocols for
high-speed networks",
BOOKTITLE="IFIP Working Group WG 6.1 and WG 6.4 Second International
Workshop on Protocols for High-Speed Networks",
EDITOR="Marjory Johnson",
ORGANIZATION="IFIP",
PAGES="3-15",
YEAR=1991,
KEYWORDS="flow control; leaky bucket; virtual clock; fairness",
ABSTRACT="We show that two protocols proposed for rate-based flow
control of broadband packet networks, the virtual clock and the leaky
bucket, are in a sense ``equivalent'' in that the equations that their
underlying state variables satisfy are closely related. The differences
between the two protocols arise from the use of the state information,
rather than from some fundamental difference in the state variables. We
then turn to a discussion of fairness in broadband networks, aruging
that both fairness in delay and packet dropping and fairness in
guaranteeing service are desirable. Neither of the two protocols fully
meets both requirements for fairness. Comparing the fairness-performance
of the two protocols, we suggest a modified protocol that appears to
better meet the fairness requirements.",
}

@BOOK{Holz91:Validation,
AUTHOR="Gerard J Holzmann",
TITLE="Design and Validation of Computer Protocols",
ISBN="0-13-539925-4",
PUBLISHER="Prentice Hall",
ADDRESS="Englewood Cliffs, New Jersey",
YEAR=1991,
KEYWORDS="protocol; protocol verification; checksum; survey; error
control; finite state machines; conformance testing; SPIN; PROMELA",
}

@BOOK{Stal91:Data,
AUTHOR="W. Stallings",
TITLE="Data and Computer Communications",
ISBN="0-02-415454-7",
PUBLISHER="Macmillan",
ADDRESS="New York, New York",
YEAR=1991,
ANNOTE="Computer networking --- tutorial.",
}

@ARTICLE{Sher9107:Les,
AUTHOR="M. H. Sherif and Marie-Pascale Bosse",
TITLE="Les paquets de bande élargie: une nouvelle technique de
transmission",
JOURNAL=atele,
VOLUME=46,
NUMBER="7--8",
PAGES="392-407",
MONTH="July--August",
YEAR=1991,
KEYWORDS="packet transmission; speech coding; differential PCM; ADPCM;
multimedia; packet voice",
ABSTRACT="The purpose of this article is to describe the principles and
applications of a new transmission technology for multimedia traffic
based on wideband packets. This integration allows more efficient
utilization of the network and reduces the operation and maintenance
costs. Next, we present AT\\&T's integrated access and crossconnect
system (IACS) as an example of an implementation of this technology.",
ANNOTE="Describes G.764 and G.727 in some detail.",
}

@ARTICLE{Camp9103:Federal,
AUTHOR="Andrew T Campbell and Thomas E. Tremain and Vanoy C. Welch",
TITLE="The Federal Standard 1016 4800 bps {CELP} Voice Coder",
JOURNAL="Digital Signal Processing",
VOLUME=1,
NUMBER=3,
PAGES="145-155",
YEAR=1991,
KEYWORDS="CELP; low-rate speech coding",
}

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

@ARTICLE{Agne91:Global,
AUTHOR="Ralf Agne",
TITLE="Global Cyclic Scheduling: A Method to Guarantee the Timing
Behavior of Distributed Real-Time Systems",
JOURNAL="Journal of Real-Time Systems",
VOLUME=3,
PAGES="45-66",
YEAR=1991,
}

@INPROCEEDINGS{Agra91:Architectural,
AUTHOR="Gopal Agrawal and Baio Chen and W. Zhao and Sadegh Davari",
TITLE="Architectural Impact of {FDDI} Network on Scheduling Hard
Real-Time Traffic",
BOOKTITLE="Real-Time Systems Symposium",
ADDRESS="San Antonio, Texas",
PAGES="22-26",
YEAR=1991,
}

@INPROCEEDINGS{Aras91:Improving,
AUTHOR="Caglan M. Aras and Ren C. Luo and Douglas Reeves",
TITLE="Improving Hierarchical Architecture Performance with Dynamic
Segmentation",
BOOKTITLE="International Conference on Systems, Man and Cybernetics",
ADDRESS="Charlottesville, Virginia",
VOLUME=2,
PAGES="801-806",
YEAR=1991,
}

@ARTICLE{Arvi91:Local,
AUTHOR="K. Arvind and Krithivasan Ramamritham and John Stankovic",
TITLE="A Local Area Network Architecture for Communication in
Distributed Real-Time Systems",
JOURNAL="Journal of Real-Time Systems",
VOLUME=3,
PAGES="115-14",
YEAR=1991,
}

@TECHREPORT{Chen91:Multimedia,
AUTHOR="M.-S. Chen",
TITLE="A multimedia multiparty teleconference",
TYPE="Technical Note",
INSTITUTION="IBM T. J. Watson Research Center",
ADDRESS="Yorktown Heights, New York",
YEAR=1991,
KEYWORDS="multimedia; teleconferencing; shared whiteboard; multicast;
shared editor; CSCW",
ABSTRACT="MEET (multiple end-to-end teleconference) is envisioned as a
desktop hub-free (peer) personal teleconference system that allows
people to do ``face-to-face'' meetings without leaving their offices.
Using MEET, users see each other via real-time motion video, talk and
hear all the talks via real-time audio and present documents such as
foils via an on-line Electronic Blackboard (EB). MEET is currently being
designed and prototyped by the High Bandwidth Applications group at IBM
T. J. Watson Research Center, and will be installed in the PARIS fast
packet switched networks in the Aurora testbed. This article describes
the goals, specifications, and prototype of the project.",
ANNOTE="PS/2 Model 80; disable voices from particular sources; dynamic
connection-oriented multicast",
}

@BOOK{Dhas91:Broadband,
AUTHOR="C. R. Dhas and V. Konangi and M. Sreetharan",
TITLE="Broadband Switching: Architectures, Protocols, Design and
Analysis",
PUBLISHER="IEEE Computer Society Press",
ADDRESS="Los Alamitos, California",
YEAR=1991,
}

@INPROCEEDINGS{Du91:Mapping,
AUTHOR="D. Z. Du and Guy Vidal-Naquet",
TITLE="Mapping communicating task graphs onto reconfigurable
multiprocessor architectures",
BOOKTITLE="International Symposium on Computers and Information
Systems",
ADDRESS="Antalya, Turkey",
VOLUME=1,
YEAR=1991,
}

@INPROCEEDINGS{Kand91:Real,
AUTHOR="D. Kandlur and Kang G. Shin and D. Ferrari",
TITLE="Real-Time Communication in Multi-hop Networks",
BOOKTITLE="11th International Conference on Distributed Computing
Systems",
ADDRESS="Arlington, Texas",
PAGES="300-307",
YEAR=1991,
}

@INPROCEEDINGS{Kim91:Modeling,
AUTHOR="Jaehyung Kim and Ch. Das",
TITLE="Modeling Wormhole Routing in a Hypercube",
BOOKTITLE="1th Conference on Distributed Computing Systems",
ADDRESS="Arlington, Texas",
PAGES="386-393",
YEAR=1991,
}

@BOOK{Li91:Reconfigurable,
AUTHOR="Hungwen Li and Quentin F. Stout",
TITLE="Reconfigurable Massively Parallel Computers",
PUBLISHER="Prentice Hall",
ADDRESS="Englewood Cliffs, New Jersey",
YEAR=1991,
}

@INPROCEEDINGS{Lim91:Comparative,
AUTHOR="C. S. Lim and Li-jun Yao and W. Zhao",
TITLE="A Comparative Study of Three Token Ring Protocols for Real-Time
Communications",
BOOKTITLE="11th Conference on Distributed Computing Systems",
ADDRESS="Arlington, Texas",
PAGES="308-317",
YEAR=1991,
}

@INPROCEEDINGS{Luo91:MARGE,
AUTHOR="Ren C. Luo and Caglan M. Aras and Harsha Potlapalli and Min
Lin",
TITLE="{MARGE:} Mobile Autonomous Robot for Guidance Experiments",
BOOKTITLE="SME Conference on Manufacturing and Automation",
ADDRESS="Pittsburgh, Pennsylvania",
YEAR=1991,
}

@INPROCEEDINGS{Pamu91:Computational,
AUTHOR="Yahya Pamukcuoglu and Oguz Tosun",
TITLE="Computational Models for Task Response Time Optimization in
Real-Time Distributed Systems",
BOOKTITLE="International Symposium on Computers and Information
Systems",
ADDRESS="Antalya, Turkey",
YEAR=1991,
}

@INPROCEEDINGS{Reis91:Demo,
AUTHOR="B. D. Reister and John Jones and P. L. Butler and M. Beckerman
and F. J. Sweeney",
TITLE="Demo-89 The initial Experiment with the {Hermies-III} Robot",
BOOKTITLE="IEEE International Conference on Robotics and Automation",
ADDRESS="Sacremento, California",
VOLUME=3,
PAGES="2562-2567",
YEAR=1991,
}

@INPROCEEDINGS{Shuk91:Scheduling,
AUTHOR="Shridhar B. Shukla and D. P. Agrawal",
TITLE="Scheduling Pipelined Communication in Distributed Memory
Multiprocessors for Real-time Applications",
BOOKTITLE="18th International Symposium on Computer Architecture",
ADDRESS="Toronto, Canada",
PAGES="222-231",
YEAR=1991,
}

@INPROCEEDINGS{Sing91:Obstacle,
AUTHOR="S. Singh",
TITLE="Obstacle Detection for High Speed Autonomous Navigation",
BOOKTITLE="IEEE International Conference on Robotics and Automation",
ADDRESS="Sacramento, California",
VOLUME=3,
PAGES="2798-2805",
YEAR=1991,
}

@BOOK{Spra91:Telecommunications,
AUTHOR="J. D. Spragins and J. L. Hammond and Krzysztof Pawlikowski",
TITLE="Telecommunications: Protocols and Design",
PUBLISHER="Addison-Wesley",
ADDRESS="Reading, Massachusetts",
YEAR=1991,
}

@ARTICLE{Verh91:Static,
AUTHOR="J. P. C. Verhoosel and E. J. Luit and D. K. Hammer",
TITLE="A Static Scheduling Algorithm for Distributed Hard Real-Time
Systems",
JOURNAL="Journal of Real-Time Systems",
VOLUME=3,
PAGES="227-246",
YEAR=1991,
}

@BOOK{Tilb91:Foundations,
AUTHOR="Andre van Tilborg and Gary M. Koob",
TITLE="Foundations of Real-Time Computing: Scheduling and Resource
Management",
PUBLISHER="Kluwer Academic Publishers",
ADDRESS="Boston/Dordrecht/London",
YEAR=1991,
}

@ARTICLE{Youn91:Integrated,
AUTHOR="Young Sik Youn and Chong Kwan Un",
TITLE="Performance analysis of an integrated voice/data cut-through
switching network",
JOURNAL=cnis,
VOLUME=21,
PAGES="41-51",
YEAR=1991,
KEYWORDS="packet voice; cut-through switching; integrated services",
ABSTRACT="In this paper, the performance of an integrated voice/data
cut-through switching network is studied. We first derive cut-through
probabilities of voice and data packets at intermediate nodes. Then, the
Laplace transform for the network delay is obtained. According to our
numerical results, the cut-through switching method is superior in its
delay characteristics to the conventional packet switching for voice and
data in integrated voice/data networks.",
}

@ARTICLE{Ngoh91:Multicast,
AUTHOR="L. H. Ngoh",
TITLE="Multicast support for group communications",
JOURNAL=cnis,
VOLUME=22,
PAGES="165-178",
YEAR=1991,
KEYWORDS="multicast; group communications; multimedia",
ABSTRACT="This paper describes a multicast model which can be integrated
into existing unicast communication systems to provide better support
for group communications. Multicast services are becoming more
important, as more and more of today's network workstation environments
are used to provide group communication for the exchange of multimedia
information. These environments allow users to exchange information in
the form of 'documents' containing text, graphics and voice; some
systems support both store-and-forward (e.g., mail) and real-time (e.g.,
conferencing) material. In this paper, various multicast design issues
are addressed and solutions are proposed to provide an effective
multicast extension for a wide range of existing unicast protocols.",
}

@ARTICLE{Wils91:Computer,
AUTHOR="Paul Wilson",
TITLE="Computer supported cooperative work {(CSCW):} origins, concepts
and research initiatives",
JOURNAL=cnis,
VOLUME=23,
PAGES="91-95",
YEAR=1991,
KEYWORDS="computer supported cooperative work; CSCW; groupware;
multimedia; collaboratory; research networks; requirements",
ABSTRACT="Computer Supported Cooperative Work (CSCW) aims to improve the
effectiveness of teams of all sizes - from 2 people up to whole
organizations. CSCW has two main components: Underlying Technologies
(communication systems, shared work space facilities, shared information
facilities, and group activity support facilities); and Group Process
Issues (individual aspects, organizational aspects, group work design
aspects, group dynamics aspects). CSCW systems will require networks to
transport voice and video material, to provide services to enable groups
to establish themselves and conduct their work, and to do all this with
outstanding levels of usability. The concept of a Collaboratory - a
research centre without walls - is outlined and its applicability in
Europe is discussed.",
}

@BOOK{Unic91:Unicode,
AUTHOR="The Salutation Consortium",
TITLE="The Unicode Standard",
PUBLISHER="Addison-Wesley",
ADDRESS="New York, New York",
YEAR=1991,
KEYWORDS="unicode; character set",
}

@ARTICLE{Lahe9103:Fortran,
AUTHOR="Thomas M. Lahey",
TITLE="Fortran 90 is coming!",
JOURNAL="Programmer's Journal",
MONTH="March/April",
YEAR=1991,
KEYWORDS="Fortran; computer languages",
}

@BOOK{Inmo91:T9000,
AUTHOR="Inmos",
TITLE="The {T9000} transputer: products overview manual",
PUBLISHER="SGS-Thomson",
ADDRESS="Bristol, United Kingdom",
YEAR=1991,
KEYWORDS="transputer; computer architecture",
}

@INCOLLECTION{Cohe91:Multidimensional,
AUTHOR="Michael Cohen and L. F. Ludwig",
TITLE="Multidimensional audio window management",
BOOKTITLE="Computer-supported cooperative work and groupware",
EDITOR="Saul Greenberg",
CHAPTER=10,
SERIES="Computers and People Series",
PUBLISHER="Harcourt Bruce Jovanovich",
ADDRESS="London",
PAGES="193-210",
YEAR=1991,
KEYWORDS="audio; teleconferencing; user interface; sound localization",
ABSTRACT="This paper proposes an organization of presentation and
control that implements a flexible audio management system we call
``audio windows''. The result is a new user interface integrating an
enhanced spatial sound presentation system, an audio emphasis system,
and a gestural input recognition system. We have implemented these ideas
in a modest prototype, also described, designed as an audio server
appropriate for a teleconferencing system. Our system combines a
gestural front end (currently based on a DataGlove, but whose concepts
are appropriate for other devices as well) with an enhanced spatial
sound system, a digital signal processing separation of multiple sound
sources, augmented with ``filtears'', audio feedback cues that convey
added information without distraction or loss of intelligibility. Our
prototype employs a manual front end (requiring no keyboard or mouse)
driving an auditory back end (requiring no CRT or visual display).",
ANNOTE="teleconference applications: source separation, moving between
conversations, high-lighting of sources, muffling of selected sources",
}

@UNPUBLISHED{Klei91:Writing,
AUTHOR="S. Kleiman and Bart Smaalders and D. Stein and D. Shah",
TITLE="Writing multithreaded code in Solaris",
NOTE="Sun Microsystems",
YEAR=1991,
KEYWORDS="multithreading; threads; operating systems; RPC; Solaris;
SunOS",
ABSTRACT="SunOS 5.0 is the operating system component of Solaris 2.0.
SunOS 5.0 contains the kernel support for multiple threads of control in
a single process address space. This allows a single application to
efficiently overlap I/O operations and to take advantage of more than
one processor, if available. We describe some of the issues in using and
converting libraries to the multithreaded environment. In addition, we
give several examples of different uses of threads in user
applications.",
}

@INPROCEEDINGS{Powe91:SunOS,
AUTHOR="Mike L. Powell and S. Kleiman and S. Barton and D. Shah and D.
Stein and M. Weeks",
TITLE="{SunOS} 5.0 multithreaded architecture",
BOOKTITLE=usenixw,
ADDRESS="Dallas, Texas",
YEAR=1991,
KEYWORDS="multithreading; operating systems; threads; SunOS; Solaris",
ABSTRACT="This paper describes a model for multiple threads of control
within a single process. The main goals are to provide extremely
lightweight threads and to rationalize and extend the UNIX application
programming interface for a multithreaded environment. The threads are
intended to be sufficiently lightweight so that there can be thousands
present and that synchronization and context switching can be
accomplished rapidly without entering the kernel. These goals are
achieved by providing lightweight user-level threads that are
multiplexed on top of kernel-supported threads of control. This
architecture allows the programmer to separate logical (program)
concurrency from the required real concurrency, which is relatively
costly, and to control both within a single programming model.",
}

@TECHREPORT{Cido91: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",
INSTITUTION="IBM T. J. Watson Research Center",
ADDRESS="Yorktown Heights, New York",
YEAR=1991,
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. By using LAN traffic data, we show that the fixed length
packets in ATM can result in significantly worse transmission efficiency
over variable size in many real traffic scenarios. In addition, we
demonstrate that considerably more processing power is needed to handle
segmentation and reassembly for ATM and that statistical multiplexing
also present some unique problems. Also, we present some qualitative
arguments to show that the label swapping approach for routing in ATM is
more complex to implement, potentially slower in processing call setup
and less capable of supporting datagrams when compared to the source
routing technique.",
}

@BOOK{Rose91:Simple,
AUTHOR="Marshall T. Rose",
TITLE="The Simple Book",
ISBN="0-13-812611-9",
PUBLISHER="Prentice-Hall",
ADDRESS="Englewood Cliffs, New Jersey",
YEAR=1991,
KEYWORDS="SNMP; network management; TCP/IP",
}

@BOOK{Rose91:Little,
AUTHOR="Marshall T. Rose",
TITLE="The Little Black Book: Mail-Bonding with {OSI} Directory
Services",
PUBLISHER="Prentice-Hall",
ADDRESS="Englewood Cliffs, New Jersey",
YEAR=1991,
KEYWORDS="X.500; X.400; electronic mail; OSI",
}

@MASTERSTHESIS{Reid91:Electropolis,
AUTHOR="Elizabeth M. Reid",
TITLE="Electropolis: communication and community on internet relay
chat",
SCHOOL="University of Melbourne, Department of History",
ADDRESS="Melbourne, Australia",
NOTE="Honours Thesis",
YEAR=1991,
KEYWORDS="Internet; IRC; internet relay chat; social implications;
electronic communities; virtual reality; computer-mediated
communication",
URL="ftp://parcftp.xerox.com/pub/MOO/papers/electropolis.ps",
}

@ARTICLE{Rich91:Building,
AUTHOR="R. F. Richardson",
TITLE="Building and managing an integrated support environment",
JOURNAL="Hewlett-Packard Journal",
PUBLISHER="Hewlett-Packard Company",
ADDRESS="Palo Alto, California",
VOLUME=42,
NUMBER=2,
PAGES="90-96",
YEAR=1991,
}

@ARTICLE{Dudi91:Optimising,
AUTHOR="A. N. Dudin and V. I. Klimenok",
TITLE="Optimising the Dynamic Control of Traffic in a Node of a Computer
Network",
JOURNAL="Avtomatika I Vychislitelnaya Tekhnika (Automation and remote
control)",
PUBLISHER="Instrument Society of America",
VOLUME=2,
PAGES="25-31",
YEAR=1991,
}

@ARTICLE{Mukh91:Open,
AUTHOR="B. Mukherjee",
TITLE="The Open-Ring Active Bus Network Structure - Access Techniques
and their Heavy Traffic Performance",
JOURNAL=ieeecom,
PUBLISHER="IEEE",
VOLUME=39,
NUMBER=4,
PAGES="474-477",
YEAR=1991,
}

@ARTICLE{Chem91:Supporting,
AUTHOR="Prosper Chemouil and J. Filipiak",
TITLE="Supporting Network Management with Real-Time Traffic Models",
JOURNAL=ieeejsac,
PUBLISHER="IEEE",
VOLUME=9,
NUMBER=2,
PAGES="151-156",
YEAR=1991,
}

@ARTICLE{Cahn9107:Intrepid,
AUTHOR="Robert S. Cahn and P. Y. Chang and Parviz Kermani and A.
Kershenbaum",
TITLE="Intrepid: An Integrated Network Tool for Routing, Evaluation of
Performance, and Interactive Design",
JOURNAL=ieeecm,
VOLUME=29,
NUMBER=7,
PAGES="40-47",
MONTH="Jul",
YEAR=1991,
KEYWORDS="Intrepid; Integrated Network Tool",
ABSTRACT="The network design problem, and in particular the environment
in which network design is currently being done, is becoming more
complex. A number of promising approaches to solving parts of this
problem have been described in the literature. Networking products
continue to emerge as do new tariff offerings. The designer is thus
confronted by an often bewildering variety of design alternatives,
including radically different network architectures. In the case of some
of the recently announced new tariffs such as Software Defined Networks
(SDNs), these architectures may include measured services in addition to
leased facilities. Hybrid architectures, including multiple
vendors'-products and tariffed offerings, are also possible.",
}

@ARTICLE{Crin91:Implementation,
AUTHOR="J. K. Cringen and R. England and G. A. Manson P. Willett",
TITLE="Network Design for the implementation of text searching using a
multicomputer",
JOURNAL="Information Processing and Management",
PUBLISHER="Pergamon Press",
VOLUME=27,
NUMBER=4,
PAGES="265-283",
YEAR=1991,
}

@ARTICLE{Dand91:Hybercube,
AUTHOR="S. Dandamudi and D. L. Eager",
TITLE="On Hybercube based heirarchical interconnection network design",
JOURNAL=jpdc,
VOLUME=12,
NUMBER=3,
PAGES="283-289",
YEAR=1991,
}

@ARTICLE{Shar91:Application,
AUTHOR="U. Sharma and K. B. Misra and A. K. Bhattacharji",
TITLE="Application of an efficient search technique for optimal design
of a computer communcations network",
JOURNAL="Microelectronics and Reliability",
PUBLISHER="Pergamon Press",
ADDRESS="Oxford, UK",
VOLUME=31,
NUMBER="2-3",
PAGES="337-341",
YEAR=1991,
}

@ARTICLE{Seng91:Synthesis,
AUTHOR="A. Sengupta and P. D. Joshi and S. Bandyopadhyay",
TITLE="A synthesis approach to design optimally fault tolerant network",
JOURNAL=ieeetc,
PUBLISHER="IEEE",
VOLUME=40,
NUMBER=1,
PAGES="94-100",
YEAR=1991,
}

@ARTICLE{Jone91:Protocol,
AUTHOR="M. Jones and S. A. Sorenson and S. R. Wilbur",
TITLE="Protocol Design for Large Group Mulicasting - The Message
Distribution Protocol",
JOURNAL=comcom,
VOLUME=14,
NUMBER=5,
PAGES="287-297",
YEAR=1991,
}

@ARTICLE{Kaku91:Integrated,
AUTHOR="Y. Kakuda and H. Saito",
TITLE="An Integrated Approach To Design of Protocol Specifications Using
Protocol Validation and Synthesis",
JOURNAL=ieeetc,
PUBLISHER="IEEE",
VOLUME=40,
NUMBER=4,
PAGES="459-467",
YEAR=1991,
}

@ARTICLE{Huan91:Computer,
AUTHOR="Chia-chi Huang and Y.-C. Chang and Minkui Liu",
TITLE="A Computer-Aided Protocol Design by Production Systems Approach",
JOURNAL=ieeejsac,
PUBLISHER="IEEE",
VOLUME=8,
NUMBER=9,
PAGES="1748-1762",
YEAR=1991,
}

@ARTICLE{Thei91:Buffered,
AUTHOR="T. H. Theimer and Erwin P. Rathgeb and M. Huber",
TITLE="Performance Analysis of Buffered Banyan Networks",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=2,
PAGES="269-277",
YEAR=1991,
REFERENCES=23,
KEYWORDS="ATM; interconnection network; simulation; analysis; Banyan",
}

@ARTICLE{Sing91:Basic,
AUTHOR="M. Singhal",
TITLE="Performance analysis of the basic timestamp ordering algorithm
via Markov modelling",
JOURNAL=pe,
PUBLISHER="North Holland",
VOLUME=12,
NUMBER=1,
PAGES="17-41",
YEAR=1991,
REFERENCES=36,
KEYWORDS="Database; time stamp; queueing network; concurrency",
ANNOTE="We analyze a single transaction in isolation rather than
analyzing the whole system. We reflect the presence of other tr. by the
prob. that a conflicting access to the data object has been made.
Comparison with simulations.",
}

@ARTICLE{Stan91:Interdeparture,
AUTHOR="D. A. Stanford",
TITLE="Interdeparture-time distributions in the non-preemptive priority
sum Mi/Gi/1 queue",
JOURNAL=pe,
PUBLISHER="North Holland",
VOLUME=12,
NUMBER=1,
PAGES="43-60",
YEAR=1991,
REFERENCES=18,
KEYWORDS="Queueing system; nonpreemptive priority; M/G/1; output",
ANNOTE="This paper provides exact results for the Laplace-Stieltjes
transform of the interdeparture time distribution for each class in the
non-preemptive priority M/G/1 queue where each priority class is allowed
to have its own generally distributed service time characteristics.
Exact formulas of the squared coefficient of variation of the
interdeparture time are also provided, and are illustrated through
several examples.",
}

@TECHREPORT{Neum91:Proxy,
AUTHOR="B. Clifford Neuman",
TITLE="Proxy-Based Authorization and Accounting for Distributed
Systems",
INSTITUTION="Dept. of Computer Science, University of Washington",
YEAR=1991,
}

@ARTICLE{Berg91:Simple,
AUTHOR="Ted Bergstrom and Jeffrey MacKie-Mason",
TITLE="Some Simple Analytics of Peak-Load Pricing",
JOURNAL="Rand Journal of Economics",
VOLUME=22,
MONTH="Summer",
YEAR=1991,
}

@BOOK{Pryc91:Asynchronous,
AUTHOR="M. de Prycker",
TITLE="Asynchronous Transfer Mode: Solution for {ISDN}",
ISBN="0-13-053513-3",
PUBLISHER="Ellis Horwood",
ADDRESS="New York",
YEAR=1991,
KEYWORDS="book; ATM; BISDN",
}

@PHDTHESIS{Labo91:Rearrangeability,
AUTHOR="Jean-Francois Labourdette",
TITLE="Rearrangeability Techniques for Multihop Lightwave Networks and
Applications to Distributed {ATM} Switching Systems",
SCHOOL="Columbia University, Center for Telecommunications Research",
ADDRESS="New York, New York",
YEAR=1991,
KEYWORDS="network; lightwave; ATM; switching; reconfiguration",
ABSTRACT="Its huge bandwidth potential has established single mode fiber
as the transmission medium of choice for distributed communication
systems. However, in order to exploit the optical bandwidth, network
architectures must be designed that overcome the electro-optic
bottleneck, i.e., the mismatch that results from the peak transmission
rate of electronics utilizing only a tiny fraction of the enormous
bandwidth available in the fiber. The multihop architecture uses {\it
wavelength division multiplexing} to provide concurrency in the network
and thus access a large portion of the optical bandwidth. With this
approach, some small number of transmitters and receivers are allocated
to each network station. By assigning transmit and receive wavelengths
to the stations, high-speed channels are created and multiplexed onto
the medium, thereby creating a {\it logical connection diagram} among
stations. Since every two stations will not be directly connected, some
of the traffic may have to hop through intermediate stations to reach
its destination. This thesis expands upon the multihop architecture and
considers the use of slowly tunable lasers and optical filters. Such
devices provide the capability to logically reconfigure the connection
diagram, independently of the fiber infrastructure, by retuning the
transmitters and receivers at each station. This offers the ability to
optimize the network with respect to changing nonuniform traffic
conditions, and to cope with failure/recovery/addition of network
stations. This work evaluates the traffic performance of distributed
lightwave networks based on the reconfigurable multihop architecture. A
heuristic algorithm is developed that seeks the logical connection
diagram and routing which maximize the network throughput under
nonuniform traffic conditions. An original application is proposed in
the form of a highly modular distributed ATM switching system, where the
connection diagram may change each time a newly offered call cannot be
accommodated on the current configuration. Results to be presented show
how rearrangeability techniques can exploit traffic nonuniformities so
that the distributed switch achieves maximum traffic-handling
performance. Finally, a minimally disruptive approach is analyzed that
takes a network from its current connection diagram to a target diagram
through a sequence of intermediate diagrams.",
}

@INCOLLECTION{Bonf91:Conference,
AUTHOR="A. Bonfiglio and G. Malatesta and Francesco Tisato",
TITLE="Conference Toolkit: a framework for real-time conferencing",
BOOKTITLE="Studies in computer supported cooperative work",
EDITOR="J. M. Bowers and Steve David Benford",
SERIES="Human Factors in Information Technology",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam",
PAGES="63-77",
YEAR=1991,
REFERENCES=12,
KEYWORDS="CSCW; toolkit; computer supported cooperative work; X; shared
applications",
ABSTRACT="This paper introduces Conference Toolkit, a system layer
supporting multimedia, real-time cooperation among users via shared
applications. Conference Toolkit allows both to integrate standard
applications in a conference environment and to develop ``conference
aware'' applications. It is based on a concurrent object-oriented
scheme. Conference Desk, a prototype based on the Conference Toolkit
model, is described.",
}

@INCOLLECTION{Gale91:Adding,
AUTHOR="Stephen Gale",
TITLE="Adding audio and video to an office environment",
BOOKTITLE="Studies in computer supported cooperative work",
EDITOR="J. M. Bowers and Steve David Benford",
SERIES="Human Factors in Information Technology",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam",
PAGES="49-62",
YEAR=1991,
REFERENCES=14,
KEYWORDS="CSCW; audio; video; office automation",
ABSTRACT="The aim of the VISION project was to determine the value added
to an office system by incorporating audio and video communication. The
performance, feelings, and perceptions of work groups were measured
while they carried out cooperative tasks in a controlled environment
using an experimental multimedia communication system. The results
showed no significant differences in the quality of the output, or the
time taken to complete the tasks, under three conditions: data sharing;
data sharing plus audio; data sharing plus audio and video. The results
suggest that high bandwidth communication is particularly effective for
social, informal, communication.",
}

@BOOK{Jain91:Art,
AUTHOR="Raj Jain",
TITLE="The art of computer systems performance analysis: techniques for
experimental design, measurement, simulation, and modeling",
ISBN="0-471-50336-3",
PUBLISHER="John Wiley",
ADDRESS="New York",
YEAR=1991,
KEYWORDS="simulation; performance evaluation; statistics",
}

@INCOLLECTION{Prin91:Relevance,
AUTHOR="Wolfgang Prinz and Paola Pennelli",
TITLE="Relevance of the {X.500} directory to {CSCW} applications",
BOOKTITLE="Studies in computer supported cooperative work",
EDITOR="J. M. Bowers and Steve David Benford",
SERIES="Human Factors in Information Technology",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam",
PAGES="267-283",
YEAR=1991,
REFERENCES=19,
KEYWORDS="CSCW; X.500; directory service",
ABSTRACT="In 1988 the standardization bodies ISO and CCITT released the
first international standard of a distributed directory service. The
purpose of the directory as it is described by the standard is to supply
a global nameserver and an application independent management and
information service. But these applications are not exhausting the
possibilities of a directory usage. It is the intention of this paper to
present the possibilities and chances the directory offers to
applications in the CSCW area. Our investigation focuses on CSCW models
and applications that support and coordinate communications in groups.
First the paper identifies and analyzes components which most of these
applications have in common. For the analysis we introduce the
classification of activity oriented models and conversation oriented
models. Then, after a brief introduction into the X.500 directory
service, it is shown in which way the identified components can be
represented by the directory service. The paper concludes with a
discussion of desirable improvements on the directory service.",
}

@INCOLLECTION{Smit91:Preliminary,
AUTHOR="Randall B. Smith and Tim O'Shea and Tim O'Malley and Eileen
Scanlon and J. Taylor",
TITLE="Preliminary experiments with a distributed, multimedia, problem
solving environment",
BOOKTITLE="Studies in computer supported cooperative work",
EDITOR="J. M. Bowers and Steve David Benford",
SERIES="Human Factors in Information Technology",
PUBLISHER="North-Holland",
ADDRESS="Amsterdam",
PAGES="31-48",
YEAR=1991,
REFERENCES=20,
KEYWORDS="CSCW; computer-supported cooperative work; user behavior;
video",
ABSTRACT="We report on studies of pairs of subjects using a system
called SharedARK (for ``Shared Alternate Reality Kit''). In SharedARK,
users at separate workstations interact in real time with the same world
of simulated physical objects. In the experiments, two users are in
separate rooms with a workstation each, and communicate through a high
fidelity, hands-free audio and a camera-monitor device called a ``video
tunnel'' which enables eye contact. For comparison, we have removed the
video tunnel for some subjects, giving them only a workstation each.
Within SharedARK, subjects are given a ``microworld'' within which to
solve a problem in everyday physics. Subjects are videotaped, and
monitored from a remote room. The protocols have been submitted to a
preliminary analysis, in which we categorise activities as they relate
to use of the interface, task performance and social interaction. We
also catalogue eye glances and eye contact in terms of their relation to
these activities. Our primary purpose has been to assess the
learnability and usability of this technology, and to identify factors
that are important in facilitating collaborative problem solving by
directly comparing remote, electronically mediated communication with
physical co-presence. We find the system is easily learned and fairly
easily used. Subjects normally find the task engaging, and usually work
together through largely unarticulated task division to obtain at least
a partial understanding of the solution space. Our observations have led
us to to the hypothesis that this technology can bring subjects in some
ways closer together than if they were to engage in a similar task in
the real world. We present evidence suggesting that this artificially
enhanced proximity may play a positive role in supporting non-interface
specific discourse and task division negotiation.",
}

@ARTICLE{Anon91:Changes,
AUTHOR="A. C. M",
TITLE="Introduction and changes to the Computing Reviews {(CR)}
classification scheme",
JOURNAL=acmcr,
VOLUME=32,
NUMBER=1,
PAGES="7-50",
YEAR=1991,
KEYWORDS="Classification; bibliography",
ANNOTE="Update of the 1982 classification scheme.",
}

@ARTICLE{Bala91:Parallel,
AUTHOR="E. Balas and D. Miller and J. Pekny and P. Toth",
TITLE="A parallel shortest augmenting path algoritm for the assignment
problem",
JOURNAL=jacm,
VOLUME=38,
NUMBER=4,
PAGES="985-1004",
YEAR=1991,
REFERENCES=28,
KEYWORDS="Routing; shortest path; parallel computing; speedup",
ANNOTE="A parallel version of the shortest augmenting path algorithm for
the assignment problem is described.",
}

@TECHREPORT{Thom91:Parallel,
AUTHOR="Graham Thomas and J. L. Zahorjan",
TITLE="Parallel simulation of performance Petri nets: extending the
domain of parallel simulation",
INSTITUTION="University of Washington, Dept. of Computer Science and
Engineering Technology",
ADDRESS="Washington",
NUMBER="91-04-02",
PAGES=19,
YEAR=1991,
REFERENCES=23,
KEYWORDS="Distributed simulation; SPN; stochastic Petri net; speedup",
ABSTRACT="We present a parallel simulation protocol for performance
Petri nets \ldots",
}

@ARTICLE{Mayr91:Testing,
AUTHOR="A. von Mayrhauser",
TITLE="Testing and evolutionary development",
JOURNAL=sigsoft,
VOLUME=16,
NUMBER=4,
PAGES="31-36",
YEAR=1991,
REFERENCES=8,
KEYWORDS="Test; software; validation; regression analysis",
}

@TECHREPORT{Katz91:Modeling,
AUTHOR="I. Katz",
TITLE="Modeling and Simulation of Medium-Access-Protocols in Local Area
Networks",
INSTITUTION="Virginia Polytechnic Institute and State University",
PAGES="6-15",
YEAR=1991,
REFERENCES=5,
KEYWORDS="Modeling; simulation; access protocol; LAN; CSMA/CD",
ANNOTE="The paper focusses on two general classes of protocols: CSMA/CD
and CSMA/CA. Two variations of each class are examined, and comparisons
are made between the classes and the variants of each class.",
}

@ARTICLE{Evan91:Optimal,
AUTHOR="Steve Evans",
TITLE="Optimal bandwidth management and capacity provision in a
broadband network using virtual paths",
JOURNAL=pe,
VOLUME=13,
NUMBER=1,
PAGES="27-43",
YEAR=1991,
REFERENCES=12,
KEYWORDS="ATM; resource allocation",
ANNOTE="This article describes a mathematical model for a BISDN using
virtual paths. It looks at performance measures relating to revenue and
GOS, and gives simple asymptotic formulae for evaluating the performance
function\ldots",
}

@ARTICLE{Cunn91:Delay,
AUTHOR="G. Cunningham",
TITLE="Delay versus throughput comparisons for stabilizet slotted
{ALOHA}",
JOURNAL=ieeecom,
VOLUME=38,
NUMBER=11,
PAGES="1932-1934",
YEAR=1991,
KEYWORDS="ALOHA; performance evaluation; throughput analysis; delay
analysis",
ANNOTE="Methods to stabilize the slotted ALOHA channel are simulated to
compare delay versus throughput performance. It is shown that the best
performance is provided by methods that use deferred first transmission
and estimate the number of blocked terminals. Three such methods,
previously thought to be independent, are shown to be the same scheme
with different control parameters. It is shown that these three methods
do not differ in delay versus",
}

@ARTICLE{Bals91:Closed,
AUTHOR="Simonetta Balsamo and V. De Nitto-Persone",
TITLE="Closed queueing networks with finite capacities: blocking types,
product-form solution and performance indices",
JOURNAL=pe,
VOLUME=12,
NUMBER=2,
PAGES="85-102",
YEAR=1991,
REFERENCES=30,
KEYWORDS="Closed queueing network; blocking; finite buffer; product
form; performance evaluation",
}

@ARTICLE{Mukh91:Dual,
AUTHOR="B. Mukherjee",
TITLE="Performance of a dual-bus fiber optic network operating under a
probabilistic scheduling strategy",
JOURNAL=pe,
VOLUME=12,
NUMBER=2,
PAGES="127-139",
YEAR=1991,
REFERENCES=20,
KEYWORDS="LAN; WAN; DQDB; performance evaluation; fiber optics",
}

@ARTICLE{Glyn91:Parallel,
AUTHOR="P. W. Glynn and P. Heidelberger",
TITLE="Analysis of parallel replicated simulations under a completion
time constraint",
JOURNAL=tomacs,
VOLUME=1,
NUMBER=1,
PAGES="3-23",
YEAR=1991,
REFERENCES=39,
KEYWORDS="Distributed simulation; output analysis",
}

@ARTICLE{Nico91:Bounds,
AUTHOR="D. M. Nicol",
TITLE="Performance bounds on parallel self-initiating discrete-event
simulations",
JOURNAL=tomacs,
VOLUME=1,
NUMBER=1,
PAGES="24-50",
YEAR=1991,
REFERENCES=25,
KEYWORDS="Distributed simulation; speedup; upper bound",
}

@ARTICLE{Lin91:Study,
AUTHOR="Y. Lin and E. D. Lazowska",
TITLE="A study of time warp rollback mechanisms",
JOURNAL=tomacs,
VOLUME=1,
NUMBER=1,
PAGES="51-72",
YEAR=1991,
REFERENCES=35,
KEYWORDS="Distributed simulation; time warp; rollback",
ANNOTE={The rollback mechanisms "aggressive cancellation" and "lazy
cancellation" are studied.},
}

@TECHREPORT{Anag91:Overview,
AUTHOR="Miltos Anagnostou and E. Protonotarios",
TITLE="An overview of congestion control architecures and mechanisms for
{ATM} networks",
INSTITUTION="National Tech. University of Athens",
ADDRESS="Athens",
PAGES=11,
YEAR=1991,
REFERENCES=25,
KEYWORDS="ATM; congestion control; connection admission control; flow
control; survey",
ANNOTE="Good overview, no derivations.",
}

@ARTICLE{Bamb91:Stability,
AUTHOR="N. Bambos and J. Walrand",
TITLE="On stability and performance of parallel processing systems",
JOURNAL=jacm,
VOLUME=38,
NUMBER=2,
PAGES="429-452",
YEAR=1991,
REFERENCES=12,
KEYWORDS="Parallel computing; performance evaluation; queueing network",
ANNOTE="Very general model assumptions, G/G/1 and G/G/oo being marginal
cases.",
}

@ARTICLE{Abey91:High,
AUTHOR="Bandula W. Abeysundara and A. E. Kamal",
TITLE="High-speed local area networks and their performance: a survey",
JOURNAL=acmcs,
VOLUME=23,
NUMBER=2,
PAGES="221-264",
YEAR=1991,
REFERENCES=122,
KEYWORDS="HSLAN; survey; performance evaluation",
ANNOTE="This paper introduces LANs and discusses the performance
degradation of LANs at high speeds. It surveys recently proposed LAN
schemes designed to operate at high data rates, including their
performances characteristics.",
}

@ARTICLE{Anag91:Quality,
AUTHOR="Miltos Anagnostou and M. E. Theologou and K. M. Vlakos and et
al",
TITLE="Quality of Service Requirements in {ATM-based} {BISDNs}",
JOURNAL=comcom,
VOLUME=14,
NUMBER=4,
PAGES="197-204",
YEAR=1991,
REFERENCES=22,
KEYWORDS="ATM; BISDN; QOS; multiplexing",
}

@ARTICLE{Barr91:Switching,
AUTHOR="Peter Barri and J. A. O. Goubert",
TITLE="Implementation of a 16 to 16 Switching Element for {ATM}
Exchanges",
JOURNAL=ieeejsac,
VOLUME="SAC-9",
NUMBER=5,
PAGES="751-757",
YEAR=1991,
REFERENCES=11,
KEYWORDS="ATM; switching block; architecture; implementation; central
buffer",
}

@ARTICLE{Blon91:Finite,
AUTHOR="C. Blondia",
TITLE="Finite Capacity Vacation Models with Non-renewal Input",
JOURNAL=jap,
VOLUME=28,
NUMBER=1,
PAGES="174-197",
YEAR=1991,
REFERENCES=18,
KEYWORDS="Vacation system; performance evaluation; analysis; Markov
chain; matrix geometric method",
}

@ARTICLE{Haye91:Multicast,
AUTHOR="J. F. Hayes and R. Breault and M. Mehmet-Ali",
TITLE="Performance Analysis of a Multicast Switch",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=4,
PAGES="581-587",
YEAR=1991,
REFERENCES=12,
KEYWORDS="ATM; switching system; performance evaluation; multicast;
input buffer",
}

@ARTICLE{Ghod91:Parallel,
AUTHOR="M. Ghodsi and K. Kant",
TITLE="Performance analysis of parallel search algorithms on
multiprocessor systems",
JOURNAL=pe,
VOLUME=13,
NUMBER=1,
PAGES="67-81",
YEAR=1991,
REFERENCES=6,
KEYWORDS="Parallel computing; Markov chain; performance evaluation;
routing",
ANNOTE="The performance of a parallel path searching algorithm is
studied.",
}

@ARTICLE{Lee91:Trade,
AUTHOR="M. J. Lee and Song Li",
TITLE="Performance Trade-Offs in Input/Output Buffer Design for a
Non-Blocking Space-Division Packet Switch",
JOURNAL="International Journal of Digital and Analog Communication
Systems",
VOLUME=4,
NUMBER=1,
PAGES="21-31",
YEAR=1991,
REFERENCES=12,
KEYWORDS="ATM; switching system; input buffer; output buffer;
performance evaluation; analysis; matrix geometric method; phase-type
model",
}

@ARTICLE{Luca91:New,
AUTHOR="David M. Lucantoni",
TITLE="New Results on the Single Server Queue with a Batch Markovian
Arrival Process",
JOURNAL=comstat,
VOLUME=7,
NUMBER=1,
PAGES="1-46",
YEAR=1991,
REFERENCES=47,
KEYWORDS="Matrix geometric method; N/G/1; analysis; batch arrival;
phase-type model; MMPP/G/1; MAP/G/1",
}

@ARTICLE{Patt91:Broadband,
AUTHOR="Achille Pattavina",
TITLE="Broadband Switching Systems: First Generation",
JOURNAL=ett,
VOLUME=2,
NUMBER=1,
PAGES="75-87",
YEAR=1991,
REFERENCES=23,
KEYWORDS="ATM; switching system; architecture; performance evaluation;
anyan network; buffered Banyan network; analysis; survey",
}

@ARTICLE{Patt91:Batcher,
AUTHOR="Achille Pattavina",
TITLE="Performance Evaluation of a Batcher-Banyan Interconnection
Network with Output Pooling",
JOURNAL=ieeejsac,
VOLUME="SAC-9",
NUMBER=1,
PAGES="95-103",
YEAR=1991,
REFERENCES=15,
KEYWORDS="ATM; switching system; performance evaluation; simulation;
Batcher-Banyan; input buffer",
}

@ARTICLE{Take91:Switch,
AUTHOR="T. Takeuchi and H. Suzuki and T. Aramaki",
TITLE="Switch Architectures and Technologies for Asynchronous Transfer
Mode",
JOURNAL=ieice,
VOLUME="E74",
NUMBER=4,
PAGES="752-760",
YEAR=1991,
REFERENCES=26,
KEYWORDS="ATM; switching; architecture; survey; classification",
ANNOTE="This paper reviews various switch architectures for ATM, which
have been proposed and developed so far in Japan. The switch fabrics can
be classified, owing to the arrangement of switch matrices and buffer
memories, into four categories: input buffer, output buffer, shared
buffer and crosspoint buffer. Those switches have their own advantages
and disadvantages, which require additional to implement the switches
for the practical",
}

@ARTICLE{Lea91:Tradeoff,
AUTHOR="C. Lea and D.-J. Shyy",
TITLE="Tradeoff of horizontal decomposition versus vertical stacking in
rearrangeable nonblocking networks",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=6,
PAGES="899-904",
YEAR=1991,
REFERENCES=10,
KEYWORDS="Fault tolerance; switching network; self routing;
rearrangement; Banyan network; multistage interconnection network",
ABSTRACT="In this paper, a class of fault-tolerant switching networks is
proposed",
}

@ARTICLE{Endr91:NETMON,
AUTHOR="O. Endriss and M. Steinbrunn and M. Zitterbart",
TITLE="{NETMON-II:} a monitoring tool for distributed and multiprocessor
systems",
JOURNAL=pe,
VOLUME=12,
NUMBER=3,
PAGES="191-202",
YEAR=1991,
REFERENCES=20,
KEYWORDS="Distributed system; multiprocessor system; monitoring;
measurement; hybrid monitor",
ANNOTE="NETMON-II is a distributed monitoring system, with the special
goal of least interference with the monitored object.",
}

@ARTICLE{Heis91:Overload,
AUTHOR="H.-U. Heiss",
TITLE="Overload effects and their prevention",
JOURNAL=pe,
VOLUME=12,
NUMBER=4,
PAGES="219-235",
YEAR=1991,
REFERENCES=64,
KEYWORDS="Overload control; performance evaluation; optimization;
control theory",
ANNOTE={The so-called "thrashing effect" well known from virtual
storagehas become a common phenomenon of large systems with concurrent
processing. An control-theoretic approach is used.},
}

@ARTICLE{Levy91:Polling,
AUTHOR="H. M. Levy and L. Kleinrock",
TITLE="Polling systems with zero switch-over periods: a general method
for analyzing the expected delay",
JOURNAL=pe,
VOLUME=13,
NUMBER=2,
PAGES="97-107",
YEAR=1991,
REFERENCES=18,
KEYWORDS="Polling; delay analysis",
ANNOTE="We propose a general approach for using the results for
non-zeroswitch-over polling systems and applying them to solve the
corresponding ZSOP systems.",
}

@ARTICLE{Mura91:Analytic,
AUTHOR="M. Murata and M. Miyahara",
TITLE="An analytic solution of the waiting time distribution for the
discrete-time {GI/G/1} queue",
JOURNAL=pe,
VOLUME=13,
NUMBER=2,
PAGES="87-95",
YEAR=1991,
REFERENCES=12,
KEYWORDS="Queueing system; GI/G/1; discrete time analysis; waiting time;
distribution function; server vacation; generating function",
ANNOTE="A GI/G/1 queue in a discrete-time domain is analyzed.",
}

@ARTICLE{Haze91:Evolution,
AUTHOR="R. Ed. Hazell",
TITLE="Evolution of Alcatel Exchanges",
JOURNAL=ec,
ADDRESS="Paris",
VOLUME=65,
NUMBER=1,
PAGES="19-21",
NOTE="Special Issue Telecom 91",
YEAR=1991,
KEYWORDS="BISDN; ATM; switching system; architecture",
}

@ARTICLE{Haze91:Broadband,
AUTHOR="R. Ed. Hazell",
TITLE="Broadband Technology",
JOURNAL=ec,
ADDRESS="Paris",
VOLUME=65,
NUMBER=1,
PAGES="12-18",
NOTE="Special Issue Telecom 91",
YEAR=1991,
KEYWORDS="BISDN; ATM; architecture; switching system; CPN; customer
premises network; MAN; SMDS",
}

@ARTICLE{Li91:Trunk,
AUTHOR="Song Li",
TITLE="Performance of Trunk Grouping in Packet Switch Design",
JOURNAL=pe,
VOLUME=12,
NUMBER=4,
PAGES="207-218",
YEAR=1991,
REFERENCES=13,
KEYWORDS="Switching; packet switching; fast packet switching; ATM;
performance evaluation; analysis; input buffer; output buffer;
asymmetric load",
ABSTRACT="This paper studies the performance of trunk grouping in packet
switch system design, with emphasis on the analysis of maximum
throughput, input queue delay and packet loss rate.  The trunk grouping
technique can be implemented on both side of the switch.  In principle,
the output trunk grouping relieves traffic output contentions, while the
input trunk grouping, proposed in this paper, prevents individual input
links from overloading.  The study shows a significant advantage of both
input and output trunk groupings in removing local congestions caused by
individual links, especially in a highly non-uniform traffic
environment.  To implement trunk grouping, we suggest not to designate
the connection of each virtual circuit to individual links in high speed
network protocol design.",
URL="http://www.ece.utexas.edu/~sanqi/papers.html",
}

@ARTICLE{Mour91:Comprehensive,
AUTHOR="A. Mourad and B. Oezden and M. Malek",
TITLE="Comprehensive Testing of Multistage Interconnection Networks",
JOURNAL=ieeetc,
VOLUME=40,
NUMBER=8,
PAGES="935-951",
YEAR=1991,
REFERENCES=21,
KEYWORDS="Multistage interconnection network; Banyan network; test;
testing; fault; packet switching",
ANNOTE="We present efficient methods for testing packet-switched
multi-stage interconnection networks.  In addition to testing the data
paths and routing capabilities, we provide tests for detecting faults in
the control circuitry including the conflict resolution capab. Using a
general model of the switch, we construct testing sequences for the
internal functions of the fxf switch requiring only $O(f^2 2^f)$ tests
in the case of round robin",
}

@ARTICLE{Yang91:Nonblocking,
AUTHOR="Yi Yang and G. M. Masson",
TITLE="Nonblocking Broadcast Switching Networks",
JOURNAL=ieeetc,
VOLUME=40,
NUMBER=9,
PAGES="1005-1015",
YEAR=1991,
REFERENCES=26,
KEYWORDS="Circuit switching; multicast; switching network; nonblocking;
multistage interconnection network; path control",
}

@PHDTHESIS{Schm91:Einsatzmoeglichkeiten,
AUTHOR="L. Schmickler",
TITLE="Einsatzmöglichkeiten der Optimalstrategie {SRPT} in Lokalen
Rechnernetzen",
PUBLISHER="Aachener Hochschulschriften, Verlag der
Augustinus-Buchhandlung",
SCHOOL="RWTH Aachen",
ADDRESS="Aachen",
PAGES=192,
YEAR=1991,
LANGUAGE="German",
REFERENCES=139,
KEYWORDS="Queueing discipline; LAN; CSMA/CD; token bus; token ring;
SRPT; shortest remaining processing time; FDDI",
}

@PHDTHESIS{Nieb91:Struktur,
AUTHOR="N. Niebert",
TITLE="Struktur und Algorithmen eines Formelauswertesystems für die
Datenverkehrstheorie",
PUBLISHER="Aachener Hochschulschriften, Verlag der
Augustinus-Buchhandlung",
SCHOOL="RWTH Aachen",
ADDRESS="Aachen",
PAGES=140,
YEAR=1991,
LANGUAGE="German",
REFERENCES=88,
KEYWORDS="Queueing theory; formula manipulation; language processor",
}

@PHDTHESIS{Ding91:Korrelierte,
AUTHOR="W. Ding",
TITLE="Korrelierte Zufallsprozesse in Wartesystemen von
Kommunikationsnetzen",
PUBLISHER="Aachener Hochschulschriften, Verlag der
Augustinus-buchhandlung",
SCHOOL="RWTH Aachen",
ADDRESS="Aachen",
PAGES=116,
YEAR=1991,
LANGUAGE="German",
REFERENCES=118,
KEYWORDS="MMPP; RVG; queueing system; parameter estimation",
}

@ARTICLE{Sezg91:Fast,
AUTHOR="F. Sezgin",
TITLE="On a fast and portable uniform quasi-random number generator",
JOURNAL=sigsim,
VOLUME=21,
NUMBER=2,
PAGES="30-36",
YEAR=1991,
REFERENCES=7,
KEYWORDS="RNG; linear congruential generator",
ANNOTE="a RNG with a very large period (> 10**592) is proposed.",
}

@ARTICLE{Bern91:Methodology,
AUTHOR="F. Bernabei and Roberto Ferretti and M. Listanti and Giuseppe
Zingrillo",
TITLE="A methodology for buffer design in {ATM} switches",
JOURNAL=ett,
ADDRESS="Milan",
VOLUME=2,
NUMBER=4,
PAGES="367-379",
YEAR=1991,
REFERENCES=15,
KEYWORDS="ATM; switching block; buffer dimensioning; simulation; extreme
value theorem",
ANNOTE="Using the generalized extreme value theory, very low cell loss
probabilities are estimated from simulation runs.",
}

@ARTICLE{Cont91:Comprehensive,
AUTHOR="M. Conti and Enrico Gregori and Luniano Lenzini",
TITLE="A comprehensive analysis of {DQDB}",
JOURNAL=ett,
ADDRESS="Milan",
VOLUME=2,
NUMBER=4,
PAGES="403-413",
YEAR=1991,
REFERENCES=20,
KEYWORDS="MAN; DQDB; performance evaluation; simulation; fairness",
ANNOTE="This paper reports on an extended simulation analysis of the
asynchronous part of the DQDB MAC protocol.",
}

@ARTICLE{Balb91:ATM,
AUTHOR="G. P. Balboni and W. Chiarottino and Carlo Demichelis and R.
Melen and  others",
TITLE="An {ATM} switching testbed",
JOURNAL=ett,
ADDRESS="Milan",
VOLUME=2,
NUMBER=4,
PAGES="391-401",
YEAR=1991,
REFERENCES=12,
KEYWORDS="ATM; switching network; buffered banyan network; multistage
interconnection network",
ANNOTE="An experimental ATM switching node being developed by CSELT is
described.",
}

@INPROCEEDINGS{Schm91:Statistik,
AUTHOR="N. Schmitz",
TITLE="Statistik-Fehler, Fallen, Schwindel",
BOOKTITLE={GI/ITG-Fachtagung"Messung, Modellierung und Bewertung von
Rechensystemen},
ISBN="3-540-54550-6",
ADDRESS="Neubiberg",
PAGES="1-14",
NOTE="Informatik Fachbericht",
YEAR=1991,
LANGUAGE="German",
REFERENCES=5,
KEYWORDS="Fundamentals in statistics; correlation; random number
testing; conditional probability",
ANNOTE="Anhand von (übersimplifizierten) Beispielen wird vor Fehlern/
Fehlinterpretationen gewarnt, die in der deskriptiven Statistik
(Darstellung und Aufbereitung von Meßdaten), der stochastischen
Modellierung (wahrscheinlichkeitstheoretische Beschreibung quantitativer
Experiment) und der statistischen Inferenz (Auswertung von Meßdaten,
Bewertung von Systemen) zu falschen Resultaten führen können.",
}

@INPROCEEDINGS{Hass91:Modellierung,
AUTHOR="G. Hasslinger and E. S. Rieger",
TITLE="Modellierung offener Warteschlangennetzwerke durch
Erneuerungsprozesse im diskreten Zeitbereich",
BOOKTITLE={6. GI/ITG-Fachtagung"Messung, Modellierung und Bewertung von
Rechensystemen"},
ISBN="3-540-54550-6",
ADDRESS="Neubiberg",
PAGES="15-29",
NOTE="Informatik Fachbericht",
YEAR=1991,
LANGUAGE="German",
REFERENCES=23,
KEYWORDS="Open queueing network; approximation; decomposition; renewal
approximation; discrete time analysis",
ABSTRACT="Es wird ein Ansatz zur Berechnung der Verteilungen der
Wartezeit und der Kundenanzahl an den Stationen eines offenen Netzes mit
beliebig gegebenen Verzweigungswahrscheinlichkeiten vorgestellt. Die
Analyse erfolgt durch ein Iterationsverfahren und geht von einer
Dekomposation des Netzwerks in einzelne Knoten aus, wobei insbesondere
Einbedienerstationen (GI/G/1-Systeme) betrachtet werden.",
}

@INPROCEEDINGS{Buch91:Numerical,
AUTHOR="P. Buchholz",
TITLE="The Numerical Analysis of Hierarchical Queueing Network Models",
BOOKTITLE={6. GI/ITG-Fachtagung"Messung, Modellierung und Bewertung von
Rechensystemen"},
ISBN="3-540-54550-6",
ADDRESS="Neubiberg",
PAGES="30-45",
NOTE="Informatik Fachberichte",
YEAR=1991,
REFERENCES=18,
KEYWORDS="Hierarchical modeling; numerical method; steady state
analysis; queueing network",
ANNOTE="In this paper a class of hierarchically structured queueing
network models is considered and it is shown that the hierarchical model
structure is directly reflected in the state space and the generator
matrix of the underlying Markov process. Iterative solution techniques
can be modified to make use of the model structure, which allows the
efficient numerical analysis of large, up to now not solvable queueing
network models.",
}

@INPROCEEDINGS{Mahl91:Job,
AUTHOR="M. Mähler",
TITLE="Job Scheduling under Fairness Aspects",
BOOKTITLE={6. GI/ITG-Fachtagung"Messung, Modell. u. Bewert. v.
Rechensystemen},
ISBN="3-540-54550-6",
ADDRESS="Neubiberg",
PAGES="46-60",
NOTE="Informatik Fachberichte",
YEAR=1991,
REFERENCES=21,
KEYWORDS="Distributed computing system; performance parameter;
scheduling; load sharing; fairness",
ANNOTE="It is the goal of this paper to study how to make this second
decision (select the next job) in order to assign servers to clients in
a fair way. A general fairness criterion is introduced and applied to
different algorithms, which are tested analytically and by simulation.
Assignment by consumption dependent priorities gives the best results.",
}

@INPROCEEDINGS{Hofs91:Leistungsbewertung,
AUTHOR="H. Hofstetter",
TITLE="Leistungsbewertung von {ISDN-Vermittlungsknoten}",
BOOKTITLE={6. GI/ITG-Fachtagung"Messung, Modell. u. Bewert. v.
Rechensystemen},
ISBN="3-540-54550-6",
ADDRESS="Neubiberg",
PAGES="109-120",
NOTE="Informatik Fachberichte",
YEAR=1991,
LANGUAGE="German",
REFERENCES=9,
KEYWORDS="Performance evaluation; QOS; BISDN; ISDN; CCITT",
ANNOTE="Auch bezüglich der Leistungsbewertung des ISDN und seiner
Komponenten werden beim CCITT Konzepte und Empfehlungen erarbeitet. Der
vorliegende Beitrag gibt eine Einführung in diese Leistungskonzepte.",
}

@INPROCEEDINGS{Blon91:Cell,
AUTHOR="C. Blondia and O. Casals",
TITLE="Cell Loss Probabilities in a Statistical Multiplexer in an {ATM}
Network",
BOOKTITLE={6. GI/ITG-Fachtagung"Messung, Modellierung und Bewertung von
Rechensystemen"},
ISBN="3-540-54550-6",
ADDRESS="Neubiberg",
PAGES="121-136",
NOTE="Informatik Fachberichte",
YEAR=1991,
REFERENCES=14,
KEYWORDS="ATM; statistical multiplexing; loss probability; QOS",
ABSTRACT="In this paper we evaluate the loss probability of cells
generated by a burst/silence source which is mixed with a superposition
of $M$ independent identical burst/silence traffic streams in a
statistical multiplexer with a finite buffer capacity. The impact of the
buffer size of the multiplexer, the burst length of sources and the load
of the system on this conditional loss probability is studied.",
}

@INPROCEEDINGS{Nieb91:Strukturelemente,
AUTHOR="N. Niebert",
TITLE="Strukturelemente eines Systems zur Auswertung analytischer
Formeln in der Datenverkehrstheorie",
BOOKTITLE={6. GI/ITG-Fachtagung"Messung, Modellierung und Bewertung von
Rechensystemen},
ISBN="3-540-54550-6",
ADDRESS="Neubiberg",
PAGES="137-151",
NOTE="Informatik Fachberichte",
YEAR=1991,
LANGUAGE="German",
REFERENCES=15,
KEYWORDS="Analytical model; performance evaluation; symbolic algebraic
computation; numerical evaluation; computer arithmetic; object-oriented
programming; distributed computing system",
ANNOTE="Analytische Modelle zur Berechnung von Leistungsgrößen in
Kommunikations- oder Rechnersystemen, die auf den mathematischen
Methoden der Datenverkehrstheorie basieren, stellen eine schnelle und
allgemeine Möglichkeit zur Auswertung dar. Um einen einfachen Einsatz
der oft komplexen Formeln zu ermöglichen, bedarf es eines Systems zur
Unterstützung der numerischen Formelauswertung, grafischen
Ergebnisdarstellung und Archivierung.",
}

@INPROCEEDINGS{Hoff91:Leistungsbewertung,
AUTHOR="S. Hoff and D. Hübner and F. Reichert and A. Scunio",
TITLE="Leistungsbewertung von Verfahren der Mobil-Kommunikation:
Dezentrale Paketsynchronisation und Kanalzugriff",
BOOKTITLE={6. GI/ITG-Fachtagung"Messung, Modellierung und Bewertung von
Rechensystemen},
ISBN="3-540-54550-6",
ADDRESS="Neubiberg",
PAGES="152-166",
NOTE="Informatik Fachberichte",
YEAR=1991,
LANGUAGE="German",
REFERENCES=13,
KEYWORDS="Mobile radio; synchronization; decentralized control; channel
assignment; channel simulation",
ANNOTE="Neue Anwendungen im Bereich der mobilen Datenfunknetze mit
strengen Anforderungen z.B. an Echtzeitverhalten erfordern neuartige
Verfahren des Datenaustausches. Hierzu entwickelte Protokolle für solche
Anwendungsgebieete werden in Werkzeug zur Simulation dieser Verfahren
wird vorgestellt.",
}

@INPROCEEDINGS{Bras91:Quittierungsverfahren,
AUTHOR="V. Brass",
TITLE="Ein Quittierungsverfahren für Multi-Hop Paketfunknetze",
BOOKTITLE={6. GI/ITG-Fachtagung"Messung, Modellierung und Bewertung von
Rechensystemen},
ISBN="3-540-54550-6",
ADDRESS="Neubiberg",
PAGES="167-181",
NOTE="Informatik Fachberichte",
YEAR=1991,
LANGUAGE="German",
REFERENCES=8,
KEYWORDS="Multihop; slotted ALOHA; multipoint; point-to-multipoint
communication; acknowledgement; performance evaluation; analysis;
simulation",
ANNOTE="In diesem Beitrag wird ein Mehrfach-Quittierungsverfahren
vorgestellt, daß sich für Punkt-zu-Punkt und Punkt-zu-Mehrpunkt
Kommunikation in Multi-hop Paketfunknetzen eignet. Das Verfahren wird in
guter Näherung analytisch bewertet, und die Ergebnisse simulative
validiert. Die hier vorliegenden Berechnungen gelten für das S-ALOHA
Protokoll.",
}

@INPROCEEDINGS{Gott91:Verteilung,
AUTHOR="K. Gotthardt",
TITLE="Verteilung der Anzahl Hops einer Quelle-Ziel-Übertragung im
Multihop-Paketfunknetz",
BOOKTITLE={6. GI/ITG-Fachtagung"Messung, Modellierung und Bewertung von
Rechensystemen"},
ISBN="3-540-54550-6",
ADDRESS="Neubiberg",
PAGES="182-195",
NOTE="Informatik Fachberichte",
YEAR=1991,
LANGUAGE="German",
REFERENCES=7,
KEYWORDS="Multihop; access protocol; modeling; performance evaluation",
ANNOTE="Die Verteilung der Zahl benötiger Hops für eine
Quelle-Ziel-Übertragung eines Paketes in einem Multihop-Funknets ist
unerläßlich um interessierende Leistungsgrößen wie Quelle-Ziel-Durchsatz
und Verzoegerung zu berechnen. In diesem Beitrag wird diese Verteilung
für ein Netz mit mobilen Stationen bestimmt, wobei angenommen wird, daß
die Zahl der Stationen in einem Flächenelement einer Poissonverteilung
genügt.",
}

@INPROCEEDINGS{Weic91:Benchmarking,
AUTHOR="Reinhold Weicker",
TITLE="Benchmarking: Status, Kritik und Aussichten",
BOOKTITLE="6. GI/ITG-Fachtagung ``Messung, Modellierung und Bewertung
von Rechensystemen''",
ISBN="3-540-54550-6",
ADDRESS="Neubiberg",
PAGES="259-277",
NOTE="Informatik Fachberichte",
YEAR=1991,
LANGUAGE="German",
REFERENCES=20,
KEYWORDS="Benchmark; performance measurement; LINPACK",
ANNOTE="Zunächst werden heute uebliche Industrie-Standards im
Benchmarking kurz charakterisiert (MIPS, MFLOPS, Whetstone, Chrystone,
Linpack). Dann werden neue Initiativen von Herstellern oder Anwendern
besprochen, die sich um die Zusammenstellung von größeren,
repräsentativen Programmen als Benchmarks bemühen (SPEC, TPC, Perfect,
u.a.).",
}

@INPROCEEDINGS{Borc91:Datenkommunikations,
AUTHOR="M. Borchert and M. Angela Sasse",
TITLE="Datenkommunikations-Benchmark {LAMBDA}",
BOOKTITLE={6. GI/ITG-Fachtagung"Messung, Modellierung und Bewertung von
Rechensystemen"},
ISBN="3-540-54550-6",
ADDRESS="Neubiberg",
PAGES="278-291",
NOTE="Informatik Fachberichte",
YEAR=1991,
LANGUAGE="German",
REFERENCES=9,
KEYWORDS="Communication network; performance measurement; performance
measure; benchmark; traffic generator",
ANNOTE="DIN 66273; In diesem Beitrag wird ein neuartiger
Datenkommunikations-Benchmark vorgestellt (LAMBDA-Benchmark).",
}

@ARTICLE{Acam91:Metropolitan,
AUTHOR="A. S. Acampora and Tom Chu and C. Dragone and M. Gans",
TITLE="A Metropolitan Area Radio System Using Scanning Pencil Beams",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=1,
PAGES="141-151",
YEAR=1991,
KEYWORDS="Radio channel; TDMA; time division multiple access",
ANNOTE="A new metropolitan area radio system is proposed which provides
continuous 360\`e coverage over a large service region from a centrally
located base station. This new approach differs from others in that the
base station blankets the service region witha raster of very narrow
pencil beams which can be rapidly scanned to any position in synchronism
with the switching sequences of a Time-Division-Multiple-Access
assignment.",
}

@ARTICLE{Berg91:Comparison,
AUTHOR="Arthur W. Berger",
TITLE="Comparison of Call Gapping and Percent Blocking for Overload
control in Distributed Switching Systems and Telecommunications
networks",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=4,
PAGES="574-580",
YEAR=1991,
KEYWORDS="Communication system; distributed system; overload control;
robustness",
ANNOTE="Two overload control techniques are compared, prevent blocking
and call gapping, which have been used in distributed switching systems
and in telecommunications networks. The comparison is based on nine
criteria, seven of which concern robustness. The results are useful in
the design of practical, effective overload controls.",
}

@ARTICLE{Chla91:Wave,
AUTHOR="I. Chlamtac and O. Weinstein",
TITLE="The Wave Expansion Approach to Broadcasting in Multihop Radio
Networks",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=3,
PAGES="426-433",
YEAR=1991,
KEYWORDS="Packet radio; multihop; radio channel; broadcast",
ANNOTE="In this paper we propose an algorithm for efficient
communication between neighbours in multihop radio networks.
Thealgorithm guarantees a bound on the transmission efficiency in aradio
channel for arbitrary topology. The algorithm can be embedded in
protocols for solving basic network problems such asbroadcast,
multicast, leader election, or finding shortest paths",
}

@ARTICLE{Cho91:Window,
AUTHOR="Yong Soo Cho and Chong Kwan Un",
TITLE="Window Flow Control with Error-Checking Scheme in
Quasi-Cut-Through Switching Network with Noisy Channels",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=3,
PAGES="394-397",
YEAR=1991,
KEYWORDS="Flow control; acknowledgement; fast packet switching; window
mechanism; error handling",
ABSTRACT="We investigate two acknowledgement schemes for window flow
contrfull and partial ACK schemes, in conjunction with two
error-checking schemes at every node or at the store-and-forward
nodesonly in a quasi-cut-through switching network with noisy channelWe
study their various properties including throughput, delay, and the
combined delay-throughput performance, and show that theproposed ACK
schemes provide efficiently delay .",
}

@ARTICLE{Glis91:Carrier,
AUTHOR="S. G. Glisic",
TITLE="1-Persistent Carrier Sense Multiple Access in Radio Channels with
Imperfect Carrier Sensing",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=3,
PAGES="458-464",
YEAR=1991,
KEYWORDS="CSMA; carrier sense multiple access; radio channel;
performance evaluation",
ANNOTE="A comprehensive analysis of 1-persistent CSMA system using
radiochannel with imperfect carrier sensing is presented and
discussed.Two main results of the analysis are a) the optimum value of
the channel state detector is determined and b) it was shown how much
the system performance is degraded due to imperfect carrier sensing.
Simulation check points confirmed thetheoretical analysis.",
}

@ARTICLE{Kall91:Sequential,
AUTHOR="Samir Kallel and David Haccoun",
TITLE="Sequential Decoding with an Efficient Partial Retransmission
{ARQ} Strategy",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=2,
PAGES="208-213",
YEAR=1991,
KEYWORDS="ARQ; coding theory; throughput analysis",
ANNOTE="In this paper, we present and analyze an efficient partial
retransmission ARQ strategy using convolutional coding and sequential
decoding, in conjunction with code combining. In the proposed ARQ
scheme, whenever a packet of data needs to be retransmitted, that packet
is not repeated entirely as in the case of conventional full
retransmission ARQ strategies.",
}

@ARTICLE{Kers91:Mentor,
AUTHOR="A. Kershenbaum and Parviz Kermani and G. A. Grover",
TITLE="Mentor: An Algorithm for Mesh Network Topological Optimization
and Routing",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=4,
PAGES="503-513",
YEAR=1991,
KEYWORDS="Communication network; cost function; optimization; routing",
ANNOTE="We consider the problem of obtaining a minimum cost topology
fora mesh network given matrices specifying the cost of links between
all pairs of nodes and the internode requirements. We present a
heuristic algorithm which works in terms of general network design
principles and uses utilization as a figure of merit.",
}

@ARTICLE{Mitr91:Comparative,
AUTHOR="D. Mitra and J. B. Seery",
TITLE="Comparative Evaluations of Randomized and Dynamic Routing
Strategies for Circuit-Switched Networks",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=1,
PAGES="102-116",
YEAR=1991,
KEYWORDS="Alternate routing; dynamic routing; circuit switching;
simulation model",
ANNOTE="The theory and practice of circuit switching on networks has
recently been rapidly evolving. We investigate two fundamentallyseparate
classes of routing algorithms-randomized and deterministic. The main
randomized algorithm is Gibben's and Kelly's recently introduced Dynamic
Alternate Routing. In the contrasting deterministic algorithm, attempts
to carry a call are made in a specific precomputed order.",
}

@ARTICLE{Mitt91:Note,
AUTHOR="K. K. Mittal and A. N. Venetsanopoulos",
TITLE="A Note Optimal Input Control Policy for an {ALOHA} Access
Scheme",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=2,
PAGES="197-199",
YEAR=1991,
KEYWORDS="ALOHA; controlled access; multiple access; simulation",
ANNOTE="Input control policies had been proposed to improve the delay -
throughput performance of ALOHA access schemes. Through simulation
results, it was observed that the optimal control policies were in
general of control limit type. This paper discusses input control
policies for one such ALOHA access scheme and proves analytically that
the optimal policy is indeedof control limit type.",
}

@ARTICLE{Mizu91:Burst,
AUTHOR="T. Mizuike and Y. Ito and D. Kennedy and L. Nguyen",
TITLE="Burst Scheduling Algorithms for {SS/TDMA} Systems",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=4,
PAGES="533-539",
YEAR=1991,
KEYWORDS="Communication system; TDMA; time division multiple access",
ANNOTE="This paper proposes efficient algorithms to generate a detailed
operation plan for SS/TDMA systems. A burst time plan generationproblem
is first analyzed and two algorithms are presented for burst
scheduling.The first method is an algorithm based upon binpacking
problem. The other algorithm schedules new bursts while reassigning
already scheduled bursts by using single machine scheduling model.",
}

@ARTICLE{Wang91:Combined,
AUTHOR="Xin Wang and Jaidev Kaniyil and Y. Onozato and Jia Liu and 
others",
TITLE="Performance Analysis of a Combined Random-Reservation Access
Scheme",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=4,
PAGES="478-481",
YEAR=1991,
KEYWORDS="Access protocol; reservation system; stability; throughput
analysis",
ANNOTE="Stability and throughput are investigated for a combined
random-reservation access scheme employed in a satellite-based very
small aperture terminal packet communication network. The analysis is
based on the use of catastrophe theory by which the system behaviour is
characterized by the cusp catastrophe. A stable region is given in terms
of system.",
}

@ARTICLE{Yu91:Buffered,
AUTHOR="H. C. Yu and R. L. Hamilton",
TITLE="A Buffered Two-Node Packet Radio Network with Product Form
Solution",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=1,
PAGES="62-75",
YEAR=1991,
KEYWORDS="Packet radio; ALOHA; performance evaluation",
ANNOTE="We consider a packet radio network with two nodes; both nodes
access a single radio channel the slotted-ALOHA protocol. This model
results in a network of two interfering queues. Network ofinterfering
queues seldom have closed-form expressions for the equilibrium
probabilities. However, when certain constraints are placed on the
network parameters, the network will have a product form solution for
the equilibrium probabilities.",
}

@INPROCEEDINGS{Denz91:ATM,
AUTHOR="W. Denzel",
TITLE="{ATM} switching network architectures",
BOOKTITLE="ITG/GI Workshop Verbindungsnetzwerke für Parallelrechner und
Breitband-übermittlungssysteme",
ADDRESS="Stuttgart",
PAGES="9-16",
YEAR=1991,
REFERENCES=32,
KEYWORDS="ATM; switching network; buffer management; input buffer;
survey; output buffer",
ANNOTE="This paper gives an overview of advanced packet switch
architectures. Performance aspects are discussed.",
}

@INPROCEEDINGS{Lang91:Konzept,
AUTHOR="K.-D. Langer",
TITLE="Konzept eines Koppelelements für die hochratige
{ATM-Vermittlung}",
BOOKTITLE="ITG/GI Workshop Verbindungsnetzwerke für Parallelrechner und
Breitband-übermittlungssysteme",
ADDRESS="Stuttgart",
PAGES="42-47",
YEAR=1991,
LANGUAGE="German",
REFERENCES=14,
KEYWORDS="ATM; switching block; input buffer; performance evaluation",
ANNOTE="Eingangspufferung mit Pufferzugriffstiefe",
}

@INPROCEEDINGS{Thei91:Wegesuchstrategien,
AUTHOR="T. H. Theimer",
TITLE="Wegesuchstrategien für {ATM-Koppelnetze} und deren
Leistungsfähigkeit",
BOOKTITLE="ITG/GI Workshop Verbindungsnetzwerke für Parallelrechner und
Breitband-übermittlungssysteme",
ADDRESS="Stuttgart",
PAGES="82-88",
YEAR=1991,
LANGUAGE="German",
REFERENCES=16,
KEYWORDS="ATM; switching network; routing; performance evaluation",
ANNOTE="Leistungsvergleich verschiedener Wegesuchverfahren und
Koppelnetzstrukturen.",
}

@ARTICLE{Stas91:Computationally,
AUTHOR="G. I. Stassinopoulos and M. G. Kazantzakis",
TITLE="A computationally efficient iterative solution of the
multidestination optimal dynamic routing problem",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=9,
PAGES="1370-1378",
YEAR=1991,
REFERENCES=14,
KEYWORDS="Dynamic routing; efficient computer algorithm; iterative
method",
ANNOTE="The dynamic routing problem for multiple destination networks is
considered.",
}

@ARTICLE{Shyy91:Log2,
AUTHOR="D.-J. Shyy and C. Lea",
TITLE="Log2(N, m, p) strictly nonblocking networks",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=10,
PAGES="1502-1510",
YEAR=1991,
REFERENCES=10,
KEYWORDS="Switching network; nonblocking; self routing; fault
tolerance",
ANNOTE="A new class of self-routing strictly nonblocking switching
networks, called Log2(N, m, p) network is introduced.",
}

@ARTICLE{Ng91:Improving,
AUTHOR="S. Ng",
TITLE="Improving disk performance via latency reduction",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=1,
PAGES="22-30",
YEAR=1991,
REFERENCES=20,
KEYWORDS="Computer system; disk; performance evaluation",
ANNOTE="This paper demonstrates that a reduction in the rotational
latency and RPS miss delay (both of which are related to the rotation of
the disk drives) has the greatest impact in reducing the disk's basic
service time",
}

@INPROCEEDINGS{Boll91:Two,
AUTHOR="R. Bolla and F. Davoli",
TITLE="A two-layer optimization structure for access control and
bandwidth sharing in high-speed integrated networks",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=1,
PAGES="177-188",
YEAR=1991,
REFERENCES=7,
KEYWORDS="TDM; time division multiplex; broadband; traffic mix;
bandwidth allocation; packet switching; circuit switching",
ANNOTE="The access to a multiservice broad-band synchronous TDM network
is considered, where hybrid frames are used to carry two basic traffic
types (a circuit-switched isochronous and a packet-switched asynchronous
one), generated by several users. Each user is assigned a portion of the
total available bandwidth, in terms of slots/frame, which is dynamically
allocated between the two traffic types at the user premises",
}

@ARTICLE{Brun91:Exact,
AUTHOR="H. Bruneel",
TITLE="Exact Derivation of Transient Behaviour for Buffers with Random
output Interruptions",
JOURNAL=cnis,
VOLUME=22,
NUMBER=4,
PAGES="277-285",
YEAR=1991,
REFERENCES=21,
KEYWORDS="Queueing system; discrete time queue; transient analysis;
interrupted service; server vacation",
}

@INPROCEEDINGS{Burs91:Priority,
AUTHOR="D. Bursztynowski and W. Burakowski and W. Syski",
TITLE="On priority assignment problems in {SPC} systems",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=2,
PAGES="219-227",
YEAR=1991,
REFERENCES=14,
KEYWORDS="SPC; traffic model; M/G/1; priority; response time; Poisson
distribution; cost function; central server",
ANNOTE="The paper addresses some performance-oriented design problems in
a class of SPC systems with central control modeled by an M/G/1 system
with priorities and feedback, especially performance optimization by
task prioritizing. Two different types of objectives are identified:
capazity-oriented and average response time-oriented ones. Also, the
problem of dependence of the optimal character of the solutions on call
mix changes is discussed.",
}

@INPROCEEDINGS{Chle91:Off,
AUTHOR="E. Chlebus",
TITLE="Off-line verus on-line network management - Implementation and
performance study of circuit-switched traffic control methods",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=3,
PAGES="38-53",
YEAR=1991,
REFERENCES=25,
KEYWORDS="Routing; network management; dynamic routing; static routing;
random routing; control theory",
ANNOTE="The paper presents a comparative study of various traffic
routing strategies aiming at overall network blocking minimization.
Circuit-switched traffic is modelled by means of static and dynamic
flows as well as Markov decision processes. The corresponding
optimization problems are formulated and solved by methods of control
theory.",
}

@INPROCEEDINGS{Cott91:Adaptive,
AUTHOR="M. Cotton and L. G. Mason",
TITLE="Adaptive isarithmic flow control in fast packet switching
networks - Heavy traffic case",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=2,
PAGES="114-125",
YEAR=1991,
REFERENCES=15,
KEYWORDS="Flow control; fast packet switching; heavy traffic
approximation; propagation delay",
ANNOTE="The centralized adaptive isarithmic flow control scheme is
considered, proposed by Mason and Gu, in the context of fast packet
switching networks. The high transmission rates involved in such
networks make it necessary to specifically consider propagation
delays.",
}

@ARTICLE{Cour91:Minimization,
AUTHOR="P.-J. Courtois and G. Scheys",
TITLE="Minimization of the Total Loss Rate for Two Finite Queues in
series",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=11,
PAGES="1651-1661",
YEAR=1991,
REFERENCES=11,
KEYWORDS="M/Ek/1; delay loss model; tandem queue; loss probability;
optimization; performance evaluation; analysis",
}

@INPROCEEDINGS{Dutk91:Connection,
AUTHOR="E. Dutkiewicz and G. J. Anido",
TITLE="Connection admission control in {ATM} networks",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=1,
PAGES="166-176",
YEAR=1991,
REFERENCES=16,
KEYWORDS="ATM; network management; network control system; MMPP;
resource management; traffic control; virtual path; virtual network;
virtual channel",
ANNOTE="A three level management architecture forms a basis for managing
and controlling network resources in ATM networks. It utilises the
concepts of virtual channels, virtual paths, and virtual networks. Call
admission model using a 2-state Markov modulated Poisson process
approximation for traffic streams is studied in order to obtain simple
approximation algorithms.",
}

@INPROCEEDINGS{Dzio91:Buffer,
AUTHOR="Z. Dziong and K. Liao and L. G. Mason",
TITLE="Buffer dimensioning and effective bandwidth allocation in {ATM}
based networks with priorities",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=1,
PAGES="154-165",
YEAR=1991,
REFERENCES=11,
KEYWORDS="Buffer dimensioning; ATM; priority; bandwidth allocation;
FIFO; blocking; delay time; multiplexer; nonpreemptive priority; GOS",
ANNOTE="An ATM multiplexer with several FIFO buffers is considered
operating in non preemptive priority regime. It is assumed that each
connection or type of traffic is allocated to one priority characterized
by its grade of service constraints. A model for buffer dimensioning and
effective bandwidth allocation is derived. It consists of one
independent multiplexer for each priority.",
}

@INPROCEEDINGS{Econ91:Title,
AUTHOR="D. Economou and P. Taylor",
TITLE="Title unknown",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=1,
PAGES="220-231",
YEAR=1991,
REFERENCES=11,
KEYWORDS="Cyclic service; processor sharing; buffer; DQDB; packet
length",
ANNOTE="The problem of determining the distribution of segmentation and
reassembly buffer occupancy in a discrete time cyclic queue with
variable length packets. Exact expressions for these distributions are
obtained for a continous time, processor sharing approximation. The
predicted proportion of lost segments is compared with simulation
results.",
}

@INPROCEEDINGS{Ehri91:H2,
AUTHOR="I. Ehriel",
TITLE="Performance analysis of the {H2/G/1} system",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=1,
PAGES="238-244",
YEAR=1991,
REFERENCES=5,
KEYWORDS="Hyperexponential; waiting time; model; arrival process;
signalling; D-channel; signalling protocol; CSMA/CD; LAPD; X.25;
H2/G/1",
ANNOTE="New user-network interface which is recommended by CCITT has
definite peculiarity. The main attention should be turn upon model
selection for the signalling channel. The suggested model has a
hyperexponential distribution for the incoming demand flow and general
distribution for service time. By the analysing of this queueing system
an approach for the mean waiting time is offered.",
}

@INPROCEEDINGS{Fili91:Model,
AUTHOR="J. Filipiak",
TITLE="A model of a flexible User/Network Interface for {BISDN}",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=2,
PAGES="1-26",
YEAR=1991,
REFERENCES=5,
KEYWORDS="BISDN; UNI; user network interface; open network;
IN=intelligent network; communication network; OSI; signalling
protocol",
ANNOTE="A new model of the user-network interface in a broadband ISDN is
presented, called Flexible User Network Interface (F-UNI). It is
developed to encompass new features of ATM, ISDN, Open Network
Architecture, IN and Personal Communication Network. It is an
abstraction of existing interfaces.",
}

@INPROCEEDINGS{Ghas91:Study,
AUTHOR="M. Ghassemi and R. A. Skoog",
TITLE="Study of message delays in the presence of long messages and
correlated arrivals in Signalling System No. 7 networks",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=3,
PAGES="121-130",
YEAR=1991,
REFERENCES=2,
KEYWORDS="Signalling protocol; correlation; arrival process; message
traffic; delay time; traffic control; controlled load",
ANNOTE="Introduction of long MSU traffic, even in limited amounts,
deteriorates the network delay performance radically. Various options
have been examined for reducing the impact of carrying long MSUs on SS
No. 7 networks.",
}

@INPROCEEDINGS{Gira91:Routing,
AUTHOR="Andre Girard and B. Liau and N. Boumzebra",
TITLE="Routing Optimization and Dimensioning of Networks with Revenues:
Numerical Results",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=2,
PAGES="153-164",
YEAR=1991,
REFERENCES=11,
KEYWORDS="Routing algorithm; alternate routing; hierarchical network;
load sharing; adaptive routing",
ANNOTE="A numerical solution procedure is presented that is in many ways
similar to the classical ECCS dimensioning method commonly used for
hierarchical networks. First numerical results are shown.",
}

@INPROCEEDINGS{Hend91:New,
AUTHOR="W. Henderson",
TITLE="A Survey of, and Some New Results on, Stochastic Petri Nets",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=2,
PAGES="138-152",
YEAR=1991,
REFERENCES=55,
KEYWORDS="Petri net; SPN; stochastic Petri net; communication model;
communication protocol",
ANNOTE="This paper is an introduction to the modelling tool of Petri
nets (PNs) but concentrates mostly on its performance counterpart,
stochastic Petri nets (SPNs). It is a short and personal survey with the
majority of the paper dedicated to recent research from the Teletraffic
Research Centre of Adelaide University.",
}

@INPROCEEDINGS{Herb91:Buffer,
AUTHOR="G. Herbuterne and C. Rosenberg",
TITLE="Buffer sizing in Bulk Service Systems",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=1,
PAGES="232-237",
YEAR=1991,
REFERENCES=7,
KEYWORDS="Bulk service; hybrid; M/GI/1; M/G/1; cyclic service; ATM;
Markov chain",
ANNOTE="The paper addresses the problem of buffer sizing for queues with
bulk service. The model arises in the context of the study of a hybrid
frame where synchronous cells are first served and ATM cells are given
access to the remaining slots. Loss probabilities are derived by means
of simple conservation arguments from the state probabilities at
departure epochs obtained through classical Markov chain analysis.",
}

@INPROCEEDINGS{Kwia91:Multi,
AUTHOR="M. Kwiatkowski",
TITLE="Performance Analysis of multi-layer token ring local area
networks",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=2,
PAGES="126-137",
YEAR=1991,
REFERENCES=14,
KEYWORDS="Token ring; LAN; OSI; window mechanism; decomposition; media
access control; logical link control",
ANNOTE="A queueing network performance model is considered of a token
ring LAN in which multi-layer OSI architecture is used. Several
performance submodels are developed for each layer working in isolation.
Statistical independance and Poisson character of exogenous streams of
messages arriving in layer are usually assumed in these submodels.",
}

@INPROCEEDINGS{Lebo91:General,
AUTHOR="M. Lebourges",
TITLE="A general purpose model for circuit-switched networks",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=3,
PAGES="95-106",
YEAR=1991,
REFERENCES=9,
KEYWORDS="Model; blocking; stream traffic; overflow; peakedness;
adaptive routing",
ANNOTE="The general purpose circuit-switched networks model integrates
known models for particular systems or phenomena, e.g. multi-services
traffics, repeated attempts, exchange blockings, adaptive routing, in a
single network model. The aim is not to have a precise modelling of each
system, but to get correct qualitative behaviour and quantitative
averages at the network level.",
}

@INPROCEEDINGS{Mari91:Hybrid,
AUTHOR="M. I. Marie and M. S. Moustafa",
TITLE="Performance of hybrid switching networks with priority: Fixed
boundary case",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=2,
PAGES="256-264",
YEAR=1991,
REFERENCES=5,
KEYWORDS="Hybrid switching; switching network; circuit switching;
voice/data integration; packet switching; waiting time",
ANNOTE="This paper deals with the performance of hybrid switching
networks. The frame length is divided into two fixed portions one for
the voice traffic (circuit switched) and the other for data traffic
(packet switched); i.e., fixed boundary. Voice traffic is treated as a
loss system. Exact analytical expressions for the expected waiting time
for data packets of multiple classes of different priorities are
given.",
}

@INPROCEEDINGS{Mart91:Packet,
AUTHOR="F. E. Martin and E. Granel",
TITLE="Packet network structures based on multilink interfaces",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=2,
PAGES="91-102",
YEAR=1991,
REFERENCES=8,
KEYWORDS="Interface; arrival process; data network; packet switching;
hyperexponential; H2/M/N",
ANNOTE="The paper presents a qualitative performance analysis of
multilink interfaces in data packet networks by comparing with other
systems based on several single links. Both alternatives are useful for
increasing throughput capacity without changing the bitrate.",
}

@INPROCEEDINGS{Mizu91:Experiences,
AUTHOR="J. Mizusawa and M. Akiyama",
TITLE="Experiences and Expectations of Introducing {PSTN} New Services
in {JAPAN}",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=3,
PAGES="13-24",
YEAR=1991,
REFERENCES=3,
KEYWORDS="Public network; network planning; X.25; X.21; X.28; X.29;
ISDN; traffic analysis; network design",
ANNOTE="New network design is classified into three categories, New
public network construction, Access network construction and Adding new
service function. The examples are DDX packet network, DDX Telephone to
Packet access service and Freedial service. ISDN network design concepts
are explained, together with the present traffic characteristics. The
direction of PSTN design concept is indicated in terms of VIPA
(virtually integrated public access).",
}

@INPROCEEDINGS{Mous91:Hybrid,
AUTHOR="M. S. Moustafa and M. I. Marie",
TITLE="Performance of hybrid switching networks with priority: Movable
boundary case",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=2,
PAGES="194-206",
YEAR=1991,
REFERENCES=5,
KEYWORDS="Hybrid switching; voice/data integration; nonpreemptive
priority; priority",
ANNOTE="This paper deals with performance of hybrid switching networks.
To achieve a better transmission utilization than the fixed boundary
case, data are allowed to use any residual voice capacity available;
i.e., movable boundary case. The voice traffic is treated as a loss
system, while data traffic is considered as multiple classes of
different priorities. Comparison with nonpriority case and fixed
boundary with nonpreemptive priority case is givn",
}

@INPROCEEDINGS{Onoz91:Behaviour,
AUTHOR="Y. Onozato and Jaidev Kaniyil and S. Noguchi",
TITLE="Behaviour characterization of alternate routing in a
non-hierarchical homogeneous network",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=3,
PAGES="141-153",
YEAR=1991,
REFERENCES=13,
KEYWORDS="Alternate routing; homogeneous network; stability;
nonhierarchical network; congestion; blocking",
ANNOTE="A model of non-hierarchical alternate routing scheme in a
homogeneous fully connected network is formulated. The state variable of
the system is considered to be the blocking prob. From the dynamic flow
consideration principles, a Liapunov function which dictates the
dynamics of a perturbed system is found out. The results of catastrophe
theory can be applied on the model to estimate the value of control
parameter exceeding which congestion spr",
}

@INPROCEEDINGS{Pior91:Telecom,
AUTHOR="M. Pioro and M. de Miguel and I. Pita",
TITLE="Telecom networks evolution towards secure dynamic structures
Routing Aspects of the Network Digitization",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=3,
PAGES="1-12",
YEAR=1991,
REFERENCES=12,
KEYWORDS="Dynamic routing; alternate routing; network management;
digital network; random routing",
ANNOTE="A natural scenario for the digitization of PSTN leads to a
two-level network structure. The digital upper transit level will
provide an excellent environment for some kind of dynamic routing. In
the paper a way of introducing dynamic routing to such transit networks
is discussed in order to achieve efficiency in traffic routing at
minimum cost.",
}

@INPROCEEDINGS{Pope91:Alternative,
AUTHOR="A. Popescu and R. Singh",
TITLE="An Alternative Solution to the Electro-Optic and Service
Bottleneck Problems in Multi Gbit/s {LANs:} the {SUPERLAN}
Architecture",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=2,
PAGES="27-37",
YEAR=1991,
REFERENCES=18,
KEYWORDS="Bottleneck; WDM; wavelength division multiplex; access
control; access protocol",
ANNOTE="The two main bottleneck problems in the design of integrated
multi Gbit/s LANs are examined; the electro-optic and the service
bottleneck problem. A novel archtitectural solution is proposed that
makes use of the WDM-principle. It is based on a multiclass network
model in which the total traffic on the fiber is separated into two
classes - isochronous and nonisochronous - each carried on a separate
wavelength at multi Gbit/s rates.",
}

@INPROCEEDINGS{Rich91:Rapid,
AUTHOR="Philip Richards",
TITLE="Rapid Service Delivery and Customization in a Developing Network
Infrastructure",
BOOKTITLE="ITC Specialists Seminar, Telecommunication services for
developing economies",
ADDRESS="Cracow",
VOLUME=1,
PAGES="12-23",
YEAR=1991,
REFERENCES=6,
KEYWORDS="IN; intelligent network; CCITT; standardization",
ANNOTE="This paper examines the role of the IN in the modernization of a
developing network infrastructure to provide advanced services. An
overview of the IN capability Set 1 is given as currently being defined
in SG XI of CCITT.",
}

@INPROCEEDINGS{Roos91:Optimization,
AUTHOR="A. H. Roosma",
TITLE="Optimization of {ATM} multi-service-networks - some early
investigations",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=1,
PAGES="118-129",
YEAR=1991,
REFERENCES=29,
KEYWORDS="ATM; network planning; network design; model; optimization",
ANNOTE="The paper explores the optimal dimensioning of future ATM
multiservice networks. It investigates the important characteristics of
these networks, as far as they are already standardized. Existing models
for optimization of circuit-switched networks are analysed. Some
indications are given to adapt such models to deal with the specific
characteristics of ATM networks.",
}

@INPROCEEDINGS{Rose91:Models,
AUTHOR="C. Rosenberg and A. Le Bon",
TITLE="Performance Models for Hybrid Broadband Networks",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=1,
PAGES="208-219",
YEAR=1991,
REFERENCES=8,
KEYWORDS="Broadband; network; hybrid switching; BISDN; ATM;
decomposition; voice/data integration",
ANNOTE="A model is presented for the performance analysis of hybrid
broadband networks in which multi-rate circuit switched traffic as well
as fast packet switched data traffic compete for the use of $N$ slots or
channels. The novelty is that the authors allow for several classes of
circuit switched traffic based on the number of channels required as
well as obtain approximations based on temporal decompositions due to
the different time scales present.",
}

@INPROCEEDINGS{Ryde91:Overload,
AUTHOR="T. Ryden and G. Lindgren",
TITLE="Overload control of {SPC} switches using optimal alarming",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=2,
PAGES="231-239",
YEAR=1991,
REFERENCES=5,
KEYWORDS="Overload control; SPC; central server; FIFO; queueing network;
arrival process; Markov chain; optimal control",
ANNOTE="In 1980 a theory was developed how to construct optimal alarms
for unwanted events in stochastic processes. This paper describes how
this theory can be used to derive load regulators for SPC-switches. The
new regulators are calculated to optimize the sationary performance of
the switch, but transient properties are also studied.",
}

@INPROCEEDINGS{Saks91:Traffic,
AUTHOR="V. R. Saksena and T. J. Schonfeld",
TITLE="Traffic management of corporate utility networks",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=1,
PAGES="47-57",
YEAR=1991,
REFERENCES=7,
KEYWORDS="Traffic engineering; network management; backbone network",
ANNOTE="The paper describes the traffic management function for
corporate utility networks. As users move towards consolidating multiple
applications and protocols on a common backbone network, the task of
network management and control becomes quite complex. An overall
framework for traffic management is proposed and key issues central to
an effective functional architecture are emphasized.",
}

@INPROCEEDINGS{Salz91:Communication,
AUTHOR="F. J. M. Salzborn",
TITLE="The Communication spanning tree problem: an heuristic algorithm",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=1,
PAGES="70-79",
YEAR=1991,
REFERENCES=6,
KEYWORDS="Tree network; algorithm; topological design; star network;
network planning; traffic matrix",
ANNOTE="The problem considered here is that of finding minimum cost
communication spanning trees, assuming that the cost of the tree is
equal to the sum of the cost of its links and that the cost of each link
is proportional to the traffic carried on that link. The cost of a link
is actually taken to be the length of the link mulitplied by the traffic
carried. An heuristic algorithm is discussed that appears to give good
results.",
}

@INPROCEEDINGS{Schm91:Traffic,
AUTHOR="J. A. Schmitt",
TITLE="Traffic modeling in networks with incomplete data",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=2,
PAGES="165-176",
YEAR=1991,
REFERENCES=5,
KEYWORDS="Traffic model; alternate routing; adaptive routing;
hierarchical network",
ANNOTE="The paper describes an algorithm that infers a set of direct
traffic demands between switches that can be routed an a given alternate
routing network with specified trank group sizes. The theoretical basis
of the algorithm and the bounds on the nonunique solutions (traffic
demands) are developed.",
}

@TECHREPORT{Tubt91:Method,
AUTHOR="A. Tubtiang and H. I. Kwon and",
TITLE="A Method for Classification of {ATM} Switches",
TYPE="Research Report",
INSTITUTION="Institut Blaise Pascal, Universite Paris VI",
ADDRESS="Paris",
NUMBER="MASI 91.63",
PAGES=13,
YEAR=1991,
REFERENCES=17,
KEYWORDS="ATM; switching system; architecture; classification; Banyan
network; DQDB",
}

@INPROCEEDINGS{Veir91:Generalised,
AUTHOR="Bio Veiro",
TITLE="Generalised Karlsson measurement for {ATM} networks",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=1,
PAGES="201-207",
YEAR=1991,
REFERENCES=19,
KEYWORDS="Measurement; ATM; traffic source model",
ANNOTE="A brief review of the procedure of generalized Karlsson
measurement is given. Some source models for real coded video data are
given, but it turns out, that only simulation will be accurate enough to
assess the generalized Karlsson measurements and a simulation study the
shows, that the procedure works well.",
}

@INPROCEEDINGS{Vese91:Comparison,
AUTHOR="G. G. Veselovsky and M. V. Kupryanova",
TITLE="Comparison of some combinatorial properties of direct and
indirect binary $n$-cube interconnection networks",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=2,
PAGES="79-90",
YEAR=1991,
REFERENCES=5,
KEYWORDS="Interconnection network; hypercube; shuffle exchange",
ANNOTE="The combinatorial features of the two main types of $n$-cube
networks are compared. Investigations are carried out for perfect
shuffle, cyclic shift with amplitude a, bit reversal and flip
permutation. Analysis is done with number theory methods. The conditions
under which conflicts in the networks occur are formulated.",
}

@INPROCEEDINGS{Vill91:Accelerated,
AUTHOR="M. Villen-Altamirano and J. Villen-Altamirano",
TITLE="Accelerated simulation of rare events using {RESTART} method with
hysteresis.",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=2,
PAGES="240-251",
YEAR=1991,
REFERENCES=4,
KEYWORDS="Simulation; simulation model; ATM; output analysis",
ANNOTE="RESTART (REpetitive Simulations Trials After Reaching
Threshold)is a method for accelerating simulations to estimate the
probability of rare events. It allows dramatic reduction of simulation
time for an equal confidence of results.",
}

@INPROCEEDINGS{Wern91:Architecture,
AUTHOR="Marek R. Wernik and R. Kositpaiboon and P. Carbone",
TITLE="Architecture and Control Aspects of Data Service Evolution to
Broadband",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=1,
PAGES="36-46",
YEAR=1991,
REFERENCES=14,
KEYWORDS="Architecture; ATM; broadband; frame relay; BISDN",
ANNOTE="This paper addresses Virtual Data Network (VDN) service and
technology evolution to broadband. The BISDN protocol enabling Frame
Relay service evolution to broadband VDN is then proposed with emphasis
on the use of the ATM network for Frame Relay trunking and on
interworking aspects. The traffic management and control requirements
enabling evolution from Frame Relay service to broadband VDN are further
discussed.",
}

@INPROCEEDINGS{Wozn91:Study,
AUTHOR="J. Wozniak",
TITLE="Study of {S-ALOHA} packet radio networks with a split-channel
cinfiguration",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=2,
PAGES="103-113",
YEAR=1991,
REFERENCES=9,
KEYWORDS="ALOHA; slotted ALOHA; MAN; WAN; Petri net; Markov chain;
throughput analysis; buffer",
ANNOTE="The study of an S-ALOHA packet radio network is presented that
employs a split-channel configuration. In particular two station
operational schemes are investigated with almost instantaneous
acknowledgements. The stations be equipped with buffers assigned to
local and transit packets and their copies. Applying an approximate
Markov chain approach the behaviour of station buffers and the station
throughput - delay performances are analysed.",
}

@INPROCEEDINGS{Yoko91:Study,
AUTHOR="Tetsuya Yokotani and H. Sato and S. Nakatsuka",
TITLE="A Study on Performance Improvement Algorithm in {DQDB} {MAN}",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=2,
PAGES="38-49",
YEAR=1991,
REFERENCES=6,
KEYWORDS="DQDB; MAN; access protocol; M/G/1; waiting time; transmission
delay",
ANNOTE="Performance improvement algorithm in DQDB MAN is proposed. At
first, a special node called erasure node is introduced in DQDB network
for slot reultilization in downstream side and the operation of erasure
node is described. In the latter half the performance of this algorithm
is estimated using a queueing model, where M/G/1 is applied to the
network model. Average and variance of queueing and transmission delay
are calculated by this meth",
}

@INPROCEEDINGS{Yosh91:End,
AUTHOR="H. Yoshino and Y. Hoshiai",
TITLE="End-to-End Blocking in an Integrated Services Network with Link
Capacity Allocation Control",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=3,
PAGES="131-140",
YEAR=1991,
REFERENCES=6,
KEYWORDS="Alternate routing; blocking; BISDN; controlled access; model;
overflow traffic; traffic mix; arrival process; Poisson process;
stability",
ANNOTE="At first the imbalance and bistable behaviour of individual
end-to-end blocking probabilities without control for a multi-class
network model are shown. To prevent these effects link capacity
allocation control is introduced. The effects of this control on a
nonhierarchical alternate routing network are clarified by approximate
analysis for various traffic mixes and allocation control parameters.",
}

@INPROCEEDINGS{Zhan91:New,
AUTHOR="Z. Zhang",
TITLE="New Technique for Queueing Analysis with Markovian Arrivals and
Services in {BISDNs}",
BOOKTITLE="ITC Specialists' Seminar Telecommunication Services for
Developing Economies",
ADDRESS="Cracow",
VOLUME=1,
PAGES="104-117",
YEAR=1991,
REFERENCES=15,
KEYWORDS="BISDN; Markov chain; queue length; arrival process; finite
buffer",
ANNOTE="A new, efficient computational procedure to calculate the queue
size of distribution in a queueing system with a number of independent
sources is presented. Each source is characterized by a finite state
discret-time Maikov chain. The service process can be Markovian as well.
Explicit expression for the queue size distribution is obtained
directly. The method is based on computing the spectral expansion of the
state distribution of the system.",
}

@ARTICLE{Akyi91:Moment,
AUTHOR="Ian Akyildiz and J. C. Strelen",
TITLE="Moment Analysis for Load-Dependent Mixed Product Form Queueing
Networks",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=6,
PAGES="828-832",
YEAR=1991,
KEYWORDS="Queueing theory; product form; moment approximation",
ANNOTE="A solution algorithm is developed for higher moments of the
number of jobs at the stations in load-dependent mixed product form
queueing networks. A relationship is proved and applied between the
derivatives of these moments and higher moments. Thederivative measures
are calculated using a mean value analysis type algorithm called. Moment
analysis enables the computation of second moments, variances and
covariances.",
}

@ARTICLE{Ganz91:Satellite,
AUTHOR="A. Ganz and G. Karmi",
TITLE="Satellite Clusters: A Performance Study",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=5,
PAGES="747-757",
YEAR=1991,
KEYWORDS="Satellite radio; ALOHA; performance evaluation; TDMA; time
division multiple access",
ANNOTE="In this paper, we present a performance study of two on-board
stored, baseband switched, TDMA satelites interconnected
throughintersatellite links. The uplinks are operated under the
slottedALOHA policy, while the downlinks and intersatellite links are
operated employing TDM policy. Each satellite has a finite buffer
capacity for successful packets arriving on the uplinks and on the
intersatellite links.",
}

@ARTICLE{Humb91:Another,
AUTHOR="Pierre A. Humblet",
TITLE="Another Adaptive Distributed Shortest Path Algorithm",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=6,
PAGES="995-1003",
YEAR=1991,
KEYWORDS="Routing; shortest path; algorithm",
ANNOTE="We give a distributed algorithm to compute shortest paths in a
network with changing topology. It does not suffer from the routing
table looping behavior associated with the Ford-Bellman distributed
shortest path algorithm although it uses truly distributed processing.
Its time and message complexities are evaluated.",
}

@ARTICLE{Onun91:CSMA,
AUTHOR="J. O. Onunga and R. W. Donaldson",
TITLE="Performance Analysis of {CSMA} with Priority Acknowledgements
{(CSMA/PA)} on Noisy Data Networks with Finite User Population",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=7,
PAGES="1088-1096",
YEAR=1991,
KEYWORDS="Multiple access; CSMA/PA; acknowledgement; priority;
performance evaluation",
ANNOTE="Carrier sense multiple access with priority acknowledgments
enables information and acknowledgement packets to efficiently share a
common channel. We develop an analytical procedure to calculate delay
and throughput performance of CSMA/PA. Time-axis slotting and Markov
chain analysis are used to determine the channel backlog per cycle. A
cycle includes INFO packet access and transmission time followed by ACK
transmission",
}

@ARTICLE{Rama91:Delay,
AUTHOR="G. Ramamurthy and B. Sengupta",
TITLE="Delay Analysis of a Packet Voice Multiplexer by the Su Di/D/1
queue",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=7,
PAGES="1107-114",
YEAR=1991,
KEYWORDS="Communication network; waiting time; packet voice;
multiplexer; DI/D/1",
ANNOTE="We study the performance of a statistical multiplexer whose
inputs consist of a superposition of voice packets from trunks. Voice
calls are established according to a Poisson process and call holding
times have a general distribution. Each voice call, while in progress,
generates packets at a fixed intervals of deltha.",
}

@ARTICLE{Rubi91:Message,
AUTHOR="I. Rubin and Z. Zhang",
TITLE="Message Delay and Queue-Size Analysis for Circuit-Switched {TDMA}
Systems",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=6,
PAGES="905-914",
YEAR=1991,
KEYWORDS="Multiple access channel; TDMA; time division multiple access",
ANNOTE="We consider a multiple-access communications channel which is
shared among network stations using a circuitswitched TDMA scheme. Each
station is allocated a fixed number of slots duringeach frame. A station
provides access to the channel for its sessions, by assigning to a ready
session one of its dedicated circuits, for the total duration of the
session.",
}

@ARTICLE{Wong91:Controlled,
AUTHOR="Eugene Wong and T. S. Yum",
TITLE="A Controlled Multiaaccess Protocol for Packet Satellite
Communication",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=7,
PAGES="1133-1140",
YEAR=1991,
KEYWORDS="Satellite radio; packet switching; ALOHA; multiple access",
ANNOTE="A controlled multiaccess protocol for packet satellite
communication is introduced and analyzed in this paper. This protocol is
fully distributed and no on-board processing is required for the
satellite. A control parameter is used to adaptively control the packet
transmission rate such that maximum system capacity can be attained and
the average delay isalways minimized for a given throughput.",
}

@ARTICLE{Yue91:Effect,
AUTHOR="W. Yue",
TITLE="The Effect of Capture on Performance of Multichannel Slotted
{ALOHA} Systems",
JOURNAL=ieeecom,
VOLUME="COM-39",
NUMBER=6,
PAGES="818-822",
YEAR=1991,
KEYWORDS="Satellite radio; ALOHA; performance evaluation; multiple
access",
ANNOTE="In this paper, we present an exact analysis to evaluate the
effect of capture on multichannel slotted ALOHA protocol. We derive the
probabilities of the successful transmission, then by using these
probabilities, we calculate the throughputs, average packet delays for
both IFT and DFT protocols and numerically compare the performances of
the systems to and without capture.",
}

@INPROCEEDINGS{Bodn91:Synthetic,
AUTHOR="R. R. Bodnarchuk and R. B. Bunt",
TITLE="A Synthetic Workload Model for a Distributed System File Server",
BOOKTITLE=sigmetrics,
ADDRESS="San Diego, California",
PAGES="50-59",
YEAR=1991,
REFERENCES=12,
KEYWORDS="LAN; traffic measurement; traffic model; file server",
ANNOTE="The goal of the paper is to model the workload of a distributed
system file server in a UNIX/NFS environment.",
}

@INPROCEEDINGS{Gerl91:Interconnecting,
AUTHOR="M. Gerla and T.-Y. Tai and José Augusto Suruagy Monteiro and
Giorgio Gallassi",
TITLE="Interconnecting {LANs} and {MANs} to {ATM}",
BOOKTITLE=lcn,
ADDRESS="Minneapolis, Minnesota",
PAGES="259-270",
YEAR=1991,
REFERENCES=15,
KEYWORDS="ATM; connectionless service; LAN; MAN; interconnection;
bandwidth allocation",
ANNOTE="The authors focus on the problem of bandwidth management for the
VPs within the ATM network connecting the gateways to each other.",
}

@INPROCEEDINGS{Mong91:Proposal,
AUTHOR="L. Mongiovi and M. Farrell and V. Trecordi",
TITLE="A Proposal for Interconnecting {FDDI} Networks Through {BISDN}",
BOOKTITLE=infocom,
ADDRESS="Bal Harbour, Florida",
PAGES="10B.4",
YEAR=1991,
REFERENCES=17,
KEYWORDS="ATM; FDDI; interconnection; gateway; bandwidth allocation;
virtual channel",
ANNOTE="This paper investigates the problem of a transparent
interconnection of remote FDDI networks through BISDN. They propose a
hybrid interworking method that keeps connectionless transfer mode on
FDDI and a connection oriented mode on BISDN. The major focus is on a
bandwidth allocation algorithm that allows the remote gateways to size
the transmission bandwidth on the BISDN virtual connections according to
the traffic needs.",
}

@TECHREPORT{Paxs91:Measurements,
AUTHOR="V. Paxson",
TITLE="Measurements and Models of Wide Area {TCP} Conversations",
INSTITUTION="Department of Computer Systems Engineering, University of
California",
ADDRESS="Berkeley, California",
PAGES=43,
YEAR=1991,
REFERENCES=16,
KEYWORDS="LAN; traffic measurement; traffic model",
ANNOTE="This paper describes measurements of all of the wide area
network TCP conversations between the Lawrence Berkeley Lab. (LBL) and
the rest of the world for the months of Nov., 1990, and March, 1991.",
}

@INPROCEEDINGS{Dirk91:Development,
AUTHOR="P. Dirke and P. Lindberg",
TITLE="Development and application of the analytical method for planning
dependability (reliability)",
BOOKTITLE=itc13,
ISBN=0444888664,
ADDRESS="Copenhagen",
VOLUME=14,
PAGES="273-278",
YEAR=1991,
REFERENCES=4,
KEYWORDS="Network planning; circuit switching; forecasting; economic
evaluation; reliability",
ANNOTE="The analytical method for planning dependability (reliability,
maintainability and maintanance support) is shown. The level of
dependability is dimensioned according to cost-benefit analysis. A
simple method for predicting the impact on revenue is derived, taking
the market situation and different principles for setting rates and
charges into account.",
}

@INPROCEEDINGS{Gopa91:Algorithms,
AUTHOR="G. Gopal and C. Kim and A. Weinrib",
TITLE="Algorithms for reconfigurable networks",
BOOKTITLE=itc13,
ISBN=0444888664,
ADDRESS="Copenhagen",
VOLUME=14,
PAGES="341-347",
YEAR=1991,
REFERENCES=15,
KEYWORDS="Network design; logical network structure; cross connect;
network topology; network optimization",
ANNOTE="A reconfigurable network, one which can change logical networks
dynamically, has been emerging as a promising design for network
resiliency under traffic changes and physical facility failures. We
investigate configuration management and optimal logical network design
for reconfigurable networks. We define the underlying constraint
optimization problem and develop a heuristic solution technique.",
}

@INPROCEEDINGS{Harr91:Mathematical,
AUTHOR="R. J. Harris",
TITLE="A mathematical programming model for service protection in a
telecommunications network",
BOOKTITLE=itc13,
ADDRESS="Copenhagen",
VOLUME=14,
PAGES="225-229",
YEAR=1991,
REFERENCES=1,
KEYWORDS="Network planning; circuit switching; channel assignment;
protection",
ANNOTE="The paper describes a mathematical model for assigning channels
in the event of node or link failures. This is done by throughput
optimization resulting in a linear programming problem.",
}

@INPROCEEDINGS{Kami91:Capacity,
AUTHOR="K. Kamimura and H. Nishino",
TITLE="Capacity and flow assignment of packet-switched networks with a
concave line cost function",
BOOKTITLE=itc13,
ISBN=0444888664,
ADDRESS="Copenhagen",
VOLUME=14,
PAGES="285-290",
YEAR=1991,
REFERENCES=14,
KEYWORDS="Network planning; packet switching; flow optimization; network
design",
ANNOTE="The packet-switched network design is formulated as a capacity
and flow assignment problem with concave line-cost strukture. Efficient
methods for obtaining the global optimum or a good local minimum are
introduced by confining attention to a class of hierarchical networks
which consists of elementary networks. A basic iterative procedure
obtains the global optimum of the elementary networks within finite
iterations.",
}

@INPROCEEDINGS{Kani91:Unified,
AUTHOR="Jaidev Kaniyil and Y. Onozato and S. Noguchi",
TITLE="A unified approach towards characterization of structural
stabilities in telecommunication networks",
BOOKTITLE=itc13,
ISBN=0444888664,
ADDRESS="Copenhagen",
VOLUME=14,
PAGES="253-256",
YEAR=1991,
REFERENCES=17,
KEYWORDS="Network stability; alternate routing; random multiple access",
ANNOTE="A rewiew of some recent results on studies on the properties of
stability associated with the dynamic flows in different network schemes
such as input buffer limiting, nonhierarchical alternate routing and
combined random-reservation multiple access schemes.",
}

@INPROCEEDINGS{Key91:Highly,
AUTHOR="P. B. Key and A. Elvidge",
TITLE="Design and analysis of a highly reliable transmission network",
BOOKTITLE=itc13,
ISBN=0444888664,
ADDRESS="Copenhagen",
VOLUME=14,
PAGES="323-328",
YEAR=1991,
REFERENCES=15,
KEYWORDS="Network design; network planning; availability; reliability",
ABSTRACT="In this paper we comment on existing methods of calculating
network availibility measures, and present a new analytic technique
which ca model rerouting strategies, as well as the present link-based
protection techniques.",
}

@INPROCEEDINGS{Kono91:Throughput,
AUTHOR="J. Konorski",
TITLE="Throughput of a packet-switching network under a class of
store-and-foreward deadlock prevention mechanisms",
BOOKTITLE=itc13,
ISBN=0444888664,
ADDRESS="Copenhagen",
VOLUME=14,
PAGES="297-302",
YEAR=1991,
REFERENCES=18,
KEYWORDS="Packet switching; deadlock prevention; analysis",
ANNOTE="In the paper an approximate stochastic analysis of store-and
forward deadlocks in packet switched networks is carried out. Structered
buffer pools, circulating token and erasable packet controllers are
analysed to demonstrate the need of combining the controller with a
proerly designed congestion control mechanismen.",
}

@INPROCEEDINGS{Kouv91:Queueing,
AUTHOR="D. D. Kouvatsos and P. H. Georgatsos",
TITLE="Queueing models of packet-switched networks with locally adaptive
routing",
BOOKTITLE=itc13,
ISBN=0444888664,
ADDRESS="Copenhagen",
VOLUME=14,
PAGES="303-308",
YEAR=1991,
REFERENCES=9,
KEYWORDS="Packet switching; closed queueing network; open queueing
network; adaptive routing; product form",
ANNOTE="A universal framework is presented for the approximate analysis
of general queueing networks models of packet-switched networks. The
network is modeled as a collection of nodel queueing systems each of
which consists of a set of outgoing channel queues and a node
dispatching the incomming traffic to these queues according to a local
adaptive routing policy. Product-form approximations for the queue
length of open and closed networks are given.",
}

@INPROCEEDINGS{Liu91:ISDN,
AUTHOR="Feng Liu and D. Seagraves",
TITLE="An {ISDN} application-simulation modeling of {NACD}",
BOOKTITLE=itc13,
ISBN=0444888664,
ADDRESS="Copenhagen",
VOLUME=14,
PAGES="279-284",
YEAR=1991,
REFERENCES=2,
KEYWORDS="ISDN; simulation; ACD; automatic call distribution",
ANNOTE="Network automatic call distribution utilizes the ISDN standard
as a vehicle to effectively distribute calls betwen ACD sites. The
performance of a network with NACD application is simulated, taking into
account an alternative routing scheme and a flow control mechanismen.",
}

@INPROCEEDINGS{Luba91:Effectiveness,
AUTHOR="J. Lubacz and A. Tomaszewski",
TITLE="Effectiveness vs. controllability in traffic engineering",
BOOKTITLE=itc13,
ISBN=0444888664,
ADDRESS="Copenhagen",
VOLUME=14,
PAGES="267-272",
YEAR=1991,
KEYWORDS="Traffic control; blocking; circuit switching; discrete time
analysis; loss probability",
ANNOTE="The paper concerns modelling the performance of teletraffic
systems in fixed-length sequences (windows) of consequtive service
demands acceptance/rejection decisions. The presented results are
focused on evaluating and controlling the distribution of losses in a
window. The proposed methodology employes a combination of discrete-time
Markov propcesses of order K>0 and simulation.",
}

@INPROCEEDINGS{Mili91:Dynamic,
AUTHOR="Rodolfo Milito and Y. Levy and Y. Arian",
TITLE="Dynamic algorithms for distributed queues with abandonments",
BOOKTITLE=itc13,
ISBN=0444888664,
ADDRESS="Copenhagen",
VOLUME=14,
PAGES="329-324",
YEAR=1991,
REFERENCES=12,
KEYWORDS="Dynamic routing; distributed system",
ANNOTE="The paper considers the problem of distributing traffic to mult
iple parallel queues based on inclomplete and possible inaccuratstate
information. This problem arises in the context of intelligent networks
where large customers rely on the network for traffic distribution to
multiple locations. The problem is solved through a revenue-driven
Markovian decision model.",
}

@INPROCEEDINGS{Morr91:Prospects,
AUTHOR="R. M. Morris",
TITLE="Prospects for neural networks in broadband resource management",
BOOKTITLE=itc13,
ISBN=0444888664,
ADDRESS="Copenhagen",
VOLUME=14,
PAGES="335-338",
YEAR=1991,
REFERENCES=46,
KEYWORDS="Congestion control; neural network; dynamic resource
allocation; connection admission control",
ANNOTE="The prospects for application of emerging neural network
technology to the problems of broadband network resource management are
explored. We identify two particulary appropriate attributes of neural
networks, namely adaptivity and high speed. We describe a new method of
admission control using a neural network controller.",
}

@INPROCEEDINGS{Pach91:Technique,
AUTHOR="A. R. Pach",
TITLE="A technique for calculation of the optimal timeout for the class
4 transport protocol in a packet switched network",
BOOKTITLE=itc13,
ISBN=0444888664,
ADDRESS="Copenhagen",
VOLUME=14,
PAGES="291-296",
YEAR=1991,
REFERENCES=9,
KEYWORDS="Packet switching; transport layer; delay time; delay
analysis",
ANNOTE="A simple method of calculation of the optmal timeout for the
class 4 transport protocol in a packet switched network is presented.
The optimal timeout minimizes a number of performancemeasures such as
a