On the Memory Requirement of Hop-by-hop Routing: Tight Bounds and Optimal Address Spaces

Kőrösi, Attila and Gulyás, András and Heszberger, Zalán and Bíró, József and Rétvári, Gábor (2020) On the Memory Requirement of Hop-by-hop Routing: Tight Bounds and Optimal Address Spaces. IEEE/ACM Transactions on Networking, 28 (3). pp. 1353-1363. ISSN 1063-6692 (print); 1558-2566 (online)

Preview

Text routing_entropy.pdf Available under License Creative Commons Attribution. Download (394kB) | Preview

Abstract

Routing in large-scale computer networks today is built on hop-by-hop routing: packet headers specify the destination address and routers use internal forwarding tables to map addresses to next-hop ports. In this paper we take a new look at the scalability of this paradigm. We define a new model that reduces forwarding tables to sequential strings, which then lend themselves readily to an information-theoretical analysis. Contrary to previous work, our analysis is not of worst-case nature, but gives verifiable and realizable memory requirement characterizations even when subjected to concrete topologies and routing policies. We formulate the optimal address space design problem as the task to set node addresses in order to minimize certain network-wide entropy-related measures. We derive tight space bounds for many well-known graph families and we propose a simple heuristic to find optimal address spaces for general graphs. Our evaluations suggest that in structured graphs, including most practically important network topologies, significant memory savings can be attained by forwarding table compression over our optimized address spaces. According to our knowledge, our work is the first to bridge the gap between computer network scalability and information-theory.

Actions (login required)

Edit Item