M-Ring: A Distributed, Self-Organized, Load-Balanced Communication Method on Super Peer Network

Tsung-Han Lin, Tsung-Hsuan Ho, Yu-Wei Chan, Yeh-Ching Chung
{"title":"M-Ring: A Distributed, Self-Organized, Load-Balanced Communication Method on Super Peer Network","authors":"Tsung-Han Lin, Tsung-Hsuan Ho, Yu-Wei Chan, Yeh-Ching Chung","doi":"10.1109/I-SPAN.2008.30","DOIUrl":null,"url":null,"abstract":"Many peer-to-peer file sharing systems have been proposed to take the locality and heterogeneity into account. The two-layered architecture is one of the most widespread systems with abilities by classifying peers into groups and serving some powerful peers as the super peers. In order to communicate with other sets of super peers, each super peer has to connect with all the other super peers within its neighboring group or other groups by some gateway-like super peers. However, it may be the problem of the single-point-of-failure if using peers as the gateway-like peers. In this paper, we propose a distributed, self-organized and load-balanced communication method - M-Ring. In this method, each super peer connects with other sets of super peers within its neighboring group by constructing its link table. Also, each super peer in the different groups has a unique identity within the same identity space. Besides, we notice a \"overlap handle scope\" feature while all super peers who are in the different groups are in the same identity space. We use this feature to enhance the efficiency of query of super peers. Our method can reduce the total requirements of storage space and bandwidth by storing different portion of metadata. The simulation results show that our approach efficiently reduces the overhead of connections among super peers within their neighboring groups.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/I-SPAN.2008.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Many peer-to-peer file sharing systems have been proposed to take the locality and heterogeneity into account. The two-layered architecture is one of the most widespread systems with abilities by classifying peers into groups and serving some powerful peers as the super peers. In order to communicate with other sets of super peers, each super peer has to connect with all the other super peers within its neighboring group or other groups by some gateway-like super peers. However, it may be the problem of the single-point-of-failure if using peers as the gateway-like peers. In this paper, we propose a distributed, self-organized and load-balanced communication method - M-Ring. In this method, each super peer connects with other sets of super peers within its neighboring group by constructing its link table. Also, each super peer in the different groups has a unique identity within the same identity space. Besides, we notice a "overlap handle scope" feature while all super peers who are in the different groups are in the same identity space. We use this feature to enhance the efficiency of query of super peers. Our method can reduce the total requirements of storage space and bandwidth by storing different portion of metadata. The simulation results show that our approach efficiently reduces the overhead of connections among super peers within their neighboring groups.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
m -环:一种分布式、自组织、负载均衡的超级对等网络通信方法
许多点对点文件共享系统都考虑到了局部性和异构性。双层体系结构是一种最广泛的具有能力的体系结构,它通过将节点分组,并将一些有能力的节点作为超级节点来服务。为了与其他超级对等体进行通信,每个超级对等体必须通过一些类似网关的超级对等体与相邻组或其他组中的所有其他超级对等体连接。但是,如果使用对等点作为类网关对等点,则可能出现单点故障问题。本文提出了一种分布式、自组织、负载均衡的通信方法——m环。在这种方法中,每个超级对等体通过构造自己的链接表与相邻组内的其他超级对等体集建立连接。此外,不同组中的每个超级对等体在同一身份空间中具有唯一的身份。此外,我们注意到在不同组中的所有超级对等体都在相同的身份空间中时存在“重叠句柄范围”特征。我们利用这一特性来提高超级节点的查询效率。该方法通过存储元数据的不同部分,减少了对存储空间和带宽的总需求。仿真结果表明,该方法有效地降低了相邻组内超级对等体之间的连接开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Novel Congestion Control Scheme in Network-on-Chip Based on Best Effort Delay-Sum Optimization Memory and Thread Placement Effects as a Function of Cache Usage: A Study of the Gaussian Chemistry Code on the SunFire X4600 M2 Quantitative Evaluation of Common Subexpression Elimination on Queue Machines Bio-inspired Algorithms for Mobility Management On Non-Approximability of Coarse-Grained Workflow Grid Scheduling
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1