{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:30Z","timestamp":1750306950566,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,29]],"date-time":"2013-06-29T00:00:00Z","timestamp":1372464000000},"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,6,29]]},"DOI":"10.1145\/2488222.2488262","type":"proceedings-article","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T14:33:48Z","timestamp":1372775628000},"page":"51-62","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Efficient content-based routing with network topology inference"],"prefix":"10.1145","author":[{"given":"Muhammad Adnan","family":"Tariq","sequence":"first","affiliation":[{"name":"University of Stuttgart, Stuttgart, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris","family":"Koldehofe","sequence":"additional","affiliation":[{"name":"University of Stuttgart, Stuttgart, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Rothermel","sequence":"additional","affiliation":[{"name":"University of Stuttgart, Stuttgart, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2008.08.013"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/52325.52357"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.82"},{"key":"e_1_3_2_1_4_1","volume-title":"Nearest-neighbor methods for learning and vision: theory and practice.","author":"Clarkson K. L.","year":"2006","unstructured":"K. L. Clarkson . Nearest-neighbor searching and metric space dimensions . In Nearest-neighbor methods for learning and vision: theory and practice. 2006 . K. L. Clarkson. Nearest-neighbor searching and metric space dimensions. In Nearest-neighbor methods for learning and vision: theory and practice. 2006."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/977400.977998"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2007.4444750"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.884019"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1619258.1619280"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316229"},{"key":"e_1_3_2_1_10_1","unstructured":"C. T. C. A. for Internet Data Analysis. http:\/\/www.caida.org\/home\/ 2012.  C. T. C. A. for Internet Data Analysis. http:\/\/www.caida.org\/home\/ 2012."},{"key":"e_1_3_2_1_11_1","volume-title":"Improving convergence speed and scalability in OSPF: A survey","author":"Goyal M.","year":"2011","unstructured":"M. Goyal , M. Soperi , E. Baccelli , G. Choudhury , A. Shaikh , H. Hosseini , and K. Trivedi . Improving convergence speed and scalability in OSPF: A survey . IEEE Commun. Surveys Tuts ., 2011 . M. Goyal, M. Soperi, E. Baccelli, G. Choudhury, A. Shaikh, H. Hosseini, and K. Trivedi. Improving convergence speed and scalability in OSPF: A survey. IEEE Commun. Surveys Tuts., 2011."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.162"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1045658.1045677"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1244002.1244128"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/EMPDP.2004.1271446"},{"key":"e_1_3_2_1_17_1","unstructured":"M. Jelasity A. Montresor G. P. Jesi and S. Voulgaris. PeerSim: A peer-to-peer simulator. http:\/\/peersim.sourceforge.net\/.  M. Jelasity A. Montresor G. P. Jesi and S. Voulgaris. PeerSim: A peer-to-peer simulator. http:\/\/peersim.sourceforge.net\/."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.70771"},{"key":"e_1_3_2_1_19_1","volume-title":"conf. on commun.","author":"Jin X.","year":"2008","unstructured":"X. Jin , W. Tu , and S.-H. G. Chan . Traceroute-based topology inference without network coordinate estimation. In IEEE intl . conf. on commun. , 2008 . X. Jin, W. Tu, and S.-H. G. Chan. Traceroute-based topology inference without network coordinate estimation. In IEEE intl. conf. on commun., 2008."},{"key":"e_1_3_2_1_20_1","volume-title":"conf. on commun. (ICC)","author":"Jin X.","year":"2005","unstructured":"X. Jin , Y. Wang , and S.-H. G. Chan . Fast overlay tree based on efficient end-to-end measurements. In IEEE intl . conf. on commun. (ICC) , 2005 . X. Jin, Y. Wang, and S.-H. G. Chan. Fast overlay tree based on efficient end-to-end measurements. In IEEE intl. conf. on commun. (ICC), 2005."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2007.907459"},{"key":"e_1_3_2_1_22_1","first-page":"141","article-title":"An optimal distributed algorithm for ALL-pairs shortest-path","volume":"11","author":"Kanchi S.","year":"2004","unstructured":"S. Kanchi and D. Vineyard . An optimal distributed algorithm for ALL-pairs shortest-path . Intl.J.on Information Theories & App. , 11 : 141 -- 146 , 2004 . S. Kanchi and D. Vineyard. An optimal distributed algorithm for ALL-pairs shortest-path. Intl.J.on Information Theories & App., 11:141--146, 2004.","journal-title":"Intl.J.on Information Theories & App."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232919.1232925"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2004.06.025"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061963"},{"key":"e_1_3_2_1_26_1","volume-title":"BRITE: Universal topology generation from a user's perspective. Technical report","author":"Medina A.","year":"2001","unstructured":"A. Medina , A. Lakhina , I. Matta , and J. Byers . BRITE: Universal topology generation from a user's perspective. Technical report , Boston University , 2001 . A. Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: Universal topology generation from a user's perspective. Technical report, Boston University, 2001."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142541"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.131"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808407"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1887695.1887746"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1751"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2335484.2335508"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1201\/9780203497289"},{"key":"e_1_3_2_1_34_1","volume-title":"conf. on comp. commun. (INFOCOM)","author":"Zegura E. W.","year":"1996","unstructured":"E. W. Zegura , K. L. Calvert , and S. Bhattacharjee . How to model an internetwork. In IEEE intl . conf. on comp. commun. (INFOCOM) , 1996 . E. W. Zegura, K. L. Calvert, and S. Bhattacharjee. How to model an internetwork. In IEEE intl. conf. on comp. commun. (INFOCOM), 1996."},{"key":"e_1_3_2_1_35_1","volume-title":"A survey on selective routing topology inference through active probing","author":"Zhang X.","year":"2011","unstructured":"X. Zhang and C. Phillips . A survey on selective routing topology inference through active probing . IEEE Communications Surveys & Tutorials , 2011 . X. Zhang and C. Phillips. A survey on selective routing topology inference through active probing. IEEE Communications Surveys & Tutorials, 2011."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.155"}],"event":{"name":"DEBS '13: The 7th ACM International Conference on Distributed Event-Based Systems","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Arlington Texas USA","acronym":"DEBS '13"},"container-title":["Proceedings of the 7th ACM international conference on Distributed event-based systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488222.2488262","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488222.2488262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:38:58Z","timestamp":1750235938000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488222.2488262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,29]]},"references-count":35,"alternative-id":["10.1145\/2488222.2488262","10.1145\/2488222"],"URL":"https:\/\/doi.org\/10.1145\/2488222.2488262","relation":{},"subject":[],"published":{"date-parts":[[2013,6,29]]},"assertion":[{"value":"2013-06-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}