Sciweavers

333 search results - page 17 / 67
» Alternative Routes in Road Networks
Sort
View
ICDE
2011
IEEE
272views Database» more  ICDE 2011»
12 years 11 months ago
A continuous query system for dynamic route planning
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
Nirmesh Malviya, Samuel Madden, Arnab Bhattacharya
VTC
2007
IEEE
115views Communications» more  VTC 2007»
14 years 2 months ago
The DYMO Routing Protocol in VANET Scenarios
—Coupling Vehicular Ad Hoc Networks (VANETs) with wired networks such as the Internet via access points creates a difficult mix of highly mobile nodes and a static infrastructur...
Christoph Sommer, Falko Dressler
TKDE
2008
134views more  TKDE 2008»
13 years 7 months ago
Contraflow Transportation Network Reconfiguration for Evacuation Route Planning
Given a transportation network having source nodes with evacuees and destination nodes, we want to find a contraflow network configuration (that is, ideal direction for each edge) ...
Sangho Kim, Shashi Shekhar, Manki Min
CONEXT
2006
ACM
14 years 1 months ago
Using forgetful routing to control BGP table size
Running the Border Gateway Protocol (BGP), the Internet’s interdomain routing protocol, consumes a large amount of memory. A BGP-speaking router typically stores one or more rou...
Elliott Karpilovsky, Jennifer Rexford
WINE
2010
Springer
177views Economy» more  WINE 2010»
13 years 5 months ago
Braess's Paradox in Large Sparse Graphs
Braess's paradox, in its original context, is the counter-intuitive observation that, without lessening demand, closing roads can improve traffic flow. With the explosion of d...
Fan Chung, Stephen J. Young