This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
852 Congestion Avoidance and Control - cited, history.) (1988)(Correct)
This paper is a brief description of (i) -- (v) and the rationale behind them. (vi) is an algorithm recently developed by Phil Karn of Bell Communications Research, described in [15]. (vii) is describ... / Introduction Computer networks have experienced an explosive
496 PVM: A Framework for Parallel Distributed Computing - Sunderam (1990)(Correct)
The PVM system is a programming environment for the development and
execution of large concurrent or parallel applications that consist of many
interacting, but relatively independent, components. It ... / interconnected by one or more networks. The participating processors may br consists of a collection of protocol algorithms to implement reliable
482 On the Self-Similar Nature of Ethernet Traffic - Leland, Taqqu, Willinger, Wilson (1993)(Correct)
We demonstrate that Ethernet local area network (LAN) traffic
is statistically self-similar, that none of the commonly used
traffic models is able to capture this fractal behavior, and that
such behav... / that Ethernet local area network LAN traffic is statistically br services that used the Internet Protocol IP suite for such capabilities
388 Wide-Area Traffic: The Failure of Poisson Modeling - Paxson, Floyd (1994)(Correct)
Network arrivals are often modeled as Poisson processes for
analytic simplicity, even though a number of traffic studies
have shown that packet interarrivals are not exponentially
distributed. We eval... / appear in SIGCOMM ' Abstract Network arrivals are often modeled as br start times for several TCP protocols. The pattern of connection
338 KQML as an agent communication language - Finin, Labrou, Mayfield (1995)(Correct)
One of the defining characteristics of an information agent is its ability for flexible interaction
and interoperation with other, similar software agents. This focus on interoperability has been
the ... / firewalls or are connected to a network only intermittently SMTP may be br KSE's communication language and protocol KQML Knowledge Query and
270 A Hierarchical Internet Object Cache - Chankhunthod, Danzig, Neerdaels.. (1995)(Correct)
This paper discusses the design andperformance of a hierarchical proxy-cache designed to make Internet information systems scale better. The design was motivated by our earlier trace-driven simulati... / software developers perceive network bandwidth and connectivity as br caching support in their core protocols. The consequence of this
269 Link-sharing and Resource Management Models for Packet Networks - Floyd, Van Jacobson (1995)(Correct)
This paper discusses the use of link-sharing mechanisms
in packet networks and presents algorithms for hierarchical
link-sharing. Hierarchical link-sharing allows multiple agencies,
protocol families,... / Management Models for Packet Networks Sally Floyd and Van Jacobson br allows multiple agencies protocol families or traffic types to
217 Lazy Release Consistency for Software Distributed Shared Memory - Keleher, Cox, Zwaenepoel (1992)(Correct)
Relaxed memory consistency models, such as release consistency, were introduced in order to reduce the impact of remote memory access latency in both software and hardware distributed shared memory (D... / the execution of several layers of networking software. Ideally the number br execution of several layers of networking software. Ideally the number
208 Transis: A Communication Sub-System for High Availability - Yair Amir (1992)(Correct)
This paper describes Transis, a communication subsystem
for high availability. Transis is a transport
layer that supports reliable multicast services. The
main novelty is in the efficient implementati... / within arbitrary topology networks. Messages are being addressed br show that current broadcast protocols are not sufficient for reliable
199 Web Server Workload Characterization: The Search for Invariants.. - Arlitt, Williamson (1996)(Correct)
The phenomenal growth in popularity of the World Wide
Web (WWW, or the Web) has made WWW traffic the
largest contributor to packet and byte traffic on the
NSFNET backbone. This growth has triggered re... / aimed at reducing the volume of network traffic produced by Web clients br for WWW users by using improved protocols for Web interaction.
196 TCP Vegas: New Techniques for Congestion Detection and Avoidance - Brakmo, O'Malley, Peterson (1994)(Correct)
Vegas is a new implementation of TCP that achieves between
40 and 70% better throughput, with one-fifth to onehalf
the losses, as compared to the implementation of TCP
in the Reno distribution of BSD ... / in this paper were obtained from a network simulator. Even though several br versions of TCP. All of the protocols were developed and tested under
184 Weak Ordering - A New Definition - Adve (1990)(Correct)
A memory model for a shared memory, multiprocessor
commonly and often implicitly assumed by programmers
is that of sequential consistency. This model
guarantees that all memory accesses will appear to... / with general interconnection networks both with and without caches br -Even with a cache coherence protocol ArB the execution is
183 The Oz Programming Model - Smolka (1995)(Correct)
The Oz Programming Model (OPM) is a concurrent programming model subsuming higher- order functional and object-oriented programming as facets of a general model. This is particularly interesting for c... / they are parallel distributed networked and inexpensive. However br operating system and network protocols. This has the severe
179 IP-based Protocols for Mobile Internetworking - Ioannidis, Duchamp, Jr. (1991)(Correct)
We consider the problem of providing network access to hosts whose physical location changes
with time. Such hosts cannot depend on traditional forms of network connectivity and routing
because their ... / consider the problem of providing network access to hosts whose physical
179 Caching in the Sprite Network File System - Nelson, Welch, Ousterhout (1988)(Correct)
The Sprite network operating system uses large main-memory disk block caches to
achieve high performance in its file system. It provides non-write-through file caching
on both client and server machin... / Caching in the Sprite Network File System Michael N. Nelson br describes the consistency protocols and Section discusses the
179 Orca: A Language For Parallel Programming Of Distributed Systems - Bal, Kaashoek, Tanenbaum (1992)(Correct)
Orca is a language for implementing parallel applications on loosely coupled distributed
systems. Unlike most languages for distributed programming, it allows processes on
different machines to share ... / through a local area network LAN In addition such systems br system uses a reliable broadcast protocol. Both the protocol and the
174 APRIL: A Processor Architecture for Multiprocessing - Agarwal (1990)(Correct)
Processors in large-scale multiprocessors must be able to tolerate large communication latencies and synchronization delays. This paper describes the architecture of a rapid-context-switching processo... / machine with an average base network latency of cycles.
168 The Challenges of Mobile Computing - Forman, Zahorjan (1994)(Correct)
Advances in wireless networking technology have engendered a new paradigm of
computing, called mobile computing, in which users carrying portable devices have
access to a shared infrastructure indepen... / Abstract Advances in wireless networking technology have engendered a br Abstract Advances in wireless networking technology have engendered a new
164 TCP-like Congestion Control for Layered Multicast Data Transfer - Vicisano, Rizzo, Crowcroft (1998)(Correct)
We present a novel congestion control algorithm suitable for use with cumulative, layered
data streams in the MBone. Our algorithm behaves similarly to TCP congestion control
algorithms, and shares ba... / and experiments in real networks. We also show how error recovery br fairly with other instances of the protocol and with TCP flows. It is
163 End-to-End Routing Behavior in the Internet - Paxson (1996)(Correct)
The large-scale behavior of routing in the Internet has gone virtually
without any formal study, the exceptions being Chinoy's analysis
of the dynamics of Internet routing information [Ch93], and rece... / in the Internet Vern Paxson Network Research Group Lawrence Berkeley
161 The MIT Alewife Machine: A Large-Scale Distributed-Memory.. - Agarwal, Chaiken, Johnson, Kranz.. (1991)(Correct)
The Alewife multiprocessor project focuses on the architecture and design of a large-scale parallel machine. The machine uses a low dimension direct interconnection network to provide scalable communi... / dimension direct interconnection network to provide scalable communication br implements the cache coherence protocol by synthesizing messages to other
153 A Control-Theoretic Approach to Flow Control - Keshav (1991)(Correct)
This paper presents a control-theoretic approach to reactive flow
control in networks that do not reserve bandwidth. We assume a
round-robin-like queue service discipline in the output queues of
the n... / to reactive flow control in networks that do not reserve bandwidth. We
153 Multicast Extensions to OSPF - Moy (1994)(Correct)
This memo documents enhancements to the OSPF protocol enabling the routing of IP multicast datagrams. In this
proposal, an IP multicast packet is routed based both on the packet's source and its multi... / Network Working Group J. Moy Request for
141 Log-Based Receiver-Reliable Multicast for Distributed Interactive.. - Holbrook (1995)(Correct)
Reliable multicast communication is important in large-scale distributed applications. For example, reliable multicast is used to transmit terrain and environmental updates in distributed simulations.... / updates because of the excessive network traffic that would result. For br simulations. To date proposed protocols have not supported these
141 Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol - Li Fan (1998)(Correct)
The sharing of caches among Web proxies is an important
technique to reduce Web traffic and alleviate
network bottlenecks. Nevertheless it is not widely
deployed due to the overhead of existing protoc... / reduce Web traffic and alleviate network bottlenecks. Nevertheless it is br Wide-Area Web Cache Sharing Protocol Li Fan Pei Cao and Jussara
138 TCP Vegas: End to End Congestion Avoidance on a Global Internet - Brakmo, Peterson (1995)(Correct)
Vegas is an implementation of TCP that achieves
between 37 and 71% better throughput on the
Internet, with one-fifth to one-half the losses,
as compared to the implementation of TCP in
the Reno distri... / newer versions of TCP-Berkeley Network Release BNR and BSD . . br Keywords TCP Reno Vegas protocols congestion avoidance.
133 A Proposal to add Explicit Congestion Notification (ECN) to IP - Ramakrishnan, Floyd (1999)(Correct)
This note describes a proposed addition of ECN (Explicit Congestion Notification) to IP. TCP is currently the dominant transport protocol used in the Internet. We begin by describing TCP's use of pack... / Network Working Group K. Ramakrishnan br This memo defines an Experimental Protocol for the Internet community. It
133 Totem: A Fault-Tolerant Multicast Group Communication System - Moser, Melliar-Smith, Agarwal.. (1996)(Correct)
When Totem delivers multicast messages, it invokes operations in the same total
order throughout the distributed system. The result: consistency of replicated
data and simplified programming of applic... / interconnected by a communication network. Distributed systems use br the Totem system as a hierarchy of protocols is shown in Figure . With
131 System Design Issues for Internet Middleware Services: Deductions.. - Gribble (1997)(Correct)
System Design Issues for Internet Middleware Services: Deductions from a Large
Client Trace
by
Steven D. Gribble
Master of Science in Computer Science
University of California at Berkeley
Professor Er... / in hardware software and network connectivity. They must be able br . The Internet Protocol Scanning Engine IPSE
130 An Evaluation of Directory Schemes for Cache Coherence - Agarwal, al. (1988)(Correct)
The problem of cache coherence in shared-memory multiprocessors has been addressed using two basic approaches: directory schemes and snoopy cache schemes. Directory schemes have been given less attent... / a higher bandwidth communication network will not be successful since the br to these schemes and snoopy cache protocols. Introduction In the past
129 Horus: A Flexible Group Communications System - van Renesse, Birman, Maffeis (1996)(Correct)
This paper reports on the Horus system, which provides an unusually flexible group communication model to application-developers. This flexibility extends to system interfaces, the properties provided... / emerging generation of intelligent network and collaborative work br the properties provided by a protocol stack and even the configuration
128 SDP: Session Description Protocol - Handley, Van Jacobson (1995)(Correct)
The sd session directory tool has been in use for some time on the Mbone for
announcing multicast sessions. This document describes an exhanced version of the
sd protocol (SDP v2), and explains the ex... / Mbone is an experimental overlay network on the internet that permits br SDP Session Description Protocol Status of this Memo This
127 Receiver-driven Layered Multicast - McCanne, Van Jacobson, Vetterli (1996)(Correct)
State of the art, real-time, rate-adaptive, multimedia applications adjust their transmission rate to match the available network capacity. Unfortunately, this source-based rate-adaptation performs po... / mccanne ee.lbl.gov Van Jacobson Network Research Group Lawrence Berkeley
124 The PIM Architecture for Wide-Area Multicast Routing - Deering, Estrin, Farinacci, Van.. (1996)(Correct)
The purpose of multicast routing is to reduce the communication
costs for applications that send the same data to
multiple recipients. Existing multicast routing mechanisms
were intended for use withi... / required across the entire network in order to deliver data packets br to the members of the group. Our Protocol Independent Multicast PIM
123 Packet Loss Correlation in the MBone Multicast Network - Yajnik, Kurose, Towsley (1996)(Correct)
The recent success of multicast applications such as Internet
teleconferencing illustrates the tremendous potential of applications
built upon wide-area multicast communication services.
A critical is... / Correlation in the MBone Multicast Network Maya Yajnik Jim Kurose br applications and the higher layer protocols required to support them is the
123 Recovery in Distributed Systems Using Optimistic Message Logging and.. - Johnson, Zwaenepoel (1988)(Correct)
Message logging and checkpointing can provide fault tolerance in distributed systems
in which all process communication is through messages. This paper presents a general
model for reasoning about rec... / connected by a communication network but reliable delivery of br be used with any message logging protocol whether pessimistic or
123 Packet Loss Correlation in the MBone Multicast Network: Experimental.. - Yajnik, Kurose, Towsley (1996)(Correct)
The recent success of multicast applications such as Internet teleconferencing illustrates
the tremendous potential of applications built upon wide-area multicast communication services.
A critical is... / Correlation in the MBone Multicast Network Experimental Measurements and br applications and the higher layer protocols that support them is the manner
123 Comparison of Rate-Based Service Disciplines - Zhang, Keshav (1991)(Correct)
This paper compares six new queue service disciplines that can be implemented at the output queues of switches in a connection-oriented packet switched data network. These are Virtual Clock, Fair Queu... / packet switched data network. These are Virtual Clock Fair br the Stop-and-Go protocol the Hierarchical Round
122 The Transis Approach to High Availability Cluster Communication - Dolev (1996)(Correct)
Introduction
In the local elections system of the municipality of "Wiredville"
1
, several computers were used to
establish an electronic town hall. The computers were linked by a network. When an ... / The computers were linked by a network. When an issue was put to a br Transis has an efficient protocol for reliable multicast derived
122 A High Performance Totally Ordered Multicast Protocol - Whetten, Kaplan, Montgomery (1994)(Correct)
This paper presents the Reliable Multicast Protocol (RMP). RMP provides a totally ordered, reliable, atomic multicast
service on top of an unreliable multicast datagram service such as IP Multicasting... / internetworking distributed network algorithms network reliability br Totally Ordered Multicast Protocol Brian Whetten University Of
117 A Caching Relay for the World Wide Web - Glassman (1994)(Correct)
We describe the design and performance of a caching relay for the World Wide Web. We examine how the behavior of users affects the performance of the relay. From an analysis of the data from the relay... / and reduce its external network traffic. Clients use the relay br NNTP network news transfer protocol requests through the relay. A
115 NetSolve: A Network Server for Solving Computational Science Problems - Henri Casanova (1995)(Correct)
This paper presents a new system, called NetSolve, that allows users to access computational resources,
such as hardware and software, distributed across the network. The development of NetSolve
was m... / NetSolve A Network Server for Solving Computational br describes the NetSolve system the protocols in use and the issues involved
114 Effective Erasure Codes for Reliable Computer Communication Protocols - Rizzo (1997)(Correct)
Reliable communication protocols require that all the intended recipients of a message receive the message intact. Automatic Repeat reQuest (ARQ) techniques are used in unicast protocols, but they do ... / erasure code to be used in network protocols and discuss its br Reliable Computer Communication Protocols Luigi Rizzo y Dip. di
111 Using Predictive Prefetching to Improve World Wide Web Latency - Venkata Padmanabhan (1996)(Correct)
The long-term success of the World Wide Web depends on fast response time. People use the Web
to access information from remote sites, but do not like to wait long for their results. The latency
of re... / on several factors such as the network bandwidth propagation time and br a point. The Hypertext Transport Protocol HTTP version . as it is
110 RAP: An End-to-end Rate-based Congestion Control Mechanism for.. - Rejaie, Handley, Estrin (1999)(Correct)
End-to-end congestion control mechanisms have been
critical to the robustness and stability of the Internet. Most of today
's Internet traffic is TCP, and we expect this to remain so in the
future. Th... / and TCP-friendly while separating network congestion control from br TCP-friendly Rate Adaptation Protocol RAP which employs an
109 Specification of the KQML Agent-Communication Language - Finin, Weber, Wiederhold.. (1994)(Correct)
this document send a message to kqml-users@isi.edu) Tim Finin (co-chair) University of Maryland Jay Weber (co-chair) Enterprise Integration Technologies Gio Wiederhold (former co-chair) Stanford Unive... / . Networking performatives br with the charter to develop protocols for the exchange of represented
109 Protocol Service Decomposition for High-Performance Networking - Maeda, Bershad (1993)(Correct)
In this paper we describe a new approach to implementing
network protocols that enables them to have
high performance and high flexibility, while retaining
complete conformity to existing application ... / Decomposition for High-Performance Networking Chris Maeda School of br for High-Performance Networking Chris Maeda School of
107 An Application Level Video Gateway - Amir, McCanne, Zhang (1995)(Correct)
The current model for multicast transmission of video over
the Internet assumes that a fixed average bandwidth is
uniformly present throughout the network. Consequently,
sources limit their transmissi... / uniformly present throughout the network. Consequently sources limit br By making the Real-time Transport Protocol RTP an integral component of
106 The Ontolingua Server: a Tool for Collaborative Ontology Construction - Farquhar, Fikes, Rice (1996)(Correct)
Reusable ontologies are becoming increasingly important for tasks such as information integration, knowledge-level interoperation, and knowledgebase development. We have developed a set of tools and s... / term definitions. We have defined a network protocol and application program br how it exploits existing protocols and browsing tools and our
104 Making Paths Explicit in the Scout Operating System - Mosberger, Peterson (1996)(Correct)
This paper makes a case for paths as an explicit abstraction
in operating system design. Paths provide a unifying
infrastructure for several OS mechanisms that have
been introduced in the last several... / on layered operating systems and network architectures to more br manipulation loops of multiple protocol layers. It depends on knowing
104 The Inductive Approach to Verifying Cryptographic Protocols - Paulson (1998)(Correct)
Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions. The approach is based on ordinary predicate calculus and copes with infinite-state systems.... / securely over an insecure network. An obvious security goal is br to Verifying Cryptographic Protocols Lawrence C. Paulson Computer
103 Midway: Shared Memory Parallel Programming with Entry Consistency for .. - Bershad, Zekauskas (1991)(Correct)
Distributed memory multiprocessing offers a cost-effective and scalable solution for a large class of scientific
and numeric applications. Unfortunately, the performance of current distributed memory ... / used data to counter the effects of network latency. Midway is based on a br Midway implements its consistency protocols in software and has no
102 On Traffic Phase Effects in Packet-Switched Gateways - Floyd, Van Jacobson (1992)(Correct)
this paper we define the notion of traffic phase in a
packet-switched network and describe how phase differences between competing
traffic streams can be the dominant factor in relative throughput. Dr... / of the traffic in existing packet networks is highly periodic either
101 Fine-grain Access Control for Distributed Shared Memory - Schoinas (1994)(Correct)
This paper discusses implementations of fine-grain memory
access control, which selectively restricts reads and
writes to cache-block-sized memory regions. Fine-grain
access control forms the basis of... / or personal computers with networks comparable to the CM- 's will be br the system must invoke a protocol action to bring the desired
98 Agent Tcl: A flexible and secure mobile-agent system - Gray (1996)(Correct)
An information agent manages all or a portion of a user's information space. The electronic resources in this space are often distributed across a network and can contain tremendous quantities of data... / are often distributed across a network and can contain tremendous br as building blocks for a range of protocols. Agent Tcl uses the simple Safe
98 Resource containers: A new facility for resource management in server .. - Banga, Druschel, Mogul (1999)(Correct)
General-purpose operating systems provide inadequate
support for resource management in large-scale
servers. Applications lack sufficient control over
scheduling and management of machine resources,
w... / that manages large numbers of network connections for example from br better kernel algorithms for protocol control block PCB lookup
95 Scalable Internet Resource Discovery: Research Problems and Approaches - Bowman, Danzig (1994)(Correct)
Over the past several years, a number of information discovery and access tools have been
introduced in the Internet, including Archie, Gopher, Netfind, and WAIS. These tools have
become quite popular... / how people think about wide-area network applications. Yet they are not br with data communication protocols. However the predominate usage
95 Beowulf: A Parallel Workstation For Scientific Computation - Sterling, Becker, al. (1995)(Correct)
Network-of-Workstations technology is applied
to the challenge of implementing very high performance
workstations for Earth and space science applications.
The Beowulf parallel workstation employs 16 ... / Hughes STX Corp. Abstract Network-of-Workstations technology is br through standard Unix network protocols over Ethernet networks internal
94 Empirically-Derived Analytic Models of Wide-Area TCP Connections - Paxson (1994)(Correct)
We analyze 3 million TCP connections that occurred during
15 wide-area traffic traces. The traces were gathered at five
"stub" networks and two internetwork gateways, providing a
diverse look at wide-... / were gathered at five stub networks and two internetwork gateways br of wide-area traffic on a per-protocol basis C H CW WLC
94 A Survey of Rollback-Recovery Protocols in Message-Passing Systems - Elnozahy, Johnson, Wang (1996)(Correct)
The problem of rollback-recovery in message-passing systems has undergone extensive
study. In this survey, we review rollback-recovery techniques that do not require special
language constructs, and c... / assume that the communication network is immune to partition but br A Survey of Rollback-Recovery Protocols in Message-Passing Systems
94 A Practical Public Key Cryptosystem Provably Secure against Adaptive.. - Cramer, Shoup (1998)(Correct)
A new public key cryptosystem is proposed and analyzed. The scheme is quite practical, and is provably secure against adaptive chosen ciphertext attack under standard intractability assumptions. There... / i.e.inject messages into a network or otherwise influence the br It is essential in designing protocols that are secure against active
93 A Stream Input-Output System - Ritchie (1984)(Correct)
In a new version of the Unix operating system, a flexible coroutine-based design
replaces the traditional rigid connection between processes and terminals or networks.
Processing modules may be insert... / between processes and terminals or networks. Processing modules may be br Network connections require protocols more ornate than are easily
92 Measuring Bottleneck Link Speed in Packet-Switched Networks - Carter, Crovella (1996)(Correct)
The quality of available network connections can often have a large impact on the performance of distributed applications.
For example, document transfer applications such as FTP, Gopher and the World... / Link Speed in Packet-Switched Networks Robert L. Carter and Mark E. br to any particular higher-level protocol while our bprobe tool measures
90 Fundamental Design Issues for the Future Internet - Shenker (1995)(Correct)
The Internet has been a startling and dramatic success. However, multimedia applications,
with their novel traffic characteristics and service requirements, pose an interesting challenge
to the techni... / to the telephone and the cable TV networks in terms of the number of users
89 Extended Virtual Synchrony - Moser, Amir, Melliar-Smith, Agarwal (1994)(Correct)
We formulate a model of extended virtual synchrony that defines a group communication
transport service for multicast and broadcast communication in a distributed
system. The model extends the virtual... / in all components of a partitioned network. The significance of extended br better performance advanced protocols exploit the multicast or
88 Constructing Distributed Systems In Conic - Magee, Kramer, Sloman (1989)(Correct)
Abstract -- Existing distributed systems vary from those which merely provide Existing distributed systems vary from those which merely provide interconnection of autonomous systems to those which pro... / configuration distributed systems networked systems programming language br distributed systems networked systems programming language
86 Newtop: A Fault-Tolerant Group Communication Protocol - Ezhilchelvan, Macêdo, Shrivastava (1995)(Correct)
this paper.
Transport Layer
Membership Service Logical Clock System
View Installation
Total Order Delivery
Atomic
Delivery
Fig. 5: System architecture unknown
Newtop: A Fault-Tolerant Group
Communic... / estimated and the underlying network may well get partitioned br Group Communication Protocol Paul D Ezhilchelvan Raimundo A
84 Why We Don't Know How To Simulate The Internet - Paxson, Floyd (1997)(Correct)
Simulating how the global Internet data network behaves is
an immensely challenging undertaking because of the network
's great heterogeneity and rapid change. The heterogeneity
ranges from the indivi... / Vern Paxson and Sally Floyd Network Research Group Lawrence Berkeley
84 Real-time Communication in Multi-hop Networks - Kandlur, Shin, al. (1993)(Correct)
Communication in real-time systems has to be predictable, because unpredictable delays in
the delivery of messages can adversely affect the execution of tasks dependent on these messages.
In this pape... / Communication in Multi-hop Networks Dilip D. Kandlur IBM T. J. br towards designing medium access protocols for multiple-access networks
83 Potential benefits of delta encoding and data compression for HTTP - Mogul, al. (1997)(Correct)
ing with credit is permitted. To copy otherwise, to republish, to
post on servers or to redistribute to lists, requires prior specific permission
and/or a fee.
Abstract
Caching in the World Wide Web... / the Internet or other wide-area network usually takes enough time that br specific extensions to the HTTP protocol for delta encoding and data
81 Application-Controlled Physical Memory using External Page-Cache.. - Harty (1992)(Correct)
Next generation computer systems will have gigabytes
of physical memory and processors in the 200 MIPS range
or higher. While this trend suggests that memory management
for most programs will be less ... / Yet secondary storage and networking growth places the effective br using a cache consistency protocol. In this type of machine a
78 A Digital Fountain Approach to Reliable Distribution of Bulk Data - Byers, Luby, Mitzenmacher, Rege (1998)(Correct)
The proliferation of applications that must reliably distribute bulk data to a large number of
autonomous clients motivates the design of new multicast and broadcast protocols. We describe
an ideal, f... / must be fully reliable have low network overhead and support vast br of new multicast and broadcast protocols. We describe an ideal fully
78 Locating Nearby Copies of Replicated Internet Servers - Guyton, Schwartz (1995)(Correct)
In this paper we consider the problem of choosing among a collection of replicated servers,
focusing on the question of how to make choices that segregate client/server traffic according
to network to... / client server traffic according to network topology. We explore the cost and br global collection of Network Time Protocol servers. Introduction
76 A predicate-based caching scheme for client-server database.. - Keller, Basu (1996)(Correct)
F3.733e+05> We propose a new client-side data-caching scheme
for relational databases with a central server and multiple
clients. Data are loaded into each client cache based on
queries executed on ... / to the server by a local area network. The database is resident at the br of a consistency-control protocol on index pages. Because an index
76 A Continuous Media Player - Rowe, Smith (1992)(Correct)
The design and implementation of a continuous media player for Unix workstations
is described. The player can play synchronized digital video and audio read
from a file server. The system architectu... / a conventional ethernet and FDDI network. The remainder of the paper br A special-purpose datagram protocol was implemented to send CM
75 Reliable Broadband Communication Using a Burst Erasure Correcting Code - McAuley (1990)(Correct)
Traditionally, a transport protocol corrects errors in a
computer communication network using a simple ARQ
protocol. With the arrival of broadband networks, forward
error correction is desirable as a ... / errors in a computer communication network using a simple ARQ protocol. br Traditionally a transport protocol corrects errors in a computer
75 Internet Security Association and Key Management Protocol (ISAKMP) - Maughan, Patrick, Schertler (1995)(Correct)
This memo describes a combination of security concepts and protocols for establishing Security Associations
(SA) and cryptographic keys in an Internet environment. A Security Association Protocol whic... / bind a specific identity host network user application to public br Association and Key Management Protocol ISAKMP Abstract This memo
74 Providing Guaranteed Services Without Per Flow Management - Stoica (1999)(Correct)
Previous proposals for providing guaranteed services require routers to manage per flow states
and perform per flow operations, which raises scalability concerns for both the data and control
planes o... / and control planes of the core network infrastructure. To achieve
73 On the use of fractional Brownian motion in the theory of.. - Norros (1995)(Correct)
An abstract model for aggregated connectionless traffic, based on the fractional Brownian
motion, is presented. Insight into the parameters is obtained by relating the
model to an equivalent burst mod... / in the theory of connectionless networks Ilkka Norros VTT br relation to the transport layer protocol are discussed in Section .
72 Simulation-based Comparisons of Tahoe, Reno, and SACK TCP - Fall, Floyd (1996)(Correct)
This paper uses simulations to explore the benefits of adding selective acknowledgments (SACK) and selective repeat to TCP. We compare Tahoe and Reno TCP, the two most common reference implementations... / of algorithms aimed at controlling network congestion while maintaining br be achieved. Several transport protocols have provided for selective
71 Unifying Data and Control Transformations for Distributed Shared.. - Cierniak (1994)(Correct)
We present a unified approach to locality optimization that employs both data and control transformations. Data transformations include changing the array layout in memory. Control transformations inv... / The Intel Paragon And Tmc Cm- And Network cluster Of Workstations Yet br exists in the area of coherence protocols for large-scale multiprocessors.
70 Voice Communication Across the Internet: A Network Voice Terminal - Schulzrinne (1992)(Correct)
Voice conferencing has attracted interest as a useful and viable first real-time application on the Internet. This report describes Nevot a network voice terminal meant to support multiple concurrent ... / Across the Internet A Network Voice Terminal Henning br on top of a variety of transport protocols and using audio encodings
69 Concurrent online tracking of mobile users - Awerbuch, Peleg (1991)(Correct)
This paper deals with the problem of maintaining a
distributed directory server, that enables us to keep
track of mobile users in a distributed network in the
presence of concurrent requests. The pape... / of mobile users in a distributed network in the presence of concurrent br Symp. on Communic. Architectures Protocols October Zurich
69 Planning to Gather Information - Kwok, Weld (1996)(Correct)
The exponential growth of the Internet has produced a labyrinth of documents,
databases and services. While almost any type of information is
available somewhere, even expert users waste time and effo... / . Assumptions We assume that a network e.g. the Internet makes br recognize when a site's contents protocol or performance changes as well
69 A Case for Caching File Objects Inside Internetworks - Danzig, Hall, Schwartz (1993)(Correct)
This paper presents evidence that several, judiciously placed file caches could reduce the volume of FTP traffic by 42%, and hence the volume of all NSFNET backbone traffic by 21%. In addition, if FTP... / employed in our simulations on a network that connects the NSFNET backbone
68 Software Versus Hardware Shared-Memory Implementation: A Case Study - Cox (1994)(Correct)
We compare the performance of software-supported shared memory on a general-purpose network to hardware-supported shared memory on a dedicated interconnect. Up to eight processors, our results are bas... / shared memory on a general-purpose network to hardware-supported shared br using a directory-based protocol on a dedicated interconnect and
67 NetBill Security and Transaction Protocol - Cox, al. (1995)(Correct)
NetBill is a system for micropayments for information
goods on the Internet. This paper presents the NetBill
protocol and describes its security and transactional
features. Among our key innovations a... / by third parties sharing the network. And the use of computers to br NetBill Security and Transaction Protocol Carnegie Mellon University
67 Scope Consistency : A Bridge between Release Consistency and Entry.. - Liviu Iftode (1996)(Correct)
Systems that maintain coherence at large granularity such as
shared virtual memory systems, suffer from false sharing and
extra communication. Relaxed memory consistency models
have been used to allev... / modified to take advantage of new network interfaces that provide hardware br of RC or LRC. We propose two ScC protocols one that uses hardware support
66 An Overview of the Spring System - Mitchell, Gibbons, Hamilton.. (1994)(Correct)
Spring is a highly modular, distributed, object-oriented
operating system. This paper describes the goals of the
Spring system and provides overviews of the Spring object
model, the security model, an... / audio and video especially in a networked environment the lack of br and video especially in a networked environment the lack of a
66 Quantum Circuit Complexity - Yao (1993)(Correct)
We study a complexity model of quantum circuits analogous to the standard (acyclic)
Boolean circuit model. It is shown that any function computable in polynomial time by a
quantum Turing machine has a... / He subsequently considered a network-like model called quantum br in the context of cryptographic protocols by Wiesner Bennett Brassard
65 Energy Efficient Indexing On Air - Imielinski, Viswanathan, Badrinath (1994)(Correct)
We consider wireless broadcasting of data as a way of disseminating
information to a massive number of users. Organizing
and accessing information on wireless communication
channels is different from ... / also be applied to a fixed wired network. We distinguish between two br ranging from new communication protocols to file system and database
65 Plan 9 from Bell Labs - Pike (1990)(Correct)
Plan 9 is a distributed computing environment. It is assembled from separate machines acting as CPU servers, file servers, and terminals. The pieces are connected by a single file-oriented protocol an... / on a variety of computers and networks. It lacks a number of features br by a single file-oriented protocol and local name space operations.
64 Secure Agreement Protocols: Reliable and Atomic Group Multicast in.. - Reiter (1994)(Correct)
Reliable and atomic group multicast have been proposed as fundamental communication paradigms to support secure distributed computing in systems in which processes may behave maliciously. These protoc... / processes required a synchronous network for correctness in which there br Secure Agreement Protocols Reliable and Atomic Group
61 Priority Encoding Transmission - Albanese, Blömer, Edmonds, Luby.. (1994)(Correct)
We introduce a new method, called Priority Encoding Transmission, for sending messages over lossy packet-based networks. When a message is to be transmitted, the user specifies a priority value for ea... / messages over lossy packet-based networks. When a message is to be br session. Present applications use protocols that retransmit missing
60 Limitations of the Kerberos Authentication System+ - Bellovin (1991)(Correct)
The Kerberos authentication system, a part of MIT's Project Athena, has been
adopted by other organizations. Despite Kerberos's many strengths, it has a number of
limitations and some weaknesses. Some... / here could penetrate a typical network of UNIX systems far more br represent deficiencies in the protocol design. We discuss a number of
59 Model Checking Large Software Specifications - Anderson (1996)(Correct)
In this paper we present our results and experiences of using symbolic model checking to study the specification of an aircraft collision avoidance system. Symbolic model checking has been highly succ... / and communication systems network and distributed system protocols br network and distributed system protocols and other reactive systems -
59 The Trade-offs of Multicast Trees and Algorithms - Wei, Estrin (1995)(Correct)
Multicast trees can be shared across sources (shared trees) or may be source-specific (shortest path
trees). Inspired by recent interests in using shared trees for interdomain multicasting, we investi... / multicast group and the whole network. The performance is evaluated in br Traditional IP multicast protocols have solely used source rooted
59 PLAN: A Packet Language for Active Networks - Hicks (1998)(Correct)
PLAN (Packet Language for Active Networks) is a new language for programs that form the packets of a programmable network. These programs replace the packet headers (which can be viewed as very rudime... / PLAN A Packet Language for Active Networks Michael Hicks Pankaj Kakkar
57 The Relative Importance of Concurrent Writers and Weak Consistency.. - Peter Keleher (1996)(Correct)
This paper presents a detailed comparison of the relative
importance of allowing concurrent writers versus the
choice of the underlying consistency model. Our comparison
is based on single- and multip... / protocol lightweight threads and network communication complete with br a lazy release consistent LRC protocol and a single-writer sequentially
57 Scalable High Speed IP Routing Lookups - Waldvogel, Varghese, Turner, Plattner (1997)(Correct)
Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP routing lookup requir... / y y Computer Engineering and Networks Laboratory ETH Zurich br Thus for the current Internet protocol suite IPv with bit
57 Balancing Push and Pull for Data Broadcast - Acharya(Correct)
The increasing ability to interconnect computers through internetworking, wireless networks, high-bandwidth satellite, and cable networks has spawned a new class of information-centered applications b... / through internetworking wireless networks high-bandwidth satellite and br supported on the Internet through protocols such as IP Multicast which is
56 A World-Wide Distributed System Using Java and the Internet - Chandy, Dimitrov, Le, Mandelson.. (1996)(Correct)
This paper describes the design of a distributed system built using Java that supports peer-to-peer
communication among processes spread across a network. We identify the requirements of a software la... / among processes spread across a network. We identify the requirements of br little control over the networks protocols operating systems and
56 Evaluation of Release Consistent Software Distributed Shared Memory.. - Sandhya Dwarkadas (1993)(Correct)
We evaluate the effect of processor speed, network characteristics,
and software overhead on the performance
of release-consistent software distributed shared memory.
We examine five different protoco... / Shared Memory on Emerging Network Technology Sandhya Dwarkadas br memory. We examine five different protocols for implementing release
55 Measured Capacity of an Ethernet: Myths and Reality - Boggs, Mogul, Kent (1988)(Correct)
Ethernet, a 10 Mbit/sec CSMA/CD network, is one of the most successful
LAN technologies. Considerable confusion exists as to the actual capacity of
an Ethernet, especially since some theoretical studi... / Ethernet a Mbit sec CSMA CD network is one of the most successful
54 Automated Packet Trace Analysis of TCP Implementations - Paxson (1997)(Correct)
We describe tcpanaly, a tool for automatically analyzing a TCP implementation
's behavior by inspecting packet traces of the TCP's activity. Doing
so requires surmounting a number of hurdles, includin... / TCP Implementations Vern Paxson Network Research Group Lawrence Berkeley
54 The QoS Broker - Nahrstedt, Smith (1995)(Correct)
Many networked multimedia applications are delay-sensitive, and require services with guarantees
of resource availability and timeliness. For networks such as those based on Asynchronous
Transfer Mode... / PA - Abstract Many networked multimedia applications are
53 A Model Based TCP-Friendly Rate Control Protocol - Padhye, Kurose, Towsley, Koodli (1999)(Correct)
As networked multimedia applications become widespread, it becomes increasingly important to ensure that these
applications can coexist with current TCP-based applications. The TCP protocol is designe... / Abstract As networked multimedia applications become br Based TCP-Friendly Rate Control Protocol Jitendra Padhye y Jim
53 Fair Scheduling in Wireless Packet Networks - Songwu Lu (1997)(Correct)
Fair scheduling of delay and rate-sensitive packet flows over
a wireless channel is not addressed effectively by most contemporary
wireline fair scheduling algorithms because of two
unique characteris... / Fair Scheduling in Wireless Packet Networks Songwu Lu Vaduvur Bharghavan br algorithm with the medium access protocol for wireless channels. In this
52 Techniques for Reducing Consistency-Related Communication in.. - Carter, Bennett, Zwaenepoel (1993)(Correct)
Distributed shared memory (DSM) is an abstraction of shared memory on a distributed memory machine. Hardware DSM systems support this abstraction at the architecture level; software DSM systems suppor... / Munin has been implemented on a network of SUN- workstations running br multiple consistency protocols write-shared protocols and
51 Improving Release-Consistent Shared Virtual Memory using Automatic.. - Iftode (1996)(Correct)
Shared virtual memory is a software technique to
provide shared memory on a network of computers
without special hardware support. Although several
relaxed consistency models and implementations are
q... / to provide shared memory on a network of computers without special br lazy release consistency based protocol called Automatic Update Release
50 Protecting Poorly Chosen Secrets from Guessing Attacks - Gong, Lomas, Needham, Saltzer (1993)(Correct)
In a security system that allows people to choose their own passwords, those people tend to choose passwords that can be easily guessed. This weakness exists in practically all widely used systems. In... / attacks to messages passed over networks in particular such attacks are br develop examples of cryptographic protocols that are immune to such
49 Proxy-Based Authorization and Accounting for Distributed Systems - Neuman (1993)(Correct)
Despite recent widespread interest in the secure authentication
of principals across computer networks
there has been considerably less discussion of distributed
mechanisms to support authorization an... / of principals across computer networks there has been considerably less br by the underlying authentication protocol e.g.for key distribution are
48 Active Storage for Large-Scale Data Mining and Multimedia - Riedel, Gibson, Faloutsos (1998)(Correct)
The increasing performance and decreasing cost
of processors and memory are causing system
intelligence to move into peripherals from the
CPU. Storage system designers are using this
trend toward "exc... / simple and inexpensive devices. Network interfaces peripheral adapters br low levels of the storage protocol. At the same time trends in
48 The Design of Nectar: A Network Backplane for Heterogeneous.. - Arnould (1989)(Correct)
Nectar is a "network backplane" for use in heterogeneous
multicomputers. The initial system consists of a starshaped
fiber-optic network with an aggregate bandwidth
of 1.6 gigabits/second and a switch... / The Design of Nectar A Network Backplane for Heterogeneous br to communicate at a high level. Protocol processing is off-loaded to
47 Cache Digests - Rousskov, Wessels (1998)(Correct)
This paper presents Cache Digest, a novel protocol and optimization technique for cooperative
Web caching. Cache Digest allows proxies to make information about their cache contents
available to peers... / National Laboratory for Applied Network Research April br presents Cache Digest a novel protocol and optimization technique for
46 Adversarial Queueing Theory - Kleinberg (1996)(Correct)
proposed a model of continuous packet injection in which probabilistic assumptions were replaced by worst--case inputs. Our goal was to determine whether it was feasible to prove stability results eve... / the behavior of communication networks in which packets are generated br and on the contention resolution protocol that is used when more than one
45 On Path Selection for Traffic with Bandwidth Guarantees - Ma, Steenkiste (1997)(Correct)
Transmission of multimedia streams imposesa minimum-bandwidth
requirementon the path being used to ensureend-to-end Quality-ofService
(QoS) guarantees. While any shortest-path algorithm can
be used to... / consumption and balance the network load are needed to achieve
45 Security Properties of Typed Applets - Leroy, Rouaix(Correct)
This paper formalizes the folklore result that strongly-typed
applets are more secure than untyped ones. We formulate
and prove several security properties that all well-typed applets
possess, and ide... / personal information over the network The corresponding security br Dyade under the Verified Internet Protocols project. To appear in the
45 An Argument for Simple COMA - Ashley Saulsbury (1995)(Correct)
We present design details and some initial performance
results of a novel scalable shared memory
multiprocessor architecture. This architecture features
the automatic data migration and replication ca... / remotely across an interconnection network. The access performance of the br hardware and data coherence protocols. Distributed Virtual Shared
45 NetCash: A design for practical electronic currency on the Internet - Medvinsky (1993)(Correct)
NetCash is a framework that supports realtime electronic payments
with provision of anonymity over an unsecure network.
It is designed to enable new types of services on the Internet
which have not be... / of anonymity over an unsecure network. It is designed to enable new br which proposed electronic currency protocols can be integrated with the
45 Real-Time Internet Video Using Error Resilient Scalable Compression.. - Tan (1999)(Correct)
We introduce a point to point real-time video transmission scheme over the Internet combining a
low-delay TCP-friendly transport protocol in conjunction with a novel compression method that is
error r... / the video bit rate according to network conditions. Lack of bandwidth br And Tcp-Friendly Transport Protocol Wai-Tian Tan And Avideh Zakhor
45 Reliable Multicast Transport Protocol (RMTP) - Paul, Sabnani (1997)(Correct)
This paper presents the design, implementation and performance of a reliable multicast transport protocol called RMTP. RMTP is based on a hierarchical structure in which receivers are grouped into loc... / Communications special issue on Network Support for Multipoint
45 Lazy Release Consistency for Distributed Shared Memory - Keleher (1995)(Correct)
A software distributed shared memory (DSM) system allows shared memory parallel
programs to execute on networks of workstations. This thesis presents a new class
of protocols that has lower communicat... / parallel programs to execute on networks of workstations. This thesis
44 Scalable Reliable Multicast Using Multiple Multicast Groups - Sneha Kasera (1996)(Correct)
We examine an approach for providing reliable, scalable multicast communication,
involving the use of multiple multicast groups for reducing receiver processing costs
in a multicast session. In this a... / the receivers to the underlying network and at the same time br join or leave. We first show that protocols using an infinite number of
44 Frangipani: A Scalable Distributed File System - Thekkath, Mann, Lee (1997)(Correct)
The ideal distributed file system wouldprovide all its users with coherent,
shared access to the same set of files,yet would be arbitrarily
scalable to provide more storage space and higher performanc... / untrusted machines using ordinary network file access protocols. We have br using ordinary network file access protocols. We have implemented Frangipani
44 Mobility Support in IPv6 - Perkins, Johnson (1996)(Correct)
IP version 6 (IPv6) is being designed within the IETF
as a replacement for the current version of the IP protocol
used in the Internet (IPv4). We have designed
protocol enhancements for IPv6, known as... / Conference on Mobile Computing and Networking MobiCom November br on Mobile Computing and Networking MobiCom November
44 Fragmented Objects for Distributed Abstractions - Makpangou (1992)(Correct)
ions
Mesaac Makpangou Yvon Gourhant
Jean-Pierre Le Narzul
Marc Shapiro
INRIA, B.P. 105, 78153 Rocquencourt C'edex, France
tel.: +33 (1) 39-63-52-93, fax: +33 (1) 39 63 53 30
e-mail: mak@sor.inria.f... / possibly remote object. The network is transparent both for the br most appropriate communication protocol or handling failures according
43 An Architecture for Large-Scale Internet Measurement - Paxson, Mahdavi, Adams, Mathis (1998)(Correct)
Historically, the Internet has been woefully under-measured and under-instrumented. The problem is only getting worse with the network's ever-increasing size. We discuss the goals and requirements for... / Measurement Vern Paxson Network Research Group Lawrence Berkeley br that traffic mixes i.e.which protocols comprise what fraction of the
43 How to Personalize the Web - Barrett, Maglio, Kellem(Correct)
Agents can personalize otherwise impersonal computational systems. The World Wide Web presents the
same appearance to every user regardless of that user's past activity. Web Browser Intelligence (WBI,... / WBI can annotate hyperlinks with network speed information record pages br the web is the hyper-text transfer protocol HTTP although others such as
43 Scheduling From the Perspective of the Application - Berman, Wolski (1996)(Correct)
Metacomputing is the aggregation of distributed and
high-performance resources on coordinated networks. With
careful scheduling, resource-intensive applications can be
implemented efficiently on metac... / resources on coordinated networks. With careful scheduling br different hardware and software protocols. In addition resources located
43 Transactional Memory: Architectural Support for Lock-Free Data.. - Herlihy, Moss (1992)(Correct)
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be prevented from operatin... / and in Section we describe a network-based directory protocol. In br multiprocessor cachecoherence protocol. Simulation results show that
42 The SwitchWare Active Network Architecture - Alexander, al. (1998)(Correct)
Active networks must balance the flexibility of a programmable network infrastructure against the safety and security requirements inherent in sharing that infrastructure. Furthermore, this balance mu... / The SwitchWare Active Network Architecture D. Scott
42 Small Forwarding Tables for Fast Routing Lookups - Degermark, Brodnik, Carlsson, Pink (1997)(Correct)
For some time, the networking community has assumed
that it is impossible to do IP routing lookups in software
fast enough to support gigabit speeds. IP routing
lookups must find the routing entry wit... / Abstract For some time the networking community has assumed that it br Abstract For some time the networking community has assumed that it
42 Distributed Filaments: Efficient Fine-Grain Parallelism on a Cluster.. - Freeh, Lowenthal, Andrews (1994)(Correct)
A fine-grain parallel program is one in which processes are typically small, ranging from
a few to a few hundred instructions. Fine-grain parallelism arises naturally in many
situations, such as itera... / and newer e.g. FDDI ATM network technologies. While FDDI and ATM br reliable datagram communication protocol and automatically balancing the
42 MPI-FM: High Performance MPI on Workstation Clusters - Lauria, Chien (1997)(Correct)
Despite the emergence of high speed LANs, the communication performance available
to applications on workstation clusters still falls short of that available on MPPs.
A new generation of efficient mes... / implementation of MPI for networks of workstations connected with a
42 Software-Extended Coherent Shared Memory: Performance and Cost - Chaiken, Agarwal (1994)(Correct)
This paper evaluates the tradeoffs involved in the design of the
software-extended memory system of Alewife, a multiprocessor architecture
that implements coherentsharedmemory through a combination
of... / complete access to the memory and network hardware Second the br interface that facilitates protocol software implementation. This
42 A Hierarchical Fair Service Curve Algorithm for Link-Sharing.. - Ion Stoica (1997)(Correct)
In this paper, we study hierarchical resource management
models and algorithms that support both link-sharing and
guaranteed real-time services with decoupled delay (priority)
and bandwidth allocation... / The emerging integrated services networks will support applications with br to administrative affiliation protocol traffic type or other criteria.
42 Symbolic Model Checking with Rich Assertional Languages - Kesten, Maler, Marcus, Pnueli, Shahar(Correct)
The paper shows that, by an appropriate choice of a rich assertional
language, it is possible to extend the utility of symbolic model
checking beyond the realm of bdd-represented finite-state system... / unbounded parameterized process networks. The main contributions of the br of whether the Futurebus protocol in its last version contains
41 MGS: A Multigrain Shared Memory System - Yeung (1996)(Correct)
Parallel workstations, each comprising 10-100 processors, promise cost-effective general-purpose multiprocessing. This paper explores the coupling of such small- to medium-scale shared memory multipro... / through software over a local area network to synthesize larger shared br a complete shared memory protocol that allows hardware and
41 On Performance of Caching Proxies - Rousskov(Correct)
This paper presents a performance study of the state-of-the-art caching proxy called Squid.
We instrumented Squid to measure per request network and disk activities and conducted
a series of experimen... / Squid to measure per request network and disk activities and conducted br through a proxy encounters extra protocol overheads and processing delays.
41 iKP - A Family of Secure Electronic Payment Protocols - Bellare, Garay, Hauser, Herzberg.. (1995)(Correct)
Mihir Bellare
y
, Juan A. Garay
z
, Ralf Hauser
x
, Amir Herzberg
z
,
Hugo Krawczyk
z
, Michael Steiner
x
, Gene Tsudik
x
, Michael Waidner
x
August 2, 1995
Abstract
This paper propose... / while using the existing financial network for clearing and authorization. br of Secure Electronic Payment Protocols Extended Abstract Mihir
41 Building Reliable Distributed Systems with CORBA - Landis, Maffeis (1997)(Correct)
New classes of large-scale distributed applications will
have to deal with unpredictable communication delays,
with partial failures, and with networks that
partition. In addition, sophisticated appli... / with partial failures and with networks that partition. In addition br group handles all reliability protocols automatically so they are
40 A Survey of QoS Architectures - Aurrecoechea, Campbell, Hauw (1996)(Correct)
Over the past several years there has been a considerable amount of research within the field of quality of service (QoS) support for distributed multimedia systems. To date, most of the work has been... / system transport subsystem and network. Much less progress has been made
40 A Language-Based Approach to Protocol Implementation - Abbott, Peterson (1993)(Correct)
Morpheus is a special-purpose programming language that facilitates the efficient implementation of communication protocols. Protocols are divided into three categories, called shapes, so that they ca... / protocols. Introduction Network software is difficult to design br A Language-Based Approach to Protocol Implementation Mark B. Abbott
40 Membership Algorithms for Multicast Communication Groups - Amir, Dolev, Kramer, Malki (1992)(Correct)
We introduce a membership protocol that maintains the set
of currently connected machines in an asynchronous and dynamic environment.
The protocol handles both failures and joining of machines. It
o... / Almaden Research Center uses the network broadcast capability. Typically br We introduce a membership protocol that maintains the set of
40 The Structure of a Multi-Service Operating System - Roscoe (1995)(Correct)
This position paper describes research in progress into a new approach to structuring an operating
system. This approach is intended to facilitate the provision of "Quality of Service"
guarantees of r... / devices by filing systems and network protocols etc. Much recent br by filing systems and network protocols etc. Much recent research has
39 MTCP: Scalable TCP-like Congestion Control for Reliable Multicast - Rhee (1998)(Correct)
We present MTCP, a congestion control scheme for large-scale reliable multicast. Congestion control for reliable multicast is important, because of its wide applications in multimedia and collaborativ... / traffic requires the underlying network to provide per-flow resource br parts of a multicast tree. Our protocol incorporates several novel
39 Measuring the Capacity of a Web Server - Banga, Druschel (1997)(Correct)
The widespread use of the World Wide Web and related
applications places interesting performance demands on
network servers. The ability to measure the effect of these
demands is important for tuning ... / interesting performance demands on network servers. The ability to measure br and servers and stresses the protocols that the Web is based on.
39 Analysis of Audio Packet Loss in the Internet - Bolot, Crépin, Garcia (1995)(Correct)
We consider the problem of distributing audio data over networks such as the Internet that do not provide support for real-time applications. Experiments with such networks indicate that audio quality... / of distributing audio data over networks such as the Internet that do not br One approach is to extend current protocols and switch scheduling
38 Verifying Systems with Replicated Components in Mur phi - Ip, Dill (1997)(Correct)
An extension to the Murphi verifier is presented to verify systems with replicated identical components. Although most systems are finite-state in nature, many of them are also designed to be scalable... / require an invariant process or a network invariant br keyword formal verification protocol verification model checking
38 Multicast Transport Protocols for High Speed Networks - Paul (1994)(Correct)
This paper presents the design and analysis of three reliable multicast transport protocols for high speed networks. The novelty of these protocols lies in the technique used in combining the acknowle... / Transport Protocols for High Speed Networks Sanjoy Paul Krishan K. Sabnani br Multicast Transport Protocols for High Speed Networks