306 search results - page 2 / 62 » Routing Algorithms for Anycast Messages |
86
Voted
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
153
click to vote
ICC
2011
IEEE
13 years 9 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
ICNS
2006
IEEE
15 years 3 months ago
2006
IEEE
— In this paper we consider implementing optical burst switching as a technology for building Grids with computationally intensive requirements. This architecture has been referr...
BROADNETS
2006
IEEE
15 years 3 months ago
2006
IEEE
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
NETWORKING
2007
14 years 11 months ago
2007
We propose a novel routing framework called PWave that supports multi-source multi-sink anycast routing for wireless sensor networks. A distributed and scalable potential field es...