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.
17085.2 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
15937.5 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
8641.0 Performance Optimization of VLSI Interconnect Layout - Cong, He, Koh, Madden (1996)(Correct)
This paper presents a comprehensive survey of existing techniques for interconnect optimizationduringthe VLSI physical design
process, with emphasis on recent studies on interconnect design and optimi... / iii high-performance clock routing including abstract clock net br and embedding planar clock routing buffer and wire sizing for clock
7937.9 A Comprehensive Review of Production-Oriented Manufacturing Cell.. - Joines, King, Culbreth (1996)(Correct)
This paper offers a comprehensive review and classification of techniques to manipulate
part routing sequences for manufacturing cell formation. Individual techniques
are aggregated into methodologica... / of techniques to manipulate part routing sequences for manufacturing cell br techniques that manipulate part routing sequences. Early work in this
7405.6 Interior Point Methods for Combinatorial Optimization - Mitchell, Pardalos, Resende (1998)(Correct)
In this paper, we review recent interior point approaches for solving combinatorial
optimization problems. We discuss in detail tecniques for linear and network
programming, branch and bound and bra... / Each plane must fly a round trip route. Each pilot must also fly a round br pilot must also fly a round trip route but not necessarily the same
6774.0 Symbiotic Evolution of Neural Networks in Sequential Decision Tasks - Moriarty (1997)(Correct)
viii Chapter 1 Introduction 1 1.1 Sequential Decision Tasks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.1 Examples of Sequential Decision Tasks . . . . . . . . . . . . . . ... / difficult decision problems such as routing traffic autonomous control and br in a chemical reactor and routing information on the Internet. In
6603.7 Multicomputer Routing Techniques - Fulgham (1997)(Correct)
Multicomputer Routing Techniques
by Melanie L. Fulgham
Chairperson of Supervisory Committee
Professor Lawrence Snyder
Department of Computer Science and Engineering
Communication is a fundamental prob... / Multicomputer Routing Techniques y Melanie L. br Abstract Multicomputer Routing Techniques by Melanie L.
6540.6 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
6343.8 Survey: Practical Applications of Constraint Programming - Wallace (1995)(Correct)
no abstract-- unknown Survey: Practical Applications of Constraint
Programming
Mark Wallace
IC-Parc, William Penney Laboratory,
Imperial College, LONDON SW7 2AZ.
email: mgw@doc.ic.ac.uk
September 1... / scheduling resource allocation routing and more recently even in br behaviour was used in a train routing and timetabling application by
6245.0 Scheduling And Code Generation For Parallel Architectures - Yang (1993)(Correct)
OF THE DISSERTATION
Scheduling and Code Generation for Parallel
Architectures
by Tao Yang, Ph.D.
Dissertation Director: Professor Apostolos Gerasoulis
Automatic partitioning, scheduling and code gener... / that eliminates unnecessary routing processors. We have implemented br programming the Intel communication routines. I also thank my friends who
6195.0 The Challenge of Spoken Language Systems: Research Directions for the .. - Cole (1995)(Correct)
A spoken language system combines speech recognition, natural language processing and human interface technology. It functions by recognizing the person's words, interpreting the sequence of words to ... / reasoning travel planning traffic routing to support for multi-lingual br language and or dialect in order to route the user to the appropriate human
5955.7 A Review of QoS Architectures - Campbell, Aurrecoechea, 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 occu... / e.g.scheduling flow control routing QoS management etc.in br protocol interacts with QoS-based routing to establish a path through the
5955.7 Architectural Perspectives on QoS Management in Distributed.. - Campbell, Aurrecoechea, Hauw (1995)(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
occu... / e.g.scheduling flow control routing QoS management etc.in br protocol interacts with QoS-based routing to establish a path through the
5304.7 Asynchronous Transfer of Video - Karlsson (1996)(Correct)
This paper gives an introduction to the issues involved in asynchronous video transfers. Brief overviews of video coding, rate control, multiplexing, as well as delay, error and loss control are given... / of virtual circuit and datagram routing. Bit-encoded information is br cells along pre-established routes in ATM networks and in variable-
5068.0 Massively Parallel Computing: Mathematics and communications libraries - Johnsson, Mathur (1993)(Correct)
Massively parallel computing holds the promise of extreme performance. The utility of
these systems will depend heavily upon the availability of libraries until compilation and run--
time system techn... / Locality of reference and routing are key issues in accomplishing br for effective data placement and routing on the Connection Machine
4896.6 Interconnection Networks And Data Prefetching For Large-Scale.. - Kim (1995)(Correct)
This memory access bottleneck is more serious in shared-memory multiprocessor systems,
where processors and memory units are connected through interconnection networks.
Processors cooperate to perform... / a theoretical framework for routing in shuffle-exchange networks and br an algorithm for shortest path routing in single stage shuffle-exchange
4830.4 ALIEN: A Generalized Computing Model Of Active Networks - Alexander (1998)(Correct)
alien: A Generalized Computing Model of Active Networks
David Scott Alexander
Jonathan M. Smith
Active Networks are networks whose actions may be changed during operation either by
introducing new cod... / by introducing new code into the routers active extensions or by br only per-packet processing such as routing can be performed. Beyond that a
4678.0 Specification and Design of Embedded Software/Hardware Systems - Gajski, Vahid (1995)(Correct)
System specification and design consists of describing a system's desired functionality,
and of mapping that functionality for implementation on a set of system
components, such as processors, ASIC's,... / design tools for placement routing and timing. The above five br performing object placement and routing. The software size of a given
4674.8 Network Related Performance Issues and Techniques for MPPs - Johnsson (1995)(Correct)
In this paper we review network related performance issues for current
Massively Parallel Processors (MPPs) in the context of some
important basic operations in scientific and engineering computation.... / give an example of a novel general routing technique that exhibits good br by a brief discussion of general routing techniques for electronic
4536.0 Dimensioning of a Peak Cell Rate Monitor Algorithm Using.. - Hübner (1993)(Correct)
This study deals with the monitoring of ATM cells from a CBR source which are subject
to cell delay variation introduced by cells from other traffic sources. We present an exact
solution for the dimen... / for connection set-up charging routing etc. Once a connection is br W. Mandel. Communication network routing using neural nets -numerical
4441.5 On the Implementation of Local Synchrony - Wagner, Jr. (1993)(Correct)
Local synchrony is a distributed approach to providing logically synchronous capabilities
in an asynchronous system. Local synchrony provides a logical timeline to memory
access, and thus a total orde... / . Routing Message Transfer and Deadlock br system by implementing better routing algorithms and or distributing
4260.7 Local Anonymity In The Internet - Martin, Jr. (1999)(Correct)
Packet-switched computer networks of all sizes are widely used for personal, professional, and governmental
communication. However, the speed, versatility, and largely unregulated nature of computer n... / it possible and even practical to routinely maintain detailed logs of br infrastructure itself including routers switches and hubs. In the
4254.2 Multimodality - Flanagan(Correct)
ion
(e.g. ANIMNL, ANTLIMA, SPRINT)
(e.g. HAM-ANS, LANDSCAN, VITRA, NAOS)
Text
Text & Graphics
100% 100%
Formal Representation of Information to be Conveyed
Multimodal
Presentation
(e.g. COMET
WIP)... / deployed commercially to serve call routing in telecommunications and to br terminals as well as information routing in the network. Particularly in
4237.1 Routing in Multi-hop Packet Switching Networks: Gbps Challenge - Baransel(Correct)
The paper is a survey of networking solutions that
have been proposed for high-speed packet-switched
applications. Using these solutions as examples, we
identify the specific problems resulting from v... / Routing in Multi-hop Packet Switching br the solutions based on deflection routing are the most promising ones and
4038.6 Virtual InterNetwork Testbed: Status and Research Agenda - Bajaj, Breslau, Estrin, Fall, Floyd, .. (1998)(Correct)
Simulation is an important tool in network protocol
development, providing an effective way to perform
controlled experiments, consider alternative designs,
understand protocol interactions, and exami... / protocols at every level from routing to transport and application br from operational network hosts and routers. This allows more thorough
4017.1 Efficient Simulation of Message-Passing in Distributed-Memory.. - Demaine (1996)(Correct)
In this thesis we propose a distributed-memory parallel-computer simulation system
called PUPPET (Performance Under a Pseudo-Parallel EnvironmenT). It allows
the evaluation of parallel programs run in... / . . . Routing . br all network latencies including routing traffic and congestion i.e.
3994.2 Massively Parallel Computing: Data distribution and communication - Johnsson (1993)(Correct)
We discuss some techniques for preserving locality of reference in index spaces
when mapped to memory units in a distributed memory architecture. In particular,
we discuss the use of multidimensional ... / Locality of reference and routing are key issues in accomplishing br for effective data placement and routing on the Connection Machine systems
3942.5 Simulation of PRAM Models on Meshes - Leppänen, Penttonen (1994)(Correct)
We analyze the complexity of simulating a PRAM (parallel random access machine)
on a mesh structured distributed memory machine. By utilizing suitable algorithms for
randomized hashing, routing in a m... / algorithms for randomized hashing routing in a mesh and sorting in a mesh br memory seems to be to utilize a routing network between processors and a
3877.1 Decomposition methods for differentiable optimization problems over.. - Patriksson (1997)(Correct)
This paper presents a unified analysis of decomposition algorithms for continuously differentiable
optimization problems defined on Cartesian products of convex feasible sets. The decomposition algo... / pqr r R pq the flow on route r between the nodes p and q br where ffi pqra ae route r passes through link a
3780.9 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
3728.5 Why is Flow Control Hard: Optimality, Fairness, Partial and Delayed.. - Korilis, Lazar (1992)(Correct)
Flow control has been studied since the early stages of research in telecommunication
networks. In these early studies the term flow control has been used to
describe almost any type of network contro... / is provided. Admission control routing scheduling and buffer management br Resource control algorithms e.g.routing scheduling buffer management
3492.7 Alternate Path Routing and Pinning for Interdomain Multicast Routing - Daniel Zappala (1997)(Correct)
Many researchers have explored enhancements of the Internet's best-effort service model
that allow real-time and other inelastic applications to obtain preferential Quality of Service.
However, these ... / Alternate Path Routing and Pinning for Interdomain br Pinning for Interdomain Multicast Routing USC Computer Science
3469.1 Quality of Service Provision in Noncooperative Networks: Heterogenous .. - Park, Sitharam, Chen (1997)(Correct)
This paper studies the quality of service (QoS) provision problem in noncooperative networks
where applications or users are selfish and routers implement a general class of packet scheduling
discipli... / or users are selfish and routers implement a general class of br including congestion control and routing games that depict an overly
3426.1 Portable and Efficient Parallel Computing Using the BSP Model - Goudreau, Lang, Rao, Suel, Tsantilas (1998)(Correct)
The Bulk-Synchronous Parallel (BSP) model was proposed by Valiant as a standard
interface between parallel software and hardware. In theory, the BSP model has been
shown to allow the asymptotically op... / processing and memory functions a router that delivers messages br designed to support the fundamental routing problem of the BSP model the
3417.7 Packet-Pair Flow Control - Keshav (1994)(Correct)
This paper presents the packet-pair rate-based feedback flow control scheme. This scheme is designed for
networks where individual connections do not reserve bandwidth and for the available bitrate (b... / traverse the same unicast route. This is true for virtual circuit br connect times are shorter than the routing table update time. . . Round
3406.7 Filesystems for Network-Attached Secure Disks - Gibson, al. (1997)(Correct)
Network-attached storage enables network-striped data transfers directly between client and storage to provide clients with scalable bandwidth on large transfers. Network-attached storage also decoupl... / without store-and-forward routing. In switched networks network
3303.8 A General Theory for Deadlock Avoidance in Wormhole-Routed Networks - Fraigniaud (1998)(Correct)
Most machines of the last generation of distributed memory parallel computers
possess specific routers which are used to exchange messages between non-neighboring
nodes in the network. Among the sever... / for Deadlock Avoidance in Wormhole-Routed Networks Eric Fleury LIP br computers possess specific routers which are used to exchange
3271.1 Monitoring of Distributed Memory Multicomputer Programs - van Riek, Tourancheau, Vigouroux (1993)(Correct)
ion (EBBA). Some
of these methods will be briefly introduced here.
The simplest way of analyzing runtime information consists of collecting statistics from the individual
event-records. ParaGraph [HE9... / all the other devices buffers routers that link two nodes together. br any other node i.e. an underlying router-mechanism takes care of the
3257.6 Routing And End-To-End Quality Of Service In Multimedia Networks - Rampal (1995)(Correct)
Sanjeev Rampal was born in New Delhi, India. He obtained Bachelor's and Master's degrees
in Electrical Engineering (in 1988 and 1991 respectively), both from the Indian Institute
of Technology, Bombay... / Routing And End-To-End Quality Of Service br Routing Algorithms for Real-time Traffic
3210.5 Design And Implementation Of PVM Version 3 - Manchek (1994)(Correct)
There is a growing trend toward distributed computing -- writing programs that
run across multiple networked computers -- to speed up computation, solve larger
problems or withstand machine failures. ... / . Message Routing br Packet and Message Routing in pvmd
3197.3 Reducing Cache Invalidation Overheads in Wormhole Routed DSMs Using.. - Dai, Panda (1996)(Correct)
Directory-based distributed shared memory (DSM) systems have drawn high interests
in parallel computing research and industry in recent years. Current generation systems
are limited to using point-t... / Invalidation Overheads in Wormhole Routed DSMs Using Multidestination br or adaptive turn-model wormhole routing. These schemes are evaluated for
3185.9 Chernoff-Hoeffding Bounds for Applications with Limited Independence - Schmidt, Siegel, Srinivasan (1993)(Correct)
Chernoff--Hoeffding bounds are fundamental tools used in bounding the tail probabilities of the sums of bounded and independent random variables. We present a simple technique which gives slightly bet... / sampling and oblivious packet routing. Introduction The most br explicit constructions of oblivious routing algorithms on the butterfly with
3181.7 A Unified Approach To Concurrent Debugging - Hyder (1994)(Correct)
ion of Computation Actions ............................ 3
1.1.2 Program and its Execution ................................................... 5
1.2 The Debugging Process ................................. / . . Firing and Routing Rules br generated symbol table entry routine. Figure - . Data-flow
3096.3 Coalitions among Computationally Bounded Agents - Sandholm, Lesser(Correct)
This paper analyzes coalitions among self-interested agents that need to solve combinatorial optimization problems to operate efficiently in the world. By colluding (coordinating their actions by solv... / results are presented in vehicle routing with real data from five br application distributed vehicle routing The methods presented in this
3086.9 Implementing Data-Parallel Software on Dataflow Hardware - Shaw (1993)(Correct)
The data-parallel programming model has become the de facto, baseline standard programming
model for a variety of parallel computers, both SIMD and MIMD. The dataparallel
programming model is easy to ... / latency high bandwidth general routing network give excellent br End Processor General Purpose Routing Network Scan and Reduction
3077.4 Improved Routing and Sorting on Multibutterflies - Maggs, Vöcking (1997)(Correct)
This paper shows that an N-node AKS network (as described by Paterson) can be
embedded in a
3N
2 -node twinbutterfly network (i.e., a multibutterfly constructed by superimposing
two butterfly network... / Improved Routing and Sorting on Multibutterflies br deterministic algorithm for routing h-relations on an n-input
3021.2 Providing Quality of Service in Packet Switched Networks - Towsley (1993)(Correct)
Increases in bandwidths and processing capabilities of future packet switched networks
will give rise to a dramatic increase in the types of applications using them. Many of
these applications will re... / the provision of QOS and call routing and traffic monitoring and br numerous other problems such as routing congestion control link
2992.3 The ADAPTIVE Communication Environment: An Object-Oriented Network.. - Schmidt (1993)(Correct)
The ADAPTIVE Communication Environment (ACE) implements a set of fundamental design patterns that simplify the development of concurrent event-driven communication software. ACE provides a rich set of... / connection establishment routing dynamic configuration of br transfer content-based message routing status logging qand
2984.4 An Overview of Cell-Level ATM Network Simulation - Kesidis And (1995)(Correct)
An ATM simulator is often faced with the challenging task of estimating rare events
in a very large network without the availability of a large amount of simulation time.
This paper provides an overvi... / the performance of call-set up and routing strategies with respect to br admission control and cell routing in the network. One can exploit
2973.7 Local Search for NP-Hard Problems - Frank (1997)(Correct)
metagrobolize To present to one's mind a problem difficult to solve.
"Research is what I'm doing when I don't know what I'm doing."
-- Werner von Braun
"Sometimes a scream is better than a thesis."
... / Davis for Local Search in Optical Routing for Wavelength-Routed Networks br in Optical Routing for Wavelength-Routed Networks Last but not least I
2959.8 Providing Real-Time Response, State Recency and Temporal Consistency.. - Anindya Datta(Correct)
Databases have been proposed as the chosen platform to develop automated control systems
for environments where the state of the system changes rapidly, and actions need to be taken
with timing constr... / transaction may be update routing profile in all routers in br be update routing profile in all routers in location XYZ within
2947.5 Parallel Algorithms For Test Generation And Fault Simulation - Patil (1990)(Correct)
INTRODUCTION
1.1. Parallel Processing for VLSI CAD
With the increased complexity of VLSI circuits, existing Computer-Aided Design (CAD)
algorithms will not be able to handle large circuits in a reason... / problems such as module placement routing circuit extraction logic br . Cell Placement . Global routing . Detailed routing . Design
2905.0 Efficient Collective Communication in Optical Networks - Bermond, Gargano, al.(Correct)
This paper studies the problems of One--to--All and All--to--All Communication in optical
networks. In such networks the vast bandwidth available is utilized through wavelength division
multiplexing: ... / networks a packet may have to be routed through a few intermediate nodes br general such a network consists of routing nodes interconnected by
2901.3 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
2879.8 Work-Optimal Simulation of PRAM Models on Meshes - Ville Leppänen, Martti Penttonen (1994)(Correct)
In this paper we consider work-optimal simulations of PRAM models on coated meshes.
Coated meshes consist of a mesh connected routing machinery with processors on the surface
of the mesh. We prove tha... / meshes consist of a mesh connected routing machinery with processors on the br with -dimensional or -dimensional routing machinery can work-optimally
2866.9 ASPEN: High-Performance Hardware Support for Distributed Shared-Memory - Maxham (1994)(Correct)
ASPEN: High-Performance Hardware Support
for Distributed Shared-Memory
Kenneth Mark Maxham
This thesis describes and evaluates an integrated memory and network subsystem
designed to provide the abstr... / the buffering of writes to memory. Routing of messages is accomplished with br vii . Messages and Routing
2864.0 Resource Management in Wide-Area ATM Networks using Effective.. - de Veciana, Kesidis, Walrand (1995)(Correct)
This paper is principally concerned with resource allocation for connections tolerating statistical quality of
service (QoS) guarantees in a public wide-area ATM network. Our aim is to sketch a framew... / claim that networks with sufficient routing diversity will inherently br a given connection follow the same route called a virtual circuit and
2843.9 Scheduling Time-Constrained Communication in Linear Networks - Adler, Rosenberg, Siraraman, Unger (1998)(Correct)
We study the problem of centrally scheduling multiple messages in a linear network, when each message has both a release time and a deadline. We show that the problem of transmitting optimally many me... / networks to networks capable of routing messages with timing constraints. br with that of more traditional routing problems which seek to optimize
2824.1 Modeling Parallel Bandwidth: Local vs. Global Restrictions - Adler, Gibbons, Matias, Ramachandran (1997)(Correct)
Recently there has been an increasing interest in models of parallel computation that account
for the bandwidth limitations in communication networks. Some models (e.g., bsp and logp)
account for ban... / can steal unused bandwidth by routing along alternative paths. If the br consider the general unbalanced routing problem in which each processor
2814.1 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
2809.9 On the Benefit of Supporting Virtual Channels in Wormhole Routers - Cole, Maggs, Sitaraman (1996)(Correct)
This paper analyzes the impact of virtual channels on the performance
of wormhole routing algorithms. We show that in any network
in which each physical channel, i.e., communication link, can support
... / Virtual Channels in Wormhole Routers Richard J. Cole Courant br on the performance of wormhole routing algorithms. We show that in any
2803.5 Exploring the Performance Impact of QoS Support in TCP/IP Protocol.. - Engel, Kandlur, Mehra, Saha(Correct)
Significant efforts are being made by the Internet Engineering Task Force (IETF) to enhance the
service model of the Internet to support integrated services for voice, video, and data transport. This ... / for handling of traffic at network routers and end hosts. Given that the br hosts are connected via prototype routers based on atm switches enhanced
2802.6 A Survey on Parallel Logic Simulation - Meister (1993)(Correct)
Simulation of logic designs is a very important part of the VLSI-design
process. The increasing size of the designs requires more efficient simulation
strategies to accelerate the simulation process. ... / placement floor planning channel routing SES a are one major topic in br of the grain sizes of the event routines in terms of instructions per
2797.1 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
2796.1 A Computational Model for Detecting Image Changes - Wai (1994)(Correct)
This thesis proposes a model that investigates a new avenue for attention control based
on dynamic scenes. We have derived a computational model to detect abrupt changes and
have examined how the most... / . . Selective Routing Models br four main categories selective routing models oscillation tagging
2792.4 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
2778.8 ANTD Project Proposal: Support of Integrated Services in the Next.. - Montgomery(Correct)
Contents
1 Project: Support of Integrated Services in IPS 5
1.1 Project Title and Leaders : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5
1.2 Chronological Summary and Date of Last Upd... / . . . Integrated Services Routing br . . Effects of Topology and Routing on RSVP
2770.6 On the Fault Tolerance of Some Popular Bounded-Degree Networks - Leighton, Maggs, Sitamaran (1995)(Correct)
In this paper, we analyze the fault tolerance of several boundeddegree
networks that are commonly used for parallel computation.
Among other things, we show that an N-node butterfly network containing... / with new algorithms for routing packets around faults in br faults is to be used for packet routing we are concerned with how many
2766.9 A Teaching Strategy for Memory-Based Control - John Sheppard (1997)(Correct)
Combining different machine learning algorithms in the same system can produce
benefits above and beyond what either method could achieve alone. This paper demonstrates
that genetic algorithms can be ... / railroad monitoring and ship routing are using differential game
2761.3 A Scalable Diffusion Algorithm For Dynamic Mapping And Load Balancing .. - Heirich (1997)(Correct)
The problems of mapping and load balancing applications on arbitrary networks are
considered. A novel diffusion algorithm is presented to solve the mapping problem. It
complements the well known diffu... / j. ffl d pp is the routing distance between computers p br of bandwidth c ij multiplied by routing distance d pp among
2755.3 MORPH: A System Architecture for Robust High Performance Using.. - Chien, Gupta (1996)(Correct)
Achieving 100 TeraOps performance within a tenyear
horizon will require massively-parallel architectures
that exploit both commodity software and hardware
technology for cost efficiency. Increasing cl... / times for every three years. The routability and gate utilization in br CAD tools and additional routing resources. State of the art
2753.7 Generalization and Generalizability Measures - Wah (1999)(Correct)
In this paper, we define the generalization problem, summarize various
approaches in generalization, identify the credit assignment problem,
and present the problem and some solutions in measuring gen... / for VLSI cell placement and routing. Introduction br in VLSI cell placement and routing the tuning of fitness functions
2751.9 Security Problems in the TCP/IP Protocol Suite - Bellovin (1989)(Correct)
The TCP/IP protocol suite, which is very widely used today, was developed
under the sponsorship of the Department of Defense. Despite that, there are a
number of serious security flaws inherent in the... / including sequence number spoofing routing attacks source address br mechanisms and in particular routing protocols have minimal or
2750.2 Dispersers, Deterministic Amplification, and Weak Random Sources. - Cohen, Wigderson (1989)(Correct)
We use a certain type of expanding bipartite graphs, called disperser graphs, to design
procedures for picking highly correlated samples from a finite set, with the property that the
probability of hi... / some computational problems i.e. routing in degree bounded networks br tradeoff for oblivious routing. In STOC pages -
2749.2 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
2735.7 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
2717.5 Scheduling with Genetic Algorithms - Husbands, Mill(Correct)
This paper provides a survey of the application of genetic algorithms (GAs) to scheduling.
Although it focuses on manufacturing scheduling, particularly job-shop problems, it
does outline work in othe... / as transport scheduling and network routing. GA research in closely related br may provide a less restrained route forward. However for the moment
2693.7 Communication Throughput of Interconnection Networks - Monien, Diekmann, Lüling (1994)(Correct)
Modern flow control techniques used for massively parallel computers
have made network capacity a more important parameter for the application
performance than network latency. Network latency is us... / with probability For a given routing function R we define max br the system remains stable using routing R i.e. no backlogs occur at
2678.8 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
2672.0 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
2664.9 `STRESS' Testing Applied to a Multicast Routing Protocol - Helmy, Estrin (1997)(Correct)
Multiparty protocols support an important class of applications ranging from multi-media teleconferencing
to network games. Designing wide-area multiparty protocols is becoming more complex with
the g... / Testing Applied to a Multicast Routing Protocol Ahmed Helmy Deborah br of robustness analysis of multicast routing protocols. We do not prove
2664.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
2664.0 Parallel Algebraic Algorithm Design - Kaltofen (1989)(Correct)
Introduction
The notes following this introduction were written by students taking my graduate course
66.696 Parallel Algorithm Design, which I taught in the Fall of 1988. The material is largely
bas... / network. Fault tolerant network routing on a hypercube is discussed in
2646.7 Parallel Algorithms For CAD With Applications To Circuit Extraction - Belkhale (1991)(Correct)
INTRODUCTION
1.1. Parallel Processing for CAD
As the sizes of VLSI circuits increases in the future, the computational requirements for performing
various computer-aided design (CAD) tasks such as sim... / extraction cell placement and wire routing will increase tremendously. There br including logic simulation wire-routing design rule checking and
2625.0 Ergodic, primal convergence in dual subgradient schemes for convex.. - Larsson, Patriksson, Strömberg(Correct)
Lagrangean dualization and subgradient optimization techniques are frequently
used within the field of computational optimization for finding approximate
solutions to large, structured optimization pr... / Fisher solves vehicle routing problems to optimality by a br deals with the estimation of route flows in each of the
2610.7 Labeling Point Features on Maps and Diagrams - Christensen, Marks, Shieber (1992)(Correct)
A major factor affecting the clarity of graphical displays that include text labels is the degree to which labels obscure display
features (including other labels) as a result of spatial overlap. Poin... / metric problems and computations routing and layout. H. . Information
2597.4 ERCW PRAMs and Optical Communication - MacKenzie, Ramachandran (1997)(Correct)
This paper presents algorithms and lower bounds for several fundamental problems on the
Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some
results for unbounded fan-i... / n lower bound on h-relation routing in Goldberg Jerrum and br optic networks. Research on routing in general fiber optic networks
2594.7 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
2578.8 Can Scatter Communication Benefit from Multidestination Message.. - Mohammad Banikazemi (1997)(Correct)
Multiple research directions in the past have emphasized the benefits of multidestination
message passing to support efficient non-personalized communication like broadcast and
multicast. In this pa... / communication wormhole routing k-ary n-cubes path-based br k-ary n-cubes path-based routing and multidestination message
2569.6 Collision Graph based Communication Scheduling for Parallel Systems - Surma, Sha (1997)(Correct)
Applications such as image processing, fluid mechanics, and geophysical data
analysis are examples of problems that require the high computing performance provided
by multi-processor systems. Such per... / collisions. Under worm-hole routing assumptions each message takes br scheduling. While it encompasses routing aspects and path selection as
2567.6 Encouraging SME Acceptance of EDI: An Educational Approach - Craig Parker (1995)(Correct)
Telecommunications addresses the tyranny of distance for international and domestic trade
communities by providing information linkages both internally and externally to an organisation.
These global ... / the sending receiving IS C routing the documents across the
2557.1 A Router Architecture for Real-Time Communication in Multicomputer.. - Rexford, Hall, Shin (1998)(Correct)
Parallel machines have the potential to satisfy
the large computational demands of real-time applications.
These applications require a predictable communication
network, where time-constrained traffi... / A Router Architecture for Real-Time br packets. This paper presents a new router architecture that tailors
2554.8 A Modest Proposal for Preventing Internet Congestion - Odlyzko (1997)(Correct)
A simple approach, called PMP (Paris Metro Pricing), is suggested for dealing with
congestion in packet networks such as the Internet. It is to partition a network into
several logical networks, each ... / in Section .All networks would route packets using protocols similar br which aside from the issue of routing tables only have to react to
2537.7 An Optimized Hardware Architecture and Communication Protocol for.. - Shoemaker (1997)(Correct)
Managing communications in parallel processing systems has proven to be one of the
most critical problems facing designers. As processor speeds continue to increase, communication
latency and bandwidt... / a bottleneck. Traditional network routers receive messages that are br examined and forwarded by a local router. Performance is lost both by the
2535.4 Location Uncertainty in Mobile Networks: A Theoretical Framework - Rose, Yates (1996)(Correct)
As users, services, databases and computers become increasingly mobile, so fades the era
of the fixed network. Modern networks are becoming mobile networks which must accommodate
a broad range service... / First consider the problem of routing a call to a mobile unit U in br must have some knowledge of how to route a call to unit U A number of
2531.1 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
2529.3 Genetic Algorithms and Neighbourhood Search - Reeves (1994)(Correct)
Genetic algorithms (GAs) have proved to be a versatile and effective approach for solving
combinatorial optimization problems. Nevertheless, there are many situations in which the
simple GA does not p... / machine-sequencing vehicle routing and of course the br Multiple vehicle routing with time and capacity
2484.1 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
2482.2 Implementation of Communication Intensive Algorithms On.. - Kapoor (1993)(Correct)
The aim of this thesis has been:
To demonstrate the superiority of the reconfigurable mesh architecture, especially
for communication intensive algorithms, over existing fixed connection
architectures... / basic applications sorting routing and connected component br Deterministic Permutation Routing on a Reconfigurable Mesh to
2481.5 Design and Implementation of the Fiduccia-Mattheyses Heuristic for.. - Caldwell, Kahng, Markov (1999)(Correct)
We discuss the implementation and evaluation of move-based
hypergraph partitioning heuristics in the context of VLSI design applications.
Our first contribution is a detailed software architecture, ... / tool might perform timing- and routing congestion-driven recursive br applied for purposes ranging from routability-driven clustering to
2465.8 Communication Efficient Data Structures on the BSP model with.. - Alexandros Gerbessiotis (1996)(Correct)
The implementation of data structures on distributed memory models such as the Bulk-Synchronous
Parallel (BSP) model, rather than shared memory ones such as the Parallel Random Access Machine
(PRAM), ... / and network conflicts during routing bandwidth of interconnection br All these primitives are auxiliary routines for the algorithms described
2457.9 Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel .. - Kavvadias, al. (1996)(Correct)
We show how to decompose efficiently in parallel any graph into a number, ~ fl, of
outerplanar subgraphs (called hammocks) satisfying certain separator properties. Our
work combines and extends the se... / path information into compact routing tables succinct encoding br in these subintervals.Compact routing tables are very useful in
2456.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
2456.5 Practical Parallel Algorithms for Personalized Communication and.. - Bader, Helman, JaJa (1995)(Correct)
A fundamental challenge for parallel computing is to obtain high-level, architecture independent, algorithms
which efficiently execute on general-purpose parallel machines. With the emergence of messa... / of collective communication routines they do not handle an br Sort Communication Primitives Routing h-Relations Parallel
2439.2 Performance Analysis Of Multiprocessor Interconnection Networks Using .. - Turner (1995)(Correct)
This memory reference pattern is typical of several
types of access in shared-memory systems. Cache-line fetches and prefetches, vectorregister
loads and stores, even paging traffic can be represented... / and oblivious virtualchannel routers used in a D torus are compared br The design of a novel adaptive router the Shunt router is proposed.
2436.4 Large-Scale Fault Isolation - Reddy, Estrin, Govindan (1999)(Correct)
Of the many distributed applications designed for the Internet, the successful ones are those that have paid careful attention to scale and robustness. These applications share several design principl... / dynamics transient congestion route changes signicantly aect the br isolating such faultslocating the routers responsible for these faults.
2428.9 Multicast Security and Its Extension to a Mobile Environment - Gong, Shacham (1995)(Correct)
this paper, we consider
fundamental security issues in building a trusted multicast facility. We discuss
techniques for group-based data encryption, authentication of participants, and
preventing unau... / specified for the multicast hosts or routers. Several ad hoc fixes have been br relies on a subset of the Internet routers and hosts that can participate
2389.8 Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs - Yeh, Varvarigos (1996)(Correct)
We propose a new class of interconnection networks, called macro-star networks, which belong to the class of Cayley
graphs and use the star graph as a basic building module. A macro-star network can h... / Cayley graphs star graphs routing algorithm emulation multinode br i logN loglogN j Routing in an MS network can be viewed as
2364.7 Analytical Modeling of Routing Algorithms in Virtual Cut-Through.. - Rexford, Shin(Correct)
Contemporary multicomputer networks reduce communication latency by allowing an in-transit
packet to "cut through" intermediate nodes to idle outgoing links, instead of buffering at each hop in
its ro... / Analytical Modeling of Routing Algorithms in Virtual br of buffering at each hop in its route. Under these cut-through switching
2361.7 Design and Architecture for Database Solutions in Future.. - Raatikainen(Correct)
Introduction
Databases will already in the near future have a central role in telecommunications
networks. The information needed in operations and management of the nets will be
collected into a log... / Service with option to provide routing statistics to the subscriber.
2353.5 Integrating Theory and Practice in Parallel File Systems - Thomas Cormen(Correct)
Several algorithms for parallel disk systems have appeared in the literature recently, and
they are asymptotically optimal in terms of the number of disk accesses. Scalable systems
with parallel disks... / most notably networks and routing methods. In addition empirical br of monotonic and k-monotonic routes. In a monotonic route all
2350.6 Fault handling for multi-party real-time communication - Gupta, Rothermel (1995)(Correct)
For real-time communication services to achieve widespread usage, it is important
that the network services behave gracefully if any component(s) fail. While other
researchers have previously consider... / presence of network faults the routes selected may not be as good the br the FEC'ed data among disjoint routes. With these mechanisms we can
2342.5 Internet Services: from Electronic Mail to Real-Time Multimedia - Schulzrinne (1995)(Correct)
In the first twenty years of its existence, the Internet was mainly used for email and file transfer,
mostly by researchers and technical staff in American universities, government and some industrial... / better if care is taken which routers have to manage group membership br field. Since most Internet backbone routers do not support IP multicast an
2328.3 The Random Adversary: A Lower-Bound Technique For Randomized Parallel .. - MacKenzie(Correct)
The Random-Adversary technique is a general method for proving lower bounds on
randomized parallel algorithms. The bounds apply to the number of communication steps, and they
apply regardless of the... / geometry and graph theory to routing and load balancing. Often these br a lower bound for a fundamental routing problem on the Optical
2326.1 Contention Resolution in Hashing Based Shared Memory Simulations - Czumaj, der Heide, Stemann(Correct)
In this paper we study the problem of simulating shared memory on the Distributed
Memory Machine (DMM). Our approach uses multiple copies of shared memory cells, distributed
among the memory modules... / or an expander and packet routing is used to access the modules br Our transformation relies on a new routing problem called All-But-Linear
2322.4 Hierarchical Source Routing Using Implied Costs - Montgomery, DE VECIANA (1998)(Correct)
Based on a loss network model, we present an adaptive source routing scheme for a large, hierarchicallyorganized
network. To represent the "available" capacity of a peer group (subnetwork), we compute... / Hierarchical Source Routing Using Implied Costs MICHAEL br we present an adaptive source routing scheme for a large
2304.3 Parallel Algorithms For Placement And Routing In VLSI Design - Brouwer (1991)(Correct)
INTRODUCTION
1.1. Parallel Processing for CAD
In view of the increasing complexity of very large scale integrated circuits (VLSI),
there is a growing need for sophisticated computer-aided design (CAD)... / Algorithms For Placement And Routing In Vlsi Design By Randall Jay br . Cell Placement . Global Routing . Detailed Routing .
2300.7 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
2295.4 Iteration Space Tiling for Distributed Memory Machines - Ramanujam, Sadayappan (1992)(Correct)
This paper addresses the problem of compiling nested loops for distributed memory machines.
The relatively high communication start-up costs in these machines renders frequent communication
very expen... / years in the area of intelligent routing mechanisms and efficient br C. Seitz Deadlock-free Message Routing in Multiprocessor Interconnection
2288.3 Fault-oriented Test Generation for Multicast Routing - Helmy, Estrin, Gupta (1998)(Correct)
The unprecedented growth of the Internet and the introduction of new network services, such as multicast,
has lead to the increased complexity of network protocols and protocol interaction. Multicast ... / Test Generation for Multicast Routing Ahmed Helmy Deborah Estrin br protocols such as unicast routing anomalies and selective loss
2284.8 Efficient Broadcast and Multicast on Multistage Interconnection.. - Rajeev Sivaram (1996)(Correct)
This paper proposes a new approach for implementing fast multicast and broadcast in unidirectional and bidirectional
multistage interconnection networks (MINs) with multiport encoded multidestination ... / broadcast multicast wormhole routing and virtual cut-through. br Introduction The wormhole-routing switching technique is the
2283.6 Internet Telephony Gateway Location - Rosenberg (1998)(Correct)
Although the Internet was designed to handle non-real time data traffic, it is being used increasingly to carry voice and video. One important class of contributors to this growth are Internet telepho... / databases multicast advertisement routing protocols and centralized br layer the ITG would translate routing and addressing information from
2281.2 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
2264.1 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
2261.6 Wireless Network Multicasting - Chiang (1998)(Correct)
of the Dissertation
Wireless Network Multicasting
by
Ching-Chuan Chiang
Doctor of Philosophy in Computer Science
University of California, Los Angeles, 1998
Professor Mario Gerla, Chair
Wireless n... / . . . Routing . br . . Routing Protocols .
2256.4 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
2246.7 A Randomized Parallel Sorting Algorithm With an Experimental Study - Helman, Bader, JáJá (1996)(Correct)
Previous schemes for sorting on general-purpose parallel machines have had to choose between
poor load balancing and irregular communication or multiple rounds of all-to-all personalized communication... / identify the most efficient sorting routines. Yet parallel sorting br basic collective communication routines. Our algorithm was implemented
2231.7 Multidestination Message Passing Mechanism Conforming to Base.. - Panda (1994)(Correct)
This paper proposes a novel concept of multidestination worm mechanism which allows a message to be propagated in a wormhole network conforming to the underlying base routing scheme (ecube, planar, ... / Conforming to Base Wormhole Routing Scheme Dhabaleswar K. Panda br in Proceedings of Parallel Routing and Communication Workshop May
2209.8 A Hybrid Approach to Modeling Metabolic Systems Using Genetic.. - Yen, Liao, Lee, Randolph (1995)(Correct)
One of the main obstacles in applying genetic algorithms (GAs) to complex problems
has been the high computational cost due to their slow convergence rate. We encountered
such a difficulty in an attem... / design scheduling routing control and others br serving as the primary search routine. The GA interleaves with
2203.4 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
2199.2 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
2199.1 Exploiting Domain Geometry in Analogical Route Planning - Haigh, Shewchuk, Veloso (1997)(Correct)
Automated route planning consists of using real maps to automatically find good map routes. Two
shortcomings to standard methods are (i) that domain information may be lacking, and (ii) that a "good"
... / Domain Geometry in Analogical Route Planning Karen Zita Haigh br Exploiting Geometry in Analogical Route Planning Abstract Automated
2198.8 A Survey of Collective Communication in Wormhole-Routed Massively.. - McKinley, Tsai, Robinson (1994)(Correct)
Massively parallel computers (MPC) are characterized by the distribution of memory
among an ensemble of nodes. Since memory is physically distributed, MPC nodes communicate
by sending data through a n... / Communication in Wormhole-Routed Massively Parallel Computers br systems that use the wormhole routing switching strategy in which
2198.1 Triplex Router: A Versatile Torus Routing Algorithm - Melanie Fulgham (1996)(Correct)
Parallel applications exhibit a variety of communication styles from small, frequent
messages to a few, very large messages containing data sets. The ability of the network
to satisfy the application'... / Triplex Router A Versatile Torus Routing br Triplex Router A Versatile Torus Routing Algorithm Melanie L. Fulgham
2189.9 Manufacturing Cell Design: An Integer Programming Model Employing.. - Joines, Culbreth, King (1996)(Correct)
The design of a cellular manufacturing system requires that a part population, at least minimally described by its use of process technology (part/machine incidence matrix), be partitioned into part f... / manipulate process sequences or routings to form the corresponding machine br formation methods based on process routings can be further categorized
2184.3 A framework for delivering multicast messages in networks with mobile .. - Acharya, Badrinath (1996)(Correct)
this paper, we look at the problems associated
with delivering multicast messages to mobile hosts. First, we identify how a mobile host's ability to connect to different
MSSs at different times, affec... / schemes and protocols for routing messages to and from mobile hosts br determined before a message can be routed to it. Second bandwidth of the
2174.6 Architectural Support for Managing Communication in Point-to-Point.. - Feng, Rexford, Mehra, Daniel.. (1994)(Correct)
Point-to-point networks provide a natural platform for distributed systems due to their high
bandwidth, scalability, and the potential for exploiting communication locality. Managing
these networks, h... / applications. Since the various routing and switching schemes are br adapter that supports a variety of routing and switching schemes and
2171.6 GA-easy and GA-hard Constraint Satisfaction Problems - Eiben, Raué, Ruttkay (1995)(Correct)
In this paper we discuss the possibilities of applying genetic
algorithms (GA) for solving constraint satisfaction problems (CSP). We
point out how the greediness of deterministic classical CSP solvin... / function is given such as routing or scheduling. Many of these
2169.5 Alleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary.. - Basak, Panda (1995)(Correct)
This paper identifies performance degradation in wormhole routed k-ary n-cube networks
due to limited number of router-to-processor consumption channels at each node. Many recent
research in wormhole ... / Channel Bottleneck in Wormhole-Routed k-ary n-cube Systems br Channel Bottleneck in Wormhole-Routed k-ary n-cube Systems
2167.3 Precomputation based Load Balancing - Böhm, Speckenmeyer (1996)(Correct)
An algorithm, called PLB is introduced, which redistributes workload
in a processor network N in order to supply every processor of N with
(about) the same amount of workload. PLB is defined in its ba... / for every network because no routing is necessary in clique networks.
2161.0 Enabling Large-scale Simulations: Selective Abstraction Approach to.. - Huang, Estrin, Heidemann (1998)(Correct)
ion Approach to The Study of Multicast Protocols
Polly Huang, Deborah Estrin, John Heidemann
USC/Information Science Institute
University of Southern California
4676 Admiralty Way, Suite 1001
Marina d... / modules and a node may contain routing tables forwarding machinery br protocol may need multicast routing tables in order to forward
2146.5 Implementation of Sparse Neural Networks on Fixed Size Arrays - Misra, Kumar (1991)(Correct)
Recent research in Artificial Neural Networks (ANN's) has shown that ANN's
will play an important role in solving many signal processing problems. To fully
capture the potential that this new computat... / . Data Routing br uses a method developed to route arbitrary directed graphs on SIMD
2129.3 Design and Implementation of Multicast Operations for ATM-Based High.. - Huang, Kasten, McKinley (1994)(Correct)
Cluster-based computing, which exploits the aggregate
computational power of off-the-shelf processing
nodes, has drawn increasing attention in the parallel
processing community. Clusters include both ... / and a byte header that provides routing information. Moreover ATM is br emerging standard for communication routines used in message-passing
2123.8 Handoff and System Support for Indirect TCP/IP - Bakre, Badrinath (1995)(Correct)
Over the past few years, Transmission Control
Protocol (TCP) has become the most widely used
transport layer protocol on the Internet. TCP performs
poorly however, if one of the communicating
hosts is... / mobile host and its Mobile Support Router MSR without causing br base station or the mobile support router MSR to distinguish between
2120.7 An Extended Dominating Node Approach to Broadcast and Global Combine.. - Yih-Jia Tsai (1997)(Correct)
A new approach to the design of collective communication operations in wormholerouted
mesh networks is described. The approach extends the concept of dominating
sets in graph theory by accounting for ... / Combine in Multi-Port Wormhole-Routed Mesh Networks Yih-jia Tsai and br Combine in Multi-Port Wormhole-Routed Mesh Networks Yih-jia Tsai and
2117.9 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
2115.4 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
2110.8 Call Admission and Resource Reservation for Multicast Sessions - Firoiu, Towsley (1996)(Correct)
Multicast applications, including audio and video, are expected to consume a large fraction
of resources in forthcoming high speed networks. Because of this, new services are needed to
provide the qua... / establishing a multicast tree routing checking whether or not the br performing resource allocation. Route establishment is an important part
2109.4 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
2106.0 New Constructs for the Description of Combinatorial Optimization.. - Bisschop, Fourer (1995)(Correct)
Algebraic languages are at the heart of many successful optimization modeling systems,
yet they have been used with only limited success for combinatorial (or discrete) optimization.
We show in this p... / problems in network design routing and packing. Successful attacks br how the implicit enumeration routines will search for a solution.
2099.5 Analytical Models of Adaptive Routing Strategies - Najjar, Lagman, Sur, Srimani (1994)(Correct)
Adaptive routing algorithms have been frequently suggested as a means of improving communication
performance in multicomputers. These algorithms, unlike deterministic routing,
can utilize network stat... / Analytical Models of Adaptive Routing Strategies W. A. Najjar A. br MIP- Modeling Adaptive Routing W. A. Najjar A. Lagman S.
2093.9 VMMC-2: Efficient Support for Reliable, Connection-Oriented.. - Dubnicki, Bilas, Chen, Damianakis, Li(Correct)
The basic virtual memory-mapped communication
(VMMC) model provides protected, direct communication
between the sender's and receiver's virtual address spaces,
but it does not support high-level conne... / PCs connected by the Intel Paragon routing network and PCs connected br network interfaces and Myrinet routing switches. Programming with VMMC
2092.7 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... / system the name service and the routing tables become dictionary-like
2088.9 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
2085.0 Mixing of Random Walks and Other Diffusions on a Graph - Lovász, Winkler (1995)(Correct)
We survey results on two diffusion processes on graphs: random
walks and chip-firing (closely related to the "abelian sandpile" or
"avalanche" model of self-organized criticality in statistical mechan... / related multicommodity flows and routing in VLSI. In this paper we survey
2083.3 Using Recurrent Neural Networks to Learn the Structure of.. - Goudreau, Giles (1995)(Correct)
A modified Recurrent Neural Network (RNN) is used to learn a Self-Routing
Interconnection Network (SRIN) from a set of routing examples. The RNN is
modified so that it has several distinct initial sta... / RNN is used to learn a Self-Routing Interconnection Network SRIN br Network SRIN from a set of routing examples. The RNN is modified so
2048.5 Simple Algorithms for Routing on Butterfly Networks with Bounded.. - Maggs, Sitaraman (1992)(Correct)
This paper examines several simple algorithms for routing packets on butterfly
networks with bounded queues. We show that for any greedy queuing protocol, a
routing problem in which each of the N inpu... / Simple Algorithms for Routing on Butterfly Networks with br several simple algorithms for routing packets on butterfly networks
2045.6 An Evaluation of Multriprocessor Cache Coherence Based on Virtual.. - Petersen, Li (1992)(Correct)
This paper presents an evaluation of the impact of several architectural parameters on the performance
of Virtual Memory (VM) based cache coherence schemes for shared-memory multiprocessors.
The VM-ba... / such as crossbars rings and routing networks cannot take advantage br is a parallel VLSI standard cell router. The applications is parallelized
2041.2 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... / card to connect the PCs to the routing backplane and the software
2038.8 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
2036.5 The Bird-Meertens Formalism as a Parallel Model - Skillicorn (1993)(Correct)
The expense of developing and maintaining software is the major obstacle to the routine use of parallel computation. Architecture independent programming offers a way of avoiding the problem, but the ... / is the major obstacle to the routine use of parallel computation. br memory hashing or randomized routing Thus the topology of the
2028.3 A Flow-Based Approach to Datagram Security - Suvo Mittra (1997)(Correct)
Datagram services provide a simple, flexible, robust, and
scalable communication abstraction; their usefulness has
been well demonstrated by the success of IP, UDP, and
RPC. Yet, the overwhelming majo... / especially in the context of routing and QoS. A flow characterizes a br especially in relationship to routing e.g.in IPv and quality
2027.0 A Dynamic Object Replication and Migration Protocol for an Internet.. - Michael Rabinovich (1998)(Correct)
This paper proposes a protocol suite for dynamic replication and migration of Internet objects. It
consists of an algorithm for deciding on the number and location of object replicas and an algorithm ... / in databases maintained by Internet routers. A simulation study using br CISCO Distributed Director we use routers databases to extract proximity
2024.9 A Survey of Semantic Techniques for Active Networks - Jeffrey, Wakeman (1997)(Correct)
Active networks open up switches within the network to allow computation
upon them. Because these switches are public resources, and are
essential to the proper and correct running of many important s... / R R R H R Active nodes Host Router Passive nodes In reality br not requiring the intermediate routers to be changed. Examples
2024.5 Destination-Driven Routing for Low-Cost Multicast - Shaikh, Shin (1997)(Correct)
The increasing interest in distributed applications like multimedia and collaborative work
calls for efficient means to support multicast communication. A fundamental issue in multicast
communication ... / Destination-Driven Routing for Low-Cost Multicast Anees br issue in multicast communication is route selection usually based on trees.
2022.1 P³T: An Automatic Performance Estimator for Parallel Programs - Fahringer (1995)(Correct)
The area of parallelizing compilers for distributed memory multicomputers has seen considerable research
activity during the last few years. Most of the current compilers do not provide any support fo... / of cache lines data type sizes routing policy startup times and message br communications with e-cube routing channel contention can increase
2020.8 Performance Driven Global Routing For Standard Cell Design - Jason Cong (1997)(Correct)
Advances in fabrication technology have resulted in a continual
shrinkage of device dimensions. This has resulted in
smaller device delays, greater resistance along interconnect
wires, and a greater i... / Performance Driven Global Routing For Standard Cell Design Jason br with the problem of global routing and interconnect optimization for
2013.3 Network Resource Control in the Tandem ServerNet Router - Kim, Chien, Horst, Krause, Sonnier.. (1996)(Correct)
Existing multicomputer network routers use simple arbitration techniques such as first-comefirst
-serve or round-robin which have significant limitations in supporting needs in emerging
multicomputer ... / Control in the Tandem ServerNet Router March Abstract br Existing multicomputer network routers use simple arbitration
2011.3 A Scheduling Service Model and a Scheduling Architecture for an.. - Shenker, Clark, Zhang (1993)(Correct)
The Internet is currently being confronted with service demands from a new generation
of applications. Supporting these applications effectively and efficiently will require extending
the current Inte... / are used which is the domain of routing and those services which br service model Internet routers must employ an appropriately
2010.9 The Design and Performance Evaluation of the DI-multicomputer - Choi, Chien (1996)(Correct)
In this paper, we propose a new multicomputer node architecture, the DI-multicomputer which
uses packet routing on a uniform point-to-point interconnect for both local memory access and internode
comm... / DI-multicomputer which uses packet routing on a uniform point-to-point br This is achieved by integrating a router onto each processor chip and
2007.4 Communication-Efficient Parallel Algorithms for Distributed.. - Leiserson (1988)(Correct)
This paper introduces a model for parallel computation, called the
distributed random-access machine (DRAM), in which the communication
requirements of parallel algorithms can be evaluated. A DRAM
is... / memory accesses are implemented by routing messages through a communication br are interconnected as a graph and routing of messages is performed by the