Network protocol scalability via a topological Kadanoff transformation

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-50039

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.