GSON:一种基于分组的分层结构覆盖网络

Rui Wang, Qinglin Zhu, D. Qian, Danfeng Zhu
{"title":"GSON:一种基于分组的分层结构覆盖网络","authors":"Rui Wang, Qinglin Zhu, D. Qian, Danfeng Zhu","doi":"10.1109/FTDCS.2008.10","DOIUrl":null,"url":null,"abstract":"In a structured peer-to-peer (P2P) overlay network, the stability of the entire network will be greatly affected by simultaneous join-in and drop-out of large amount of nodes. Aiming at reducing the overhead of handling this activity, we propose a group-based hierarchically structured overlay network, GSON. GSON is also a structured P2P overlay network using distributed hash table (DHT). In GSON, nodes that are physically close to each other or under a common administrative control form a group by using a self-organizing protocol. Each group has a delegate to join the DHT on behalf of other nodes in the group. The information about the resource and membership is shared within the group. The delegate is responsible for passing information to all group members and publishing group resource to other groups. The resource of each group is mapped into the DHT. Simulation results show that GSON is more scalable, and can reach stable state more quickly than normal chord system under the circumstances that a large number of nodes joining and quitting the system simultaneously.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"GSON: A Group Based Hierarchically Structured Overlay Network\",\"authors\":\"Rui Wang, Qinglin Zhu, D. Qian, Danfeng Zhu\",\"doi\":\"10.1109/FTDCS.2008.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a structured peer-to-peer (P2P) overlay network, the stability of the entire network will be greatly affected by simultaneous join-in and drop-out of large amount of nodes. Aiming at reducing the overhead of handling this activity, we propose a group-based hierarchically structured overlay network, GSON. GSON is also a structured P2P overlay network using distributed hash table (DHT). In GSON, nodes that are physically close to each other or under a common administrative control form a group by using a self-organizing protocol. Each group has a delegate to join the DHT on behalf of other nodes in the group. The information about the resource and membership is shared within the group. The delegate is responsible for passing information to all group members and publishing group resource to other groups. The resource of each group is mapped into the DHT. Simulation results show that GSON is more scalable, and can reach stable state more quickly than normal chord system under the circumstances that a large number of nodes joining and quitting the system simultaneously.\",\"PeriodicalId\":414800,\"journal\":{\"name\":\"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTDCS.2008.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTDCS.2008.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在结构化的P2P (peer-to-peer)覆盖网络中,大量节点的同时加入和退出将极大地影响整个网络的稳定性。为了减少处理该活动的开销,我们提出了一种基于分组的分层结构覆盖网络GSON。GSON也是一个使用分布式哈希表(DHT)的结构化P2P覆盖网络。在GSON中,物理上彼此接近或在公共管理控制下的节点通过使用自组织协议组成一个组。每个组都有一个代表组中其他节点加入DHT的委托。关于资源和成员的信息在组内共享。委托负责向所有组成员传递信息,并向其他组发布组资源。将每个组的资源映射到DHT中。仿真结果表明,在大量节点同时加入和退出系统的情况下,GSON具有更强的可扩展性,比普通和弦系统更快地达到稳定状态。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
GSON: A Group Based Hierarchically Structured Overlay Network
In a structured peer-to-peer (P2P) overlay network, the stability of the entire network will be greatly affected by simultaneous join-in and drop-out of large amount of nodes. Aiming at reducing the overhead of handling this activity, we propose a group-based hierarchically structured overlay network, GSON. GSON is also a structured P2P overlay network using distributed hash table (DHT). In GSON, nodes that are physically close to each other or under a common administrative control form a group by using a self-organizing protocol. Each group has a delegate to join the DHT on behalf of other nodes in the group. The information about the resource and membership is shared within the group. The delegate is responsible for passing information to all group members and publishing group resource to other groups. The resource of each group is mapped into the DHT. Simulation results show that GSON is more scalable, and can reach stable state more quickly than normal chord system under the circumstances that a large number of nodes joining and quitting the system simultaneously.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信