Welcome to D
SIGMOD 2005
PODS 2005
SIGMOD-RECOR
CIDR 2005
CIKM 2005
COMAD 2005
CVDB 2005
DaMoN 2005
Data Enginee
DEBS05
<<< = DEBS'05 Pape>>>
DMSN 2005
DOLAP 2005
GIR 2005
GIS 2005
Hypertext 20
ICDE 2005
ICDM 2005
IHIS 2005
IQIS 2005
JCDL 2005
KRAS 2005
MDM 2005
MIR 2005
MobiDE 2005
P2PIR 2005
RIDE 2005
SBBD 2005
SIGIR 2005
SIGIR-FORUM
SIGKDD 2005
SIGKDD-EXP
SSDBM 2005
TIME 2005
TKDE 2005
TODS 2005
VLDB 2005
VLDBJ 2005
WebDB 2005
WIDM 2005

Publish-Subscribe Tree-Maintenance over a DHT


Paolo Costa and Davide Frey

  View Paper (PDF)  

Return to Session 3: Ad Hoc and Dynamic Topologies


Abstract

Content-based publish-subscribe middleware is emerging as a promising answer to the demands of modern highly dynamic distributed computing by providing the necessary decoupling and flexibility. The majority of currently available systems implement event dispatching on top of an overlay network with a tree topology. However, they fail to provide any mechanism to maintain it in the presence of failures, thus hampering their applicability in dynamic scenarios. In this paper, we present a novel approach to reconfiguring the overlay topology by exploiting a Distributed Hash Table. Our algorithm supports arbitrary tree topologies and deals very well with the dynamicity of network scenarios by limiting the impact of reconfigurations induced by topology changes. These results are confirmed by simulations which validate the applicability of our approach in reconfigurable publish-subscribe middleware. Beyond publish-subscribe, the algorithm is applicable in a wide range of contexts and provides a general way to maintain an overlay network with a controlled topology in dynamic environments.


©2006 Association for Computing Machinery