JOURNAL ARTICLE

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

Gianlorenzo D’AngeloMattia D’EmidioDaniele Frigioni

Year: 2013 Journal:   Theoretical Computer Science Vol: 516 Pages: 1-19   Publisher: Elsevier BV
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

13
Cited By
2.17
FWCI (Field Weighted Citation Impact)
28
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

Related Documents

JOURNAL ARTICLE

Shortest paths and loop-free routing in dynamic networks

Baruch Awerbuch

Journal:   ACM SIGCOMM Computer Communication Review Year: 1990 Vol: 20 (4)Pages: 177-187
JOURNAL ARTICLE

Shortest path routing algorithm with dynamic composite weights in SDN networks

Dimitar TodorovHristo ValchanovVeneta Aleksieva

Journal:   2021 International Conference Automatics and Informatics (ICAI) Year: 2021 Pages: 193-197
© 2026 ScienceGate Book Chapters — All rights reserved.