A Comparative Study of Pub/Sub Methods in Structured P2P Networks
Identifieur interne : 001791 ( Istex/Corpus ); précédent : 001790; suivant : 001792A Comparative Study of Pub/Sub Methods in Structured P2P Networks
Auteurs : Matthias Bender ; Sebastian Michel ; Sebastian Parkitny ; Gerhard WeikumSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2007.
English descriptors
- Teeft :
- Actual document dissemination, Analytical model, Analytical results, Appropriate subscribers, Average number, Bender, Comparative study, Complexity complexity, Data networks, Design patterns, Directory, Directory node, Directory nodes, Directory peer, Directory peers, Document dissemination, Hash tables, High rates, Information retrieval, Large number, Larger variation, Lower publishing rate, Message types, Messaging complexity, Network dynamics, News story, Node, Optimal design pattern, Previous behavior, Promising publishers, Publisher, Publishers need, Publishing rate, Publishing rate increases, Research topic, Scenario, Small number, Subavg, Subscriber, Subscriber list, Subscribers snew, Subscription, Subscription process, Subscription terms, System model, System parameters, Time interval, Topics sports, Total number, Unstructured networks, Usage patterns.
Abstract
Abstract: Methods for publish/subscribe applications over P2P networks have been a research issue for a long time. Many approaches have been developed and evaluated, but typically each based on different assumptions, which makes their mutual comparison very difficult if not impossible. We identify two design patterns that can be used to implement publish/subscribe applications over structured P2P networks and provide an analytical analysis of their complexity. Based on a characterization of different real-world usage scenarios we present evidence as to which approach is preferable for certain application classes. Finally, we present simulation results that support our analysis.
Url:
DOI: 10.1007/978-3-540-71661-7_37
Links to Exploration step
ISTEX:E609CEDCD6FC8CC10D370D41409086A1DFB76AF7Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Comparative Study of Pub/Sub Methods in Structured P2P Networks</title><author><name sortKey="Bender, Matthias" sort="Bender, Matthias" uniqKey="Bender M" first="Matthias" last="Bender">Matthias Bender</name><affiliation><mods:affiliation>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: mbender@mpi-inf.mpg.de</mods:affiliation></affiliation></author><author><name sortKey="Michel, Sebastian" sort="Michel, Sebastian" uniqKey="Michel S" first="Sebastian" last="Michel">Sebastian Michel</name><affiliation><mods:affiliation>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: smichel@mpi-inf.mpg.de</mods:affiliation></affiliation></author><author><name sortKey="Parkitny, Sebastian" sort="Parkitny, Sebastian" uniqKey="Parkitny S" first="Sebastian" last="Parkitny">Sebastian Parkitny</name><affiliation><mods:affiliation>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: parkitny@mpi-inf.mpg.de</mods:affiliation></affiliation></author><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name><affiliation><mods:affiliation>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: weikum@mpi-inf.mpg.de</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:E609CEDCD6FC8CC10D370D41409086A1DFB76AF7</idno><date when="2007" year="2007">2007</date><idno type="doi">10.1007/978-3-540-71661-7_37</idno><idno type="url">https://api.istex.fr/document/E609CEDCD6FC8CC10D370D41409086A1DFB76AF7/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001791</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001791</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Comparative Study of Pub/Sub Methods in Structured P2P Networks</title><author><name sortKey="Bender, Matthias" sort="Bender, Matthias" uniqKey="Bender M" first="Matthias" last="Bender">Matthias Bender</name><affiliation><mods:affiliation>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: mbender@mpi-inf.mpg.de</mods:affiliation></affiliation></author><author><name sortKey="Michel, Sebastian" sort="Michel, Sebastian" uniqKey="Michel S" first="Sebastian" last="Michel">Sebastian Michel</name><affiliation><mods:affiliation>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: smichel@mpi-inf.mpg.de</mods:affiliation></affiliation></author><author><name sortKey="Parkitny, Sebastian" sort="Parkitny, Sebastian" uniqKey="Parkitny S" first="Sebastian" last="Parkitny">Sebastian Parkitny</name><affiliation><mods:affiliation>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: parkitny@mpi-inf.mpg.de</mods:affiliation></affiliation></author><author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name><affiliation><mods:affiliation>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: weikum@mpi-inf.mpg.de</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2007</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Actual document dissemination</term><term>Analytical model</term><term>Analytical results</term><term>Appropriate subscribers</term><term>Average number</term><term>Bender</term><term>Comparative study</term><term>Complexity complexity</term><term>Data networks</term><term>Design patterns</term><term>Directory</term><term>Directory node</term><term>Directory nodes</term><term>Directory peer</term><term>Directory peers</term><term>Document dissemination</term><term>Hash tables</term><term>High rates</term><term>Information retrieval</term><term>Large number</term><term>Larger variation</term><term>Lower publishing rate</term><term>Message types</term><term>Messaging complexity</term><term>Network dynamics</term><term>News story</term><term>Node</term><term>Optimal design pattern</term><term>Previous behavior</term><term>Promising publishers</term><term>Publisher</term><term>Publishers need</term><term>Publishing rate</term><term>Publishing rate increases</term><term>Research topic</term><term>Scenario</term><term>Small number</term><term>Subavg</term><term>Subscriber</term><term>Subscriber list</term><term>Subscribers snew</term><term>Subscription</term><term>Subscription process</term><term>Subscription terms</term><term>System model</term><term>System parameters</term><term>Time interval</term><term>Topics sports</term><term>Total number</term><term>Unstructured networks</term><term>Usage patterns</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Methods for publish/subscribe applications over P2P networks have been a research issue for a long time. Many approaches have been developed and evaluated, but typically each based on different assumptions, which makes their mutual comparison very difficult if not impossible. We identify two design patterns that can be used to implement publish/subscribe applications over structured P2P networks and provide an analytical analysis of their complexity. Based on a characterization of different real-world usage scenarios we present evidence as to which approach is preferable for certain application classes. Finally, we present simulation results that support our analysis.</div></front></TEI><istex><corpusName>springer</corpusName><keywords><teeft><json:string>subscriber</json:string><json:string>node</json:string><json:string>bender</json:string><json:string>average number</json:string><json:string>scenario</json:string><json:string>subavg</json:string><json:string>directory nodes</json:string><json:string>design patterns</json:string><json:string>subscription</json:string><json:string>comparative study</json:string><json:string>system parameters</json:string><json:string>publishing rate</json:string><json:string>time interval</json:string><json:string>information retrieval</json:string><json:string>publisher</json:string><json:string>high rates</json:string><json:string>large number</json:string><json:string>message types</json:string><json:string>hash tables</json:string><json:string>publishers need</json:string><json:string>analytical results</json:string><json:string>directory node</json:string><json:string>directory peer</json:string><json:string>directory</json:string><json:string>subscription terms</json:string><json:string>usage patterns</json:string><json:string>optimal design pattern</json:string><json:string>data networks</json:string><json:string>analytical model</json:string><json:string>actual document dissemination</json:string><json:string>subscription process</json:string><json:string>unstructured networks</json:string><json:string>research topic</json:string><json:string>appropriate subscribers</json:string><json:string>directory peers</json:string><json:string>document dissemination</json:string><json:string>lower publishing rate</json:string><json:string>topics sports</json:string><json:string>network dynamics</json:string><json:string>subscriber list</json:string><json:string>promising publishers</json:string><json:string>messaging complexity</json:string><json:string>subscribers snew</json:string><json:string>complexity complexity</json:string><json:string>previous behavior</json:string><json:string>news story</json:string><json:string>publishing rate increases</json:string><json:string>system model</json:string><json:string>total number</json:string><json:string>larger variation</json:string><json:string>small number</json:string></teeft></keywords><author><json:item><name>Matthias Bender</name><affiliations><json:string>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken,</json:string><json:string>E-mail: mbender@mpi-inf.mpg.de</json:string></affiliations></json:item><json:item><name>Sebastian Michel</name><affiliations><json:string>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken,</json:string><json:string>E-mail: smichel@mpi-inf.mpg.de</json:string></affiliations></json:item><json:item><name>Sebastian Parkitny</name><affiliations><json:string>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken,</json:string><json:string>E-mail: parkitny@mpi-inf.mpg.de</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken,</json:string><json:string>E-mail: weikum@mpi-inf.mpg.de</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: Methods for publish/subscribe applications over P2P networks have been a research issue for a long time. Many approaches have been developed and evaluated, but typically each based on different assumptions, which makes their mutual comparison very difficult if not impossible. We identify two design patterns that can be used to implement publish/subscribe applications over structured P2P networks and provide an analytical analysis of their complexity. Based on a characterization of different real-world usage scenarios we present evidence as to which approach is preferable for certain application classes. Finally, we present simulation results that support our analysis.</abstract><qualityIndicators><score>5.614</score><pdfWordCount>4450</pdfWordCount><pdfCharCount>26627</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>12</pdfPageCount><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>97</abstractWordCount><abstractCharCount>686</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>A Comparative Study of Pub/Sub Methods in Structured P2P Networks</title><chapterId><json:string>37</json:string><json:string>Chap37</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>2007</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>David Hutchison</name></json:item><json:item><name>Takeo Kanade</name></json:item><json:item><name>Josef Kittler</name></json:item><json:item><name>Jon M. Kleinberg</name></json:item><json:item><name>Friedemann Mattern</name></json:item><json:item><name>John C. Mitchell</name></json:item><json:item><name>Moni Naor</name></json:item><json:item><name>Oscar Nierstrasz</name></json:item><json:item><name>C. Pandu Rangan</name></json:item><json:item><name>Bernhard Steffen</name></json:item><json:item><name>Madhu Sudan</name></json:item><json:item><name>Demetri Terzopoulos</name></json:item><json:item><name>Doug Tygar</name></json:item><json:item><name>Moshe Y. Vardi</name></json:item><json:item><name>Gerhard Weikum</name></json:item></editor></serie><host><title>Databases, Information Systems, and Peer-to-Peer Computing</title><language><json:string>unknown</json:string></language><copyrightDate>2007</copyrightDate><doi><json:string>10.1007/978-3-540-71661-7</json:string></doi><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><eisbn><json:string>978-3-540-71661-7</json:string></eisbn><bookId><json:string>978-3-540-71661-7</json:string></bookId><isbn><json:string>978-3-540-71660-0</json:string></isbn><volume>4125</volume><pages><first>385</first><last>396</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Gianluca Moro</name></json:item><json:item><name>Sonia Bergamaschi</name></json:item><json:item><name>Sam Joseph</name></json:item><json:item><name>Jean-Henry Morin</name></json:item><json:item><name>Aris M. Ouksel</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Database Management</value></json:item><json:item><value>Information Storage and Retrieval</value></json:item><json:item><value>Information Systems Applications (incl.Internet)</value></json:item><json:item><value>Computer Communication Networks</value></json:item><json:item><value>Software Engineering</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item></subject></host><categories><inist><json:string>sciences humaines et sociales</json:string></inist></categories><publicationDate>2007</publicationDate><copyrightDate>2007</copyrightDate><doi><json:string>10.1007/978-3-540-71661-7_37</json:string></doi><id>E609CEDCD6FC8CC10D370D41409086A1DFB76AF7</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/E609CEDCD6FC8CC10D370D41409086A1DFB76AF7/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/E609CEDCD6FC8CC10D370D41409086A1DFB76AF7/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/E609CEDCD6FC8CC10D370D41409086A1DFB76AF7/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">A Comparative Study of Pub/Sub Methods in Structured P2P Networks</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag Berlin Heidelberg, 2007</p></availability><date>2007</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">A Comparative Study of Pub/Sub Methods in Structured P2P Networks</title><author xml:id="author-0000"><persName><forename type="first">Matthias</forename><surname>Bender</surname></persName><email>mbender@mpi-inf.mpg.de</email><affiliation>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken</affiliation></author><author xml:id="author-0001"><persName><forename type="first">Sebastian</forename><surname>Michel</surname></persName><email>smichel@mpi-inf.mpg.de</email><affiliation>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken</affiliation></author><author xml:id="author-0002"><persName><forename type="first">Sebastian</forename><surname>Parkitny</surname></persName><email>parkitny@mpi-inf.mpg.de</email><affiliation>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken</affiliation></author><author xml:id="author-0003"><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><email>weikum@mpi-inf.mpg.de</email><affiliation>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken</affiliation></author><idno type="istex">E609CEDCD6FC8CC10D370D41409086A1DFB76AF7</idno><idno type="DOI">10.1007/978-3-540-71661-7_37</idno><idno type="ChapterID">37</idno><idno type="ChapterID">Chap37</idno></analytic><monogr><title level="m">Databases, Information Systems, and Peer-to-Peer Computing</title><title level="m" type="sub">International Workshops, DBISP2P 2005/2006, Trondheim, Norway, August 28-29, 2005, Seoul, Korea, September 11, 2006, Revised Selected Papers</title><idno type="DOI">10.1007/978-3-540-71661-7</idno><idno type="pISBN">978-3-540-71660-0</idno><idno type="eISBN">978-3-540-71661-7</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="book-title-ID">148763</idno><idno type="book-ID">978-3-540-71661-7</idno><idno type="book-chapter-count">39</idno><idno type="book-volume-number">4125</idno><idno type="book-sequence-number">4125</idno><idno type="PartChapterCount">3</idno><editor xml:id="book-author-0000"><persName><forename type="first">Gianluca</forename><surname>Moro</surname></persName></editor><editor xml:id="book-author-0001"><persName><forename type="first">Sonia</forename><surname>Bergamaschi</surname></persName></editor><editor xml:id="book-author-0002"><persName><forename type="first">Sam</forename><surname>Joseph</surname></persName></editor><editor xml:id="book-author-0003"><persName><forename type="first">Jean-Henry</forename><surname>Morin</surname></persName></editor><editor xml:id="book-author-0004"><persName><forename type="first">Aris</forename><forename type="first">M.</forename><surname>Ouksel</surname></persName></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2007"></date><biblScope unit="volume">4125</biblScope><biblScope unit="page" from="385">385</biblScope><biblScope unit="page" to="396">396</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor xml:id="serie-author-0000"><persName><forename type="first">David</forename><surname>Hutchison</surname></persName></editor><editor xml:id="serie-author-0001"><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName></editor><editor xml:id="serie-author-0002"><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName></editor><editor xml:id="serie-author-0003"><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName></editor><editor xml:id="serie-author-0004"><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName></editor><editor xml:id="serie-author-0005"><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName></editor><editor xml:id="serie-author-0006"><persName><forename type="first">Moni</forename><surname>Naor</surname></persName></editor><editor xml:id="serie-author-0007"><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName></editor><editor xml:id="serie-author-0008"><persName><forename type="first">C.</forename><forename type="first">Pandu</forename><surname>Rangan</surname></persName></editor><editor xml:id="serie-author-0009"><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName></editor><editor xml:id="serie-author-0010"><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName></editor><editor xml:id="serie-author-0011"><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName></editor><editor xml:id="serie-author-0012"><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName></editor><editor xml:id="serie-author-0013"><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName></editor><editor xml:id="serie-author-0014"><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName></editor><biblScope><date>2007</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2007</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: Methods for publish/subscribe applications over P2P networks have been a research issue for a long time. Many approaches have been developed and evaluated, but typically each based on different assumptions, which makes their mutual comparison very difficult if not impossible. We identify two design patterns that can be used to implement publish/subscribe applications over structured P2P networks and provide an analytical analysis of their complexity. Based on a characterization of different real-world usage scenarios we present evidence as to which approach is preferable for certain application classes. Finally, we present simulation results that support our analysis.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><item><term>Computer Science</term></item><label>I18024</label><item><term>Database Management</term></item><label>I18032</label><item><term>Information Storage and Retrieval</term></item><label>I18040</label><item><term>Information Systems Applications (incl.Internet)</term></item><label>I13022</label><item><term>Computer Communication Networks</term></item><label>I14029</label><item><term>Software Engineering</term></item><label>I21017</label><item><term>Artificial Intelligence (incl. Robotics)</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2007">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/E609CEDCD6FC8CC10D370D41409086A1DFB76AF7/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:document><!-- Converted from LaTeX with LaTeX2A++ V2.0.16 --><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo TocLevels="0" SeriesType="Series"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle><SeriesAbbreviatedTitle>LNCS</SeriesAbbreviatedTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><GivenName>Pandu</GivenName><FamilyName>Rangan</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo Language="En" NumberingStyle="Unnumbered" OutputMedium="All" TocLevels="0" BookProductType="Proceedings" MediaType="eBook"><BookID>978-3-540-71661-7</BookID><BookTitle>Databases, Information Systems, and Peer-to-Peer Computing</BookTitle><BookSubTitle>International Workshops, DBISP2P 2005/2006, Trondheim, Norway, August 28-29, 2005, Seoul, Korea, September 11, 2006, Revised Selected Papers</BookSubTitle><BookVolumeNumber>4125</BookVolumeNumber><BookSequenceNumber>4125</BookSequenceNumber><BookDOI>10.1007/978-3-540-71661-7</BookDOI><BookTitleID>148763</BookTitleID><BookPrintISBN>978-3-540-71660-0</BookPrintISBN><BookElectronicISBN>978-3-540-71661-7</BookElectronicISBN><BookChapterCount>39</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2007</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I18024" Priority="1" Type="Secondary">Database Management</BookSubject><BookSubject Code="I18032" Priority="2" Type="Secondary">Information Storage and Retrieval</BookSubject><BookSubject Code="I18040" Priority="3" Type="Secondary">Information Systems Applications (incl.Internet)</BookSubject><BookSubject Code="I13022" Priority="4" Type="Secondary">Computer Communication Networks</BookSubject><BookSubject Code="I14029" Priority="5" Type="Secondary">Software Engineering</BookSubject><BookSubject Code="I21017" Priority="6" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Gianluca</GivenName><FamilyName>Moro</FamilyName></EditorName><Contact><Email>gmoro@deis.unibo.it</Email></Contact></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Sonia</GivenName><FamilyName>Bergamaschi</FamilyName></EditorName><Contact><Email>bergamaschi.sonia@unimo.it</Email></Contact></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Sam</GivenName><FamilyName>Joseph</FamilyName></EditorName><Contact><Email>srjoseph@hawaii.edu</Email></Contact></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jean-Henry</GivenName><FamilyName>Morin</FamilyName></EditorName><Contact><Email>Jean-Henry.Morin@cui.unige.ch</Email></Contact></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Aris</GivenName><GivenName>M.</GivenName><FamilyName>Ouksel</FamilyName></EditorName><Contact><Email>aris@uic.edu</Email></Contact></Editor></EditorGroup></BookHeader><Part ID="Part11"><PartInfo TocLevels="0"><PartID>11</PartID><PartSequenceNumber>11</PartSequenceNumber><PartTitle>Continuous Queries and P2P Computing</PartTitle><PartChapterCount>3</PartChapterCount></PartInfo><Chapter ID="Chap37" Language="En"><ChapterInfo ChapterType="OriginalPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>37</ChapterID><ChapterDOI>10.1007/978-3-540-71661-7_37</ChapterDOI><ChapterSequenceNumber>37</ChapterSequenceNumber><ChapterTitle Language="En">A Comparative Study of Pub/Sub Methods in Structured P2P Networks</ChapterTitle><ChapterFirstPage>385</ChapterFirstPage><ChapterLastPage>396</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2007</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Matthias</GivenName><FamilyName>Bender</FamilyName></AuthorName><Contact><Email>mbender@mpi-inf.mpg.de</Email></Contact></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Sebastian</GivenName><FamilyName>Michel</FamilyName></AuthorName><Contact><Email>smichel@mpi-inf.mpg.de</Email></Contact></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Sebastian</GivenName><FamilyName>Parkitny</FamilyName></AuthorName><Contact><Email>parkitny@mpi-inf.mpg.de</Email></Contact></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></AuthorName><Contact><Email>weikum@mpi-inf.mpg.de</Email></Contact></Author><Affiliation ID="Aff1"><OrgName>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken</OrgName><OrgAddress><Country> </Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>Methods for publish/subscribe applications over P2P networks have been a research issue for a long time. Many approaches have been developed and evaluated, but typically each based on different assumptions, which makes their mutual comparison very difficult if not impossible. We identify two design patterns that can be used to implement publish/subscribe applications over structured P2P networks and provide an analytical analysis of their complexity. Based on a characterization of different real-world usage scenarios we present evidence as to which approach is preferable for certain application classes. Finally, we present simulation results that support our analysis.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>A Comparative Study of Pub/Sub Methods in Structured P2P Networks</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>A Comparative Study of Pub/Sub Methods in Structured P2P Networks</title></titleInfo><name type="personal"><namePart type="given">Matthias</namePart><namePart type="family">Bender</namePart><affiliation>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken</affiliation><affiliation>E-mail: mbender@mpi-inf.mpg.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Sebastian</namePart><namePart type="family">Michel</namePart><affiliation>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken</affiliation><affiliation>E-mail: smichel@mpi-inf.mpg.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Sebastian</namePart><namePart type="family">Parkitny</namePart><affiliation>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken</affiliation><affiliation>E-mail: parkitny@mpi-inf.mpg.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken</affiliation><affiliation>E-mail: weikum@mpi-inf.mpg.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2007</dateIssued><copyrightDate encoding="w3cdtf">2007</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: Methods for publish/subscribe applications over P2P networks have been a research issue for a long time. Many approaches have been developed and evaluated, but typically each based on different assumptions, which makes their mutual comparison very difficult if not impossible. We identify two design patterns that can be used to implement publish/subscribe applications over structured P2P networks and provide an analytical analysis of their complexity. Based on a characterization of different real-world usage scenarios we present evidence as to which approach is preferable for certain application classes. Finally, we present simulation results that support our analysis.</abstract><relatedItem type="host"><titleInfo><title>Databases, Information Systems, and Peer-to-Peer Computing</title><subTitle>International Workshops, DBISP2P 2005/2006, Trondheim, Norway, August 28-29, 2005, Seoul, Korea, September 11, 2006, Revised Selected Papers</subTitle></titleInfo><name type="personal"><namePart type="given">Gianluca</namePart><namePart type="family">Moro</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Sonia</namePart><namePart type="family">Bergamaschi</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Sam</namePart><namePart type="family">Joseph</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jean-Henry</namePart><namePart type="family">Morin</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Aris</namePart><namePart type="given">M.</namePart><namePart type="family">Ouksel</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2007</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I18024">Database Management</topic><topic authority="SpringerSubjectCodes" authorityURI="I18032">Information Storage and Retrieval</topic><topic authority="SpringerSubjectCodes" authorityURI="I18040">Information Systems Applications (incl.Internet)</topic><topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic><topic authority="SpringerSubjectCodes" authorityURI="I14029">Software Engineering</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic></subject><identifier type="DOI">10.1007/978-3-540-71661-7</identifier><identifier type="ISBN">978-3-540-71660-0</identifier><identifier type="eISBN">978-3-540-71661-7</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">148763</identifier><identifier type="BookID">978-3-540-71661-7</identifier><identifier type="BookChapterCount">39</identifier><identifier type="BookVolumeNumber">4125</identifier><identifier type="BookSequenceNumber">4125</identifier><identifier type="PartChapterCount">3</identifier><part><date>2007</date><detail type="part"><title>Continuous Queries and P2P Computing</title></detail><detail type="volume"><number>4125</number><caption>vol.</caption></detail><extent unit="pages"><start>385</start><end>396</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2007</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="given">Pandu</namePart><namePart type="family">Rangan</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2007</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2007</recordOrigin></recordInfo></relatedItem><identifier type="istex">E609CEDCD6FC8CC10D370D41409086A1DFB76AF7</identifier><identifier type="DOI">10.1007/978-3-540-71661-7_37</identifier><identifier type="ChapterID">37</identifier><identifier type="ChapterID">Chap37</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2007</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer Berlin Heidelberg, 2007</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001791 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001791 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Sarre
|area= MusicSarreV3
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:E609CEDCD6FC8CC10D370D41409086A1DFB76AF7
|texte= A Comparative Study of Pub/Sub Methods in Structured P2P Networks
}}
| This area was generated with Dilib version V0.6.33. |  |