Scalable and Privacy-Preserving Inter-AS Routing Through Machine-Learning-Based Graph Pruning
The decentralized nature of traditional inter-domain routing protocols may lead to several issues, including convergence issues and proneness to misconfiguration. In response to these problems, alternative approaches that leverage the Software Defined Networking (SDN) paradigm to increase the contro...
Saved in:
Main Authors: | Davide Andreoletti, Cristina Rottondi, Silvia Giordano, Andrea Bianco |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2025-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10858147/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
BeSnake: A Routing Algorithm for Scalable Spin-Qubit Architectures
by: Nikiforos Paraskevopoulos, et al.
Published: (2024-01-01) -
ROUTE FIRST-CLUSTER SECOND METHOD FOR PERSONAL SERVICE ROUTING PROBLEM
by: MELİKE KÜBRA EKİZ, et al.
Published: (2019-06-01) -
Visual Route Recognition in Urban Spaces: A Scalable Approach Using Open Street View Data
by: Menglin Wu, et al.
Published: (2025-01-01) -
Heritage routes and multiple narratives. The Inca Road System (Qhapaq Ñan, Camino principal andino / Andean road system): a specific case of a non-tourism heritage route?
by: Elodie Salin
Published: (2021-12-01) -
Graph Coarsening Approach to the Vehicle Routing Problem: An Approximation Strategy
by: Katarzyna Nalecz-Charkiewicz, et al.
Published: (2025-01-01)