{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:10Z","timestamp":1750308130815,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,10,23]],"date-time":"2005-10-23T00:00:00Z","timestamp":1130025600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,10,23]]},"DOI":"10.1145\/1095810.1118617","type":"proceedings-article","created":{"date-parts":[[2012,10,5]],"date-time":"2012-10-05T17:55:16Z","timestamp":1349459716000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A need for componentized transport protocols"],"prefix":"10.1145","author":[{"given":"Tyson","family":"Condie","sequence":"first","affiliation":[{"name":"U.C. Berkeley and Intel Research Berkeley"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph M.","family":"Hellerstein","sequence":"additional","affiliation":[{"name":"U.C. Berkeley and Intel Research Berkeley"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petros","family":"Maniatis","sequence":"additional","affiliation":[{"name":"U.C. Berkeley and Intel Research Berkeley"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sean","family":"Rhea","sequence":"additional","affiliation":[{"name":"U.C. Berkeley and Intel Research Berkeley"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timothy","family":"Roscoe","sequence":"additional","affiliation":[{"name":"U.C. Berkeley and Intel Research Berkeley"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,10,23]]},"reference":[{"unstructured":"Bittorrent goes trackerless: Publishing with bittorrent gets easier! http:\/\/www.bittorrent.com\/trackerless.html.  Bittorrent goes trackerless: Publishing with bittorrent gets easier! http:\/\/www.bittorrent.com\/trackerless.html.","key":"e_1_3_2_1_1_1"},{"unstructured":"eDonkey2000 - Overnet. http:\/\/www.edonkey2000.com\/.  eDonkey2000 - Overnet. http:\/\/www.edonkey2000.com\/.","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. NSDI","author":"Dabek F.","year":"2004","unstructured":"F. Dabek , J. Li , E. Sit , F. Kaashoek , R. Morris , and C. Blake . Designing a DHT for low latency and high throughput . In Proc. NSDI , March 2004 . F. Dabek, J. Li, E. Sit, F. Kaashoek, R. Morris, and C. Blake. Designing a DHT for low latency and high throughput. In Proc. NSDI, March 2004."},{"key":"e_1_3_2_1_4_1","volume-title":"June","author":"Floyd S.","year":"2005","unstructured":"S. Floyd , M. Handley , and E. Kohler . Problem Statement for DCCP , June 2005 . S. Floyd, M. Handley, and E. Kohler. Problem Statement for DCCP, June 2005."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/347059.347397"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. CIDR","author":"Huebsch R.","year":"2005","unstructured":"R. Huebsch , B. N. Chun , J. M. Hellerstein , B. T. Loo , P. Maniatis , T. Roscoe , S. Shenker , I. Stoica , and A. R. Yumerefendi . The architecture of PIER: an Internet-scale query processor . In Proc. CIDR , January 2005 . R. Huebsch, B. N. Chun, J. M. Hellerstein, B. T. Loo, P. Maniatis, T. Roscoe, S. Shenker, I. Stoica, and A. R. Yumerefendi. The architecture of PIER: an Internet-scale query processor. In Proc. CIDR, January 2005."},{"key":"e_1_3_2_1_7_1","volume-title":"March","author":"Lai J.","year":"2005","unstructured":"J. Lai and E. Kohler . A Congestion-Controlled Unreliable Datagram API , March 2005 . J. Lai and E. Kohler. A Congestion-Controlled Unreliable Datagram API, March 2005."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/1095810.1095818"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.5555\/646334.687801"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/1031495.1031525"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.5555\/1247415.1247425"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1109\/TNET.2002.808407"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/1015467.1015509"}],"event":{"sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery"],"acronym":"SOSP05","name":"SOSP05: ACM SIGOPS 20th Symposium on Operating Systems Principles 2005","location":"Brighton United Kingdom"},"container-title":["Proceedings of the twentieth ACM symposium on Operating systems principles"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1095810.1118617","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1095810.1118617","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:28Z","timestamp":1750262908000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1095810.1118617"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,23]]},"references-count":13,"alternative-id":["10.1145\/1095810.1118617","10.1145\/1095810"],"URL":"https:\/\/doi.org\/10.1145\/1095810.1118617","relation":{},"subject":[],"published":{"date-parts":[[2005,10,23]]},"assertion":[{"value":"2005-10-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}