TL;DR
This paper presents detailed algorithm for calculating L-LSR coefficient, and shows that L-LSR algorithm not only performs better than OSPF, but also has verySignificant performance improvement over the other LSR family of algorithms.
Multiprotocol Label Switching (MPLS) plays a critical role in the backbone networks of Internet Service Providers (ISPs), ensuring robust and scalable network operation. By employing label-based switching instead of destination-based IP forwarding, MPLS significantly reduces forwarding complexity and supports advanced traffic engineering mechanisms. Within MPLS, the Label Distribution Protocol (LDP) is typically used for label distribution, relying on routing information from the Interior Gateway Protocol (IGP). When a link or node failure occurs, LDP is forced to wait for the IGP to re-calculate and update the new paths before it can assign labels for Forwarding Equivalence Classes (FECs). This dependency significantly increases service disruption time due to the combined IGP convergence time and the subsequent label replacement mechanism (withdrawing old labels and installing new ones). Therefore, this paper proposes a novel scheme to mitigate LDP’s dependence on the IGP, thereby minimizing network restoration time during network topology changes. The method utilizes an event-driven signaling mechanism to instantly announce link and node outages across the network. Furthermore, it establishes and installs both primary and backup Label Switched Paths (LSPs) during the initial setup phase of the router. Experimental results demonstrate that the proposed method significantly outperforms LDP, achieving a convergence time up to four times faster in large-scale network scenarios and proving superior scalability.
Wireless Sensor Networks (WSNs) are well-established, smart systems whose significance is rapidly escalating. Geographic routing offers many advantages in terms of network reliability and performance. However, they tend to fail in high congestion and the presence of energy holes. To address these challenges, a new geographic routing technique has been introduced to enhance network performance. The proposed routing algorithm is built upon the Technique for Order of Preference by Similarity to the Ideal Solution (TOPSIS). TOPSIS will use four criteria to forward data reports to the best-neighbor node without causing excessive congestion. In addition, the proposed algorithm will be embedded with a technique that retard the energy hole formation and can bypass them effectively without expanding them. The Path Deviation (PD) technique will prevent repetitive sending along the same paths. PD technique removes the previous forwarding node from the routing table. The proposed routing algorithm outperforms the benchmark algorithms, delivering notable improvements in packet error rate, reaching 29.3% and 16.4% compared to the FTR and EEGR algorithms, respectively. Moreover, the proposed routing algorithm demonstrates enhanced performance over the benchmark algorithms, achieving gains in packet delivery ratio of 2.6% and 1.16%, respectively. At the same time, it outperforms the network lifetime of the FTR algorithm by 28.4% and the EEGR algorithm by 11.7%. Lastly, it reduces latency by 12.2% compared with FTR and 18.2% compared with EEGR.
Simulation results indicate that HOA-MEPFL-CLCT-RP outperforms existing models in terms of Packet Delivery Ratio (PDR), energy efficiency, End-to-End Delay (E2D), and routing overhead.
This paper studies local failover schemes that minimize the number of rewritable bits in the packet header on directed graphs with $k-arc failures and shows that their scheme is nearly optimal when the number of faulty arcs is approximately less than the number of nodes.
This paper empirically analyses the existing routing protocols such as Epidemic, Spray and Wait, Prophet, Encounter Based Routing using different parameters, such as number of nodes, buffer size, etc., to analyse energy consumption in terms of overhead.
These findings verify that MANET transmission is demonstrably enhanced and safer when trust, congestion, and QoS are all addressed concurrently at a particular transit level as opposed to individual-criterion techniques.