RRUL best effort test.
<div><p>Effective congestion control on the internet has been a problem since its inception. Transmission Control Protocol (TCP), being the most widely used transport layer protocol tries to mitigate it using a variety of congestion control algorithms. Cubic, Reno, and Bottleneck Bandwid...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| منشور في: |
2024
|
| الموضوعات: | |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1852026445744832512 |
|---|---|
| author | Muhammad Ahsan (3744803) |
| author2 | Sajid S. Muhammad (17616232) |
| author2_role | author |
| author_facet | Muhammad Ahsan (3744803) Sajid S. Muhammad (17616232) |
| author_role | author |
| dc.creator.none.fl_str_mv | Muhammad Ahsan (3744803) Sajid S. Muhammad (17616232) |
| dc.date.none.fl_str_mv | 2024-09-23T17:30:21Z |
| dc.identifier.none.fl_str_mv | 10.1371/journal.pone.0304609.g017 |
| dc.relation.none.fl_str_mv | https://figshare.com/articles/figure/RRUL_best_effort_test_/27090438 |
| dc.rights.none.fl_str_mv | CC BY 4.0 info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Cell Biology Pharmacology Mental Health Space Science Biological Sciences not elsewhere classified Mathematical Sciences not elsewhere classified Chemical Sciences not elsewhere classified Information Systems not elsewhere classified various tests done novel pair based golden pair </ completely gels together active queue management transmission control protocol active buffer control deployed congestion controls congestion control race trip propagation time aqm work together aqm algorithm “< congestion control algorithms providing optimum throughput provide lower latency performed using flent div >< p effective congestion control wireless networks based congestion control lower latency optimum aqm time experiments better throughput algorithms try modern aqm superior performance problem since previously tested physical testbed paper proposes network layer modern aqms fq_codel ). fair queuing efficient performance bottleneck bandwidth avoid bufferbloat ac networks |
| dc.title.none.fl_str_mv | RRUL best effort test. |
| dc.type.none.fl_str_mv | Image Figure info:eu-repo/semantics/publishedVersion image |
| description | <div><p>Effective congestion control on the internet has been a problem since its inception. Transmission Control Protocol (TCP), being the most widely used transport layer protocol tries to mitigate it using a variety of congestion control algorithms. Cubic, Reno, and Bottleneck Bandwidth and Round-trip propagation time (BBR) are the most deployed congestion controls. BBR v2 is leading the congestion control race with its superior performance in terms of better throughput and lower latency. Furthermore, Active Queue Management (AQM) algorithms try to mitigate the congestion control at the network layer through active buffer control to avoid bufferbloat. The most efficient congestion control occurs when TCP and AQM work together. Indeed, it is the TCP-AQM algorithm “<i>Golden pair</i>” that can result in the most efficient performance. This paper proposes such a novel pair based on our previously tested and published BBR-n (BBR new) with the most effective of the modern AQMs, that completely gels together to provide lower latency in wireless networks based on Wireless N/AC. Real-time experiments were performed using Flent on our physical testbed with BBR-n and modern AQMs such as Fair Queuing (FQ), Constrained Delay (CoDel), Proportional Integral controller Enhanced (PIE), Common Applications Kept Enhanced (Cake) and Flow Queuing Controlled Delay (FQ_CoDel). Various tests done on our physical testbed helped us identify CAKE as the most optimum AQM that fits with our proposed BBR-n while providing optimum throughput and lower latency in 802.11N/AC-based wireless networks.</p></div> |
| eu_rights_str_mv | openAccess |
| id | Manara_b9be5dc016c141e6dec32024bf1870fb |
| identifier_str_mv | 10.1371/journal.pone.0304609.g017 |
| network_acronym_str | Manara |
| network_name_str | ManaraRepo |
| oai_identifier_str | oai:figshare.com:article/27090438 |
| publishDate | 2024 |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| rights_invalid_str_mv | CC BY 4.0 |
| spelling | RRUL best effort test.Muhammad Ahsan (3744803)Sajid S. Muhammad (17616232)Cell BiologyPharmacologyMental HealthSpace ScienceBiological Sciences not elsewhere classifiedMathematical Sciences not elsewhere classifiedChemical Sciences not elsewhere classifiedInformation Systems not elsewhere classifiedvarious tests donenovel pair basedgolden pair </completely gels togetheractive queue managementtransmission control protocolactive buffer controldeployed congestion controlscongestion control racetrip propagation timeaqm work togetheraqm algorithm “<congestion control algorithmsproviding optimum throughputprovide lower latencyperformed using flentdiv >< peffective congestion controlwireless networks basedcongestion controllower latencyoptimum aqmtime experimentsbetter throughputalgorithms trymodern aqmsuperior performanceproblem sincepreviously testedphysical testbedpaper proposesnetwork layermodern aqmsfq_codel ).fair queuingefficient performancebottleneck bandwidthavoid bufferbloatac networks<div><p>Effective congestion control on the internet has been a problem since its inception. Transmission Control Protocol (TCP), being the most widely used transport layer protocol tries to mitigate it using a variety of congestion control algorithms. Cubic, Reno, and Bottleneck Bandwidth and Round-trip propagation time (BBR) are the most deployed congestion controls. BBR v2 is leading the congestion control race with its superior performance in terms of better throughput and lower latency. Furthermore, Active Queue Management (AQM) algorithms try to mitigate the congestion control at the network layer through active buffer control to avoid bufferbloat. The most efficient congestion control occurs when TCP and AQM work together. Indeed, it is the TCP-AQM algorithm “<i>Golden pair</i>” that can result in the most efficient performance. This paper proposes such a novel pair based on our previously tested and published BBR-n (BBR new) with the most effective of the modern AQMs, that completely gels together to provide lower latency in wireless networks based on Wireless N/AC. Real-time experiments were performed using Flent on our physical testbed with BBR-n and modern AQMs such as Fair Queuing (FQ), Constrained Delay (CoDel), Proportional Integral controller Enhanced (PIE), Common Applications Kept Enhanced (Cake) and Flow Queuing Controlled Delay (FQ_CoDel). Various tests done on our physical testbed helped us identify CAKE as the most optimum AQM that fits with our proposed BBR-n while providing optimum throughput and lower latency in 802.11N/AC-based wireless networks.</p></div>2024-09-23T17:30:21ZImageFigureinfo:eu-repo/semantics/publishedVersionimage10.1371/journal.pone.0304609.g017https://figshare.com/articles/figure/RRUL_best_effort_test_/27090438CC BY 4.0info:eu-repo/semantics/openAccessoai:figshare.com:article/270904382024-09-23T17:30:21Z |
| spellingShingle | RRUL best effort test. Muhammad Ahsan (3744803) Cell Biology Pharmacology Mental Health Space Science Biological Sciences not elsewhere classified Mathematical Sciences not elsewhere classified Chemical Sciences not elsewhere classified Information Systems not elsewhere classified various tests done novel pair based golden pair </ completely gels together active queue management transmission control protocol active buffer control deployed congestion controls congestion control race trip propagation time aqm work together aqm algorithm “< congestion control algorithms providing optimum throughput provide lower latency performed using flent div >< p effective congestion control wireless networks based congestion control lower latency optimum aqm time experiments better throughput algorithms try modern aqm superior performance problem since previously tested physical testbed paper proposes network layer modern aqms fq_codel ). fair queuing efficient performance bottleneck bandwidth avoid bufferbloat ac networks |
| status_str | publishedVersion |
| title | RRUL best effort test. |
| title_full | RRUL best effort test. |
| title_fullStr | RRUL best effort test. |
| title_full_unstemmed | RRUL best effort test. |
| title_short | RRUL best effort test. |
| title_sort | RRUL best effort test. |
| topic | Cell Biology Pharmacology Mental Health Space Science Biological Sciences not elsewhere classified Mathematical Sciences not elsewhere classified Chemical Sciences not elsewhere classified Information Systems not elsewhere classified various tests done novel pair based golden pair </ completely gels together active queue management transmission control protocol active buffer control deployed congestion controls congestion control race trip propagation time aqm work together aqm algorithm “< congestion control algorithms providing optimum throughput provide lower latency performed using flent div >< p effective congestion control wireless networks based congestion control lower latency optimum aqm time experiments better throughput algorithms try modern aqm superior performance problem since previously tested physical testbed paper proposes network layer modern aqms fq_codel ). fair queuing efficient performance bottleneck bandwidth avoid bufferbloat ac networks |