1815 search results - page 68 / 363 » Path Planning for Network Performance |
ANCS
2007
ACM
15 years 1 months ago
2007
ACM
To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination and used in the forwar...
PET
2009
Springer
15 years 4 months ago
2009
Springer
The performance of an anonymous path can be described using many network metrics – e.g., bandwidth, latency, jitter, loss, etc. However, existing relay selection algorithms have ...
AINA
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
MOBICOM
2003
ACM
15 years 3 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
IMC
2009
ACM
15 years 4 months ago
2009
ACM
We show that currently prevalent practices for network path measurements can produce inaccurate inferences because of sampling biases. The inferred mean path latency can be more t...