Subject: The Fall 1993 edition of the Tenet Group current research document

From: [email-masked] (Domenico Ferrari)
Date: Sun, 5 Dec 1993 21:58:42 -0800

\" Last modified November 1, 1993
\"
\" Print using:  *roff -ms <filename>
\"
.ND
.ce
.ps 14
\fBThe Tenet Group\fR
.sp .5
.ce
.ps 11
University of California, Berkeley
.ce
and International Computer Science Institute
.sp
.ps 16
.ce
\fBRecent and Current Research\fR
.sp .5
.ce
.ps 11
November 1993
.sp 2
.NH 1
Introduction
.PP
The Tenet Group was formed in September of 1989 at the University of 
California at Berkeley and the International Computer Science Institute 
(ICSI, also in Berkeley) 
to perform research in high-speed computer networking. 
The focus of the group is on the design
and development of 
real-time communication services, 
and on network support for continuous-media applications. 
.PP
The Tenet Group is participating in
three major multi-institution research projects: BLANCA, Sequoia 2000,
and BAGnet. The BLANCA project is part of the Gigabit Testbed Initiative,
which is sponsored by the Corporation for National Research Initiatives
and supported by the National Science Foundation and by the Defense Advanced
Research Projects Agency.
The BLANCA project officially started in May 1990 and currently includes
AT&T Bell Laboratories, the universities of California, Illinois, and
Wisconsin, Pacific Bell, and a few research institutes, among which is ICSI. 
The goal of BLANCA is to design and build two wide-area ATM-based 
testbeds called 
Xunet 2 (at 45 Mbps) and Xunet 3 (at 622 Mbps), and demonstrate on them several 
applications requiring high-speed networking.
Most of applications are of the scientific visualization type, 
and require the transmission of image sequences and/or video streams.
The sequences or streams are to be browsed, stopped, and played
forward or backward at speeds slower or faster than the nominal
one, by scientists at sites far from those where the sequences
or streams are generated or stored.
.PP
Sequoia 2000, the second major initiative in which the Tenet Group is
participating, aims at building high-speed storage and communication
facilities for global-change scientists at remote locations, to
allow them to visualize and
browse sequences of digitally represented satellite maps
and other large sets of data to be used in earth science research.
Project Sequoia 2000, the sequel to Project Athena,
was awarded in July 1991 by the Digital Equipment Corporation
to the University of California system; its network design and research
activities are taking place at U.C. Berkeley and U.C. San Diego.
The Sequoia 2000 network (S2Knet) connects at T1 speed the 
Berkeley campus to the Davis, Santa Barbara, 
Los Angeles, and San Diego campuses, as well as to the Scripps
Institution of Oceanography in San Diego and the state's Department of Water
Resources near Sacramento.
An experimental T3 link has just been installed between U.C. Berkeley
and U.C. San Diego.
The network's bandwidth will be increased to 45 Mbps in early 1994.
.PP
The testbed for the third project, BAGnet (the Bay Area Gigabit network),
does not yet exist but is expected to be installed during 1994.
BAGnet will connect a dozen top computing research organizations
located in the San Francisco Bay area; the group has applied to
CalREN, a research support foundation established by Pacific Bell,
for ATM services.  These services are to be used for a number of
collaborative multimedia applications, the first of which to be 
implemented will be a "teleseminars" facility.  The bandwidth is
expected to be 155 Mbps in early 1994 and to be upgraded to 622 Mbps
in late 1994.
.PP
The contributions of the Tenet Group
to all three projects are concerned primarily with the
technological foundations, rather than with the end-user
applications, and can be classified into two partially
overlapping areas: (a) real-time communication services, and
(b) continuous-media networking applications.
.NH 1
Real-Time Communication Services
.nr NH 2 10
.NH 2
Enhancements and extensions of the Tenet approach 
.PP
Several improvements and extensions have been proposed for the
original Tenet approach.
The enhancements of Scheme 1 are
easily portable to Scheme 2 (described in Section 2.3).
.sp .5
.LP
.B
Service disciplines for real-time communication.\ \ 
.R
\fBHui Zhang\fR has obtained several new results in his
investigation of service
disciplines for integrated services packet switching networks.
He has been studying a class of service disciplines called
\fIrate-controlled service disciplines\fR.
Their key feature is the separation of the server into 
two components: a rate controller and a scheduler. After the rate controller
limits the distortion of the traffic introduced by
load fluctuations inside the network, the scheduler
orders the packets for transmission. Rate-controlled service disciplines 
provide a general framework under which most of the existing 
non-work-conserving disciplines such as Jitter-EDD,
Stop-and-Go, and Hierarchical Round Robin 
can be naturally expressed by choosing appropriate combinations of 
rate controller and scheduler. Tradeoffs of 
various rate controllers and schedulers have been investigated. 
One discipline in this class, called Rate-Controlled Static Priority (RCSP),
is particularly suitable
for providing performance guarantees in high speed networks. It has 
flexibility in the allocation of bandwidth and delay bounds to different
connections as well as simplicity of implementation.
Conditions are given to provide end-to-end deterministic and statistical
performance bounds in a network of rate-controlled servers. Although
rate-controlled service disciplines are non-work-conserving, i.e.,
packets may be held in rate controllers even when the output link is idle, 
it has been proven that the end-to-end delay bounds are not affected 
by the holding time. 
Their ability to provide end-to-end performance bounds 
is general. Unlike the previously proposed solutions,
they can provide end-to-end bounds in
networks with arbitrary topology, both feedback 
(aggregate traffic forming loops) and feed-forward networks, internetworks 
with variable but bounded link delays, and networks with rate-controlled 
servers that have different schedulers. 
.sp .5
.LP
.B
A new method for admission control.\ \ 
.R
\fBDomenico Ferrari\fR devised a new method for admission control. The method
can be applied to a wide variety of node models with a wide spectrum of
accuracies, and is therefore much more general than the one previously
used in Scheme 1 and Suite 1, which was based on a very simple, not
very realistic node model. The crucial difference is that, in the new
approach, each node visited by a real-time channel to be established
may be represented by two or more single servers connected in cascade
instead of only one such server. The admission tests and computations
are designed and have to be executed for each server along the path
of the channel to be established. The new method substantially
simplifies the Real-Time Channel Administration Protocol (RCAP) code
for establishment in an internetwork, and
makes the tests and computations, hence also the code, more portable.
On the negative side, it increases somewhat the establishment overhead
and the length of the establishment messages.
.sp .5
.LP
.B
New admission tests for deterministic service.\ \ 
.R
\fBHui Zhang\fR has developed new admission control algorithms for providing
deterministic service.  In the
previous version of Scheme 1, the deterministic test
ensures that the sum of the
peak rates of all deterministic connections is less than the link speed.
This condition will result in a low average link utilization if the
peak-average-rate ratio is high for real-time traffic. The new study 
shows that deterministic service can be provided even when this condition
is not met. When the traffic is bursty, the new admission control
algorithm results in a multifold increase in the number of admitted
real-time connections.
.sp .5
.LP
.B
A new approach to statistical guarantees.\ \ 
.R
\fBHui Zhang\fR and \fBEd Knightly\fR have developed a new, efficient, and 
general approach for providing end-to-end statistical guarantees in 
packet-switching networks. This is achieved
by modeling a traffic source with a family of interval-dependent bounding
random variables and by using a rate-controlled service discipline
inside the network. The traffic model stochastically  bounds the
number of bits sent over time intervals of different length. The
model captures different source behaviors over different time scales
by making the distribution an explicit function of the interval length.
The RCSP service discipline has the priority queueing mechanisms
necessary to provide statistical performance guarantees in integrated services
networks. In addition, RCSP provides the means for efficiently extending
the results from a single switch to a network of arbitrary topology.
.sp .5
.LP
.B
Modifying the Ethernet for real-time traffic.\ \ 
.R
\fBBrian Whetten\fR
is developing a new algorithm for a more fair Ethernet, and plans
to simulate it to test its effectiveness.  One of the biggest problem
that current Ethernets have in terms of both utilization and
handling of real-time traffic is the inherent unfairness of CSMA/CD.  
Under heavy loads, packet starvation frequently occurs, which causes a 
given sender to block for an average of more than 200 ms.  The new
algorithm fixes these problems, but may have a lower 
maximum utilization in some cases.  Simulation will allow these tradeoffs
to be explored.
.sp .5
.LP
.B
Applying Tenet admission control to ATM networks.\ \ 
.R
\fBPillalamarri Seshasayi\fR is looking into the problem of
providing real-time communication with guaranteed quality-of-service
(QOS) in ATM networks.  Guaranteeing QOS in such a network
requires that the traffic, cell loss, delay and delay variation of
a particular channel be characterized deep inside the network.
While such a characterization is well understood at the source,
it is not clear how it changes after the channel has traversed
many switches in a loaded network.  He is investigating how the
Tenet traffic model and admission control algorithm should be
changed for use in ATM networks.
.NH 2
Porting and extending the prototype Tenet real-time protocol suite (Suite 1)
.sp .5
.LP
.B
Porting the Tenet suite to the Xunet 3 testbed.\ \ 
.R
A HIPPI network has been constructed between Cory and Evans Halls on
the U.C. Berkeley campus and Building 50 at Lawrence Berkeley
Laboratory.  The network uses standard HIPPI within buildings and
serial HIPPI between buildings.  \fBBruce Mah\fR is working with
\fBSrinivasan Seshan\fR, a graduate student in the RAID research group,
to port the Real-Time Message Transport Protocol (RMTP), the Real-Time
Internet Protocol (RTIP),
and the Real-Time Channel Administration Protocol (RCAP) to RAID-II,
a prototype disk array built at U.C. Berkeley.  The
port of RCAP, designed to support the filesystem code in the Sprite
kernel, is expected to suggest some new implementation alternatives
for the next version of the same protocol.  When this protocol work is
completed,
the disk array will provide a high-capacity, high-bandwidth storage
service for the HIPPI testbed.  \fBHoofar Razavi\fR and some researchers
at LBL are working
on porting the Tenet protocols to other pieces of the network testbed.
.sp .5
.LP
.B
Scheduling real-time transmissions over HIPPI switches.\ \ 
.R
\fBAndres Albanese\fR, \fBRiccardo Bettati\fR and
\fBMaurizio Bonuccelli\fR (a short-term visiting researcher from the 
University of Rome, Italy), have completed an investigation of
means to support real-time traffic over circuit-switching networks
where circuits are time-shared by the network layer among various
connections.
The resulting scheme is a combination of channel establishment and
deterministic traffic scheduling.  The acceptance test for a new
channel consists of the explicit construction of the transmission
schedule.  Once the channel has been accepted, the schedule used in
the acceptance test is used for data transmission.
Simulation experiments are currently under way to investigate
the scalability of
this approach and to evaluate different scheduling heuristics.
Work has begun to include this approach as part of RCAP in the
existing two-switch HIPPI network connecting the U.C.
Berkeley campus and the Lawrence Berkeley Laboratory 
(the Xunet 3 testbed). \fBAnisoara Nica\fR is modifying the Tenet
protocols for this testbed, where RTIP will time-multiplex several
conversations over the same HIPPI links and ports.
.sp .5
.LP
.B
Integrating RCAP with the Xunet and Fore Systems signalling protocols.\ \ 
.R
\fBEd Knightly\fR 
is collaborating with the networking group at 
Sandia National Labs to investigate providing real-time
performance guarantees on several interconnected network testbeds
including Xunet, a Fore Systems ATM LAN, and a heterogeneous FDDI
network connected with a Gigaswitch. The project currently has several 
applications running on it, including DAVE (Distributed Audio Video 
Environment) conferencing tools and an MPEG video distribution system 
(under development). In addition, several PVM (parallel virtual machines) 
distributed applications with demanding network constraints are
being tested. The next step to providing end-to-end real-time guarantees 
to these applications involves integrating RCAP (running on all workstations 
and routers) with the Xunet and Fore Systems signalling protocols.
\fBFukiko Hidano\fR is currently installing RCAP on top of the Xunet
Signalling Protocol.
.sp .5
.LP
.B
Real-time protocols for mobile computing.\ \ 
.R
\fBBruce Mah\fR has been working with \fBKimberly Keeton\fR and \fBSrinivasan
Seshan\fR, two graduate students in the RAID research group,
on issues related to
mobile computing.  They have developed several algorithms for
supporting mobility in connection-oriented networks such as a network
using the Tenet real-time protocol suite.  Connection-based networks
present some special problems for mobility, in that the network state
needs to reflect a new connection path whenever a host moves in the
network. To reduce latencies and overhead in each handoff,
and to minimize disruptions of continuous-media streams,
it is desirable to investigate handoff schemes that modify portions of
existing connections, as opposed to creating entirely new connections.
Based on a preliminary analysis, an approach using network-layer
multicasting looks quite promising.  Some of this work will be
incorporated into the InfoPad project. The InfoPad is a portable
multimedia terminal under
development in the Department of Electrical Engineering and Computer
Sciences at U.C. Berkeley.
.NH 2
The next Tenet scheme (Scheme 2) and suite (Suite 2)
.sp .5
.LP
.B
The Scheme 2 paradigm.\ \ 
.R
The initial design of the Tenet Group's second generation real-time
networking scheme, Scheme 2, has been completed.
The main focus of this work has been to extend the basic real-time
communication service provided by Scheme 1 in two important respects:
(a) provide support for efficient multi-party communication, and
(b) make
the client-service interface more flexible.
Support for multi-party communication includes
networking abstractions and 
mechanisms to improve the utilization of network
resources by multi-party communication.
An important networking abstraction introduced is the \fItarget set\fR,
which is similar to the host group in IP multicast.
Destinations join target sets depending on their interest in certain
data streams (e.g., video from a certain distributed conference).
Sources then establish channels to target sets, causing real-time
channels to be established (or at least attempted) to all destinations
in the
target set.
Join and leave primitives support dynamic membership in target sets.
Efficient utilization of network resources is achieved by the use of
true multicast and of sharing groups, which allow the network to use
application-specific information to share network resources among 
channels while maintaining the desired  performance guarantees.
To improve the flexibility of the client-service
interface, we allow several input parameters to be specified as ranges
rather than point values. The client can then specify a best/desired value
and a worst/acceptable value, thus eliminating (or at least
drastically reducing)
the need for iterative
negotiations.
The initial design was reviewed by internal
and external evaluators in October 1993.
Implementation will begin soon after incorporating feedback from the
design review.
Other features being considered for inclusion in Scheme 2 and Suite 2 are
support for virtual real-time networks, advance reservation algorithms,
the Dynamic Channel Management system, and fault recovery mechanisms.
The design of the Scheme 2 paradigm and interface has been done by a team
consisting of
\fBWolfgang Effelsberg\fR,
\fBDomenico Ferrari\fR,
\fBAmit Gupta\fR,
\fBWendy Heffner\fR,
\fBMark Moran\fR,
\fBEberhard M\*:uller-Menrad\fR,
\fBJean Ramaekers\fR (a former Tenet Group member from the University of
Namur, Belgium),
\fBClemens Szyperski\fR (who is now with Oberon Microsystems, Inc. in
Zuerich, Switzerland),
\fBGiorgio Ventre\fR (University of Naples, Italy),
\fBRon Widyono\fR,
\fBRaj Yavatkar\fR, and
\fBMakiko Yoshida\fR (NEC, Kawasaki, Japan).
.sp .5
.LP
.B
Routing multicast real-time channels.\ \ 
.R
\fBRon Widyono\fR and
\fBMark Moran\fR
have been studying the problem of routing real-time multicast channels
for Scheme 2.
The main emphasis over the last several months has been on building the
simulator (described in the next paragraph),
determining a metric for evaluating and comparing routing
algorithms, and developing
a cost function that will accurately
reflect the availability of critical network resources.
Routing algorithms will be evaluated on the basis of a direct
measurement of the number of channels established from both
hand-written and randomly-generated scripts of channel establishment
attempts.
Several indirect evaluation
metrics that be would easier to measure have also been examined;
however, these were rejected
because they did not appear to be strongly 
correlated with the main evaluation metric.
A preliminary cost function has been developed that reflects the
availability of throughput and the schedulability on each link.
Since the cost function should reflect the availability of
network resources, the suitability of the cost function
as an indirect evaluation metric will have to be checked.
Routing algorithms are being adapted to incorporate the
end-to-end delay bound as a constraint.
Cost functions and
evaluation metrics will be evaluated by simulations.
.sp .5
.LP
.B
Scheme 2 simulator.\ \ 
.R
\fBRon Widyono\fR, \fBAmit Gupta\fR, \fBMark Moran\fR, and \fBWendy Heffner\fR
are working on a simulation tool for Scheme 2 based on the Scheme 1 simulator 
Galileo.  Galileo has been enhanced to support the establishment of multicast
(1-to-N) channels.  The modifications include a routing module, basic multiple 
destination establishment, resource partitioning, and a new "greedy" resource 
reservation relaxation policy.  
The routing module allows for the 
implementation of multiple routing algorithms and for easy selection from
among them.  A routing algorithm's view of the network, which includes link
costs, can be dynamically updated by nodes to reflect changing resource 
availability.  The resource partitioning work (described in the next
paragraph) allows
for the processing, 
scheduling, and buffer space resources to be partitioned in such a way that 
admission control and resource allocation during channel establishment are 
bounded by the partition limits.  In multicast channel establishment, the 
relaxation of resource reservations needs to be done more intelligently to 
avoid inefficiencies brought upon by the conflicting requirements from the
multiple destinations.  A "greedy" policy is being evaluated, in which
relaxation proceeds from destination to source with each node taking as much
as possible.  Finally, real-life parameter values are being used in
simulation of a subset of the Internet multicast backbone (MBONE) to fine
tune the various parameters
affecting admission control and relaxation.
.sp .5
.LP
.B
Resource partitioning in real-time networks.\ \ 
.R
\fBDomenico Ferrari\fR and \fBAmit Gupta\fR
have investigated the problem of
partitioning the resources of an integrated-services network. An efficient
solution to this problem has many potential applications: for example, the
construction of virtual private networks, the fast establishment
of real-time channels, the re-routing of channels in mobile
communication, and the advance reservation of real-time channels.
The solution proposed by Ferrari and Gupta works within the
context of the Tenet schemes: per-partition
tests and computations have been shown to be derivable from
those that apply to the
entire network in each node; therefore, the subnetworks
defined by partitions of each node's resources can be treated
during channel establishment and teardown as though they were
independent and isolated networks. The amount of a resource
assigned to a given partition in a node may differ from the
amounts assigned to the same partition in all other nodes.
One of the partitions may be dedicated to non-real-time
traffic; its resources will not usually be
available to real-time traffic.
.sp .5 
.LP
.B
Advance reservation of real-time channels.\ \ 
.R
In the current Tenet scheme, 
the network provides the clients 
with quality-of-service guarantees during data transfer. 
However, 
for a service to be truly usable in multi-party applications,
the network ought to be able 
to guarantee the availability of its resources
at the time they will be needed.
This implies that the clients should be able 
to reserve 
channels with given characteristics and guarantees
in advance. 
\fBDomenico Ferrari\fR, 
\fBAmit Gupta\fR, 
and \fBGiorgio Ventre\fR (a former Tenet Group member from the
University of Naples, Italy),
have designed mechanisms
for supporting advance reservations 
in real-time communication networks.
.sp .5
.LP
.B
Dynamic Channel Management algorithms.\ \ 
.R
\fBColin Parris\fR is currently 
implementing the DCM scheme that provides a network with the 
ability to dynamically modify the traffic and performance parameters
as well as the routes of real-time connections. These modifications are subject
to a \fImodification contract\fR which specifies the degree of disruption that
a client can accept during these modifications. Dynamic Channel Management
consists of the DCM scheme and the DCM policy. The DCM scheme is a collection 
of algorithms that permit the modification of the parameters and routes,
whereas the DCM policy is a collection of rules that determine 
whether modifications should be attempted, and 
provide the appropriate traffic and performance 
parameters and the routing constraints to the DCM scheme.
The DCM scheme is being implemented using the Simple Network Management 
Protocol (SNMP) v1. In this implementation, a connection 
establishment or modification is achieved by doing an 
SNMP \fCset\fR on the traffic and performance objects
related to the appropriate link. SNMP \fCget\fR commands can
also be used to read the 
connection state information in the nodes. SNMP will also be used to monitor
RMTP/RTIP, thus providing DCM policies with full monitoring capabilities for
real-time traffic, as well as full control capabilities
for real-time connections
through the DCM schemes. Experiments will be conducted to compare the 
performance of this SNMP-based implemention with that of the RCAP (a 
signalling protocol) implemention.
.sp .5
.LP
.B
Fault recovery mechanisms.\ \ 
.R
\fBAnindo Banerjea\fR and \fBColin Parris\fR have performed simulation
experiments to investigate the factors influencing fault recovery
of real-time channels. The schemes to recover from single and multiple
link faults have been classified along a number of orthogonal dimensions
and each of these explored under varying network loads. The experiments
have been useful in isolating effective approaches to recovery and suggesting
improvements to the schemes.
.NH 1 
Continuous-Media Networking Applications
.sp .5
.LP
.B
Multimedia conferencing tools development and deployment.\ \ 
.R
\fBSteven McCanne\fR has been investigating schemes for efficient and
robust transport of video over packet-switching networks.  He has built
a video conferencing prototype called \fIvic\fR, which employs an
extensible architecture to facilitate experimentation with
video coding schemes and session protocols.  \fIVic\fR is
in production use on the Sequoia 2000 and Xunet 2 testbeds.
.sp .5
.LP
.B
Connecting remote users to the MBONE.\ \ 
.R
\fBAlberto Gil Solla\fR and
\fBAndr\o'e\''s Su\o'a\(aa'rez Gonz\o'a\(aa'lez\fR
have developed
PAT, Phone Assisted Teleconference, which will connect remote
users without workstation access to the
MBONE using a touch-tone
telephone. The connection will permit those
remote users either to lecture or to attend 
a conference over the network. In both cases,
the user will have access to audio, some state knowledge, and
control of the shared whiteboard.
.sp .5
.LP
.B
Characteristics of wide-area TCP connections.\ \ 
.R
In preparation for an investigation of the impact of
continuous-media applications on network performance
being planned by the Tenet Group,
\fBVern Paxson\fR has been studying the characteristics of
wide-area network traffic on today's Internet.
He has investigated growth-trend patterns at
a medium-sized Internet site, and developed analytic models
for characterizing the bulk transfer properties of wide-area TCP
connections.  He is currently investigating the time-series structure
of wide-area bulk transfer connections.
.NH 1
Tenet Group Members
.PP
The current members of the Tenet Group are the following graduate students
in the Department of Electrical Engineering and Computer Science at 
U. C. Berkeley: 
\fBAnindo Banerjea\fR,
\fBAmit Gupta\fR,
\fBWendy Heffner\fR,
\fBFukiko Hidano\fR,
\fBEdward Knightly\fR,
\fBSteven McCanne\fR,
\fBBruce Mah\fR,
\fBRebbie Moon\fR,
\fBMark Moran\fR,
\fBColin Parris\fR,
\fBVern Paxson\fR,
\fBBrian Whetten\fR,
\fBRon Widyono\fR,
and
\fBHui Zhang\fR;
an undergraduate student in EECS at U.C. Berkeley,
\fBHoofar Razavi\fR;
a U.C. Berkeley Computer Science Reentry Program student, \fBAnisoara Nica\fR;
the following visiting scholars and researchers:
\fBRiccardo Bettati\fR, from University of Illinois at Urbana-Champaign;
\fBWolfgang Effelsberg\fR, from the University of Mannheim, Germany;
\fBAlberto Gil Solla\fR,
from the Escola Tecnica Superior
de Enxe\o'n\~'eiros
de Telecomunicacion de Vigo, Spain;
\fBJune Kato\fR,
from NTT Software Laboratories, Tokyo, Japan;
\fBLawrence Landweber\fR, from the University of Wisconsin at Madison;
\fBMasaya Miyazaki\fR, from the Information Systems Research Laboratory (ISL),
Matsushita Electric Industrial Co., Ltd., Osaka, Japan;
\fBEberhard M\*:uller-Menrad\fR, from the University of Munich, Germany;
\fBPillalamarri Seshasayi\fR, from Siemens, Munich, Germany;
\fBAndr\o'e\''s Su\o'a\(aa'rez Gonz\o'a\(aa'lez\fR,
from the Escola Tecnica Superior
de Enxe\o'n\~'eiros
de Telecomunicacion de Vigo, Spain;
\fBFred Templin\fR,
from the External Research Program of Digital Equipment Corporation, Maynard,
Massachusetts, U.S.A.;
\fBHirohisa Wakai\fR,
from Sharp Information Technology Research Laboratories, Nara, Japan;
\fBRaj Yavatkar\fR, from the University of Kentucky;
the co-leader of ICSI's Networks Group,
\fBAndres Albanese\fR, 
and the leader of the Tenet Group,
\fBDomenico Ferrari\fR.
.NH 1
Tenet Group Publications
.PP
The Tenet Group publications since the
beginning of 1992 are listed below.
Unless otherwise noted, the publications
are available by electronic mail from the Tenet file server
\fB([email-masked])\fR.  
Instructions on how to use the file server 
may be obtained by sending it a mail 
message with the one-word subject: \fIHelp\fR. 
The same publications are also available by anonymous ftp to
tenet.berkeley.edu.
Inquiries for further information should be directed to the Tenet Group leader,
Professor \fBDomenico Ferrari\fR, Computer Science Division,
571 Evans Hall, University of California, Berkeley CA 94720.  
Electronic mail may be sent to \[email-masked]\fR.
.sp 1.5
.KS
.LP
A. Banerjea and S. Keshav,
\*QQueuing Delays in Rate Controlled Networks\*U,
Technical Report TR-92-015, 
International Computer Science Institute, Berkeley, CA, February 1992;
also in
\fIProc. INFOCOM'93\fP, 
San Francisco, March-April 1993.
.KE
.KS
.LP
A. Banerjea, C. Parris and D. Ferrari,
\*QRecovering Guaranteed Performance Service Connections from Single and 
Multiple Faults\*U, Technical Report
TR-93-066, International Computer Science Institute, Berkeley, CA,
November 1993.
.KE
.KS
.LP
R. C\o'a\(aa'ceres, 
\*QMultiplexing Traffic at the Entrance to Wide-Area Networks\*U, 
Ph.D. Dissertation, Technical Report UCB/CSD 92/717, 
University of California, Berkeley, December 1992.
.KE
.KS
.LP
P. Danzig, S. Jamin, R. C\o'a\(aa'ceres, D. Mitzel, and D. Estrin,
\*QAn Empirical Workload Model for Driving Wide-Area TCP/IP
Network Simulations\*U,
\fIJournal of Internetworking: Research and Experience\fR, 
vol. 3, no. 1, pp. 1-26, March 1992.
.KE
.KS
.LP
W. Effelsberg, E. M\*:uller-Menrad,
\*QDynamic Join and Leave for
Real-Time Multicast\*U, Technical Report TR-93-056,
International Computer Science
Institute, Berkeley, CA, October 1993.
.KE
.KS
.LP
N. Faller,
\*QMeasuring the Latency Time of Real-Time UNIX-like Operating Systems\*U,
Technical Report TR-92-037, 
International Computer Science Institute, Berkeley, CA,
June 1992.
.KE
.KS
.LP
D. Ferrari,
\*QA New Admission Control Method for Real-Time Communication
in an Internetwork\*U
in S. Son, Ed.,
.ul
Real-Time Systems.
Prentice-Hall, Englewood Cliffs, NJ, 1994.
.KE
.KS
.LP
D. Ferrari, 
\*QDesign and Applications of a Delay Jitter Control
Scheme for Packet-Switching Internetworks\*U, 
\fIProc. Second International Workshop on Network 
and Operating System Support for Digital Audio and Video\fR, 
Springer-Verlag, Heidelberg, Germany, pp. 72-83, November 1991;
also in \fIComputer Communications\fR, vol. 15, n. 6, 
pp. 367-373, July-August 1992.
.KE
.KS
.LP
D. Ferrari,
\*QDistributed Delay Jitter Control in Packet-Switching Internetworks\*U,
Technical Report TR-91-056, 
International Computer Science Institute, Berkeley, CA,
October 1991; 
also in \fIJournal of Internetworking: Research
and Experience\fR, 
vol. 4, n. 1, pp. 1-20, 1993.
.KE
.KS
.LP
D. Ferrari, 
\*QReal-Time Communication in an Internetwork\*U,
\fIJournal of High Speed Networks\fR, vol. 1, n. 1, pp.79-103, 1992; also
Technical Report TR-92-001, International Computer Science Institute,
Berkeley, CA, January 1992.
.KE
.KS
.LP
D. Ferrari, A. Banerjea, and H. Zhang,
\*QNetwork Support for Multimedia - A Discussion of the Tenet Approach\*U,
Technical Report TR-92-072, International Computer Science Institute,
Berkeley, CA,
October 1992.
.KE
.KS
.LP
D. Ferrari and A. Gupta,
\*QResource Partitioning for Real-Time Communication\*U,
.ul
Proc. IEEE Symp. on Global Data Networking,
Cairo, Egypt, December 1993.
.KE
.KS
.LP
D. Ferrari, A. Gupta, M. Moran, and B. Wolfinger,
\*QA Continuous Media Communication Service and its Implementation\*U,
\fIProc. GLOBECOM '92\fP, 8A.02.,
Orlando, Florida, December 1992.
.KE
.KS
.LP
D. Ferrari, J. Ramaekers, and G. Ventre,
\*QClient-Network Interactions in Quality of Service Communication
Environments\*U, \fIProc. 4th IFIP Conf. on High Performance Networking\fR,
pp. E1-1\(enE1-14, Liege, Belgium, December 1992.
.KE
.KS
.LP
T. Fisher,
\*QReal-Time Scheduling Support in ULTRIX-4.2 for Multimedia
Communication\*U,
\fIProc. Third International Workshop on Network and Operating System
Support for Digital Audio and Video\fR, San Diego, November 1992.
.KE
.KS
.LP
A. Gupta, W. Heffner, M. Moran, C. Szyperski,
\*QNetwork Support for
Realtime Multi-Party Applications\*U, Fourth International Workshop
on Network and Operating System Support for Digital Audio and
Video, Lancaster, England, November, 1993.
.KE
.KS
.LP
A. Gupta and M. Moran, 
\*QChannel Groups: A Unifying Abstraction for Specifying
Inter-Stream Relationships\*U, 
Technical Report TR-93-015, 
International Computer Science Institute, Berkeley, CA, March 1993.
.KE
.KS
.LP
K. Keeton, B. Mah, S. Seshan, R. Katz, and D. Ferrari,  \*QProviding
Connection-Oriented Network Services to Mobile Hosts\*U,
\fIProc. of the 1993 USENIX Symposium on Mobile and
Location-Independent Computing\fP, Cambridge, Massachusetts, August 1993.
.KE
.KS
.LP
E. Knightly and G. Ventre,
\*QGalileo: a Tool for Simulation and Analysis of Real-Time Networks\*U,
Technical Report TR-93-008, 
International Computer Science Institute, Berkeley, CA, March 1993;
also in 
\fIProc. IEEE 1993 International Conference on Network 
Protocols\fR, San Francisco, California, October 1993.
.KE
.KS
.LP
B. Mah, 
\*QA Mechanism for the Administration of Real-Time Channels\*U,
MS Report, Technical Report UCB/CSD 93/735, 
University of California, Berkeley, March 1993.
.KE
.KS
.LP
B. Mah, S. Seshan, K. Keeton, R. Katz, and D. Ferrari, \*QProviding
Network Video Service to Mobile Clients\*U, \fIProc.
Fourth Workshop on Workstation Operating Systems\fP, Napa, California,
October 1993.
.KE
.KS
.LP
M. Moran and R. Gusella, 
\*QSystem Support for Efficient Dynamically-Configurable 
Multi-Party Interactive Multimedia Applications\*U, 
\fIProc. Third International Workshop on Network and 
Operating Systems Support for Digital Audio and Video\fP, 
San Diego, November 1992.
.KE
.KS
.LP
E. M\*:uller-Menrad,
\*QDynamic Membership in Real-time Multicast
Groups\*U, MS report, Technische Universitat Muenchen, 1993
(in English). 
.KE
.KS
.LP
C. Parris and A. Banerjea,
\*QAn Investigation into Fault Recovery
in Guaranteed Performance Service Connections\*U,
Technical Report TR-93-054, International Computer Science Institute,
Berkeley, CA, October 1993.
.KE
.KS
.LP
C. Parris and  D. Ferrari,
\*QA Resource Based Pricing Policy for Real-Time Channels in a Packet-Switching
Network\*U,
Technical Report TR-92-018, International Computer Science
Institute, Berkeley, CA, March 1992.
.KE
.KS
.LP
C. Parris, S. Keshav, and  D. Ferrari,
\*QA Framework for the Study of Pricing in Integrated Networks\*U,
Technical Report TR-92-016, International Computer Science
Institute, Berkeley, CA, March 1992.
.KE
.KS
.LP
C. Parris, G. Ventre, and H. Zhang,
\*QGraceful Adaptation of
Guaranteed Performance Service Connections\*U,
\fIProc. IEEE GLOBECOM`93\fR,
Houston, Texas, November 1993.
.KE
.KS
.LP
C. Parris, H. Zhang, and D. Ferrari, 
\*QA Mechanism for Dynamic Re-Routing of Real-Time Channels\*U, 
Technical Report TR-92-053, 
International Computer Science Institute, Berkeley, CA, August 1992.
.KE
.KS
.LP
C. Parris, H. Zhang, and D. Ferrari,
\*QDynamic Management of Guaranteed Performance Multimedia Connections\*U,
to appear in \fIACM/Springer-Verlag Multimedia Systems\fR, 1994.
.KE
.KS
.LP
V. Paxson,
\*QEmpirically-Derived Analytic Models of Wide-Area TCP Connections:
Extended Report\*U,
submitted to \fIIEEE/ACM Transactions on Networking\fR.
.LP
V. Paxson,
\*QGrowth Trends in Wide-Area TCP Connections\*U,
to appear in \fIIEEE Network\fR, 1994.
.KE
.KS
.LP
J. Ramaekers and G. Ventre, 
\*QQuality-of-Service Negotiation in a Real-Time Communication Network\*U, 
Technical Report TR-92-023, 
International Computer Science Institute, Berkeley, CA, April 1992.
.KE
.KS
.LP
J. Ramaekers and G. Ventre, 
\*QClient-Network Interaction in a Real-Time Communication Environment\*U, 
\fIProc. IEEE GLOBECOM '92\fP, 
Orlando, Florida, December 1992.
.KE
.KS
.LP
C. Szyperski and G. Ventre,
\*QA Characterization of Multi-Party Interactive Multimedia Applications\*U, 
\fIHigh-Performance Network Research Report 1/93\fP, 
and Technical Report TR-93-006, 
International Computer Science Institute, Berkeley, CA, January 1993.
.KE
.KS
.LP
C. Szyperski and G. Ventre,
\*QEfficient Multicasting for Interactive Multimedia Applications\*U, 
Technical Report TR-93-017, 
International Computer Science Institute, Berkeley, CA, March 1993.
.KE
.KS
.LP
C. Szyperski and G. Ventre,
\*QEfficient Group Communication with Guaranteed Quality
of Service\*U, \fIProc. Fourth IEEE Workshop on Future Trends in
Distributed Computing
Systems\fR, Lisboa, Portugal, September 1993.
.KE
.KS
.LP
D. Verma and D. Ferrari,
\*QEvaluation of Overflow Probabilities in Resource Management\*U,
Technical Report TR-91-051, International Computer Science Institute,
Berkeley, CA, October 1991; also in
\fIProc. ICC'92\fR,
Chicago, Illinois, 341.6.1-341.6.5, June 1992.
(not available from the file server)
.KE
.KS
.LP
D. Verma and D. Ferrari,
\*QVariation of Traffic Parameters in ATM Networks\*U,
\fIProc. ICC'92\fR,
Chicago, Illinois, 325.2.1-325.2.5, June 1992.
(not available from the file server)
.KE
.KS
.LP
H. Zhang,
\*QService Disciplines For Integrated Services Packet-Switching
Networks\*U, Ph.D dissertation, University of California at 
Berkeley, Nov. 1993.
.KE
.KS
.LP
H. Zhang and D. Ferrari,
\*QImproving Utilization for Deterministic Service
In Multimedia Communication\*U,
submitted for publication, Nov. 1993.
.KE
.KS
.LP
H. Zhang and D. Ferrari,
\*QRate-Controlled Static Priority Queueing\*U, 
Technical Report TR-92-003, International Computer Science Institute,
Berkeley, CA, January 1992;
also in
\fIProc. INFOCOM'93\fP, 
San Francisco, March-April 1993.
.KE
.KS
.LP
H. Zhang and D. Ferrari,
\*QProviding Deterministic Guarantees For Bursty 
Traffic\*U, to appear in \fIProc. Workshop On the Role of Real-Time in 
Multimedia/Interactive Computing Systems, IEEE Real-Time Systems 
Symposium'93\fR,  Raleigh-Durham NC, Nov. 1993.
.KE
.KS
.LP
H. Zhang and T. Fisher, 
\*QPreliminary Measurements of the Real-Time Internet Protocol\*U, 
\fIProc. Third International Workshop on Network 
and Operating System Support for Digital Audio and Video\fP, 
San Diego, November 1992.
.KE
.KS
.LP
H. Zhang and E. Knightly,
\*QProviding End-to-End Statistical Guarantees
Using Interval Dependent Stochastic Models\*U,
submitted for
publication,  Oct. 1993.
.KE