NODE AND LINK FAILURE RECOVERY ALGORITHM FOR A MULTICAST MULTIPROTOCOL LABEL SWITCHING (MPLS) NETWORK

Abstract

There is a huge growth in the use of Internet across the globe in the last decade, and novel realtime
connection-oriented services like streaming technologies and time critical transactionoriented
services are in use and new ones are currently emerging. Researches on more reliable
network becomes inevitable so as to sustainable users’ confidence. This paper explores fault
recovery based on Multi-Protocol Label Switching (MPLS) on links and nodes connectivity. It
discusses the mechanism of using MPLS to enable high scalability, end-to-end connectivity in
routed networks. It examines efficiency of Multicast MPLS network transmission of datagrams
to a group of zero or more hosts on a single destination group address. The research investigated
the failures on nodes and links with and without the proposed new recovery mechanism called
Multi-protocol Label Switch Recovery (MPLSR) and employed simulation in Java programming
language in a Multicast MPLS network as an effective tool that can improve and guarantee
intrusion-free network. MPLSR was compared with Hybrid Link Quality Estimation-Based
Reliable Routing (HLQEBRR) and Collection Tree Protocol (CTP) algorithm in terms of end-toend
transmission delay and packet delivery ratio, and MPLSR performed better than them. It
concluded by recommending MPLSR algorithm for a Multicast MPLS network to enhance
efficiency and reliability.