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

DOI10.1016/J.COMNET.2010.11.005zbMATH Open1210.68037OpenAlexW2010932661MaRDI QIDQ716285FDOQ716285

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1717142
• scientific article; zbMATH DE number 1981018
• scientific article; zbMATH DE number 1717217
• SMRS: A scalable multi-path routing scheme
• scientific article; zbMATH DE number 1981019

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)

Cited In (5)

• Disjoint multipath routing using colored trees
• Dynamic load distribution with hop-by-hop forwarding based on MAX-MIN one-way delay
• Inter-domain multipath routing protocols
• Title not available (Why is that?)
• SMRS: A scalable multi-path routing scheme

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q716285)