Restoration in multi-domain GMPLS-based networks
dc.contributor.author
dc.date.accessioned
2016-02-23T15:26:09Z
dc.date.available
2016-02-23T15:26:09Z
dc.date.issued
2011-08-02
dc.identifier.issn
0140-3664
dc.identifier.uri
dc.description.abstract
In this paper, we evaluate the efficiency of using restoration mechanisms in a dynamic multi-domain GMPLS network. Major challenges and solutions are introduced and two well-known restoration schemes (End-to-End and Local-to-End) are evaluated. Additionally, new restoration mechanisms are introduced: one based on the position of a failed link, called Location-Based, and another based on minimizing the additional resources consumed during restoration, called Shortest-New. A complete set of simulations in different network scenarios show where each mechanism is more efficient in terms, such as, resource overbuild or recovery delay
dc.description.sponsorship
Part of this work was supported by the Government of Catalonia (DURSI SGR-1202), and by the Spanish Science and Innovation Ministry (TRION TEC2009-10724)
dc.format.mimetype
application/pdf
dc.language.iso
eng
dc.publisher
Elsevier
dc.relation
info:eu-repo/grantAgreement/MICINN//TEC2009-10724/ES/Red Overlay Fiable Y Transparente Entre Dominios/
dc.relation.isformatof
Versió preprint del document publicat a: http://dx.doi.org/10.1016/j.comcom.2010.04.034
dc.relation.ispartof
© Computer Communications, 2011, vol. 34, núm. 12, p. 1450-1459
dc.relation.ispartofseries
Articles publicats (D-ATC)
dc.rights
Tots els drets reservats
dc.subject
dc.title
Restoration in multi-domain GMPLS-based networks
dc.type
info:eu-repo/semantics/article
dc.rights.accessRights
info:eu-repo/semantics/openAccess
dc.embargo.terms
Cap
dc.type.version
info:eu-repo/semantics/submittedVersion
dc.identifier.doi
dc.identifier.idgrec
014457
dc.contributor.funder
dc.type.peerreviewed
peer-reviewed
dc.relation.ProjectAcronym
dc.identifier.eissn
1873-703X