The BGP routing table continues to grow. Reducing the table size means that memory can be made available for other in-router processing. Compact routing provides a method for reducing table size whilst sacrificing the shortest path property. We propose a deployable compact routing scheme and consider the challenges of such an implementation. We evaluate using large-scale emulations and compare against current routing protocols.
Funding
Loughborough University
History
School
Science
Department
Computer Science
Published in
Proceedings of the on CoNEXT Student Workshop 2023
Pages
13 - 14
Source
CoNEXT 2023: The 19th International Conference on emerging Networking EXperiments and Technologies