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

Slides:



Advertisements
Similar presentations
Panel: ICN Architecture Overview Cedric Westphal Huawei Innovations
Advertisements

Data and Computer Communications
Multimedia and Mobile communications Laboratory CCN 1 DK Han Junghwan Song Computer Networks Practice.
Content Centric Networking in Tactical and Emergency MANETs Soon Y. Oh, Davide Lau, and Mario Gerla Computer Science Department University of California,
Cis e-commerce -- lecture #6: Content Distribution Networks and P2P (based on notes from Dr Peter McBurney © )
Professor Michael J. Losacco CIS 1150 – Introduction to Computer Information Systems Communications and Networks Chapter 8.
1 Network Layer: Host-to-Host Communication. 2 Network Layer: Motivation Can we built a global network such as Internet by extending LAN segments using.
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
Proxy-assisted Content Sharing Using Content Centric Networking (CCN) for Resource-limited Mobile Consumer Devices Jihoon Lee, Dae Youb Kim IEEE Transactions.
ICS362 Distributed Systems Dr Ken Cosh Week 5. Review Communication – Fundamentals – Remote Procedure Calls (RPC) – Message Oriented Communication – Stream.
WINLAB Comparing Alternative Approaches for Networking of Named Objects in the Future Internet Akash Baid, Tam Vu, Dipankar Raychaudhuri WINLAB, Rutgers.
Introduction to Network Layer. Network Layer: Motivation Can we built a global network such as Internet by extending LAN segments using bridges? –No!
Networked Information Systems 1 Advantages of and classified by their size & architecture or design.
1 Chapter 6: Proxy Server in Internet and Intranet Designs Designs That Include Proxy Server Essential Proxy Server Design Concepts Data Protection in.
CCNA 1 Module 10 Routing Fundamentals and Subnets.
2: Application Layer1 Chapter 2 outline r 2.1 Principles of app layer protocols r 2.2 Web and HTTP r 2.3 FTP r 2.4 Electronic Mail r 2.5 DNS r 2.6 Socket.
ComNets Tutorial: Future Internet with Information Centric Networks Asanga Udugama (1), Carmelita Goerg (1) and Andreas Timm-Giel (2) (1) Communications.
Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.
Martin-1 CSE 5810 CSE 5810 Individual Research Project: Integration of Named Data Networking for Improved Healthcare Data Handling Robert Martin Computer.
Data Oriented Network Architecture (DONA) Andrey Ermolinskiy Mohit Chawla CS 262 A Project Poster December 14.
Computer Networks with Internet Technology William Stallings
Review of the literature : DMND:Collecting Data from Mobiles Using Named Data Takashima Daiki Park Lab, Waseda University, Japan 1/15.
Othman Othman M.M., Koji Okamura Kyushu University 1.
CSCI 465 D ata Communications and Networks Lecture 15 Martin van Bommel CSCI 465 Data Communications & Networks 1.
Adaptive Web Caching CS411 Dynamic Web-Based Systems Flying Pig Fei Teng/Long Zhao/Pallavi Shinde Computer Science Department.
《 Hierarchical Caching Management for Software Defined Content Network based on Node Value 》 Reporter : Jing Liu , China Affiliation : University of Science.
Networking 2012 On inter-domain name resolution for information-centric networks K.V. Katsaros, N. Fotiou, X. Vasilakos, C.N. Ververidis, C. Tsilopoulos,
Chapter 19 Binding Protocol Addresses (ARP) A frame transmitted across a physical network must contain the hardware address of the destination. Before.
This paper appears in: Computer Communications and Networks, ICCCN Proceedings.15th International Conference on 指導教授 : 許子衡 報告者 : 黃群凱 1.
Multimedia & Mobile Communications Lab.
Networking Named Content Van Jacobson, Diana K. Smetters, James D. Thornton, Michael F. Plass, Nicholas H. Briggs, Rebecca L. Braynard.
TELE202 Lecture 6 Routing in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »Packet switching in Wide Area Networks »Source: chapter 10 ¥This Lecture.
OSPF Open Shortest Path First. Table of Content  IP Routes  OSPF History  OSPF Design  OSPF Link State  OSPF Routing Table  OSPF Data Packets.
Content Routing Protocol Design Karthikeyan Ganesan Shruti Venkatesh Rafay Zamir.
ECE 544 Project3 Group 9 Brien Range Sidhika Varshney Sanhitha Rao Puskuru.
Overlay Networks : An Akamai Perspective
On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.
Management of Broadband Media Assets on Wide Area Networks Lars-Olof Burchard.
Future Internet with Information Centric Networks
Why Is It All?  A Network is a set of connected devices. Whenever we have multiple devices, we have the problem of how to connect them to make one-to-one.
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Named Data Networking – A Future Internet Architecture
Behrouz A. Forouzan TCP/IP Protocol Suite, 3rd Ed.
COMPUTER NETWORKS CS610 Lecture-27 Hammad Khalid Khan.
Network Cost Services for Network-Aware FI Applications
The Underlying Technologies
Notes Onur Ascigil, Vasilis Sourlas, Ioannis Psaras, and George Pavlou
NDN (Named Data Networking)
Packet Switching Outline Store-and-Forward Switches
Peer-to-Peer Data Management
Peer-to-peer networking
Implementation of GPU based CCN Router
Internet Networking recitation #12
A Survey of Routing Techniques for Mobile Communication Networks
Turning Heterogeneity into an Advantage in Overlay Routing
Ad hoc Routing Protocols
An Introduction to Computer Networking
Introduction There are many situations in which we might use replicated data Let’s look at another, different one And design a system to work well in that.
Evaluating Proxy Caching Algorithms in Mobile Environments
Consideration on applying ICN to Edge Computing
Network Architecture for Cyberspace
Distributed Systems CS
Outline Review of Quiz #1 Distributed File Systems 4/20/2019 COP5611.
Packet Switching Outline Store-and-Forward Switches
EE 122: Lecture 22 (Overlay Networks)
COMPUTER NETWORKS CS610 Lecture-29 Hammad Khalid Khan.
COMPUTER NETWORKS CS610 Lecture-16 Hammad Khalid Khan.
Delivery, Forwarding, and Routing of IP Packets
ECE 544 Project3 Dheeraj Medikonda Ravi Chandra Godavarthi 1.
Distributed Systems CS
Presentation transcript:

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

Background on ICN

Fundamentally, tODAY’s Internet is still a telephony network LTR template 9-5-2018 7: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

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

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

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

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

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 0100010111010… /netflix/video1.mp4 1110010001110… /tudelft/ewi/faculties.txt 1010011110011… … Information Centric Networking, TNO

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

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

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

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

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

Bidding through interest messages Information Centric Networking, TNO

Communicating auction winner via data messages Information Centric Networking, TNO

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

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

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

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

THANK YOU FOR YOUR ATTENTION LTR Information-Centric Networking