{"id":"https://openalex.org/W2126317611","doi":"https://doi.org/10.1109/infcom.2009.5061963","title":"Scalable Content-Based Routing in Pub/Sub Systems","display_name":"Scalable Content-Based Routing in Pub/Sub Systems","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W2126317611","doi":"https://doi.org/10.1109/infcom.2009.5061963","mag":"2126317611"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2009.5061963","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2009.5061963","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2009","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091883245","display_name":"Annwesha Banerjee Majumder","orcid":"https://orcid.org/0000-0002-0087-8599"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Majumder","raw_affiliation_strings":["Bell Labs., Bangalore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Labs., Bangalore","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108312294","display_name":"N. Shrivastava","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"N. Shrivastava","raw_affiliation_strings":["Bell Labs., Bangalore","Bell Labs, Bangalore, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Labs., Bangalore","institution_ids":[]},{"raw_affiliation_string":"Bell Labs, Bangalore, India","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111810032","display_name":"R. Rastogi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Rastogi","raw_affiliation_strings":["Yahoo! Labs, Bangalore, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yahoo! Labs, Bangalore, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022335676","display_name":"A. Srinivasan","orcid":null},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Srinivasan","raw_affiliation_strings":["Google, Bangalore","Google, Inc., Bangalore, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google, Bangalore","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google, Inc., Bangalore, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8144,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.86708188,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"567","last_page":"575"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7624111175537109},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7428321838378906},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6087055802345276},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6020739078521729},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5708673596382141},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.562017560005188},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49064531922340393},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4856387674808502},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.47255417704582214},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.45596829056739807},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44503745436668396},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.4192083477973938},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.398883581161499},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3159659504890442},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2866409420967102},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18014556169509888},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.14023041725158691},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1326199471950531},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1303119957447052},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0762796700000763}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7624111175537109},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7428321838378906},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6087055802345276},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6020739078521729},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5708673596382141},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.562017560005188},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49064531922340393},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4856387674808502},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.47255417704582214},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.45596829056739807},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44503745436668396},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.4192083477973938},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.398883581161499},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3159659504890442},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2866409420967102},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18014556169509888},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.14023041725158691},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1326199471950531},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1303119957447052},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0762796700000763},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcom.2009.5061963","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2009.5061963","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2009","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1483932765","https://openalex.org/W1971405342","https://openalex.org/W1978086920","https://openalex.org/W1981859328","https://openalex.org/W1990327548","https://openalex.org/W2067580069","https://openalex.org/W2082635360","https://openalex.org/W2101565717","https://openalex.org/W2111995392","https://openalex.org/W2116641234","https://openalex.org/W2124553227","https://openalex.org/W2129668029","https://openalex.org/W2129770824","https://openalex.org/W2130842187","https://openalex.org/W2137705824","https://openalex.org/W2137899328","https://openalex.org/W2146444625","https://openalex.org/W2155659292","https://openalex.org/W4253177446","https://openalex.org/W6628939345","https://openalex.org/W6647811010","https://openalex.org/W6680497419","https://openalex.org/W6683345705"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W2044443696","https://openalex.org/W1703428550","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":{"In":[0],"this":[1,169],"paper,":[2],"we":[3],"develop":[4,52,143],"a":[5,41,44,53,75,87,117,121,125,154,161,180],"framework":[6,26],"for":[7,48,80,120,173],"achieving":[8],"scalable":[9],"and":[10,32,134,184],"communication-efficient":[11],"dissemination":[12,46],"of":[13,66,74,77,85,90,115,128,164,198],"content":[14,34,59,209],"in":[15,40,61,138],"pub/sub":[16],"systems.":[17],"To":[18],"maximize":[19],"communication":[20,72,157],"sharing":[21],"across":[22],"subscriptions,":[23],"our":[24,199],"routing":[25,78,91,201,206],"groups":[27],"subscriptions":[28,39,68],"based":[29,207],"on":[30,208],"similarity,":[31],"transmits":[33],"matching":[35],"one":[36,187],"or":[37],"more":[38],"group":[42,123],"over":[43],"single":[45],"tree":[47,119,132,155],"the":[49,64,71,106,113,129,165,186,189,196],"group.":[50],"We":[51,142,167],"cost":[54,73,158],"model":[55],"that":[56,100,112,147],"uses":[57,148],"published":[58],"samples":[60],"conjunction":[62],"with":[63,105,188],"knowledge":[65],"consumer":[67],"to":[69,102,152,170,204],"estimate":[70],"set":[76,89],"trees":[79,92,104,151,172],"subscription":[81,122],"groups.":[82],"The":[83],"problem":[84,99,114,137],"computing":[86,116],"communication-optimal":[88],"is":[93,124,159],"then":[94],"formulated":[95],"as":[96],"an":[97,135,144],"optimization":[98],"seeks":[101],"find":[103],"minimum":[107],"cost.":[108,191],"It":[109],"turns":[110],"out":[111],"minimum-cost":[118],"new":[126],"generalization":[127],"well-known":[130],"Steiner":[131],"problem,":[133],"interesting":[136],"its":[139],"own":[140],"right.":[141],"approximation":[145],"algorithm":[146],"low-stretch":[149],"spanning":[150,211],"compute":[153,171],"whose":[156],"within":[160],"polylogarithmic":[162],"factor":[163],"optimum.":[166],"use":[168],"various":[174],"subscription-":[175],"grouping":[176],"configurations":[177],"generated":[178],"using":[179],"greedy":[181],"clustering":[182],"strategy,":[183],"select":[185],"lowest":[190],"Our":[192],"experimental":[193],"study":[194],"demonstrates":[195],"effectiveness":[197],"content-aware":[200],"approach":[202],"compared":[203],"traditional":[205],"oblivious":[210],"trees.":[212]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}