89 search results - page 8 / 18 » Fast paths in large-scale dynamic road networks |
WEA
2007
Springer
14 years 2 months ago
2007
Springer
We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in pres...
ICDE
2011
IEEE
12 years 11 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...
BROADNETS
2004
IEEE
13 years 11 months ago
2004
IEEE
Survivability becomes increasingly critical in managing high-speed networks as data traffic continues to grow in both size and importance. In addition, the impact of failures is e...
SENSYS
2006
ACM
14 years 2 months ago
2006
ACM
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
ISCAPDCS
2003
13 years 9 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...