Engineering a New Loop-Free Shortest Paths Routing Algorithm

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

doi:10.1007/978-3-642-30850-5_12

ScienceGate Book Chapters

BOOK-CHAPTER

Engineering a New Loop-Free Shortest Paths Routing Algorithm

Gianlorenzo D’Angelo Mattia D’Emidio Daniele Frigioni Vinicio Maurizio

Year: 2012 Lecture notes in computer science Pages: 123-134 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-642-30850-5_12

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Distance-vector routing protocol Node (physics) Loop (graph theory) Routing (electronic design automation) Shortest path problem Path vector protocol Algorithm Set (abstract data type) Topology (electrical circuits) Routing protocol Theoretical computer science Static routing Computer network Mathematics Combinatorics Graph

Metrics

Cited By

2.30

FWCI (Field Weighted Citation Impact)

Refs

0.86

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

Software-Defined Networks and 5G

Physical Sciences → Computer Science → Computer Networks and Communications

Advanced Optical Network Technologies

Physical Sciences → Engineering → Electrical and Electronic Engineering

Engineering a New Loop-Free Shortest Paths Routing Algorithm

Metrics

Citation History

Topics

Related Documents

Shortest paths and loop-free routing in dynamic networks

Shortest paths and loop-free routing in dynamic networks

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

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

An Efficient K-Shortest Paths Based Routing Algorithm