Sciweavers

17 search results - page 1 / 4
» On the Evaluation of Shortest Journeys in Dynamic Networks
Sort
View
NCA
2007
IEEE
13 years 10 months ago
On the Evaluation of Shortest Journeys in Dynamic Networks
The assessment of routing protocols for wireless networks is a difficult task, because of the networks’ highly dynamic behavior and the absence of benchmarks. However, some of ...
Afonso Ferreira, Alfredo Goldman, Julian Monteiro
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
14 years 4 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
CNSR
2010
IEEE
140views Communications» more  CNSR 2010»
13 years 8 months ago
Performance Evaluation of Using a Dynamic Shortest Path Algorithm in OLSRv2
—MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constr...
Ulrich Herberg
PVLDB
2010
146views more  PVLDB 2010»
13 years 3 months ago
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
Michael Rice, Vassilis J. Tsotras
CONEXT
2005
ACM
13 years 6 months ago
The stability of paths in a dynamic network
Dynamic networks appear in several contexts: QoS routing faces the difficult problem of accurately and efficiently maintaining, distributing and updating network state information...
Fernando A. Kuipers, Huijuan Wang, Piet Van Mieghe...