Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/978-3-540-71661-7_37 | databases, information systems, and peer-to-peer computing |
Field | DocType | Volume |
Data science,Publication,Data mining,Computer science,Software design pattern,Design pattern | Conference | 4125 |
ISSN | Citations | PageRank |
0302-9743 | 5 | 0.43 |
References | Authors | |
19 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| matthias bender | 1 | 309 | 14.34 |
| Sebastian Michel | 2 | 946 | 58.72 |
| Sebastian Parkitny | 3 | 5 | 0.43 |
| Gerhard Weikum | 4 | 12710 | 2146.01 |