RI UFLA (Universidade Federal de Lavras) >
Revistas UFLA >
Please use this identifier to cite or link to this item:
|Title: ||Reconfigurable path restoration schemes for MPLS networks|
|???metadata.dc.creator???: ||Minero-Muñoz, Marcelino|
Restauração de caminho
|Publisher: ||Editora da UFLA|
|Citation: ||MINERO-MUÑOZ, M.; ALARCON-AQUINO, V. Reconfigurable path restoration schemes for MPLS networks. INFOCOMP: Journal of Computer Science, Lavras, v. 8, n. 2, p. 29-38, June 2009.|
|Abstract: ||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.|
|Other Identifiers: ||http://www.dcc.ufla.br/infocomp/index.php/INFOCOMP/article/view/258|
|Appears in Collections:||Infocomp|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.