Software Defined Underlay-aware Structured Peer-to-Peer Overlay

N. Shukla, Anurag Bamal, S. Srivastava, M. Pandey
{"title":"Software Defined Underlay-aware Structured Peer-to-Peer Overlay","authors":"N. Shukla, Anurag Bamal, S. Srivastava, M. Pandey","doi":"10.1145/3154273.3154310","DOIUrl":null,"url":null,"abstract":"Structured Peer-to-Peer (P2P) overlay networks based on Distributed Hash Table (DHT) provide self-organization and fault tolerance along with good look-up efficiency. This makes them a perfect alternative for designing distributed applications where participating entities (peers) leave or join the system dynamically. However due to continuous churn of peers, periodic maintenance of overlay structure is required resulting in large amount of network traffic. This issue becomes more critical when logical overlay topology is different from actual physical network topology which is a common phenomenon in P2P overlay networks. In this paper, we present a novel approach of designing DHT based P2P overlays using Software Defined Networks (SDN) paradigm. SDN provides flexible ways to tune the policies and rules of underlying physical network dynamically according to the application. In our approach, we have used SDN concepts to bring the overlay topology closer to actual physical topology with an aim to reduce the maintenance traffic. We have implemented an improved SDN based DHT on a smaller scale as proof of concept. The experimental results suggest and establish the applicability of our approach.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 19th International Conference on Distributed Computing and Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3154273.3154310","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Structured Peer-to-Peer (P2P) overlay networks based on Distributed Hash Table (DHT) provide self-organization and fault tolerance along with good look-up efficiency. This makes them a perfect alternative for designing distributed applications where participating entities (peers) leave or join the system dynamically. However due to continuous churn of peers, periodic maintenance of overlay structure is required resulting in large amount of network traffic. This issue becomes more critical when logical overlay topology is different from actual physical network topology which is a common phenomenon in P2P overlay networks. In this paper, we present a novel approach of designing DHT based P2P overlays using Software Defined Networks (SDN) paradigm. SDN provides flexible ways to tune the policies and rules of underlying physical network dynamically according to the application. In our approach, we have used SDN concepts to bring the overlay topology closer to actual physical topology with an aim to reduce the maintenance traffic. We have implemented an improved SDN based DHT on a smaller scale as proof of concept. The experimental results suggest and establish the applicability of our approach.
软件定义的感知底层的结构化点对点覆盖
基于分布式哈希表(DHT)的结构化点对点(P2P)覆盖网络具有自组织和容错性以及良好的查找效率。这使得它们成为设计分布式应用程序的完美选择,在分布式应用程序中,参与实体(对等体)动态地离开或加入系统。但由于对等体的不断流失,需要对覆盖结构进行定期维护,导致网络流量巨大。当逻辑叠加拓扑与实际网络物理拓扑不一致时,这一问题就显得尤为关键,这是P2P叠加网络中常见的现象。在本文中,我们提出了一种使用软件定义网络(SDN)范式设计基于DHT的P2P覆盖的新方法。SDN提供了灵活的方法,可以根据应用动态地调整底层物理网络的策略和规则。在我们的方法中,我们使用SDN概念使覆盖拓扑更接近实际物理拓扑,目的是减少维护流量。我们已经在较小的规模上实现了基于DHT的改进SDN作为概念验证。实验结果表明了该方法的适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信