244 search results - page 13 / 49 » Algorithmic Techniques for Maintaining Shortest Routes in Dy... |
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by sever...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
CIIT
2004
13 years 9 months ago
2004
Ants-based routing algorithms have attracted the attention of researchers because they are more robust, reliable, and scalable than other conventional routing algorithms. Since th...
IMC
2003
ACM
14 years 1 months ago
2003
ACM
Routing loops are caused by inconsistencies in the routing state of the network. Although undesirable from this aspect, they can provide insight into the routing dynamics that cau...
DSOM
2003
Springer
14 years 1 months ago
2003
Springer
Building self-maintained overlay networks for message routing has recently attracted significant research interest [5–9]. All suggested solutions have a common goal: To build an...