About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
1st International ICST Workshop on Microwaves and Photonics in Access Networks

Research Article

Existing-lightpath-aware Zone-based Approach for Efficient and Scalable Dynamic Traffic Grooming in Large Optical WDM Mesh Networks

Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1109/ACCESSNETS.2007.4447144,
        author={Quang-Dung Ho and Tho Le-Ngoc and Man-Seop Lee},
        title={Existing-lightpath-aware Zone-based Approach for Efficient and Scalable Dynamic Traffic Grooming in Large Optical WDM Mesh Networks},
        proceedings={1st International ICST Workshop on Microwaves and Photonics in Access Networks},
        publisher={IEEE},
        proceedings_a={MICPAN},
        year={2008},
        month={2},
        keywords={Availability  Computational modeling  Heuristic algorithms  Mathematical model  Mesh networks  Optical fiber networks  Spread spectrum communication  Telecommunication traffic  WDM networks  Wavelength division multiplexing},
        doi={10.1109/ACCESSNETS.2007.4447144}
    }
    
  • Quang-Dung Ho
    Tho Le-Ngoc
    Man-Seop Lee
    Year: 2008
    Existing-lightpath-aware Zone-based Approach for Efficient and Scalable Dynamic Traffic Grooming in Large Optical WDM Mesh Networks
    MICPAN
    IEEE
    DOI: 10.1109/ACCESSNETS.2007.4447144
Quang-Dung Ho1, Tho Le-Ngoc1, Man-Seop Lee2
  • 1: Department of Electrical and Computer Engineering McGill University, 3480 University Street Montreal, Quebec, H3A 2A7, Canada
  • 2: Optical Internet Research CenterInformation and Communications University, 119, Munjiro, Yuseong-gu, Daejeon, 305-714, Korea

Abstract

This paper proposes an efficient and scalable dynamic traffic grooming algorithm suitable for large WDM mesh networks by limiting the zone where lightpaths for new connection requests are searched. Besides, in order to maintain the multi-hop grooming flexibility, the searching zone can be dynamically enlarged according to the availability of groomable existing or new lightpaths and the physical connectivity between network nodes. We develop a mathematical model to estimate the possibility that a node connects the source and destination when included to enlarge the searching zone, and to ensure that the selected lightpath is resource-efficient. Simulation results demonstrate that the proposed algorithm can significantly reduce the computations and improve the blocking performance.

Keywords
Availability Computational modeling Heuristic algorithms Mathematical model Mesh networks Optical fiber networks Spread spectrum communication Telecommunication traffic WDM networks Wavelength division multiplexing
Published
2008-02-07
Publisher
IEEE
Modified
2011-07-10
http://dx.doi.org/10.1109/ACCESSNETS.2007.4447144
Copyright © 2007–2025 IEEE
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL