Presentation is loading. Please wait.

Presentation is loading. Please wait.

Auction-based in-network caching in Information-centric networks Workshop ACROSS, 16th of September 2016 | Lucia D’Acunto.

Similar presentations


Presentation on theme: "Auction-based in-network caching in Information-centric networks Workshop ACROSS, 16th of September 2016 | Lucia D’Acunto."— Presentation transcript:

1 Auction-based in-network caching in Information-centric networks Workshop ACROSS, 16th of September 2016 | Lucia D’Acunto

2 Background on ICN

3 Fundamentally, tODAY’s Internet is still a telephony network
LTR template :22 Fundamentally, tODAY’s Internet is still a telephony network It was build to share resources, not data. The central abstraction is a host identifier. The fundamental communication model is a point-to-point conversation between two hosts You want to call someone: you find her telephone number You want to download a file: you find its telephone number IP address HOST-oriented Information Centric Networking, TNO

4 Alternative: Information-Centric Networking
named data instead of the servers on which it is stored User: hey, Network, I am interested in this information: /lucia/presentations/icn.pptx Network: OK, User, I will find out where a copy of it is store and deliver it to you Information Centric Networking, TNO

5 Advantages of Information-Centric Networking
Efficiency Content can be cached anywhere in the network Security Instead of protecting connections, you protect the data itself Flexibility Agnostic to the underlying network (whether IP-based, Bluetooth, infrared or…) Information Centric Networking, TNO

6 ICN Architecture: Names
Flat or hierarchical icn.pptx or /lucia/presentations/icn.pptx Name hierarchy indicates membership The same information can have many names, but a certain name can only represent one data object Information Centric Networking, TNO

7 ICN Architecture: messages
1 Interest Packet sent, 1 Data Packet received Information Centric Networking, TNO

8 ICN Architecture: data structures
Pending Interest Table (PIT) Name Incoming Outgoing /lucia/presentations/icn.pptx in01 out01 /netflix/video.mp4 in02 out03 /netherlands/delft/temperature out04 Forward Information Base (FIB) Content Store (CS) Name Outgoing /lucia/presentations/icn.pptx out01 /tno/departments/ out02 /netherlands/delft/ out04 Name Data /lucia/presentations/streaming.pptx /netflix/video1.mp4 /tudelft/ewi/faculties.txt Information Centric Networking, TNO

9 In-network caching Cache placement Content placement Capacity? Where?
Which content? Where? Our focus Information Centric Networking, TNO

10 BidCache: Auction-based in-network caching in ICN
Information Centric Networking, TNO

11 Content placement: challenges
Need to know what neighbouring caches have stored Global optimization problem Which content? Where? The greatest possible collection of popular items Cache near requesters Information Centric Networking, TNO

12 Content placement: challenges
Global optimization problem Large overhead Not scalable (especially in high mobility scenarios) Focus on heuristics Usually based on cache’s local view Individual caching decision Information Centric Networking, TNO

13 auctioning the right to cache
Auction based in-network caching in ICN Similar cost as the heuristics algorithms based on individual caching decision But using some global information Decision to cache is not individual, but coordinated through an auction The bid can be based on a combination of local parameters (LRU, cache size, etc) request context (e.g. hops from receiver, link delay, etc) Information Centric Networking, TNO

14 Bidding through interest messages
Information Centric Networking, TNO

15 Communicating auction winner via data messages
Information Centric Networking, TNO

16 Results – different popularity distributions
Bid value = LRU + HOP count Tree topology RCC = Content popularity skewness Information Centric Networking, TNO

17 Results – different Relative caching capacities
Bid value 1 = LRU + HOP count Bid value 2 = LRU + Link Delay Barabasi-Albert topology α = 0.8 Information Centric Networking, TNO

18 Results – End-to-End latency
Barabasi-Albert topology α = 0.8 Information Centric Networking, TNO

19 Future work More realistic scenarios Source mobility
Realistic traffic distribution with temporal / topological variations Upgraded versions of BidCache (based on more parameters) Source mobility Robustness analysis Information Centric Networking, TNO

20 THANK YOU FOR YOUR ATTENTION LTR Information-Centric Networking


Download ppt "Auction-based in-network caching in Information-centric networks Workshop ACROSS, 16th of September 2016 | Lucia D’Acunto."

Similar presentations


Ads by Google