Reconfigurable Path Restoration Schemes for MPLS Networks
Autor(a) principal: | |
---|---|
Data de Publicação: | 2009 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | INFOCOMP: Jornal de Ciência da Computação |
Texto Completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/258 |
Resumo: | Multi-Protocol Label Switching (MPLS) is an alternative to integrate the traditional Internet Protocol (IP) routing and switching technologies because it provides end-to-end Quality of Service (QoS), guarantees Traffic Engineering, and support Virtual Private Networks (VPNs). However, MPLS must use path restoration schemes to guarantee the delivery of packets through a network. In this paper we present three reconfigurable architectures for the implementation of path restoration schemes, namely, Haskin, Makam, and Simple Dynamic. These schemes are implemented using an entity-based model that provides the advantage of reusability of entities, thus reducing the overall resource utilisation. The results show that Haskin and Makam schemes present similar resource utilisation. On the other hand, the simple dynamic scheme uses a similar entity-based model that provides a slight decrease in percentage utilisation when compared to those obtained for the two aforementioned schemes. |
id |
UFLA-5_5a580d0d65e61e432f64891009696d5c |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/258 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
Reconfigurable Path Restoration Schemes for MPLS NetworksMPLSReconfigurable SystemsMakamHaskinSimple DynamicPath RestorationMulti-Protocol Label Switching (MPLS) is an alternative to integrate the traditional Internet Protocol (IP) routing and switching technologies because it provides end-to-end Quality of Service (QoS), guarantees Traffic Engineering, and support Virtual Private Networks (VPNs). However, MPLS must use path restoration schemes to guarantee the delivery of packets through a network. In this paper we present three reconfigurable architectures for the implementation of path restoration schemes, namely, Haskin, Makam, and Simple Dynamic. These schemes are implemented using an entity-based model that provides the advantage of reusability of entities, thus reducing the overall resource utilisation. The results show that Haskin and Makam schemes present similar resource utilisation. On the other hand, the simple dynamic scheme uses a similar entity-based model that provides a slight decrease in percentage utilisation when compared to those obtained for the two aforementioned schemes.Editora da UFLA2009-06-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/258INFOCOMP Journal of Computer Science; Vol. 8 No. 2 (2009): June, 2009; 29-381982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/258/243Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessMinero-Muñoz, MarcelinoAlarcon-Aquino, Vicente2015-07-22T17:37:45Zoai:infocomp.dcc.ufla.br:article/258Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:27.920556INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
Reconfigurable Path Restoration Schemes for MPLS Networks |
title |
Reconfigurable Path Restoration Schemes for MPLS Networks |
spellingShingle |
Reconfigurable Path Restoration Schemes for MPLS Networks Minero-Muñoz, Marcelino MPLS Reconfigurable Systems Makam Haskin Simple Dynamic Path Restoration |
title_short |
Reconfigurable Path Restoration Schemes for MPLS Networks |
title_full |
Reconfigurable Path Restoration Schemes for MPLS Networks |
title_fullStr |
Reconfigurable Path Restoration Schemes for MPLS Networks |
title_full_unstemmed |
Reconfigurable Path Restoration Schemes for MPLS Networks |
title_sort |
Reconfigurable Path Restoration Schemes for MPLS Networks |
author |
Minero-Muñoz, Marcelino |
author_facet |
Minero-Muñoz, Marcelino Alarcon-Aquino, Vicente |
author_role |
author |
author2 |
Alarcon-Aquino, Vicente |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Minero-Muñoz, Marcelino Alarcon-Aquino, Vicente |
dc.subject.por.fl_str_mv |
MPLS Reconfigurable Systems Makam Haskin Simple Dynamic Path Restoration |
topic |
MPLS Reconfigurable Systems Makam Haskin Simple Dynamic Path Restoration |
description |
Multi-Protocol Label Switching (MPLS) is an alternative to integrate the traditional Internet Protocol (IP) routing and switching technologies because it provides end-to-end Quality of Service (QoS), guarantees Traffic Engineering, and support Virtual Private Networks (VPNs). However, MPLS must use path restoration schemes to guarantee the delivery of packets through a network. In this paper we present three reconfigurable architectures for the implementation of path restoration schemes, namely, Haskin, Makam, and Simple Dynamic. These schemes are implemented using an entity-based model that provides the advantage of reusability of entities, thus reducing the overall resource utilisation. The results show that Haskin and Makam schemes present similar resource utilisation. On the other hand, the simple dynamic scheme uses a similar entity-based model that provides a slight decrease in percentage utilisation when compared to those obtained for the two aforementioned schemes. |
publishDate |
2009 |
dc.date.none.fl_str_mv |
2009-06-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/258 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/258 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/258/243 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Editora da UFLA |
publisher.none.fl_str_mv |
Editora da UFLA |
dc.source.none.fl_str_mv |
INFOCOMP Journal of Computer Science; Vol. 8 No. 2 (2009): June, 2009; 29-38 1982-3363 1807-4545 reponame:INFOCOMP: Jornal de Ciência da Computação instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
INFOCOMP: Jornal de Ciência da Computação |
collection |
INFOCOMP: Jornal de Ciência da Computação |
repository.name.fl_str_mv |
INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
infocomp@dcc.ufla.br||apfreire@dcc.ufla.br |
_version_ |
1799874740878311424 |