Abstract
Recent advances in wavelength-division multiplexing (WDM) technology will provide bandwidth intensive multicast applications with large transmit capacities. This article provides two new grooming schemes that lead to efficient resource utilization in WDM networks. They are called Light-Tree Division-Destination Branch Node-based Grooming scheme (LTD-DBNG) and Light-Tree Division- Adjacent Node Component-based Grooming scheme (LTD- ANCG). These schemes are based on the idea of dividing a light-tree into smaller sub-light-trees. They improve the efficiency of resource utilization and also lower the optical-electronic-optical conversion overhead. We use computer simulations to evaluate the performance of these schemes. Our simulations demonstrate that compared with existing algorithms, these schemes significantly reduce the request blocking probability (BP) but can be implemented with very reasonable electronic processing, with LTD-ANCG performing better than LTD-DBNG but with greater complexity. We also evaluate the BP of these schemes considering variations in the add/drop ratioand demonstrate that aproperchoice of this ratio will provide target BP with low network costs. © Springer Science+Business Media, LLC 2010.
| Original language | English |
|---|---|
| Pages (from-to) | 151-164 |
| Journal | Photonic Network Communications |
| Volume | 20 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Oct 2010 |
Research Keywords
- Light-Tree
- Lightpath
- Multicast
- Traffic grooming
- Wavelength-division multiplexing (WDM)
Publisher's Copyright Statement
- COPYRIGHT TERMS OF DEPOSITED POSTPRINT FILE: This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.org/10.1007/s11107-010-0255-1.