CDA6530: Performance Models of Computers and Networks Project 3 Q&A

Slides:



Advertisements
Similar presentations
Leader Election Let G = (V,E) define the network topology. Each process i has a variable L(i) that defines the leader.  i,j  V  i,j are non-faulty.
Advertisements

CDA6530: Performance Models of Computers and Networks Chapter 5: Generating Random Number and Random Variables TexPoint fonts used in EMF. Read the TexPoint.
The double-dimer model and skew Young diagrams Richard W. Kenyon David B. Wilson Brown University Microsoft Research TexPoint fonts used in EMF. Read the.
Sublinear time algorithms Ronitt Rubinfeld Blavatnik School of Computer Science Tel Aviv University TexPoint fonts used in EMF. Read the TexPoint manual.
Smoother Pieter Abbeel UC Berkeley EECS Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics TexPoint fonts used in EMF. Read the TexPoint.
CDA6530: Performance Models of Computers and Networks Examples of Stochastic Process, Markov Chain, M/M/* Queue TexPoint fonts used in EMF. Read the TexPoint.
Johannes PODC 2009 –1 Coloring Unstructured Wireless Multi-Hop Networks Johannes Schneider Roger Wattenhofer TexPoint fonts used in EMF. Read.
ME451 Kinematics and Dynamics of Machine Systems Dynamics of Planar Systems November 11, , 6.1.4, 6.2, starting 6.3 © Dan Negrut, 2010 ME451,
TexPoint fonts used in EMF.
CDA6530: Performance Models of Computers and Networks Chapter 8: Discrete Event Simulation Example --- Three callers problem in homwork 2 TexPoint fonts.
ITI-510 Computer Networks ITI 510 – Computer Networks Meeting 3 Rutgers University Internet Institute Instructor: Chris Uriarte.
CDA6530: Performance Models of Computers and Networks Chapter 7: Basic Queuing Networks TexPoint fonts used in EMF. Read the TexPoint manual before you.
CDA6530: Performance Models of Computers and Networks Chapter 8: Statistical Simulation --- Discrete-Time Simulation TexPoint fonts used in EMF. Read the.
ASP. What is ASP? ASP stands for Active Server Pages ASP is a Microsoft Technology ASP is a program that runs inside IIS IIS stands for Internet Information.
Machine Learning and Data Mining Clustering (adapted from) Prof. Alexander Ihler TexPoint fonts used in EMF. Read the TexPoint manual before you delete.
CDA6530: Performance Models of Computers and Networks Mid-Term Review TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
ME451 Kinematics and Dynamics of Machine Systems Dynamics of Planar Systems December 6, 2011 Equilibrium Analysis & Inverse Dynamics Analysis ME451 Wrap.
ETH Zurich – Distributed Computing Group Stephan Holzer 1ETH Zurich – Distributed Computing – Stephan Holzer Yvonne Anne Pignolet Jasmin.
CDA6530: Performance Models of Computers and Networks Chapter 8: Statistical Simulation ---- Discrete Event Simulation (DES) TexPoint fonts used in EMF.
ETH Zurich – Distributed Computing Group Stephan Holzer 1ETH Zurich – Distributed Computing – Stephan Holzer Yvonne Anne Pignolet Jasmin.
ME451 Kinematics and Dynamics of Machine Systems Dynamics of Planar Systems December 9, 2010 Solving Index 3 DAEs using Newmark Method © Dan Negrut, 2010.
CDA6530: Performance Models of Computers and Networks Chapter 8: Statistical Simulation ---- Discrete Event Simulation (DES) TexPoint fonts used in EMF.
CDA6530: Performance Models of Computers and Networks Mid-Term Review TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
Lecture 3: System Representation
Exporting Data from NCVTS to Create Mail Merge Documents By: Betsy Cummings Robeson County Personal Property Division Manager.
ETH Zurich – Distributed Computing Group Stephan HolzerETH Zurich – Distributed Computing – Stephan Holzer - ETH Zürich Thomas Locher.
ME451 Kinematics and Dynamics of Machine Systems Dynamics of Planar Systems December 9, 2010 Solving Index 3 DAEs using Newmark Method © Dan Negrut, 2010.
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Warm Ups: 1) (4x3 + 2x2 + 1) – (x2 + x – 5)
A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs Johannes Schneider Roger Wattenhofer TexPoint fonts used in EMF.
More About Recursive Data Types
Parallel and Distributed Simulation
Repetition Structures Chapter 9
COMPUTER NETWORKS CS610 Lecture-9 Hammad Khalid Khan.
More Recursive Data Types
TexPoint fonts used in EMF.
Machine Learning and Data Mining Clustering
CS 5010 Program Design Paradigms “Bootcamp” Lesson 3.4
Net301 lecture9 11/5/2015 Lect 9 NET301.
NET323 D: Network Protocols
TexPoint fonts used in EMF.
What is Bash Shell Scripting?
TexPoint fonts used in EMF.
TexPoint fonts used in EMF.
CS 154, Lecture 6: Communication Complexity
CS 5010 Program Design Paradigms “Bootcamp” Lesson 7.5
UAV Route Planning in Delay Tolerant Networks
Computational Geometry Capter:1-2.1
TexPoint fonts used in EMF.
NET323 D: Network Protocols
Husam Abu-Haimed David L. Dill Sergey Berezin
TexPoint fonts used in EMF.
TexPoint fonts used in EMF.
TexPoint fonts used in EMF.
TexPoint fonts used in EMF.
Open your video file. Play the video.
CSE 321 Discrete Structures
COS 461: Computer Networks Spring 2014
Getting Started with MyPMI Mail Tutorial (Student)
CDA6530: Performance Models of Computers and Networks Project 3 Q&A
Routing Flooding, Link-State EE122 Section 4.
New Direct Product results in Communication Complexity
Chapter 4: Simulation Designs
Combinatorial Topology and Distributed Computing
By:- Rizwan Malik For Advanced OS Course 2007
TexPoint fonts used in EMF.
When do I need an invariant?
CS 5010 Program Design Paradigms “Bootcamp” Lesson 3.4
ZOOM VIDEO CONFERENCING: RECORDING YOUR SESSION
Presentation transcript:

CDA6530: Performance Models of Computers and Networks Project 3 Q&A TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAAAAAAA

Structure definition in Matlab: m = 300; n =300; Structure definition in Matlab: Node=struct('status', zeros(m,n), 'infectTime', zeros(m,n), 'InfectOtherTime', zeros(m,n)); Or you can define: NodeState = zeros(m,n); NodeInfectTime = zeros(m,n); NodeInfectOtherTime = zeros(m,n);

Multiple Way to Remember Infection Traffic Define a queue variable to remember: Generated infection traffic source (or destination) Active time (when the source passes the traffic to all its neighbors, or when a vulnerble node receives the traffic) Quite complicated since the event queue is very dynamic

Multiple Way to Remember Infection Traffic (my approach) Use each infected node variable to remember when its outgoing infection traffic reach its neighbors NodeInfectOtherTime(i,j) save the time for infection traffic reaching the node(i,j)’s neighbors

How to determine neighboring nodes? You don’t need the code to remember the topology since it is so regular Node(a,b)’s 4 neighbors: Upper node: (a-1,b), Down node: (a+1, b) Left node: (a,b-1), right node: (a, b+1) Make sure you check if any of the above 4 nodes are non-exist For S2, you also need to check if the node is one of those 10 shortcut nodes If yes, considering the 5th neighboring node

How to decide the simulation end time? At current discrete time k, check all nodes: If all (NodeInfectOtherTime(.,.) < k), then stop It means there does not exist any future infection traffic anymore

Infection Activity from sending node angle At current time t: If the NodeState(j,k) == ‘infected’ If the NodeInfectOtherTime(j,k) == t, %the node infection traffic reach its neighbors now! Check all its neighbors to see if any neighbor is infected now, if the neighbor node(a, b) is infected now: NodeState(a,b) = infected; NodeInfectTime(a,b) = t; generate Poisson distr. delay time x; NodeInfectOtherTime(a,b) = x +t +1; If NodeState(j,k) == ‘vulnerable’ Do nothing

Two Actions for Every Infected Node Act 1: when node(a,b) becomes infected at current discrete time t Change its status: NodeState(a,b) = INFECTED; Assign: NodeInfectTime(a,b) = t; x = PoissonGenerator(); NodeInfectOtherTime(a,b) = t + x + 1; Act 2: when an infected node delivers infection traffic to its neighbors When? if (NodeState(a,b) == INFECTED && t == NodeInfectOtherTime(a,b) ) Check each of its neighbor: If neighbor node(c,d) is vulnerable and will be infected? Run Act 1 for the node(c,d)

startTime = cputime; Simulation…. simulateCPUTime = cputime – startTime;