{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T21:14:07Z","timestamp":1761772447730,"version":"build-2065373602"},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T00:00:00Z","timestamp":1373932800000},"content-version":"vor","delay-in-days":927,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2011]]},"DOI":"10.1016\/j.procs.2011.04.138","type":"journal-article","created":{"date-parts":[[2011,5,21]],"date-time":"2011-05-21T20:20:56Z","timestamp":1306009256000},"page":"1278-1287","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["PACC: A Path Associativity Congestion Control and Throughput Model For Multi-path TCP"],"prefix":"10.1016","volume":"4","author":[{"given":"Yin","family":"Liu","sequence":"first","affiliation":[]},{"given":"Baojin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ke","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Zhen","family":"Ma","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2011.04.138_bib0005","unstructured":"C. Huitema. Multi-homed TCP draft-huitema-multi-homed-0.txt. Internet-Draft, IETF, 1995."},{"key":"10.1016\/j.procs.2011.04.138_bib0010","doi-asserted-by":"crossref","unstructured":"J. Padhye, V. Firoiu, D. Towsley, J. Kurose. Modeling TCP Throughput: A Simple Model and its Empirical Validation. ACM SIGCOMM, 1998.","DOI":"10.1145\/285237.285291"},{"key":"10.1016\/j.procs.2011.04.138_bib0015","doi-asserted-by":"crossref","unstructured":"N. Parvez, A. Mahanti, and C. Williamson. An analytic throughput model for TCP NewReno, In IEEE\/ACM Trans. Networking, 2009.","DOI":"10.1109\/TNET.2009.2030889"},{"key":"10.1016\/j.procs.2011.04.138_bib0020","unstructured":"Z. Yi,Tarek Saadawi, Myung Lee. Analytic model of Stream Control Transmission Protocol, PMCCS, 2003."},{"key":"10.1016\/j.procs.2011.04.138_bib0025","unstructured":"H. Hsieh and R. Sivakumar. pTCP: An end-to-end transport layer protocol for striped connections. In Proceedings of IEEE ICNP, 2002."},{"key":"10.1016\/j.procs.2011.04.138_bib0030","article-title":"An evaluation of multi-path transmission control protocol (M\/TCP) with robust acknowledgement schemes","author":"Rojviboonchai","year":"2004","journal-title":"IEICE Trans. Communications"},{"key":"10.1016\/j.procs.2011.04.138_bib0035","unstructured":"M. Zhang, J. Lai, A. Krishnamurthy, L. Peterson, and R. Wang. A transport layer approach for improving end-to-end performance and robustness using redundant paths. In ATEC \u201804: Proceedings of the annual conference on USENIX Annual Technical Conference, pages 8-8, Berkeley, CA, USA, 2004."},{"issue":"2","key":"10.1016\/j.procs.2011.04.138_bib0040","article-title":"Stability of end-to-end algorithms for joint routing and rate control","volume":"35","author":"Kelly","year":"2005","journal-title":"CCR"},{"key":"10.1016\/j.procs.2011.04.138_bib0045","doi-asserted-by":"crossref","DOI":"10.1109\/TNET.2006.886738","article-title":"Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity on the Internet","volume":"14","author":"Han","year":"2006","journal-title":"IEEE\/ACM Trans. on Networking"},{"key":"10.1016\/j.procs.2011.04.138_bib0050","doi-asserted-by":"crossref","DOI":"10.1145\/1452335.1452342","article-title":"Marcelo Bagnulo Braun. The resource pooling principle","author":"Wischik","year":"2008","journal-title":"ACM SIGCOMM Computer Communication Review."},{"key":"10.1016\/j.procs.2011.04.138_bib0055","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-10406-0_14","article-title":"Control of Multipath TCP and Optimization of Multipath Routing in the Internet","author":"Wischik","year":"2009","journal-title":"Network Control and Optimization."},{"key":"10.1016\/j.procs.2011.04.138_bib0060","article-title":"Improved data distribution for multipath TCP communication","author":"Hasegawa","year":"2005","journal-title":"GLOBECOM"},{"key":"10.1016\/j.procs.2011.04.138_bib0065","article-title":"Multipath Network Flows: Bounded Buffers and Jitter","author":"Anjali","year":"2010","journal-title":"INFOCOM"},{"key":"10.1016\/j.procs.2011.04.138_bib0070","unstructured":"A. Ford, C. Raiciu, M. Handley. TCP Extensions for Multipath Operation with Multiple Addresses draft-ietf-mptcp-multiaddressed-02. Internet-Draft, IETF, 2010."},{"key":"10.1016\/j.procs.2011.04.138_bib0075","doi-asserted-by":"crossref","unstructured":"A. Ford, Ed., C. Raiciu, M. Handley, S. Barre, Louvain, J. Iyengar. Architectural Guidelines for Multipath TCP Development draft-ietfmptcp- architecture-03. Internet-Draft, IETF, 2010.","DOI":"10.17487\/rfc6182"},{"key":"10.1016\/j.procs.2011.04.138_bib0080","unstructured":"C. Raiciu, M. Handley, D. Wischik. Coupled Multipath-Aware Congestion Control draft-ietf-mptcp-congestion-00. Internet-Draft, IETF, 2010."},{"key":"10.1016\/j.procs.2011.04.138_bib0085","doi-asserted-by":"crossref","unstructured":"Damon Wischik, Mark Handley and Costin Raiciu. Proc: Control of multipath TCP and optimization of multipath routing in the Internet. NetCOOP, 2009.","DOI":"10.1007\/978-3-642-10406-0_14"},{"key":"10.1016\/j.procs.2011.04.138_bib0090","doi-asserted-by":"crossref","unstructured":"D. Wischik, M. Handley, and M. Bagnulo Braun. The Resource Pooling Principle, ACM SIGCOMM CCR, Oct. 2008.","DOI":"10.1145\/1452335.1452342"},{"key":"10.1016\/j.procs.2011.04.138_bib0095","doi-asserted-by":"crossref","DOI":"10.1109\/TNET.2002.1012369","article-title":"Detecting shared congestion of flows via end-to-end measurement","author":"Rubenstein","year":"2002","journal-title":"IEEE\/ACM Trans. on Networking."}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050911001967?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050911001967?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T21:10:07Z","timestamp":1761772207000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050911001967"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"references-count":19,"alternative-id":["S1877050911001967"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2011.04.138","relation":{},"ISSN":["1877-0509"],"issn-type":[{"type":"print","value":"1877-0509"}],"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"PACC: A Path Associativity Congestion Control and Throughput Model For Multi-path TCP","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2011.04.138","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2011 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}