Fundamental Limits of Heterogenous Cache: a Centralized Approach

Slides:



Advertisements
Similar presentations
Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff
Advertisements

HOW TO CHANGED PASSWORD. Step 1 : Login Login to the computer using staf username. Go to Start  Control Panel Click Mail.
ONLINE DATA UPLOAD INSTRUCTION
5/4/2006BAE Analog to Digital (A/D) Conversion An overview of A/D techniques.
“ Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks ”
Presented by Santhi Priya Eda Vinutha Rumale.  Introduction  Approaches  Video Streaming Traffic Model  QOS in WiMAX  Video Traffic Classification.
19 Historical overview Main challenge: How to distribute content in high quality over the Internet cost-effectively? • Traditional “Best-effort” model:
Toolbox Mirror -Overview Effective Distributed Learning.
Using one level of Cache:
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada Multimedia Streaming in Dynamic Peer-to-Peer Systems and Mobile Wireless.
Layered Range Multicast for Video On Demand Duc A. Tran Kien A. Hua Tai T. Do.
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Carnegie Mellon University Complex queries in distributed publish- subscribe systems Ashwin R. Bharambe, Justin Weisz and Srinivasan Seshan.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Simple queuing models (Sec )
Evaluation of Delivery Techniques for Dynamic Web Content Mor Naaman, Hector Garcia-Molina, Andreas Paepcke Department of Computer Science Stanford University.
1 Numerical ElectroMagnetics & Semiconductor Industrial Applications Ke-Ying Su Ph.D. National Central University Department of Mathematics 02. Method.
User Adoption Issues Server Admin Fundamentals Solutions to User Adoption Issues.
Mobile and Pervasive Computing Overview Material taken from: “Fundamental Challenges in Mobile Computing” and “Pervasive Computing: Vision and Challenges”
Professor OKAMURA Laboratory. Othman Othman M.M. 1.
2008/2/191 Customizing a Geographical Routing Protocol for Wireless Sensor Networks Proceedings of the th International Conference on Information.
1 Optimal Power Allocation and AP Deployment in Green Wireless Cooperative Communications Xiaoxia Zhang Department of Electrical.
By Qian Deng MobiUS: Enable Together-Viewing Video Experience across Two Mobile Devices.
1 Lesson 8: Basic Monte Carlo integration We begin the 2 nd phase of our course: Study of general mathematics of MC We begin the 2 nd phase of our course:
EE6610: Week 6 Lectures.
Kiew-Hong Chua a.k.a Francis Computer Network Presentation 12/5/00.
Adaptive Web Caching CS411 Dynamic Web-Based Systems Flying Pig Fei Teng/Long Zhao/Pallavi Shinde Computer Science Department.
Kenza Hamidouche, Mérouane Debbah
Saving Work to Your School Server Click through this presentation at your own speed. Use it as a review or a guide while saving a project.
Structured Program Development Angela Chih-Wei Tang ( 唐 之 瑋 ) Department of Communication Engineering National Central University JhongLi, Taiwan 2010.
The Configuration Factors between Ring Shape Finite Areas in Cylinders and Cones Cosmin DAN, Gilbert DE MEY.
Analytical Foundations of Networked Computing Kirstie Bellman, Luiz DaSilva, Robert Kleinberg, Michael Mahoney, Amin Saberi, Ion Stoica, Eva Tardos, Shanghua.
A P2P On-Demand Video Streaming System with Multiple Description Coding Yanming Shen, Xiaofeng Xu, Shivendra Panwar, Keith Ross, Yao Wang Polytechnic University.
ASSIGNMENT, DISTRIBUTION AND QOS PROVISIONING IN COMMUNICATION NETWORKS.
March 2001 CBCB The Holy Grail: Media on Demand over Multicast Doron Rajwan CTO Bandwiz.
MiddleMan: A Video Caching Proxy Server NOSSDAV 2000 Brian Smith Department of Computer Science Cornell University Ithaca, NY Soam Acharya Inktomi Corporation.
Configuring, Managing and Maintaining Windows Server® 2008 Servers Course 6419A.
Differential Equations Linear Equations with Variable Coefficients.
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
© 2016 Carl Lund, all rights reserved A First Course on Kinetics and Reaction Engineering Class 38.
Optimal Placement of Relay Infrastructure in Heterogeneous Wireless Mesh Networks by Bender’s Decomposition Aaron So, Ben Liang University of Toronto,
Geethanjali College Of Engineering and Technology Cheeryal( V), Keesara ( M), Ranga Reddy District. I I Internal Guide Mrs.CH.V.Anupama Assistant Professor.
Presenter: Kuei-Yu Hsu Advisor: Dr. Kai-Wei Ke 2013/9/30 Performance analysis of video streaming on different hybrid CDN & P2P infrastructure.
Other Sampling Methods Lecture 7 Sections 2.6 – 2.8 Tue, Jan 31, 2006.
Lesson 8: Basic Monte Carlo integration
Statistics in SPSS Lecture 3
while Repetition Structure
Clustering 1 (Introduction and kmean)
H.264/SVC Video Transmission Over P2P Networks
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
“Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks” Lecture Note 7.
Equations with variables on both sides Whiteboard practice
ECEN “Mobile Wireless Networking”
Solving Fractional Equations
Computer Network.
Chapter 8: Subnetting IP Networks
Evaluating Proxy Caching Algorithms in Mobile Environments
“Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks”
Coded Caching in Information-Centric Networks
Peer-to-Peer Streaming: An Hierarchical Approach
Equations with variables on both sides Whiteboard practice
D1 Discrete Mathematics
PRE(Photospheric Radius Expansion) X-ray burst simulation with MESA(Modules for Experiments in Stellar Astrophysics) rd CHEA Workshop Gwangeon.
Replica Placement Heuristics of Application-level Multicast
Measures of Central Tendency
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Numerical Studies on Braess-like Paradoxes for Non-Cooperative Load Balancing in Distributed Computer Systems By Said Fathy El-Zoghdy, Hisao Kameda, and.
Math-7 NOTES What are Two-Step Equations??
Simulation for Cache Mesh Design
Presentation transcript:

