358 search results - page 25 / 72 » A Computational Study of Routing Algorithms for Realistic Tr... |
GIS
2010
ACM
13 years 7 months ago
2010
ACM
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
NAS
2009
IEEE
14 years 3 months ago
2009
IEEE
- In this work, we study the problem of maximizing lightpath reliability in optical mesh networks against simultaneous failures of multiple fiber links without using protection sch...
SENSYS
2003
ACM
14 years 1 months ago
2003
ACM
The dynamic and lossy nature of wireless communication poses major challenges to reliable, self-organizing multihop networks. These non-ideal characteristics are more problematic ...
PEWASUN
2007
ACM
13 years 10 months ago
2007
ACM
The neighborhood discovery and its maintenance are very important in wireless networks for any applications, especially for routing and every self-∗ algorithm. Neighbor nodes ar...
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...