1 / 34

Flow Control

Flow Control. Overview. Open Loop flow control No feedback, traffic shaping Closed Loop control Feedback used to do source to destination control. Absolute peak control Allocating peak bandwidth for each channel. No statistical multiplexing possible. Violation Tagging. violation tagging

pembroke
Download Presentation

Flow Control

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Flow Control

  2. Overview • Open Loop flow control • No feedback, traffic shaping • Closed Loop control • Feedback used to do source to destination control. • Absolute peak control • Allocating peak bandwidth for each channel. No statistical multiplexing possible

  3. Violation Tagging • violation tagging • Cells are divided between high priority and best effort, over contract cells. • Example- voice, divide 4 MSB into non-tagged stream, 4 LSB tagged stream • High priority video frames sent in own stream. • Open loop scheme since no feedback is required

  4. Congestion • Congestion • Delays increase rapidly • Buffers overflow • Cells are dropped • Throughput drops • Deadlock

  5. Congestion Control • Recognize congestion early before cells are dropped • Send signal to source • Source invokes control

  6. Recognizing Congestion • Average queue length threshold • TCP uses timeout • Global queue occupancy?

  7. Congestion Indication • Forward Explicit Congestion Notification FECN bit in Payload type field • Set in packet to destination • Backward Explicit Congestion Notification BECN • Set in packet in reverse direction, to source

  8. Invoking Control • Window Control • Specifies a limit on the number of unacknowledged segments • Window size can be lowered on congestion • Rate Control • Leaky bucket rate varied by congestion information (RM cells) • Credit based control • Source limited to a specified number of cells before waiting for more credits

  9. m m m Window Control Model 1 2 M W Round Trip Delay

  10. Window based control • Congestion recognized by queue thresholds • W=dW exponential reduction Q(q) > L • d < 1 • W=W+b linear increase Q(q) < L

  11. Explicit Binary Feedback • Ramakrishnan and Jain • Similar to FECN • Set bit in acknowledgment if congestion in switch • If 50% of acks have bit set W=.875W • Otherwise W = W+1 • Internet uses W=.5W

  12. Power Function delay Max Power Throughput

  13. Maximizing Power • Power = throughput/delay • for M/D/1

  14. Queue Length Packets passing through switch will be set 50% of the time

  15. Rule • Use rule that if 50% of bits are set, reduce rate

  16. Oscillations • methods proposed to dampen oscillations • Base action on average queue level, not current level • Reduce window size at a smaller rate

  17. Maximum Rate

  18. Rate Based ATM Forum • EPRCA • Enhanced Proportional Control Algorithm • rate based chosen over credit based approaches • Credit based requires Per VC queuing • Link by link flow control

  19. EPRCA • VC transmits at Allowed Cell Rate (ACR) • Rate is reduced by ADR after each cell • Every Nrm cells, generate RM cell in backward direction • When received from Destination, increment rate by Nrm*ADR • Rate is reduced if RM cell is lost

  20. RM Cells • RM Cell • Resource Management Cell • PT=110 • Backward or forward indication • Congestion Indication set by destination if EFCI bit is set • Explicit Cell Rate ER, Minimum Cell Rate MCR, Current Cell Rate CCR, Allowable Cell Rate ACR, Initial Cell Rate ICR

  21. PT Field • 000 User Data, no Congestion, SDU 0 • 001 End of AAL5 packet • 010 User Data, Congestion, no end • 100 Segment OAM flow • 101 End to End OAM • 110 RM Cell • 111 Reserved

  22. Simulation Varying Lengths Switch Switch

  23. Parameters • 1 to 50 Km link length • 50 and 1000Km backbone length • PCR=300000, ICR=PCR/20, MCR=PCR/1000, ADR=ACR/256 • Stable oscillations 8-9msec, 850-900 cell buffers

  24. Large Delay-Bandwidth Network

  25. m m m Heavy Traffic Case M Switches 1 2 M W Round Trip Delay

  26. Asymptotic Performance Heavy Usage (congested) R Increasing W 1 Moderate Usage Optimal W G/g 1

  27. Analysis • Power = throughput/delay (g/R) • Maximized at knee of curve • Little additional throughput results from increasing window size • optimal Window size

  28. Example • a) 2.4Gbps, 1000Km path, 10 switches • G=28000 cells • b) 45Mbps, 1000Km path, 10 switches • G=530 cells

  29. Rule of thumb • set W to G

  30. Queueing delay • queuing delay or SOL delay • For high bandwidth connections, SOL • If power is maximized queuing delays dominate • What about LANs? • Longer packet lengths, smaller bandwidth • queuing delays dominate

  31. Other Conclusions • Where are most of the cells in the network? Are they in buffers, or on the communication links? • Most of the cells are on the links in high bandwidth-delay networks

  32. Little’s Law

  33. Mitra’a algorithm • Stay at maximum power point • As throughput increases, decrease window size • Maintain equations

  34. Delayed-feedback, rate-control • Unstable equilibrium point • queue length q= • oscillation period O(t) • fluxuations bounded by • throughput within • response time at most

More Related