Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
119
Deriving Traffic Demands for Operational IP networks: Methodology and Experience
- IEEE/ACM TRANSACTIONS ON NETWORKING
, 2001
"... Engineering a large IP backbone network without an accurate, network-wide view of the traffic demands is challenging. Shifts in user behavior, changes in routing policies, and failures of network elements can result in significant (and sudden) fluctuations in load. In this paper, we present a model ..."
Abstract
-
Cited by 297 (39 self)
- Add to MetaCart
between domains. To infer the traffic demands, we propose a measurement methodology that combines flow-level measurements collected at all ingress links with reachability information about all egress links. We discuss how to cope with situations where practical considerations limit the amount and quality
Reachable Nearest Neighbor Query Processing of R- Trees for Moving Query Object
"... Efficient storage and retrieval of multidimensional data in large volumes has become one of the key issues in the design and implementation of commercial and application software. The kind of queries posted on such data is also multifarious. Nearest neighbor queries are one such category and have mo ..."
Abstract
- Add to MetaCart
explored on visible NN queries, but retrieved NN object may not always be reachable from the query object, since some obstacle objects (i.e. Hills, Rivers, Vallies) might be in between query point and NN point. This paper proposes Reachable Nearest neighbor queries for moving query object. The results
Neighbor Discovery for IP version 6 (IPv6)", RFC 4861
, 2007
"... This document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the "Internet Official Protocol Standards " (STD 1) for the standardization state and status of this pro ..."
Abstract
-
Cited by 117 (4 self)
- Add to MetaCart
of this protocol. Distribution of this memo is unlimited. This document specifies the Neighbor Discovery protocol for IP Version 6. IPv6 nodes on the same link use Neighbor Discovery to discover each other’s presence, to determine each other’s link-layer addresses, to find routers, and to maintain reachability
A Parallel Algorithm for Computing 3-D Reachable Workspaces
"... The problem of computing the 3-D workspace for redundant articulated chains has ap-plications in a variety of fields such as robotics, computer aided design, and computer graphics. The computational complexity of the workspace problem is at least NP-hard. The recent advent of parallel computers has ..."
Abstract
- Add to MetaCart
that are computed in the first phase and fits a 3-D surface around the volume that encompasses the workspace points. The second phase also maps the 3-D points into slices, uses region filling to detect the holes and voids in the workspace, extracts the workspace boundary points by testing the neighboring cells
Subgoal Graphs for Optimal Pathfinding in Eight-Neighbor Grids ∗
"... Grids are often used to represent maps in video games. In this paper, we propose a method for preprocessing eight-neighbor grids to generate subgoal graphs and show how subgoal graphs can be used to find shortest paths fast. We place subgoals at the corners of obstacles (similar to visibility graphs ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
Grids are often used to represent maps in video games. In this paper, we propose a method for preprocessing eight-neighbor grids to generate subgoal graphs and show how subgoal graphs can be used to find shortest paths fast. We place subgoals at the corners of obstacles (similar to visibility
Securing Neighbor Discovery Proxy: Problem Statement
, 2010
"... Neighbor Discovery Proxies are used to provide an address presence on a link for nodes that are no longer present on the link. They allow a node to receive packets directed at its address by allowing another device to perform Neighbor Discovery operations on its behalf. Neighbor Discovery Proxy is u ..."
Abstract
- Add to MetaCart
is used in Mobile IPv6 and related protocols to provide reachability from nodes on the home network when a Mobile Node is not at home, by allowing the Home Agent to act as proxy. It is also used as a mechanism to allow a global prefix to span multiple links, where proxies act as relays for Neighbor
Efficient Query Reformulation in Peer Data Management Systems
- In ACM SIGMOD
, 2004
"... ABSTRACT Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's domain of interest, and semantic relationships between peers are provided locally between pairs (or small sets ..."
Abstract
-
Cited by 121 (3 self)
- Add to MetaCart
sets) of peers. By traversing semantic paths of mappings, a query over one peer can obtain relevant data from any reachable peer in the network. Semantic paths are traversed by reformulating queries at a peer into queries on its neighbors. Naively following semantic paths is highly inefficient
Topology Dissemination Based on Reverse-Path Forwarding (TBRPF): Correctness and Simulation Evaluation
, 2003
"... This memo defines an Experimental Protocol for the Internet community. It does not specify an Internet standard of any kind. Discussion and suggestions for improvement are requested. Distribution of this memo is unlimited. Copyright Notice Copyright (C) The Internet Society (2004). All Rights Reserv ..."
Abstract
-
Cited by 114 (0 self)
- Add to MetaCart
reachable nodes) based on partial topology information stored in its topology table, using a modification of Dijkstra’s algorithm. To minimize overhead, each node reports only *part * of its source tree to neighbors. TBRPF uses a combination of
Comparative Analysis Of Neighbor Greeting Procotols ARP Versus ES-IS
, 1996
"... Neighbor greeting involves a process used by network nodes to achieve reachability and discovery. The Address Resolution Protocol (ARP) and End-System to Intermediate-System Routing Exchange Protocol (ES-IS) are competing approaches to the neighbor greeting problem. This paper provides a detailed an ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
Neighbor greeting involves a process used by network nodes to achieve reachability and discovery. The Address Resolution Protocol (ARP) and End-System to Intermediate-System Routing Exchange Protocol (ES-IS) are competing approaches to the neighbor greeting problem. This paper provides a detailed
Differentially Constrained Mobile Robot Motion Planning in State Lattices
, 2008
"... We present an approach to the problem of differentially constrained mobile robot motion planning in arbitrary cost fields. The approach is based on deterministic search in a specially discretized state space. We compute a set of elementary motions that connects each discrete state value to a set of ..."
Abstract
-
Cited by 39 (4 self)
- Add to MetaCart
of its reachable neighbors via feasible motions. Thus, this set of motions induces a connected search graph. The motions are carefully designed to terminate at discrete states, whose dimensions include relevant state variables (e.g., position, heading, curvature, and velocity). The discrete states
Results 1 - 10
of
119
