{'fraction_non_alphanumeric': 0.021917808219178082, 'fraction_numerical': 0.0018264840182648401, 'mean_word_length': 5.088888888888889, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Reconciling mice and elephants in data center networks

Small switch buffers, high-speed links, short round-trip times and the composite nature of the traffic in data center networks (DCN) lead to several congestion problems that are not handled well by traditional congestion control mechanisms such as TCP. In this paper we design a simple switch-driven, flow-aware, congestion control algorithm to deal with such congestion issues. The basic idea of the proposed mechanism is reminiscent of classic congestion control in flow-aware networks such as ATM-ABR, where the switch sets a field in packet headers to enforce the sending rate at the source; less classic though are the challenges faced in designing such flow-awareness in the flow-aversive IP environment without modifying the TCP sender and receiver algorithm, to enable deployment in public data centers. We discuss in this paper our algorithm and give numerical results from NS-2 simulations to show its effectiveness in achieving high throughput overall, a good fairness and short flow completion times for delay-sensitive flows1.