Results 1  10
of
1,297,196
On triangulation of simple networks
 In 19th Annual ACM Symposium on Parallel Algorithms and Architectures
, 2007
"... Network triangulation is a method for estimating distances between nodes in the network, by letting every node measure its distance to a few beacon nodes, and deducing the distance between every two nodes x, y by using their measurements to their common beacons and applying the triangle inequality. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
point, where n is the number of points in the network. He then asked whether this term is necessary (for doubling metrics). We provide the first lower bounds on the number of beacons required for a triangulation in some specific simple networks. In particular, these bounds (i) answer Slivkins ’ question
On Triangulation of Simple Networks [Extended Abstract]
"... Network triangulation is a method for estimating distances between nodes in the network, by letting every node measure its distance to a few beacon nodes, and deducing the distance between every two nodes x, y by using their measurements to their common beacons and applying the triangle inequality. ..."
Abstract
 Add to MetaCart
point, where n is the number of points in the network. He then asked whether this term is necessary (for doubling metrics). We provide the first lower bounds on the number of beacons required for a triangulation in some specific simple networks. In particular, these bounds (i) answer Slivkins ’ question
Constraint Networks
, 1992
"... Constraintbased reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint expression ..."
Abstract

Cited by 1149 (43 self)
 Add to MetaCart
expressions. These have been successfully applied to diverse tasks such as design, diagnosis, truth maintenance, scheduling, spatiotemporal reasoning, logic programming and user interface. Constraint networks are graphical representations used to guide strategies for solving constraint satisfaction problems
Predicting Internet Network Distance with CoordinatesBased Approaches
 In INFOCOM
, 2001
"... In this paper, we propose to use coordinatesbased mechanisms in a peertopeer architecture to predict Internet network distance (i.e. roundtrip propagation and transmission delay) . We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which is bas ..."
Abstract

Cited by 633 (5 self)
 Add to MetaCart
In this paper, we propose to use coordinatesbased mechanisms in a peertopeer architecture to predict Internet network distance (i.e. roundtrip propagation and transmission delay) . We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which
Dummynet: A Simple Approach to the Evaluation of Network Protocols
 ACM Computer Communication Review
, 1997
"... Network protocols are usually tested in operational networks or in simulated environments. With the former approach it is not easy to set and control the various operational parameters such as bandwidth, delays, queue sizes. Simulators are easier to control, but they are often only an approximate mo ..."
Abstract

Cited by 477 (6 self)
 Add to MetaCart
model of the desired setting, especially for what regards the various traffic generators (both producers and consumers) and their interaction with the protocol itself. In this paper we show how a simple, yet flexible and accurate network simulator  dummynet  can be built with minimal modifications
Vivaldi: A Decentralized Network Coordinate System
 In SIGCOMM
, 2004
"... Largescale Internet applications can benefit from an ability to predict roundtrip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the cost of measurement can outweigh the benefits of exploiting proximity information. Vivaldi is a simp ..."
Abstract

Cited by 593 (5 self)
 Add to MetaCart
simple, lightweight algorithm that assigns synthetic coordinates to hosts such that the distance between the coordinates of two hosts accurately predicts the communication latency between the hosts.
Cognitive networks
 in Proc. of IEEE DySPAN 2005
, 2005
"... Abstract — This paper presents a definition and framework for a novel type of adaptive data network: the cognitive network. In a cognitive network, the collection of elements that make up the network observes network conditions and then, using prior knowledge gained from previous interactions with t ..."
Abstract

Cited by 1090 (7 self)
 Add to MetaCart
control and feedback. The paper concludes by presenting a simple case study to illustrate a cognitive network and its framework. I.
Discrete DifferentialGeometry Operators for Triangulated 2Manifolds
, 2002
"... This paper provides a unified and consistent set of flexible tools to approximate important geometric attributes, including normal vectors and curvatures on arbitrary triangle meshes. We present a consistent derivation of these first and second order differential properties using averaging Vorono ..."
Abstract

Cited by 453 (17 self)
 Add to MetaCart
This paper provides a unified and consistent set of flexible tools to approximate important geometric attributes, including normal vectors and curvatures on arbitrary triangle meshes. We present a consistent derivation of these first and second order differential properties using averaging Voronoi cells and the mixed FiniteElement/FiniteVolume method, and compare them to existing formulations. Building upon previous work in discrete geometry, these new operators are closely related to the continuous case, guaranteeing an appropriate extension from the continuous to the discrete setting: they respect most intrinsic properties of the continuous differential operators.
Results 1  10
of
1,297,196