Presentation is loading. Please wait.

Presentation is loading. Please wait.

Theory and IEEE Standardization. Presented by: Denis Surkes ID 321416505 Ran Levy ID 36679215.

Similar presentations

Presentation on theme: "Theory and IEEE Standardization. Presented by: Denis Surkes ID 321416505 Ran Levy ID 36679215."— Presentation transcript:

1 Theory and IEEE Standardization

2 Presented by: Denis Surkes ID 321416505 Ran Levy ID 36679215

3 QCN (Quantitazed Congestion Notification) The QCN Algorithm has been developed to provide congestion control at the Ethernet layer, or at L2. The algorithm issues a pause message to upstream buffers, when the buffer at a congested link fills up. This action ensures packets do not get dropped due to congestion.

4 The QCN Algorithm QCN CP Algorithm RP Algorithm

5 The CP Algorithm (Brief review)

6 The CP Algorithm Calculate Fb (feedback value that indicate the level of congestion) for each income frame Fb = (Qeq-Qlen) – w*(Qlen-Qlen_old) If Fb<0 send a congestion message back with quantized Fb value

7 The RP Algorithm Two counters: byte-counter and timer Both reset by Fb < 0 signal Byte-Counter 5 cycles of FR (150KB/cycle) AI cycles afterwards (75KB/cycle) Timer 5 cycles of FR (TIMER_PERIOD msec/cycle) AI cycles afterwards (TIMER_PERIOD/2 msec/cycle) RL 3 states – Fast recovery Active increase hyperActive increase

8 Simulation Goal Analyze a network with high dataRates, and a congested links. Activate the QCN algoritm in such a network and analayze the RTT times and stabilty of the network Compare the behavior of congested link with and without the QCN algorithm. Compare several parameters in the QCN algorithm itself.

9 Implementation description Network Topology

10 Switch Message Controller CP In[0] Out[0] In[1] Out[1] In[2] Out[3] Out[2] In[3] In[4] Out[4] To Host To Switch

11 Switch Description Manage Controller – control flow of income packets from input to CP and feedback Messages from CP to output Manage switch routing table that configured through switch configuration file CP (Congestion Point) - simulate output buffer and apply CP algorithm to all income packets

12 Host Description RP algrotihm is implemented here Creating the packets according to current Rate by changing the datarate channel. Distributing the packets: Uniformly Always sends through bottle neck Calculates RTT

13 Assumptions Switch is ideal, i.e routing the packets dont take time and routing tables are already configured. No delay and errors on channels Host doesnt create packets faster than the current rate. Packets are normal distributed (1000,200) Feedback messages have priority over regular messages.

14 Preventing the switch from sending feedback messages

15 QCN off Queue lengthHost datarate Queue length: Mean: 299.59290915772 Stddev: 3.0531562271108 Max: 300.0 Packets loss: 3696354

16 Feedback messages generated to prevent queue overload and packets lost.

17 Queue length on switch Mean: 60.27619 Stddev: 1.5215605

18 dataRates hosts 0-3 Mean: 2.3249501*10^9 Stddev: 1.1768111*10^8 Mean: 2.3903864*10^9 Stddev: 1.5451428*10^8 Mean: 2.72004*10^9 Stddev: 9.306672*10^7 Mean: 2.5859536*10^9 Stddev: 7.528326*10^7

19 Host datarate zoomed

20 Feedback count Mean: 34.05208 Stddev: 4.104861

21 Hosts - sends packets uniformly

22 Queue Length, Histogram Mean 33.4116 Stddev 24.4033

23 Feedback counter interval 1ms Mean 30.8372 Stddev 11.8787

24 RTT Mean 3.92304e-05 Stddev 3.63771e-05 Max 0.000488596

25 DataRate hosts 0-3 Mean:4.361909*10^9Mean: 4.43117*10^9 Stddev: 4.917516*10^8Stddev: 4.841612*10^8 Mean: 4.6436*10^9Mean: 4.14858*10^9 Stddev: 3.271976*10^8Stddev: 2.638262*10^8

26 Host datarate zoomed

27 Hosts- sends to bottlneck Timer- set to 1ms

28 Queue length Mean 60.9034 Stddev 11.8053

29 Datarate host0-3 Mean: 2.72934*10^9 Mean: 2.399835*10^9 Stddev: 2.79716*10^8Stddev: 2.22185*10^8 Mean: 2.541936*10^9Mean: 2.392924*10^9 Stddev: 1.45063*10^8 Stddev: 1.01734*10^8

30 Host Datarate hyperactive increase

31 Feedback counter Mean 40.1959 Stddev 16.0076

32 RTT Mean 0.000108274 Stddev 1.45964e-05

33 The QCN algorithm is essential in data centers because it allows the ability to transfer huge amounts of data without any loss of packets When QCN is active there is almost no reduction In RTT. Congested link is fully optimized while maintaining fairness to all hosts.

Download ppt "Theory and IEEE Standardization. Presented by: Denis Surkes ID 321416505 Ran Levy ID 36679215."

Similar presentations

Ads by Google