메뉴 건너뛰기




Volumn , Issue , 2007, Pages 543-550

Self-organizing broker topologies for publish/subscribe systems

Author keywords

Adaptable middleware; Overlay networks; Publish subscribe; Self organization

Indexed keywords

ELECTRONIC PUBLISHING; ROUTING ALGORITHMS; TELECOMMUNICATION TRAFFIC; TOPOLOGY;

EID: 35248894291     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1244002.1244128     Document Type: Conference Paper
Times cited : (40)

References (13)
  • 1
    • 33746601556 scopus 로고    scopus 로고
    • A self-organizing crash-resilient topology management system for content-based publish/subscribe
    • A. Carzaniga and P. Fenkam, editors, Edinburgh, Scotland, UK, May, IEEE
    • R. Baldoni, R. Beraldi, L. Querzoni, and A. Virgillito. A self-organizing crash-resilient topology management system for content-based publish/subscribe. In A. Carzaniga and P. Fenkam, editors, 3rd International Workshop on Distributed Event-Based Systems (DEBS'04), Edinburgh, Scotland, UK, May 2004. IEEE.
    • (2004) 3rd International Workshop on Distributed Event-Based Systems (DEBS'04)
    • Baldoni, R.1    Beraldi, R.2    Querzoni, L.3    Virgillito, A.4
  • 2
    • 4544364129 scopus 로고    scopus 로고
    • Subscription-driven self-organization in content-based publish/subscribe. Technical report, DIS
    • Mar
    • R. Baldoni, R. Beraldi, L. Querzoni, and A. Virgillito. Subscription-driven self-organization in content-based publish/subscribe. Technical report, DIS, Mar. 2004.
    • (2004)
    • Baldoni, R.1    Beraldi, R.2    Querzoni, L.3    Virgillito, A.4
  • 3
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
    • (1970) Communications of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.H.1
  • 5
    • 0000602164 scopus 로고
    • Optimum communication spanning trees
    • T. Hu. Optimum communication spanning trees. SIAM Journal on Computing, 3(3):188-195, 1974.
    • (1974) SIAM Journal on Computing , vol.3 , Issue.3 , pp. 188-195
    • Hu, T.1
  • 7
    • 84986976912 scopus 로고
    • The complexity of the network design problem
    • D. S. Johnson, J. K. Lenstra, and A. H. G. R. Kan. The complexity of the network design problem. Networks, 8:279-285, 1978.
    • (1978) Networks , vol.8 , pp. 279-285
    • Johnson, D.S.1    Lenstra, J.K.2    Kan, A.H.G.R.3
  • 10
    • 35248827209 scopus 로고    scopus 로고
    • Peer-to-peer overlay broker networks in an event-based middleware
    • P. R. Pietzuch and J. Bacon. Peer-to-peer overlay broker networks in an event-based middleware. In Jacobsen [6].
    • Jacobsen , vol.6
    • Pietzuch, P.R.1    Bacon, J.2
  • 11
    • 57349142855 scopus 로고    scopus 로고
    • Pastry: Scalable, decentraized object location and routing for large-scale peer-to-peer systems
    • R. Guerraoui, editor, 18th IFIP/ACM International Conference on Distributed Systems Platforms Middleware, of, Heidelberg, Germany, Springer-Verlag
    • A. Rowstron and P. Druschel. Pastry: scalable, decentraized object location and routing for large-scale peer-to-peer systems. In R. Guerraoui, editor, 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), volume 2218 of LNCS, pages 329-350, Heidelberg, Germany, 2001. Springer-Verlag.
    • (2001) LNCS , vol.2218 , pp. 329-350
    • Rowstron, A.1    Druschel, P.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.