Green lightpath provisioning in transparent WDM networks: Pros and cons
2010 (English)In: IEEE 4th International Symposium on Advanced Networks and Telecommunication Systems (ANTS), 2010, IEEE , 2010, 10-12 p.Conference paper (Other academic)
Despite their intrinsic power efficiency, transparent wavelength division multiplexing (WDM) networks have additional potentials to save energy, and have attracted the interest of researchers with many power-aware (PA) routing and wavelength assignment (RWA) solutions being proposed in the literature. These approaches seem to have, however, an adverse effect on network blocking probability performance. This paper aims at providing a different insight to the PA-RWA problem. The idea is based on the intuition that power minimization and resource blocking can be jointly treated. The proposed approach, called Weighted Power-Aware RWA (WPA-RWA), has been tested using a continental core network and the performance evaluation confirms the presence of a trade-off between power saving and blocking probability.
Place, publisher, year, edition, pages
IEEE , 2010. 10-12 p.
WPA-RWA problem;energy saving;green lightpath;intrinsic power efficiency;network blocking probability performance;power minimization;resource blocking;transparent WDM networks;transparent wavelength division multiplexing networks;weighted power-aware RWA;energy conservation;probability;telecommunication network routing;wavelength assignment;wavelength division multiplexing;
IdentifiersURN: urn:nbn:se:kth:diva-62487DOI: 10.1109/ANTS.2010.5983512ISI: 000330309200004ScopusID: 2-s2.0-80052841088OAI: oai:DiVA.org:kth-62487DiVA: diva2:480420
IEEE 4th International Symposium on Advanced Networks and Telecommunication Systems (ANTS), 2010
© 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 201202022012-02-022012-01-192016-05-16Bibliographically approved