1. Implementing Declarative Overlays Boon Thau Loo 1 Tyson Condie 1, Joseph M. Hellerstein 1,2, Petros Maniatis 2, Timothy Roscoe 2, Ion Stoica 1 1 University of California at Berkeley, 2 Intel Research Berkeley

2. 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 Overlay networks are an integral part of many large-scale distributed systems.

3. 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

4. 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

5. Outline Overview of P2 Architecture By Example Data Model Dataflow framework Query Language Chord Additional Benefits Overlay Introspection Automatic Optimizations Conclusion

6. Traditional Overlay Node Overlay Program Packets Out Packets In

7. P2 Overlay Node Overlay description: dataflow scripting language Runtime dataflows maintain network state Overlay description: declarative query language Planner P2 Query Processor Packets Out Packets In Overlay Program

8. 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

9. 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)

10. Dataflow framework Dataflow graph C++ dataflow elements Similar to Click: Flow elements (mux, demux, queues) Network elements (cc, retry, rate limitation) In addition: Relational operators (joins, selections, projections, aggregation)

11. Outline Overview of P2 Architecture By Example Data Model Dataflow framework Query Language Chord in P2 Additional Benefits Overlay Introspection Automatic Optimizations Conclusion Simple ring routing example

12. Example: Ring Routing Each node has an address and an identifier Each object has an identifier. Every node knows its successor Objects served by successor

13. Ring State node(IP 40,40) succ(IP 40,58,IP 58 ) node(IP 58,58) succ(IP 58,60,IP 60 ) Stored tables: node(NAddr, N) succ(NAddr, Succ, SAddr)

14. Example: Ring lookup Find the responsible node for a given key k? n.lookup(k) if k in (n, n.successor) return n.successor.addr else return n.successor. lookup(k)

15. lookup(IP 40,IP 37,59) Ring Lookup Events node(IP 40,40) succ(IP 40,58,IP 58 ) Event streams: lookup(Addr, Req, K) response(Addr, K, Owner) lookup(IP 37,IP 37,59) response(IP 37,59,IP 60 ) lookup(IP 58,IP 37,59) node(IP 58,58) succ(IP 58,60,IP 60 ) n.lookup(k) if k in (n, n.successor) return n.successor.addr else return n.successor. lookup(k)

16. Pseudocode Dataflow Strands Pseudocode: n.lookup(k) if k in (n, n.successor) return n.successor.addr else return n.successor. lookup(k)

17. Dataflow Strand Event Stream Actions Element 1 Element 2 Element n Event: Incoming network messages, periodic timers … Strand Elements Condition: Process event using strand elements Action: Outgoing network messages, local table updates

18. Pseudocode Strand 1 n.lookup(k) if k in (n, n.successor) return n.successor.addr else return n.successor.lookup(k) RECEIVE lookup(NAddr, Req, K) Stored tables node(NAddr, N) succ(NAddr, Succ, SAddr) Event streams lookup(Addr, Req, K) response(Addr, K, Owner) node(NAddr, N) & succ(NAddr, Succ, SAddr) & K in (N, Succ] SEND response(Req, K, SAddr) to Req Event: Condition: Action:

19. Pseudocode to Strand 1 Event: RECEIVE lookup(NAddr, Req, K) Condition: node(NAddr, N) & succ(NAddr, Succ, SAddr) & K in (N, Succ] Action: SEND response(Req, K, SAddr) to Req Match lookup.Addr = node.Addr Match lookup.Addr = succ.Addr lookup Filter K in (N,Succ) Format Response(Req, K,SAddr) Response n.lookup(k) if k in (n, n.successor) return n.successor.addr else return n.successor. lookup(k) succnode Join Select Project Dataflow strand

20. Pseudocode to Strand 2 Event: RECEIVE lookup(NAddr, Req, K) Condition: node(NAddr, N) & succ(NAddr, Succ, SAddr) Join lookup.Addr = node.Addr Join lookup.Addr = succ.Addr Select K not in (N,Succ) & K not in (N, Succ] lookup Action: SEND lookup(SAddr, Req, K) to SAddr Project lookup(SAddr, Req,K) lookup n.lookup(k) if k in (n, n.successor) return n.successor.addr else return n.successor. lookup(k) node succ Dataflow strand

