{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:00Z","timestamp":1750306980063,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,8,12]],"date-time":"2013-08-12T00:00:00Z","timestamp":1376265600000},"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":[[2013,8,12]]},"DOI":"10.1145\/2491224.2491229","type":"proceedings-article","created":{"date-parts":[[2013,8,20]],"date-time":"2013-08-20T14:07:21Z","timestamp":1377007641000},"page":"21-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Reliable publish\/subscribe in content-centric networks"],"prefix":"10.1145","author":[{"given":"Jiachen","family":"Chen","sequence":"first","affiliation":[{"name":"Institute of Computer Science, University of Goettingen, Goettingen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mayutan","family":"Arumaithurai","sequence":"additional","affiliation":[{"name":"NEC Laboratories Europe, Heidelberg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoming","family":"Fu","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, University of Goettingen, Goettingen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.K.","family":"Ramakrishnan","sequence":"additional","affiliation":[{"name":"AT&T Labs-Research, Florham Park, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,8,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Arnold et al., \"Content Based Routing with Elvin,\" in AUUG2K","author":"Segall B.","year":"2000","unstructured":"B. Segall , D. Arnold et al., \"Content Based Routing with Elvin,\" in AUUG2K , 2000 . B. Segall, D. Arnold et al., \"Content Based Routing with Elvin,\" in AUUG2K, 2000."},{"key":"e_1_3_2_1_2_1","volume-title":"Rutherford et al., \"A routing scheme for content-based networking,\" in INFOCOM","author":"Carzaniga A.","year":"2004","unstructured":"A. Carzaniga , M. Rutherford et al., \"A routing scheme for content-based networking,\" in INFOCOM , 2004 . A. Carzaniga, M. Rutherford et al., \"A routing scheme for content-based networking,\" in INFOCOM, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1282380.1282402"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/1658939.1658941"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1109\/WCW.2005.23"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/ANCS.2011.27"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1109\/ICDCS.2012.26"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/2396556.2396601"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/347059.347390"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1109\/TCOM.1984.1096179"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1109\/TCOM.1985.1096290"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1109\/TCOM.1985.1096284"},{"key":"e_1_3_2_1_14_1","volume-title":"Sabnani et al., \"Multicast transport protocols for high speed networks,\" in ICNP","author":"Paul S.","year":"1994","unstructured":"S. Paul , K. K. Sabnani et al., \"Multicast transport protocols for high speed networks,\" in ICNP , 1994 . S. Paul, K. K. Sabnani et al., \"Multicast transport protocols for high speed networks,\" in ICNP, 1994."},{"key":"e_1_3_2_1_15_1","volume-title":"Reliable multicast transport protocol,\" in INFOCOM","author":"Lin J. C.","year":"1996","unstructured":"J. C. Lin and S. Paul , \" Reliable multicast transport protocol,\" in INFOCOM , 1996 . J. C. Lin and S. Paul, \"Reliable multicast transport protocol,\" in INFOCOM, 1996."},{"key":"e_1_3_2_1_16_1","volume-title":"Hurst et al., \"Tram: A tree-based reliable multicast protocol","author":"Chiu D. M.","year":"1998","unstructured":"D. M. Chiu , S. Hurst et al., \"Tram: A tree-based reliable multicast protocol ,\" 1998 . D. M. Chiu, S. Hurst et al., \"Tram: A tree-based reliable multicast protocol,\" 1998."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/55483.55519"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1109\/90.650139"},{"key":"e_1_3_2_1_19_1","volume-title":"A negative acknowledgement with periodic polling protocol for multicast over lans,\" in INFOCOM","author":"Ramakrishnan S.","year":"1987","unstructured":"S. Ramakrishnan and B. Jain , \" A negative acknowledgement with periodic polling protocol for multicast over lans,\" in INFOCOM , 1987 . S. Ramakrishnan and B. Jain, \"A negative acknowledgement with periodic polling protocol for multicast over lans,\" in INFOCOM, 1987."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/248157.248168"},{"key":"e_1_3_2_1_21_1","volume-title":"Crowcroft et al., \"Tcp-like congestion control for layered multicast data transfer,\" in INFOCOM","author":"Vicisano L.","year":"1998","unstructured":"L. Vicisano , J. Crowcroft et al., \"Tcp-like congestion control for layered multicast data transfer,\" in INFOCOM , 1998 . L. Vicisano, J. Crowcroft et al., \"Tcp-like congestion control for layered multicast data transfer,\" in INFOCOM, 1998."}],"event":{"sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"acronym":"SIGCOMM'13","name":"SIGCOMM'13: ACM SIGCOMM 2013 Conference","location":"Hong Kong China"},"container-title":["Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491224.2491229","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2491224.2491229","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:37Z","timestamp":1750235977000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491224.2491229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,12]]},"references-count":20,"alternative-id":["10.1145\/2491224.2491229","10.1145\/2491224"],"URL":"https:\/\/doi.org\/10.1145\/2491224.2491229","relation":{},"subject":[],"published":{"date-parts":[[2013,8,12]]},"assertion":[{"value":"2013-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}