410 search results - page 55 / 82 » Upgrading Shortest Paths in Networks |
126
Voted
ICDE
2011
IEEE
14 years 7 months ago
2011
IEEE
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
127
Voted
SIGMETRICS
2003
ACM
15 years 8 months ago
2003
ACM
Conventional wisdom has been that the performance limitations in the current Internet lie at the edges of the network – i.e last mile connectivity to users, or access links of s...
165
Voted
PODC
2006
ACM
15 years 9 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
110
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
114
Voted
IICS
2009
Springer
15 years 10 months ago
2009
Springer
: This paper introduces an adaptive routing approach based on buffer status and distance in a mesh overlay network: Thermal Field is used for considering buffer stage and distance ...