A Highly Parallelizable Algorithm for Routing With Automatic Tunneling

Most current routing protocols are based on path computation algorithms in graphs (e.g., Dijkstra, Bellman-Ford, etc.). These algorithms have been studied for a long time and are very well understood, both in a centralized and distributed context, as long as they are applied to a network having a si...

Full description

Bibliographic Details

Published in:	IFIP Networking Conference pp. 1 - 9
Main Authors:	Mouhoub, Noureddine, Lamali, Mohamed Lamine, Magoni, Damien
Format:	Conference Proceeding
Language:	English
Published:	IFIP 13.06.2022
Subjects:	Encapsulation Measurement Multicast algorithms Network topology Path computation algorithms Routing Routing algorithms Routing protocols Tunneling
ISSN:	1861-2288
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!