{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/109636"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/109636","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Cross flow control with weighted fairness and TCP friendliness","abstract":"A variety of congestion control algorithms were proposed during the past two decades to make the greatest use of the network without congesting the bottleneck link, and they have raised the discussion of fairness and friendliness among flows in the bottleneck link. Meanwhile, large companies or clusters have considerable needs for shaping their own flows while maintaining friendliness to other flows in the network. This thesis proposes a novel cross flow congestion control scheme to achieve weighted fairness among flows owned by clusters and friendliness between those flows and network traffic. The control scheme can be applied to both window-based and rate-based congestion control algorithms, and it is implemented for TCP Cubic (window-based) and TFRC (rate-based). We combine ns-3 simulation, emulation and Linux implementation to demonstrate the cross-flow control. Specifically, weighted fairness is achieved with a reasonable number of flows without losing the friendliness.","abstract_html":"A variety of congestion control algorithms were proposed during the past two decades to make the greatest use of the network without congesting the bottleneck link, and they have raised the discussion of fairness and friendliness among flows in the bottleneck link. Meanwhile, large companies or clusters have considerable needs for shaping their own flows while maintaining friendliness to other flows in the network. This thesis proposes a novel cross flow congestion control scheme to achieve weighted fairness among flows owned by clusters and friendliness between those flows and network traffic. The control scheme can be applied to both window-based and rate-based congestion control algorithms, and it is implemented for TCP Cubic (window-based) and TFRC (rate-based). We combine ns-3 simulation, emulation and Linux implementation to demonstrate the cross-flow control. Specifically, weighted fairness is achieved with a reasonable number of flows without losing the friendliness.","abstract_has_math":false,"creators":["Song, Jinhui"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Hu, Yih-Chun"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2021,"date_issued":"2021-03-05T21:47:34Z","date_published":"2021-03-05T21:47:34Z","updated_at":"2026-07-22T22:24:50Z","subjects":["Weighted fairness","flow shaping","congestion control."],"languages":["en"],"rights":["Copyright 2020 Jinhui Song"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/109636","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Hu, Yih-Chun"]},{"key":"dc:creator","label":"Author","values":["Song, Jinhui"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2021-03-05T21:47:34Z","2023-03-05T21:47:41Z","2020-12-07","2020-12"]},{"key":"dc:type","label":"Dc Type","values":["text","Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Weighted fairness","flow shaping","congestion control."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2020 Jinhui Song"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/109636"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["A variety of congestion control algorithms were proposed during the past two decades to make the greatest use of the network without congesting the bottleneck link, and they have raised the discussion of fairness and friendliness among flows in the bottleneck link. Meanwhile, large companies or clusters have considerable needs for shaping their own flows while maintaining friendliness to other flows in the network. This thesis proposes a novel cross flow congestion control scheme to achieve weighted fairness among flows owned by clusters and friendliness between those flows and network traffic. The control scheme can be applied to both window-based and rate-based congestion control algorithms, and it is implemented for TCP Cubic (window-based) and TFRC (rate-based). We combine ns-3 simulation, emulation and Linux implementation to demonstrate the cross-flow control. Specifically, weighted fairness is achieved with a reasonable number of flows without losing the friendliness.","Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2022-12-01","The student, Jinhui Song, accepted the attached license on 2020-12-07 at 15:17.","The student, Jinhui Song, submitted this Thesis for approval on 2020-12-07 at 15:28.","This Thesis was approved for publication on 2020-12-07 at 16:07.","DSpace SAF Submission Ingestion Package generated from Vireo submission #16084 on 2021-03-04 at 16:33:50","Made available in DSpace on 2021-03-05T21:47:34Z (GMT). No. of bitstreams: 2 SONG-THESIS-2020.pdf: 1402800 bytes, checksum: 7ab8f1290c8bb2ad17d5562add9338bc (MD5) LICENSE.txt: 4208 bytes, checksum: cc0cf5671ccaf55347a839d8a6ae0f83 (MD5) Previous issue date: 2020-12-07","Embargo set by: Seth Robbins for item 117342 Lift date: 2023-03-05T21:47:41Z Reason: Author requested closed access (OA after 2yrs) in Vireo ETD system","Author requested closed access (OA after 2yrs) in Vireo ETD system","Limited"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Cross flow control with weighted fairness and TCP friendliness"]}]}],"canonical_facts":{"dc:contributor":["Hu, Yih-Chun"],"dc:creator":["Song, Jinhui"],"dc:date":["2021-03-05T21:47:34Z","2023-03-05T21:47:41Z","2020-12-07","2020-12"],"dc:description":["A variety of congestion control algorithms were proposed during the past two decades to make the greatest use of the network without congesting the bottleneck link, and they have raised the discussion of fairness and friendliness among flows in the bottleneck link. Meanwhile, large companies or clusters have considerable needs for shaping their own flows while maintaining friendliness to other flows in the network. This thesis proposes a novel cross flow congestion control scheme to achieve weighted fairness among flows owned by clusters and friendliness between those flows and network traffic. The control scheme can be applied to both window-based and rate-based congestion control algorithms, and it is implemented for TCP Cubic (window-based) and TFRC (rate-based). We combine ns-3 simulation, emulation and Linux implementation to demonstrate the cross-flow control. Specifically, weighted fairness is achieved with a reasonable number of flows without losing the friendliness.","Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2022-12-01","The student, Jinhui Song, accepted the attached license on 2020-12-07 at 15:17.","The student, Jinhui Song, submitted this Thesis for approval on 2020-12-07 at 15:28.","This Thesis was approved for publication on 2020-12-07 at 16:07.","DSpace SAF Submission Ingestion Package generated from Vireo submission #16084 on 2021-03-04 at 16:33:50","Made available in DSpace on 2021-03-05T21:47:34Z (GMT). No. of bitstreams: 2 SONG-THESIS-2020.pdf: 1402800 bytes, checksum: 7ab8f1290c8bb2ad17d5562add9338bc (MD5) LICENSE.txt: 4208 bytes, checksum: cc0cf5671ccaf55347a839d8a6ae0f83 (MD5) Previous issue date: 2020-12-07","Embargo set by: Seth Robbins for item 117342 Lift date: 2023-03-05T21:47:41Z Reason: Author requested closed access (OA after 2yrs) in Vireo ETD system","Author requested closed access (OA after 2yrs) in Vireo ETD system","Limited"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/109636"],"dc:language":["en"],"dc:rights":["Copyright 2020 Jinhui Song"],"dc:subject":["Weighted fairness","flow shaping","congestion control."],"dc:title":["Cross flow control with weighted fairness and TCP friendliness"],"dc:type":["text","Thesis"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:50Z"}