145 search results - page 7 / 29 » Weak State Routing for Large-Scale Dynamic Networks |
BROADNETS
2007
IEEE
15 years 4 months ago
2007
IEEE
Fast convergence to topology changes is a key requirement in modern routing infrastructure while reducing the protocol CPU overhead continues to be as important as before. In this...
EUC
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we propose an ant-based algorithm for dynamic routing and wavelength assignment (RWA) in WDM optical networks under the wavelength continuity constraint. By adopting...
101
click to vote
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
SIAMAM
2010
14 years 8 months ago
2010
This paper concerns the dynamical behavior of weakly reversible, deterministically modeled population processes near the facets (codimension-one faces) of their invariant manifolds...
INFOCOM
1999
IEEE
15 years 1 months ago
1999
IEEE
Abstract--CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infr...