Reconfigurable path restoration schemes for MPLS networks

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.

[1]  Sha Li.  System architecture and hardware implementations for a reconfigurable MPLS router , 2003 .

[2]  H. Jonathan Chao,et al.  Multiprotocol Label Switching , 2002 .

[3]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[4]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[5]  R. Karri,et al.  A hardware-accelerated implementation of a signaling protocol , 2002 .

[6]  Daniel A. Ashlock,et al.  Simultaneous Evolution of Bracketed L-system Rules and Interpretation , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[7]  Dan Ionescu,et al.  A hardware implementation of layer 2 MPLS , 2006, Third IEEE International Workshop on Electronic Design, Test and Applications (DELTA'06).

[8]  Ian H. Witten,et al.  Identifying Hierarchical Structure in Sequences: A linear-time algorithm , 1997, J. Artif. Intell. Res..

[9]  Tao Li,et al.  A hardware-accelerated implementation of the RSVP-TE signaling protocol , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[10]  Uyless D. Black.  MPLS and Label Switching Networks , 2000 .

[11]  Johan Martin Olof Petersson,et al.  MPLS based recovery mechanisms , 2005 .

[12]  V Alarcon-Aquino,et al.  A CCIE ’ s Introduction to MPLS Networks , 2006 .

[13]  Z. Toth,et al.  Evolving artificial trees described by parametric L-systems , 1999, Engineering Solutions for the Next Millennium. 1999 IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.99TH8411).

[14]  Malathi Veeraraghavan,et al.  Specification of a Subset of CR-LDP for Hardware Implementation , 2002 .

[15]  Christian Jacob,et al.  Genetic L-System Programming: Breeding and Evolving Artificial Flowers with Mathematica , 1995 .

[16]  G. Ahn,et al.  Simulator for MPLS path restoration and performance evaluation , 2001, Joint 4th IEEE International Conference on ATM(ICATM'01) and High Speed Intelligent Internet Symposium. ICATM 2001 (Cat. No.00EX486).

[17]  Francisco Rodríguez-Henríquez,et al.  Cryptographic Algorithms on Reconfigurable Hardware , 2010 .

[18]  Ramya Devi Sundaram,et al.  Multiprotocol Label Switching , 2003 .

[19]  A. Lindenmayer,et al.  Inference algorithms for developmental systems with cell lineages , 1987 .

[20]  Dan Ionescu,et al.  Embedded MPLS architecture , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[21]  Colin de la Higuera,et al.  A bibliographical study of grammatical inference , 2005, Pattern Recognit..

[22]  Anjali Agarwal,et al.  A novel path protection scheme for MPLS networks using multi-path routing , 2009, Comput. Networks.

[23]  Harold Abelson,et al.  Turtle geometry : the computer as a medium for exploring mathematics , 1983 .

[24]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[25]  Vicente Alarcón Aquino,et al.  A Hierarchical Approach for Modelling an MPLS Network Using VHDL , 2006, 16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06).

[26]  Takashi Yokomori.  Inductive Inference of 0L Languages , 1992 .

[27]  Gabor T. Herman,et al.  Algorithms for Producing Grammars from Sample Derivations: A Common Problem of Formal Language Theory and Developmental Biology , 1973, J. Comput. Syst. Sci..

[28]  Ramki Krishnan,et al.  A Method for Setting an Alternative Label Switched Paths to Handle Fast Reroute , 2000 .

[29]  Ramesh Karri,et al.  Hardware implementation of a signaling protocol , 2002, SPIE ITCom.

[30]  Vicente Alarcon-Aquino,et al.  MPLS/IP analysis and simulation for the implementation of path restoration schemes , 2004 .

[31]  Lemma Hundessa Gonfa,et al.  Enhanced Fast Rerouting Mechanisms for Protected Traffic in MPLS Networks , 2003 .

[32]  Mogens Nielsen,et al.  On the Decidability of Some Equivalence Problems for D0L-Systems , 1973, Inf. Control..

[33]  Craig G. Nevill-Manning,et al.  Inferring Sequential Structure , 1996 .

[34]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.