close this section of the libraryftp://tenet.berkeley.edu (167)
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/Gusella90.ps, 19901011
Characterizing the Variability of Arrival Processes with Indices of Dispersion Riccardo Gusella International Computer Science Institute 1947 Center Street, Suite 600 Berkeley, California 94704 TR-90-051 September 26, 1990
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/DamVer89b.ps, 19901031
Multiplexing Real-Time Channels Spiridon Damaskos Gesellschaft fur Mathematik und Datenverarbeitung mbH Berlin, West Germany Dinesh C.Verma Computer Science Division EECS Department University of California and International Computer Science Institute Berkeley, California
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/FerVer90b.ps, 19901031
BUFFER SPACE ALLOCATION FOR REAL-TIME CHANNELS IN A PACKET-SWITCHING NETWORK Domenico Ferrari and Dinesh C. Verma Computer Science Division Department of Electrical Engineering and Computer Sciences University of California and International Computer Science Institute Berkeley, California, U.S.A.
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/TodVer90b.ps, 19901031
Delay Constraints and Admission Control in ATM networks
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/FerVer90a.ps, 19901031
A Scheme for Real-Time Channel Establishment in Wide-Area Networks Domenico Ferrari, FELLOW, IEEE, and Dinesh C. Verma
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/DamVer89a.ps, 19901031
Fast Establishment of Real-Time Channels Spiridon Damaskos Gesellschaft fur Mathematik und Datenverarbeitung mbH Berlin, West Germany Dinesh C.Verma Computer Science Division EECS Department University of California and International Computer Science Institute Berkeley, California
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/FerVer90c.ps, 19901105
REAL-TIME COMMUNICATION IN A PACKET-SWITCHING NETWORK Domenico Ferrari and Dinesh C. Verma Computer Science Division Department of Electrical Engineering and Computer Sciences University of California and International Computer Science Institute Berkeley, California, U.S.A.
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/SiAgKe90.ps, 19901107
Deterministic Analysis of Flow and Congestion Control Policies in Virtual Circuits Samar Singh 1 Department of Computer Science and Engineering, Indian Institute of Technology, New Delhi - 110016, India. Ashok K. Agrawala Department of Computer Science, University of Maryland, College Park, MD 20742,
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Ferrari90.ps, 19901114
CLIENT REQUIREMENTS FOR REAL-TIME COMMUNICATION SERVICES Domenico Ferrari Computer Science Division Department of Electrical Engineering and Computer Sciences University of California and International Computer Science Institute Berkeley, California, U.S.A.
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Ferrari89.ps, 19910111
Real-Time Communication in Packet-Switching Wide-Area Networks Domenico Ferrari Computer Science Division EECS Department University of California and International Computer Science Institute Berkeley, California
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Keshav90.ps, 19910225
REAL Users Manual This manual provides a tutorial introduction to setting up a simulation in REAL. If you want to modify REAL you should refer to the REAL Programmers Manual, but read this first. 1. General Orientation The simulator takes as input a scenario, which is a description of network topology,
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/FerVer90d.ps, 19910314
QUALITY OF SERVICE IN ATM NETWORKS Dinesh C. Verma Computer Science Division Department of Electrical Engineering and Computer Sciences University of California and International Computer Science Institute Berkeley, California, U.S.A.
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/VeZhFe91.ps, 19910314
Delay Jitter Control for Real-Time Communication in a Packet Switching Network Dinesh C. Verma Hui Zhang Domenico Ferrari Computer Science Division Department of Electrical Engineering and Computer Sciences University of California at Berkeley & International Computer Science Institute Berkeley,
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/Lowery91.ps, 19910325
Protocols for Providing Performance Guarantees in a Packet- Switching Internet Carlyn M. Lowery Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Lowery91.ps, 19910325
Protocols for Providing Performance Guarantees in a Packet- Switching Internet Carlyn M. Lowery Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Caceres91.ps, 19910725
Efficiency of Asynchronous Transfer Mode Networks in Transporting Wide-Area Data Traffic Ramo n Ca ceres Computer Science Division University of California Berkeley CA 94720 ramon@tenet.berkeley.edu
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/WolMor91.ps, 19911111
A Continuous Media Data Transport Service and Protocol for RealTime Communication in High Speed Networks * Bernd Wolfinger 1 Mark Moran The Tenet Group Computer Science Division, Department of EECS, University of California, Berkeley and International Computer Science Institute Berkeley, CA 94720, USA.
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/KaKaKe90.ps, 19920709
Rate Controlled Servers for Very High-Speed Networks C. R. Kalmanek and H. Kanakia AT&T Bell Laboratories Murray Hill, NJ 07974 S. Keshav University of California, Berkeley Berkeley, CA 94720
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/KaKaKe90.ps, 19920709
Rate Controlled Servers for Very High-Speed Networks C. R. Kalmanek and H. Kanakia AT&T Bell Laboratories Murray Hill, NJ 07974 S. Keshav University of California, Berkeley Berkeley, CA 94720
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Keshav91b.ps, 19920709
On the Efficient Implementation of Fair Queueing Srinivasan Keshav Computer Science Division, Department of EECS, University of California, Berkeley, Berkeley, CA 94720, USA.
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/Keshav91b.ps, 19920709
On the Efficient Implementation of Fair Queueing Srinivasan Keshav Computer Science Division, Department of EECS, University of California, Berkeley, Berkeley, CA 94720, USA.
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/Keshav91a.ps, 19920709
A Control-Theoretic Approach to Flow Control Srinivasan Keshav Computer Science Division, Department of EECS, University of California, Berkeley, and International Computer Science Institute Berkeley, CA 94720, USA. keshav@tenet.Berkeley.EDU
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Keshav91a.ps, 19920709
A Control-Theoretic Approach to Flow Control Srinivasan Keshav Computer Science Division, Department of EECS, University of California, Berkeley, and International Computer Science Institute Berkeley, CA 94720, USA. keshav@tenet.Berkeley.EDU
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/KeAgSi90.ps, 19920714
Design and Analysis of a Flow Control Algorithm for a Network of Rate Allocating Servers Srinivasan Keshava, Ashok K. Agrawalab and Samar Singhc aComputer Science Division, Department of EECS, University of California, Berkeley, Berkeley, CA 94720, USA bDepartment of Computer Science, University of
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/KeAgSi90.ps, 19920714
Design and Analysis of a Flow Control Algorithm for a Network of Rate Allocating Servers Srinivasan Keshava, Ashok K. Agrawalab and Samar Singhc aComputer Science Division, Department of EECS, University of California, Berkeley, Berkeley, CA 94720, USA bDepartment of Computer Science, University of
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/Caceres89a.ps, 19921105
Separating Abstraction from Implementation in Communication Network Design Ramo n Ca ceres Computer Science Division University of California Berkeley, California 94720
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/BanMah91.ps, 19921105
The Real-Time Channel Administration Protocol Anindo Banerjea email: banerjea@tenet.berkeley.edu Bruce A. Mah email: bmah@tenet.berkeley.edu The Tenet Group Computer Science Division University of California, Berkeley and International Computer Science Institute Berkeley, California
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Caceres89b.ps, 19921105
Measurements of Wide Area Internet Traffic Ramo n Ca ceres Computer Science Division University of California Berkeley CA 94720 ramon@berkeley.edu
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/CaDaJaMi91a.ps, 19921105
Proceedings of ACM SIGCOMM 91 1 Characteristics of Wide-Area TCP/IP Conversations Ram n C ceres Peter B. Danzig* Sugih Jamin* Danny J. Mitzel* *Computer Science Department, University of Southern California, Los Angeles, California 90089-0782 Computer Science Division, University of California,
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/Ferrari92.ps, 19921109
REAL-TIME COMMUNICATION IN AN INTERNETWORK Domenico Ferrari The Tenet Group Computer Science Division Department of Electrical Engineering and Computer Sciences University of California and International Computer Science Institute Berkeley, California, U.S.A.
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/MorGus92.ps, 19921119
System Support for Efficient Dynamically- Configurable Multi-Party Interactive Multimedia Applications Mark Moran1 and Riccardo Gusella2 1 The Tenet Group Computer Science Division, University of California, Berkeley and International Computer Science Institute Berkeley, CA 94720 2 Hewlett-Packard
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/FeRaVe92.ps, 19921119
Client-Network Interactions in Quality of Service Communication Environments1 Domenico Ferrari, Jean Ramaekers2 and Giorgio Ventre The Tenet Group, Computer Science Division, Department of EECS, University of California, Berkeley, and International Computer Science Institute, 1947 Center Street, Suite
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/PaZhFe92.ps, 19921119
1 A Mechanism for Dynamic Re-routing of Real-time Channels Colin Parris Hui Zhang Domenico Ferrari 571 Evans Hall Computer Science Division University of California at Berkeley Berkeley, CA 94720 (510)834-8234 (phone) (510)643-7684 (fax)
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/ZhaFis92.ps, 19921119
Preliminary Measurement of the RMTP/RTIP Hui Zhang and Tom Fisher hzhang, fisher@tenet.Berkeley.EDU The Tenet Group Computer Science Division Department of Electrical Engineering and Computer Sciences University of California Berkeley, California 94720 and International Computer Science Institute 1947
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/Faller92.ps, 19921119
Measuring the Latency Time of Real-Time Unix-like Operating Systems Newton Faller TR-92-037 June 1992
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/PaKeFe92.ps, 19921119
A Framework for the Study of Pricing in Integrated Networks Colin Parris Tenet Group, Computer Science Division, UC Berkeley and International Computer Science Institute, Berkeley, CA 94720 Srinivasan Keshav AT&T Bell Laboratories 600 Mountain Ave., Murray Hill, NJ 07974 Domenico Ferrari Tenet Group,
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/Fisher92.ps, 19921119
Real-Time Scheduling Support in Ultrix-4.2 for Multimedia Communication Tom Fisher fisher@tenet.Berkeley.EDU The Tenet Group Computer Science Division Department of Electrical Engineering and Computer Sciences University of California Berkeley, California 94720 and International Computer Science
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/RamVen92b.ps, 19921119
Client-Network Interaction in a Real-Time Communication Environment Jean Ramaekersy Giorgio Ventre The Tenet Group International Computer Science Institute and Computer Science Division University of California, Berkeley 1947 Center Street, Suite 600 Berkeley, CA, 94704
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/FeBaZh92.ps, 19921119
Network Support For Multimedia A Discussion of the Tenet Approach Domenico Ferrari, Anindo Banerjea, and Hui Zhang Tenet Group Computer Science Division University of California at Berkeley The International Computer Science Institute, Berkeley, CA TR-92-072 November 1992
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/FeGuMoWo92.ps, 19930114
A CONTINUOUS MEDIA COMMUNICATION SERVICE AND ITS IMPLEMENTATION 1;2 Domenico Ferrari, Amit Gupta, Mark Moran, Bernd Wolfinger 3 Computer Science Division Department of EECS University of California Berkeley, CA 94270 and International Computer Science Institute 1947 Center Street Berkeley, CA 94704,
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Ferrari91a.ps, 19930114
DISTRIBUTED DELAY JITTER CONTROL IN PACKET-SWITCHING INTERNETWORKS Domenico Ferrari The Tenet Group University of California and International Computer Science Institute Berkeley, California, U.S.A. Address: Computer Science Division EECS Department University of California Berkeley, CA 94720 ph.
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/GilGus91.ps, 19930114
SPIE conference on Visual Communications and Image Processing, 10-13 November 1991, Boston 1 Motion Video Coding for Packet-SwitchingNetworks |An Integrated Approach Michael Gilge and Riccardo Gusella y International Computer Science Institute 1947 Center Street #600, Berkeley, California 94704 email:
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/TodVer90a.ps, 19930126
Resource Allocation and Delay Constraints in ATM networks Petia Todorova Research Center for Open Communication Systems (FOKUS) Hardenbergplatz 2 D-1000 Berlin 12 FR Germany Phone: 49-30-25499-251 Telefax:49-30-25499-202 Dinesh Verma Computer Science Department, 571 Evans Hall, University of California,
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/SzyVen93a.ps, 19930126
A Characterization of Multi-Party Interactive Multimedia Applications Clemens Szyperski and Giorgio Ventre The Tenet Group International Computer Science Institute and Computer Science Division Department of EECS University of California, Berkeley e-mail: fszyperski,ventreg@icsi.berkeley.edu High
open this document and view contentsftp://tenet.berkeley.edu//private/old/ZhaFer92.ps.Z, 19930127
Rate-Controlled Static-Priority Queueing Hui Zhang Domenico Ferrari hzhang, ferrari@tenet.Berkeley.EDU Computer Science Division University of California at Berkeley Berkeley, CA 94720 TR-92-003 August 1992
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Mah93.ps, 19930408
A Mechanism for the Administration of Real-Time Channels 1 A Mechanism for the Administration of Real-Time Channels1 Bruce A. Mah bmah@tenet.Berkeley.EDU The Tenet Group University of California at Berkeley and International Computer Science Institute
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/BanKes93.ps, 19930421
Queueing Delays in Rate Controlled ATM Networks Anindo Banerjea CS Division, University of California, Berkeley, CA 94720 and International Computer Science Institute, Berkeley Srinivasan Keshav AT&T Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ 07974
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/ParFer92.ps, 19930521
A RESOURCE BASED PRICING POLICY FOR REAL-TIME CHANNELS IN A PACKET-SWITCHING NETWORK. Colin Parris and Domenico Ferrari The Tenet Group Computer Science Division Department of Electrical Engineering and Computer Sciences University of California and International Computer Science Institute Berkeley,
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/SzyVen93c.ps, 19930623
Efficient Group Communication with Guaranteed Quality of Service Clemens Szyperski Giorgio Ventrey The Tenet Group International Computer Science Institute and Computer Science Division University of California, Berkeley 1947 Center Street, Suite 600 Berkeley, CA, 94704
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/KeMaSeKaFe93.ps, 19930701
Providing Connection-Oriented Network Services to Mobile Hosts Page 1 Providing Connection-Oriented Network Services to Mobile Hosts1 Kimberly Keeton, Bruce A. Mah, Srinivasan Seshan, Randy H. Katz, Domenico Ferrari {kkeeton,bmah,ss,randy,ferrari}@CS.Berkeley.EDU Computer Science Division University of
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/MaSeKeKaFe93.ps, 19930823
Providing Network Video Service to Mobile Clients Page 1 Providing Network Video Service to Mobile Clients1 Bruce A. Mah, Srinivasan Seshan, Kimberly Keeton, Randy H. Katz, Domenico Ferrari {bmah,ss,kkeeton,randy,ferrari}@CS.Berkeley.EDU Computer Science Division University of California at Berkeley
open this document and view contentsftp://tenet.berkeley.edu//pub/irc/tutorial/IRCprimer1.1.ps, 19930920
A short IRC primer Nicolas Pioch, (Nap on IRC) Text conversion by Owe Rasmussen (Sorg) Edition 1.1b, February 28, 1993.
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Ferrari91b.ps, 19931103
DESIGN AND APPLICATIONS OF A DELAY JITTER CONTROL SCHEME FOR PACKET-SWITCHING INTERNETWORKS Domenico Ferrari The Tenet Group University of California and International Computer Science Institute Berkeley, California, U.S.A.
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Paxson93a.ps, 19931116
Empirically-Derived Analytic Models of Wide-Area TCP Connections: Extended Report Vern Paxson Lawrence Berkeley Laboratory and EECS Division, University of California, Berkeley 1 Cyclotron Road Berkeley, CA 94720 vern@ee.lbl.gov LBL-34086 June 15, 1993
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/FerGup93.ps, 19931116
Resource Partitioning for Real-time Communication Domenico Ferrari Amit Gupta Berkeley, California USA
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Paxson93b.ps, 19931123
Growth Trends in Wide-Area TCP Connections Vern Paxson Lawrence Berkeley Laboratory and EECS Division, University of California, Berkeley 1 Cyclotron Road Berkeley, CA 94720 vern@ee.lbl.gov November 16, 1993
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Mueller93.ps, 19931126
TECHNISCHE UNIVERST T M NCHEN FAKULT T ELEKTROTECHNIK Diplomarbeit Thema Dynamic Membership in Real-Time Multicast Groups Vorgelegt von Eberhard M ller-Menrad Geboren am 5. April 1968 in Stuttgart zur Erlangung des akademischen Grades Diplomingenieur (Dipl.-Ing.) Erstellt in The Tenet Group
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/KniVen93.ps, 19931129
Galileo: a Tool for Simulation and Analysis of Real-Time Networks Edward W. Knightly and Giorgio Ventre International Computer Science Institute, Berkeley, CA 94704 and EECS Department, University of California, Berkeley, CA 94720
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Ferrari93.ps, 19931129
dprop,n-1 tn-1,kservern-1dprop,ntn,kserverndtn+1,kservern+1prop,n+1 ntroduction Admission control for connections is now universally recognized as a necessary component of a real-time communication service. Without a limitation of the This wor was supported by the National Science Foundation and the
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/ParBan93.ps, 19931129
An Investigation into Fault Recovery in Guaranteed Performance Service Connections Colin J. Parris and Anindo Banerjea. Tenet Group Computer Science Division, UC Berkeley and International Computer Science Institute, 1947 Center St. , Suite 600 Berkeley, CA 94704-1105. Tel: (510)-642-8905
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/PaVeZh93a.ps, 19931129
Graceful Adaptation of Guaranteed Performance Service Connections Colin J. Parris, Giorgio Ventrey and Hui Zhang The Tenet Group Computer Science Division, Department of EECS University of California, Berkeley and International Computer Science Institute 1947 Center Street, Suite 600 Berkeley, CA 94704.
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/ZhaFer93a.ps, 19931129
Providing Deterministic Guarantees For Bursty Traffic (Extended Abstract) Hui Zhang and Domenico Ferrari hzhang,ferrari@tenet.ICSI.Berkeley.EDU The Tenet Group Computer Science Division University of California at Berkeley and International Computer Science Institute 1 Introduction High speed networking
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/ZhaKes91.ps, 19931215
In Proceedings of ACM SIGCOMM'91 Comparison of Rate-Based Service Disciplines Hui Zhang and Srinivasan Keshav Computer Science Division University of California at Berkeley Berkeley, CA 94720
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/ZhaFer92.ps, 19931215
In Proceedings of IEEE INFOCOM'93 Rate-Controlled Static-Priority Queueing Hui Zhang and Domenico Ferrari hzhang, ferrari@tenet.Berkeley.EDU Computer Science Division University of California at Berkeley Berkeley, CA 94720
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/Zhang93.ps, 19940104
Service Disciplines For Packet-Switching Integrated-Services Networks Copyright c 1993 by Hui Zhang Service Disciplines For Packet-Switching Integrated-Services Networks by Hui Zhang B.S. (Beijing University) 1988 M.S. (Rensselaer Polytechnic Institute) 1989 A dissertation submitted in partial
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Zhang93.ps, 19940104
Service Disciplines For Packet-Switching Integrated-Services Networks Copyright c 1993 by Hui Zhang Service Disciplines For Packet-Switching Integrated-Services Networks by Hui Zhang B.S. (Beijing University) 1988 M.S. (Rensselaer Polytechnic Institute) 1989 A dissertation submitted in partial
open this document and view contentsftp://tenet.berkeley.edu//pub/doc/pet.ps, 19940208
/da/aa/DOC/PET-FM/pet.doc 2/2 2/4/94 How will PET be tested Priority Encoding Transmission will be tested in the interworking of experimental high-performance gigabit testbeds, public commercial ATM services, private LAN networks, and a variety of stations. The Bay Area Gigabit users group network
open this document and view contentsftp://tenet.berkeley.edu//pub/doc/pat.ps, 19940208
/da/aa/DOC/PAT-FM/pat.doc 1/1 1/31/94 INTERNATIONAL COMPUTER SCIENCE INSTITUTE 1947 Center St. Suite 600 Berkeley, California 94704-1198 Phone (510) 643-9153 FAX (510) 643-7684 Further Information: Copyright 1994, ICSI - All rights reserved Phone Assisted Teleconference (PAT) What is PAT PAT (Phone
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Tan94.ps.Z, 19940216
Efficient Signaling Algorithms See-Mong Tan stan@cs.uiuc.edu Department of Computer Science University of Illinois at Urbana-Champaign 1304 W. Springfield Ave., Urbana, IL 61801-2987 Introduction Switched virtual circuits require a call setup procedure. Traditional signaling follows the linear call
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Patel94-5.ps.Z, 19940216
Conclusion 1. Odd-even parameter interpolation gives better result but increases the packetizing delay by a factor of two. 2. Short-term filter parameters are perceptually more important and should be given highest priority followed by long-term parameters and excitation parameters. Future Work 1.
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Patel94-1.ps.Z, 19940216
CELP (Code Excited Linear Prediction) Coder 1. Low Bit Rate Coding (4.8-8kbps) 2. Frame Oriented Technique 3. Based on ffl Analysis-by-synthesis Algorithm ffl Perceptually Weighted VQ ffl Linear Prediction CELP Coding in ATM Networks Jayesh Patel Center for Computer Aids for Industrial Productivity
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Mah94.ps.Z, 19940216
Measurements and Observations of IP Multicast Traffic Page 1 of 16 Measurements and Observations of IP Multicast Traffic Bruce A. Mah bmah@CS.Berkeley.EDU The Tenet Group University of California at Berkeley and International Computer Science Institute 14 February 1994 XUNET Student Meeting, Chicago, IL
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Patel94-4.ps.Z, 19940216
CELP CoderClass 1. . . .ATM CellSegmentationSegmentationSegmentationATM CellATM CellClass 2Class iATMMultiplexingTo NetworkSpeech
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Patel94-3.ps.Z, 19940216
Priority CELP Coding ffl Inherent structure of speech signals and the way in which they are perceived allows for some loss of information with out significant quality impairment. ffl The quality of received speech can be maintained by classifying speech coder parameter and coding them in a way that will
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Jackson94.ps.Z, 19940216
Simple Network Management Protocol developments in XUNET Alden W. Jackson Sandia National Laboratories P.O. Box 969, M/S 9214 Livermore, CA 94551-0969 Email: awjacks@ca.sandia.gov Feb 1994 Sandia National Laboratory Networking and Communications Contents 1 Motivation 2 2 Simple Network Management
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Patel94-2.ps.Z, 19940216
CELP Encoder Stochastic Codebook 1234.....L v(n)- Gain G - Long Term Synthesis Filter 1P (z) - r(n) Short Term Synthesis Filter 1A(z) - ^s(n)- OEAE Oo P Original s(n) + Perceptual Weighting Filter W (z) = A(z) A(z=fl) oe Square and Average oeoe Minimize Error G Index k CELP Decoder Stochastic Codebook
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Knightly94.ps.Z, 19940217
Providing End-to-End Statistical Performance Guarantees with Bounding Interval Dependent Stochastic Models Hui Zhangy and Ed Knightlyz y Lawrence Berkeley Laboratories z UC Berkeley and Sandia National Laboratories February 14, 1994 1 Outline ffl Problem { QoS guarantees { Statistical and deterministic
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Matragi94.ps.Z, 19940217
Jitter Analysis in ATM Networks 9 of 9 Wassim Matragi Columbia University Possible Extensions / Future Work1 Relax the mini-priority service restriction for the p-customers Relax the regularity of the p-customers to include more elaborate traffic models Relax the i.i.d nature of the background traffic
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Nahrstedt94.ps.Z, 19940218
Experimental Study of Issues in End-to-End QoS Klara Nahrstedt and Jonathan Smith Distributed System Laboratory Computer Science Department University of Pennsylvania e-mail: klara@aurora.cis.upenn.edu
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Armstrong94.ps.Z, 19940218
Metric Gb/s on XUNET West Presented at the XUNET Student Meeting Chicago February 13, 1994 by Gary Armstrong LLNL Principal Investigator: Dr. William J. Lennon LLNL/ATP-XUNET/GHA 1994rev 2 XUNET The Advanced Telecommunication Program (ATP) at LLNL LLNL Overview ATP LAN/WAN Activities Fibre Channel
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Putzolu94.ps.Z, 19940221
Figure 6: Current and Past HXA Throughput HiPPI Packet Size Mbits/S Throughput 10 20 30 40 50 60 70 1 KByte 2 KByte 4 KByte 8 KByte 16 KByte 32 KByte 64 KByte XUNET Switch HiPPI Packets (HiPPI Cable) HiPPI Source HiPPI Packets (HiPPI Cable) Hilarius (HXA Adapter #2) XUNET Frames (Fibre) HiPPI
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Faber94.ps.Z, 19940223
Dynamic Time Windows: New Developments in Quality of Service Provision and Experimental Results Ted Faber Lawrence Landweber University of Wisconsin at Madison faber@cs.wisc.edu and landweber@cs.wisc.edu Outline g Dynamic Time Windows (DTW) Goals and Philosophy g DTW Overview g Quality of Service and
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Gupta94.ps.Z, 19940223
Xunet student meeting: Design of Scheme 2 Page: 1 of 22 Network Support for Multiparty Multimedia Applications Design of Scheme 2 A Multicast Realtime Protocol Scheme Amit Gupta amit@cs.Berkeley.EDU Tenet Group University of California at Berkeley, and International Computer Science Institute Feb 14,
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Heffner94.ps.Z, 19940223
TENET SUITE 2 - XUNET STUDENT MEETING 94 Page: 1 of 18 The Architecture of Realtime Network Protocols - Tenet Suite 2 By Wendy Heffner International Computer Science Institute University of California at Berkeley (wendyh@tenet.Berkeley.EDU) TENET SUITE 2 - XUNET STUDENT MEETING 94 Page: 2 of 18 Outline
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Patel94.ps.Z, 19940223
Conclusion 1. Odd-even parameter interpolation gives better result but increases the packetizing delay by a factor of two. 2. Short-term filter parameters are perceptually more important and should be given highest priority followed by long-term parameters and excitation parameters. Future Work 1.
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/DaJaCa92.ps, 19940225
An Empirical Workload Model for Driving Wide-Area TCP/IP Network Simulations Peter B. Danzig* Sugih Jamin* Ram n C ceres Danny J. Mitzel* Deborah Estrin* *Computer Science Department, University of Southern California, Los Angeles, California 90089-0781 Computer Science Division, University of
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/ZhaFer93b.ps, 19940228
To appear in 1994 IEEE International Conference on Multimedia Computing and Systems. Improving Utilization for Deterministic Service In Multimedia Communication Hui Zhang Domenico Ferrari Lawrence Berkeley Laboratory University of California at Berkeley MailStop: 50B-229 and Berkeley, CA 94720
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Chen94.ps.Z, 19940301
California New MexicoS andia National Laboratories Simulation Results of TCP Performance over ATM with Flow Control and Selective Cell-drop Sandia National Laboratories, California Networking and Communications Department Chien Fang Helen Chen Jim Hutchins February 13, 1994 California New Mexico San dia
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Hidano94.ps.Z, 19940301
A New Approach to Resource Allocation in ATM Networks and its Experiments on the Xunet Testbed Fukiko Hidano University of California, Berkeley Outline 1. Resource Allocation Issues 2. General Idea 3. Resource Allocation 4. Optimal Allocation Scenario 5. Call Demands 6. Implementation 7. Experiments 8.
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/xunet94/Aneroussis94.ps.Z, 19940301
1 The COMET Group March 1, 1994 Columbia University - Center for Telecommunincations Research An Architecture for Performance and Configuration Management on Xunet Nikos G. Aneroussis Department of Electrical Engineering and Center for Telecommunications Research Columbia University New York, NY
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/ilp94/Mah-Ilp94.ps.Z, 19940303
Multicast Multimedia Traffic and the Design of Real-Time Protocols Page 1 of 16 Multicast Multimedia Traffic and the Design of Real-Time Protocols Bruce A. Mah bmah@tenet.Berkeley.EDU The Tenet Group University of California at Berkeley and International Computer Science Institute 16th Annual ILP
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/ilp94/Banerjea-Ilp94.ps.Z, 19940304
Fault Recovery for Realtime Networks Anindo Banerjea banerjea@tenet.berkeley.edu The Tenet Group University of California at Berkeley and the International Computer Science Institute. ILP Conference March 10, 1994. Anindo Banerjea Fault Management of Realtime Channels 2 Outline g Motivation - why fault
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/ilp94/Gupta-Ilp94.ps.Z, 19940304
ILP conference: A Multicast-based Real-time Protocol Suite Page: 1 of 16 Design of A Multicast-based Real-time Protocol Suite Amit Gupta amit@tenet.Berkeley.EDU The Tenet Group University of California at Berkeley and International Computer Science Institute 16th Annual ILP Conference March 10, 1994 A
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/ilp94/Zhang-Ilp94.ps.Z, 19940304
Improving Utilization for Deterministic Real-time Service Hui Zhang The Tenet Group University of California at Berkeley and International Computer Science Institute and Information and Computing Sciences Division Lawrence Berkeley Laboratory A THE UNIVERSITY OF CALIFORNIA 1868 LETTHEREBELIGHT I ILP
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/ilp94/Knightly-Ilp94.ps.Z, 19940309
Providing End-to-End Statistical Performance Guarantees with Bounding Interval Dependent Stochastic Models Edward W. Knightly knightly@tenet.berkeley.edu The Tenet Group University of California at Berkeley and International Computer Science Institute and Sandia National Laboratories A THE UNIVERSITY OF
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/ilp94/Parris-Ilp94.ps.Z, 19940318
Page 19 of 19 Real-Time Network Management: On the Monitoring and Control of Guaranteed Performance Conclusion Current guaranteed performance schemes are rigid To provide flexibility, connection management can be used to control and monitor connections Control achieved by using Dynamic Connection
open this document and view contentsftp://tenet.berkeley.edu//pub/talks/ilp94/Hidano-Ilp94.ps.Z, 19940326
Admission Control and Real-Time Channel Establishment in an ATM Testbed Fukiko Hidano fukiko@tenet.berkeley.edu The Tenet Group University of California at Berkeley and International Computer Science Institute e 16th Annual ILP Conference March 10, 1994 A THE UNIVERSITY OF CALIFORNIA 1868
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/PaxFlo94a.ps, 19940503
Draft Wide-Area Traffic: The Failure of Poisson Modeling Vern Paxson and Sally Floyd Lawrence Berkeley Laboratory and EECS Division, University of California, Berkeley 1 Cyclotron Road, Berkeley CA 94720 vern@ee.lbl.gov, floyd@ee.lbl.gov To appear in SIGCOMM '94
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Digenova93.ps, 19940523
Comunicazione Real-Time su Reti di Calcolatori: Introduzione ed Analisi dell'Approccio Tenet di Berkeley. Pasquale Di Genova 9 December 1993 Contents 1 Overview of digital high-speed networks and their multimedia applications 14 1.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/Digenova93.ps, 19940523
Comunicazione Real-Time su Reti di Calcolatori: Introduzione ed Analisi dell'Approccio Tenet di Berkeley. Pasquale Di Genova 9 December 1993 Contents 1 Overview of digital high-speed networks and their multimedia applications 14 1.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/ZhaFer94.ps, 19940606
To appear in Journal of High Speed Networking Rate-Controlled Service Disciplines Hui Zhang Lawrence Berkeley Laboratory 1 Cyclotron Road, MS: 50B-2239 Berkeley, CA 94720 Domenico Ferrari Computer Science Division University of California at Berkeley Berkeley, CA 94720
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Widyono94a.ps, 19940607
The Design and Evaluation of Routing Algorithms for Real-time Channels Ron Widyono widyono@cs.Berkeley.EDU Tenet Group University of California at Berkeley, & International Computer Science Institute TR-94-024 June 1994
open this document and view contentsftp://tenet.berkeley.edu//pub/software/LDIBftp.README.ps, 19940627
/tmp_mnt/n/tenet/db/users/lienhart/LDIB/Documents/Flyer.doc 1/2 6/14/94 INTERNATIONAL COMPUTER SCIENCE INSTITUTE 1947 Center St. Suite 600 Berkeley, California 94704-1198 Phone (510) 643-9153 FAX (510) 643-7684 Further Information: channel may request such modification at anytime. The LDIB is the first
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/AlBlEdLu94.ps, 19940830
Priority Encoding Transmission Andres Albanese Johannes Blomer Jeff Edmondsy Michael Lubyz TR-94-039 August 1994 International Computer Science Institute 1947 Center Street Berkeley, CA 94704 e-mail: faa, bloemer, edmonds, lubyg@icsi.berkeley.edu Partially supported by NSF operating grant CCR-9304722,
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/AlBlEdLu94.ps, 19940830
Priority Encoding Transmission Andres Albanese Johannes Bl omer Jeff Edmondsy Michael Lubyz TR-94-039 August 1994 International Computer Science Institute 1947 Center Street Berkeley, CA 94704 e-mail: faa, bloemer, edmonds, lubyg@icsi.berkeley.edu Partially supported by NSF operating grant CCR-9304722,
open this document and view contentsftp://tenet.berkeley.edu//pub/users/whetten/FDDQ/FDDQ_LCN_1.ps, 19940830
The Packet Starvation Effect in CSMA/CD LANs and a Solution Brian Whetten, Stephen Steinberg, Domenico Ferrari University of California at Berkeley
open this document and view contentsftp://tenet.berkeley.edu//pub/users/whetten/RMP/RMP_v1.ps, 19940830
A HIGH PERFORMANCE TOTALLY ORDERED MULTICAST PROTOCOL Brian Whetten Simon Kaplan University of California at Berkeley University of Illinois at Urbana-Champaign whetten@cs.berkeley.edu kaplan@cs.uiuc.edu
open this document and view contentsftp://tenet.berkeley.edu//pub/users/whetten/FDDQ/FDDQ_LCN_2.ps, 19940830
must see the bus be empty for two times the maximum propagation time plus the minimum length of time needed to detect a packet plus the minimum space between packets. This makes an empty slot always cost 64 bytes. The third diagram shows a full slot, which incurs the cost of sending a new minimum length
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/Hoffmann94.ps, 19941001
OBJECTIVES AND TERMS OF REFERENCE The objective of this thesis is to explore the future potential of multimedia applications in business and public sector services. The topic is related to Information Management. Consequently, two broad areas have to be considered: 1. Managerial aspects of Information
open this document and view contentsftp://tenet.berkeley.edu//pub/users/whetten/RMP/Layers/arch.ps, 19941020
RMP Architecture RMP Packet based Variable ordering, reliability and atomicity Multicast groups, optional unicast members Multi-RPC Flow and congestion control Membership Service Membership of rings Removal of faulty sites Mutually exclusive locks Optional implicit naming Domain (2nd level grouping)
open this document and view contentsftp://tenet.berkeley.edu//pub/users/whetten/RMP/Layers/mess_api.ps, 19941020
The Reliable Multicast Protocol Ordered on its packets, and do the segmentation itself. Messaging Layer Application Programming Interface Packet filtering is done at two levels. First, multiple client objects can be instantiated, and each client can join its own set of groups. Incoming packets are then
open this document and view contentsftp://tenet.berkeley.edu//pub/users/whetten/RMP/RMP_api.ps, 19941109
The Reliable Multicast Protocol Application Programming Interface Todd Montgomery and Brian Whetten tmont@cerc.wvu.edu, whetten@cs.berkeley.edu Document Version 1.4, 11/9/94 Introduction This document describes the Application Programming Interface for the Berkeley/WVU implementation of the Reliable
open this document and view contentsftp://tenet.berkeley.edu//pub/users/whetten/RMP/RMP_messaging_api.ps, 19941109
The Reliable Multicast Protocol Messaging Layer Application Programming Interface Brian Whetten and Todd Montgomery whetten@cs.berkeley.edu, tmont@cerc.wvu.edu Document Version 1.2, 11/9/94 Introduction This document describes the Application Programming Interface for the Messaging Layer of the Reliable
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/KnMiZh94.ps, 19941123
Appeared in Proceedings of WORDS '94 Deterministic Characterization and Network Utilizations for Several Distributed Real-time Applications Edward W. Knightly Robert F. Mines Hui Zhang UC Berkeley Sandia National Labs Lawrence Berkeley Lab
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/GupFer94.ps, 19941128
INTERNATIONAL COMPUTER SCIENCE INSTITUTE I 1947 Center St. ffl Suite 600 ffl Berkeley, California 94704-1198 ffl (510) 643-9153 ffl FAX (510) 643-7684 Resource partitioning for multi-party real-time communication Amit Gupta and Domenico Ferrari famit,ferrarig@tenet.berkeley.edu Tenet Group University of
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Mah94.ps, 19950131
Measurements and Observations of IP Multicast Traffic 1 Measurements and Observations of IP Multicast Traffic Bruce A. Mah bmah@CS.Berkeley.EDU The Tenet Group University of California at Berkeley and International Computer Science Institute
open this document and view contentsftp://tenet.berkeley.edu//pub/users/whetten/RMP/RMP_v1_thesis.ps, 19950201
UNIVERSITY OF ILLINOIS AT CHAMPAIGN-URBANA THE MESSAGE BUS II AND THE RELIABLE MULTICAST PROTOCOL A DISSERTATION SUBMITTED TO THE FACULTY OF THE DIVISION OF COMPUTER SCIENCE IN CANDIDACY FOR THE DEGREE OF MASTER OF SCIENCE DEPARTMENT OF ENGINEERING BY BRIAN WHETTEN CHAMPAIGN-URBANA, ILLINOIS FEBRUARY,
open this document and view contentsftp://tenet.berkeley.edu//pub/users/whetten/FastTCP/FastIP.ps, 19950220
A Fast Track Architecture for High Performance, FaultTolerant Reliable Distributed Group Communication Brian Whetten University of California, Berkeley whetten@cs.berkeley.edu Todd Montgomery West Virginia University tmont@cerc.wvu.edu Malik Kalfane University of California, Berkeley
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/Banerjea94.ch5.ps, 19950322
Cha pter 5: High leveldesign of a fault recovery protocol 5.1. Introduction The last twocha pter s presented a large number of decisions regarding the design of mechanisms to perfor m fault recovery inarealtime networ k. In this chapter,wewill summar ize this infor mation and place it into the context
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Banerjea94.ch2.ps, 19950322
Cha pter 2: The Tenet Realtime Protocol Suite 1 2.1. Introduction This chapter describes the Tenet Realtime Protocol Suite 1. In this process , it presents many ofthe ideas of the realtime paradigm byexample. Our research into fault management is based upon this paradigm. Therefore, this background
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/Banerjea94.bib.ps, 19950322
Bibliography A. Albanese, J. Bloemer, J. Edmonds and M. Luby, `Priority Encoding Transmission', 35th Annual Symposium on Foundations of Computer Science, 1994. `FDDI Station Management Standard', ANSI X3T9.5 Revision 5.1, American National Standards Institute, September 1989. D. P. Anderson,
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Banerjea94.ch6.ps, 19950322
Cha pter 6: A proactivescheme for fault tolerance 6.1. Introduction This chapter presents some possible schemes to provide fault tolerance on top of an under lying realtime service. The approach used is to makereser vations on multiple paths, using the availa ble ca pacity and connectivity of the networ
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/Banerjea94.ch4.ps, 19950322
Cha pter 4: Evalua tion of fault recovery 4.1. Introduction The problem of networ k fault recovery has been extensively studied. Cha pter 1pro - vides a survey ofexisting wor k explor ing various aspects of fault recovery inthe context of telecommunication networ ks and computer data networ ks . The eld
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/Banerjea94.ch1.ps, 19950322
Cha pter 1: Introduction 1.1. The realtime channel paradigm The realtime communication paradigm has been under the spotlight in recent year s due to advances in networ king technology and the increasing importance of multimedia communication. Improv ements in availa ble bandwidth brought about bythe
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Banerjea94.ch7.ps, 19950322
Cha pter 7: Conclusions 7.1. Introduction This thesis started out to answer the question of howtoimprov e the fault-handling character istics of realtime networ ks . In this chapter wewill summar ize the arguments and results presented. Then, we will retur n to the original requirements spelled out in
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Banerjea94.ch3.ps, 19950322
Cha pter 3: A reactivescheme for fault recovery 3.1. Introduction Arealtime scheme as described in the previous chapter gives the application guarantees about the networ k perfor mance that areonly valid in the absence of networ k fa ults . Such a scheme is susceptible to link faults because of the
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/Banerjea94.ch6.ps, 19950322
Cha pter 6: A proactivescheme for fault tolerance 6.1. Introduction This chapter presents some possible schemes to provide fault tolerance on top of an under lying realtime service. The approach used is to makereser vations on multiple paths, using the availa ble ca pacity and connectivity of the networ
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Banerjea94.toc.ps, 19950322
Fault Management for Realtime Networ ks by Anindo Banerjea B.Tech. (Indian Institute of Technology,New Delhi) 1989 Adisser tation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Computer Science in the GRADUATEDIVISION of the UNIVERSITY of CALIFORNIA at
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/BetNic95a.ps, 19950509
Appeared in: Proceedings of the Joint Workshop on Parallel and Distributed Real-Time Systems, Santa Barbara, California, April 24-26, 1995. Real-Time Networking over HIPPI Riccardo Bettati Anisoara Nica The Tenet Group University of California at Berkeley and International Computer Science Institute
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/ZhaKni95a.ps, 19950524
A New Approach to Support Delay-Sensitive VBR Video in Packet-Switched Networks Hui Zhang Edward W. Knightly School of Computer Science EECS Department, UC Berkeley Carnegie Mellon University and Sandia National Laboratories hzhang@cs.cmu.edu knightly@tenet.berkeley.edu
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Storn95a.ps, 19950525
Modeling and Optimization of PET-Redundancy Assignment for MPEG Sequences by Rainer Storn1) TR-95-018 May 1995
open this document and view contentsftp://tenet.berkeley.edu//pub/dbind/papers/S-BIND.ps, 19950601
To appear in Proceedings of ACM Sigmetrics'94 Providing End-to-End Statistical Performance Guarantees with Bounding Interval Dependent Stochastic Models Hui Zhang Edward W. Knightly Lawrence Berkeley Laboratory University of California at Berkeley MailStop: 50B-229 and Berkeley, CA 94720 Sandia National
open this document and view contentsftp://tenet.berkeley.edu//pub/dbind/papers/fundLimits.ps, 19950601
In Proceedings of ACM SIGMETRICS '95 Fundamental Limits and Tradeoffs of Providing Deterministic Guarantees to VBR Video Traffic Edward W. Knightly Dallas E. Wrege y J org Liebeherr y Hui Zhang z EECS Department, U.C. Berkeley and Sandia National Laboratories y Department of Computer Science University
open this document and view contentsftp://tenet.berkeley.edu//pub/doc/tenet-intro.ps, 19950607
The Tenet Group University of California, Berkeley and International Computer Science Institute Recent and Current Research May 1995 1. Introduction The Tenet Group was formed in September of 1989 at the University of California at Berkeleyand at the International Computer Science Institute (ICSI, also
open this document and view contentsftp://tenet.berkeley.edu//pub/users/whetten/RMP/MultiTCP.ps, 19950613
A Fast Track Architecture for UDP/IP and TCP/IP Roy Chua rchua@eecs.berkeley.edu MacDonald Jackson trey@cs.berkeley.edu Marylou Orayani marylou@cs.berkeley.edu May 9, 1995
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/FeGuVe95a.ps, 19950613
Distributed advance reservation of real-time connections Domenico Ferrari, Amit Gupta, Giorgio Ventre E-mail: fferrari,amit,ventreg@icsi.berkeley.edu Tenet Group University of California at Berkeley, and International Computer Science Institute
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/BeFeGuHeHoMoNgYa95a.ps, 19950615
Connection Establishment for Multi-Party Real-Time Communication R. Bettati, D. Ferrari, A. Gupta, W. Heffner, W. Howe, M. Moran, Q. Nguyen, R. Yavatkar The Tenet Group University of California, Berkeley, and International Computer Science Institute
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/KniZha94.ps, 19950707
In Proceedings of IEEE INFOCOM'95 Traffic Characterization and Switch Utilization using a Deterministic Bounding Interval Dependent Traffic Model Edward W. Knightly Hui Zhang EECS Department, U. C. Berkeley School of Computer Science and Sandia National Laboratories Carnegie Mellon University
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/KniZha94.ps, 19950707
In Proceedings of IEEE INFOCOM'95 Traffic Characterization and Switch Utilization using a Deterministic Bounding Interval Dependent Traffic Model Edward W. Knightly Hui Zhang EECS Department, U. C. Berkeley School of Computer Science and Sandia National Laboratories Carnegie Mellon University
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/KnWrLiZh95.ps, 19950707
to Appear in Proceedings of ACM SIGMETRICS '95 Fundamental Limits and Tradeoffs of Providing Deterministic Guarantees to VBR Video Traffic Edward W. Knightly Dallas E. Wrege y J org Liebeherr y Hui Zhang z EECS Department, U.C. Berkeley and Sandia National Laboratories y Department of Computer Science
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/BaKnTeZh94a.ps, 19950707
In Proceedings of ACM Multimedia'94 Experiments with the Tenet Real-Time Protocol Suite on the Sequoia 2000 Wide Area Network Anindo Banerjea Edward W. Knightly Fred L. Templin Hui Zhang U. C. Berkeley U. C. Berkeley Digital Equipment Co. Lawrence Berkeley Labs
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/KnWrLiZh95.ps, 19950707
to Appear in Proceedings of ACM SIGMETRICS '95 Fundamental Limits and Tradeoffs of Providing Deterministic Guarantees to VBR Video Traffic Edward W. Knightly Dallas E. Wrege y Jorg Liebeherr y Hui Zhang z EECS Department, U.C. Berkeley and Sandia National Laboratories y Department of Computer Science
open this document and view contentsftp://tenet.berkeley.edu//pub/users/parris/iatech.ps, 19950824
IBM Research/Communication Systems & Networked Services Intelligent Agent Technology Colin G. Harrison IBM T. J. Watson Research Center Yorktown Heights, NY 10598, USA cgh@watson.ibm.com Copyright IBM 1995 IBM Research/Communication Systems & Networked Services Outline, Goals & a Principle Outline: 1)
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Ferrari95a.ps, 19951018
delim $$ Multimedia network protocols: whereare we Domenico Ferrari The Tenet Group University of California at Berkeley and International Computer Science Institute
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/KniRos95a.ps, 19951103
In Proceedings of the 1995 International Symposium on Multimedia Communications and Video Coding EFFECTS OF SMOOTHING ON END-TO-END PERFORMANCE GUARANTEES FOR VBR VIDEO Edward W. Knightlyy and Paola Rossaroz The Tenet Group yEECS Department, U.C. Berkeley zInternational Computer Science Institute,
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Ferrari95b.ps, 19951214
The Tenet Experience and the Design of Protocols for Integrated- Services Internetworks Domenico Ferrari The Tenet Group University of California at Berkeley and International Computer Science Institute
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/Knightly96.ps, 19960116
To appear in Proceedings of IEEE INFOCOM'96 H-BIND: A New Approach to Providing Statistical Performance Guarantees to VBR Traffic Edward W. Knightly EECS Department, University of California at Berkeley knightly@tenet.berkeley.edu
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/ZhaKni96.ps, 19960130
RED-VBR: A Renegotiation-Based Approach to Support Delay-Sensitive VBR Video Hui Zhang Edward W. Knightly School of Computer Science EECS Department Carnegie Mellon University University of California at Berkeley hzhang@cs.cmu.edu knightly@eecs.berkeley.edu To Appear in ACM/Springer-Verlag Multimedia
open this document and view contentsftp://tenet.berkeley.edu//pub/dbind/papers/rcsp-sg.ps, 19960211
RCSP and Stop-and-Go: A Comparison of Two Non-Work-Conserving Disciplines For Supporting Multimedia Communication Hui Zhang Edward W. Knightly School of Computer Science EECS Department Carnegie Mellon University University of California at Berkeley hzhang@cs.cmu.edu knightly@eecs.berkeley.edu To Appear
open this document and view contentsftp://tenet.berkeley.edu/pub/tenet/Papers/WrKnLiZh96.ps, 19960214
To appear in IEEE/ACM Transactions on Networking, June 1996 Deterministic Delay Bounds for VBR Video in Packet-Switching Networks: Fundamental Limits and Practical Tradeoffs Dallas E. Wrege, Edward W. Knightly, Hui Zhang, and Jorg Liebeherr
open this document and view contentsftp://tenet.berkeley.edu//pub/users/wendyh/designdoc.ps, 19960619
June 19, 1996 10:35 am DRAFT - DO NOT DISTRIBUTE /home/orodruin/tenet/users/wendyh/frame/Suite2/designDoc/designdocTOC.doc i Scheme 2 - Design Document 1 0. Background: Description of RCAP objects .............................................................1 1. General Architecture
open this document and view contentsftp://tenet.berkeley.edu//pub/users/wendyh/rtip.report.ps, 19960619
Design Document for RTIP/RMTP Dinesh Verma Hui Zhang The Tenet Group Computer Science Division University of California, Berkeley and International Computer Science Institute, Berkeley 1. Introduction 1.1. Contents This document describes the Real Time Internet Protocol (RTIP), Real Time Message
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/KniRos96.ps, 19960628
Improving QoS through Traffic Smoothing Edward W. Knightly Paola Rossaro knightly@tenet.berkeley.edu rossaro@wrs.com EECS Department, U.C. Berkeley Wind River Systems, Alameda, CA In Proceedings of IFIP IWQoS'96, Paris, France
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/WrKnLiZh96.ps, 19960702
In IEEE/ACM Transactions on Networking, 4(3):352-362, June 1996 Deterministic Delay Bounds for VBR Video in Packet-Switching Networks: Fundamental Limits and Practical Tradeoffs Dallas E. Wrege, Edward W. Knightly, Hui Zhang, and J org Liebeherr
open this document and view contentsftp://tenet.berkeley.edu//pub/users/amit/CGroup93.ps, 19960913
Channel Groups A Unifying Abstraction for Specifying Inter-stream Relationships Amit Gupta and Mark Moran {amit,moran}@cs.Berkeley.EDU Tenet Group Computer Science Division University of California at Berkeley International Computer Science Institute Berkeley, CA
open this document and view contentsftp://tenet.berkeley.edu//pub/users/amit/adv-issues.ps, 19960913
Advance reservations in real-time communication services Amit Gupta Sun Microsystems Laboratories 2600 Casey Avenue UMTV 29-232 Mountain View CA 94043 amit.gupta@eng.sun.com
open this document and view contentsftp://tenet.berkeley.edu//pub/users/amit/adm-adv.ps, 19960913
Admission control for advance reserved real-time connections Domenico Ferrari and Amit Gupta fferrari,amitg@tenet.berkeley.edu University of California at Berkeley, and International Computer Science Institute, Berkeley 1 Introduction Some of the important multimedia applications of integrated services
open this document and view contentsftp://tenet.berkeley.edu//pub/users/amit/adv-abs.ps, 19960913
Accepted-for-presentation-in-NOSSDAV-95 Distributed advance reservation of real-time connections Domenico Ferrari, Amit Gupta, Giorgio Ventre The Tenet Group University of California, Berkeley, & I.C.S.I. Berkeley, CA 94704-1105, USA 1 Introduction Some of the important multimedia applications of
open this document and view contentsftp://tenet.berkeley.edu//pub/users/amit/relation.ps, 19960913
Inter-channel relationships in multi-party real-time communication Amit Gupta and Mark Moran Tenet Group University of California at Berkeley 1 Introduction A distributed real-time application typically consists of a number of real-time connections (hereafter called channels to distinguish them from non
open this document and view contentsftp://tenet.berkeley.edu//pub/users/amit/Nossdav93.ps, 19960913
1 Network Support for Realtime Multi-Party Applications Amit Gupta, Wendy Heffner, Mark Moran, Clemens Szyperski {amit,wendyh,moran,szyper}@tenet.berkeley.edu The Tenet Group Computer Science Division, Department of EECS University of California at Berkeley and International Computer Science Institute,
open this document and view contentsftp://tenet.berkeley.edu//pub/users/amit/thesis.ps, 19960913
Multi-party Real-time Communication in Computer Networks by Amit Gupta Ph.D. Dissertation Report No. UCB/CSD-96-896 Computer Science Division University of California Berkeley CA 94720 February 1996 amit@cs.berkeley.edu Multi-party Real-time Communication in Computer Networks Copyright 1995 by Amit
open this document and view contentsftp://tenet.berkeley.edu//pub/users/amit/dilip.ps, 19960913
November 5, 1993 Real-time Communication in Multi-hop Networks Dilip D. Kandlur IBM T. J. Watson Research Center Yorktown Heights, NY 10598. email: kandlur@watson.ibm.com Kang G. Shin Real-Time Computing Laboratory Department of Elec. Engr. and Computer Science The University of Michigan Ann Arbor,
open this document and view contentsftp://tenet.berkeley.edu//pub/users/amit/cover-thesis.ps, 19960913
Multi-party Real-time Communication in Computer Networks Amit Gupta Report No. UCB/CSD-96-896 February 1996 Computer Science Division (EECS) University of California Berkeley, California 94720
open this document and view contentsftp://tenet.berkeley.edu//pub/users/amit/partition-EDD.ps, 19960913
Resource Partitioning for Real-time Communication Domenico Ferrari Amit Gupta {ferrari, amit}@cs.Berkeley.EDU Computer Science Division, University of California, and International Computer Science Institute, Berkeley, California USA
open this document and view contentsftp://tenet.berkeley.edu//pub/users/amit/infocom95.ps, 19960913
In Proceedings of INFOCOM'95 Resource sharing for multi-party real-time communication Amit Gupta, Wingwai Howe, Mark Moran, Quyen Nguyen famit,whowe,moran,nguyenqg@tenet.berkeley.edu University of California at Berkeley, and International Computer Science Institute, Berkeley
open this document and view contentsftp://tenet.berkeley.edu//pub/users/amit/estab-nossdav.ps, 19960913
Connection Establishment for Multi-Party Real-Time Communication R. Bettati, D. Ferrari, A. Gupta, W. Heffner, W. Howe, M. Moran, Q. Nguyen, R. Yavatkar The Tenet Group University of California, Berkeley, and International Computer Science Institute
open this document and view contentsftp://tenet.berkeley.edu//pub/papers/Mah95.ps, 19980122
On the Use of Quality of Service in IP over ATM 1 On the Use of Quality of Service in IP over ATM Bruce A. Mah1 bmah@CS.Berkeley.EDU The Tenet Group Computer Science Division University of California at Berkeley Berkeley, CA 94720-1776 (510) 642-8905 (voice) (510) 642-5775 (fax)