€• .Œsphinx.addnodes”Œdocument”“”)”}”(Œ rawsource”Œ”Œchildren”]”(Œ translations”Œ LanguagesNode”“”)”}”(hhh]”(hŒ pending_xref”“”)”}”(hhh]”Œdocutils.nodes”ŒText”“”ŒChinese (Simplified)”…””}”Œparent”hsbaŒ attributes”}”(Œids”]”Œclasses”]”Œnames”]”Œdupnames”]”Œbackrefs”]”Œ refdomain”Œstd”Œreftype”Œdoc”Œ reftarget”Œ$/translations/zh_CN/networking/dctcp”Œmodname”NŒ classname”NŒ refexplicit”ˆuŒtagname”hhh ubh)”}”(hhh]”hŒChinese (Traditional)”…””}”hh2sbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ$/translations/zh_TW/networking/dctcp”Œmodname”NŒ classname”NŒ refexplicit”ˆuh1hhh ubh)”}”(hhh]”hŒItalian”…””}”hhFsbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ$/translations/it_IT/networking/dctcp”Œmodname”NŒ classname”NŒ refexplicit”ˆuh1hhh ubh)”}”(hhh]”hŒJapanese”…””}”hhZsbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ$/translations/ja_JP/networking/dctcp”Œmodname”NŒ classname”NŒ refexplicit”ˆuh1hhh ubh)”}”(hhh]”hŒKorean”…””}”hhnsbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ$/translations/ko_KR/networking/dctcp”Œmodname”NŒ classname”NŒ refexplicit”ˆuh1hhh ubh)”}”(hhh]”hŒSpanish”…””}”hh‚sbah}”(h]”h ]”h"]”h$]”h&]”Œ refdomain”h)Œreftype”h+Œ reftarget”Œ$/translations/sp_SP/networking/dctcp”Œmodname”NŒ classname”NŒ refexplicit”ˆuh1hhh ubeh}”(h]”h ]”h"]”h$]”h&]”Œcurrent_language”ŒEnglish”uh1h hhŒ _document”hŒsource”NŒline”NubhŒcomment”“”)”}”(hŒ SPDX-License-Identifier: GPL-2.0”h]”hŒ SPDX-License-Identifier: GPL-2.0”…””}”hh£sbah}”(h]”h ]”h"]”h$]”h&]”Œ xml:space”Œpreserve”uh1h¡hhhžhhŸŒ>/var/lib/git/docbuild/linux/Documentation/networking/dctcp.rst”h KubhŒsection”“”)”}”(hhh]”(hŒtitle”“”)”}”(hŒDCTCP (DataCenter TCP)”h]”hŒDCTCP (DataCenter TCP)”…””}”(hh»hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1h¹hh¶hžhhŸh³h KubhŒ paragraph”“”)”}”(hŒØDCTCP is an enhancement to the TCP congestion control algorithm for data center networks and leverages Explicit Congestion Notification (ECN) in the data center network to provide multi-bit feedback to the end hosts.”h]”hŒØDCTCP is an enhancement to the TCP congestion control algorithm for data center networks and leverages Explicit Congestion Notification (ECN) in the data center network to provide multi-bit feedback to the end hosts.”…””}”(hhËhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h Khh¶hžhubhÊ)”}”(hŒTo enable it on end hosts::”h]”hŒTo enable it on end hosts:”…””}”(hhÙhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K hh¶hžhubhŒ literal_block”“”)”}”(hŒ`sysctl -w net.ipv4.tcp_congestion_control=dctcp sysctl -w net.ipv4.tcp_ecn_fallback=0 (optional)”h]”hŒ`sysctl -w net.ipv4.tcp_congestion_control=dctcp sysctl -w net.ipv4.tcp_ecn_fallback=0 (optional)”…””}”hhésbah}”(h]”h ]”h"]”h$]”h&]”h±h²uh1hçhŸh³h K hh¶hžhubhÊ)”}”(hXIAll switches in the data center network running DCTCP must support ECN marking and be configured for marking when reaching defined switch buffer thresholds. The default ECN marking threshold heuristic for DCTCP on switches is 20 packets (30KB) at 1Gbps, and 65 packets (~100KB) at 10Gbps, but might need further careful tweaking.”h]”hXIAll switches in the data center network running DCTCP must support ECN marking and be configured for marking when reaching defined switch buffer thresholds. The default ECN marking threshold heuristic for DCTCP on switches is 20 packets (30KB) at 1Gbps, and 65 packets (~100KB) at 10Gbps, but might need further careful tweaking.”…””}”(hh÷hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h Khh¶hžhubhÊ)”}”(hŒ&For more details, see below documents:”h]”hŒ&For more details, see below documents:”…””}”(hjhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h Khh¶hžhubhÊ)”}”(hŒPaper:”h]”hŒPaper:”…””}”(hjhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h Khh¶hžhubhÊ)”}”(hŒ\The algorithm is further described in detail in the following two SIGCOMM/SIGMETRICS papers:”h]”hŒ\The algorithm is further described in detail in the following two SIGCOMM/SIGMETRICS papers:”…””}”(hj!hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h Khh¶hžhubhŒ block_quote”“”)”}”(hX‰i) Mohammad Alizadeh, Albert Greenberg, David A. Maltz, Jitendra Padhye, Parveen Patel, Balaji Prabhakar, Sudipta Sengupta, and Murari Sridharan: "Data Center TCP (DCTCP)", Data Center Networks session" Proc. ACM SIGCOMM, New Delhi, 2010. http://simula.stanford.edu/~alizade/Site/DCTCP_files/dctcp-final.pdf http://www.sigcomm.org/ccr/papers/2010/October/1851275.1851192 ”h]”hŒenumerated_list”“”)”}”(hhh]”hŒ list_item”“”)”}”(hXwMohammad Alizadeh, Albert Greenberg, David A. Maltz, Jitendra Padhye, Parveen Patel, Balaji Prabhakar, Sudipta Sengupta, and Murari Sridharan: "Data Center TCP (DCTCP)", Data Center Networks session" Proc. ACM SIGCOMM, New Delhi, 2010. http://simula.stanford.edu/~alizade/Site/DCTCP_files/dctcp-final.pdf http://www.sigcomm.org/ccr/papers/2010/October/1851275.1851192 ”h]”(hÊ)”}”(hŒŽMohammad Alizadeh, Albert Greenberg, David A. Maltz, Jitendra Padhye, Parveen Patel, Balaji Prabhakar, Sudipta Sengupta, and Murari Sridharan:”h]”hŒŽMohammad Alizadeh, Albert Greenberg, David A. Maltz, Jitendra Padhye, Parveen Patel, Balaji Prabhakar, Sudipta Sengupta, and Murari Sridharan:”…””}”(hj@hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h Khj<ubj0)”}”(hŒ^"Data Center TCP (DCTCP)", Data Center Networks session" Proc. ACM SIGCOMM, New Delhi, 2010. ”h]”(hÊ)”}”(hŒ8"Data Center TCP (DCTCP)", Data Center Networks session"”h]”hŒ>“Data Center TCP (DCTCP)â€, Data Center Networks session—…””}”(hjRhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K hjNubhÊ)”}”(hŒ#Proc. ACM SIGCOMM, New Delhi, 2010.”h]”hŒ#Proc. ACM SIGCOMM, New Delhi, 2010.”…””}”(hj`hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K"hjNubeh}”(h]”h ]”h"]”h$]”h&]”uh1j/hŸh³h K hj<ubhÊ)”}”(hŒƒhttp://simula.stanford.edu/~alizade/Site/DCTCP_files/dctcp-final.pdf http://www.sigcomm.org/ccr/papers/2010/October/1851275.1851192”h]”(hŒ reference”“”)”}”(hŒDhttp://simula.stanford.edu/~alizade/Site/DCTCP_files/dctcp-final.pdf”h]”hŒDhttp://simula.stanford.edu/~alizade/Site/DCTCP_files/dctcp-final.pdf”…””}”(hjzhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”Œrefuri”j|uh1jxhjtubhŒ ”…””}”(hjthžhhŸNh Nubjy)”}”(hŒ>http://www.sigcomm.org/ccr/papers/2010/October/1851275.1851192”h]”hŒ>http://www.sigcomm.org/ccr/papers/2010/October/1851275.1851192”…””}”(hjhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”Œrefuri”juh1jxhjtubeh}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K$hj<ubeh}”(h]”h ]”h"]”h$]”h&]”uh1j:hj7ubah}”(h]”h ]”h"]”h$]”h&]”Œenumtype”Œ lowerroman”Œprefix”hŒsuffix”Œ)”uh1j5hj1ubah}”(h]”h ]”h"]”h$]”h&]”uh1j/hŸh³h Khh¶hžhubj6)”}”(hhh]”j;)”}”(hŒìMohammad Alizadeh, Adel Javanmard, and Balaji Prabhakar: "Analysis of DCTCP: Stability, Convergence, and Fairness" Proc. ACM SIGMETRICS, San Jose, 2011. http://simula.stanford.edu/~alizade/Site/DCTCP_files/dctcp_analysis-full.pdf ”h]”(hÊ)”}”(hŒ8Mohammad Alizadeh, Adel Javanmard, and Balaji Prabhakar:”h]”hŒ8Mohammad Alizadeh, Adel Javanmard, and Balaji Prabhakar:”…””}”(hjÀhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K'hj¼ubj0)”}”(hŒ`"Analysis of DCTCP: Stability, Convergence, and Fairness" Proc. ACM SIGMETRICS, San Jose, 2011. ”h]”hÊ)”}”(hŒ_"Analysis of DCTCP: Stability, Convergence, and Fairness" Proc. ACM SIGMETRICS, San Jose, 2011.”h]”hŒc“Analysis of DCTCP: Stability, Convergence, and Fairness†Proc. ACM SIGMETRICS, San Jose, 2011.”…””}”(hjÒhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K)hjÎubah}”(h]”h ]”h"]”h$]”h&]”uh1j/hŸh³h K)hj¼ubhÊ)”}”(hŒLhttp://simula.stanford.edu/~alizade/Site/DCTCP_files/dctcp_analysis-full.pdf”h]”jy)”}”(hjèh]”hŒLhttp://simula.stanford.edu/~alizade/Site/DCTCP_files/dctcp_analysis-full.pdf”…””}”(hjêhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”Œrefuri”jèuh1jxhjæubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K,hj¼ubeh}”(h]”h ]”h"]”h$]”h&]”uh1j:hj¹hžhhŸh³h Nubah}”(h]”h ]”h"]”h$]”h&]”j®j¯j°hj±j²Œstart”Kuh1j5hh¶hžhhŸh³h K'ubhÊ)”}”(hŒIETF informational draft:”h]”hŒIETF informational draft:”…””}”(hj hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K.hh¶hžhubj0)”}”(hŒ7http://tools.ietf.org/html/draft-bensley-tcpm-dctcp-00 ”h]”hÊ)”}”(hŒ6http://tools.ietf.org/html/draft-bensley-tcpm-dctcp-00”h]”jy)”}”(hjh]”hŒ6http://tools.ietf.org/html/draft-bensley-tcpm-dctcp-00”…””}”(hj!hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”Œrefuri”juh1jxhjubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K0hjubah}”(h]”h ]”h"]”h$]”h&]”uh1j/hŸh³h K0hh¶hžhubhÊ)”}”(hŒ DCTCP site:”h]”hŒ DCTCP site:”…””}”(hj;hžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K2hh¶hžhubj0)”}”(hŒ3http://simula.stanford.edu/~alizade/Site/DCTCP.html”h]”hÊ)”}”(hjKh]”jy)”}”(hjKh]”hŒ3http://simula.stanford.edu/~alizade/Site/DCTCP.html”…””}”(hjPhžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”Œrefuri”jKuh1jxhjMubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhŸh³h K4hjIubah}”(h]”h ]”h"]”h$]”h&]”uh1j/hŸh³h K4hh¶hžhubeh}”(h]”Œdctcp-datacenter-tcp”ah ]”h"]”Œdctcp (datacenter tcp)”ah$]”h&]”uh1h´hhhžhhŸh³h Kubeh}”(h]”h ]”h"]”h$]”h&]”Œsource”h³uh1hŒcurrent_source”NŒ current_line”NŒsettings”Œdocutils.frontend”ŒValues”“”)”}”(h¹NŒ generator”NŒ datestamp”NŒ source_link”NŒ source_url”NŒ toc_backlinks”Œentry”Œfootnote_backlinks”KŒ sectnum_xform”KŒstrip_comments”NŒstrip_elements_with_classes”NŒ strip_classes”NŒ report_level”KŒ halt_level”KŒexit_status_level”KŒdebug”NŒwarning_stream”NŒ traceback”ˆŒinput_encoding”Œ utf-8-sig”Œinput_encoding_error_handler”Œstrict”Œoutput_encoding”Œutf-8”Œoutput_encoding_error_handler”j•Œerror_encoding”Œutf-8”Œerror_encoding_error_handler”Œbackslashreplace”Œ language_code”Œen”Œrecord_dependencies”NŒconfig”NŒ id_prefix”hŒauto_id_prefix”Œid”Œ dump_settings”NŒdump_internals”NŒdump_transforms”NŒdump_pseudo_xml”NŒexpose_internals”NŒstrict_visitor”NŒ_disable_config”NŒ_source”h³Œ _destination”NŒ _config_files”]”Œ7/var/lib/git/docbuild/linux/Documentation/docutils.conf”aŒfile_insertion_enabled”ˆŒ raw_enabled”KŒline_length_limit”M'Œpep_references”NŒ pep_base_url”Œhttps://peps.python.org/”Œpep_file_url_template”Œpep-%04d”Œrfc_references”NŒ rfc_base_url”Œ&https://datatracker.ietf.org/doc/html/”Œ tab_width”KŒtrim_footnote_reference_space”‰Œsyntax_highlight”Œlong”Œ smart_quotes”ˆŒsmartquotes_locales”]”Œcharacter_level_inline_markup”‰Œdoctitle_xform”‰Œ docinfo_xform”KŒsectsubtitle_xform”‰Œ image_loading”Œlink”Œembed_stylesheet”‰Œcloak_email_addresses”ˆŒsection_self_link”‰Œenv”NubŒreporter”NŒindirect_targets”]”Œsubstitution_defs”}”Œsubstitution_names”}”Œrefnames”}”Œrefids”}”Œnameids”}”jojlsŒ nametypes”}”jo‰sh}”jlh¶sŒ footnote_refs”}”Œ citation_refs”}”Œ autofootnotes”]”Œautofootnote_refs”]”Œsymbol_footnotes”]”Œsymbol_footnote_refs”]”Œ footnotes”]”Œ citations”]”Œautofootnote_start”KŒsymbol_footnote_start”KŒ id_counter”Œ collections”ŒCounter”“”}”…”R”Œparse_messages”]”hŒsystem_message”“”)”}”(hhh]”hÊ)”}”(hŒ;Enumerated list start value not ordinal-1: "ii" (ordinal 2)”h]”hŒ?Enumerated list start value not ordinal-1: “ii†(ordinal 2)”…””}”(hjühžhhŸNh Nubah}”(h]”h ]”h"]”h$]”h&]”uh1hÉhjùubah}”(h]”h ]”h"]”h$]”h&]”Œlevel”KŒtype”ŒINFO”Œsource”h³Œline”Kuh1j÷hh¶hžhhŸh³h K'ubaŒtransform_messages”]”Œ transformer”NŒ include_log”]”Œ decoration”Nhžhub.