By Topic

Algorithms for Intermediate Waveband Switching in Optical WDM Mesh Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Todimala, A. ; Univ. of Maryland, College Park ; Ramamurthy, B.

Waveband switching is a technique that allows multiple wavelengths to be switched together as a single unit. Waveband switching technique has been proven to reduce the switch sizes considerably in large networks. Aggregation of wavelengths into wavebands and dis-aggregation of wavebands back to wavelengths can be done at end-nodes or intermediate-nodes. Most of the research on waveband switching has considered source-to-end switching. In intermediate waveband switching, aggregation and/or dis-aggregation can be done at an intermediate node. In the context of intermediate waveband switching, the problem of grooming wavelengths such that the number of ports saved is maximized is non-trivial. Recent research which considered intermediate waveband switching focused on routing and wavelength assignment problem such that the port saving is maximized. In this work we focus on the problem of intermediate waveband switching considering static traffic and assuming that routing and wavelength assignment is known. We define two intermediate waveband grooming polices, intermediate-to-destination waveband switching (ITD-WBS) and both-end-to-intermediate waveband switching (BETI-WBS), depending on where along the path aggregation/disaggregation of wavebands is done. We present greedy algorithms to compute wavebands for the two intermediate waveband grooming polices and analyze their computational complexities.

Published in:

High-Speed Networks Workshop, 2007

Date of Conference:

11-11 May 2007