Rerouting requests in WDM networks
Abstract
We model a problem related to routing reconfiguration in WDM networks. We establish some similarities and differ- ences with two other known problems: the pathwidth and the pursuit problem. We then present a distributed linear-time algorithm to solve the problem on trees. Last we give the solutions for some classes of graphs, in particular complete d -ary trees and grids.
Origin : Files produced by the author(s)
Loading...