Combining Flexibility and Scalability in a Peer-to-Peer Publish/Subscribe System
The content-based publish/subscribe model has been adopted by many services to deliver data between distributed users based on application-specific semantics. Two key issues in such systems, the semantic expressiveness of content matching and the scalability of the matching mechanism, are often foun...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 123 |
|---|---|
| container_issue | |
| container_start_page | 102 |
| container_title | |
| container_volume | |
| creator | Zhang, Chi Krishnamurthy, Arvind Wang, Randolph Y. Singh, Jaswinder Pal |
| description | The content-based publish/subscribe model has been adopted by many services to deliver data between distributed users based on application-specific semantics. Two key issues in such systems, the semantic expressiveness of content matching and the scalability of the matching mechanism, are often found to be in conflict due to the complexity associated with content matching. In this paper, we present a novel content-based publish/subscribe architecture based on peer-to-peer matching trees. The system achieves scalability by partitioning the responsibility of event matching to self-organized peers while allowing customizable matching functionalities. Experimental results using a variety of real world datasets demonstrate the scalability and flexibility of the system. |
| doi_str_mv | 10.1007/11587552_6 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17416203</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17416203</sourcerecordid><originalsourceid>FETCH-LOGICAL-p254t-fc76f9f7f285c101007eb68542a5099d2892866396b3cbe91057e9d8bddf07243</originalsourceid><addsrcrecordid>eNpFkMtKAzEUhuMNrLUbnyAbwU1s7pelFKtCwYHRdUhmkhqdzpTJFOzbO6UFz-Y_h-_n3AC4I_iRYKzmhAithKBWnoEbJjhmlEqjz8GESEIQY9xcnMCImLgEkzGjyCjOrsEs5288BiPacDYBxaLb-NSmdg2XTfhNPjVp2EPX1rCsXONOdWqhg0UIPRo6dFBY7HyT8te83Plc9ckHWO7zEDa34Cq6JofZSafgc_n8sXhFq_eXt8XTCm2p4AOKlZLRRBWpFhXBh8uCl1pw6gQ2pqbaUC0lM9KzygdDsFDB1NrXdcSKcjYF98e-W5fHRWPv2iplu-3TxvV7SxQnkmI2-h6Ovjyidh1667vuJ1uC7WGo_X8n-wNVL2D3</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Combining Flexibility and Scalability in a Peer-to-Peer Publish/Subscribe System</title><source>Springer Books</source><creator>Zhang, Chi ; Krishnamurthy, Arvind ; Wang, Randolph Y. ; Singh, Jaswinder Pal</creator><contributor>Alonso, Gustavo</contributor><creatorcontrib>Zhang, Chi ; Krishnamurthy, Arvind ; Wang, Randolph Y. ; Singh, Jaswinder Pal ; Alonso, Gustavo</creatorcontrib><description>The content-based publish/subscribe model has been adopted by many services to deliver data between distributed users based on application-specific semantics. Two key issues in such systems, the semantic expressiveness of content matching and the scalability of the matching mechanism, are often found to be in conflict due to the complexity associated with content matching. In this paper, we present a novel content-based publish/subscribe architecture based on peer-to-peer matching trees. The system achieves scalability by partitioning the responsibility of event matching to self-organized peers while allowing customizable matching functionalities. Experimental results using a variety of real world datasets demonstrate the scalability and flexibility of the system.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540303235</identifier><identifier>ISBN: 9783540303237</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540322698</identifier><identifier>EISBN: 9783540322696</identifier><identifier>DOI: 10.1007/11587552_6</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; matching ; peer-to-peer ; publish/subscribe ; Software ; Software engineering</subject><ispartof>Lecture notes in computer science, 2005, p.102-123</ispartof><rights>IFIP International Federation for Information Processing 2005</rights><rights>2006 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11587552_6$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11587552_6$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17416203$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Alonso, Gustavo</contributor><creatorcontrib>Zhang, Chi</creatorcontrib><creatorcontrib>Krishnamurthy, Arvind</creatorcontrib><creatorcontrib>Wang, Randolph Y.</creatorcontrib><creatorcontrib>Singh, Jaswinder Pal</creatorcontrib><title>Combining Flexibility and Scalability in a Peer-to-Peer Publish/Subscribe System</title><title>Lecture notes in computer science</title><description>The content-based publish/subscribe model has been adopted by many services to deliver data between distributed users based on application-specific semantics. Two key issues in such systems, the semantic expressiveness of content matching and the scalability of the matching mechanism, are often found to be in conflict due to the complexity associated with content matching. In this paper, we present a novel content-based publish/subscribe architecture based on peer-to-peer matching trees. The system achieves scalability by partitioning the responsibility of event matching to self-organized peers while allowing customizable matching functionalities. Experimental results using a variety of real world datasets demonstrate the scalability and flexibility of the system.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>matching</subject><subject>peer-to-peer</subject><subject>publish/subscribe</subject><subject>Software</subject><subject>Software engineering</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540303235</isbn><isbn>9783540303237</isbn><isbn>3540322698</isbn><isbn>9783540322696</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2005</creationdate><recordtype>book_chapter</recordtype><recordid>eNpFkMtKAzEUhuMNrLUbnyAbwU1s7pelFKtCwYHRdUhmkhqdzpTJFOzbO6UFz-Y_h-_n3AC4I_iRYKzmhAithKBWnoEbJjhmlEqjz8GESEIQY9xcnMCImLgEkzGjyCjOrsEs5288BiPacDYBxaLb-NSmdg2XTfhNPjVp2EPX1rCsXONOdWqhg0UIPRo6dFBY7HyT8te83Plc9ckHWO7zEDa34Cq6JofZSafgc_n8sXhFq_eXt8XTCm2p4AOKlZLRRBWpFhXBh8uCl1pw6gQ2pqbaUC0lM9KzygdDsFDB1NrXdcSKcjYF98e-W5fHRWPv2iplu-3TxvV7SxQnkmI2-h6Ovjyidh1667vuJ1uC7WGo_X8n-wNVL2D3</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Zhang, Chi</creator><creator>Krishnamurthy, Arvind</creator><creator>Wang, Randolph Y.</creator><creator>Singh, Jaswinder Pal</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Combining Flexibility and Scalability in a Peer-to-Peer Publish/Subscribe System</title><author>Zhang, Chi ; Krishnamurthy, Arvind ; Wang, Randolph Y. ; Singh, Jaswinder Pal</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p254t-fc76f9f7f285c101007eb68542a5099d2892866396b3cbe91057e9d8bddf07243</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>matching</topic><topic>peer-to-peer</topic><topic>publish/subscribe</topic><topic>Software</topic><topic>Software engineering</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhang, Chi</creatorcontrib><creatorcontrib>Krishnamurthy, Arvind</creatorcontrib><creatorcontrib>Wang, Randolph Y.</creatorcontrib><creatorcontrib>Singh, Jaswinder Pal</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhang, Chi</au><au>Krishnamurthy, Arvind</au><au>Wang, Randolph Y.</au><au>Singh, Jaswinder Pal</au><au>Alonso, Gustavo</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Combining Flexibility and Scalability in a Peer-to-Peer Publish/Subscribe System</atitle><btitle>Lecture notes in computer science</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2005</date><risdate>2005</risdate><spage>102</spage><epage>123</epage><pages>102-123</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540303235</isbn><isbn>9783540303237</isbn><eisbn>3540322698</eisbn><eisbn>9783540322696</eisbn><abstract>The content-based publish/subscribe model has been adopted by many services to deliver data between distributed users based on application-specific semantics. Two key issues in such systems, the semantic expressiveness of content matching and the scalability of the matching mechanism, are often found to be in conflict due to the complexity associated with content matching. In this paper, we present a novel content-based publish/subscribe architecture based on peer-to-peer matching trees. The system achieves scalability by partitioning the responsibility of event matching to self-organized peers while allowing customizable matching functionalities. Experimental results using a variety of real world datasets demonstrate the scalability and flexibility of the system.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11587552_6</doi><tpages>22</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2005, p.102-123 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_17416203 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology matching peer-to-peer publish/subscribe Software Software engineering |
| title | Combining Flexibility and Scalability in a Peer-to-Peer Publish/Subscribe System |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T04%3A52%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Combining%20Flexibility%20and%20Scalability%20in%20a%20Peer-to-Peer%20Publish/Subscribe%20System&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Zhang,%20Chi&rft.date=2005&rft.spage=102&rft.epage=123&rft.pages=102-123&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540303235&rft.isbn_list=9783540303237&rft_id=info:doi/10.1007/11587552_6&rft_dat=%3Cpascalfrancis_sprin%3E17416203%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540322698&rft.eisbn_list=9783540322696&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |