410 search results - page 19 / 82 » Upgrading Shortest Paths in Networks |
112
click to vote
INFOCOM
1996
IEEE
15 years 5 months ago
1996
IEEE
We present a framework for the modeling of multipath routing in connectionless networks that dynamically adapt to network congestion. The basic routing protocol uses a short-term ...
201
click to vote
ICDE
2009
IEEE
16 years 3 months ago
2009
IEEE
Directions search returns the shortest path from a source to a destination on a road network. However, the search interests of users may be exposed to the service providers, thus r...
131
click to vote
DEBU
2010
15 years 1 months ago
2010
The popularity of location-based services and the need to perform real-time processing on them has led to an interest in queries on road networks, such as finding shortest paths a...
120
click to vote
CDC
2009
IEEE
14 years 11 months ago
2009
IEEE
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...
104
click to vote
ICCSA
2004
Springer
15 years 6 months ago
2004
Springer
We propose a hierarchical, cluster based semi-distributed routing protocol for a mobile ad hoc network. The network graph is partitioned into clusters using heuristics and the shor...