244 search results - page 4 / 49 » Algorithmic Techniques for Maintaining Shortest Routes in Dy... |
CONEXT
2005
ACM
13 years 10 months ago
2005
ACM
Dynamic networks appear in several contexts: QoS routing faces the difficult problem of accurately and efficiently maintaining, distributing and updating network state information...
PVLDB
2010
13 years 6 months ago
2010
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...
LCN
2008
IEEE
14 years 2 months ago
2008
IEEE
— Although many multicast routing algorithms have been proposed in order to reduce the total cost in WDM optical networks, the link stress and delay are two parameters which are ...
ISPAN
2005
IEEE
14 years 1 months ago
2005
IEEE
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...
SENSYS
2003
ACM
14 years 1 months ago
2003
ACM
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...