21. Strand Execution lookup lookup/ response lookup response

22. Actual Chord Lookup Dataflow

23. Query Language: Overlog SQL equivalent for overlay networks Based on Datalog: Declarative recursive query language Well-suited for querying properties of graphs Well-studied in database literature Static analysis, optimizations, etc Extensions: Data distribution, asynchronous messaging, periodic timers and state modification

24. Query Language: Overlog Datalog rule syntax:,, …,. Overlog rule syntax:,, …,.

25. Query Language: Overlog Event: RECEIVE lookup(NAddr, Req, K) Condition: lookup(NAddr, Req, K) & node(NAddr, N) & succ(NAddr, Succ, SAddr) & K in (N, Succ] Action: SEND response(Req, K, SAddr) to Req response@Req(Req, K, SAddr) lookup@NAddr(Naddr, Req, K), node@NAddr(NAddr, N), succ@NAddr(NAddr, Succ, SAddr), K in (N,Succ]. Overlog rule syntax:,, …,.

26. P2-Chord Chord Routing, including: Multiple successors Stabilization Optimized finger maintenance Failure recovery 47 OverLog rules 13 table definitions Other examples: Narada, flooding, routing protocols 10 pt font

27. Performance Validation Experimental Setup: 100 nodes on Emulab testbed 500 P2-Chord nodes Main goals: Validate expected network properties

28. Sanity Checks Logarithmic diameter and state (correct) BW-efficient: 300 bytes/s/node

29. Churn Performance Metric: Consistency [Rhea at al] P2-Chord: P2-Chord@64mins: 97% consistency P2-Chord@16mins: 84% consistency P2-Chord@8min: 42% consistency Hand-crafted Chord: MIT-Chord@47mins: 99.9% consistency Outperforms P2 under higher churn Not intended to replace a carefully hand- crafted Chord

30. Benefits of P2 Introspection with Queries Automatic optimizations Reconfigurable Transport (WIP)

31. Introspection with Queries Unifying framework for debugging and implementation Same query language, same platform Execution tracing/logging Rule and dataflow level Log entries stored as tuples and queried Correctness invariants, regression tests as queries: Is the Chord ring well formed? (3 rules) What is the network diameter? (5 rules) Is Chord routing consistent? (11 rules) With Atul Singh (Rice) and Peter Druschel (MPI)

32. Automatic Optimizations Application of traditional Datalog optimizations to network routing protocols (SIGCOMM 2005) Multi-query sharing: Common subexpression elimination Caching and reuse of previously computed results Opportunistically share message propagation across rules Join lookup.Addr = node.Addr Join lookup.Addr = succ.Addr lookup Select K not in (N,Succ) Project lookup(SAddr, Req,K) lookup Project Response(Req, K,SAddr) Select K in (N,Succ) response Join lookup.Addr = node.Addr lookup Join lookup.Addr = succ.Addr

33. Automatic Optimizations Cost-based optimizations Join ordering affects performance Join lookup.Addr = node.Addr Join lookup.Addr = succ.Addr Select K not in (N,Succ) lookup Project lookup(SAddr,R eq,K) lookup Project Response(Req, K,SAddr) Select K in (N,Succ) response Join lookup.Addr = node.Addr Join lookup.Addr = succ.Addr

34. Open Questions The role of rapid prototyping? How good is good enough performance for rapid prototypes? When do developers move from rapid prototypes to hand-crafted code? Can we get achieve production quality overlays from P2?

35. Future Work Right language Formal data and query semantics Static analysis Optimizations Termination Correctness

36. Conclusion P2: Declarative Overlays Tool for rapid prototyping new overlay networks Declarative Networks Research agenda: Specify and construct networks declaratively Declarative Routing : Extensible Routing with Declarative Queries (SIGCOMM 2005)

37. Thank You http://p2.cs.berkeley.edu

38. Latency CDF for P2-Chord Median and average latency around 1s.