Computer Science – Networking and Internet Architecture
Scientific paper
2008-03-26
Computer Science
Networking and Internet Architecture
4 pages, 5 figures, PhysComNet 2008 workshop submission
Scientific paper
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.
Constantinou Constantinos
Stepanenko Alexander S.
No associations
LandOfFree
Network protocol scalability via a topological Kadanoff transformation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Network protocol scalability via a topological Kadanoff transformation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network protocol scalability via a topological Kadanoff transformation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-50039