Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/44523
Title: An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks
Authors: Craveirinha, José M. F. 
Clímaco, João C. N. 
Martins, Lúcia M. R. A. 
Pascoal, Marta 
Issue Date: 2015
Publisher: Springer
Serial title, monograph or event: Telecommunication Systems
Volume: 62
Issue: 2
Abstract: 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.
URI: http://hdl.handle.net/10316/44523
DOI: 10.1007/s11235-015-0066-x
10.1007/s11235-015-0066-x
Rights: embargoedAccess
Appears in Collections:FCTUC Matemática - Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat
2016CraveirinhaEtAl.pdf790.63 kBAdobe PDFView/Open
Show full item record

SCOPUSTM   
Citations

1
checked on Feb 18, 2020

WEB OF SCIENCETM
Citations 10

1
checked on Oct 2, 2021

Page view(s) 50

452
checked on Oct 21, 2021

Download(s)

202
checked on Oct 21, 2021

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.