358 search results - page 13 / 72 » A Computational Study of Routing Algorithms for Realistic Tr... |
MOBIHOC
2008
ACM
14 years 8 months ago
2008
ACM
Ad hoc networks formed by traveling vehicles are envisaged to become a common platform that will support a wide variety of applications, ranging from road safety to advertising an...
WEA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportati...
ISPAN
2005
IEEE
14 years 2 months ago
2005
IEEE
- Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cy...
INFORMATICALT
2006
13 years 8 months ago
2006
Abstract. Several best effort schemes (next-hop routing) are used to transport the data in the Internet. Some of them do not perform flexible route computations to cope up with the...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...