Learn More
The problem of minimizing the number of optical nodes with signal regeneration capability can be constrained to guarantee a desired degree of end-to-end connectivity in the all-optical transport network. The problem can be formulated using a k-connected, k-dominating node set, which is a known approach in mobile ad hoc wireless networks. This paper presents(More)
– We propose an iterative algorithm for the Virtual Topology Design (VTD) in optical networks. The algorithm eliminates lighter traffic lightpaths and rearrange the traffic through the remaining lightpaths. This tries to preserve the open capacity for the accommodation of future unknown demands. The results suggest that it is feasible to preserve enough(More)
– We propose an iterative algorithm for the Virtual Topology Design (VTD) in optical networks. The algorithm eliminates lighter traffic lightpaths and rearranges the traffic through the remaining lightpaths. This tries to preserve the open capacity for the accommodation of future unknown demands. The results suggest that it is feasible to preserve enough(More)
We propose a linear formulation for traffic routing in optical networks after the Virtual Topology Design (VTD). The formulation maximizes the amount of traffic the network is able to accept, through minimizing the residual capacity in established lightpaths. The results suggest that it is feasible to preserve enough open capacity to avoid disruption of(More)
  • 1