Covering-Based Routing Algorithms for Cyclic Content-Based P/S Overlays

Content-based routing(CBR) publish/subscribe(P/S) system is an important class of distributed systems.This system differs from classical paradigms as messages are routed based on their content rather than their destination address,so as to provide a fine-granularity event dissemination,and support m...

Full description

Saved in:
Bibliographic Details
Published inJournal of computer science and technology Vol. 25; no. 6; pp. 1214 - 1224
Main Author 陈明文 张健 虎嵩林 刘志勇
Format Journal Article
LanguageEnglish
Published Boston Springer US 01.11.2010
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN1000-9000
1860-4749
DOI10.1007/s11390-010-9400-7

Cover

More Information
Summary:Content-based routing(CBR) publish/subscribe(P/S) system is an important class of distributed systems.This system differs from classical paradigms as messages are routed based on their content rather than their destination address,so as to provide a fine-granularity event dissemination,and support more flexibility decoupling applications.Covering-based routing is a typical optimization method of CBR and has been widely used as a building block in many distributed P/S systems,for it maintains a compact routing table and reduces the costs of communications and matching computations.So far as we know,this optimization method can only be implemented on acyclic overlay network,but cannot be directly utilized on cyclic networks.As the CBR in cyclic systems becomes a new focus of research,developing covering-based protocols and algorithms for cyclic P/S system is becoming significantly important.This paper contributes the cyclic covering-based routing protocol with corresponding algorithms to support covering-based protocol in cyclic P/S system,and implements it in PADRES,a distributed event management infrastructure based on the publish/subscribe model.
Bibliography:11-2296/TP
TP393
cyclic topology,covering-based routing,content-based routing,publish/subscribe system
TP31
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1000-9000
1860-4749
DOI:10.1007/s11390-010-9400-7