An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks
Autor(a) principal: | |
---|---|
Data de Publicação: | 2015 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10316/44523 https://doi.org/10.1007/s11235-015-0066-x |
Resumo: | The construction of overlay or broadcast networks, based on spanning trees, over WDM optical networks with SRLG information, has important applications in telecommunications. In this paper we propose a bicriteria optimization model for calculating communication spanning trees over WDM networks the objectives of which are the minimization of the total number of different SRLGs of the tree links (seeking to maximise reliability) and the minimization of the total bandwidth usage cost. An exact algorithm for generating the whole set of non-dominated solutions and methods for selecting a final solution in various decision environments are put forward. An extensive experimental study on the application of the model, including two sets of experiments based on reference transport network topologies, with random link bandwidth occupations and with random SRLG assignments to the links, is also presented, together with a discussion on potential advantages of the model. |
id |
RCAP_9f8e66cc519365e0c5128c95332f7f76 |
---|---|
oai_identifier_str |
oai:estudogeral.uc.pt:10316/44523 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networksThe construction of overlay or broadcast networks, based on spanning trees, over WDM optical networks with SRLG information, has important applications in telecommunications. In this paper we propose a bicriteria optimization model for calculating communication spanning trees over WDM networks the objectives of which are the minimization of the total number of different SRLGs of the tree links (seeking to maximise reliability) and the minimization of the total bandwidth usage cost. An exact algorithm for generating the whole set of non-dominated solutions and methods for selecting a final solution in various decision environments are put forward. An extensive experimental study on the application of the model, including two sets of experiments based on reference transport network topologies, with random link bandwidth occupations and with random SRLG assignments to the links, is also presented, together with a discussion on potential advantages of the model.Springer2015info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/44523http://hdl.handle.net/10316/44523https://doi.org/10.1007/s11235-015-0066-xhttps://doi.org/10.1007/s11235-015-0066-xenghttps://doi.org/10.1007/s11235-015-0066-xCraveirinha, José M. F.Clímaco, João C. N.Martins, Lúcia M. R. A.Pascoal, Martainfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2021-06-29T10:02:55Zoai:estudogeral.uc.pt:10316/44523Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:00:48.575048Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks |
title |
An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks |
spellingShingle |
An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks Craveirinha, José M. F. |
title_short |
An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks |
title_full |
An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks |
title_fullStr |
An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks |
title_full_unstemmed |
An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks |
title_sort |
An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks |
author |
Craveirinha, José M. F. |
author_facet |
Craveirinha, José M. F. Clímaco, João C. N. Martins, Lúcia M. R. A. Pascoal, Marta |
author_role |
author |
author2 |
Clímaco, João C. N. Martins, Lúcia M. R. A. Pascoal, Marta |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Craveirinha, José M. F. Clímaco, João C. N. Martins, Lúcia M. R. A. Pascoal, Marta |
description |
The construction of overlay or broadcast networks, based on spanning trees, over WDM optical networks with SRLG information, has important applications in telecommunications. In this paper we propose a bicriteria optimization model for calculating communication spanning trees over WDM networks the objectives of which are the minimization of the total number of different SRLGs of the tree links (seeking to maximise reliability) and the minimization of the total bandwidth usage cost. An exact algorithm for generating the whole set of non-dominated solutions and methods for selecting a final solution in various decision environments are put forward. An extensive experimental study on the application of the model, including two sets of experiments based on reference transport network topologies, with random link bandwidth occupations and with random SRLG assignments to the links, is also presented, together with a discussion on potential advantages of the model. |
publishDate |
2015 |
dc.date.none.fl_str_mv |
2015 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10316/44523 http://hdl.handle.net/10316/44523 https://doi.org/10.1007/s11235-015-0066-x https://doi.org/10.1007/s11235-015-0066-x |
url |
http://hdl.handle.net/10316/44523 https://doi.org/10.1007/s11235-015-0066-x |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://doi.org/10.1007/s11235-015-0066-x |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.publisher.none.fl_str_mv |
Springer |
publisher.none.fl_str_mv |
Springer |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799133898435723264 |