• DocumentCode
    1400192
  • Title

    Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study

  • Author

    Banerjee, Dhritiman ; Mukherjee, Biswanath

  • Author_Institution
    Lucent Technol. Bell Labs., Holmdel, NJ, USA
  • Volume
    8
  • Issue
    5
  • fYear
    2000
  • fDate
    10/1/2000 12:00:00 AM
  • Firstpage
    598
  • Lastpage
    607
  • Abstract
    We present algorithms for the design of optimal virtual topologies embedded on wide-area wavelength-routed optical networks. The physical network architecture employs wavelength-conversion-enabled wavelength-routing switches (WRS) at the routing nodes, which allow the establishment of circuit-switched all-optical wavelength-division multiplexed (WDM) channels, called lightpaths. We assume packet-based traffic in the network, such that a packet travelling from its source to its destination may have to multihop through one or more such lightpaths. We present an exact integer linear programming (ILP) formulation for the complete virtual topology design, including choice of the constituent lightpaths, routes for these lightpaths, and intensity of packet flows through these lightpaths. By minimizing the average packet hop distance in our objective function and by relaxing the wavelength-continuity constraints, we demonstrate that the entire optical network design problem can be considerably simplified and made computationally tractable. Although an ILP may take an exponential amount of time to obtain an exact optimal solution, we demonstrate that terminating the optimization within the first few iterations of the branch-and-bound method provides high-quality solutions. We ran experiments using the CPLEX optimization package on the NSFNET topology, a subset of the PACBELL network topology, as well as a third random topology to substantiate this conjecture. Minimizing the average packet hop distance is equivalent to maximizing the total network throughput under balanced flows through the lightpaths. The problem formulation can be used to design a balanced network, such that the utilizations of both transceivers and wavelengths in the network are maximized, thus reducing the cost of the network equipment. We analyze the trade-offs in budgeting of resources (transceivers and switch sizes) in the optical network, and demonstrate how an improperly designed network may have low utilization of any one of these resources. We also use the problem formulation to provide a reconfiguration methodology in order to adapt the virtual topology to changing traffic conditions
  • Keywords
    circuit switching; integer programming; iterative methods; linear programming; network topology; optical fibre networks; packet switching; telecommunication network routing; wavelength division multiplexing; CPLEX optimization package; PACBELL network; WDM channels; average packet hop distance; balanced flows; balanced network; branch-and-bound method; circuit-switched all-optical wavelength-division multiplexed channels; design; integer linear programming; intensity; iterations; lightpaths; linear formulation; optical network; optimal virtual topologies; optimization; packet-based traffic; physical network architecture; reconfiguration; reconfiguration methodology; resource budgeting tradeoffs; routing nodes; third random topology; traffic conditions; virtual topology; virtual topology design; wavelength-continuity constraints; wavelength-conversion-enabled wavelength-routing switches; wavelength-routed optical networks; wide-area wavelength-routed optical networks; Algorithm design and analysis; Circuit topology; Network topology; Optical design; Optical fiber networks; Optical switches; Switching circuits; Telecommunication traffic; Transceivers; Wavelength division multiplexing;
  • fLanguage
    English
  • Journal_Title
    Networking, IEEE/ACM Transactions on
  • Publisher
    ieee
  • ISSN
    1063-6692
  • Type

    jour

  • DOI
    10.1109/90.879346
  • Filename
    879346