首页> 外文会议>IEEE International Conference on Trust, Security and Privacy in Computing and Communications >A Hypercubic Overlay Using Bloom-Filter Based Addressing for a Non-dedicated Distributed Tag-Based Pub/Sub System
【24h】

A Hypercubic Overlay Using Bloom-Filter Based Addressing for a Non-dedicated Distributed Tag-Based Pub/Sub System

机译:使用基于Bloom-滤波器的寻址的超电平覆盖用于基于非专用分布式标签的PUB /子系统的寻址

获取原文

摘要

The proliferation of Web 2.0 technology, coupled with the advancements in social networking, have unraveled a new Internet information exchanging paradigm where every individual user involved is capable of publishing information at will and at any time, while also being able to filter and selectively receive any information they are interested in a timely manner. To facilitate this process, users are allowed to tag their published content with one or more keywords (namely tags), and submit their interests represented by a conjunction of tags. The content will be dispatched to users whose interests matching the content's tags. Publish-Subscribe, in short Pub/sub, communication paradigm suits perfectly for this scenario, by providing loosely coupled and content-oriented communication among parties. To date, existing implementations of tag-based pub/sub are mostly based on polling, which requires the client to constantly query the server for the update in a pull-based manner. Thus the essence of pub/sub, which exercises decoupling between communication parties, could not be fully exploited. Established researches on topic-based and content-based pub/sub system point to the right direction of adopting fully distributed push-based architecture. Especially, the Key-based Routing (KBR) overlay-based approach, which supports a large-scale dissemination of messages with dynamic topology changes, is highly preferable for a non-distributed environment. However existing works on KBR based approach relies on static categories/topics or fixed filter dimensions in the underlying matching schemes, which make them unsuitable for tag-based systems that require support of variable filter matching. This motivates us to find a way to utilize KBR in a tag-based pub/sub system. In this research, we adopt a holistic approach of treating matching and routing as a whole and proposed a scalable and robust hypercubic Publication-Dissemination overlay infrastructure for tag-based pub/sub syst- m. With this approach, we provide a robust yet efficient multilayer non-dedicated distributed pub/sub architecture, which comply with the heterogeneity and scalability requirement of large-scale Internet applications.
机译:Web 2.0技术的增殖与社交网络的进步相结合,已经解开了一种新的互联网信息交换范式,其中所涉及的每个个人用户能够在任何时间发布信息,同时也能够过滤并选择性地接收任何他们及时感兴趣的信息。为了促进此过程,允许用户使用一个或多个关键字(即标签)标记其发布的内容,并提交由标签的结合表示的兴趣。内容将被调入其符合内容标签的利益的用户。通过在各方之间提供松散耦合和面向内容的通信,在短PUB / Sub,通信范式适用于这种情况。迄今为止,基于标签的PUB / sub的现有实现主要基于轮询,这要求客户端以基于拉动方式不断地查询更新的服务器。因此,PUB / SUB的本质,在沟通方之间练习练习,无法充分利用。建立了基于主题和基于内容的PUB / SUB系统指向完全分布式推送架构的正确方向的研究。特别是,基于关键的路由(KBR)基于覆盖的方法,它支持具有动态拓扑的消息的大规模传播,对于非分布式环境非常优选。然而,基于KBR的方法的现有工作依赖于底层匹配方案中的静态类别/主题或固定滤波器尺寸,这使得它们不适合需要支持可变过滤器匹配的基于标签的系统。这使我们能够找到一种方法来利用基于标签的PUB / Sub系统中的KBR。在这项研究中,我们采用整体处理匹配和路由的整体方法,并提出了一种可扩展且坚固的超电平出版物传播覆盖基础设施,用于标签的PUB / SUB SYST-M。通过这种方法,我们提供了一个强大而有效的多层非专用分布式PUB /子架构,其符合大规模互联网应用的异质性和可扩展性要求。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号