routing policies in named data networking
DESCRIPTION
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. - PowerPoint PPT PresentationTRANSCRIPT
Routing Policies in Named Data Networking
Steve DiBenedettoChristos Papadopoulos
Dan Massey
2
Introduction
• Inter-domain routing is policy-based
• ICNs may lead to new & interesting policies
B
A DC
Business Relations – Gao ‘00• Policies are defined by economic incentives– Selection– Propagation
CU
AT&T Level 3Peers
CSUSiblings
Prov
ider
Cust
omer
Route Selection
• Prefer 1. Customers 2. Peers3. Providers
Self
Provider
Customer
Peer
Destination
Propagation: Valley-Free
• After a provider customer or peer peer edge– No customer provider edges– No Peer peer edges
0
2
1 3
0
21
3
4
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
• Determine subset of interfaces to forward out
R1X
C1
Popular Video
R2
C2
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
CU
AT&T Level 3Peers
CSUSiblings
Prov
ider
Cust
omer
16
Multi-Path Incentives
• Using multiple paths = paying multiple times• Need to choose between cost & robustness
P1 P2
C
$8/Mb $10/Mb
Popular Video
$4/Mb$2/Mb
17
Caching Incentives
• Little incentive for (some) providers to cache
P1 P2
C1 C2Content
P2 profits sending traffic to C2P1 wants traffic balance
C1 wants to save $$$
18
Cache Sharing
• Limit access to cache & customers’ content– Reciprocity agreements
• Provides “discount” multi-path options
P2
C
X
Video #2
Video #1
R
P1
19
Routing Rebates
• Offer cached content to provider to reduce bill– Like solar power & rolling back meter
P1 P2
C
Popular Video
Video: $1/Mb
20
PIT Policies
• Race condition between Interests• May raise SLA conflicts
P
R1X
Popular Video
R2
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?
