460 search results - page 16 / 92 » Bounding the locality of distributed routing algorithms |
MOBICOM
2010
ACM
13 years 8 months ago
2010
ACM
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
NETCOOP
2007
Springer
14 years 1 months ago
2007
Springer
— We present both a game theoretic and a distributed algorithmic approach for the transit price negotiation problem in the interdomain routing framework. We analyze the behavior ...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
Fully-populated tori, where every node has a processor attached, do not scale well since load on edges increases superlinearly with network size under heavy communication, resulti...