A hop-by-hop dynamic distributed multipath routing mechanism for link state network

Geng, Hua; Shi, Xingang; Wang, Zhiliang; Yin, Xia

doi:10.1016/j.comcom.2017.12.008

Cited by 15 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dynamic multiplexing protocol algorithm (DMPA) is a connection‐level network router for each target node to calculate the next hop count 16 . A shortcut path layout has to be created based on the default network connection state and according to the powerful network‐level algorithm, shooting ineffective mode enhances efficiency upgrade.…”

Section: Related Workmentioning

confidence: 99%

Retracted: Lifetime maximization energy‐aware routing protocol for route optimization to improve quality of service in wireless sensor networks

Kavithaa²,

Jayanthi³

2022

Computational Intelligence

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) are part of the short‐term networks, including sensitivity, computation, and Wi‐Fi connectivity capability. Many routing, range management, and log transfer protocols are specifically designed for WSN. The previous method showed less efficiency in routing management. The proposed lifetime maximization energy‐aware routing protocol (LTMEARP) protocol is known for its high routing efficiency, giving a higher lifetime and throughput performance. The requirement for a routing system approach is advanced with Internet service provider's protocols by recalculating the routing table after the link stage's substitution worldwide, leading to responses and connection failures by sharing important data after traffic. LTMEARP routing protocol has assured high availability routing performances during traffic conditions. LTMEARP support sends homogeneous and expanded nodes. Analyze a new approach to routing‐based selection algorithms for homogeneous node WSNs. The number of connections is limited and must be adjusted using separate paths and header packets to meet the user's network access location. The results show that the LTMEARP has achieved quality without introducing excessive network access program overhead, which deals with the study of communication and the benefits and problems with the performance of each routing technology.

show abstract

Section: Related Workmentioning

confidence: 99%

Retracted: Lifetime maximization energy‐aware routing protocol for route optimization to improve quality of service in wireless sensor networks

Kavithaa²,

Jayanthi³

2022

Computational Intelligence

View full text Add to dashboard Cite

show abstract

“…FIFR++ approach [24] employ progressive link metric increments in conjunction with FIFR and proves that FIFR++ is loop-free while protecting against single link failures. Authors in [25] present DMPA-e by incorporating hop count, a topology dependent metric. However, DMPA-e cannot achieve full failure coverage against single network component failures.…”

Section: Related Workmentioning

confidence: 99%

“…As our main motivation of this paper is to achieve good computational efficiency and high network availability, the objective Average Degree of The Topology of our performance evaluation is twofold: i) To indicate the effectiveness of MNP-e, we compare MNPe with the standard OSPF and some cooperation-free mechanisms mentioned in Section II, including LFC [12], TBFH [17], MNP and DMPA-e [25]. The time complexity of other schemes mentioned in the related works are much more complex, so they are not compared here.…”

Section: Performance Evaluationmentioning

confidence: 99%

A hybrid link protection scheme for ensuring network service availability in link-state routing networks

et al. 2020

Self Cite

View full text Add to dashboard Cite

The internet is playing an increasingly crucial role in both personal and business activities. In addition, with the emergence of real-time, delay sensitive and mission-critical applications, stringent network availability requirement is put forward for internet service providers (ISPs). However, commonly deployed intradomain link-state routing protocols react to link failures by globally exchanging link state advertisements and recalculating routing table, inevitably causing significant forwarding discontinuity after a failure. Therefore, the loop-free criterion (LFC) approach has been widely deployed by many ISPs for coping with the single network component failure scenario in large internet backbones. The success of LFC lies in its inherent simplicity, but this comes at the expense of letting certain failure scenarios go unprotected. To achieve full failure coverage with LFC without incurring significant extra overhead, we propose a novel link protection scheme, hybrid link protection (HLP), to achieve failure resilient routing. Compared to previous schemes, HLP ensures high network availability in a more efficient way. HLP is implemented in two stages. Stage one provides an efficient LFC based method (MNP-e). The complexity of the algorithm is less than that of Dijkstra's algorithm and can provide the similar network availability with LFC. Stage two provides backup path protection (BPP) based on MNP-e, where only a minimum number of links need to be protected, using special paths and packet headers, to meet the network availability requirement. We evaluate these algorithms in a wide spread of relevant topologies, both real and synthetic, and the results reveal Manuscript

show abstract

P-LFA: A Novel LFA-Based Percolation Fast Rerouting Mechanism

Feng

Gao

et al. 2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A hop-by-hop dynamic distributed multipath routing mechanism for link state network

Cited by 15 publications

References 17 publications

Retracted: Lifetime maximization energy‐aware routing protocol for route optimization to improve quality of service in wireless sensor networks

Retracted: Lifetime maximization energy‐aware routing protocol for route optimization to improve quality of service in wireless sensor networks

A hybrid link protection scheme for ensuring network service availability in link-state routing networks

P-LFA: A Novel LFA-Based Percolation Fast Rerouting Mechanism

Contact Info

Product

Resources

About