1 / 12

IA-TCP A Rate Based Incast-Avoidance Algorithm for TCP in Data Center Networks

This paper introduces IA-TCP, a rate-based congestion control algorithm designed to avoid incast communication pattern in TCP for data center networks. It effectively avoids network congestion by controlling the data packet rates and window sizes of connections. IA-TCP is scalable in terms of goodput and query completion time.

kimberlyknox
Download Presentation

IA-TCP A Rate Based Incast-Avoidance Algorithm for TCP in Data Center Networks

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. IA-TCP A Rate Based Incast-Avoidance Algorithm for TCP in Data Center Networks Communications (ICC), 2012 IEEE International Conference on 曾奕勳

  2. Introduction • Many online service providers have vastly invested in building data centers. • The data center applications generally shows the Partition/Aggregate communication pattern. • Incast communication pattern may cause network congestion.

  3. Introduction • TCP does not work well • The Top of Rack (ToR) switches typically use small buffer memories to reduce cost. • A few packet losses may result in TCP timeouts. • Incast-Avoidance TCP • a rate-based congestion control algorithm • designed to operate only at the aggregator side

  4. Related Work • Reducing the duplicate ACK threshold and disabling the slow-start • Reducing the RTOmin from a millisecond to a microsecond granularity. • effective for cluster-based storage systems • not adequate for soft real-time applications • A delay based congestion avoidance algorithm

  5. Data packet rate control • The incast congestion is avoided when the total numberof outstanding packets does not exceed the network pipe size. • For examplein • a network path has 1Gbps of link capacity and 100μs of delay, • the BDP is 12.5kB or 8.3MSS(1MSS=1.5KB)

  6. Data packet rate control • The data packet rate of the workers to be less than or equal to the link capacity. • The aggregator first controls the window size of the workers and then adds Δ(s) to the RTTmin for fine-grained rate control.

  7. Data packet rate control • Control the window sizes of all connections to be equal to W. • We now set the advertisement window as

  8. Data packet rate control • The aggregator adds the delay Δ for each ACK packet when advertise size equal 1. • If Δ is negative, the ACK is sent immediately without any delay. • Set the delay of the first ACK in each connection, as a random value from [0,(RTTmin + Δ)].

  9. simulation • ToS buffer size is 56 packets (assuming 4MB of shared memory / 52 ports / 1.5kB of MSS). • Link capacity is set to 1Gbps • the round trip propagation delay between workers and aggregator is set to 100μs. • the aggregator sends 10B of request query to workers. • worker replies a specific size of data to the aggregator. • The packet size is fixed at 1500 bytes • RTOmin is set to 200ms

  10. Ratio of TCP timeout

  11. Query Completion time

  12. Conclusion • A rate-based congestion control algorithm, to effectively avoid the incas congestion. • IA-TCP is implemented only at the aggregator node. • IA-TCP is scalable in goodput and query completion time.

More Related