An evaluation of bottleneck bandwidth and round trip time and its variants
Summary The congestion control mechanism is one of the most important components in Internet, which guarantees network normal operation and prevents network from congestion collapse. It is noticed that traditional loss‐based algorithms are not moving data very well in today's Internet. To get c...
Gespeichert in:
| Veröffentlicht in: | International journal of communication systems Jg. 34; H. 9 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Chichester
Wiley Subscription Services, Inc
01.06.2021
|
| Schlagworte: | |
| ISSN: | 1074-5351, 1099-1131 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Summary
The congestion control mechanism is one of the most important components in Internet, which guarantees network normal operation and prevents network from congestion collapse. It is noticed that traditional loss‐based algorithms are not moving data very well in today's Internet. To get channel resource highly utilized, such algorithms maintain a standing queue of packets at bottleneck and cause large transmission delay. Recently, effort has been devoted from academia and industry to design new solution which could achieve high throughput and low transmission delay simultaneously. There are several fruitful results such as the bottleneck bandwidth and round trip time (BBR) and Vivace, Copa, Cellular Controlled delay TCP (C2TCP). Among them, BBR is the most eminent one. There are other variant algorithms by modifying some parameters in BBR for possible improvement, and BBR has also evolved drastically into version 2 (BBRv2). In this work, a framework is implemented to evaluate the performance of these algorithms on ns3. Interested readers could test other congestion control algorithms or design new methods. Moreover, this work can work as reference for engineers to tune parameters in BBR or choose other solutions for their applications.
We present a framework to evaluate the performance of several recently proposed congestion control algorithms (BBR, BBR', BBRPlus, BBR+, Tsunami BBR v2, Vivace, Copa, and C2TCP) on ns3 platform. Parameters involved in evaluation are inter‐protocol fairness, packet loss rate, one‐way transmission delay, and channel utilization. Interested reader could develop and test new congestion schemes in an easier way. |
|---|---|
| AbstractList | The congestion control mechanism is one of the most important components in Internet, which guarantees network normal operation and prevents network from congestion collapse. It is noticed that traditional loss‐based algorithms are not moving data very well in today's Internet. To get channel resource highly utilized, such algorithms maintain a standing queue of packets at bottleneck and cause large transmission delay. Recently, effort has been devoted from academia and industry to design new solution which could achieve high throughput and low transmission delay simultaneously. There are several fruitful results such as the bottleneck bandwidth and round trip time (BBR) and Vivace, Copa, Cellular Controlled delay TCP (C2TCP). Among them, BBR is the most eminent one. There are other variant algorithms by modifying some parameters in BBR for possible improvement, and BBR has also evolved drastically into version 2 (BBRv2). In this work, a framework is implemented to evaluate the performance of these algorithms on ns3. Interested readers could test other congestion control algorithms or design new methods. Moreover, this work can work as reference for engineers to tune parameters in BBR or choose other solutions for their applications. Summary The congestion control mechanism is one of the most important components in Internet, which guarantees network normal operation and prevents network from congestion collapse. It is noticed that traditional loss‐based algorithms are not moving data very well in today's Internet. To get channel resource highly utilized, such algorithms maintain a standing queue of packets at bottleneck and cause large transmission delay. Recently, effort has been devoted from academia and industry to design new solution which could achieve high throughput and low transmission delay simultaneously. There are several fruitful results such as the bottleneck bandwidth and round trip time (BBR) and Vivace, Copa, Cellular Controlled delay TCP (C2TCP). Among them, BBR is the most eminent one. There are other variant algorithms by modifying some parameters in BBR for possible improvement, and BBR has also evolved drastically into version 2 (BBRv2). In this work, a framework is implemented to evaluate the performance of these algorithms on ns3. Interested readers could test other congestion control algorithms or design new methods. Moreover, this work can work as reference for engineers to tune parameters in BBR or choose other solutions for their applications. We present a framework to evaluate the performance of several recently proposed congestion control algorithms (BBR, BBR', BBRPlus, BBR+, Tsunami BBR v2, Vivace, Copa, and C2TCP) on ns3 platform. Parameters involved in evaluation are inter‐protocol fairness, packet loss rate, one‐way transmission delay, and channel utilization. Interested reader could develop and test new congestion schemes in an easier way. |
| Author | Zhang, Songyang Lei, Weimin Zhang, Wei Li, Hao |
| Author_xml | – sequence: 1 givenname: Songyang orcidid: 0000-0002-9297-0201 surname: Zhang fullname: Zhang, Songyang organization: Northeastern University – sequence: 2 givenname: Weimin surname: Lei fullname: Lei, Weimin email: leiweimin@ise.neu.edu.cn organization: Ministry of Education – sequence: 3 givenname: Wei orcidid: 0000-0001-7446-4025 surname: Zhang fullname: Zhang, Wei organization: Northeastern University – sequence: 4 givenname: Hao surname: Li fullname: Li, Hao organization: Northeastern University |
| BookMark | eNp1kE9LAzEQxYMo2FbBjxDw4mVrkt3sZo-l_qfgRc9hNsli6japSbal395t60n0MvMYfm-GeWN06rwzCF1RMqWEsFsNalpUFTtBI0rqOqM0p6d7XRUZzzk9R-MYl4QQwUo-Qi8zh80Guh6S9Q77Fjc-pc44oz5xA05vrU4feBA4-H6oKdg1TnZlDjObIt5AsOBSvEBnLXTRXP70CXp_uH-bP2WL18fn-WyRKVbnLKNFrjgpNQOlc1O3gy65UgCN5oZUyghRtFAVRtclb0uqAYRRXENTKpEXIp-g6-PedfBfvYlJLn0f3HBSMs5oIYTg1UBNj5QKPsZgWqlsOjyZAthOUiL3eckhL7nPazDc_DKsg11B2P2FZkd0azuz-5eTd7P5gf8GO0p7nA |
| CitedBy_id | crossref_primary_10_1002_ett_4331 crossref_primary_10_1016_j_comnet_2024_110237 crossref_primary_10_3390_fi16090330 |
| Cites_doi | 10.3390/electronics9010136 10.1145/1851275.1851192 10.1109/TNET.2006.886335 10.1109/TNET.2017.2703615 10.23919/IFIPNetworking.2018.8696830 10.1109/INFOCOM.2006.188 10.1145/263932.264023 10.1145/3232755.3232783 10.1145/2063166.2071893 10.1109/JSAC.2002.807336 10.1023/A:1016590112381 10.1109/49.464716 10.1109/90.251892 10.1016/j.comcom.2020.07.018 10.1145/3012426.3022184 10.1145/2209249.2209264 10.1016/0166-5316(81)90052-3 10.1145/3371934.3371956 10.1145/52325.52356 10.1109/JSAC.2019.2898758 10.1109/JSYST.2019.2896195 10.1145/2534169.2486020 10.1109/HPSR.2013.6602305 10.1016/j.comcom.2019.05.011 10.1109/ICNP.2017.8117540 10.1145/3300061.3300123 10.1145/1400097.1400105 10.1145/3098822.3098842 |
| ContentType | Journal Article |
| Copyright | 2021 John Wiley & Sons, Ltd. |
| Copyright_xml | – notice: 2021 John Wiley & Sons, Ltd. |
| DBID | AAYXX CITATION 7SP 8FD JQ2 L7M |
| DOI | 10.1002/dac.4772 |
| DatabaseName | CrossRef Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace |
| DatabaseTitle | CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts ProQuest Computer Science Collection |
| DatabaseTitleList | CrossRef Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1099-1131 |
| EndPage | n/a |
| ExternalDocumentID | 10_1002_dac_4772 DAC4772 |
| Genre | article |
| GrantInformation_xml | – fundername: National Key Research and Development Program of China funderid: 2018YFB1702000 – fundername: National Natural Science Foundation of China funderid: 61671141 – fundername: Fundamental Research Funds for the Central Universities funderid: N2024005‐1 |
| GroupedDBID | .3N .GA .Y3 05W 0R~ 10A 1L6 1OB 1OC 31~ 33P 3SF 3WU 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5VS 66C 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 930 A03 AAESR AAEVG AAHHS AAHQN AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABDBF ABEML ABIJN ABPVW ACAHQ ACBWZ ACCFJ ACCZN ACGFS ACIWK ACPOU ACRPL ACSCC ACUHS ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADNMO ADOZA ADXAS ADZMN ADZOD AEEZP AEIGN AEIMD AENEX AEQDE AEUQT AEUYR AFBPY AFFPM AFGKR AFPWT AFWVQ AFZJQ AHBTC AITYG AIURR AIWBW AJBDE AJXKR ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BMXJE BNHUX BROTX BRXPI BY8 CMOOK CS3 D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM DU5 EBS EJD ESX F00 F01 F04 FEDTE G-S G.N GNP GODZA H.T H.X HF~ HGLYW HHY HVGLF HZ~ I-F IX1 J0M JPC KQQ LATKE LAW LC2 LC3 LEEKS LITHE LOXES LP6 LP7 LUTES LYRES MEWTI MK4 MK~ ML~ MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A NF~ O66 O9- OIG P2W P2X P4D PALCI Q.N Q11 QB0 QRW R.K RIWAO ROL RWI RX1 RYL SAMSI SUPJJ TUS UB1 V2E W8V W99 WBKPD WIH WIK WLBEL WOHZO WQJ WRC WWI WXSBR WYISQ XG1 XV2 ZZTAW ~IA ~WT AAMMB AAYXX AEFGJ AEYWJ AGHNM AGQPQ AGXDD AGYGG AIDQK AIDYY AIQQE CITATION O8X 7SP 8FD JQ2 L7M |
| ID | FETCH-LOGICAL-c2932-143c506d2acd3e9f50665ccaabd5e07ce884fa74ed965f61daa8ec5dab6c83483 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000631784600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1074-5351 |
| IngestDate | Fri Jul 25 12:06:49 EDT 2025 Sat Nov 29 03:54:55 EST 2025 Tue Nov 18 20:02:55 EST 2025 Wed Jan 22 16:29:10 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 9 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c2932-143c506d2acd3e9f50665ccaabd5e07ce884fa74ed965f61daa8ec5dab6c83483 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-9297-0201 0000-0001-7446-4025 |
| PQID | 2521488857 |
| PQPubID | 996367 |
| PageCount | 23 |
| ParticipantIDs | proquest_journals_2521488857 crossref_citationtrail_10_1002_dac_4772 crossref_primary_10_1002_dac_4772 wiley_primary_10_1002_dac_4772_DAC4772 |
| PublicationCentury | 2000 |
| PublicationDate | June 2021 2021-06-00 20210601 |
| PublicationDateYYYYMMDD | 2021-06-01 |
| PublicationDate_xml | – month: 06 year: 2021 text: June 2021 |
| PublicationDecade | 2020 |
| PublicationPlace | Chichester |
| PublicationPlace_xml | – name: Chichester |
| PublicationTitle | International journal of communication systems |
| PublicationYear | 2021 |
| Publisher | Wiley Subscription Services, Inc |
| Publisher_xml | – name: Wiley Subscription Services, Inc |
| References | 1988; 18 2017; 25 2013; 43 1981; 1 2019; 13 1995; 13 2019; 37 2006; 14 2002; 8 2020; 161 2006 1997; 27 1993; 1 2012; 55 2016; 14 2019; 144 1979 2010; 40 2011; 9 2020; 9 2019 2019; 49 2018 2017 2008; 42 2013 2003; 21 e_1_2_11_10_1 e_1_2_11_32_1 e_1_2_11_31_1 e_1_2_11_30_1 e_1_2_11_36_1 e_1_2_11_14_1 e_1_2_11_13_1 e_1_2_11_35_1 e_1_2_11_12_1 e_1_2_11_34_1 e_1_2_11_11_1 e_1_2_11_33_1 e_1_2_11_7_1 e_1_2_11_29_1 e_1_2_11_6_1 e_1_2_11_28_1 e_1_2_11_5_1 e_1_2_11_27_1 e_1_2_11_4_1 e_1_2_11_26_1 e_1_2_11_3_1 e_1_2_11_2_1 e_1_2_11_21_1 e_1_2_11_20_1 e_1_2_11_25_1 e_1_2_11_24_1 e_1_2_11_9_1 e_1_2_11_23_1 e_1_2_11_8_1 e_1_2_11_22_1 e_1_2_11_18_1 e_1_2_11_17_1 e_1_2_11_16_1 e_1_2_11_15_1 e_1_2_11_37_1 e_1_2_11_38_1 e_1_2_11_19_1 |
| References_xml | – volume: 14 start-page: 1246 issue: 6 year: 2006 end-page: 1259 article-title: FAST TCP: motivation, architecture, algorithms, performance publication-title: IEEE/ACM Trans Netw – volume: 27 start-page: 67 issue: 3 year: 1997 end-page: 82 article-title: The macroscopic behavior of the TCP congestion avoidance algorithm publication-title: SIGCOMM Comput Commun Rev – volume: 14 start-page: 20 issue: 5 year: 2016 end-page: 53 article-title: BBR: congestion‐based congestion control publication-title: Queue – volume: 9 start-page: 1 issue: 1 year: 2020 end-page: 19 article-title: BBR‐ACD: BBR with advanced congestion detection publication-title: Electronics – start-page: 329 year: 2018 end-page: 342 – volume: 13 start-page: 1465 issue: 8 year: 1995 end-page: 1480 article-title: TCP vegas: end to end congestion avoidance on a global internet publication-title: IEEE J Sel Areas Commun – volume: 25 start-page: 2629 issue: 5 year: 2017 end-page: 2642 article-title: Congestion control for web real‐time communication publication-title: IEEE/ACM Trans Netw – volume: 42 start-page: 64 issue: 5 year: 2008 end-page: 74 article-title: Cubic: A new TCP‐friendly high‐speed TCP variant publication-title: ACM SIGOPS Operating Syst Rev – volume: 55 start-page: 42 issue: 7 year: 2012 end-page: 50 article-title: Controlling queue delay publication-title: Commun ACM – volume: 13 start-page: 1336 issue: 2 year: 2019 end-page: 1346 article-title: Elastic‐TCP: elexible congestion control algorithm to adapt for high‐BDP networks publication-title: IEEE Syst J – volume: 18 start-page: 314 issue: 4 year: 1988 end-page: 329 article-title: Congestion avoidance and control publication-title: SIGCOMM Comput Commun Rev – volume: 21 start-page: 216 issue: 2 year: 2003 end-page: 228 article-title: TCP veno: TCP enhancement for transmission over wireless access networks publication-title: IEEE J Sel Areas Commun – volume: 37 start-page: 918 issue: 4 year: 2019 end-page: 932 article-title: C2tcp: A flexible cellular TCP to meet stringent delay requirements publication-title: IEEE J Sel Areas Commun – start-page: 148 year: 2013 end-page: 155 – volume: 43 start-page: 123 issue: 4 year: 2013 end-page: 134 article-title: TCP ex machina: computer‐generated congestion control publication-title: SIGCOMM Comput Commun Rev – volume: 144 start-page: 31 year: 2019 end-page: 43 article-title: Reproducible measurements of TCP BBR congestion control publication-title: Compu Commun – start-page: 183 year: 2017 end-page: 196 – start-page: 343 year: 2018 end-page: 356 – volume: 8 start-page: 467 issue: 5 year: 2002 end-page: 479 article-title: TCP westwood: end‐to‐end congestion control for wired/wireless networks publication-title: Wirel Netw – volume: 1 start-page: 95 issue: 1 year: 1981 article-title: Flow control power is non‐decentralizable publication-title: Perform Eval – volume: 49 start-page: 63 issue: 5 year: 2019 end-page: 68 article-title: Deprecating the TCP macroscopic model publication-title: SIGCOMM Comput Commun Rev – start-page: 1 year: 2006 end-page: 12 – start-page: 1 year: 2017 end-page: 10 – volume: 1 start-page: 397 issue: 4 year: 1993 end-page: 413 article-title: Random early detection gateways for congestion avoidance publication-title: IEEE/ACM Trans Netw – start-page: 1 year: 2018 end-page: 9 – volume: 161 start-page: 212 year: 2020 end-page: 224 article-title: An emulation‐based evaluation of TCP BBRv2 alpha for wired broadband publication-title: Computer Commun – start-page: 18:1 year: 2019 end-page: 18:16 – volume: 40 start-page: 63 issue: 4 year: 2010 end-page: 74 article-title: Data center TCP (dctcp) publication-title: SIGCOMM Comput Commun Rev – year: 2017 – year: 2019 – volume: 9 start-page: 1 issue: 11 year: 2011 end-page: 15 article-title: Bufferbloat: dark buffers in the internet publication-title: Queue – start-page: 1 year: 1979 end-page: 10 – year: 2013 – ident: e_1_2_11_13_1 – ident: e_1_2_11_33_1 doi: 10.3390/electronics9010136 – ident: e_1_2_11_35_1 doi: 10.1145/1851275.1851192 – ident: e_1_2_11_21_1 doi: 10.1109/TNET.2006.886335 – ident: e_1_2_11_22_1 doi: 10.1109/TNET.2017.2703615 – ident: e_1_2_11_31_1 doi: 10.23919/IFIPNetworking.2018.8696830 – ident: e_1_2_11_3_1 doi: 10.1109/INFOCOM.2006.188 – ident: e_1_2_11_5_1 doi: 10.1145/263932.264023 – ident: e_1_2_11_9_1 doi: 10.1145/3232755.3232783 – ident: e_1_2_11_6_1 doi: 10.1145/2063166.2071893 – ident: e_1_2_11_10_1 – ident: e_1_2_11_19_1 doi: 10.1109/JSAC.2002.807336 – ident: e_1_2_11_18_1 doi: 10.1023/A:1016590112381 – ident: e_1_2_11_20_1 doi: 10.1109/49.464716 – ident: e_1_2_11_37_1 doi: 10.1109/90.251892 – ident: e_1_2_11_38_1 doi: 10.1016/j.comcom.2020.07.018 – ident: e_1_2_11_7_1 doi: 10.1145/3012426.3022184 – ident: e_1_2_11_24_1 doi: 10.1145/2209249.2209264 – ident: e_1_2_11_8_1 – ident: e_1_2_11_27_1 doi: 10.1016/0166-5316(81)90052-3 – ident: e_1_2_11_28_1 doi: 10.1145/3371934.3371956 – ident: e_1_2_11_2_1 doi: 10.1145/52325.52356 – ident: e_1_2_11_16_1 doi: 10.1109/JSAC.2019.2898758 – ident: e_1_2_11_26_1 – ident: e_1_2_11_34_1 – ident: e_1_2_11_11_1 – ident: e_1_2_11_15_1 doi: 10.1109/JSYST.2019.2896195 – ident: e_1_2_11_23_1 doi: 10.1145/2534169.2486020 – ident: e_1_2_11_25_1 doi: 10.1109/HPSR.2013.6602305 – ident: e_1_2_11_32_1 doi: 10.1016/j.comcom.2019.05.011 – ident: e_1_2_11_17_1 – ident: e_1_2_11_29_1 doi: 10.1109/ICNP.2017.8117540 – ident: e_1_2_11_12_1 doi: 10.1145/3300061.3300123 – ident: e_1_2_11_14_1 – ident: e_1_2_11_4_1 doi: 10.1145/1400097.1400105 – ident: e_1_2_11_36_1 doi: 10.1145/3098822.3098842 – ident: e_1_2_11_30_1 |
| SSID | ssj0008265 |
| Score | 2.2384 |
| Snippet | Summary
The congestion control mechanism is one of the most important components in Internet, which guarantees network normal operation and prevents network... The congestion control mechanism is one of the most important components in Internet, which guarantees network normal operation and prevents network from... |
| SourceID | proquest crossref wiley |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| SubjectTerms | Algorithms bandwidth fairness Bandwidths BBR Congestion congestion control Control algorithms Delay Internet ns3 simulation Parameter modification Performance evaluation |
| Title | An evaluation of bottleneck bandwidth and round trip time and its variants |
| URI | https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fdac.4772 https://www.proquest.com/docview/2521488857 |
| Volume | 34 |
| WOSCitedRecordID | wos000631784600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVWIB databaseName: Wiley Online Library - Journals customDbUrl: eissn: 1099-1131 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0008265 issn: 1074-5351 databaseCode: DRFUL dateStart: 19960101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwED9080Ef_BanUyKIPhXbtGnSx7E5RGSIONhbyScOpZO1zn_fpGu3CQqCTw3lQstdcvdLcvkdwKXhsQhCTT1jeOhFmmhP-Ip6vqY-UUooGqmy2AQdDNholDxWWZXuLsycH2Kx4eZmRumv3QTnIr9ZkoYq-73IYsN1aLo7VXbh1ew99YcPCz9sgTOpMw5JSIKaetbHN3Xf78FoiTBXcWoZaPo7__nFXdiu4CXqzMfDHqzpbB-2VkgHD-C-k6ElxzeaGOSqidngo-UrEjxTn2NVvCDbQFNXcwkV1q8gV4O-fDcucjSzC2yXP3MIw_7tc_fOqyoqeNKGdexZcCSJHyvMpQp1Yog7eLE25EIR7VOpGYsMp5FWSUxMHCjOmZZEcRFLFkYsPIJGNsn0MSAZYKwYVu5gMMKBSKzNEyqIYdKiSo5bcF2rNpUV3birevGWzomScWq1kzrttOBiIfk-p9j4QaZdWyetJlmeYgs9rP9hhLbgqrTDr_3TXqfrnid_FTyFTeyyV8r9ljY0iumHPoMNOSvG-fS8GmpfbEfX_A |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3fS8MwED7mFNQHf4vTqRFEn8ratGlSfBqbY-ocIhvsraRJikPpZKvz3zfp2m2CguBTS7nQcpe7-5pcvgO4jLkfOa6iVhxz1_IUUVZkS2rZitpEykhST2bNJmi3ywaD4KkEN8VZmBk_xHzBzXhGFq-Ng5sF6dqCNVTqF3oaHK7Aque7lJVhtfnc6nfmgVgjZ1KUHBKXOAX3rI1rxdjv2WgBMZeBapZpWtv_-sYd2MoBJqrPZsQulFSyB5tLtIP7cF9P0ILlG41iZPqJ6fSjxCuKeCI_hzJ9QfoGjU3XJZTqyIJMF_rs2TCdoKn-xTYVNAfQb932Gm0r76lgCZ3YsaXhkSC2LzEX0lVBTMzWi7YijyRRNhWKMS_m1FMy8EnsO5JzpgSRPPIFcz3mHkI5GSXqCJBwMJYMS7M16GEnCrTVAxqRmAmNKzmuwHWh21DkhOOm78VbOKNKxqHWTmi0U4GLueT7jGTjB5lqYZ4wd7NJiDX40BGIEVqBq8wQv44Pm_WGuR7_VfAc1tu9x07Yues-nMAGNrUs2epLFcrp-EOdwpqYpsPJ-Cyfd19hFNvs |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3fa9swED6yZIz2odvalWXLNg3G-mRqy5Ils6eQLOxHCGEskDcj6yQWNpyQeOm_P8mxkxRaKOzJxpywudPdfZZO3wF8sCrJo9iIwFoVB8xwE-QhiiA0IuSIOQqGVbMJMZnI-TydtuBTcxZmxw-xX3DznlHFa-_gZoX2-sAaiu6FzIHDR9BhPOWsDZ3hj9FsvA_EDjnzpuSQxzxquGdDet2MvZ2NDhDzGKhWmWb09L--8Rmc1QCT9Hcz4jm0THEOp0e0gxfwrV-QA8s3WVri-4m59GP0b5KrAm8WWP4i7oasfdclUrrIQnwX-urZotyQrfvF9hU0L2A2-vxz8CWoeyoE2iV2Gjh4pHmYIFUaY5Na7rdenBVVjtyEQhspmVWCGUwTbpMIlZJGc1R5omXMZHwJ7WJZmJdAdEQpSop-a5DRKE-d1VORcyu1w5WKduGq0W2ma8Jx3_fiT7ajSqaZ007mtdOF93vJ1Y5k4w6ZXmOerHazTUYd-HARSHLRhY-VIe4dnw37A3999VDBd_BkOhxl46-T76_hhPpSlmrxpQftcv3XvIHHelsuNuu39bT7ByG522c |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+evaluation+of+bottleneck+bandwidth+and+round+trip+time+and+its+variants&rft.jtitle=International+journal+of+communication+systems&rft.au=Zhang%2C+Songyang&rft.au=Lei%2C+Weimin&rft.au=Zhang%2C+Wei&rft.au=Li%2C+Hao&rft.date=2021-06-01&rft.pub=Wiley+Subscription+Services%2C+Inc&rft.issn=1074-5351&rft.eissn=1099-1131&rft.volume=34&rft.issue=9&rft_id=info:doi/10.1002%2Fdac.4772&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1074-5351&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1074-5351&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1074-5351&client=summon |