Towards Robust Internet Applications: Self-Organizing Overlays

John Risson, Tim Moors · 2005

Self-organizing overlays based on distributed hash tables (DHTs) are set to make Internet applications more robust. They can improve system dependability, evolve smoothly from small configurations, and scale to massive configurations. Application case studies are presented to illustrate weaknesses of current architectures and to show how overlays can improve robustness-cost tradeoffs. The case studies include email, next generation voice and mobile networks based on the Session Initiation Protocol (SIP), network access protocols like Radius and Diameter, and publish/subscribe middleware. A program of work is outlined to transition overlay technology from the laboratory to industry.

Read the paper · More papers on PaperTik