Dual-Resource TCP/AQM for Processing-Constrained Networks

This paper examines congestion control issues for TCP flows that require in-network processing on the fly in network elements such as gateways, proxies, firewalls and even routers. Applications of these flows are increasingly abundant in the future as the Internet evolves. Since these flows require...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE/ACM transactions on networking Ročník 16; číslo 2; s. 435 - 449
Hlavní autoři:	Minsu Shin, Song Chong, Rhee, I.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.04.2008 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Approximation Audio compression Bandwidth Cellular phones Central processing units Computer science Congestion Costs CPU capacity efficiency Explosives fairness Internet Internet telephony Networks Optical fiber networks proportional fairness Queues Studies TCP (protocol) TCP-AQM TCP-IP Throughput Transcoding transmission link capacity
ISSN:	1063-6692, 1558-2566
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	This paper examines congestion control issues for TCP flows that require in-network processing on the fly in network elements such as gateways, proxies, firewalls and even routers. Applications of these flows are increasingly abundant in the future as the Internet evolves. Since these flows require use of CPUs in network elements, both bandwidth and CPU resources can be a bottleneck and thus congestion control must deal with ldquocongestionrdquo on both of these resources. In this paper, we show that conventional TCP/AQM schemes can significantly lose throughput and suffer harmful unfairness in this environment, particularly when CPU cycles become more scarce (which is likely the trend given the recent explosive growth rate of bandwidth). As a solution to this problem, we establish a notion of dual-resource proportional fairness and propose an AQM scheme, called Dual-Resource Queue (DRQ), that can closely approximate proportional fairness for TCP Reno sources with in-network processing requirements. DRQ is scalable because it does not maintain per-flow states while minimizing communication among different resource queues, and is also incrementally deployable because of no required change in TCP stacks. The simulation study shows that DRQ approximates proportional fairness without much implementation cost and even an incremental deployment of DRQ at the edge of the Internet improves the fairness and throughput of these TCP flows. Our work is at its early stage and might lead to an interesting development in congestion control research.
AbstractList	Applications of these flows are increasingly abundant in the future as the Internet evolves. Since these flows require use of CPUs in network elements, both bandwidth and CPU resources can be a bottleneck and thus congestion control must deal with ldquocongestionrdquo on both of these resources. This paper examines congestion control issues for TCP flows that require in-network processing on the fly in network elements such as gateways, proxies, firewalls and even routers. Applications of these flows are increasingly abundant in the future as the Internet evolves. Since these flows require use of CPUs in network elements, both bandwidth and CPU resources can be a bottleneck and thus congestion control must deal with ldquocongestionrdquo on both of these resources. In this paper, we show that conventional TCP/AQM schemes can significantly lose throughput and suffer harmful unfairness in this environment, particularly when CPU cycles become more scarce (which is likely the trend given the recent explosive growth rate of bandwidth). As a solution to this problem, we establish a notion of dual-resource proportional fairness and propose an AQM scheme, called Dual-Resource Queue (DRQ), that can closely approximate proportional fairness for TCP Reno sources with in-network processing requirements. DRQ is scalable because it does not maintain per-flow states while minimizing communication among different resource queues, and is also incrementally deployable because of no required change in TCP stacks. The simulation study shows that DRQ approximates proportional fairness without much implementation cost and even an incremental deployment of DRQ at the edge of the Internet improves the fairness and throughput of these TCP flows. Our work is at its early stage and might lead to an interesting development in congestion control research. This paper examines congestion control issues for TCP flows that require in-network processing on the fly in network elements such as gateways, proxies, firewalls and even routers. Applications of these flows are increasingly abundant in the future as the Internet evolves. Since these flows require use of CPUs in network elements, both bandwidth and CPU resources can be a bottleneck and thus congestion control must deal with "congestion" on both of these resources. In this paper, we show that conventional TCP/AQM schemes can significantly lose throughput and suffer harmful unfairness in this environment, particularly when CPU cycles become more scarce (which is likely the trend given the recent explosive growth rate of bandwidth). As a solution to this problem, we establish a notion of dual-resource proportional fairness and propose an AQM scheme, called Dual-Resource Queue (DRQ), that can closely approximate proportional fairness for TCP Reno sources with in-network processing requirements. DRQ is scalable because it does not maintain per-flow states while minimizing communication among different resource queues, and is also incrementally deployable because of no required change in TCP stacks. The simulation study shows that DRQ approximates proportional fairness without much implementation cost and even an incremental deployment of DRQ at the edge of the Internet improves the fairness and throughput of these TCP flows. Our work is at its early stage and might lead to an interesting development in congestion control research.
Author	Minsu Shin Rhee, I. Song Chong
Author_xml	– sequence: 1 surname: Minsu Shin fullname: Minsu Shin organization: Korea Adv. Inst. of Sci. & Technol. (KAIST), Daejeon – sequence: 2 surname: Song Chong fullname: Song Chong organization: Korea Adv. Inst. of Sci. & Technol. (KAIST), Daejeon – sequence: 3 givenname: I. surname: Rhee fullname: Rhee, I.
BookMark	eNp9kD1PwzAQhi0EElDYkVgqBpjSnu3YsceqlA-plILKbDnpBQXSuNipEP8eR0UMHTqcfMPznu-eU3LYuAYJuaAwoBT0cDGbLAYMIBtogJSKA3JChVAJE1Iexh4kT6TU7JichvABQDkweUL07cbWySsGt_EF9hfj-XD08tQvne_PvSswhKp5T8auCa23VYPL_gzbb-c_wxk5Km0d8Pzv7ZG3u8li_JBMn-8fx6NpUnDB26SQRYksF0u-tDzNGQOb5RwymgOKnNm4hoBSYxlL2gxpmnIps2zJcqWURd4jN9u5a---Nhhas6pCgXVtG3SbYJQCmSoleSSv95I8TZUEpiN4tQN-xPObeIWJc2SmNe0g2EKFdyF4LM3aVyvrfwwF0yk3nXLTKTdb5TEidyJF1dq2ck0nr94XvNwGK0T8_yeN-2ol-C9Vi45T
CODEN	IEANEP
CitedBy_id	crossref_primary_10_1109_TCOMM_2020_2968907 crossref_primary_10_1109_TNET_2015_2419219 crossref_primary_10_3390_electronics12122753 crossref_primary_10_1109_TNSE_2020_2974250 crossref_primary_10_1177_0037549718814626 crossref_primary_10_1109_TGCN_2020_2987063 crossref_primary_10_1109_TNSM_2021_3067883 crossref_primary_10_1109_TGCN_2019_2953891
Cites_doi	10.1109/90.502236 10.1109/90.392383 10.1109/TNET.2003.815297 10.1016/S1389-1286(03)00304-9 10.1109/65.923940 10.1109/TNET.2002.808414 10.1109/OPNARC.2003.1196375 10.1109/90.811451 10.1109/ISPASS.2000.842295 10.1109/INFCOM.2000.832267 10.1109/LCOMM.2005.10029 10.1002/047120644X 10.1109/INFCOM.2004.1356983 10.1109/INFCOM.2001.916670 10.1145/347057.347421 10.1145/948205.948241 10.1145/781027.781039 10.1109/ISPASS.2005.1430577 10.1109/ICCAD.2001.968595 10.1016/j.comcom.2004.08.011 10.1038/sj.jors.2600523 10.17487/rfc3835 10.1145/571697.571725 10.1109/90.251892 10.1109/INFCOM.2001.916647 10.1145/75247.75248 10.1145/277858.277897 10.17487/rfc2481 10.1145/505733.505735 10.1109/INFCOM.2002.1019251 10.17487/rfc3168
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2008
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2008
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3
DOI	10.1109/TNET.2007.900415
DatabaseName	IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList	Technology Research Database Technology Research Database Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1558-2566
EndPage	449
ExternalDocumentID	2331149141 10_1109_TNET_2007_900415 4448985
Genre	orig-research
GroupedDBID	-DZ -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 85S 8US 97E 9M8 AAJGR AAKMM AALFJ AARMG AASAJ AAWTH AAWTV ABAZT ABPPZ ABQJQ ABVLG ACGFS ACGOD ACIWK ACM ADBCU ADL AEBYY AEFXT AEJOY AENSD AETEA AETIX AFWIH AFWXC AGQYO AGSQL AHBIQ AI. AIBXA AIKLT AKJIK AKQYR AKRVB ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BDXCO BEFXN BFFAM BGNUA BKEBE BPEOZ CCLIF CS3 D0L EBS EJD FEDTE GUFHI HF~ HGAVV HZ~ H~9 I07 ICLAB IEDLZ IES IFIPE IFJZH IPLJI JAVBF LAI LHSKQ M43 MVM O9- OCL P1C P2P PQQKQ RIA RIE RNS ROL TN5 UPT UQL VH1 XOL YR2 ZCA AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D RIG F28 FR3
ID	FETCH-LOGICAL-c353t-c6cfe2b5d3da34b220a7b3071b0e5b2a30250f9eff9e6a7e14436677d2b888ae3
IEDL.DBID	RIE
ISICitedReferencesCount	18
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000254869100015&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1063-6692
IngestDate	Sun Nov 09 11:06:40 EST 2025 Sun Sep 28 11:57:12 EDT 2025 Sun Jun 29 16:32:59 EDT 2025 Sat Nov 29 03:05:13 EST 2025 Tue Nov 18 21:45:10 EST 2025 Tue Aug 26 16:47:29 EDT 2025
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	2
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c353t-c6cfe2b5d3da34b220a7b3071b0e5b2a30250f9eff9e6a7e14436677d2b888ae3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23
PQID	863679919
PQPubID	23500
PageCount	15
ParticipantIDs	proquest_miscellaneous_880648863 crossref_primary_10_1109_TNET_2007_900415 crossref_citationtrail_10_1109_TNET_2007_900415 proquest_journals_863679919 proquest_miscellaneous_34486029 ieee_primary_4448985
PublicationCentury	2000
PublicationDate	2008-04-01
PublicationDateYYYYMMDD	2008-04-01
PublicationDate_xml	– month: 04 year: 2008 text: 2008-04-01 day: 01
PublicationDecade	2000
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE/ACM transactions on networking
PublicationTitleAbbrev	TNET
PublicationYear	2008
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref35 ref13 ref12 (ref33) 2000 ref37 ref15 ref36 ref14 tsai (ref19) 2002 ref31 ref30 ref11 ref32 floyd (ref34) 2000 ref10 ref1 ref39 ref17 ref38 ref16 ref18 kelly (ref24) 2001 bertsekas (ref22) 1999 ref23 misra (ref25) 2000 ref26 ref20 ref21 (ref29) 2006 ref28 gottlieb (ref3) 2002 ref27 ref8 ref7 crowley (ref2) 2000 ref9 ref4 ref6 ref5
References_xml	– ident: ref9 doi: 10.1109/90.502236 – ident: ref37 doi: 10.1109/90.392383 – ident: ref23 doi: 10.1109/TNET.2003.815297 – year: 2000 ident: ref2 publication-title: Workload Characterization for Computer System Design – ident: ref28 doi: 10.1016/S1389-1286(03)00304-9 – ident: ref11 doi: 10.1109/65.923940 – year: 1999 ident: ref22 publication-title: Nonlinear Programming – ident: ref13 doi: 10.1109/TNET.2002.808414 – ident: ref6 doi: 10.1109/OPNARC.2003.1196375 – ident: ref21 doi: 10.1109/90.811451 – ident: ref17 doi: 10.1109/ISPASS.2000.842295 – ident: ref14 doi: 10.1109/INFCOM.2000.832267 – ident: ref7 doi: 10.1109/LCOMM.2005.10029 – start-page: 685 year: 2001 ident: ref24 publication-title: Mathematics Unlimited2001 and Beyond – ident: ref38 doi: 10.1002/047120644X – ident: ref32 doi: 10.1109/INFCOM.2004.1356983 – ident: ref12 doi: 10.1109/INFCOM.2001.916670 – year: 2000 ident: ref34 publication-title: Recommendations on using the Gentle variant of RED – start-page: 151 year: 2000 ident: ref25 article-title: fluid-based analysis of a network of aqm routers supporting tcp flows with an application to red publication-title: Proc ACM Sigcomm doi: 10.1145/347057.347421 – ident: ref35 doi: 10.1145/948205.948241 – ident: ref26 doi: 10.1145/781027.781039 – ident: ref1 doi: 10.1109/ISPASS.2005.1430577 – ident: ref18 doi: 10.1109/ICCAD.2001.968595 – start-page: 51 year: 2002 ident: ref3 article-title: a comparative study of extensible routers publication-title: Proc IEEE Open Architectures and Network Programming (OpenArch) – ident: ref16 doi: 10.1016/j.comcom.2004.08.011 – year: 2006 ident: ref29 publication-title: Internet End-to-End Performance Monitoring Group (IEPM) – ident: ref20 doi: 10.1038/sj.jors.2600523 – ident: ref5 doi: 10.17487/rfc3835 – ident: ref39 doi: 10.1145/571697.571725 – year: 2000 ident: ref33 publication-title: Ns-2 Network Simulator – ident: ref10 doi: 10.1109/90.251892 – ident: ref27 doi: 10.1109/INFCOM.2001.916647 – ident: ref8 doi: 10.1145/75247.75248 – ident: ref36 doi: 10.1145/277858.277897 – ident: ref30 doi: 10.17487/rfc2481 – ident: ref4 doi: 10.1145/505733.505735 – ident: ref15 doi: 10.1109/INFCOM.2002.1019251 – year: 2002 ident: ref19 article-title: a benchmarking methodology for network processors publication-title: Proc 1st Network Processor Workshop 8th Int Symp High Performance Computer Architectures (HPCA) – ident: ref31 doi: 10.17487/rfc3168
SSID	ssj0013026
Score	1.9999926
Snippet	This paper examines congestion control issues for TCP flows that require in-network processing on the fly in network elements such as gateways, proxies,... Applications of these flows are increasingly abundant in the future as the Internet evolves. Since these flows require use of CPUs in network elements, both...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	435
SubjectTerms	Approximation Audio compression Bandwidth Cellular phones Central processing units Computer science Congestion Costs CPU capacity efficiency Explosives fairness Internet Internet telephony Networks Optical fiber networks proportional fairness Queues Studies TCP (protocol) TCP-AQM TCP-IP Throughput Transcoding transmission link capacity
Title	Dual-Resource TCP/AQM for Processing-Constrained Networks
URI	https://ieeexplore.ieee.org/document/4448985 https://www.proquest.com/docview/863679919 https://www.proquest.com/docview/34486029 https://www.proquest.com/docview/880648863
Volume	16
WOSCitedRecordID	wos000254869100015&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: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-2566 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0013026 issn: 1063-6692 databaseCode: RIE dateStart: 19930101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED90-KAPTqfi_OyDL4JxtUmT5lH8wAcdEyb4VpL0CoJs4jb_fi9pOxU_wIdCS670uPQud7nL_QCOMmdMlpaCCVtYJsiDZZnFmB4zY8tMC1v1mb1V_X72-KgHC3AyPwuDiKH4DE_9bcjlF2M381tlPUGxhM7SRVhUSlZntT4yBnGAVqMIhzMpddKkJGPdG_avhlWzQu3bS6VflqCAqfLNEIfV5br9P77WYLX2IqPzatrXYQFHHWg3CA1RrbAdWPnUbnAD9OXMPLNmwz4aXgx65_d3EbmtUX1egMiYh_AMwBFYRP2qSHyyCQ_XV8OLG1ZDJzDHUz5lTroSE5sWvDCc5J3ERllS5zMbY2oTw73rU2os6ZJGIYVVXEqlisRSSGyQb0FrNB7hNkRnVljlCluWiRWODFyCqlSopBE0q1J3oddIM3d1X3HP5XMe4otY517-Hu5S5ZX8u3A8f-Ol6qnxB-2Gl_ecrhZ1F3abCctrpZvkmeRSkb9LLB3OR0lbfArEjHA8m-RcBNAtooh-oSB7JsmoSb7z85d3YbkqGfHFO3vQmr7OcB-W3Nv0afJ6EP7Jd31S3wM
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS-QwEB_8Au8e_D5cvTv74Itg3NqkSfMofqC4FoUKvpUknYIgu-Lu-vffJG33PE4FHwotmdJh0pnMZCbzA9jPnDFZWgsmbGWZIA-WZRZjesyMrTMtbNNndqDyPHt40LdzcDg7C4OIofgMj_xtyOVXIzf1W2V9QbGEztJ5WEyFSOLmtNbfnEEcwNUoxuFMSp10SclY94v8vGjaFWrfYCr9ZxEKqCr_meKwvlysfo2zNVhp_cjopJn4dZjD4QasdhgNUauyG_D9TcPBTdBnU_PEui37qDi97Z_c3UTkuEbtiQEiYx7EM0BHYBXlTZn4eAvuL86L00vWgicwx1M-YU66GhObVrwynCSexEZZUuhjG2NqE8O981NrrOmSRiEFVlxKparEUlBskP-AheFoiNsQHVthlatsXSdWODJxCapaoZJG0LxK3YN-J83StZ3FPZdPZYgwYl16-XvAS1U28u_BweyN56arxie0m17eM7pW1D3Y7SasbNVuXGaSS0UeL7G0NxslffFJEDPE0XRcchFgt4gi-oCCLJoksyb5zvtf3oPly-JmUA6u8utd-NYUkPhSnp-wMHmZ4i9Ycq-Tx_HL7_B__gE88uJK
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=Dual-Resource+TCP%2FAQM+for+Processing-Constrained+Networks&rft.jtitle=IEEE%2FACM+transactions+on+networking&rft.au=Minsu+Shin&rft.au=Song+Chong&rft.au=Rhee%2C+I.&rft.date=2008-04-01&rft.pub=IEEE&rft.issn=1063-6692&rft.volume=16&rft.issue=2&rft.spage=435&rft.epage=449&rft_id=info:doi/10.1109%2FTNET.2007.900415&rft.externalDocID=4448985
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6692&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6692&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6692&client=summon