1 Modeling and Simulating Networking Systems with Markov Processes Tools and Methods of Wide Applicability ? Jean-Yves Le Boudec

Slides:



Advertisements
Similar presentations
1 Analysis of Random Mobility Models with PDE's Michele Garetto Emilio Leonardi Politecnico di Torino Italy MobiHoc Firenze.
Advertisements

Timed Automata.
Model Checker In-The-Loop Flavio Lerda, Edmund M. Clarke Computer Science Department Jim Kapinski, Bruce H. Krogh Electrical & Computer Engineering MURI.
Monte Carlo Methods and Statistical Physics
THE SYSTEM THEORY OF NETWORK CALCULUS J.-Y. Le Boudec EPFL WoNeCa, 2012 Mars 21 1.
Princeton University Using the computer to select the right variables Rationale: Lake Carnegie, Princeton, NJ Straight Line Distance Actual transition.
Multiscale Stochastic Simulation Algorithm with Stochastic Partial Equilibrium Assumption for Chemically Reacting Systems Linda Petzold and Yang Cao University.
Critical Transitions in Nature and Society Marten Scheffer.
MEAN FIELD FOR MARKOV DECISION PROCESSES: FROM DISCRETE TO CONTINUOUS OPTIMIZATION Jean-Yves Le Boudec, Nicolas Gast, Bruno Gaujal July 26,
Planning under Uncertainty
1 Self Limiting Epidemic Forwarding and Fluid Approximations of Continuous Time Markov Chains Jean-Yves Le Boudec
1 Perfect Simulation and Stationarity of a Class of Mobility Models Jean-Yves Le Boudec (EPFL) Milan Vojnovic (Microsoft Research Cambridge)
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Optimal Control of Stochastic Hybrid Systems Robin Raffard EECS Berkeley.
SAC Workshop, Zurich 7th March 2007 Haggle: An Innovative Paradigm for Autonomic Opportunistic Communication.
ODE and Discrete Simulation or Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL MLQA, Aachen, September
Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL July
Simulation Where real stuff starts. ToC 1.What, transience, stationarity 2.How, discrete event, recurrence 3.Accuracy of output 4.Monte Carlo 5.Random.
HMM-BASED PATTERN DETECTION. Outline  Markov Process  Hidden Markov Models Elements Basic Problems Evaluation Optimization Training Implementation 2-D.
1/16 J. Cho, J.-Y. Le Boudec, and Y. Jiang, “Decoupling Assumption in ” On the Validity of the Decoupling Assumption in JEONG-WOO CHO Norwegian.
1 ENS, June 21, 2007 Jean-Yves Le Boudec, EPFL joint work with David McDonald, U. of Ottawa and Jochen Mundinger, EPFL …or an Art ? Is Mean Field a Technology…
1 A Generic Mean Field Convergence Result for Systems of Interacting Objects From Micro to Macro Jean-Yves Le Boudec, EPFL Joint work with David McDonald,
Wave functions of different widths were used and then the results were analyzed next to each other. As is evident from the graphs below, the wider the.
1 A Class Of Mean Field Interaction Models for Computer and Communication Systems Jean-Yves Le Boudec EPFL – I&C – LCA Joint work with Michel Benaïm.
1 Random Trip Stationarity, Perfect Simulation and Long Range Dependence Jean-Yves Le Boudec (EPFL) joint work with Milan Vojnovic (Microsoft Research.
1 Mean Field Interaction Models for Computer and Communication Systems and the Decoupling Assumption Jean-Yves Le Boudec EPFL – I&C – LCA Joint work with.
1 A Generic Mean Field Convergence Result for Systems of Interacting Objects From Micro to Macro Jean-Yves Le Boudec, EPFL Joint work with David McDonald,
1 A Class Of Mean Field Interaction Models for Computer and Communication Systems Jean-Yves Le Boudec EPFL – I&C – LCA Joint work with Michel Benaïm.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Application of Graph Theory to OO Software Engineering Alexander Chatzigeorgiou, Nikolaos Tsantalis, George Stephanides Department of Applied Informatics.
© 2011 Autodesk Freely licensed for use by educational institutions. Reuse and changes require a note indicating that content has been modified from the.
SIAM Life Sci/Soc. for Math Biol. Summer Biocalculus: Reflecting the needs of the students Stephen J. Merrill Dept of MSCS Marquette University.
Operations Research Models
Tutorial 5: Numerical methods - buildings Q1. Identify three principal differences between a response function method and a numerical method when both.
Chapter 1 Introduction to Simulation
Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL ACCESS Distinguished Lecture Series, Stockholm, May 28,
1 Performance Evaluation of Computer Networks: Part II Objectives r Simulation Modeling r Classification of Simulation Modeling r Discrete-Event Simulation.
Performance Evaluation Lecture 2: Epidemics Giovanni Neglia INRIA – EPI Maestro 9 January 2014.
Performance Evaluation Lecture 4: Epidemics Giovanni Neglia INRIA – EPI Maestro 12 January 2013.
Cosc 4242 Signals and Systems Introduction. Motivation Modeling, characterization, design and analysis of natural and man-made systems General approaches.
Sampletalk Technology Presentation Andrew Gleibman
Swarat Chaudhuri Roberto Lublinerman Pennsylvania State University Sumit Gulwani Microsoft Research CAUCHY Continuity analysis of programs.
Directed-Graph Epidemiological Models of Computer Viruses Presented by: (Kelvin) Weiguo Jin “… (we) adapt the techniques of mathematical epidemiology to.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences Process algebras.
Fluid-based Analysis of a Network of AQM Routers Supporting TCP Flows with an Application to RED Vishal Misra Wei-Bo Gong Don Towsley University of Massachusetts,
ENM 503 Lesson 1 – Methods and Models The why’s, how’s, and what’s of mathematical modeling A model is a representation in mathematical terms of some real.
How to Read Research Papers? Xiao Qin Department of Computer Science and Software Engineering Auburn University
Aemen Lodhi (Georgia Tech) Amogh Dhamdhere (CAIDA)
SUPERCOMPUTING CHALLENGE KICKOFF 2015 A Model for Computational Science Investigations Oct 2015 © challenge.org Supercomputing Around.
On the Age of Pseudonyms in Mobile Ad Hoc Networks Julien Freudiger, Mohammad Hossein Manshaei, Jean-Yves Le Boudec and Jean-Pierre Hubaux Infocom 2010.
Materials Process Design and Control Laboratory MULTISCALE MODELING OF ALLOY SOLIDIFICATION LIJIAN TAN NICHOLAS ZABARAS Date: 24 July 2007 Sibley School.
CFD Refinement By: Brian Cowley. Overview 1.Background on CFD 2.How it works 3.CFD research group on campus for which problem exists o Our current techniques.
ECE 466/658: Performance Evaluation and Simulation Introduction Instructor: Christos Panayiotou.
Theory of Computations III CS-6800 |SPRING
Evaluating Persistence Times in Populations Subject to Catastrophes Ben Cairns and Phil Pollett Department of Mathematics.
Doc.: IEEE n Submission January 2004 A. Poloni, S. Valle, STMicroelectronicsSlide 1 Time-Correlated Packet Errors in MAC Simulations.
Management Science Helps analyze and solve organizational problems. It uses scientific and quantitative methods to set up models that are based on controllable.
MA354 An Introduction to Math Models (more or less corresponding to 1.0 in your book)
CS 450 Modelling and Simulation Dr. X. Topics Time Discrete and Continuous Simulation Simulation Design Process.
MA354 Math Modeling Introduction. Outline A. Three Course Objectives 1. Model literacy: understanding a typical model description 2. Model Analysis 3.
DEPENDABILITY ANALYSIS (towards Networked Information Systems) Ester Ciancamerla, Michele Minichino ENEA {ciancamerlae, In.
Analytical Model for Connectivity in Vehicular Ad Hoc Networks Published in IEEE TVT vol. 57, no. 6, November 2008 Authors: Saleh Yousefi, Eitan Altman,
7th Int'l Workshop on Rare Event Simulation, Sept , Rennes, France Ant Colony Optimized Importance Sampling: Principles, Applications and Challenges.
Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL Network Science Workshop Hong Kong July
1 ICCCN 2003 Modelling TCP Reno with Spurious Timeouts in Wireless Mobile Environments Shaojian Fu School of Computer Science University of Oklahoma.
Traffic Simulation L2 – Introduction to simulation Ing. Ondřej Přibyl, Ph.D.
What is the future of applied mathematics? Chris Budd.
Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?
Jean-Yves Le Boudec EPFL – I&C – LCA Joint work with Michel Benaïm
of the IEEE Distributed Coordination Function
Presentation transcript:

1 Modeling and Simulating Networking Systems with Markov Processes Tools and Methods of Wide Applicability ? Jean-Yves Le Boudec

2 Examples of Research in my Group (I&C/ISC/LCA2)  Understanding simulation of mobility models Theoretical understanding of the model explains simulation artifacts Involves Palm calculus and Harris chains J.-Y. Le Boudec and M. Vojnovic, Perfect Simulation and Stationarity of a Class of Mobility Models, IEEE INFOCOM 2005; tools available at  Evaluate best design for ultra-wide band communication R. Merz, J.-Y. Le Boudec and S. Vijayakumaran “Effect on Network Performance of Common versus Private Acquisition Sequences for Impulse Radio UWB Networks” IEEE International Conference on Ultra-Wideband (ICUWB 2006), 2006

3 Methods for Performance Evaluation  Communication systems require modelling in the design phase for validation / tuning  Simulation (discrete event) Most often used But does not apply to the large scale  Analysis Often very hard to use / obtain proven results / re-usable Sometimes too late  Fast simulation is also often an alternative Based on hybrid of analytical results and detailed simulation

4 We Need Methods / Tools for The Domain Expert  Domain experts cannot spend a PhD on learning one method  We need theories of general applicability Like e.g. product form queuing network / max-plus algebra  We need methods that can be implemented in a mechanical way / in tools  An exploration track: What can the maths of natural sciences provide us with ? Methods for large markov processes

5 Example of Large Scale Model [ELS-2006] A. El Fawal, J.-Y. Le Boudec, K. Salamatian. Performance Analysis of Self-Limiting Epidemic Forwarding. Technical report LCA- REPORT

6 Markov Model for Epidemic Forwarding  The model is complex, O(A N^2 ) states N: nb nodes A: a fixed integer  Can we use simple approximations ? What is the corresponding fluid model ?

7 Fluid Model is Often Derived Heuristically [KYBR-2006] R. Kumar, D. Yao, A. Bagchi, K.W. Ross, D. Rubenstein, Fluid Modeling of Pollution Proliferation in P2P Networks, ACM Sigmetrics 2006, St. Malo, France, 2006  Original (micro-) model is continuous time markov process on finite (but huge) state space  Found too large, replaced by a fluid model  Step from micro to fluid is ad-hoc, based on informal reasoning  Q1: Is there a formal (mechanical) way to derive the fluid model from the microscopic description ?

8 A Similar Step is Common Place in Chemistry/Biology [L-2006] Jean-Yves Le Boudec, Modelling The Immune SystemToolbox: Stochastic Reaction Models, infoscience.epfl.ch, doc id: LCA-TEACHING  Q2: What is the link between the micro quantities and fluid ones ? Is the fluid quantity the expectation of a microscopic quantity ? Or a re- scaled approximation ? Micro model Markov process Fluid model

9 The Maths of Physics, Chemistry and Biology Help Us Infinitesimal generator (drift of f)

10 Examples of Forward Equations

11 Fluid model

12 A Fluid Limit Theorem

13 Towards a Mechanical Derivation of Fluid Model 1.Define the state variable 2.Pick functions of interest of the state variable 3.Define the transitions jumps  r and rates h r (x) 4.Compute the generator and write the ODE 1.Define the state variable 2.Pick functions of interest of the state variable 3.Define the transitions jumps  r and rates h r (x) 4.Compute the generator and write the ODE What do we obtain from the fluid model ? transients stable points  Implemented for models of the type below in the TSED tool at  Implemented for models of the type below in the TSED tool at

14 Application to Self-Limiting Epidemic Forwarding

15 Application to Self-Limiting Epidemic Forwarding  There is description complexity, but no modelling complexity A: Age of packet sent by node in middle ODE simulation

16 Other Results That Are Candidate For Automatic Generation of Solution  Hybrid simulation Fast transitions simulated as deterministic fluid, slow transitions as stochastic process Example: mobility + message transmission Mobility modeled as fluid Change in mobility state changes the rate of the process of packet transmission “Hybrid Simulation Method” based on representation (martingale approach)  Approximation by SDE  Mean Field, Pairwise approximation  Other scaling limits derived from generator approach

17 Conclusion  It seems possible to define classes of models that Have enough generality for networking and computer systems Can be analyzed approximately in an automatic way  Example: Jump process for which fluid limit is well defined  Many issues remain to explore, many potential applications !