Network protocol scalability via a topological Kadanoff transformation

Simple item page
dc.creatorConstantinou, C. C.
dc.creatorStepanenko, A. S.
dc.date2008-03-26
dc.date.accessioned2026-07-07T09:28:26Z
dc.date.available2026-07-07T09:28:26Z
dc.descriptionA 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.
dc.description4 pages, 5 figures, PhysComNet 2008 workshop submission
dc.identifierhttps://arxiv.org/abs/0803.3742
dc.identifierhttp://arxiv.org/abs/0803.3742
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/157458
dc.subjectNetworking and Internet Architecture
dc.subjectStatistical Mechanics
dc.titleNetwork protocol scalability via a topological Kadanoff transformation
dc.typetext

Files

Collections

arXiv