{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:16:27Z","timestamp":1758845787722,"version":"3.41.0"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2004,10,15]],"date-time":"2004-10-15T00:00:00Z","timestamp":1097798400000},"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":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2004,10,15]]},"abstract":"<jats:p>Providing scalable distributed Web-based eventing services has been an important research topic. It is desirable to have an effective mechanism for the servers to summarize their filters for in-network preprocessing in order to optimize system performance. In this paper, we propose a summary-based routing mechanism and introduce the notion of imprecise summaries to provide a trade-off between routing overhead and event traffic. Our system uses similarity-based filter clustering to reduce overall event traffic and performs self-tuning summary precision selection to optimize throughput. We have implemented summary-based routing on top of an XML-based infrastructure that closely follows the proposed Web services standards. Measurements from the actual implementation validate our analytical and simulation results, and demonstrate the practical benefits of the proposed techniques.<\/jats:p>","DOI":"10.1145\/1039111.1039113","type":"journal-article","created":{"date-parts":[[2005,1,26]],"date-time":"2005-01-26T16:49:14Z","timestamp":1106758154000},"page":"59-74","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Summary-based routing for content-based event distribution networks"],"prefix":"10.1145","volume":"34","author":[{"given":"Yi-Min","family":"Wang","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA"}]},{"given":"Lili","family":"Qiu","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}]},{"given":"Chad","family":"Verbowski","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}]},{"given":"Dimitris","family":"Achlioptas","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}]},{"given":"Gautam","family":"Das","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}]},{"given":"Paul","family":"Larson","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}]}],"member":"320","published-online":{"date-parts":[[2004,10,15]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proc. of USENIX Annual Conference","author":"Adya A.","year":"2002","unstructured":"A. Adya , P. Bahl , and L. Qiu . Characterizing alert and browse services for mobile clients . In Proc. of USENIX Annual Conference , Jun. 2002 . A. Adya, P. Bahl, and L. Qiu. Characterizing alert and browse services for mobile clients. In Proc. of USENIX Annual Conference, Jun. 2002."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301326"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.649565"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/876891.880590"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1734663.1734671"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/380749.380767"},{"key":"e_1_2_1_10_1","volume-title":"Proc. of VLDB '2002","author":"Chan C. Y.","year":"2002","unstructured":"C. Y. Chan , M. Garofalakis , and R. Rastogi . RE-Tree: An efficient index structure for regular expressions . In Proc. of VLDB '2002 , 2002 . C. Y. Chan, M. Garofalakis, and R. Rastogi. RE-Tree: An efficient index structure for regular expressions. In Proc. of VLDB '2002, 2002."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375677"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581107"},{"key":"e_1_2_1_14_1","volume-title":"Proc. of the 18 th Australasian Computer Science Conference","author":"Gough J.","year":"1995","unstructured":"J. Gough and G. Smith . Efficient recognition of events in a distributed system . In Proc. of the 18 th Australasian Computer Science Conference , Feb. 1995 . J. Gough and G. Smith. Efficient recognition of events in a distributed system. In Proc. of the 18 th Australasian Computer Science Conference, Feb. 1995."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECMDD.1999.776423"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/224170.224228"},{"key":"e_1_2_1_18_1","volume-title":"Algorithms for clustering data","author":"Jain A. K.","year":"1988","unstructured":"A. K. Jain and Dubes. Algorithms for clustering data . 1988 . A. K. Jain and Dubes. Algorithms for clustering data. 1988."},{"key":"e_1_2_1_19_1","unstructured":"Weighted min cut. http:\/\/riot.ieor.berkeley.edu\/riot\/Applications\/WeightedMinCut\/.  Weighted min cut. http:\/\/riot.ieor.berkeley.edu\/riot\/Applications\/WeightedMinCut\/."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/338283.338363"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/347059.347413"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019369"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/850928.851842"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/648089.747486"},{"key":"e_1_2_1_25_1","volume-title":"Proc. of AUUG","author":"Segall B.","year":"1997","unstructured":"B. Segall and D. Arnold . Elvin has left the building: A publish \/subscribe notification service with quenching . In Proc. of AUUG , 1997 . B. Segall and D. Arnold. Elvin has left the building: A publish \/subscribe notification service with quenching. In Proc. of AUUG, 1997."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502050"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/647882.738093"},{"key":"e_1_2_1_28_1","volume-title":"Proc. of DISC","author":"Wang Y. M.","year":"2002","unstructured":"Y. M. Wang , L. Qiu , D. Achlioptas , G. Das , P. Larson , and H. J. Wang . Subscription partitioning and routing in content-based publish\/subscribe networks (Brief Announcement) . In Proc. of DISC , Oct. 2002 . Y. M. Wang, L. Qiu, D. Achlioptas, G. Das, P. Larson, and H. J. Wang. Subscription partitioning and routing in content-based publish\/subscribe networks (Brief Announcement). In Proc. of DISC, Oct. 2002."},{"key":"e_1_2_1_29_1","first-page":"451","volume-title":"Proc. of INFOCOM","author":"Wong T.","year":"2000","unstructured":"T. Wong , R. H. Katz , and S. McCanne . An evaluation on using preference clustering in large-scale multicast applications . In Proc. of INFOCOM , pages 451 -- 460 , 2000 . T. Wong, R. H. Katz, and S. McCanne. An evaluation on using preference clustering in large-scale multicast applications. In Proc. of INFOCOM, pages 451--460, 2000."},{"key":"e_1_2_1_30_1","unstructured":"Web Services standards. http:\/\/www.webservices.org\/index.php\/standards\/.  Web Services standards. http:\/\/www.webservices.org\/index.php\/standards\/."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/647067.715342"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1039111.1039113","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1039111.1039113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:43Z","timestamp":1750264303000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1039111.1039113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10,15]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2004,10,15]]}},"alternative-id":["10.1145\/1039111.1039113"],"URL":"https:\/\/doi.org\/10.1145\/1039111.1039113","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2004,10,15]]},"assertion":[{"value":"2004-10-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}