Mostra i principali dati dell'item
Caching in content-based publish/subscribe systems
dc.creator | Sourlas, V. | en |
dc.creator | Paschos, G. S. | en |
dc.creator | Flegkas, P. | en |
dc.creator | Tassiulas, L. | en |
dc.date.accessioned | 2015-11-23T10:48:02Z | |
dc.date.available | 2015-11-23T10:48:02Z | |
dc.date.issued | 2009 | |
dc.identifier | 10.1109/GLOCOM.2009.5425532 | |
dc.identifier.isbn | 9781424441488 | |
dc.identifier.uri | http://hdl.handle.net/11615/33222 | |
dc.description.abstract | In a publish/subscribe network, message delivery is guaranteed for all active subscribers at publish time. However, in a dynamic scenario where users join and leave the network, a user may be interested in content published before the subscription time. In this paper, we introduce mechanisms that enable caching in such networks, while maintaining the main principle of loose-coupled and asynchronous communication. Furthermore we investigate two caching policies; caching in all candidate brokers (basic caching) which yields high survivability and low delay and caching in leaf brokers (leaf caching) which maintains low overhead and querying complexity. The comparison is performed via simulations and testbed measurements and insights are given for future work. | en |
dc.source.uri | http://www.scopus.com/inward/record.url?eid=2-s2.0-77951591132&partnerID=40&md5=1aa5a246c1be913ab833398179385a67 | |
dc.subject | Asynchronous communication | en |
dc.subject | Caching policy | en |
dc.subject | Content-based publish/subscribe systems | en |
dc.subject | Low delay | en |
dc.subject | Low overhead | en |
dc.subject | Message delivery | en |
dc.subject | Publish/subscribe networks | en |
dc.subject | Testbed measurements | en |
dc.title | Caching in content-based publish/subscribe systems | en |
dc.type | conferenceItem | en |
Files in questo item
Files | Dimensione | Formato | Mostra |
---|---|---|---|
Nessun files in questo item. |