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.
1284.5 Random Early Detection Gateways for Congestion Avoidance - Floyd, Van Jacobson (1993)(Correct)
This paper presents Random Early Detection (RED) gateways for congestion avoidance in packetswitched
networks. The gateway detects incipient congestion by computing the average queue size. The
gateway... / gateways the possibilities of routing changes as well as by other br RED gateways could also be used in routers with resource management where
1209.0 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... / the Internet infrastructure where routers detect congestion before the br before the queue overflows routers are no longer limited to packet
1150.5 RSVP: A New Resource ReSerVation Protocol - Zhang, Deering, Estrin, Shenker.. (1993)(Correct)
this article we describe another. unknown RSVP: A New Resource ReSerVation Protocol
Lixia Zhang
, Steve Deering
, Deborah Estrin
, Scott Shenker
, Daniel Zappala
flixia, deering, shenkerg@parc.xer... / in References Routing The network must decide how to br component of the architecture is a routing protocol that can provide quality
1124.6 Wide-Area Traffic: The Failure of Poisson Modeling - Paxson, Floyd (1995)(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... / IP traffic such as routing updates can result in br The Synchronization of Periodic Routing Messages IEEE ACM Transactions
937.1 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... / functionalities of multicast routers and is suitable for continuous br transfer of bulk data. Multicast routing provides the basic mechanism for
935.8 Integrated Services in the Internet Architecture: an Overview - Braden, Clark, Shenker (1994)(Correct)
This memo discusses a proposed extension to the Internet architecture and protocols
to provide integrated services, i.e., to support real-time as well as the current non-realtime
service of IP. This e... / . Routing and Reservations br generally available in commercial routers is being provided by the MBONE
826.8 LogP: Towards a Realistic Model of Parallel Computation - Culler, Karp, Patterson, Sahay.. (1993)(Correct)
A vast body of theoretical research has focused either on overly simplistic models of parallel
computation, notably the PRAM, or overly specific models that have few representatives in
the real world.... / ones such as network topology and routing algorithm. The LogP model br components. Finally adaptive routing techniques are becoming
805.7 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... / for example a cache array routing protocol that partitions the URL br in the literature. The Cache Array Routing Protocol divides URL-space
740.7 Pvm 3 User's Guide And Reference Manual - Geist, Beguelin, Dongarra, Jiang.. (1994)(Correct)
This report is the PVM version 3.3 users' guide and reference manual. It
contains an overview of PVM, and how version 3 can be obtained, installed and
used.
PVM stands for Parallel Virtual Machine. It... / . . Message Direct Routing br A. Reference pages for PVM routines
686.9 Dynamic Source Routing in Ad Hoc Wireless Networks - Johnson, Maltz (1996)(Correct)
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the
aid of any established infrastructure or centralized administration. In such an environment, it may b... / Dynamic Source Routing in Ad Hoc Wireless Networks br This paper presents a protocol for routing in ad hoc networks that uses
672.7 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... / guaranteed services require routers to manage per flow states and br architecture in which only edge routers perform per flow management but
672.3 Multidimensional Access Methods - Gaede, Günther (1997)(Correct)
Search operations in databases require some special support at the physical
level. This is true for conventional databases as well as for spatial databases, where
typical search operations include the... / include intersection and geometric routing Shekhar and Liu
605.7 An Active Service Framework and its Application to Real-time.. - Amir, McCanne, Katz (1998)(Correct)
Several recent proposals for an "active networks" architecture advocate the placement of user-defined computation within the network as a key mechanism to enable a wide range of new applications and p... / networks preserves all of the routing and forwarding semanticsof br and applications like nomadic routing localized TCP
579.7 vic: A Flexible Framework for Packet Video - McCanne, Van Jacobson (1995)(Correct)
The deployment of IP Multicast has fostered the development of a suite of applications, collectively known as the MBone tools, for real-time multimedia conferencingover the Internet. Two of these tool... / which extends the traditional IP routing model for efficient multipoint br DEERING S. E. Multicast Routing in a Datagram Internetwork. PhD
511.1 Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV).. - Perkins (1994)(Correct)
An ad-hoc network is the cooperative engagement of
a collection of Mobile Hosts without the required intervention
of any centralized Access Point. In this paper
we present an innovative design for the... / Distance-Vector Routing DSDV for Mobile Computers br each Mobile Host as a specialized router which periodically advertises
472.4 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... / End-to-End Routing Behavior in the Internet Vern br The large-scale behavior of routing in the Internet has gone
414.8 An Architecture for Wide-Area Multicast Routing - Deering, Estrin, Farinacci, Van.. (1994)(Correct)
Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and senders to those group mem... / for Wide-Area Multicast Routing Stephen Deering Xerox br Abstract Existing multicast routing mechanisms were intended for use
405.7 A Reliable Dissemination Protocol for Interactive Collaborative.. - Yavatkar (1995)(Correct)
The widespread availability of networked multimedia workstations and PCs has caused a significant interest in the use of collaborative multimedia applications. Examples of such applications include di... / of IP multicast for packet routing and delivery. However for the br provides scalable and efficient routing and delivery of IP packets to
377.7 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... / to the OSPF protocol enabling the routing of IP multicast datagrams. In br proposal an IP multicast packet is routed based both on the packet's source
368.1 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... / Gateway H Ethernets H Router Mbone Isdn Isdn Mbone Router br H Router Mbone Isdn Isdn Mbone Router Gateway Campus Backbone
361.7 SPAND: Shared Passive Network Performance Discovery - Srinivasan Seshan (1997)(Correct)
In the Internet today, users and applications must often
make decisions based on the performance they expect to
receive from other Internet hosts. For example, users
can often view many Web pages in l... / on statistics such as hop count routing metrics round-trip latency br be measured at the sender. If the routers in the network do not implement
359.4 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... / for Wide-Area Multicast Routing Stephen Deering Deborah br The purpose of multicast routing is to reduce the communication
356.5 Quality of Service Routing for Supporting Multimedia Applications - Wang, Crowcroft (1996)(Correct)
In recent years, several new architectures have been developed for supporting multimedia
applications such as digital video and audio. However, quality of service routing
is an important element that ... / Quality of Service Routing for Supporting Multimedia br audio. However quality of service routing is an important element that is
356.5 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... / This is possibly due to the routing updates as reported in The br experimental observations on routing behavior in the Internet are
353.6 How to Model an Internetwork - Zegura, Calvert, Bhattacharjee (1996)(Correct)
Graphs are commonly used to model the structure of internetworks, for the study of problems ranging from routing to resource reservation. A variety of graph models are found in the literature, includi... / the study of problems ranging from routing to resource reservation. A br problems related to routing resource reservation and
346.5 SIS: A System for Sequential Circuit Synthesis - Sentovich, Singh, Lavagno, Moon.. (1992)(Correct)
SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a
signal transition graph, or a logic-level description of a sequential circuit, it pr... / technology mapping placement and routing tools in the Octtools produce a br BLIF specification. SIS provides routines for interactively manipulating
345.4 The End-to-End Effects of Internet Path Selection - Savage, Collins, Hoffman, Snell.. (1999)(Correct)
The path taken by a packet traveling across the Internet depends on a large number of factors, including routing protocols
and per-network routing policies. The impact of these factors on the end-to-e... / large number of factors including routing protocols and per-network br routing protocols and per-network routing policies. The impact of these
337.1 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... / code to call node-resident service routines written in other more br by the protocol software in the routers and the execution of the
336.3 Measuring Bandwidth - Lai, Baker (1999)(Correct)
Accurate network bandwidth measurement is important to a variety of network applications. Unfortunately, accurate bandwidth measurement is difficult. We describe some current bandwidth measurement tec... / the bottleneck bandwidth of a route. Developers of network protocols br information to build multicast routing trees more efficiently and
310.6 Internet Routing Instability - Craig Labovitz (1997)(Correct)
This paper examines the network inter-domain routing information
exchanged between backbone service providers at
the major U.S. public Internet exchange points. Internet
routing instability, or the ra... / Internet Routing Instability Craig Labovitz br examines the network inter-domain routing information exchanged between
301.4 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... / way. We call these modules routers for reasons that will become br a moment but for now think of each router as implementing a certain
297.8 A Quantitative Comparison of Graph-based Models for Internet Topology - Zegura, Calvert, Donahoo (1997)(Correct)
Graphs are commonly used to model the topological structure
of internetworks, to study problems ranging from routing
to resource reservation. A variety of graphs are found
in the literature, including... / to study problems ranging from routing to resource reservation. A br specific problem namely multicast routing. Keywords Scalability
291.3 A Quality of Service Architecture - Campbell (1994)(Correct)
For applications relying on the transfer of multimedia, and in particular continuous
media, it is essential that quality of service (QoS) is guaranteed system-wide, including endsystems,
communicati... / resource reservation and QoS based routing QoS re-negotiation QoS br network devices can be switches routers multimedia workstations
283.9 PVM: Parallel Virtual Machine - Geist, Beguelin, Dongarra, Jiang.. (1994)(Correct)
this reporting is to be turned on (1) or turned off (0) for subsequent
calls. A value of (2) will cause the program to exit after printing the error message (not
implemented in 3.2). The default is re... / and Task-Task . Message Routing . . Pvmd . . Pvmd br of PVM Versions B PVM Routines Bibliography Index
281.8 Defending Against Denial of Service Attacks in Scout - Spatscheck, Peterson (1999)(Correct)
We describe a two-dimensional architecture for defending
against denial of service attacks. In one dimension, the architecture
accounts for all resources consumed by each I/O
path in the system; this ... / web and file servers firewalls and routers and multimedia displays. For br of the IP module has access to the routing tables stored in the IP module.
281.8 LIME: Linda Meets Mobility - Picco, Murphy, Roman (1999)(Correct)
Lime is a system designed to assist in the rapid development of dependable mobile applications over both wired and ad hoc networks. Mobile agents reside on mobile hosts and all communication takes pla... / all the network facilities e.g.routing must be implemented by relying br links and the presence of routing capabilities in the physical
276.5 Baring it all to software: Raw machines - Waingold, al. (1997)(Correct)
this article. This project is funded by US Defense Advanced Research Projects Agency contract DABT63-96-C-0036 and a National Science Foundation Presidential Young Investigator Award. Ikos Systems don... / and compiler-orchestrated static routing. The tiles are connected with br wires. The dynamic wormhole router makes routing decisions based on
269.5 QoS Routing Mechanisms and OSPF Extensions - Guerin, Orda, Williams (1996)(Correct)
This paper presents and discusses path selection algorithms to support QoS routes in IP networks. The work is carried out in the context of extensions to the OSPF protocol, and the initial focus is on... / QoS Routing Mechanisms and OSPF Extensions br algorithms to support QoS routes in IP networks. The work is
269.1 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... / B. Content-based routing architecture ala DRPI br to use knowledge in the KB to route messages to appropriate other
263.2 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 ... / forms of network connectivity and routing because their location and br their location and hence the route to reach them cannot be deduced
262.8 Adversarial Queueing Theory - Borodin, Kleinberg, Raghavan, Sudan, .. (1998)(Correct)
this paper a request is a path specifying
the route followed by a packet. We say that the adversary injects a set of packets when it generates
a set of requested paths. We restrict ourselves to the ca... / of dynamic or continuous packet routing we introduce a new approach to br systems. In the context of packet routing our objective is to study
257.1 Pricing Multicast Communication: A Cost-Based Approach - John Chuang (1998)(Correct)
Multicast and unicast traffic share and compete for network resources. To facilitate
efficient and equitable resource allocation between traffic types, this paper advocates a costbased
approach to mul... / multiple destinations only when routing paths diverge. By avoiding the br as opposed to node costs such as routing table memory CPU usage etc.
255.3 InfoSleuth: Agent-Based Semantic Integration of Information in Open.. - Bayardo, Jr., Bohrer, Brice.. (1997)(Correct)
The goal of the InfoSleuth project at MCC is to exploit and synthesize new technologies into a unified system that retrieves and processes information in an ever-changing network of information source... / retrieval and update requests can be routed only to the relevant resources. br The InfoSleuth architecture are routed by mediation and brokerage agents
245.7 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... / study of end-to-end Internet routing and packet dynamics we br requests to either measure the route between the NPD host and a remote
242.5 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... / Scalable High Speed IP Routing Lookups Marcel Waldvogel y br problem because of increasing routing table sizes increased traffic
237.6 Towards Programmable Networks - Yechiam Yemini (1996)(Correct)
Intermediate nodes (e.g., routers, switches) of current networks, in contrast with end nodes (e.g.,
PCs workstations), are vertically integrated closed systems. Their functions, mostly implemented
by ... / Intermediate nodes e.g.routers switches of current networks br is particularly suitable to program routing packet analyzers or signaling
237.6 Private Network-Network Interface Specification Version 1.0 (PNNI 1.0) - Forum (1996)(Correct)
this document or its contents does not in any way create by implication or
otherwise: unknown Technical Committee
Private Network-Network Interface
Specification Version 1.0
(PNNI 1.0)
af-pnni-0055.00... / Dykeman was the editor for the PNNI Routing related sections of the br . Pnni Routing
236.7 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... / the Frontier series Mesh Routing Chip FMRC from Caltech. The br The mesh network uses wormhole routing a variant of cut-through
234.7 Generalizing GlOSS to Vector-Space Databases and Broker Hierarchies - Gravano, Garcia-Molina (1995)(Correct)
As large numbers of text databases have become
available on the Internet, it is harder to
locate the right sources for given queries. In
this paper we present gGlOSS, a generalized
Glossary-Of-Server... / a given query. The content-based routing system of keeps a br and David K. Gifford. A content routing system for distributed
232.9 High Speed Switch Scheduling for Local Area Networks - Anderson, Owicki, Saxe, Thacker (1993)(Correct)
Current technology trends make it possible to build communication networks that can support high performance distributed computing. This paper describes issues in the design of a prototype switch for ... / high link speeds. Moreover quick routing and switching decisions are br to controllers in any topology. Routing in the network is based on
229.7 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... / arise concerning the Internet's routing protocols and distributed domain br TCP uses information present in its route cache to guide its choice in
226.0 Optimizing Power Using Transformations - Chandrakasan, Potkonjak, Mehra.. (1995)(Correct)
The increasing demand for portable computing has elevated power consumption to be one of the most critical design parameters. A high-level synthesis system, HYPER-LP, is presented for minimizing pow... / in minimizing the interconnect routing lengths and their associated br obstacles during floorplanning and routing. However the amount of
226.0 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... / ranging from those requiring routing layer support e.g.anycast to br a range of techniques ranging from routing-layer multicast and its
225.5 Modeling Internet Topology - Calvert (1997)(Correct)
The topology of a network, or a group of networks such as the Internet, has a strong bearing on many management and performance issues. Good models of the topological structure of a network are essent... / problems related to routing resource reservation and br with nodes representing switches or routers and edges representing di-
217.0 JPVM: Network Parallel Computing in Java - Ferrari (1997)(Correct)
The JPVM library is a software system for explicit message-passing based parallel programming in Java. The library supports an interface similar to the C and Fortran interface of the Parallel Virtual ... / and default-case direct message routing. JPVM is implemented entirely in br and invoke special library routines to control the creation of
211.4 PLAN: A Programming Language for Active Networks - Hicks, Kakkar, Moore, Gunter, Nettles (1998)(Correct)
PLAN (Programming Language for Active Networks) is a new language for programs that are carried in the packets of a programmable network. PLAN programs replace the packet headers (which can be viewed ... / allowing PLAN code to call service routines written in other more br powerful languages. These service routines may also be loaded into the
208.6 Training Algorithms for Linear Text Classifiers - Lewis, Schapire, Callan, Papka (1996)(Correct)
Systems for text retrieval, routing, categorization and other IR tasks rely heavily on linear classifiers. We propose that two machine learning algorithms, the Widrow-Hoff and EG algorithms, be used i... / Systems for text retrieval routing categorization and other IR br on several categorization and routing tasks. Introduction
208.3 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... / Main Alewife Node Fpu Network Router Cache Processor Cache br controller and a network routing switch. Multiple nodes are
205.7 IP Switching: ATM Under IP - Newman, Minshall, Lyon (1998)(Correct)
IP traffic on the Internet and private enterprise networks has been growing exponentially for some time. This growth is beginning to stress the traditional, processor based design of current day route... / based design of current day routers. Switching technology offers br are under way to support IP routing over an ATM network. However
200.0 Improving Reliable Transport and Handoff Performance in Cellular.. - Balakrishnan, Seshan, Katz (1995)(Correct)
TCP is a reliable transport protocol tuned to perform well in traditional networks where congestion is the primary
cause of packet loss. However, networks with wireless links and mobile hosts incur si... / rates. The second part is a routing protocol that enables low-latency br times shorter than other mobile routing protocols. . Introduction
199.9 How bad is Reliable Multicast without Local Recovery? - Nonnenmacher, Lacher, Jung.. (1998)(Correct)
We examine the impact of the loss recovery mechanism on the performance of a reliable multicast protocol. Approaches to reliable multicast can be divided into two major classes: sourcebased recovery, ... / and assume the multicast routing tree to be created by some br to be created by some multicast routing algorithm. We consider
191.4 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... / addressed the issue of multicast routing A D DC BFC br For example any multicast routing protocol such as DVMRP DC
191.4 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... / a systematic evaluation of four routing algorithms that offer different br robustness to inaccurate routing information and sensitivity to
188.5 Active Reliable Multicast - Lehman, Garland, Tennenhouse (1998)(Correct)
This paper presents a novel loss recovery scheme, Active Reliable Multicast (ARM), for large-scale reliable multicast. ARM is "active" in that routers in the multicast tree play an active role in loss... / multicast. ARM is active in that routers in the multicast tree play an br In the upstream direction routers suppress duplicate NACKs from
182.8 On Calibrating Measurements of Packet Transit Times - Paxson (1998)(Correct)
We discuss the problem of detecting errors in measurements of the
total delay experienced by packets transmitted through a wide-area
network. We assume that we have measurements of the transmission
ti... / a large-scale study of Internet routing found that paths through the br meaning that the series of routers visited in the two directions
181.8 Detour: a Case for Informed Internet Routing and Transport - Savage, Aggarawl, Becker, Cardwell.. (1999)(Correct)
Despite its obvious success, robustness, and scalability, the Internet suffers from a number of end-to-end performance
and availability problems. In this paper, we attempt to quantify the Internet's i... / a Case for Informed Internet Routing and Transport Stefan Savage br be improved by spreading intelligent routers at key access and interchange
181.8 Key Management for Secure Internet Multicast using Boolean Function.. - Isabella Chang (1999)(Correct)
The Internet today provides no support for privacy or authentication
of multicast packets. However, an increasing number of applications
will require secure multicast services in order to restrict gro... / IGMP messages to their local routers To send datagrams to a br of the multicast capable routers to communicate with each other
179.3 The Design and Implementation of a Mobile Internetworking Architecture - Ioannidis, Maguire, Jr. (1993)(Correct)
We present the design, implementation, and evaluation of Mobile*IP, a set of IP-based protocols and
mechanisms to support host mobilitythroughout the Internet. The design requires changes only in the ... / the mobile hosts and their special routers leaves transport and higher br are needed in non-mobile hosts and routers the system scales well and has
178.7 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... / Small Forwarding Tables for Fast Routing Lookups Mikael Degermark br that it is impossible to do IP routing lookups in software fast enough
177.1 Boosting and Rocchio Applied to Text Filtering - Schapire, Singer, Singhal (1998)(Correct)
We discuss two learning algorithms for text filtering: modified
Rocchio and a boosting algorithm called AdaBoost. We show
how both algorithms can be adapted to maximize any general
utility matrix that... / more recently for document routing as a comparison baseline br algorithm is quite similar to the routing algorithm used in except
177.1 A comparison of reliable multicast protocols - Levine, Garcia-Luna-Aceves (1998)(Correct)
F4.2e+05> We analyze the maximum throughput that known
classes of reliable multicast transport protocols can attain.
A new taxonomy of reliable multicast transport protocols is
introduced based on t... / assumes the existence of multicast routing trees provided by underlying br provided by underlying multicast routing protocols. In the Internet
174.4 Anonymous Connections and Onion Routing - Syverson, Goldschlag, Reed (1997)(Correct)
Onion Routing provides anonymous connections
that are strongly resistant to both eavesdropping and
traffic analysis. Unmodified Internet applications can
use these anonymous connections by means of pr... / Anonymous Connections and Onion Routing to appear IEEE Symposium br Anonymous Connections and Onion Routing Paul F. Syverson David M.
173.9 MPVM: A Migration Transparent Version of PVM - Jeremy Casas (1995)(Correct)
Parallel Virtual Machine (PVM) is a widely-used software
system that allows a heterogeneous set of parallel and
serial UNIX-based computers to be programmed as a single
distributed-memory parallel mac... / PVM application. PVM provides two routing mechanisms for application br messages indirect and direct routing. The choice of routing mechanism
173.1 A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks - Duato (1993)(Correct)
Second generation multicomputers use wormhole routing, allowing
a very low channel set-up time and drastically reducing the dependency
between network latency and internode distance. Deadlock-free
rou... / Theory of Deadlock-Free Adaptive Routing in Wormhole Networks Jos'e br multicomputers use wormhole routing allowing a very low channel
173.1 An Implementation of the Contract Net Protocol Based on Marginal Cost .. - Sandholm (1993)(Correct)
This paper presents a formalization of the bidding and
awarding decision process that was left undefined in
the original contract net task allocation protocol. This
formalization is based on marginal ... / cooperate automatically in vehicle routing. The implementation is br solved. Our case problem vehicle routing is structured in terms of a
171.0 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... / path trees from the unicast routing mechanisms When br trees would be mapped to the same routes anyway. Perhaps most important is
171.0 Efficient Fair Queuing using Deficit Round Robin - Shreedhar, Varghese (1995)(Correct)
Fair queuing is a technique that allows each flow passing through a network device to have a fair
share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness
we... / of the buffers at an intermediate router this can result in dropped br active at the gateway or router. With a large number of active
171.0 Low-Latency Communication over ATM Networks using Active Messages - von Eicken, Avula, Basu, Buch (1995)(Correct)
Recent developments in communication architectures for parallel machines have made significant progress and reduced the communication overheads and latencies by over an order of magnitude as compared ... / to parallel machine networks and routing latencies are on the order of br Whenever the input buffer of a router fills up the output of the
168.1 An Efficient Routing Protocol for Wireless Networks - Murthy, Garcia-Luna-Aceves (1996)(Correct)
this paper describes a wireless routing protocol (WRP) for a packet
radio network based on PFA, illustrating the key aspects of the protocol's operation.
The following sections show that the protocol ... / Baltzer Journals An Efficient Routing Protocol for Wireless Networks br CA We present the wireless routing protocol WRP In WRP routing
167.2 A General Approximation Technique For Constrained Forest Problems - Goemans, Williamson (1992)(Correct)
We present a general approximation technique for a large class of graph problems.
Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph
with trees, cycles or... / networks VLSI design and vehicle routing. We have also been able to apply br of communication networks vehicle routing and cluster analysis. These
162.8 Programmable Active Memories: a Performance Assessment - Bertin, Roncin, Vuillemin (1993)(Correct)
We present some quantitative performance measurements for the computing power of Programmable
Active Memories (PAM), as introduced by [BRV89]. Based on Field Programmable
Gate Array (FPGA) technology,... / are provided for global data routing represented here with br interconnection network for data routing and switching. March
161.7 A New Location Technique for the Active Office - Ward, Jones, Hopper (1997)(Correct)
this paper, we first present an overview of research into location-aware computing and evaluate currently available location sensor technologies. We then describe a new location sensor, tailored to pr... / been used include telephone call routing security and environmental
160.8 Unicast-Based Multicast Communication in Wormhole-Routed Networks - McKinley, Xu, Esfahanian, Ni (1993)(Correct)
Multicast communication, in which the same message is delivered from a source node to an arbitrary number of destination nodes, is being increasingly demanded in parallel computing. System supported m... / Communication in Wormhole-Routed Networks Philip K. McKinley br Multicast Communication in Wormhole-Routed Networks y Philip K.
151.7 First IETF Internet Audiocast - Casner, Deering (1992)(Correct)
this article appeared in ConneXions, The Interoperability Report, Vol.6, No.6 (June 1992). unknown
For: casner
Printed on: Mon, Jul 27, 1992 20:21:17
Document: CCR-audiocast
Last saved on: Mon, Jul 2... / the endpoints. IP multicast routing to replicate the packets br be added to it. . IP multicast routing
148.9 An Adaptive Web Page Recommendation Service - Balabanovic (1997)(Correct)
An adaptive recommendation service seeks to adapt
to its users, providing increasingly personalized recommendations
over time. In this paper we introduce
the "Fab" adaptive web page recommendation ser... / been studied in the context of the routing task at the TREC conferences br document representations for the routing problem. In Proceedings of the
148.5 Distributional Clustering of Words for Text Classification - Baker, McCallum (1998)(Correct)
This paper describes the application of Distributional Clustering [20] to document classification. This approach clusters words into groups based on the distribution of class labels associated with ea... / large population high-volume routing tasks as required by companies
147.8 Asynchronous Design Methodologies: An Overview - Hauck (1995)(Correct)
Asynchronous design has been an active area of research since at least the mid 1950's, but has
yet to achieve widespread use. We examine the benefits and problems inherent in asynchronous
computations... / do not even allow these. Placement routing partitioning logic synthesis br to different fork ends automatic routing software and technologies such
142.0 Scalable Compression and Transmission of Internet Multicast Video - McCanne (1996)(Correct)
Scalable Compression and Transmission of Internet Multicast Video
by
Steven Ray McCanne
Doctor of Philosophy in Computer Science
University of California at Berkeley
Professor Martin Vetterli, Chair
... / . Orthogonality of Routing br serving as programmable routers and interconnected via T links
140.4 GeoCast - Geographic Addressing and Routing - Navas, Imielinski (1997)(Correct)
In the near future GPS will be widely used, thus allowing
a broad variety of location dependent services
such as direction giving, navigation, etc. In this paper
we propose and evaluate a routing and ... / GeoCast -Geographic Addressing and Routing Julio C. Navas and Tomasz br paper we propose and evaluate a routing and addressing method to
137.1 Fast address lookup for Internet routers - Nilsson, Karlsson (1998)(Correct)
We consider the problem of organizing address tables for internet routers to enable fast
searching. Our proposal is to to build an efficient, compact and easily searchable implementation
of an IP rout... / Fast address lookup for Internet routers Stefan Nilsson Department br address tables for internet routers to enable fast searching. Our
136.3 PLANet: An Active Internetwork - Michael Hicks (1999)(Correct)
We present PLANet: an active network architecture and implementation.
In addition to a standard suite of Internet-like services,
PLANet has two key programmability features:
1. all packets contain pro... / . all packets contain programs . router functionality may be extended br for Active Networks while dynamic router extensions are written in OCaml
133.3 An Algorithm for Rate Allocation in a Packet-Switching Network with.. - Charny (1994)(Correct)
As the speed and complexity of computer networks evolve, sharing network
resources becomes increasingly important. Thus, the issue of how to allocate
the available bandwidth among the multitude of use... / individual user load and occasional route changes. An upper bound on br . Route Selection
131.9 A Sanctuary for Mobile Agents - Yee (1997)(Correct)
ly, this is a circuit of the (complete) graph connecting the airline servers, and the originator may chose this circuit at the time of agent dispatch. At any honest server, the agent code and its read... / trip timing seat preference and routing constraints. One of the airlines
131.9 An Analysis of Internet Inter-Domain Topology and Route Stability - Govindan, Reddy (1997)(Correct)
The Internet routing fabric is partitioned into several domains. Each domain represents a
region of the fabric administered by a single commercial entity. Over the past two years, the
routing fabric h... / Internet Inter-Domain Topology and Route Stability Ramesh Govindan br Abstract The Internet routing fabric is partitioned into
131.4 A Comparison of Server-Based and Receiver-Based Local Recovery.. - Kasera, Kurose, Towsley (1998)(Correct)
Local recovery approaches for reliable multicast have the potential to provide significant
performance gains in terms of reduced bandwidth and delay, and higher system throughput. In
this report we ex... / repair servers co-located with routers inside the network. In the br networks provide efficient routing and delivery of packets to
130.8 Where is Time Spent in Message-Passing and Shared-Memory Programs? - Chandra, Larus, Rogers (1994)(Correct)
Message passing and shared memory are two techniques parallel
programs use for coordination and communication. This
paper studies the strengths and weaknesses of these two mechanisms
by comparing equi... / of time in communication library routines despite the CM- 's efficient br implementations of the Locus-Route standard cell routing program.
130.8 Interprocessor Collective Communication Library (InterCom) - Barnett, Gupta, Payne, al. (1994)(Correct)
In this paper, we outline a unified approach for building a library of collective communication operations that performs well on a cross-section of problems encountered in real applications. The targe... / two-dimensional mesh with worm-hole routing but the techniques also apply br nodes and worm-hole cut-through routing. Furthermore we assume that it
127.8 Throughput-Competitive On-Line Routing - Awerbuch (1993)(Correct)
We develop a framework that allows us to address the issues of admission control and
routing in high-speed networks under the restriction that once a call is admitted and routed,
it has to proceed to ... / Throughput-Competitive On-Line Routing Baruch Awerbuch Lab. br issues of admission control and routing in high-speed networks under the
127.6 ICP and the Squid Web Cache - Wessels (1997)(Correct)
We describe the structure and functionality of the Internet Cache Protocol (ICP) and its
implementation in the Squid Web Caching software. ICP is a lightweight message format used
for communication am... / and Classless Inter-Domain Routing CIDR the use of br groups. They propose to use IP routing information to forward cache
127.5 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... / IPv that allow transparent routing of IPv packets to mobile nodes br this care-of address using an IPv Routing header. David Johnson was
125.7 Using Network-level Support to Improve Cache Routing - Ulana Legedza (1998)(Correct)
We present the design of a new distributed Web caching infrastructure
that uses network-level mechanisms to provide
routing of Web requests to caches. Our work is motivated
by the need to provide effe... / Support to Improve Cache Routing Ulana Legedza and John Guttag br mechanisms to provide routing of Web requests to caches. Our
124.6 ATM Internetworking - Alles (1995)(Correct)
this paper was presented at Engineering InterOp, Las Vegas, March 1995.
1.0 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 unknown ATM Internetworking
Anthony Alle... / . . ATM Routing Protocols br . . Multicast Routing.
123.4 Scalable Timers for Soft State Protocols - Sharma, Estrin, Floyd, Van Jacobson (1997)(Correct)
Soft state protocols use periodic refresh messages to keep network state alive while adapting to changing network conditions; this has raised concerns regarding the scalability of protocols that use t... / membership information multicast routing protocols such as DVMRP PIM br multicast forwarding state in the routers. A reservation protocol such as
121.7 Performance Analysis Using the MIPS R10000 Performance Counters - Zagha, Larson, Turner, Itzkowitz (1996)(Correct)
Tuning supercomputer application performance often requires analyzing the interaction of the
application and the underlying architecture. In this paper, we describe support in the MIPS R10000
for n... / of the circuit implementation was routing the wires required to carry the br die area transistor count or wires routed. The expense was dominated by the
119.9 On Finding Multi-constrained Paths - Chen, Nahrstedt (1998)(Correct)
New emerging distributed multimedia applications provide guaranteed end-to-end quality of service (QoS) and have stringent constraints on delay, delay-jitter, cost, etc. The task of QoS routing is to ... / cost etc. The task of QoS routing is to find a route in the network br task of QoS routing is to find a route in the network which has
119.9 A Model of Saliency-based Visual Attention for Rapid Scene Analysis - Itti (1998)(Correct)
A visual attention system, inspired by the behavior and the neuronal architecture of the early primate visual system, is presented. Multiscale image features are combined into a single topographical s... / of attention include dynamic routing models in which information br recognition based on dynamic routing of information J Neuroscience
118.1 A Quantitative Study of Differentiated Services for the Internet - Sambit Sahu (1999)(Correct)
The Differentiated Services architecture provides router mechanisms for aggregate traffic, and edge
mechanisms for individual flows, that together can be used to build services with varying delay and ... / Services architecture provides router mechanisms for aggregate traffic br based on combinations of two router mechanisms threshold dropping
115.9 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... / e.g.scheduling flow control routing QoS management etc.in br protocol interacts with QoS-based routing to establish a path through the
114.8 Graph Problems Arising from Wavelength-Routing in All-Optical Networks - Beauquier, al. (1997)(Correct)
We survey the theoretical results obtained for wavelength
routing in all--optical networks, present some new results
and propose several open problems. In all--optical networks
the vast bandwidth avai... / Problems Arising from Wavelength-Routing in All-Optical Networks Bruno br de Nice-Sophia Antipolis Route de Colles BP Sophia
114.8 Wire Segmenting for Improved Buffer Insertion - Charles Alpert (1997)(Correct)
Buffer insertion seeks to place buffers on the wires of a signal net
to minimize delay. Van Ginneken [14] proposed an optimal dynamic
programming solution (with extensions proposed by [7] [8]
[9] [12]... / of segments for each wire in the routing tree. Too few segments yields br ends of any of the wires in the routing tree. Figure b shows the same
114.2 AntNet: Distributed Stigmergetic Control for Communications Networks - Di Caro, Dorigo (1998)(Correct)
This paper introduces AntNet, a novel approach to the adaptive learning of routing tables in communications networks. AntNet is a distributed, mobile agents based Monte Carlo system that was inspired ... / to the adaptive learning of routing tables in communications br algorithm with six state-of-the-art routing algorithms coming from the
114.2 Approximation Algorithms for Directed Steiner Problems - Charikar, Chekuri, Cheung, Dai.. (1998)(Correct)
We give the first non-trivial approximation algorithms for
the Steiner tree problem and the generalized Steiner network
problem on general directed graphs. These problems have
several applications in ... / in network design and multicast routing. For both problems the best br in network design and network routing. For example multicasting
113.0 Questions And Answers About BSP - Skillicorn, Hill, McColl (1996)(Correct)
Bulk Synchronous Parallelism (BSP) is a parallel programming model that abstracts from
low-level program structures in favour of supersteps. A superstep consists of a set of independent
local computat... / synchronise. Although permutation routing and barrier synchronisations are br with an attractive escape route from the world of
113.0 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... / because the number of connections routed through each switch varies and br by the periodic overload caused at routers by the synchronization of IGRP
111.3 General Purpose Parallel Computing - McColl (1993)(Correct)
A major challenge for computer science in the 1990s is to determine the extent to
which general purpose parallel computing can be achieved. The goal is to deliver both
scalable parallel performance an... / In recent years a number of new routing and memory management techniques br architectures. A number of new routing and memory management techniques
110.6 Receiver-driven Bandwidth Adaptation for Light-weight Sessions - Elan Amir (1997)(Correct)
Current Internet multicast conferencing tools treat all
sources with equal importance in that they either statically
allocate a fixed bandwidth to each source in a session, or
they automatically adapt... / service model and its underlying routing mechanism. These tools
110.3 Efficient PRAM Simulation on a Distributed Memory Machine - Karp, Luby, der Heide (1992)(Correct)
We present algorithms for the randomized simulation of a shared memory machine (PRAM) on a Distributed Memory Machine (DMM). In a PRAM, memory conflicts occur only through concurrent access to the sam... / interconnection network the routing time i.e the time needed to br time i.e the time needed to route read and write requests from
110.1 Online tracking of mobile users - Awerbuch, Peleg (1995)(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. The paper
introduces the graph-theoretic concep... / graph. It is assumed that efficient routing facilities are provided by the br The assumption of efficient routing facilities in the system is
109.0 General Principles Of Learning-Based Multi-Agent Systems - Wolpert, Wheeler, al. (1999)(Correct)
We consider the problem of how to design large decentralized
multi-agent systems (MAS's) in an automated fashion, with
little or no hand-tuning. Our approach has each agent run
a reinforcement learnin... / ii. Designing a control system for routing over a communication network br control of network packet routing Conventional approaches to
108.5 Analysis of Task Assignment Policies in Scalable Distributed.. - Colajanni (1998)(Correct)
A distributed multi-server Web site can provide the scalability necessary to keep up with growing client demand at popular sites. Load balancing of these distributed Web-server systems, consisting of ... / some scheduling strategy in routing the requests to the most suitable br alternative referred to as the TCP router approach is considered which
108.5 Efficient Policies for Carrying Web Traffic Over Flow-Switched.. - Feldmann, Rexford, Cáceres (1998)(Correct)
To efficiently transfer diverse traffic over highspeed
links, modern integrated networks require more efficient
packet-switching techniques that can capitalize on
recent advances in switch hardware. S... / that share a portion of their routes through the network. Keywords br protocol switching signaling routing. Introduction The
108.5 Design of a Scalable Event Notification Service: Interface and.. - Carzaniga, Rosenblum, Wolf (1998)(Correct)
Event-based distributed systems are programmed to operate in response to events. An event notification
service is an application-independent infrastructure that supports the construction of event-base... / different server topologies and routing algorithms. We conclude by br subscriptions the event service routes the notification towards all the
108.5 Fast Module Mapping and Placement for Datapaths in FPGAs - Callahan, Chong, DeHon, Wawrzynek (1998)(Correct)
By tailoring a compiler tree-parsing tool for datapath module
mapping, we produce good quality results for datapath synthesis
in very fast run time. Rather than flattening the design
to gates, we pres... / can optimize total delay including routing delays. To our knowledge this is br a specific CLB in the array and routing which assigns specific routing
106.3 Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets - Das, Bharghavan (1997)(Correct)
this paper, we impose a virtual
backbone structure on the ad-hoc network, in order to support
unicast, multicast, and fault-tolerant routing within the
ad-hoc network. This virtual backbone differs fr... / Routing in Ad-Hoc Networks Using Minimum br management system to maintain routes as hosts move or turn off or on.
106.3 IP Switching and Gigabit Routers - Newman, Minshall, Lyon, Huston (1997)(Correct)
This paper examines two approaches to
the design of a high-performance router, the gigabit router and the IP switch, and then provides some
detail on the implementation of an IP switch and the protoco... / IP Switching and Gigabit Routers Peter Newman Greg br corporate IP networks we require IP routers capable of much higher
105.1 Efficient On-Line Call Control Algorithms - Garay, Gopal, Kutten, Mansour, Yung (1993)(Correct)
We study the problem of on-line call control in a communications network, i.e.,
the problem of accepting or rejecting an incoming call (a request for a connection
between two points in a network) with... / to the length of the call's route proportional to its holding br dynamic data structures network routing etc. We evaluate on-line
102.8 Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast.. - Ko, Vaidya (1998)(Correct)
This paper addresses the problem of geocasting in mobile
ad hoc network (MANET) environments. Geocasting
is a variant of the conventional multicasting problem.
For multicasting, conventional protocols... / compared to the area of unicast routing for MANET However br ST-WIM protocol. Adhoc Multicast Routing AMRoute protocol and
102.1 The Chimaera Reconfigurable Functional Unit - Scott Hauck (1997)(Correct)
By strictly separating reconfigurable logic from
their host processor, current custom computing
systems suffer from a significant communication
bottleneck. In this paper we describe Chimaera, a
system... / data compression and decompression routines while when a rendering package br of the code with text search routines active in one phase of the
101.4 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... / It is assumed that efficient routing facilities are provided by the br The assumption of efficient routing facilities in the system is
101.4 Disjoint Paths in Densely Embedded Graphs - Kleinberg, Tardos (1995)(Correct)
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network --- the goal is to simultaneou... / papers discussing applications to routing in high-speed networks where the br disjoint paths is fundamental to routing in high-speed networks see for
99.9 A Secure PLAN - Hicks, Keromytis (1999)(Correct)
Active Networks promise greater flexibility than current networks, but
threaten safety and security by virtue of their programmability. In this paper,
we describe the design and implementation of a se... / of general-purpose service routines governed by trust management br to program the network on a per-router peruser or even per-packet
99.9 TCP Performance in Wireless Multi-hop Networks - Gerla, Tang, Bagrodia (1999)(Correct)
In this study we investigate the interaction between TCP
and MAC layer in a wireless multi-hop network. Using
simulation, we provide new insight into two critical
problems of TCP over wireless multi-h... / packet transmissions is FIFO. The routing protocol is Distance Vector br to avoid interference between routing update packets and TCP packets
98.9 Providing Connection-Oriented Network Services to Mobile Hosts - Keeton (1993)(Correct)
Mobile computers using wireless networks, along with multimedia applications, are two
emerging trends in computer systems. This new mobile multimedia computing environment
presents many challenges, du... / to cope with new dynamics of routing and resource location. Generally br involves a single source-routed round-trip pass of control
98.7 An Open Agent Architecture - Cohen, Cheyer, Wang, Baeg (1994)(Correct)
The goal of this ongoing project is to develop an open agent architecture and accompanying user interface for networked desktop and handheld machines. The system we are building should support distrib... / is to decompose ICL expressions and route them to agents who have indicated br solutions to the blackboard for routing to the originator of the request.
98.7 Packet Routing in Dynamically Changing Networks: A Reinforcement.. - Boyan, Littman (1994)(Correct)
This paper describes the Q-routing algorithm for packet routing,
in which a reinforcement learning module is embedded into each
node of a switching network. Only local communication is used
by each no... / Packet Routing in Dynamically Changing br This paper describes the Q-routing algorithm for packet routing in
98.5 Protocols for Adaptive Wireless and Mobile Networking - Johnson, MALTZ (1996)(Correct)
this article, we give a status report of our current work in the Monarch Project, placing it in the
context of broader efforts by the Internet mobile networking community.
Our work will enable mobile ... / must be able to adapt packet routing to reach each mobile host in its br article we describe our work in routing packets to mobile hosts in a
98.5 Distributed Packet Switching in Arbitrary Networks - Rabani, Tardos (1996)(Correct)
In a seminal paper Leighton, Maggs, and Rao consider
the packet scheduling problem when a single packet has
to traverse each path. They show that there exists a
schedule where each packet reaches its ... / et al. Introduction Packet routing is one of the central issues in br Transfer Mode The packet routing problem is simply that of moving
98.5 Mobile Agents: Are They a Good Idea? - Chess, Harrison, Kershenbaum (1995)(Correct)
Mobile agents are programs, typically written in a script language, which may be
dispatched from a client computer and transported to a remote server computer for
execution. Several authors have sugge... / to intermediate destinations which route the agent on the basis of its br the basis of its content Semantic Routing ffl The message is handed
98.5 Multicluster, Mobile, Multimedia Radio Network - Gerla, Tsai (1995)(Correct)
this paper, we present a multi-cluster, multi-hop packet radio network architecture
that addresses the above challenges and implements all required features.
In a mobile, multi-channel (code), and mul... / power adjustment and multihop routing. A key requirement in WAMIS is br reconfigured to handle mobility. Routing and bandwidth assignment are
97.8 A Cluster-based Approach for Routing in Dynamic Networks - Krishna, Vaidya, Chatterjee, Pradhan (1997)(Correct)
The design and analysis of routing protocols is an
important issue in dynamic networks such as packet radio
and ad-hoc wireless networks. Most conventional
protocols exhibit their least desirable beha... / A Cluster-based Approach for Routing in Dynamic Networks P. br The design and analysis of routing protocols is an important issue
97.1 Geometric Shortest Paths and Network Optimization - Mitchell (1998)(Correct)
Introduction A natural and well-studied problem in algorithmic graph theory and network optimization is that of computing a "shortest path" between two nodes, s and t, in a graph whose edges have "wei... / systems GIS see wire routing etc. The most basic form of the br of interest in applications to VLSI routing problems see
97.1 Compositional Programming Abstractions for Mobile Computing - McCann, Roman (1998)(Correct)
ions for
Mobile Computing
Peter J. McCann, Gruia-Catalin Roman
Abstract--- Recent advances in wireless networking technology
and the increasing demand for ubiquitous, mobile
connectivity demonstrate ... / for purposes other than routing. The remainder of the paper is
96.2 Improved Approximation Algorithms For Shop Scheduling Problems - Shmoys, Stein, Wein (1994)(Correct)
In the job shop scheduling problem we are given m machines and n jobs; a job consists
of a sequence of operations, each of which must be processed on a specified machine, and the aim is to
complete ... / its genesis in problems of packet routing. We briefly review both br the following model for the routing of packets in a network find
96.2 Introducing Global Constraints in CHIP - Beldiceanu, Contejan (1994)(Correct)
The purpose of this paper is to show how the introduction of new primitive constraints (e.g. among, diffn, cycle) over finite domains in the constraint logic programming system CHIP result in finding ... / geometrical placement and vehicle routing problems. The among constraint br placement and vehicle routing problems The paper is
95.6 Message-Passing Performance of Various Computers - Dongarra, Dunigan (1995)(Correct)
This report compares the performance of different computer systems for basic message-passing. Latency and bandwidth are measured on Convex, Cray, IBM, Intel, KSR, Meiko, nCUBE, NEC, SGI, and TMC multi... / is negligible due to worm-hole routing techniques and the small br go out of his way to code a matrix routine that would not run at nearly
93.8 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... / has also been done in multicast routing A D but the design of a br A Lorenzo Aguilar Datagram Routing for Internet Multicasing ACM
92.7 SHADE: Technology for Knowledge-Based Collaborative Engineering - McGuire, Kuokka, al. (1993)(Correct)
Effective information sharing and decision coordination are vital to collaborative
product development and integrated manufacturing. However, typical special-purpose
CAE systems tend to isolate inform... / services for content-directed routing and intelligent matching of br such as name service buffering routing of messages and matching
91.4 Scalable Multimedia Communication with Internet Multicast.. - McCanne (1998)(Correct)
In this survey article we describe the roots of IP Multicast in the Internet, the evolution of the Internet Multicast Backbone or "MBone," and the technologies that have risen around the MBone to supp... / now widely supported in commercial routers and is undergoing incremental br Internet multicast requires new routing protocols and forwarding
91.4 A Secure Active Network Environment Architecture - Alexander (1998)(Correct)
Active Networks are a network infrastructure which is programmable on a per-user or even per-packet basis. Increasing the flexibility of such network infrastructures invites new security risks. Coping... / by IP provides both forwarding and routing these services are not subject br value-added services such as non-co-routed paths to enhance throughput via
91.4 Optimizing TCP Forwarder Performance - Spatscheck, Hansen, Hartman, Peterson (1998)(Correct)
A TCP forwarder is a network node that establishes and forwards data between a pair of TCP connections.
For example, a firewall that places a proxy between a TCP connection to an external host and a T... / with the performance of an IP router running on the same hardware. br role very similar to that of an IP router except it must execute two TCP
91.4 IP Lookups using Multiway and Multicolumn Search - Lampson, Srinivasan, Varghese (1998)(Correct)
IP address lookup is becoming critical because of increasing routing table size, speed, and tra#c
in the Internet. Our paper shows how binary search can be adapted for best matching pre#x using
twoent... / critical because of increasing routing table size speed and tra c in br transition from the older Internet routing protocol IPv with bit
90.9 Near-Optimal Hardness Results and Approximation Algorithms for.. - Guruswami, Khanna, Rajaraman.. (1999)(Correct)
We study the approximability of two classes of network routing
problems. The first class of problems in our study correspond
to classical multicommodity flow problems of the following
form: We are giv... / of two classes of network routing problems. The first class of br in S can be fully met through a routing which respects all capacity
89.8 Routing High-bandwidth Traffic in Max-min Fair Share Networks - Ma, Steenkiste, Zhang (1996)(Correct)
We study how to improve the throughput of high-bandwidth
traffic such as large file transfers in a network where resources
are fairly shared among connections. While it is
possible to devise priority ... / Routing High-bandwidth Traffic in Max-min br connections we focus on the use of routing algorithms that improve resource
89.8 Okapi at TREC-3 - Robertson, Walker, Jones.. (1996)(Correct)
this document length
correction factor is "global": it is added at the end, after
the weights for the individual terms have been summed,
and is independent of which terms match.
In the course of inv... / automatic ad hoc automatic routing manual ad hoc and manual ad hoc br later automatic ad hoc and routing results reported in
89.8 The reflexive CHAM and the join-calculus - Fournet, Gonthier (1995)(Correct)
By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model of concurrency that is consistent with mobility and distribution. Our model provides the foundations of a prog... / denotation for the transmission routing and synchronization that
89.8 TREC and TIPSTER Experiments With INQUERY - James Callan (1995)(Correct)
INQUERY is a probablistic information retrieval system based upon a Bayesian
inference network model. This paper describes recent improvements to the system as
a result of participation in the TIPSTER... / feedback and simulated document routing. Experiments with one and two br Document retrieval and routing are viewed as probabilistic
88.8 On Multicast Wormhole Routing in Multicomputer Networks - Boppana, Chalasani, Raghavendra (1994)(Correct)
We show that deadlocks due to dependencies on consumption channels is a fundamental problem in multicast wormhole routing. This issue of deadlocks has not been addressed in many previously proposed ... / On Multicast Wormhole Routing in Multicomputer Networks br problem in multicast wormhole routing. This issue of deadlocks has not