A loop-free shortest-path routing algorithm for dynamic networks

Gianlorenzo D’Angelo; Mattia D’Emidio; Daniele Frigioni

doi:10.1016/j.tcs.2013.11.001

ScienceGate Book Chapters

JOURNAL ARTICLE

A loop-free shortest-path routing algorithm for dynamic networks

Gianlorenzo D’Angelo Mattia D’Emidio Daniele Frigioni

Year: 2013 Journal: Theoretical Computer Science Vol: 516 Pages: 1-19 Publisher: Elsevier BV

DOI: 10.1016/j.tcs.2013.11.001

Get Full-Text PDF Get Analytical Report

Keywords:

Distance-vector routing protocol Path vector protocol Computer science Loop (graph theory) Shortest path problem Enhanced Interior Gateway Routing Protocol Routing Information Protocol Algorithm Routing (electronic design automation) Dual (grammatical number) Interior gateway protocol Static routing Link-state routing protocol Routing protocol Theoretical computer science Mathematics Computer network Combinatorics

Metrics

Cited By

2.17

FWCI (Field Weighted Citation Impact)

Refs

0.89

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Network Traffic and Congestion Control

Physical Sciences → Computer Science → Computer Networks and Communications

Mobile Ad Hoc Networks

Physical Sciences → Computer Science → Computer Networks and Communications

Software-Defined Networks and 5G

Physical Sciences → Computer Science → Computer Networks and Communications

A loop-free shortest-path routing algorithm for dynamic networks

Metrics

Citation History

Topics

Related Documents

A distributed, loop-free, shortest-path routing algorithm

Shortest paths and loop-free routing in dynamic networks

Shortest paths and loop-free routing in dynamic networks

Shortest path routing algorithm with dynamic composite weights in SDN networks

Engineering a New Loop-Free Shortest Paths Routing Algorithm