Optimal link-state hop-by-hop routing

Michael, Nithin; Tang, Ao; Xu, Dahai

doi:10.1109/icnp.2013.6733585

Cited by 16 publications

(13 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If instead split ratios are set to be positive instantaneously only to the links leading to shortest paths, then we get OSPF [2] with weights.…”

Section: Link Managementmentioning

confidence: 99%

“…The problem become serious, when it realized that there has to be no way around this tradeoff. In actual condition, in the offered traffic, finding the optimal link weights for OSPF [2], if they exist, has been shown to be NPhard problem. HALO paper suggested by Nithin Michael is able to eliminate this tradeoff between optimality and ease of implementation in routing.…”

Section: Introductionmentioning

confidence: 99%

“…When a node accepts a request packet from its neighbor it compares the Min BW value in the packet with its available bandwidth. [2] If the available bandwidth is less than Min BW, this bandwidth is assigned as the Min BW. This process will continue up to the destination.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Multi-hop Adaptive Link State Optimal Routing in Wireless Ad hoc Network

2017

IJSR

View full text Add to dashboard Cite

Exploitation of HALO scheme to accomplish unique routing is recently known as a superior technique. All previous works improved routing on WSN, there is no strong improvement on QoS and for multidestination routing with less traffic overhead. The enhancement on routing QoS and multi-destination packet routing are addressed by using triplet model and link state algorithm in this project. By exploitation of the approach each node, for all diverse node, the algorithm separately and regularly renews the piece of traffic bound to that leaves on each of its outgoing paths. At each recapitulation, the updates are calculated by applying on the shortest path evaluations to every target which in turns discovered by the inconsiderable costs of the network's paths. That means the insignificant link costs are applied to encounter the shortest paths are in turn acquired from link-state updates that are flooded within the network after each recapitulation. This way of system is also versatile which means it naturally discovers the constant network transforms and captures judgments considering the different convenient means. However this has accomplished to exclude the trade-off between optimality and comfort of execution and routing yet it can function properly if we tried to decreases the acknowledgement overhead traffic. This paper project that there is a overcrowding issue due to acknowledgements which is to be decreases by practicing 2ACK system with triplet model and this will encouraged to decrease traffic and improve link employment for multi-destination routing keeping QoS also it maintains the transmission path log history for future communication.

show abstract

“…If instead split ratios are set to be positive instantaneously only to the links leading to shortest paths, then we get OSPF [2] with weights.…”

Section: Link Managementmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Multi-hop Adaptive Link State Optimal Routing in Wireless Ad hoc Network

2017

IJSR

View full text Add to dashboard Cite

show abstract

“…Hop-by-hop Adaptive Linkstate Optimal (HALO) [175] 2013 Solves the TE intradomain routing problem through adaptation to traffic demands and computing link weights locally and optimally using the same information as OSPF. It is the first optimal link-state hop-by-hop routing algorithm.…”

Section: Date [168] 2007mentioning

confidence: 99%

Exploiting the Power of Multiplicity: A Holistic Survey of Network-Layer Multipath

Qadir

Ali

Yau

et al. 2015

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

Abstract-The Internet is inherently a multipath network-for an underlying network with only a single path connecting various nodes would have been debilitatingly fragile. Unfortunately, traditional Internet technologies have been designed around the restrictive assumption of a single working path between a source and a destination. The lack of native multipath support constrains network performance even as the underlying network is richly connected and has redundant multiple paths. Computer networks can exploit the power of multiplicity-through which a diverse collection of paths is resource pooled as a single resource-to unlock the inherent redundancy of the Internet. This opens up a new vista of opportunities promising increased throughput (through concurrent usage of multiple paths) and increased reliability and fault-tolerance (through the use of multiple paths in backup/ redundant arrangements). There are many emerging trends in networking that signify that the Internet's future will be unmistakably multipath, including the use of multipath technology in datacenter computing; multi-interface, multi-channel, and multi-antenna trends in wireless; ubiquity of mobile devices that are multi-homed with heterogeneous access networks; and the development and standardization of multipath transport protocols such as MP-TCP.The aim of this paper is to provide a comprehensive survey of the literature on network-layer multipath solutions. We will present a detailed investigation of two important design issues, namely the control plane problem of how to compute and select the routes, and the data plane problem of how to split the flow on the computed paths. The main contribution of this paper is a systematic articulation of the main design issues in network-layer multipath routing along with a broad-ranging survey of the vast literature on network-layer multipathing. We also highlight open issues and identify directions for future work.

show abstract

“…Moreover, TeXCP employs the closed-loop feedback controller to ensure the stability of the link utilization. Traffic engineering can be modeled as the classical multicommodity flow (MCF) problem [3]. Although TeXCP cannot guarantee the optimal solution to the MCF problem, the performance obtained by TeXCP is promising.…”

Section: Introductionmentioning

confidence: 99%

The Stability-Featured Dynamic Multi-Path Routing

Jin

et al. 2016

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYStability-featured dynamic multi-path routing (SDMR) based on the existing Traffic engineering eXplicit Control Protocol (TeXCP) is proposed and evaluated for traffic engineering in terrestrial networks. SDMR abandons the sophisticated stability maintenance mechanisms of TeXCP, whose load balancing scheme is also modified in the proposed mechanism. SDMR is proved to be able to converge to a unique equilibria state, which has been corroborated by the simulations. key words: traffic engineering, multi-path routing, non-additive path cost, equilibria

show abstract

Optimal link-state hop-by-hop routing

Cited by 16 publications

References 17 publications

Multi-hop Adaptive Link State Optimal Routing in Wireless Ad hoc Network

Multi-hop Adaptive Link State Optimal Routing in Wireless Ad hoc Network

Exploiting the Power of Multiplicity: A Holistic Survey of Network-Layer Multipath

The Stability-Featured Dynamic Multi-Path Routing

Contact Info

Product

Resources

About