1st Annual Conference on Broadband Networks

Research Article

Efficient online traffic grooming algorithms in WDM mesh networks with drop-and-continue node architecture

  • @INPROCEEDINGS{10.1109/BROADNETS.2004.37,
        author={Farid Farahmand and Xiaodong Huang and Jason P. Jue},
        title={Efficient online traffic grooming algorithms in WDM mesh networks with drop-and-continue node architecture},
        proceedings={1st Annual Conference on Broadband Networks},
        publisher={IEEE},
        proceedings_a={BROADNETS},
        year={2004},
        month={12},
        keywords={Lightpath  WDM mesh networks  optimization algorithms  traffic grooming},
        doi={10.1109/BROADNETS.2004.37}
    }
    
  • Farid Farahmand
    Xiaodong Huang
    Jason P. Jue
    Year: 2004
    Efficient online traffic grooming algorithms in WDM mesh networks with drop-and-continue node architecture
    BROADNETS
    IEEE
    DOI: 10.1109/BROADNETS.2004.37
Farid Farahmand1,*, Xiaodong Huang2,*, Jason P. Jue2,*
  • 1: Department of Electrical Engineering, The University of Texas at Dallas, Richardson, Texas 75083
  • 2: Department of Computer Science, The University of Texas at Dallas, Richardson, Texas 75083
*Contact email: ffarid@utdallas.edu, xxh020100@utdallas.edu, jjue@utdallas.edu

Abstract

As high capacity all-optical networks and WDM technologies advance and merge together, aggregating low-speed traffic streams onto high-speed wavelengths becomes more critical. Efficient aggregation techniques, known as traffic grooming, allow higher bandwidth utilization and can reduce request blocking probability. These algorithms can also result in lower network cost in terms of electronic switching. In this paper we focus on traffic grooming in WDM mesh networks with dynamic traffic patterns. We offer two new grooming concepts called lightpath dropping and lightpath extension. These concepts are based on an alternative node architecture in which incoming optical signals can be dropped at a node, while optically continuing to the next node. Based on these concepts, we develop several grooming algorithms and study them under various network objectives. We also compare their performance with previously proposed lightpath-based grooming algorithms. Through extensive simulation results we show that our proposed approaches lead to lower request blocking probability and lower average number of logical hops when the number of transceivers per node is limited.