首页> 外文OA文献 >A hypercubic overlay using bloom-Filter based addressing for a non-dedicated distributed tag-Based pub/Sub system
【2h】

A hypercubic overlay using bloom-Filter based addressing for a non-dedicated distributed tag-Based pub/Sub system

机译:使用基于bloom-Filter的寻址的超三次叠加,用于基于非专用分布式标签的发布/订阅系统

摘要

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技术的迅猛发展,以及社交网络的发展,已经提出了一种新的Internet信息交换范例,其中涉及的每个个人用户都可以随时随地发布信息,同时还可以过滤并有选择地接收任何信息。及时了解他们感兴趣的信息。为促进此过程,允许用户使用一个或多个关键字(即标签)标记其发布的内容,并提交由标记连词表示的兴趣。内容将分派给其兴趣与内容标签匹配的用户。通过简单地进行发布/订阅,发布-订阅通信范例通过在各方之间提供松散耦合且面向内容的通信而非常适合此场景。迄今为止,基于标签的pub / sub的现有实现主要基于轮询,这要求客户端以基于请求的方式不断向服务器查询更新。因此,在通讯双方之间进行解耦的pub / sub本质无法得到充分利用。建立在基于主题和基于内容的发布/订阅系统上的研究指出了采用完全分布式基于推送的体系结构的正确方向。尤其是,基于键的路由(KBR)覆盖的方法支持具有动态拓扑更改的消息的大规模分发,对于非分布式环境而言,这种方法非常可取。但是,有关基于KBR的方法的现有工作依赖于基础匹配方案中的静态类别/主题或固定的过滤器尺寸,这使其不适用于需要支持可变过滤器匹配的基于标签的系统。这激励我们找到一种在基于标签的发布/订阅系统中利用KBR的方法。在这项研究中,我们采用整体方法来处理匹配和路由,并为基于标签的发布/子系统提出了可扩展且健壮的超立方发布-发布覆盖基础结构。通过这种方法,我们提供了一个健壮而高效的多层非专用分布式pub / sub体系结构,该体系结构符合大型Internet应用程序的异构性和可伸缩性要求。

著录项

  • 作者

    Yu X; Chan ATS;

  • 作者单位
  • 年度 2013
  • 总页数
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号