• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Electrical and Electronics Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Electrical and Electronics Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      TSCP: a tabu search algorithm for wavelength converting node placement in WDM optical networks

      Thumbnail
      View / Download
      1.7 Mb
      Author
      Şengezer, Namık
      Karasan, Ezhan
      Date
      2005
      Source Title
      Proceedings of the Conference on Optical Network Design and Modeling, IEEE 2005
      Publisher
      IEEE
      Volume
      2005
      Pages
      359 - 369
      Language
      English
      Type
      Conference Paper
      Item Usage Stats
      129
      views
      267
      downloads
      Abstract
      Sparse wavelength conversion can increase the performance of all-optical wavelength division multiplexing (WDM) networks signi cantly by relaxing the wavelength continuity constraint. In this paper, we study the wavelength converter placement problem in multi- ber networks with static traf c demands. We present a tabu search based heuristic algorithm. The objective of the algorithm is to satisfy all the traf c demands with the minimum total cost of bers achieved in the full conversion case, by placing minimum number of wavelength converting nodes. We also implement a greedy algorithm and compare the performances of these converter placement algorithms with the optimum solutions on a sample network. The Tabu search based algorithm achieves the optimum solution in 72% of the test cases and it increases the average number of wavelength converting nodes by less than 10% with respect to the optimum solution. The effect of the utilized routing scheme on the generated solutions and the correlation between the converter node locations and the amount of traf c passing through the nodes are also investigated.
      Keywords
      Greedy algorithms
      Optical networks
      Wavelength converters
      Algorithms
      Constraint theory
      Heuristic methods
      Optical communication
      Problem solving
      Telecommunication traffic
      Wavelength division multiplexing
      Permalink
      http://hdl.handle.net/11693/27326
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/ONDM.2005.1427018
      Collections
      • Department of Electrical and Electronics Engineering 3524
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy