Customizable Routing with Declarative Queries.pptVIP

Implementing Declarative Overlays Boon Thau Loo1 Tyson Condie1, Joseph M. Hellerstein1,2, Petros Maniatis2, Timothy Roscoe2, Ion Stoica1 1University of California at Berkeley, 2Intel Research Berkeley Overlays Everywhere… Overlay networks are widely used today: Routing and forwarding component of large-scale distributed systems Provide new functionality over existing infrastructure Many examples, variety of requirements: Packet delivery: Multicast, RON Content delivery: CDNs, P2P file sharing, DHTs Enterprise systems: MS Exchange Problem Non-trivial to design, build and deploy an overlay correctly: Iterative design process: Desired properties ? Distributed algorithms and protocols ? Simulation ? Implementation ? Deployment ? Repeat… Each iteration takes significant time and utilizes a variety of expertise The Goal of P2 Make overlay development more accessible: Focus on algorithms and protocol designs, not the implementation Tool for rapid prototyping of new overlays: Specify overlay network at a high level Automatically translate specification to protocol Provide execution engine for protocol Aim for “good enough” performance Focus on accelerating the iterative design process Can always hand-tune implementation later Outline Overview of P2 Architecture By Example Data Model Dataflow framework Query Language Chord Additional Benefits Overlay Introspection Automatic Optimizations Conclusion Traditional Overlay Node P2 Overlay Node Advantages of the P2 Approach Declarative Query Language Concise/high level expression Statically checkable (termination, correctness) Ease of modification Unifying framework for introspection and implementation Automatic optimizations Query and dataflow level Data Model Relational data: relational tables and tuples Two kinds of tables: Stored, soft state: E.g. neighbor(Src,Dst), forward(Src,Dst,NxtHop) Transient streams: Network messages: message (Rcvr, Dst) Local timer-based events: periodic (NodeID,10) Dataflow framework Dataflo