126 search results - page 5 / 26 » Optimal Routing in the Worst-Case-Error Metric |
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper we show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. The hyperbolic geometry can be used to facilitate maximally ef...
INFOCOM
2005
IEEE
14 years 29 days ago
2005
IEEE
— In this paper we consider packet networks loaded by admissible traffic patterns, i.e. by traffic patterns that, if optimally routed, do not overload network resources. In the...
FPGA
2008
ACM
13 years 9 months ago
2008
ACM
A design tool for routing channel segmentation in islandstyle FPGAs is presented. Given the FPGA architecture parameters and a set of benchmark designs, the tool optimizes routing...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
INFOCOM
1993
IEEE
13 years 11 months ago
1993
IEEE
We perform an exact analysis of the dynamic behavior of IGRP, an adaptive shortest-path routing algorithm widely used in the industry, on a simple ring network. The distance metri...