NRIT: Non-redundant indirect trust search algorithm for a cross-domain based CDNi-P2P architecture

Shi Li, Inshil Doh, K. Chae
{"title":"NRIT: Non-redundant indirect trust search algorithm for a cross-domain based CDNi-P2P architecture","authors":"Shi Li, Inshil Doh, K. Chae","doi":"10.23919/ICACT.2018.8323919","DOIUrl":null,"url":null,"abstract":"A content delivery network (CDN), as a distributed network architecture, enhances efficient delivery of content. The interconnection of different CDNs (CDNi) further improves efficiency and the experience of end users. As another distributed network with high availability and high performance, a peer-to-peer (P2P) network can provide efficient resource sharing. To combine the advantages of the two networks, we propose a hybrid CDNi-P2P architecture, along with trust management models to achieve more efficient content delivery. In CDNi-P2P architecture, end users can obtain the requested content from the nearest CDN edge server, and can also share these contents with other users in the same domain as a P2P network. After the transactions, users can rate each other based on the reputation evaluation method adopted in the system. For some mobile users, they can move among different domains and share the contents who have with the end users in different system. In general, different systems adopt different reputation evaluation standards. This leads to disparate trust values for mobile users in different systems. Based on the architecture, we propose two trust models to solve this problem: a local trust model and a cross-domain trust model. To evaluate reputation more effectively and accurately, we also propose a search algorithm for the trust model called the non-redundant indirect trust search algorithm (NRIT-SA). Using the proposed trust models, a mobile user can transform his/her local trust into mobile trust in a new domain. We thus avoid disparate trust values for a single user in different domains and improve the availability of the content possessed by mobile users as they move among different domains. The result of the performance analysis shows that when there is a high connectivity degree of users in the system, the calculation time of the proposed NRIT-SA tends to be stable. And depending on the comparison result with the full search algorithm, NRIT-SA shows more efficient calculation performance and more reliable result.","PeriodicalId":228625,"journal":{"name":"2018 20th International Conference on Advanced Communication Technology (ICACT)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 20th International Conference on Advanced Communication Technology (ICACT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ICACT.2018.8323919","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A content delivery network (CDN), as a distributed network architecture, enhances efficient delivery of content. The interconnection of different CDNs (CDNi) further improves efficiency and the experience of end users. As another distributed network with high availability and high performance, a peer-to-peer (P2P) network can provide efficient resource sharing. To combine the advantages of the two networks, we propose a hybrid CDNi-P2P architecture, along with trust management models to achieve more efficient content delivery. In CDNi-P2P architecture, end users can obtain the requested content from the nearest CDN edge server, and can also share these contents with other users in the same domain as a P2P network. After the transactions, users can rate each other based on the reputation evaluation method adopted in the system. For some mobile users, they can move among different domains and share the contents who have with the end users in different system. In general, different systems adopt different reputation evaluation standards. This leads to disparate trust values for mobile users in different systems. Based on the architecture, we propose two trust models to solve this problem: a local trust model and a cross-domain trust model. To evaluate reputation more effectively and accurately, we also propose a search algorithm for the trust model called the non-redundant indirect trust search algorithm (NRIT-SA). Using the proposed trust models, a mobile user can transform his/her local trust into mobile trust in a new domain. We thus avoid disparate trust values for a single user in different domains and improve the availability of the content possessed by mobile users as they move among different domains. The result of the performance analysis shows that when there is a high connectivity degree of users in the system, the calculation time of the proposed NRIT-SA tends to be stable. And depending on the comparison result with the full search algorithm, NRIT-SA shows more efficient calculation performance and more reliable result.
基于跨域CDNi-P2P架构的非冗余间接信任搜索算法
内容分发网络(CDN)作为一种分布式网络架构,可以提高内容的分发效率。不同cdn (CDNi)的互联进一步提高了效率和终端用户的体验。P2P (peer-to-peer)网络作为另一种高可用性、高性能的分布式网络,能够提供高效的资源共享。为了结合两种网络的优势,我们提出了一种混合cdi - p2p架构,以及信任管理模型,以实现更有效的内容交付。在CDN -P2P架构中,终端用户可以从最近的CDN边缘服务器获取请求的内容,也可以与P2P网络同一域的其他用户共享这些内容。交易完成后,用户可以根据系统中采用的信誉评价方法对彼此进行评分。对于一些移动用户,他们可以在不同的域之间移动,并与不同系统的最终用户共享所拥有的内容。一般来说,不同的系统采用不同的信誉评价标准。这导致了不同系统中移动用户的不同信任值。在此基础上,提出了本地信任模型和跨域信任模型来解决这一问题。为了更有效和准确地评估信誉,我们还提出了一种用于信任模型的搜索算法,称为非冗余间接信任搜索算法(nritsa)。利用所提出的信任模型,移动用户可以将其本地信任转换为新域中的移动信任。因此,我们避免了不同域中单个用户的不同信任值,并提高了移动用户在不同域之间移动时所拥有的内容的可用性。性能分析结果表明,当系统中用户连接程度较高时,所提nit - sa的计算时间趋于稳定。通过与全搜索算法的比较,nritsa的计算效率更高,结果更可靠。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信