99 search results - page 20 / 20 » Comparison of Routing and Wavelength Assignment Algorithms i... |
JCM
2007
13 years 4 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— There has been a significant amount of recent research on routing and wavelength assignment for DWDM networks suffering from physical layer transmission impairments. These alg...
INFOCOM
1997
IEEE
13 years 8 months ago
1997
IEEE
—This paper studies the capacity and flow assignment problem arising in the design of self-healing asynchronous transfer mode (ATM) networks using the virtual path concept. The ...