1 / 24

Routing Policies in Named Data Networking

Routing Policies in Named Data Networking. Steve DiBenedetto Christos Papadopoulos Dan Massey. Introduction. Inter-domain routing is policy- based ICNs may lead to new & interesting policies. B. A. C. D. Business Relations – Gao ‘00. Peers. AT&T. Level 3. Provider. Customer.

titus
Download Presentation

Routing Policies in Named Data Networking

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Routing Policies in Named Data Networking Steve DiBenedetto Christos Papadopoulos Dan Massey

  2. Introduction • Inter-domain routing is policy-based • ICNs may lead to new & interesting policies B A C D

  3. Business Relations – Gao ‘00 Peers AT&T Level 3 Provider Customer Siblings CU CSU • Policies are defined by economic incentives • Selection • Propagation

  4. Route Selection Destination Provider Self Peer Customer • Prefer • Customers • Peers • Providers

  5. Propagation: Valley-Free 3 2 0 1 3 2 1 0 4 • After a provider  customer or peer  peer edge • No customer  provider edges • No Peer peer edges

  6. Motivation • Policy can guide Named Data Networking (NDN) routing research • No inter-domain protocol (yet) • Discuss possibilities and get real world feedback

  7. NDN Background • Route on content names • “Breadcrumbs” & de-duplication of requests • Cache retrieved data ? /nytimes.com/today

  8. Outline • NDN Policy Knobs • Economic Incentives & Policies • Conclusions

  9. Policy Knobs • Tunable parameters that control policy • IP Networking: Control plane knobs • Route selection & propagation • NDN: Control & Data plane knobs • Content Store (CS)/Cache • Pending Interest Table (PIT) • Forwarding Information Base (FIB)

  10. Control Plane Knobs • IP Networking: BGP • Path attributes select 1 best route • NDN: • Select multiple routes

  11. FIB Knob Popular Video • Determine subset of interfaces to forward out R2 R1 X C2 C1

  12. Content Store Knob: Cache Access • Allow: • Check CS and then PIT (if no match) • Cache Only • Drop if CS miss • Deny • Drop without check

  13. Data Packet Knobs • Forwarded Interests expect answers • Subject to “best effort” • Unsolicited content is dropped • Content policy = caching policy

  14. Outline • Policy Knobs • Economic Incentives & Policies • Conclusions

  15. Policies & Incentives • Policies driven by economic incentives • Guide route selection & propagation • Do not expect dramatic change in motivation Peers AT&T Level 3 Provider Customer Siblings CU CSU

  16. Multi-Path Incentives Popular Video • Using multiple paths = paying multiple times • Need to choose between cost & robustness P2 P1 $10/Mb $2/Mb $8/Mb $4/Mb C

  17. Caching Incentives • Little incentive for (some) providers to cache P1 P2 P2profits sending traffic to C2 P1wants traffic balance C1 C2 C1wants to save $$$ Content

  18. Cache Sharing Video #2 • Limit access to cache & customers’ content • Reciprocity agreements • Provides “discount” multi-path options P1 P2 R X Video #1 C

  19. Routing Rebates • Offer cached content to provider to reduce bill • Like solar power & rolling back meter Popular Video P1 P2 Video: $1/Mb C

  20. PIT Policies • Race condition between Interests • May raise SLA conflicts Popular Video P R2 X R1 C

  21. Outline • Policy Knobs • Economic Incentives & Policies • Conclusions

  22. Conclusions • Policy mostly tied to routing & Interests • NDN policy: control & data planes • Inter-domain multi-path raises policy questions • Caching benefits peers & customers • Need scalable way to share cache info!

  23. Going Forward • Still more policies/knobs to be realized • How to implement policies in NDN • Performance cost of policies? • Input needed! • Desirable knobs & policies?

  24. Thanks! • Email: dibenede@cs.colostate.edu

More Related