Sciweavers

76 search results - page 1 / 16
» Performance Evaluation of Using a Dynamic Shortest Path Algo...
Sort
View
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 2 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
GLOBECOM
2007
IEEE
13 years 11 months ago
LSP Setup Arrival Reordering Approach for MPLS-TE Routing
— In this paper, we evaluate a solution based on the preemption mechanism so as to improve performances of distributed Multi-Protocol Label Switching-Traffic Engineering (MPLS-T...
Imène Chaieb, Jean-Louis Le Roux, Bernard C...
INFOCOM
2010
IEEE
13 years 3 months ago
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
Shouwen Lai, Binoy Ravindran
INFOCOM
2007
IEEE
13 years 11 months ago
VoIP on Wireless Meshes: Models, Algorithms and Evaluation
—We study the problem of supporting VoIP calls in a wireless mesh network. Specifically, we propose solutions for call admission control (CAC) and route selection for VoIP calls...
Anand Kashyap, Samrat Ganguly, Samir R. Das, Suman...