An efficient algorithm to enable path diversity in link state routing networks

DOI10.1016/J.COMNET.2010.11.005zbMath1210.68037OpenAlexW2010932661MaRDI QIDQ716285

D. Kharzeev

Publication date: 27 April 2011

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2010.11.005

zbMATH Keywords

multipath routingfast-reroutingpath diversityshortest paths algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items (1)

Dynamic load distribution with hop-by-hop forwarding based on MAX-MIN one-way delay

This page was built for publication: An efficient algorithm to enable path diversity in link state routing networks