Abstract
Overlay networks are used today in a variety of distributed systems ranging from file-sharing and storage systems to communication infrastructures. However, designing, building and adapting these overlays to the intended application and the target environment is a difficult and time consuming process.To ease the development and the deployment of such overlay networks we have implemented P2, a system that uses a declarative logic language to express overlay networks in a highly compact and reusable form. P2 can express a Narada-style mesh network in 16 rules, and the Chord structured overlay in only 47 rules. P2 directly parses and executes such specifications using a dataflow architecture to construct and maintain overlay networks. We describe the P2 approach, how our implementation works, and show by experiment its promising trade-off point between specification complexity and performance. © 2005 ACM.
Author supplied keywords
Cite
CITATION STYLE
Loo, B. T., Condie, T., Hellerstein, J. M., Maniatis, P., Roscoe, T., & Stoica, I. (2005). Implementing declarative overlays. In Proceedings of the 20th ACM Symposium on Operating Systems Principles, SOSP 2005 (pp. 75–90). https://doi.org/10.1145/1095810.1095818
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.