首页> 外文期刊>Journal of interconnection networks >CBF: LOOk-UP PROTOCOL FOR DISTRIBUTED MULTIMEDIA OBJECTS IN PEER-TO-PEER OVERLAY NETWORKS
【24h】

CBF: LOOk-UP PROTOCOL FOR DISTRIBUTED MULTIMEDIA OBJECTS IN PEER-TO-PEER OVERLAY NETWORKS

机译:CBF:点对点重叠网络中分布式多媒体对象的查找协议

获取原文
获取原文并翻译 | 示例
           

摘要

Various types of applications take usage of multimedia objects like music and movies. Multimedia objects are distributed in peer-to-peer (P2P) overlay networks since the objects are downloaded and personalized in computers, mainly personal computers interconnected with the Internet. An application would like to take some service of a target object. A target peer is a peer which can manipulate a target object. First, the application has to find target peers which can support enough quality of service (QoS) of target multimedia objects. Due to the scalability and variety of peers in P2P overlay networks, it is difficult, possibly impossible to maintain a centralized directory showing in which peer each object is distributed. In this paper, we newly take an acquaintance approach where each peer maintains its acquaintance peers. An acquaintance peer of a peer p is a peer whose service the peer p knows and with which the peer p can directly communicate in P2P overlay networks. We discuss types of acquaintance relations of peers with respect to what objects each peer holds, is allowed to manipulate, and can grant access rights on. In addition, we discuss a new type of flooding algorithm named charge-based flooding (CBF) algorithm to find target peers based on charge and acquaintance concepts so that areas in P2P overlay networks where target peers are expected to exist are more deeply searched. We evaluate the charge-based flooding (CBF) algorithm compared with a traditional TTL-based flooding algorithm in terms of the number of messages transmitted in networks.
机译:各种类型的应用程序都使用多媒体对象,例如音乐和电影。多媒体对象是在对等(P2P)覆盖网络中分发的,因为对象是在计算机(主要是与Internet互连的个人计算机)中下载并进行个性化的。应用程序希望为目标对象提供一些服务。目标对等体是可以操纵目标对象的对等体。首先,应用程序必须找到可以支持目标多媒体对象的足够服务质量(QoS)的目标对等方。由于P2P覆盖网络中对等点的可伸缩性和多样性,要维护一个集中的目录以显示每个对象分布在哪个对等点上是困难的,可能是不可能的。在本文中,我们新采用了一种熟人方法,其中每个对等方都维护其熟人对等体。对等体p的熟人对等体是其对等体p知道的服务,并且对等体p可以与之直接在P2P覆盖网络中进行通信。我们讨论关于对等体的熟人关系类型,这些关系涉及每个对等体所持有,允许对其进行操作并可以授予访问权限的对象。此外,我们讨论了一种新型的泛洪算法,称为基于电荷的泛洪(CBF)算法,该算法基于电荷和熟人概念来查找目标对等方,以便对P2P覆盖网络中预期存在目标对等方的区域进行更深入的搜索。与传统的基于TTL的泛洪算法相比,我们在网络中传输的消息数方面评估了基于电荷的泛洪(CBF)算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号