MBD Techniques for Internet Delay Diagnosis Roni Stern and Meir Kalech Information Systems Engineering, Ben-Gurion University, Israel 7. Future Work Diagnosing.

Slides:



Advertisements
Similar presentations
QoS-based Management of Multiple Shared Resources in Dynamic Real-Time Systems Klaus Ecker, Frank Drews School of EECS, Ohio University, Athens, OH {ecker,
Advertisements

Capacity Planning IACT 918 July 2004 Gene Awyzio SITACS University of Wollongong.
Consistency-Based Diagnosis
1 Evaluation Rong Jin. 2 Evaluation  Evaluation is key to building effective and efficient search engines usually carried out in controlled experiments.
Distributed Control Algorithms for Service Differentiation in Wireless Packet Networks Michael Barry, Andrew T Campbell, Andras Veres
Algorithms & Complexity
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Gossip Scheduling for Periodic Streams in Ad-hoc WSNs Ercan Ucan, Nathanael Thompson, Indranil Gupta Department of Computer Science University of Illinois.
SIGCOMM 2003 Making Intra-Domain Routing Robust to Changing and Uncertain Traffic Demands: Understanding Fundamental Tradeoffs David Applegate Edith Cohen.
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
Network Capacity Planning IACT 418 IACT 918 Corporate Network Planning.
Technical Advisor : Mr. Roni Stern Academic Advisor : Dr. Meir Kalech Team members :  Amit Ofer  Liron Katav Project Homepage :
Loss and Delay Accountability for the Internet by Presented by:Eric Chan Kai Chen.
1 Resource Management in IP Telephony Networks Matthew Caesar, Dipak Ghosal, Randy H. Katz {mccaesar,
Server-based Inference of Internet Performance V. N. Padmanabhan, L. Qiu, and H. Wang.
Paper Title Your Name CMSC 838 Presentation. CMSC 838T – Presentation Motivation u Problem paper is trying to solve  Characteristics of problem  … u.
Carnegie Mellon University Complex queries in distributed publish- subscribe systems Ashwin R. Bharambe, Justin Weisz and Srinivasan Seshan.
Distributed Cluster Repair for OceanStore Irena Nadjakova and Arindam Chakrabarti Acknowledgements: Hakim Weatherspoon John Kubiatowicz.
Influence and Correlation in Social Networks Aris Anagnostopoulos Ravi Kumar Mohammad Mahdian.
Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.
Traffic Matrix Estimation: Existing Techniques and New Directions A. Medina (Sprint Labs, Boston University), N. Taft (Sprint Labs), K. Salamatian (University.
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 5: February 2, 2009 Architecture Synthesis (Provisioning, Allocation)
Call Admission and Redirection in IP Telephony A Performance Study Matthew Caesar, Dipak Ghosal, Randy Katz {mccaesar,
Distributed-Dynamic Capacity Contracting: A congestion pricing framework for Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute,
Multiagent Planning with Factored MDPs Carlos Guestrin Daphne Koller Stanford University Ronald Parr Duke University.
Module C9 Simulation Concepts. NEED FOR SIMULATION Mathematical models we have studied thus far have “closed form” solutions –Obtained from formulas --
Introduction to Model- Based Diagnosis Meir Kalech Partially based on the slides of Peter Struss.
2  Problem Definition  Project Purpose – Building Obfuscator  Obfuscation Quality  Obfuscation Using Opaque Predicates  Future Planning.
Not All Microseconds are Equal: Fine-Grained Per-Flow Measurements with Reference Latency Interpolation Myungjin Lee †, Nick Duffield‡, Ramana Rao Kompella†
Tomo-gravity Yin ZhangMatthew Roughan Nick DuffieldAlbert Greenberg “A Northern NJ Research Lab” ACM.
01/16/2002 Reliable Query Reporting Project Participants: Rajgopal Kannan S. S. Iyengar Sudipta Sarangi Y. Rachakonda (Graduate Student) Sensor Networking.
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
Structural Abstraction for Strong Fault Models Diagnosis (DX 2014 BISFAI 2015) Roni SternMeir KalechOrel Elimelech Ben Gurion University of the Negev,
MiLAN: Middleware to Support Sensor Network Applications Jonghak Kim, Da Huo, Hyungik Oh.
Internet Traffic Engineering by Optimizing OSPF Weights Bernard Fortz (Universit é Libre de Bruxelles) Mikkel Thorup (AT&T Labs-Research) Presented by.
The Minimal Communication Cost of Gathering Correlated Data over Sensor Networks EL 736 Final Project Bo Zhang.
Modeling Resource Sharing Dynamic of VoIP users Over a WLAN Using a Game-Theoretic Approach Presented by Jaebok Kim.
NETE4631:Capacity Planning (2)- Lecture 10 Suronapee Phoomvuthisarn, Ph.D. /
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 1 Simulation.
SUPPLEMENT TO CHAPTER NINETEEN Irwin/McGraw-Hill © The McGraw-Hill Companies, Inc., 1999 SIMULATION 19S-1 Chapter 19 Supplement Simulation.
Emergent Robustness in Software Systems through Decentralized Adaptation: an Ecologically-Inspired ALife Approach Franck Fleurey, Benoit Baudry, Benoit.
Niv Gafni, Yair Offir and Eliav Ben-zaken Information System Engineering Ben Gurion University 1.
Network Anomography Yin Zhang – University of Texas at Austin Zihui Ge and Albert Greenberg – AT&T Labs Matthew Roughan – University of Adelaide IMC 2005.
7.4 Solving Polynomial Equations Objectives: Solve polynomial equations. Find the real zeros of polynomial functions and state the multiplicity of each.
QoS Routing in Networks with Inaccurate Information: Theory and Algorithms Roch A. Guerin and Ariel Orda Presented by: Tiewei Wang Jun Chen July 10, 2000.
An optimal power-saving class II for VoIP traffic and its performance evaluations in IEEE e JungRyun Lee School of Electrical and Electronics Eng,Chung-Ang.
Towards Efficient Large-Scale VPN Monitoring and Diagnosis under Operational Constraints Yao Zhao, Zhaosheng Zhu, Yan Chen, Northwestern University Dan.
Zibin Zheng DR 2 : Dynamic Request Routing for Tolerating Latency Variability in Cloud Applications CLOUD 2013 Jieming Zhu, Zibin.
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
Networks-on-Chip (NoC) Suleyman TOSUN Computer Engineering Deptartment Hacettepe University, Turkey.
High-Speed Policy-Based Packet Forwarding Using Efficient Multi-dimensional Range Matching Lakshman and Stiliadis ACM SIGCOMM 98.
作者 :Satyajeet Ahuja and Marwan Krunz 出處 :IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 10, NO. 7, NOVEMBER 2008 報告者 : 黃群凱 1.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
FINDING A POLYNOMIAL PASSING THROUGH A POINT. Review: the Linear Factorization Theorem If where n > 1 and a n ≠ 0 then Where c 1, c 2, … c n are complex.
Solving Polynomial Functions involving Complex Numbers.
Performance of Distributed Constraint Optimization Algorithms A.Gershman, T. Grinshpon, A. Meisels and R. Zivan Dept. of Computer Science Ben-Gurion University.
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
CHAPTER 5 Simulation Modeling. Introduction In many situations a modeler is unable to construct an analytic (symbolic) model adequately explaining the.
Warm-Up 2/26 1. J. Rigor: You will learn how to find the real and complex zeros of polynomial functions. Relevance: You will be able to use graphs and.
7/11/0666th IETF1 QoS Enhancements to BGP in Support of Multiple Classes of Service Andreas Terzis Computer Science Department Johns Hopkins University.
DEPARTMENT/SEMESTER ME VII Sem COURSE NAME Operation Research Manav Rachna College of Engg.
Quality of Service Based Routing Ziv Kedem. Introduction n QoS Routing can improve network performance n The price is an increase in protocol and computational.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
On the Relation Between Simulation-based and SAT-based Diagnosis CMPE 58Q Giray Kömürcü Boğaziçi University.
Unified Adaptivity Optimization of Clock and Logic Signals Shiyan Hu and Jiang Hu Dept of Electrical and Computer Engineering Texas A&M University.
Decision Support Systems
Online Routing Optimization at a Very Large Scale
Linear Inequalities in Two Variables
Learning Software Behavior for Automated Diagnosis
Solve each quadratic using whatever method you choose!
Presentation transcript:

MBD Techniques for Internet Delay Diagnosis Roni Stern and Meir Kalech Information Systems Engineering, Ben-Gurion University, Israel 7. Future Work Diagnosing delays in more complex network models: Dynamic routing – a traffic flow has several routes. Different levels of Quality of Service (QoS) Robustness to incomplete or inaccurate network model. Evaluation on a real large scale computer network. 7. Future Work Diagnosing delays in more complex network models: Dynamic routing – a traffic flow has several routes. Different levels of Quality of Service (QoS) Robustness to incomplete or inaccurate network model. Evaluation on a real large scale computer network. 1. Motivation Computer networks are growing in size and complexity. Network administrators and ISPs wish to maintain a high quality of service. Faulty network component causes abnormal delays, experienced by users. How to identify faulty network components causing abnormal delays? 1. Motivation Computer networks are growing in size and complexity. Network administrators and ISPs wish to maintain a high quality of service. Faulty network component causes abnormal delays, experienced by users. How to identify faulty network components causing abnormal delays? 2. Problem Description Given: a network model and a set of abnormal observed delays. Model: 1. A graph of computers and network components, 2. Expected delays Abnormal observed delay [γ(flow)]: Unexpected delay observed by end-user. 2. Problem Description Given: a network model and a set of abnormal observed delays. Model: 1. A graph of computers and network components, 2. Expected delays Abnormal observed delay [γ(flow)]: Unexpected delay observed by end-user. R1R1 A1A1 A5A5 A3A3 R8R8 R2R2 R3R3 R4R4 A2A2 R7R7 R6R6 A4A4 A7A7 A8A8 R5R5 γ(F 5,8 )=1 γ(F 1,6 )=2 γ(F 2,7 )=0 γ(F 2,4 )=0 γ(F 3,6 )=1 γ(F 2,8 )=1 R9R9 A6A6 3. Goal Find a set of network components that explains the observed delay if abnormal 3. Goal Find a set of network components that explains the observed delay if abnormal y(F i,j ) = Abnormal delay in network flow from i to j = # network components (R i ) that are abnormal Find {Ri,..Rj} such that if abnormal, the observed delay is explained (for example: {R 1,R 3,R 8 }). 4. MBD Approach Formalize the problem as an MBD problem. Apply a diagnosis engine to find the abnormal delays. 4. MBD Approach Formalize the problem as an MBD problem. Apply a diagnosis engine to find the abnormal delays. Example 4.1 Network Delay Diagnosis Engine (NDDE) For every abnormal observed delay in size O choose γ(O) components. A diagnosis is a subset of components that satisfy all the observations. NDDE+: Prune network components that are part of normal flows. 4.1 Network Delay Diagnosis Engine (NDDE) For every abnormal observed delay in size O choose γ(O) components. A diagnosis is a subset of components that satisfy all the observations. NDDE+: Prune network components that are part of normal flows. 5. Linear Programming Approach Formalize the problem as a linear program. Run a linear programming solver (e.g. cvxopt) 5. Linear Programming Approach Formalize the problem as a linear program. Run a linear programming solver (e.g. cvxopt) Assumption: Delays are binary – zero or one Example 6. Experimental Results Real networks were simulated with the standard network simulator NS2. Generated scale-free networks using the Barabasi-Albert (1999) model. Varied with Probability of a network component to add abnormal delay The number of available observations The size of the network 6. Experimental Results Real networks were simulated with the standard network simulator NS2. Generated scale-free networks using the Barabasi-Albert (1999) model. Varied with Probability of a network component to add abnormal delay The number of available observations The size of the network No need for binary delays assumption 20% abnormals 70 observations 20% abnormals 5 observations LP is better for large number of observations Solving an LP is polynomial, while NDDE is exponential NDDE is better for small number of observations, due to LP overhead.