95 search results - page 9 / 19 » Shortest Path Algorithms: An Evaluation Using Real Road Netw... |
WSDM
2010
ACM
14 years 4 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
PERCOM
2011
ACM
12 years 11 months ago
2011
ACM
—In this paper, we consider the problem of tracking fine-grained speeds variations of vehicles using signal strength traces from GSM enabled phones. Existing speed estimation te...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—Traditional network routing uses the single (shortest) path paradigm. This paradigm exposes sessions to various attacks along this path, such as eavesdropping, DoS attacks etc. ...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— Vehicular ad hoc networks using WLAN technology have recently received considerable attention. We present a position-based routing scheme called Connectivity-Aware Routing (CAR...
ICNP
2003
IEEE
14 years 21 days ago
2003
IEEE
TCP Slow Start exponentially increases the congestion window size to detect the proper congestion window for a network path. This often results in significant packet loss, while ...