“A Feedback Control Approach to Mitigating Mistreatment in Distributed Caching Groups ” Georgios Smaragdakis, Nikolaos Laoutaris, Azer Bestavros, Ibrahim.

Slides:



Advertisements
Similar presentations
Feedback Control Real- time Scheduling James Yang, Hehe Li, Xinguang Sheng CIS 642, Spring 2001 Professor Insup Lee.
Advertisements

Conceptual Framework for Dynamic Trust Monitoring and Prediction Olufunmilola Onolaja Rami Bahsoon Georgios Theodoropoulos School of Computer Science The.
CROWN “Thales” project Optimal ContRol of self-Organized Wireless Networks WP1 Understanding and influencing uncoordinated interactions of autonomic wireless.
Social Comparison Direction Upward social comparison- compare to someone who is better than you. Downward social comparison- compare to someone who is.
Better than the Two: Exceeding Private and Shared Caches via Two-Dimensional Page Coloring Lei Jin and Sangyeun Cho Dept. of Computer Science University.
Serverless Network File Systems. Network File Systems Allow sharing among independent file systems in a transparent manner Mounting a remote directory.
1 Distributed Selfish Replication under Node Churn Eva Jaho, Ioannis Koukoutsidis, Ioannis Stavrakakis, Ina Jaho Advanced Networking Research Group National.
1 EGOIST Overlay Routing using Selfish Neighbor Selection Georgios Smaragdakis Joint work with Vassilis Lekakis, Nikos Laoutaris, Azer Bestavros, John.
Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics.
Distributed Systems Fall 2010 Replication Fall 20105DV0203 Outline Group communication Fault-tolerant services –Passive and active replication Highly.
1 Sensor Networks and Networked Societies of Artifacts Jose Rolim University of Geneva.
Progress Report Wireless Routing By Edward Mulimba.
Distributed Placement of Service Facilities in Large-Scale Networks *Nikolaos Laoutaris Postdoc Fellow Harvard University Joint.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
The Spensa File System Douglas Santry Computer Laboratory University of Cambridge.
Selfish Caching in Distributed Systems: A Game-Theoretic Analysis By Byung-Gon Chun et al. UC Berkeley PODC’04.
Overlay Network Creation and Maintenance with Selfish Users Georgios Smaragdakis Dissertation committee members: Azer Bestavros, Nikolaos Laoutaris, John.
ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Department of Computer Science Stony Brook University.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
Cs238 CPU Scheduling Dr. Alan R. Davis. CPU Scheduling The objective of multiprogramming is to have some process running at all times, to maximize CPU.
Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale CS 591 – Wireless & Network Security Lecture.
Web Caching Robert Grimm New York University. Before We Get Started  Illustrating Results  Type Theory 101.
1 Mistreatment in Distributed Caching Groups: Causes and Implications Nikolaos Laoutaris †‡, Georgios Smaragdakis †, Azer Bestavros †, ‡ Ioannis Stavrakakis.
The War Between Mice and Elephants By Liang Guo (Graduate Student) Ibrahim Matta (Professor) Boston University ICNP’2001 Presented By Preeti Phadnis.
Swarming on Optimized Graphs for n-way Broadcast Georgios Smaragdakis joint work with Nikolaos Laoutaris, Pietro Michiardi, Azer Bestavros, John Byers,
Web Caching and CDNs March 3, Content Distribution Motivation –Network path from server to client is slow/congested –Web server is overloaded Web.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
1 Distributed Selfish Replication Nikolaos Laoutaris Orestis Telelis Vassilios Zissimopoulos Ioannis Stavrakakis
Subgoal: conduct an in-depth study of critical representation, operator and other choices used for evolutionary program repair at the source code level.
1 The Good, The Bad and the Ugly: Network Performance in Malicious Environment Udi Ben-Porat ETH Zurich, Switzerland Anat Bremler-Barr IDC Herzliya, Israel.
Mehmet C. Vuran Vehbi C. Gungor Özgür B. Akan School of Electrical & Computer Engineering Georgia Institute of Technology Atlanta, GA {mcvuran,
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
Performance of Web Applications Introduction One of the success-critical quality characteristics of Web applications is system performance. What.
Outlier Detection Using k-Nearest Neighbour Graph Ville Hautamäki, Ismo Kärkkäinen and Pasi Fränti Department of Computer Science University of Joensuu,
On the Scale and Performance of Cooperative Web Proxy Caching University of Washington Alec Wolman, Geoff Voelker, Nitin Sharma, Neal Cardwell, Anna Karlin,
Evaluating the Vulnerability of Network Mechanisms to Sophisticated DDoS Attacks Udi Ben-Porat Tel-Aviv University, Israel Anat Bremler-Barr IDC Herzliya,
Using the Small-World Model to Improve Freenet Performance Hui Zhang Ashish Goel Ramesh Govindan USC.
Alexander Afanasyev Tutors: Seung-Hoon Lee, Uichin Lee Content Distribution in VANETs using Network Coding: Evaluation of the Generation Selection Algorithms.
Multi-hop-based Monte Carlo Localization for Mobile Sensor Networks
Midterm Stats Min: 16/38 (42%) Max: 36.5/38 (96%) Average: 29.5/36 (78%)
Value of Information 1 st year review. UCLA 2012 Kickoff VOI Kickoff ARO MURI on Value-centered Information Theory for Adaptive Learning, Inference, Tracking,
An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.
A Study of Central Auction Based Wholesale Electricity Markets S. Ceppi and N. Gatti.
1 Shape Segmentation and Applications in Sensor Networks Xianjin Xhu, Rik Sarkar, Jie Gao Department of CS, Stony Brook University INFOCOM 2007.
Vulnerability in Socially-informed Peer-to-Peer Systems Jeremy Blackburn Nicolas Kourtellis Adriana Iamnitchi University of South Florida.
Changing the Rules of the Game Dr. Marco A. Janssen Department of Spatial Economics.
On Reducing Mesh Delay for Peer- to-Peer Live Streaming Dongni Ren, Y.-T. Hillman Li, S.-H. Gary Chan Department of Computer Science and Engineering The.
Du, Faloutsos, Wang, Akoglu Large Human Communication Networks Patterns and a Utility-Driven Generator Nan Du 1,2, Christos Faloutsos 2, Bai Wang 1, Leman.
Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT By Jyothsna Natarajan Instructor: Prof. Yanqing Zhang Course: Advanced Operating Systems.
Repeated Game Modeling of Multicast Overlays Mike Afergan (MIT CSAIL/Akamai) Rahul Sami (University of Michigan) April 25, 2006.
Energy Optimal Control for Time Varying Wireless Networks Michael J. Neely University of Southern California
CHEE825 Fall 2005J. McLellan1 Nonlinear Empirical Models.
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.
Named Function Networking
Sameer Agarwal, Aurojit Panda, Barzan Moxafari Samuel Madden, Ion Stoica.
Dynamics of Learning & Distributed Adaptation
The Impact of Replacement Granularity on Video Caching
Distributed Algorithms for Mobile Sensor Networks
Supplementary Figure 1 Shiota et al.
StatSense In-Network Probabilistic Inference over Sensor Networks
On the Scale and Performance of Cooperative Web Proxy Caching
Dude, where’s that IP? Circumventing measurement-based geolocation
Phillipa Gill University of Toronto
Title: An Adaptive Queue Management Method for Congestion Avoidance in TCP/IP Networks Presented By: Frank Posluszny Vishal Phirke Matt Hartling 12/31/2018.
Replica Placement Heuristics of Application-level Multicast
Performance Implications of DCF to ESS Mesh Networks
Performance Implications of DCF to ESS Mesh Networks
Vaggelis G. Douros George C. Polyzos Stavros Toumpis
Performance Implications of DCF to ESS Mesh Networks
Presentation transcript:

“A Feedback Control Approach to Mitigating Mistreatment in Distributed Caching Groups ” Georgios Smaragdakis, Nikolaos Laoutaris, Azer Bestavros, Ibrahim Matta and Ioannis Stavrakakis

2 Current Practice

3 More storage showing up care about the local clients a storage node

4 How to Manage the Additional Storage Each storage node in isolation - Typically leads to Poor Performance In cooperation with other storage nodes + cooperation can improve individual and collective performance - risk of losing control over own storage – others controlling and benefiting from it. Mistreatment

5 Our Work in Perspective Such concerns have been studied restricted to the object replication (using game theory) [Laoutaris et. al. TPDS’06] Mistreatment in Distributed Selfish Caching [Laoutaris et. al. Infocom’06] In this work: How to guarantee the best response

6 Causes of Mistreatment Cause 1: Cache State Interactions due to cooperative servicing of requests Cause 2: Adoption of a Common Scheme O trtr

7 Towards Mistreatment-Resilient Network Design Detection Mechanism Mitigation Mechanism (Adaptive Caching eg. LRU(q)) Control the Mitigation Mechanism (how to tune q)

8 Detection Mechanism Real Cache Virtual Cache Local Requests

9 Mitigation and Control Mechanism ControllerPlant error outputTarget - + input input(t) ← input(t-1) + α c ·Δerror(t) + β c ·(Δerror(t)- Δerror(t-1)) PID controller: Amplitude Target Value Time

10 Our Approach q 1 <q 2 q1q1 q2q2 average access cost trtr

11 Adaptive vs. Static Caching min cost reduction (%) = 100 cost static - cost adaptive cost static cost static = min (cost(LRU(q=0), LRU(q=1)) max

12 Simulation Results

13 Future Work Other Coincidental types of Mistreatment Adversarial Mistreatment

14

15

16 Our Approach q 1 <q 2 q1q1 q2q2 Virtual Cache Cost average access cost trtr dist(tr)dist’(t r ) Δerror(t) = dist(t)- dist(t-1) σ = sign(Δerror(t)) If q ↑ and dist ↓ : you operate in the 1 st region If q ↑ and dist ↑ : you operate in the 2 nd region

17 A Critical View to Cooperation in Networking Applications Cooperation is not always beneficial for the individual node. Cooperation may lead to mistreatment: A node’s cost to perform a task is worse when the node participate in a group than when it operates in isolationism

18 Causes and Implications [Laoutaris et. al, Infocom 2006] Mitigation [Smaragdakis et. al, Networking 2006]

19 Mistreatment due to State Interaction Node 1 Node 4

20 Mistreatment due to Common Scheme O trtr

21 The Algorithm dist(t) = cost virtual (t) - cost q (t) dist(t-1) = costvirtual(t-1) - cost q (t-1) Δerror(t) = dist(t)- dist(t-1) σ = sign(Δerror(t)) if q(t-1)>q(t-2) then q(t) ← q(t-1) + σ ·α c ·|Δerror(t)| + σ ·β c ·|Δerror(t)- Δerror(t-1)| else q(t) ← q(t-1) - σ ·α c ·|Δerror(t)| - σ ·β c ·|Δerror(t)- Δerror(t-1)|

22 In Practice ControllerPlant error outputTarget - + q q(t) ← q(t-1) + α c ·Δerror(t) + β c ·(Δerror(t)- Δerror(t-1)) PID controller: - How do we determine the Target