1391 search results - page 40 / 279 » Distributed routing in networks using affinity propagation |
166
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
— In this paper we consider packet networks loaded by admissible traffic patterns, i.e. by traffic patterns that, if optimally routed, do not overload network resources. In the...
144
click to vote
NOCS
2007
IEEE
16 years 13 days ago
2007
IEEE
Dynamic routing can substantially enhance the quality of service for multiprocessor communication, and can provide intelligent adaptation of faulty links during run time. Implemen...
145
click to vote
PODC
2009
ACM
16 years 6 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-...
159
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
184
click to vote
MOBIHOC
2007
ACM
16 years 5 months ago
2007
ACM
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...