A DHT-based infrastructure for content-based publish/subscribe services

Proceedings - P2P - 7th IEEE International Conference on Peer-to-Peer Computing

Volumn , Issue , 2007, Pages 185-192

  Yang, Xiaoyu ^a   Hu, Yiming ^a  

^a University of Cincinnati   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TREES (MATHEMATICS);

CONTENT DISSEMINATIONS; DATA DISTRIBUTIONS; DELIVERY MECHANISMS; DISTRIBUTED CONTENTS; DISTRIBUTED HASH TABLES; EMBEDDED TREES; INFRA STRUCTURES; KEY FEATURES; LOAD BALANCING; PUBLISH/SUBSCRIBE; PUBLISH/SUBSCRIBE SYSTEMS; SCHEMAS;

MACHINE DESIGN;

EID: 47949085245     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/P2P.2007.4343479     Document Type: Conference Paper

References (23)

1. I. Aekaterinidis and P. Triantafillou. Pastrystrings: A comprehensive content-based publish/subscribe DHT network. In Proceedings of the 26th ICDCS, Lisboa, Portugal, Jul 2006.
2. G. Banavar, T. Chandra, B. Mukherjee, J. Nagarajarao, R. E. Strom, and D. C. Sturman. An efficient multicast protocol for content-based publish-subscribe systems. In Proceedings of the 19th IEEE ICDCS, pages 262-272, 1999.
3. J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509-517, 1975.
4. K. P. Birman. The process group approach to reliable distributed computing. Communications of the ACM, 36(12):36-53, Dec. 1993.
5. A. Carzaniga, D. S. Rosenblum, and A. L. Wolf. Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems, 19(3):332-383, 2001.
6. Y Choi, K. Park, and D. Park. Homed: A peer-to-peer overlay architecture for large-scale content-based publish/subscribe systems. In Proceedings of the third International Workshop on Distributed Event-Based Systems (DEBS), pages 20-25, Edinburgh, Scotland, UK, May 2004.
7. Computer Science and Artificial Intelligence Lab, MIT. p2psim: a simulator for peer-to-peer protocols. http://pdos.csail.mit.edu/p2psim.
8. F. Dabek, J. Li, E. Sit, J. Robertson, M. F. Kaashoek, and R. Morris. Designing a DHT for low latency and high throughput. In Proceeding of the First Symposium on Networked Systems Design and Implementation (NSDI), pages 85-98, San Francisco, CA, Mar. 2004.
9. F. Fabret, H. A. Jacobsen, F. Llirbat, J. Pereira, K. A. Ross, and D. Shasha. Filtering algorithms and implementation for very fast publish/subscribe systems. In Proceedings of the 2001 ACM SIGMOD, volume 30, pages 115-126, Santa Barbara,CA, 2001.
10. K. P. Gummadi, S. Saroiu, and S. D. Gribble. King: Estimating latency between arbitrary internet end hosts. In Proceedings of the 2002 SIGCOMM Internet Measurement Workshop, Marseille, France, Nov. 2002.
11. A. Gupta, O. D. Sahin, D. Agrawal, and A. E. Abbadi. Meghdoot: Content-based publish/subscribe over p2p networks. In ACM/IFIP/USENIX 5th International Middleware Conference, Toronto, Ontario, Canada, Oct. 2004.
12. B. Oki, M. Pfluegl, A. Siegel, and D. Skeen. The information bus: an architecture for extensible distributed systems. In Proceedings of the fourteenth ACM SOSP, pages 58-68, Asheville, NC, Dec. 1993.
13. G. Perng, C. Wang, and M. K. Reiter. Providing content-based services in a peer-to-peer environment. In Proceedings of the third International Workshop on Distributed Event-Based Systems (DEBS), pages 74-79, Edinburgh, Scotland, UK, May 2004.
14. P. R. Pietzuch and J. Bacon. Peer-to-peer overlay broker networks in an event-based middleware. In Proceedings of the Second International Workshop on Distributed Event-Based Systems (DEBS), San Diego, CA, June 2003.
15. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM, pages 161-172, San Diego, CA, Aug. 2001.
16. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM International Conference on Distributed System Platforms (Middleware), pages 329-350, Heidelberg, Germany, Nov. 2001.
17. A. I. T. Rowstron, A.-M. Kermarrec, M. Castro, and P. Druschel. SCRIBE: The design of a large-scale event notification infrastructure. In Proceedings of the 3rd International Networked Group Communication, pages 30-43, 2001.
18. I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of ACM SIGCOMM, pages 149-160, San Diego, CA, Aug. 2001.
19. D.Tam, R. Azimi, and H.-A. Jacobsen. Building content-based publish/subscribe systems with distributed hash tables. In Proceedings of the International Workshop on Databases, Information Systems and Peer-to-Peer Computing, Berlin.Germany, Sept. 2003.
20. W. W. Terpstra, S. Behnel, L. Fiege, A. Zeidler, and A. P. Buchmann. A peer-to-peer approach to content-based publish/subscribe. In Proceedings of the Second International Workshop on Distributed Event-Based Systems (DEBS), San Diego, CA, June 2003.
21. P. Triantafillou and I. Aekaterinidis. Content-based publish-subscribe over structured P2P networks. In Proceedings of the third International Workshop on Distributed Event-Based Systems (DEBS), Edinburgh, Scotland, UK, May 2004.
22. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerance wide-area location and routing. Technical Report UCB/CSD-01-1141, Computer Science Division, U.C. Berkeley, Apr. 2001.
23. S. Q. Zhuang, B. Y Zhao, A. D. Joseph, R. H. Katz, and J. Kubiatowicz. Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In Proceedings of the Eleventh International Workshop on Network and Operating System Support for Digital Audio and Video (NOSS-DAV), June 2001.