Network protocol scalability via a topological Kadanoff transformation

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
4 pages, 5 figures, PhysComNet 2008 workshop submission

Keywords

Networking and Internet Architecture, Statistical Mechanics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/157458

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0803.3742
 http://arxiv.org/abs/0803.3742

Collections

arXiv