Please use this identifier to cite or link to this item: https://hdl.handle.net/10316/91103
DC FieldValueLanguage
dc.contributor.authorGomes, Teresa-
dc.contributor.authorSantos, Dorabella-
dc.contributor.authorGirão-Silva, Rita-
dc.contributor.authorMartins, Lúcia-
dc.contributor.authorNedic, Boro-
dc.contributor.authorGunkel, Matthias-
dc.contributor.authorVass, Balázs-
dc.contributor.authorTapolcai, János-
dc.contributor.authorRak, Jacek-
dc.date.accessioned2020-09-24T08:46:18Z-
dc.date.available2020-09-24T08:46:18Z-
dc.date.issued2020-07-23-
dc.identifier.isbn978-3-030-44684-0pt
dc.identifier.urihttps://hdl.handle.net/10316/91103-
dc.description.abstractLarge scale natural disasters can have a profound effect on the telecommunication services in the affected geographical area. Hence, it is important to develop routing approaches that may help in circumventing damaged regional areas of a network. This prompted the development of geographically diverse routing schemes and also of disaster-risk aware routing schemes. A minimum-cost geodiverse routing, where a minimum geographical distance value D is imposed between any intermediate element of one path and any element of the other path is presented. Next the problem of the calculation of a D-geodiverse routing solution which ensures a certain level of availability is tackled. An algorithm is described that either obtains a solution to that problem or the most available path pair satisfying the desired geographical distance value D - this can be useful for the specification of availability levels in Service Level Agreements. Finally, a case study is presented, in an optical network, to determine the cost increase in terminal equipment (transponders) of approaches to ensure a much larger separation of the paths (of the selected path pair), with respect to minimal length link-disjoint routing.pt
dc.language.isoengpt
dc.publisherSpringer, Champt
dc.relationCENTRO-01-0145-FEDER-029312pt
dc.relationUIDB/00308/2020pt
dc.relationSFRH/BPD/111503/2015pt
dc.relationProjects no. 123957, 129589, 124171 and 128062 provided from the National Research, Development and Innovation Fund of Hungary, financed under the FK_17, KH_18, K_17 and K_18 funding schemes respectivelypt
dc.relationBME FIKP-MI/SCpt
dc.rightsembargoedAccesspt
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/pt
dc.titleDisaster-Resilient Routing Schemes for Regional Failurespt
dc.typebookPartpt
degois.publication.firstPage483pt
degois.publication.lastPage506pt
degois.publication.titleGuide to Disaster-Resilient Communication Networkspt
dc.relation.publisherversionhttps://link.springer.com/chapter/10.1007/978-3-030-44685-7_19pt
dc.peerreviewedyespt
dc.identifier.doi10.1007/978-3-030-44685-7_19pt
dc.date.embargo2022-07-23*
rcaap.embargofctEmbargo period as indicated by the publisherpt
uc.date.periodoEmbargo730pt
item.fulltextCom Texto completo-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypebookPart-
item.grantfulltextopen-
item.cerifentitytypePublications-
crisitem.author.researchunitINESC Coimbra – Institute for Systems Engineering and Computers at Coimbra-
crisitem.author.researchunitINESC Coimbra – Institute for Systems Engineering and Computers at Coimbra-
crisitem.author.researchunitINESC Coimbra – Institute for Systems Engineering and Computers at Coimbra-
crisitem.author.researchunitINESC Coimbra – Institute for Systems Engineering and Computers at Coimbra-
crisitem.author.orcid0000-0002-3084-5608-
crisitem.author.orcid0000-0003-0368-2222-
crisitem.author.orcid0000-0002-2331-8340-
crisitem.author.orcid0000-0002-6534-0159-
crisitem.author.orcid0000-0002-8589-7165-
crisitem.project.grantnoInstitute for Systems Engineering and Computers at Coimbra - INESC Coimbra-
Appears in Collections:FCTUC Eng.Electrotécnica - Livros e Capítulos de Livros
I&D INESCC - Livros e Capítulos de Livros
Files in This Item:
Show simple item record

Page view(s)

215
checked on Jul 16, 2024

Download(s)

98
checked on Jul 16, 2024

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons