• DocumentCode
    1717469
  • Title

    A Transceiver Saving Auxiliary Graph Model for Dynamic Traffic Grooming in WDM Mesh Networks

  • Author

    Yao, Huaxiong ; Yang, Zongkai ; Ou, Liang ; Tan, Xiansi

  • Author_Institution
    Dept. of Electron. & Inf., Huazhong Univ. of Sci. & Technol., Wuhan
  • fYear
    2006
  • Firstpage
    319
  • Lastpage
    326
  • Abstract
    This paper addresses the dynamic traffic grooming problem in wavelength-division-multiplexed (WDM) mesh optical networks subject to wavelength constraint and transceiver constraint. As an improvement over the existing link bundled auxiliary graph (LBAG) model which thinks all traffic streams must go though the grooming fabric before entering the wavelength switch fabric, we introduce a transceiver saving auxiliary graph (TSAG) model and propose the TSAG method. In the TSAG model, we can determine whether a traffic stream should consume grooming ports or not. Various grooming policies are achieved by assigning the weight value of different edges in the auxiliary graph and their blocking performance are compared through simulations. Results show that the TSAG model has a lower blocking probability than LBAG while consuming the less running time, and TSAG can reduce the number of transceivers utilized while improving the wavelength utilization
  • Keywords
    graph theory; telecommunication traffic; transceivers; wavelength division multiplexing; WDM mesh optical network; dynamic traffic grooming; link bundled auxiliary graph model; transceiver constraint; transceiver saving auxiliary graph; wavelength constraint; wavelength division multiplexing; Bandwidth; Mesh networks; Network topology; Optical fiber networks; Optical wavelength conversion; Telecommunication traffic; Traffic control; Transceivers; WDM networks; Wavelength division multiplexing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Local Computer Networks, Proceedings 2006 31st IEEE Conference on
  • Conference_Location
    Tampa, FL
  • ISSN
    0742-1303
  • Print_ISBN
    1-4244-0418-5
  • Electronic_ISBN
    0742-1303
  • Type

    conf

  • DOI
    10.1109/LCN.2006.322115
  • Filename
    4116566