410 search results - page 38 / 82 » Upgrading Shortest Paths in Networks |
133
click to vote
SIGMETRICS
2005
ACM
15 years 7 months ago
2005
ACM
The ability to discover the AS-level path between two end-points is valuable for network diagnosis, performance optimization, and reliability enhancement. Virtually all existing t...
124
Voted
WEA
2010
Springer
15 years 6 months ago
2010
Springer
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
129
Voted
INFOCOM
2002
IEEE
15 years 6 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
ESA
2008
Springer
15 years 3 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...
130
click to vote
JCO
2006
15 years 1 months ago
2006
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...