Reconfigurable Path Restoration Schemes for MPLS Networks

• Autor(a) principal: Minero-Muñoz, Marcelino
• Data de Publicação: 2009
• Outros Autores: Alarcon-Aquino, Vicente
• 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
• topic: MPLS; Reconfigurable Systems; Makam; Haskin; Simple Dynamic; Path Restoration

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.