Network protocol scalability via a topological Kadanoff transformation

TL;DR

This paper introduces a hierarchical network topology abstraction method inspired by physics, using a recursive approach and path diversity units to improve network routing scalability.

Contribution

It proposes a novel hierarchical framework based on Kadanoff transformation principles, linking network topology abstraction with renormalisation group concepts.

Findings

Recursive network abstraction enhances scalability.

A generic recursive routing protocol family is developed.

The approach captures key properties of network interactions.

Abstract

A natural hierarchical framework for network topology abstraction is presented based on an analogy with the Kadanoff transformation and renormalisation group in theoretical physics. Some properties of the renormalisation group bear similarities to the scalability properties of network routing protocols (interactions). Central to our abstraction are two intimately connected and complementary path diversity units: simple cycles, and cycle adjacencies. A recursive network abstraction procedure is presented, together with an associated generic recursive routing protocol family that offers many desirable features.