Digitaalne andmeülekanne IRT0150 Võrgu modeleerimine /nädal 5/ Avo Ots. 05. märts 2015

Transcription

1 Digitaalne andmeülekanne IRT0150 Võrgu modeleerimine /nädal 5/ Avo Ots 05. märts

2 Evaluating an architecture Numerical models Mathematic formulations performance characteristics Simulation Simulating the hardware in a program Emulation Prototype

3 Numerical models Erlang formula Little's law Leaky bucket Token bucket

4 Simulation exogenous inputs to system (the environment) system boundary system under study (has deterministic rules governing its behavior) real life psuedo random inputs to system (models environment) observer program boundary computer program simulates deterministic rules governing behavior observer simulated life

5 Advantages and limitations advantages: sometimes cheaper find bugs (in design) in advance generality: over analytic/numerical techniques detail: can simulate system details drawbacks: caution: does model reflect reality? large scale systems: lots of resources to simulate (especially accurately simulate) may be slow (computationally expensive 1 min real time could be hours of simulated time) art: determining right level of model complexity statistical uncertainty in results

6 Types of simulators Time driven simulation Cycle/instructor based simulation Stop and observe the system after a fixed time interval (cycle, instruction, etc) Events are assumed to happen at the time interval boundary Event driven simulation Move from one event to another Not at a fixed interval Always simulate the first event in the future this event may trigger new events before the second event.

7 Network simulation Event driven simulation technique. Flow-level simulation (fluid model) How each flow is transmitted Topology and routing issues Packet-level simulation How each packet is sent from the source to the destination More detailed packet level issues such as packet scheduling, congestion control, etc.

8 Event driven interconnect simulator Define a set of events E.g. Message arrival, message departure, etc Each event will trigger the change of the state in the system The simulator simulates the system activities for the events Change system states E.g. when a message starts communicating, the throughput of other messages may be affected. Adding future events

9 Programming an event-driven simulator An event driven simulator must maintain the following: simulated time: internal (to simulation program) variable that keeps track of simulated time system state : variables maintained by simulation program define system state e.g., may track number (possibly order) of packets in queue, current value of retransmission timer events: points in time when system changes state each event has associate event time e.g., arrival of packet to queue, departure from queue precisely at these points in time that simulation must take action (change state and may cause new future events) model for time between events (probabilistic) caused by external environment

10 Event driven simulator block diagram initialize event list get next (nearest future) event from event list time = event time process event (change state values, add/delete future events from event list) update statistics n done?

11 Flow level network simulattion Input: a list of messages as well as their arrival time src_id, dst_id, msg_size, arrival_time Output the finishing time for each message Assumption: The topology and the routing scheme is given. Topology: Link between switches and its bandwidth Routing: given a pair of src_id and dst_id, routing givens thelist of links along a path from source to destination.

12 Example flow level simulator Events Message arrival and message departure Modeling network activities Given a set of active flows, we must model the transmission rates for each active flow. Need to make assumptions One possible assumption: the flow rate is equal to the equal share of the link bandwidth for the most loaded link along its path.

13 Flow level simulation Assumption: the flow rate is equal to the equal share of the link bandwidth for the most loaded link along its path. Active flows: 1->5, 2->3, 3->5, 4->5, link bandwidth 1Mbps Assumption 1: 1->5, 3->5, 4->5 333Mbps, 2->3, 500Mbps Assumption 2: 1->5, 3->5, 4->5 333Mbps, 2->3, 667Mbps

14 Flow level simulator Network state: Active messages, sizes of reminding active messages, rate for each active message, time for each active message based on the current data rate. When a new message arrives, the number of active messages increases: the network state needs to be recomputed When a message finishes, the number of active message decreases: the network state needs to be recomputed.

15 Flowchart initialize event list get next (nearest future) event from event list time = event time process event (change state values, add/delete future events from event list) update statistics n done? put all messages in priority queue get next (nearest future) (first arrival time or finishing time) time = event time Change the set of active flows Recompute the reminding message size, new rate, and new finishing time If message finish, output time/msg n done?

16 Example (1) flow level simulation Will write up a homework and prepare topology and routing files. How accurate if the simulator? A lot of assumptions this is common for all simulation type of work. If the assumption or the model is off, simulation produces junk results.

17 Example (2) packet level simulator Objective: to investigate different packet scheduling algorithms used in routers. Input: a list of messages as well as their arrival time src_id, dst_id, msg_size, arrival_time The messages can be generated following some distribution to evaluate the performance under different traffic conditions. Output the finishing time for each message

18 Packet level simulator Events: Message arrives a compute node, packet at a compute node, packet arrives at a port, packet moves to an output port, etc. Model system activities Modeling the compute node behavior Model router behavior

19 Packet level simulator (1) Model system activities Modeling the node behavior When a message arrives, packetize the message, insert packets into a host packet queue (with ready time) to be injected to the network. When a packet is received, if it is the last packet of a message, keep the statistics.

20 Packet level simulator (2) Modeling router behavior Each input port can be modeled by an input queue Each output port can be modeled by an output queue Packet scheduling algorithm: when multiple packets are ready at the input queue, the algorithm determines which packet gets to be scheduled to the output queue. Modeling router latency: after a packet is removed from an input queue, insert the packet to the output queue with a time stamp equal to current_time + latency

21 Packet level simulator (3) Network states: Queues on routers and end hosts, message at end hosts The simulator basically figures out the next future event, and perform the event A message arrives at end host: packetize the message A packet is ready on end host: move the packet A packet is ready on a queue: move the packet

22 Packet level simulator flowchart initialize event list get next (nearest future) event from event list time = event time process event (change state values, add/delete future events from event list) update statistics n done?

23 Packet level </> flow level simulation Flow level simulation has higher level of abstraction more details are lost.

24 Network simulation packages Network simulators : NS2, OpNet, Mininet, etc Provide many common library funcationality Allow build the network topology and routing schemes.

25 Lihtsaim võrk

26 S D N (OpenFlow)

27 Multiedastus

28 Õppevideod nflow_tutorial

29 Viited (1) ure VM-Images

30 Viited (2) +Wiki

31 Maailm täna