410 search results - page 80 / 82 » Upgrading Shortest Paths in Networks |
74
Voted
SIGCOMM
1999
ACM
15 years 1 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
92
Voted
CICLING
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Previous work has shown that modeling relationships between articles of a regulation as vertices of a graph network works twice as better than traditional information ret...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
100
click to vote
SECON
2007
IEEE
15 years 3 months ago
2007
IEEE
—Mobile ad hoc networks (MANETs) are a critical technology in filling the gap where the network infrastructure is insufficient or does not exist at all. The dynamic topology of...
ANSS
2006
IEEE
15 years 3 months ago
2006
IEEE
There has been a lot research effort on developing reactive routing algorithms for mobile ad hoc networks (MANETs) over the past few years. Most of these algorithms consider findi...