This document discusses enhancing fault tolerance and rerouting strategies in MPLS networks. It begins with an introduction to MPLS including its goals, architecture, labels, and label distribution. It then discusses fault tolerance in MPLS, including protection switching and rerouting. Specific fault tolerance techniques discussed include path protection, local protection with different protection modes, and the cost of backup paths. The motivation for the research is then provided, focusing on reducing backup bandwidth, increasing network capacity, and enhancing fault tolerance performance without affecting normal traffic. Related work on fast path recovery, single link failure recovery, threshold sharing schemes, and utilizing failure-free LSPs is also summarized.
Benchmarking Failure Recovery Time in MPLS FRR with Link ProtectionVaideesh Ravi Shankar
Implementation of a network with MPLS environment using multiple routers to calculate convergence time by measuring the packet loss and transmission rate. Also analyzed the change in convergence time for varying packet size and number of transmitted packets.
The document provides an overview of MPLS for traffic management. It discusses how MPLS improves on conventional IP networks and ATM by allowing traffic engineering through label switching. Key topics covered include MPLS components, terminology, dynamic LSP setup using RSVP signaling, traffic trunks, and deployment strategies. The goal of MPLS traffic engineering is to increase resource utilization and speed up network convergence.
MPLS-TE provides fast reroute (FRR) capabilities to minimize traffic loss during network failures. FRR utilizes pre-established backup label switched paths (LSPs) to quickly switch traffic around failures without waiting for IGP convergence. This document describes different MPLS-TE protection schemes like path protection, link protection, and node protection that use backup LSPs to provide sub-50ms failure recovery for critical real-time applications. Local protection schemes that encapsulate the primary LSP within backup tunnels are particularly scalable with fast recovery for link and node failures.
MPLS (Multi-Protocol Label Switching) simplifies packet forwarding by assigning labels to packets and using these labels for forwarding instead of long network addresses. It allows for traffic engineering and quality of service by establishing Label Switched Paths (LSPs) to direct different types of traffic over specific paths. MPLS supports various Layer 2 and Layer 3 protocols and improves network performance and scalability compared to traditional IP routing. It is widely used to implement virtual private networks (VPNs) across shared infrastructures.
MPLS (Multi-Protocol Label Switching) is introduced as a "Layer 2.5" protocol that sits between traditional Layer 2 and Layer 3 networking. It works by assigning labels to packets at ingress routers and using those labels for fast forwarding decisions without additional routing lookups at subsequent routers. This improves performance over traditional IP routing. MPLS also enables traffic engineering through protocols like RSVP-TE that allow reserving bandwidth on specific paths. Other key MPLS concepts covered are label switching, MPLS signaling protocols, label stacking, pseudowires, VPN services, and fast reroute for improved convergence during failures.
Tutorial about MPLS Implementation with Cisco Router, this first of two chapter discuss about What is MPLS, Network Design, P, PE, and CE Router Description, Case Study of IP MPLS Implementation, IP and OSPF Routing Configuration
This document discusses quality of service (QoS) in Multiprotocol Label Switching (MPLS) networks. It begins with an abstract that provides an overview of MPLS and how it can improve network traffic flow and management by assigning labels to packets. The document then analyzes an MPLS network using an OPNET simulator. It explores various aspects of MPLS including its architecture, forwarding process, labels, label switching paths and how routers distinguish between labeled and unlabeled frames. The goal is to evaluate QoS performance in MPLS networks.
This document discusses quality of service (QoS) in Multiprotocol Label Switching (MPLS) networks. It uses OPNET simulator to analyze an MPLS network. MPLS involves assigning labels to packets to identify their path through the network. This allows traffic engineering and QoS by directing different packet streams along different labeled switch paths. The document examines MPLS architecture, operation in different encapsulation modes, routing using hop-by-hop or explicit paths, and the MPLS header format including labels. It aims to evaluate QoS performance in MPLS networks using simulation.
Benchmarking Failure Recovery Time in MPLS FRR with Link ProtectionVaideesh Ravi Shankar
Implementation of a network with MPLS environment using multiple routers to calculate convergence time by measuring the packet loss and transmission rate. Also analyzed the change in convergence time for varying packet size and number of transmitted packets.
The document provides an overview of MPLS for traffic management. It discusses how MPLS improves on conventional IP networks and ATM by allowing traffic engineering through label switching. Key topics covered include MPLS components, terminology, dynamic LSP setup using RSVP signaling, traffic trunks, and deployment strategies. The goal of MPLS traffic engineering is to increase resource utilization and speed up network convergence.
MPLS-TE provides fast reroute (FRR) capabilities to minimize traffic loss during network failures. FRR utilizes pre-established backup label switched paths (LSPs) to quickly switch traffic around failures without waiting for IGP convergence. This document describes different MPLS-TE protection schemes like path protection, link protection, and node protection that use backup LSPs to provide sub-50ms failure recovery for critical real-time applications. Local protection schemes that encapsulate the primary LSP within backup tunnels are particularly scalable with fast recovery for link and node failures.
MPLS (Multi-Protocol Label Switching) simplifies packet forwarding by assigning labels to packets and using these labels for forwarding instead of long network addresses. It allows for traffic engineering and quality of service by establishing Label Switched Paths (LSPs) to direct different types of traffic over specific paths. MPLS supports various Layer 2 and Layer 3 protocols and improves network performance and scalability compared to traditional IP routing. It is widely used to implement virtual private networks (VPNs) across shared infrastructures.
MPLS (Multi-Protocol Label Switching) is introduced as a "Layer 2.5" protocol that sits between traditional Layer 2 and Layer 3 networking. It works by assigning labels to packets at ingress routers and using those labels for fast forwarding decisions without additional routing lookups at subsequent routers. This improves performance over traditional IP routing. MPLS also enables traffic engineering through protocols like RSVP-TE that allow reserving bandwidth on specific paths. Other key MPLS concepts covered are label switching, MPLS signaling protocols, label stacking, pseudowires, VPN services, and fast reroute for improved convergence during failures.
Tutorial about MPLS Implementation with Cisco Router, this first of two chapter discuss about What is MPLS, Network Design, P, PE, and CE Router Description, Case Study of IP MPLS Implementation, IP and OSPF Routing Configuration
This document discusses quality of service (QoS) in Multiprotocol Label Switching (MPLS) networks. It begins with an abstract that provides an overview of MPLS and how it can improve network traffic flow and management by assigning labels to packets. The document then analyzes an MPLS network using an OPNET simulator. It explores various aspects of MPLS including its architecture, forwarding process, labels, label switching paths and how routers distinguish between labeled and unlabeled frames. The goal is to evaluate QoS performance in MPLS networks.
This document discusses quality of service (QoS) in Multiprotocol Label Switching (MPLS) networks. It uses OPNET simulator to analyze an MPLS network. MPLS involves assigning labels to packets to identify their path through the network. This allows traffic engineering and QoS by directing different packet streams along different labeled switch paths. The document examines MPLS architecture, operation in different encapsulation modes, routing using hop-by-hop or explicit paths, and the MPLS header format including labels. It aims to evaluate QoS performance in MPLS networks using simulation.
Report for Network Subject at my college at May,2017 and we were suppose to present the operation of MPLS inside the core network of the service provider while the costumer is using a VPN connection
Segment routing allows a node to steer a packet through an ordered list of segments encoded in the packet header. Segments represent instructions like forwarding through specific nodes or along certain paths. By encoding the path in packets, segment routing can compute paths centrally and reduce network state.
Multi-Protocol Label Switching (MPLS) allows packets to be forwarded along predetermined paths through a network based on short fixed-length labels rather than long variable-length IP addresses. MPLS is used by carriers and large enterprises to implement traffic engineering, virtual private networks, and quality of service through mechanisms like traffic classification and label switching along label switch paths.
1) MPLS QoS uses the EXP field in the MPLS encapsulation header or labels to identify packets and determine their forwarding behaviors, allowing up to 8 differentiated services. This can partially map to IP QoS which uses the DSCP field.
2) There are two approaches for mapping between MPLS QoS and IP QoS - E-LSP which maps to at most 8 PHBs using the EXP field, and L-LSP which allows mapping to any number of PHBs using labels.
3) MPLS QoS can be combined with IntServ to provide end-to-end QoS for individual flows but lacks scalability, or with DiffServ
This document describes an ISP core routing topology project that was implemented to demonstrate how a company accesses its servers through the internet. The key features of the project include MPLS Layer 3 VPN, an IPv6 network with an IPv6 DNS server, various redundancy protocols like HSRP, VRRP and GLBP, dynamic routing protocols such as BGP, EIGRP and OSPF, and a Linux server providing services like DNS, Apache, FTP and SSH. MPLS is used to eliminate delays and provide a VPN connecting different company branches. The topology also features an IPv6 tunnel over an IPv4 network and dual stacking for IPv6/IPv4 communication.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
OSPF is a link-state routing protocol that uses link-state information to make routing decisions. Each router running OSPF floods link-state advertisements (LSAs) throughout the area or autonomous system that contain information about that router's attached interfaces and metrics. Routers then use the information in LSAs to calculate the shortest path to each network and build routing tables. OSPF supports different network types including broadcast, point-to-point, non-broadcast multi-access (NBMA), and point-to-multipoint. It elects a designated router on broadcast networks to reduce the number of adjacencies formed and amount of routing information exchanged.
This document compares MPLS protection switching and OSPF rerouting through simulations. It describes MPLS recovery mechanisms like link protection and the Haskin scheme. It also describes OSPF mechanisms like hello protocols, link state advertisements, shortest path first calculations, and main time constants. The document discusses proposed extensions to OSPF like reducing timers and using multipath routing with local failure reactions. It describes the simulation framework used to model these protocols in NS-2 and compare their recovery performance on a sample network. The focus is on restoration speed after a failure.
MPLS was developed to combine the fast packet forwarding capabilities of ATM with the flexibility of IP by using fixed-length labels to direct data packet through networks. MPLS uses label edge routers to assign labels to packets based on forwarding equivalence classes and distribute labels through protocols like LDP. Core label switching routers use label switching tables to forward packets based on their labels rather than long IP addresses. MPLS enables traffic engineering, QoS, and virtual private networks while maintaining independence from lower layer technologies.
The document discusses traffic engineering in networks using MPLS. It begins by defining traffic engineering and explaining how shortest path routing can lead to link congestion and underutilized paths. It then describes MPLS, constraint-based routing, and enhanced interior gateway protocols. Constraint-based routing computes paths subject to constraints like bandwidth and policies. MPLS extends routing to control packet forwarding and paths. The document outlines the basic components and functioning of an MPLS system for traffic engineering, including setting up label switched paths (LSPs) with attributes like bandwidth, priority, affinity and establishing multiple LSPs between endpoints to distribute load.
This document provides an introduction to Multi-Protocol Label Switching (MPLS). It discusses the motivation for MPLS, which was to combine the forwarding abilities of ATM with the scalability of IP. The key components and protocols of MPLS are described, including label distribution, label switching routers, label edge routers, forwarding equivalence classes, and label switched paths. The operation of MPLS is explained in five steps - label creation and distribution, table creation, path creation, label insertion and lookup, and packet forwarding. Advantages of MPLS include improved performance, quality of service support, network scalability, and integration of different network types.
This document discusses software defined networking (SDN) and Multiprotocol Label Switching (MPLS) as early efforts toward a more centralized and software-based network architecture. It provides an overview of MPLS, including how it establishes semi-static forwarding paths using label switching instead of IP lookups at each router. MPLS functionality is demonstrated through a lab topology that configures and verifies static MPLS tunnels between two routers to exchange traffic using label pushing, swapping, and popping operations rather than traditional IP routing.
This document provides information about load balancing techniques in networking. It discusses several types of load balancing including sub-packet load balancing using MLPPP, per-packet load balancing using bonding, per-connection load balancing using nth, per-address-pair load balancing using ECMP and PCC, custom load balancing using policy routing, and bandwidth-based load balancing using MPLS traffic engineering tunnels. It also provides examples and instructions for configuring various load balancing options in MikroTik RouterOS.
This document discusses scheduling and quality of service (QoS) techniques for telecommunication networks. It covers topics such as packet classification, queuing systems, scheduling algorithms like HoL and RED for loss-sensitive traffic, and upper bound methods and generalized processor sharing for delay-sensitive scheduling. The document also discusses QoS approaches like differentiated services, expedited forwarding for guaranteed bandwidth, and assured forwarding classes. It describes how MPLS provides shortcut routing to improve performance and how generalized MPLS extends MPLS to other network types.
It is considered to be the most perfect solution to address the most recently faced problems in present-day networks such as
“Routing, scalability, quality of service engineering management, traffic engineering”
This document provides an outline for a project comparing SRv4 and SRv6. It begins with an introduction to traditional networks, MPLS, and segment routing. It explains that segment routing aims to overcome issues with MPLS while retaining its advantages. The objectives are to study traditional networks and MPLS, implement both SRv4 and SRv6, and compare the two versions of segment routing. Finally, it includes a project time plan spanning October to March.
This document discusses potential security issues related to MPLS networks. It begins by defining some MPLS terminology like Label Distribution Protocol, Label Switched Path, and Label Switching Router. It then explores ideas like an attacker rewriting MPLS labels to redirect traffic or injecting spoofed messages into the Label Distribution Protocol to manipulate label mappings. However, the document notes that actually exploiting these issues against a real telecom backbone would be very difficult or impossible due to network controls and monitoring. The goal is to raise awareness of security considerations for MPLS rather than enable real attacks.
This document provides an overview of MPLS (Multi-Protocol Label Switching) including its motivation, basics, components, operation, and advantages/disadvantages. MPLS was created to combine the fast packet forwarding of ATM with the flexibility of IP by using labels to direct network traffic. Key components include label edge routers that apply/remove labels, label switching routers that forward based on labels, label distribution protocols to disseminate label mappings, and label switched paths that represent forwarding equivalency classes. MPLS allows for traffic engineering, quality of service, and network scalability.
Application of N jobs M machine Job Sequencing Technique for MPLS Traffic Eng...CSCJournals
This paper discusses Traffic Engineering with Multi-Protocol Label Switching (MPLS) in an Internet Service Provider’s (ISP) network. In this paper, we first briefly describe MPLS, Constraint-based Routing, MPLS-TE, N jobs M machine Job sequencing technique and how to implement the job sequencing technique for Multi-Protocol Label Switching Traffic Engineering. And also improve the quality of service of the network, using this technique firstly reduce the congestion for traffic engineering; minimize the packet loss in complex MPLS domain. In small network packet loss is negligible. We used NS2 discrete event simulator for simulate the above work. Keywords: Traffic Engineering, Multi-Protocol Label Switching, Constraint based routing, N jobs M machine Job Sequencing Technique, Qos, MPLS-TE.
Experimental Analysis Of On Demand Routing Protocolsmita gupta
The document discusses experimental analysis of on-demand routing protocols for mobile ad hoc networks. It provides an outline and introduces key terminologies for multi-hop networks, protocols, routers, hubs, switches, and network topologies. The literature review summarizes several research papers that analyze routing protocols like AODV, DSR, and DSDV using simulation tools to evaluate metrics such as packet delivery ratio, end-to-end delay, and network throughput under different mobility conditions. The problem statement indicates the document will experimentally analyze and compare the performance of on-demand routing protocols.
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELgerogepatton
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesChristina Lin
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
Report for Network Subject at my college at May,2017 and we were suppose to present the operation of MPLS inside the core network of the service provider while the costumer is using a VPN connection
Segment routing allows a node to steer a packet through an ordered list of segments encoded in the packet header. Segments represent instructions like forwarding through specific nodes or along certain paths. By encoding the path in packets, segment routing can compute paths centrally and reduce network state.
Multi-Protocol Label Switching (MPLS) allows packets to be forwarded along predetermined paths through a network based on short fixed-length labels rather than long variable-length IP addresses. MPLS is used by carriers and large enterprises to implement traffic engineering, virtual private networks, and quality of service through mechanisms like traffic classification and label switching along label switch paths.
1) MPLS QoS uses the EXP field in the MPLS encapsulation header or labels to identify packets and determine their forwarding behaviors, allowing up to 8 differentiated services. This can partially map to IP QoS which uses the DSCP field.
2) There are two approaches for mapping between MPLS QoS and IP QoS - E-LSP which maps to at most 8 PHBs using the EXP field, and L-LSP which allows mapping to any number of PHBs using labels.
3) MPLS QoS can be combined with IntServ to provide end-to-end QoS for individual flows but lacks scalability, or with DiffServ
This document describes an ISP core routing topology project that was implemented to demonstrate how a company accesses its servers through the internet. The key features of the project include MPLS Layer 3 VPN, an IPv6 network with an IPv6 DNS server, various redundancy protocols like HSRP, VRRP and GLBP, dynamic routing protocols such as BGP, EIGRP and OSPF, and a Linux server providing services like DNS, Apache, FTP and SSH. MPLS is used to eliminate delays and provide a VPN connecting different company branches. The topology also features an IPv6 tunnel over an IPv4 network and dual stacking for IPv6/IPv4 communication.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
OSPF is a link-state routing protocol that uses link-state information to make routing decisions. Each router running OSPF floods link-state advertisements (LSAs) throughout the area or autonomous system that contain information about that router's attached interfaces and metrics. Routers then use the information in LSAs to calculate the shortest path to each network and build routing tables. OSPF supports different network types including broadcast, point-to-point, non-broadcast multi-access (NBMA), and point-to-multipoint. It elects a designated router on broadcast networks to reduce the number of adjacencies formed and amount of routing information exchanged.
This document compares MPLS protection switching and OSPF rerouting through simulations. It describes MPLS recovery mechanisms like link protection and the Haskin scheme. It also describes OSPF mechanisms like hello protocols, link state advertisements, shortest path first calculations, and main time constants. The document discusses proposed extensions to OSPF like reducing timers and using multipath routing with local failure reactions. It describes the simulation framework used to model these protocols in NS-2 and compare their recovery performance on a sample network. The focus is on restoration speed after a failure.
MPLS was developed to combine the fast packet forwarding capabilities of ATM with the flexibility of IP by using fixed-length labels to direct data packet through networks. MPLS uses label edge routers to assign labels to packets based on forwarding equivalence classes and distribute labels through protocols like LDP. Core label switching routers use label switching tables to forward packets based on their labels rather than long IP addresses. MPLS enables traffic engineering, QoS, and virtual private networks while maintaining independence from lower layer technologies.
The document discusses traffic engineering in networks using MPLS. It begins by defining traffic engineering and explaining how shortest path routing can lead to link congestion and underutilized paths. It then describes MPLS, constraint-based routing, and enhanced interior gateway protocols. Constraint-based routing computes paths subject to constraints like bandwidth and policies. MPLS extends routing to control packet forwarding and paths. The document outlines the basic components and functioning of an MPLS system for traffic engineering, including setting up label switched paths (LSPs) with attributes like bandwidth, priority, affinity and establishing multiple LSPs between endpoints to distribute load.
This document provides an introduction to Multi-Protocol Label Switching (MPLS). It discusses the motivation for MPLS, which was to combine the forwarding abilities of ATM with the scalability of IP. The key components and protocols of MPLS are described, including label distribution, label switching routers, label edge routers, forwarding equivalence classes, and label switched paths. The operation of MPLS is explained in five steps - label creation and distribution, table creation, path creation, label insertion and lookup, and packet forwarding. Advantages of MPLS include improved performance, quality of service support, network scalability, and integration of different network types.
This document discusses software defined networking (SDN) and Multiprotocol Label Switching (MPLS) as early efforts toward a more centralized and software-based network architecture. It provides an overview of MPLS, including how it establishes semi-static forwarding paths using label switching instead of IP lookups at each router. MPLS functionality is demonstrated through a lab topology that configures and verifies static MPLS tunnels between two routers to exchange traffic using label pushing, swapping, and popping operations rather than traditional IP routing.
This document provides information about load balancing techniques in networking. It discusses several types of load balancing including sub-packet load balancing using MLPPP, per-packet load balancing using bonding, per-connection load balancing using nth, per-address-pair load balancing using ECMP and PCC, custom load balancing using policy routing, and bandwidth-based load balancing using MPLS traffic engineering tunnels. It also provides examples and instructions for configuring various load balancing options in MikroTik RouterOS.
This document discusses scheduling and quality of service (QoS) techniques for telecommunication networks. It covers topics such as packet classification, queuing systems, scheduling algorithms like HoL and RED for loss-sensitive traffic, and upper bound methods and generalized processor sharing for delay-sensitive scheduling. The document also discusses QoS approaches like differentiated services, expedited forwarding for guaranteed bandwidth, and assured forwarding classes. It describes how MPLS provides shortcut routing to improve performance and how generalized MPLS extends MPLS to other network types.
It is considered to be the most perfect solution to address the most recently faced problems in present-day networks such as
“Routing, scalability, quality of service engineering management, traffic engineering”
This document provides an outline for a project comparing SRv4 and SRv6. It begins with an introduction to traditional networks, MPLS, and segment routing. It explains that segment routing aims to overcome issues with MPLS while retaining its advantages. The objectives are to study traditional networks and MPLS, implement both SRv4 and SRv6, and compare the two versions of segment routing. Finally, it includes a project time plan spanning October to March.
This document discusses potential security issues related to MPLS networks. It begins by defining some MPLS terminology like Label Distribution Protocol, Label Switched Path, and Label Switching Router. It then explores ideas like an attacker rewriting MPLS labels to redirect traffic or injecting spoofed messages into the Label Distribution Protocol to manipulate label mappings. However, the document notes that actually exploiting these issues against a real telecom backbone would be very difficult or impossible due to network controls and monitoring. The goal is to raise awareness of security considerations for MPLS rather than enable real attacks.
This document provides an overview of MPLS (Multi-Protocol Label Switching) including its motivation, basics, components, operation, and advantages/disadvantages. MPLS was created to combine the fast packet forwarding of ATM with the flexibility of IP by using labels to direct network traffic. Key components include label edge routers that apply/remove labels, label switching routers that forward based on labels, label distribution protocols to disseminate label mappings, and label switched paths that represent forwarding equivalency classes. MPLS allows for traffic engineering, quality of service, and network scalability.
Application of N jobs M machine Job Sequencing Technique for MPLS Traffic Eng...CSCJournals
This paper discusses Traffic Engineering with Multi-Protocol Label Switching (MPLS) in an Internet Service Provider’s (ISP) network. In this paper, we first briefly describe MPLS, Constraint-based Routing, MPLS-TE, N jobs M machine Job sequencing technique and how to implement the job sequencing technique for Multi-Protocol Label Switching Traffic Engineering. And also improve the quality of service of the network, using this technique firstly reduce the congestion for traffic engineering; minimize the packet loss in complex MPLS domain. In small network packet loss is negligible. We used NS2 discrete event simulator for simulate the above work. Keywords: Traffic Engineering, Multi-Protocol Label Switching, Constraint based routing, N jobs M machine Job Sequencing Technique, Qos, MPLS-TE.
Experimental Analysis Of On Demand Routing Protocolsmita gupta
The document discusses experimental analysis of on-demand routing protocols for mobile ad hoc networks. It provides an outline and introduces key terminologies for multi-hop networks, protocols, routers, hubs, switches, and network topologies. The literature review summarizes several research papers that analyze routing protocols like AODV, DSR, and DSDV using simulation tools to evaluate metrics such as packet delivery ratio, end-to-end delay, and network throughput under different mobility conditions. The problem statement indicates the document will experimentally analyze and compare the performance of on-demand routing protocols.
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELgerogepatton
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesChristina Lin
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
Embedded machine learning-based road conditions and driving behavior monitoringIJECEIAES
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...IJECEIAES
Climate change's impact on the planet forced the United Nations and governments to promote green energies and electric transportation. The deployments of photovoltaic (PV) and electric vehicle (EV) systems gained stronger momentum due to their numerous advantages over fossil fuel types. The advantages go beyond sustainability to reach financial support and stability. The work in this paper introduces the hybrid system between PV and EV to support industrial and commercial plants. This paper covers the theoretical framework of the proposed hybrid system including the required equation to complete the cost analysis when PV and EV are present. In addition, the proposed design diagram which sets the priorities and requirements of the system is presented. The proposed approach allows setup to advance their power stability, especially during power outages. The presented information supports researchers and plant owners to complete the necessary analysis while promoting the deployment of clean energy. The result of a case study that represents a dairy milk farmer supports the theoretical works and highlights its advanced benefits to existing plants. The short return on investment of the proposed approach supports the paper's novelty approach for the sustainable electrical system. In addition, the proposed system allows for an isolated power setup without the need for a transmission line which enhances the safety of the electrical network
TIME DIVISION MULTIPLEXING TECHNIQUE FOR COMMUNICATION SYSTEMHODECEDSIET
Time Division Multiplexing (TDM) is a method of transmitting multiple signals over a single communication channel by dividing the signal into many segments, each having a very short duration of time. These time slots are then allocated to different data streams, allowing multiple signals to share the same transmission medium efficiently. TDM is widely used in telecommunications and data communication systems.
### How TDM Works
1. **Time Slots Allocation**: The core principle of TDM is to assign distinct time slots to each signal. During each time slot, the respective signal is transmitted, and then the process repeats cyclically. For example, if there are four signals to be transmitted, the TDM cycle will divide time into four slots, each assigned to one signal.
2. **Synchronization**: Synchronization is crucial in TDM systems to ensure that the signals are correctly aligned with their respective time slots. Both the transmitter and receiver must be synchronized to avoid any overlap or loss of data. This synchronization is typically maintained by a clock signal that ensures time slots are accurately aligned.
3. **Frame Structure**: TDM data is organized into frames, where each frame consists of a set of time slots. Each frame is repeated at regular intervals, ensuring continuous transmission of data streams. The frame structure helps in managing the data streams and maintaining the synchronization between the transmitter and receiver.
4. **Multiplexer and Demultiplexer**: At the transmitting end, a multiplexer combines multiple input signals into a single composite signal by assigning each signal to a specific time slot. At the receiving end, a demultiplexer separates the composite signal back into individual signals based on their respective time slots.
### Types of TDM
1. **Synchronous TDM**: In synchronous TDM, time slots are pre-assigned to each signal, regardless of whether the signal has data to transmit or not. This can lead to inefficiencies if some time slots remain empty due to the absence of data.
2. **Asynchronous TDM (or Statistical TDM)**: Asynchronous TDM addresses the inefficiencies of synchronous TDM by allocating time slots dynamically based on the presence of data. Time slots are assigned only when there is data to transmit, which optimizes the use of the communication channel.
### Applications of TDM
- **Telecommunications**: TDM is extensively used in telecommunication systems, such as in T1 and E1 lines, where multiple telephone calls are transmitted over a single line by assigning each call to a specific time slot.
- **Digital Audio and Video Broadcasting**: TDM is used in broadcasting systems to transmit multiple audio or video streams over a single channel, ensuring efficient use of bandwidth.
- **Computer Networks**: TDM is used in network protocols and systems to manage the transmission of data from multiple sources over a single network medium.
### Advantages of TDM
- **Efficient Use of Bandwidth**: TDM all
Using recycled concrete aggregates (RCA) for pavements is crucial to achieving sustainability. Implementing RCA for new pavement can minimize carbon footprint, conserve natural resources, reduce harmful emissions, and lower life cycle costs. Compared to natural aggregate (NA), RCA pavement has fewer comprehensive studies and sustainability assessments.
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
Literature Review Basics and Understanding Reference Management.pptxDr Ramhari Poudyal
Three-day training on academic research focuses on analytical tools at United Technical College, supported by the University Grant Commission, Nepal. 24-26 May 2024
Literature Review Basics and Understanding Reference Management.pptx
MPLS.pptx
1. ENHANCING FAULT TOLERANCE AND
REROUTING STRATEGIES IN MPLS NETWORKS
Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal
Supervisor
Dr. Kanak Saxena
Professor
Department of Computer Applications
Samrat Ashok Technological Institute
Vidisha (M.P.)
Research Scholar
Ravindra Kumar Singh
*
2. MULTI-PROTOCOL LABEL SWITCHING
GOALS OF MPLS
▪ Scalability of network layer routing.
▪ Using labels as a means to aggregate forwarding
information, while working in the presence of routing
hierarchies.
▪ Greater flexibility in delivering routing services.
▪ Using labels to identify particular traffic which are to
receive special services, e.g. QoS.
▪ Increased performance.
▪ Using the label-swapping paradigm to optimize network
performance.
3. GOALS OF MPLS CONT…
▪ Simplify integration of routers with cell switching based
technologies.
▪ Making cell switches behave as routers.
▪ By making information about physical topology
available to network layer routing procedures.
4. MULTI-PROTOCOL LABEL SWITCHING
INTRODUCTION TO MPLS
▪ MPLS improves internet scalability by eliminating the need
for each router and switch in a packet's path to perform
traditionally redundant address lookups and route
calculation.
▪ Improves scalability through better traffic engineering.
▪ MPLS also permits explicit backbone routing, which
specifies in advance the hops that a packet will take across
the network.
▪ This should allow more deterministic, or predictable,
performance that can be used to guarantee QoS.
▪ These paths function at layer 3 or can even be mapped
directly to layer 2 transport such as ATM or frame relay.
5. INTRODUCTION TO MPLS CONT…
▪ Explicit routing will give IP traffic a semblance of end-to-
end connections over the backbone.
▪ The MPLS definition of IP QoS parameters is limited.
▪ Out of 32 bits total, an MPLS label reserves just three bits
for specifying QoS.
▪ Label-switching routers (LSRs) will examine these bits and
forward packets over paths that provide the appropriate
QoS levels. But the exact values and functions of these so-
called 'experimental bits‘ remain to be defined.
▪ The MPLS label could specify whether traffic requires
constant bit rate (CBR) or variable bit rate (VBR) service,
and the ATM network will ensure that guarantees are met.
7. MULTI-PROTOCOL LABEL SWITCHING
LABELS
▪ A label is short, fixed length physically continuous identifier
which is used to identify a FEC ( forwarding equivalence
class), usually of local significance.
▪ Ru can transmits a packet labeled L to Rd, if they can agree
to a binding between label L and FEC F for packets moving
from Ru to Rd.
▪ Ru (upstream LSR) → Rd (downstream LSR with
respect to a given binding).
▪ L becomes Ru’s “outgoing label” representing FEC F,
and L becomes rd’s “incoming label” representing FEC
F.
▪ Rd must make sure that the binding from label to FEC is
one-to-one.
8. MULTI-PROTOCOL LABEL SWITCHING
LABELS CONT…
▪ Rd must not agree with Ru1 to bind L to FEC F1, while
agreeing with some other LSR Ru2 to bind L to a different
FEC F2, unless rd can always tell, when it receives a packet
with incoming label L, whether the label was put on the
packet by Ru1 or Ru2.
L for FEC F1
L for FEC F2
Ru1
Ru2
Rd
9. MULTI-PROTOCOL LABEL SWITCHING
LABELED PACKET
▪ A packet into which a label has been encoded.
▪ The label resides in an encapsulation header which exists
specifically for this purpose.
▪ Or the label may reside in a existing data link or network
layer header.
▪ The particular encoding technique which is used must be
agreed to by both the entities which encodes the label and
the entity which decodes the label.
10. MULTI-PROTOCOL LABEL SWITCHING
LABEL DISTRIBUTION
▪ It is set of procedures by which one LSR informs another
LSRs of the bindings (label/FEC) it has made.
▪ Two LSRs which use a distribution protocol to exchange
label/FEC binding information are known as “label
distributing peers” with respect to the binding information
they exchange.
▪ There exists many different distribution protocols ( [MPLS-
BGP], [MPLS-RSVP], [MPLS-RVSP-TUNNELS],
[MPLS-CR-LDP]).
11. IP VERSUS MPLS
▪ In IP Routing, each router makes its own routing and
forwarding decisions.
▪ In MPLS:
▪ source router makes the routing decision.
▪ Intermediate routers make forwarding decisions.
▪ A path is computed and a “virtual circuit” is established
from ingress router to egress router.
▪ An MPLS path or virtual circuit from source to destination
is called an LSP (label switched path).
12. FAULT TOLERANCE IN MPLS
▪ In MPLS two basic models are used to recover from faults
▪ Protection Switching
▪ Rerouting
13. PROTECTION SWITCHING AND REROUTING
▪ Rerouting
▪ On-demand recovery – no preset backup paths.
▪ Example: existing recovery in IP networks.
▪ Protection
▪ Pre-determined recovery – backup paths “in advance”.
▪ Primary and backup are provisioned at the same time.
▪ IP supports rerouting .
▪ Because it is datagram service.
▪ MPLS supports rerouting as well as protection.
▪ Because it is virtual-circuit service.
14. REROUTING IN IP NETWORKS
▪ In traditional IP, what happens when a link or node fails?
▪ Failure information needs to be disseminated in the
network.
▪ During this time, packets may go in loops.
▪ Rerouting latency is in the order of seconds.
▪ We look for protection possibilities in an MPLS network,
but…
▪ First we need to look at the QoS requirements
15. QoS REQUIREMENTS
▪ Bandwidth Guaranteed Primary Paths
▪ Bandwidth Guaranteed Backup Paths
▪ BW remains provisioned in case of network failure
▪ Minimal “Protection or rerouting Latency”
▪ Protection/rerouting latency is the time that elapses
between:
▪ “the occurrence of a failure”, and
▪ “the diversion of network traffic on a new path”
rerouting is generally SLOWER than protection
16. PROTECTION IN MPLS
▪ First we define Protection level.
▪ Path protection
▪ Also called end-to-end protection.
▪ For each primary LSP, a node-disjoint backup LSP is set up.
▪ Upon failure, ingress node diverts traffic on the backup path.
▪ Local Protection
▪ Upon failure, node immediately upstream the failed element
diverts the traffic on a “local” backup path.
Path Protection ➔ More Latency
Local Protection ➔ Less Latency
17. PROTECTION IN MPLS CONT…
PATH PROTECTION
S 1 2 3 D
Primary Path
Backup Path
This type of “path Protection”
still takes 100s of ms.
We may explore “Local Protection” to
quickly switch onto backup paths!
18. PROTECTION IN MPLS CONT…
LOCAL PROTECTION: FAULT MODELS
A B C D
Link
Protection
A B C D
A B C D
Node
Protection
Element
Protection
19. PROTECTION IN MPLS CONT…
PROTECTION MODES
▪ 1+1 protection
▪ Flow sent on two separate disjoint paths
▪ Receiver responsible for choosing one of the two
▪ 1:1 protection
▪ A backup path protects a single LSP (or a portion of a
single LSP)
▪ N:1 protection
▪ A backup path protects one link or one node or both
▪ Overlapping portions of many LSPs are protected by a
single backup path
▪ Applicable for local protection only
▪ N:M protection (M<N)
20. COST OF THE BACKUP PATH
▪ Local Protection requires that backup paths are setup in
advance
▪ Upon failure, traffic is promptly switched onto preset
backup paths.
▪ Bandwidth must be reserved for all backup paths
▪ This results in a reduction in the number of Primary
LSPs that can otherwise be placed on the network.
▪ Can we reduce the amount of “backup bandwidth” but still
provide guaranteed backups?
21. MOTIVATION FOR THE RESEARCH
▪ We First look to answer the following questions:
▪ Who computes the primary path?
▪ What is the fault model (link, node, or element protection)?
▪ Where do the backup paths originate?
▪ Who computes the backup path?
▪ At what point do the backup paths merge back with the
primary path?
▪ What information is stored locally in the nodes/routers?
▪ What information is propagated through routing protocols?
▪ What if a primary path can not be fully protected?
22. MOTIVATION FOR THE RESEARCH CONT…
▪ Then we try to solve the following unsolved problems and
hence motivations:
▪ How can we reduce the amount of “backup bandwidth” but
still provide guaranteed backups? Thus maximizing the
bandwidth sharing.
▪ How to increase the maximum number of primary LSPs
that can be placed on the network?
▪ How to maintain the survivability of network by recovering
from failure with in the acceptable delay and minimum
packet loss while efficiently utilizing the network
resources?
23. MOTIVATION FOR THE RESEARCH CONT…
▪ How to enhance the fault-tolerance performance without
affecting the fault free traffic?
▪ How to solve the packet disorder problem while
rerouting the affected traffic?
24. RELATED WORK
▪ Jenhui Chen et al. in [26] proposed a fast path recovery mechanism,
which employs the Enhanced Interior Gateway Routing Protocol
(EIGRP) and the Diffusing Update Algorithm (DUAL) together, to
find the working and backup paths simultaneously and modify the
LDP to establish the LSP by using the routing table of EIGRP.
▪ S Sae Lor et al. in [25] proposed a novel technique for fast re-route in
hop-by-hop routing in case of single link failures. It offers full repair
coverage without requiring additional mechanisms such as tunneling
or interface-specific operations. The technique handles the failures
without jeopardizing the operable parts of a network.
▪ Sahel Alouneh et al. in [27] present a novel approach for fault
tolerance in MPLS networks using a modified (k, n) threshold
sharing scheme with multi-path routing.
25. RELATED WORK CONT…
▪ Jenn-Wei Lin et al. in [28] enhanced the fault-tolerant performance
of the two recovery mechanisms (protection switching and
rerouting). The proposed approach utilizes the failure free LSPs to
transmit the traffic of the failed LSP (the affected traffic).
▪ Ravindra Kumar Singh et al. in [30] proposed a new algorithm for
an optimum LSP pair selection from multiple parallel LSP pairs. It
minimizes the probability of network congestion, packet loss and
request loss by selecting the LSP which is lightly loaded and
possess upward and downward bandwidth proportional to the
service request.
26. RESEARCH METHODOLOGY
▪ Survey of literature, Study of various algorithms/ models/
methods of the Fault Tolerance and Rerouting currently
available.
▪ Comparison between existing algorithms/ models based on
their efficiency and methodology, complexity.
▪ Analysis of pros and cons of different Fault Tolerance and
Rerouting methods exist in the literature.
▪ Criteria for evaluating the performance factors.
▪ Creation of new algorithms/ models which removes
drawbacks of existing methods
27. EXPECTED OUTCOMES
▪ Implementation model for proposed work.
▪ Complete analysis of various factors affecting performances of
fault tolerance algorithm.
▪ Implementation/ simulation of newly developed algorithms/
models/ methods.
▪ Comparison of newly developed algorithms/ models/ methods
with the existing algorithms/ models/ methods.
▪ Testing & maintenance of the newly developed algorithms/
models Necessary optimization models to be designed and / or
simulated.
▪ Experiments with real world networks are reported to
demonstrate the optimality of the algorithm / model / methods.
28. BIBLIOGRAPHY
[1] R. Aggarwal, D. Papadimitriou, and S. Y. (Eds.). Extensions to RSVP-TE for point to multipoint
TE LSPs. IETF Draft, April 2005.
[2] G. Ahn, J . Jang, and W. Chun. An efficient rerouting scheme for MPLS-based recovery and its
performance evaluation. Telecommunication Systems, pages 481-495, 2002.
[3] D. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, and G. Swallow. RSVP-TE: Extensions to
RSVP for LSP tunnels. IETF RFC 3209, December 2001.
[4] R. Bartog and M. Raman. A heuristic approach t o service restoration in MPLS networks. In IEEE
International Conference on Communications, ICC 2001, volume 1, pages 117-121, June 2001.
[5] R. Braden, L. Zhang, S. Berson, S. Herzog, and S. Jamin. Resource reservation protocol (RSVP)
- version 1 functional specification. IETF RFC 2205, September 1997.
[6] A. Dana, A. K. Zadeh, K. Badie, M. E. Kalantari, and N. Reyhani. LSP restoration in MPLS
network using case-based reasoning approach. In Proceedings of ICCT2003, pages 462-468,
2003.
[7] W. D. Grover and D. Stamatelakis. Cycle-oriented distributed preconfiguration: Ring-like speed
with mesh-like capacity for self-planning network restoration. In Proceedings of IEEE ICC'98,
pages 537-543, Atlanta, Georgia, June 1998.
[8] D.-K. Hong, C. S. Hong, and Dongsik-Yun. A hierarchical restoration scheme with dynamic
adjustment of restoration scope in an MPLS network. In Network Operations and Management
Symposium, pages 191-204, April 2004.
[9] C. Huang, V. Sharma, K. Owens, and S. Makam. Building reliable MPLS networks using a path
protection mechanism. IEEE Communications Magazine, pages 156 - 162, March 2002.
[10] J . Kang and M. J. Reed. Bandwith protection in MPLS networks using p-cycle structure. In
Design of Reliable Communication Networks (DRCN) 2003, pages 356-362, Banff, Alberta,
Canada, October 2003.
29. BIBLIOGRAPHY
[11] S.-Y. Kim. Effect of load distribution in path protection of MPLS. International Journal of
Communication Systems, 16(4):321-335, February 2003.
[12] M. Kodialam and T. V. Lakshman. Dynamic routing of locally restorable bandwidth guaranteed
tunnels using aggregated link usage information. In Proceedings of IEEE INFOCOM 2001, pages
376-385, April 2001.
[13] M. Kodialam and T. V. Lakshman. Restorable dynamic quality of service routing. IEEE
Communications Magazine, pages 72-81, June 2002.
[14] H. Mellah and A. F. Mohamed. Local path protection/restoration in MPLS-based networks. In the
9th Asia-Pacific Conference on Communications- APCC 2003, volume 2, pages 620-622,
September 2003.
[15] M. Menth, J. Milbrandt, and A. Reifert. End-to-end protection switching mechanisms for MPLS
networks. Technical Report 320, University of Wurzburg, Institute of Computer Science, February
2004.
[16] P. Pan, G. Swallow, and A. A. (Eds.). Fast reroute extensions to RSVP-TE for LSP tunnels. IETF
RFC 4090, May 2005.
[17] P.-K. Park, H.-S. Yoon, S. C. Kim, J . Park, and S. Yang. Design of a dynamic path protection
mechanism in MPLS networks. In The 6th International Conference on Advanced Communication
Technology, volume 2, pages 857-861, 2004.
[18] C. Qiao and D. Xu. Distributed partial information management (DPIM) schemes for survivable
networks – part I. In Proceedings of IgEE INFOCOM 2002, pages 302 -311, 2002.
30. BIBLIOGRAPHY CONT…
[19] V. Sharma, F. Hellstrand, B. Mack-Crane, S. Makam, K. Owens, C. Huang, J. Weil, B. Cain, L.
Anderson, B. Jamoussi, A. Chiu, and S. Civanlar. Framework for multi-protocol label switching
(MPLS)-based recovery. IETF RFC 3469, February 2003.
[20] D. Stamatelakis and W. D. Grover. IP layer restoration and network planning based on virtual
protection cycles. IEEE Journal on Selected Areas in Communications, 18(10):1938-1949, October
2000.
[21] D. Xu, Y. Xiong, , and C. Qiao. Novel algorithms for shared segment protection. IEEE Journal on
Selected Areas in Communication, 21(8): 1320-1331, 2003.
[22] E. Yetginer and E. Karasan. Robust path design algorithms for traffic engineering with restoration
in MPLS networks. In Proceedings of the Seventh International Symposium on Computer and
Communications – ISCC 2002, pages 933-938, 2002.
[23] S. Yoon, H. Lee, D. Choi, Y. Kim, G. Lee, and M. Lee. An efficient recovery mechanism for MPLS-
based protection LSP. In Joint 4th IEEE International Conference on ATM (ICATM 2001), pages 75-
79, Seoul, Korea, April 2001.
[24] Weili Huang, Hongyan Guo. A Fault-Tolerant Strategy for Multicasting in MPLS Networks.
International Conference on Computer Engineering and Technology (ICCET 2009), Vol. 1, pages
432-435, 2009.
[25] S Sae Lor, R Landa, and M Rio. A New Technique for Full Fast Recovery in Hop-by-Hop Routing. In
London Communications Symposium 2009.
[26] Jenhui Chen , Chung-Ching Chiou and Shih-Lin Wu. A Fast Path Recovery Mechanism for MPLS
Networks. In Networking - ICN 2005, LNCS 3421, pages 58-65, 2005.
[27] Sahel Alouneha, Anjali Agarwal and Abdeslam En-Nouaary. A novel path protection scheme for
MPLS networks using multi-path routing. In Computer Networks Volume 53, Issue 9, Pages 1530-
1545, 25 June 2009.
31. BIBLIOGRAPHY CONT…
[28] Lin, J.-W., Liu, H.-Y. Redirection based recovery for MPLS network systems. J. Syst. Software
(2009).
[29] Mohand Yazid Saidi, Bernard Cousin, Jean-Louis Le Roux. PLR-based heuristic for backup path
computation in MPLS networks. Computer Networks, Volume 53, pages 1467–1479, 2009.
[30] Ravindra Kumar Singh, Kanak Saxena and Reena Singh. Traffic Aware LSP Selection Method in
MPLS Networks. In Springer LNCS for International Conference on Recent Trends in Business
Administration and Information Processing 2010. Trivandrum, India