{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:57:45Z","timestamp":1782835065987,"version":"3.54.5"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/infcom.2011.5934923","type":"proceedings-article","created":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T14:59:10Z","timestamp":1310050750000},"page":"1377-1385","source":"Crossref","is-referenced-by-count":67,"title":["Modeling and understanding TCP incast in data center networks"],"prefix":"10.1109","author":[{"given":"Jiao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fengyuan","family":"Ren","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chuang","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1145\/285243.285291","article-title":"Modeling TCP Throughput: A Simple Model and its Empirical Validation","author":"padhye","year":"1998","journal-title":"Proc of ACM SIGCOM"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2030889"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1145\/347057.347549","article-title":"A Stochastic Model of TCP\/IP with Stationary Random Losses","author":"altman","year":"2000","journal-title":"Proceedings of ACM SIGCOMM"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019259"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/90.720921"},{"key":"ref15","article-title":"The NewReno Modification to TCP's Fast Recovery Algorithm","author":"floyd","year":"2004","journal-title":"RFC 3782"},{"key":"ref4","first-page":"53","article-title":"The Panasas ActiveScale Storage Cluster: Delivering Scalable High Bandwidth Storage","author":"nagle","year":"2004","journal-title":"Proceedings of the ACM\/IEEE Supercomputer Conference 2004"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1592681.1592693"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/945449.945450"},{"key":"ref5","article-title":"Ursa Minor: Versatile Cluster-based Storage","author":"abd-el-malek","year":"2005","journal-title":"Proc of FAST"},{"key":"ref8","article-title":"Mapreduce: Simplified data processing on large clusters","author":"dean","year":"2004","journal-title":"Proceedings of OSDI"},{"key":"ref7","year":"0","journal-title":"Presentation Summary-high Performance at Massive Scale Lessons Learned at Facebook"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592604"},{"key":"ref1","article-title":"Measurement and Analysis of TCP Throughput Collapse in Cluster-based Storage Systems","author":"phanishayee","year":"2008","journal-title":"Proc of FAST"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2009.5307439"}],"event":{"name":"IEEE INFOCOM 2011 - IEEE Conference on Computer Communications","location":"Shanghai, China","start":{"date-parts":[[2011,4,10]]},"end":{"date-parts":[[2011,4,15]]}},"container-title":["2011 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5888673\/5934870\/05934923.pdf?arnumber=5934923","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,27]],"date-time":"2021-11-27T18:55:37Z","timestamp":1638039337000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5934923\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/infcom.2011.5934923","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}