1016 search results - page 79 / 204 » Optimized algorithms for multi-agent routing |
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
ANCS
2009
ACM
14 years 7 months ago
2009
ACM
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
DICS
2006
15 years 1 months ago
2006
We address failure location and restoration in both optical and wireless ad hoc networks. First, we show how Maximum Likelihood inference can improve failure location algorithms in...
ICDCS
2002
IEEE
15 years 2 months ago
2002
IEEE
: A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path ...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...