日本語
 
Help Privacy Policy ポリシー/免責事項
  詳細検索ブラウズ

アイテム詳細


公開

会議論文

A Comparative Study of Pub/Sub Methods in Structured P2P Networks

MPS-Authors
/persons/resource/persons44113

Bender,  Matthias
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons45041

Michel,  Sebastian
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons45163

Parkitny,  Sebastian
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons45720

Weikum,  Gerhard
Databases and Information Systems, MPI for Informatics, Max Planck Society;

External Resource
There are no locators available
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
フルテキスト (公開)
公開されているフルテキストはありません
付随資料 (公開)
There is no public supplementary material available
引用

Bender, M., Michel, S., Parkitny, S., & Weikum, G. (2007). A Comparative Study of Pub/Sub Methods in Structured P2P Networks. In G., Moro, S., Bergamaschi, S., Joseph, J.-H., Morin, & A. M., Ouksel (Eds.), Databases, Information Systems, and Peer-to-Peer Computing: International Workshops, DBISP2P 2005/2006 (pp. 385-396). Berlin, Germany: Springer.


引用: https://hdl.handle.net/11858/00-001M-0000-000F-1DD5-9
要旨
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.