244 search results - page 12 / 49 » Algorithmic Techniques for Maintaining Shortest Routes in Dy... |
INFOCOM
2000
IEEE
14 years 10 days ago
2000
IEEE
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
HICSS
2005
IEEE
14 years 1 months ago
2005
IEEE
— Structured peer-to-peer systems have emerged as infrastructures for resource sharing in large-scale, distributed, and dynamic environments. One challenge in these systems is to...
VTC
2010
IEEE
13 years 5 months ago
2010
IEEE
1The classic Dynamic Source Routing (DSR) protocol opts for the route requiring the lowest number of hops for transmitting data from the source to the destination. However, owing t...
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
: Mobile Ad hoc Networks are characterized by multi-hop wireless links, without any infrastructure, and frequent host mobility. A plethora of routing protocols has been proposed. A...
CIKM
2007
Springer
13 years 12 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...