1016 search results - page 43 / 204 » Optimized algorithms for multi-agent routing |
178
click to vote
ISCA
2005
IEEE
15 years 11 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
147
Voted
COMCOM
2004
15 years 6 months ago
2004
Routing of packets in mobile ad hoc networks with a large number of nodes or with high mobility is a very difficult task and current routing protocols do not really scale well wit...
171
Voted
PDCAT
2005
Springer
15 years 11 months ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
156
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
182
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract— Network throughput and packet delay are two important parameters in the design and the evaluation of routing protocols for ad-hoc networks. While mobility has been show...