Version 9 (modified by 13 years ago) ( diff ) | ,
---|
Distributed Compact Routing
- Routes over arbitrary names rather than location-dependent addresses (hierarchy independent)
- Disco: Distributed Compact Routing
- Flexible mobility
- Flexible multi-homing
- Easier management
Why Disco |
For general networks, the common scaling technique is hierarchy: routing is performed over high-level aggregate units until it reaches the destination's unit, at which point routing proceeds at a finer granularity. For example, the Internet routes at the level of IP prefixes to a destination domain, and then over an intra-domain routing protocol to a subnet.
Problem with Hierarchy
- First, it can have arbitrarily high stretch, defi ned as the ratio of route length to the shortest path length. Simultaneously guaranteeing scalability and low stretch on arbitrary networks is a nontrivial problem which no deployed routing protocols achieve.
- Location dependent addressing complicating mobility, management and multi-homing
To build state |
- Pick random neighbors in G(t) to build overlay
- Gossip in overlay to send address to n1/2 nodes
To route from s to t |
- Check V(s). If t isn’t there, then...
- w = node in both V(t) and G(t)
- Route to w and from there to t via NDDisco: provable stretch ≤ 7
- Subsequent packets follow NDDisco: stretch ≤ 3
Note:
See TracWiki
for help on using the wiki.