Content-peering Dynamics of Autonomous Caches in a Content-centric - PowerPoint PPT Presentation

Introduction Model Perfect Information Imperfect Information Conclusions Content-peering Dynamics of Autonomous Caches in a Content-centric Network Valentino Pacifici, Gy¨ orgy D´ an Laboratory for Communication Networks School of Electrical Engineering KTH, Royal Institute of Technology Stockholm - Sweden Stockholm, December 13, 2012 V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 1 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Content-centric Networks • Caches part of the protocol stack • Existing research optimizes global performance ◦ Cache dimensioning ◦ Efficient routing ◦ Efficient cache eviction policies V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 2 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Content-centric Networks ISP 1 ISP 3 ISP 2 • Caches part of the protocol stack • Existing research optimizes global performance ◦ Cache dimensioning ◦ Efficient routing ◦ Efficient cache eviction policies V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 2 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Content-centric Networks ISP 1 ISP 3 ISP 2 • Caches part of the protocol stack • Existing research optimizes global performance ◦ Cache dimensioning ◦ Efficient routing ◦ Efficient cache eviction policies V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 2 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Content-centric Networks ISP 1 ISP 3 ISP 2 • Networks of caches optimized for local performance • Decrease transit traffic costs through content-level peering • New challenges: ◦ Stability of cache content ◦ Coordination among ASes ◦ Effect of eviction V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 2 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Modeling the Interaction among ASes C 3 ISP 1 ISP 3 C 1 ½O C 2 ISP 2 o ∈ O V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 3 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Modeling the Interaction among ASes C 3 ISP 1 ISP 3 C 1 ½O C 2 ISP 2 o ∈ O V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 3 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Modeling the Interaction among ASes C 3 ISP 1 ISP 3 C 1 ½O C 2 ISP 2 o ∈ O V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 3 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Modeling the Interaction among ASes C 3 ISP 1 ISP 3 C 1 ½O C 2 ISP 2 o ∈ O V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 3 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Modeling the Interaction among ASes C 3 ISP 1 ISP 3 C 1 ½O C 2 ISP 2 o ∈ O • Each ISP optimizes its internal network through ◦ Routing of content and interest messages ◦ Cache dimensioning and eviction policies V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 3 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Modeling the Interaction among ASes C 3 ISP 1 ISP 3 C 1 ½O C 2 ISP 2 o ∈ O • Each ISP optimizes its internal network through ◦ Routing of content and interest messages ◦ Cache dimensioning and eviction policies ⇓ • L i = H i ∪ C i → content available at ISP i • R i = � j ∈N ( i ) L j → content available from the peering ISPs V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 3 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Modeling the Interaction among ASes • Interest messages (i.m.) for item o at ISP i ◦ w o i ∈ R + → average arrival intensity ◦ Independent Reference Model (IRM): i ( x ) = 1 − e − w o • inter arrival times ∼ F o i x V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 4 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Modeling the Interaction among ASes • Interest messages (i.m.) for item o at ISP i ◦ w o i ∈ R + → average arrival intensity ◦ Independent Reference Model (IRM): i ( x ) = 1 − e − w o • inter arrival times ∼ F o i x • Unit cost of serving item o at ISP i ◦ α i if o available locally or at peering ISP ( o ∈ L i ∪ R i ) ◦ γ i if o retrieved from a transit link ( o / ∈ L i ∪ R i ) V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 4 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Modeling the Interaction among ASes • Interest messages (i.m.) for item o at ISP i ◦ w o i ∈ R + → average arrival intensity ◦ Independent Reference Model (IRM): i ( x ) = 1 − e − w o • inter arrival times ∼ F o i x • Unit cost of serving item o at ISP i ◦ α i if o available locally or at peering ISP ( o ∈ L i ∪ R i ) ◦ γ i if o retrieved from a transit link ( o / ∈ L i ∪ R i ) Total cost for ISP i : � w o � w o C i ( C i , C − i ) = α i i + γ i i , L i ∪R i O � {L i ∪R i } V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 4 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Coordinated Content-peering • Peering ISPs periodically exchange Summary cache L i • Upon interest message for item o at ISP i : ◦ if o ∈ L i → the item is served ◦ if o ∈ R i → i.m. forwarded to a peer ◦ if o / ∈ R i → i.m. forwarded to transit provider V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 5 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Coordinated Content-peering • Peering ISPs periodically exchange Summary cache L i • Upon interest message for item o at ISP i : ◦ if o ∈ L i → the item is served ◦ if o ∈ R i → i.m. forwarded to a peer ◦ if o / ∈ R i → i.m. forwarded to transit provider a a 1 2 Figure: No content-peering V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 5 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Coordinated Content-peering • Peering ISPs periodically exchange Summary cache L i • Upon interest message for item o at ISP i : ◦ if o ∈ L i → the item is served ◦ if o ∈ R i → i.m. forwarded to a peer ◦ if o / ∈ R i → i.m. forwarded to transit provider a a a a 1 2 1 2 Figure: No content-peering Figure: Content-peering V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 5 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Coordinated Content-peering • Peering ISPs periodically exchange Summary cache L i • Upon interest message for item o at ISP i : ◦ if o ∈ L i → the item is served ◦ if o ∈ R i → i.m. forwarded to a peer ◦ if o / ∈ R i → i.m. forwarded to transit provider a a 1 2 1 2 b b Figure: No content-peering Figure: Content-peering V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 5 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Coordinated Content-peering • Peering ISPs periodically exchange Summary cache L i • Upon interest message for item o at ISP i : ◦ if o ∈ L i → the item is served ◦ if o ∈ R i → i.m. forwarded to a peer ◦ if o / ∈ R i → i.m. forwarded to transit provider a a a a 1 2 1 2 Figure: No content-peering Figure: Content-peering V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 5 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Coordinated Content-peering • Peering ISPs periodically exchange Summary cache L i • Upon interest message for item o at ISP i : ◦ if o ∈ L i → the item is served ◦ if o ∈ R i → i.m. forwarded to a peer ◦ if o / ∈ R i → i.m. forwarded to transit provider a a a a 1 2 1 2 Figure: No content-peering Figure: Content-peering • Need for algorithms to reach stable allocation V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 5 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Coordinated Content-peering • Peering ISPs periodically exchange Summary cache L i • Upon interest message for item o at ISP i : ◦ if o ∈ L i → the item is served ◦ if o ∈ R i → i.m. forwarded to a peer ◦ if o / ∈ R i → i.m. forwarded to transit provider a a a a 1 2 1 2 Figure: No content-peering Figure: Content-peering • Need for algorithms to reach stable allocation perfect information : Perfect estimation of w o i V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 5 / 12

Introduction Model Perfect Information Imperfect Information Conclusions Cache-or-Wait ( CoW ) Algorithm • Independent set I ⊆ N : it does not contain peering ISPs V. Pacifici, G. D´ an (EE,KTH) LCN Seminar 2012 December 13, 2012 6 / 12