Analyzer for Heterogeneous Peer Server Nodes with ADCD Technique for Load Diversion

V. Prakash, V. J, Shiva Kumar B. N, Shriidhar P J
{"title":"Analyzer for Heterogeneous Peer Server Nodes with ADCD Technique for Load Diversion","authors":"V. Prakash, V. J, Shiva Kumar B. N, Shriidhar P J","doi":"10.1109/C2I456876.2022.10051393","DOIUrl":null,"url":null,"abstract":"Peer-to-peer distributed computer architecture are taken into consideration in order to distribute computer assets like storage, comfortable, and CPU cycles openly deprived of consuming a middle scheme or a central server. It can be difficult to Upkeep of load balancing on diverse peer-to-peer networks, and various previous research have provided state balancing algorithms for the demand aspect of load balance. For effective load balancing in dispersed heterogeneous peer networks, the prior work developed Processing Heterogeneous Data using Time - Peer Nodes. Using the Dynamic Time Warping (DTW) technique, load-demand balancing factors for peer servers are determined to a certain degree. The prior work solely discussed the peer node's liveliness in the heterogeneous network. In this work, we will provide the subsequent load-demand element generated as of DTW, peer server giving out cycle requirements are recognized utilizing Appropriation of Duty Cycle Data(ADCD) Technique in order to improve the previous study. In its active state, peer node servers examine their processing cycle needs and distribute data to other nodes in accordance with their duty cycles. If there is a load imbalance, peer node servers are used to distribute the load using a node collection policy created on ADCD abundant demonstration? Performance of the proposed Diverse cycle of a peer node server analyzer with an existing time variant utilizing DCPS-ADCD & NSS and the ADCD approach Using data from diverse peer networks that have been taken from major internet service providers, a P2P network that uses the Dynamic Time Warping algorithm is experimentally assessed. The efficiency is calculated based on the duty cycle count, energy usage, and load.","PeriodicalId":165055,"journal":{"name":"2022 3rd International Conference on Communication, Computing and Industry 4.0 (C2I4)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 3rd International Conference on Communication, Computing and Industry 4.0 (C2I4)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/C2I456876.2022.10051393","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Peer-to-peer distributed computer architecture are taken into consideration in order to distribute computer assets like storage, comfortable, and CPU cycles openly deprived of consuming a middle scheme or a central server. It can be difficult to Upkeep of load balancing on diverse peer-to-peer networks, and various previous research have provided state balancing algorithms for the demand aspect of load balance. For effective load balancing in dispersed heterogeneous peer networks, the prior work developed Processing Heterogeneous Data using Time - Peer Nodes. Using the Dynamic Time Warping (DTW) technique, load-demand balancing factors for peer servers are determined to a certain degree. The prior work solely discussed the peer node's liveliness in the heterogeneous network. In this work, we will provide the subsequent load-demand element generated as of DTW, peer server giving out cycle requirements are recognized utilizing Appropriation of Duty Cycle Data(ADCD) Technique in order to improve the previous study. In its active state, peer node servers examine their processing cycle needs and distribute data to other nodes in accordance with their duty cycles. If there is a load imbalance, peer node servers are used to distribute the load using a node collection policy created on ADCD abundant demonstration? Performance of the proposed Diverse cycle of a peer node server analyzer with an existing time variant utilizing DCPS-ADCD & NSS and the ADCD approach Using data from diverse peer networks that have been taken from major internet service providers, a P2P network that uses the Dynamic Time Warping algorithm is experimentally assessed. The efficiency is calculated based on the duty cycle count, energy usage, and load.
负载分流ADCD技术的异构对等服务器节点分析仪
考虑点对点分布式计算机体系结构是为了公开分配计算机资产,如存储、舒适和CPU周期,而不需要使用中间方案或中央服务器。在不同的点对点网络中,负载均衡的维护是很困难的,以往的各种研究都为负载均衡的需求方面提供了状态平衡算法。为了在分散的异构对等网络中实现有效的负载均衡,前人的工作开发了使用时间对等节点处理异构数据。利用动态时间翘曲(DTW)技术,在一定程度上确定了对等服务器的负载需求平衡因素。以往的工作只讨论了异构网络中对等节点的活动性。在这项工作中,我们将提供DTW产生的后续负载需求元素,利用占用占空比数据(ADCD)技术识别给出周期需求的对等服务器,以改进先前的研究。在其活动状态下,对等节点服务器检查其处理周期需求,并根据其工作周期将数据分发给其他节点。如果存在负载不均衡,则通过在ADCD上创建节点收集策略,使用对等节点服务器来分配负载。利用DCPS-ADCD和NSS以及ADCD方法,利用来自主要互联网服务提供商的不同对等网络的数据,对使用动态时间扭曲算法的P2P网络进行了实验评估。效率是根据占空比、能耗和负载来计算的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信