Pregled bibliografske jedinice broj: 391735
WDM Optical Networks Planning using Greedy Algorithms
WDM Optical Networks Planning using Greedy Algorithms // Greedy Algorithms / Bednorz, Witold (ur.).
Beč: IntechOpen, 2008. str. 569-586
CROSBI ID: 391735 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
WDM Optical Networks Planning using Greedy Algorithms
Autori
Skorin-Kapov, Nina
Vrsta, podvrsta i kategorija rada
Poglavlja u knjigama, znanstveni
Knjiga
Greedy Algorithms
Urednik/ci
Bednorz, Witold
Izdavač
IntechOpen
Grad
Beč
Godina
2008
Raspon stranica
569-586
ISBN
978-953-7619-27-5
Ključne riječi
no key words
Sažetak
In this chapter, we investigate various problems in WDM transparent optical networks planning and propose efficient greedy heuristics to help solve them sub-optimally. First we tackle the Routing and Wavelength Assignment of static lightpath demands by proposing greedy algorithms based on bin packing with the objectives to minimize the number of wavelengths used and the physical lengths of the established lightpaths. Next, we consider scheduled lightpath demands, also with the objective to minimize wavelengths and show how the proposed greedy algorithms can outperform an efficient tabu search algorithm for many cases tested. Finally, we investigate the problem of Virtual Topology Design for a static traffic matrix considering various objective criteria and proposing greedy algorithms, each aimed to primarily optimize a different criterion.
Izvorni jezik
Engleski
