Sciweavers

1815 search results - page 94 / 363
» Path Planning for Network Performance
Sort
View
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
14 years 21 days ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
SPAA
2005
ACM
14 years 1 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
ADHOCNOW
2008
Springer
14 years 2 months ago
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
Luminita Moraru, Pierre Leone, Sotiris E. Nikolets...
ICN
2005
Springer
14 years 1 months ago
Load Distribution Performance of the Reliable Server Pooling Framework
Abstract. The Reliable Server Pooling (RSerPool) protocol suite currently under standardization by the IETF is designed to build systems providing highly available services by prov...
Thomas Dreibholz, Erwin P. Rathgeb, Michael Tü...
ICRA
2010
IEEE
220views Robotics» more  ICRA 2010»
13 years 6 months ago
Autonomous Underwater Vehicle trajectory design coupled with predictive ocean models: A case study
— Data collection using Autonomous Underwater Vehicles (AUVs) is increasing in importance within the oceanographic research community. Contrary to traditional moored or static pl...
Ryan N. Smith, Arvind Pereira, Yi Chao, Peggy Li, ...