581 search results - page 48 / 117 » Approximation algorithms for constructing wavelength routing... |
119
click to vote
WDAG
2007
Springer
15 years 7 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
133
click to vote
ISCAPDCS
2003
15 years 2 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
100
click to vote
INFOCOM
1997
IEEE
15 years 5 months ago
1997
IEEE
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
121
click to vote
CCGRID
2004
IEEE
15 years 5 months ago
2004
IEEE
We describe design and implementation of a "Gridenabled" message passing library, in the context of Phoenix message passing model. It supports (1) message routing betwee...
118
click to vote
MOBIHOC
2005
ACM
16 years 1 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...