Fundamental Limits of Heterogenous Cache: a Centralized Approach Guanchen He

Roadmap Introduction of coded caching System model and problem formulation Related work Centralized coded caching under heterogeneous cache set Numerical results

Introduction of coded caching 1. A network with one server and K users 2. N files of size F bits 3. K users, each with cache size M={M1, M2, …, MK} contents, 0<Mk<N 4. Two phases: placement phase and delivery phase. 1 N 2 Server Shared link User 1 User 2 User 3 User K User MK Cache M1 M2 M3

To reduce peak traffic rates on the shared link. Why coded caching? To reduce peak traffic rates on the shared link. K=2 users user1 user2 cache size F bits N=2 files file A file B file size F bits A 1, A2 Server B1 , B2 Shared link user1 user2 A1 A2 B1 B2

Types of coded caching Centralized coded caching Decentralized coded caching A 1, A2 Server B1 , B2 Shared link user1 user2 A1 A2 B1 B2

System model and problem formulation Network Model with heterogeneous cache set 1. N files of size F bits 2. K users, ordered cache size M={M1, M2, …, MK} contents, 0<Mk<N. 3. Two phases: placement phase and delivery phase. 4. Worst case requirements. 1 N 2 Server Shared link User 1 User 2 User 3 User K User MK Cache M1 M2 M3

Miss of coding opportunities A1 B2 Server Miss of coding opportunities user1 user2 A1 A2 B1 B2

Related work Result of decentralized coded cache

Centralized coded caching under heterogeneous cache set Example : K=4 users, N=4 files of F bits each, average cache size is 3F bits. We use t to represent how many times we can save all the files if we use up all the cache. So in this example, we need to divide each file into parts. We use to represent them.

Note: We paddle zeros at the end of the shorter parts of the files. Problem: 1. Is this ideal solution meaningful ? All situations are boundary? We have variables, K equations.

Example : K=3 users, N files, t=2 M3 – M2 M2 – M1 M1

Numeral results 1.Set the range of N and K 2.Randomly choose N,K and the cache set 3.Compute R using the equation When we choose , in my simulation, we reach a order optimum result.

THANKS! Q&A