Version 5 (modified by 13 years ago) ( diff ) | ,
---|
Distributed Compact Routing
- Routes over arbitrary names rather than location-dependent addresses
- Disco: Distributed Compact Routing
- Flexible mobility
- Flexible multi-homing
- Easier management
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.