Sciweavers

410 search results - page 3 / 82
» Upgrading Shortest Paths in Networks
Sort
View
NETWORKS
2007
14 years 9 months ago
Survivable IP network design with OSPF routing
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
Luciana S. Buriol, Mauricio G. C. Resende, Mikkel ...
95
Voted
GIS
2010
ACM
14 years 8 months ago
A case for time-dependent shortest path computation in spatial networks
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
PVLDB
2010
269views more  PVLDB 2010»
14 years 8 months ago
Shortest Path Computation on Air Indexes
Shortest path computation is one of the most common queries in location-based services that involve transportation networks. Motivated by scalability challenges faced in the mobil...
Georgios Kellaris, Kyriakos Mouratidis
77
Voted
NETCOOP
2007
Springer
15 years 3 months ago
A New Necessary Condition for Shortest Path Routing
In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This...
Mats Petter Pettersson, Krzysztof Kuchcinski
INFOCOM
2009
IEEE
15 years 4 months ago
Capacity Provisioning a Valiant Load-Balanced Network
—Valiant load balancing (VLB), also called two-stage load balancing, is gaining popularity as a routing scheme that can serve arbitrary traffic matrices. To date, VLB network de...
Andrew R. Curtis, Alejandro López-Ortiz