89 search results - page 14 / 18 » Fast paths in large-scale dynamic road networks |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Conventional optical networks are based on SONET rings, but since rings are known to use bandwidth inefficiently, there has been much research into shared mesh protection, which pr...
NSDI
2004
13 years 9 months ago
2004
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—We study a mobile wireless network where groups or clusters of nodes are intermittently connected via mobile “carriers” (the carriers provide connectivity over time among di...
EURONGI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract— Trajectory Based Forwarding (TBF) is a new approach to routing in ad hoc wireless networks. It exploits node position information and, similarly to source routing, requ...
STOC
2010
ACM
14 years 11 days ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...