Files in this item



application/pdfMOve Design of ... tion-Malleable Overlay.pdf (221kB)
(no description provided)PDF


Title:MOve: Design of An Application-Malleable Overlay
Author(s):Monnet, Sebastien; Morales, Ramses V.; Antoniu, Gabriel; Gupta, Indranil
distributed applications
Peer-to-Peer Systems
Abstract:Peer-to-peer overlays allow distributed applications to work in a wide-area, scalable, and faulttolerant manner. However, most structured and unstructured overlays present in literature today are inflexible from the application viewpoint. In other words, the application has no control over the structure of the overlay itself. This paper proposes the concept of an application-malleable overlay, and the design of the first malleable overlay which we call MOve. In MOve, the communication characteristics of the distributed application using the overlay can influence the overlay's structure itself, with the twin goals of (1) optimizing the application performance by adapting the overlay, while also (2) retaining the large scale and fault tolerance of the overlay approach. The influence could either be explicitly specified by the application or implicitly gleaned by our algorithms. Besides neighbor list membership management, MOve also contains algorithms for resource discovery, update propagation, and churn-resistance. The emergent behavior of the implicit mechanisms used in MOve manifests in the following way: when application communication is low, most overlay links keep their default configuration; however, as application communication characteristics become more evident, the overlay gracefully adapts itself to the application.
Issue Date:2006-05
Genre:Technical Report
Other Identifier(s):UIUCDCS-R-2006-2723
Rights Information:You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).
Date Available in IDEALS:2009-04-21

This item appears in the following Collection(s)

Item Statistics