点对点覆盖网络中基于熟人的多媒体对象检测协议

Kenichi Watanabe, T. Enokido, M. Takizawa, K. H. Kim
{"title":"点对点覆盖网络中基于熟人的多媒体对象检测协议","authors":"Kenichi Watanabe, T. Enokido, M. Takizawa, K. H. Kim","doi":"10.1109/ISORC.2005.6","DOIUrl":null,"url":null,"abstract":"Multimedia objects are distributed on peer computers (peers) in peer-to-peer (P2P) overlay networks. An application has to find target peers which can support enough quality of service (QoS) of multimedia objects. We discuss types of acquaintance relations of peers with respect to what objects each peer holds, can manipulate, and can grant access rights. We discuss a new type of flooding algorithm to find target peers based on charge and acquaintance concepts so that areas in networks where target peers are expected to exist are more deeply searched. We evaluate the charge-based flooding algorithm compared with a TTL-based flooding algorithm in terms of the number of messages transmitted in networks.","PeriodicalId":377002,"journal":{"name":"Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05)","volume":"429 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Acquaintance-based protocol for detecting multimedia objects in peer-to-peer overlay networks\",\"authors\":\"Kenichi Watanabe, T. Enokido, M. Takizawa, K. H. Kim\",\"doi\":\"10.1109/ISORC.2005.6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multimedia objects are distributed on peer computers (peers) in peer-to-peer (P2P) overlay networks. An application has to find target peers which can support enough quality of service (QoS) of multimedia objects. We discuss types of acquaintance relations of peers with respect to what objects each peer holds, can manipulate, and can grant access rights. We discuss a new type of flooding algorithm to find target peers based on charge and acquaintance concepts so that areas in networks where target peers are expected to exist are more deeply searched. We evaluate the charge-based flooding algorithm compared with a TTL-based flooding algorithm in terms of the number of messages transmitted in networks.\",\"PeriodicalId\":377002,\"journal\":{\"name\":\"Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05)\",\"volume\":\"429 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISORC.2005.6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISORC.2005.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

多媒体对象分布在对等计算机(peer -to-peer, P2P)覆盖网络中。应用程序必须找到能够支持足够多媒体对象服务质量(QoS)的目标对等体。我们讨论了对等体的熟人关系类型,这些关系涉及到每个对等体持有、可以操纵和可以授予访问权限的对象。本文讨论了一种基于电荷和熟人概念的新型泛洪算法来寻找目标节点,从而对网络中预期目标节点存在的区域进行更深入的搜索。根据网络中传输的消息数量,我们将基于收费的泛洪算法与基于ttl的泛洪算法进行比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Acquaintance-based protocol for detecting multimedia objects in peer-to-peer overlay networks
Multimedia objects are distributed on peer computers (peers) in peer-to-peer (P2P) overlay networks. An application has to find target peers which can support enough quality of service (QoS) of multimedia objects. We discuss types of acquaintance relations of peers with respect to what objects each peer holds, can manipulate, and can grant access rights. We discuss a new type of flooding algorithm to find target peers based on charge and acquaintance concepts so that areas in networks where target peers are expected to exist are more deeply searched. We evaluate the charge-based flooding algorithm compared with a TTL-based flooding algorithm in terms of the number of messages transmitted in networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信