12 search results - page 1 / 3 » Near Optimal Routing Lookups with Bounded Worst Case Perform... |
INFOCOM
2000
IEEE
14 years 2 months ago
2000
IEEE
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
In this paper, we present nearly optimal algorithms for broadcast on a d-dimensional nn:::n torus that supports all-port communication and wormhole routing. Let Tn denote the numb...
EUMAS
2006
13 years 11 months ago
2006
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that...
INFOCOM
2009
IEEE
14 years 4 months ago
2009
IEEE
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
NETWORKING
2008
13 years 11 months ago
2008
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...