407 search results - page 51 / 82 » Improved Algorithms for Network Topology Discovery |
192
click to vote
MSWIM
2006
ACM
15 years 12 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
152
click to vote
TEC
2002
15 years 5 months ago
2002
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
147
click to vote
CONEXT
2007
ACM
15 years 9 months ago
2007
ACM
The distributed nature of the Internet makes it difficult for a single service provider to troubleshoot the disruptions experienced by its customers. We propose NetDiagnoser, a tr...
153
click to vote
ISPDC
2008
IEEE
16 years 9 days ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
188
click to vote
GLOBECOM
2008
IEEE
16 years 11 days ago
2008
IEEE
—In sensor networks, both energy and bandwidth are scarce resources. In the past, many energy efficient routing algorithms have been devised in order to maximize network lifetim...