Dominating Set Theory Based Semantic Overlay Networks for Efficient Content Distribution

J. Amutharaj, S. Radhakrishnan
{"title":"Dominating Set Theory Based Semantic Overlay Networks for Efficient Content Distribution","authors":"J. Amutharaj, S. Radhakrishnan","doi":"10.1109/ICSCN.2007.350736","DOIUrl":null,"url":null,"abstract":"Overlay networks have emerged as a powerful and highly flexible method of delivering content. An overlay network is a network running on top of another network, usually the Internet. These networks are employed in many settings to provide logical communication infrastructure over an existing communication network. The main objective of the overlay network is to reduce routing path lengths, stretched by the overlay routing process. In most solutions developed, a kind of fixed infrastructure in the form of excessive message exchange is necessary to guarantee good overlay locality properties. This paper presents a richly connected overlay networks based on Dominating Set Theory to optimize the number of nodes for large data transfer. Fast Replica algorithm is applied to reduce the content transfer time for replicating the content within the semantic network. To download a file from different peers in parallel from the semantic overlay network (SON) a dynamic parallel access scheme is introduced where end users access the members of the SON at the same time, fetching different portions of that file from different peers and reassembling them locally. The load is dynamically shared among all the peers. An enhanced digital fountain with Tornado codes is applied to eliminate the need for retransmission requests from the end users. Receivers run the decoding algorithm to reconstruct the original content. In this no feedback mechanisms are needed to ensure reliable delivery. This paper analyzes the performance of sequential unicast and multiple unicast content distribution strategies and compares their performance with our scheme and also analyzes the impact of dominating set theory for the construction of semantic overlays","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"107 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Signal Processing, Communications and Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSCN.2007.350736","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Overlay networks have emerged as a powerful and highly flexible method of delivering content. An overlay network is a network running on top of another network, usually the Internet. These networks are employed in many settings to provide logical communication infrastructure over an existing communication network. The main objective of the overlay network is to reduce routing path lengths, stretched by the overlay routing process. In most solutions developed, a kind of fixed infrastructure in the form of excessive message exchange is necessary to guarantee good overlay locality properties. This paper presents a richly connected overlay networks based on Dominating Set Theory to optimize the number of nodes for large data transfer. Fast Replica algorithm is applied to reduce the content transfer time for replicating the content within the semantic network. To download a file from different peers in parallel from the semantic overlay network (SON) a dynamic parallel access scheme is introduced where end users access the members of the SON at the same time, fetching different portions of that file from different peers and reassembling them locally. The load is dynamically shared among all the peers. An enhanced digital fountain with Tornado codes is applied to eliminate the need for retransmission requests from the end users. Receivers run the decoding algorithm to reconstruct the original content. In this no feedback mechanisms are needed to ensure reliable delivery. This paper analyzes the performance of sequential unicast and multiple unicast content distribution strategies and compares their performance with our scheme and also analyzes the impact of dominating set theory for the construction of semantic overlays
基于支配集理论的高效内容分发语义覆盖网络
覆盖网络已经成为一种强大而高度灵活的内容传递方式。覆盖网络是运行在另一个网络(通常是因特网)之上的网络。这些网络在许多设置中用于在现有通信网络上提供逻辑通信基础设施。覆盖网络的主要目标是减少路由路径长度,这是由覆盖路由过程拉伸的。在大多数已开发的解决方案中,为了保证良好的覆盖局部性,需要一种固定的基础设施(以过度消息交换的形式)。为了优化大数据传输的节点数,提出了一种基于支配集理论的多连通叠加网络。采用快速复制算法对语义网络内的内容进行复制,减少了内容传输时间。为了从语义覆盖网络(SON)上从不同节点并行下载文件,引入了一种动态并行访问方案,即终端用户同时访问SON的成员,从不同节点获取该文件的不同部分并在本地重新组装它们。负载在所有对等体之间动态共享。一个增强的数字喷泉与龙卷风代码被应用,以消除需要从终端用户的重传请求。接收器运行解码算法来重建原始内容。在这种情况下,不需要反馈机制来确保可靠的交付。本文分析了顺序单播和多单播内容分发策略的性能,并与我们的方案进行了性能比较,同时分析了支配集理论对构建语义覆盖的影响
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信