| ...there are efficient ways of constructing clustered representations of graphs that remain within a small factor of the original in terms of route lengths. Further, the authors show that this can be done in a distributed manner. This has lots (and lots) of potential applications - the typical example is for a compact routing scheme, where nodes can store smaller routing tables between clusters rather than between nodes. |
|
I saw mention today of the 2008 Edsger W. Dijkstra Prize. The winner was a 1990 paper which I remember reading and discussing in the early days of JXTA. The relevance to JXTA was in how it helped routing and validated P2P multihop routing as being capable of near optimal performance.
|
|
|
Comments:
Post a Comment:
Comments are closed for this entry.
| « December 2009 | ||||||
| Sun | Mon | Tue | Wed | Thu | Fri | Sat |
|---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | ||
6 | 7 | 8 | 9 | 10 | 11 | 12 |
13 | 14 | 15 | 16 | 17 | 18 | 19 |
20 | 21 | 22 | 23 | 24 | 25 | 26 |
27 | 28 | 29 | 30 | 31 | ||
| Today | ||||||
GeoURL
- Feeds
- Bernard Traversat
- David Clack
- Henry Jen
- Mark Petrovic
- Mitch Barnett
- Mohamed Abdelaziz
- Warren Strange
- java.net : bondolo
- Vanessa Williams
- Norman Walsh
Today's Page Hits: 111