Wireless sensor networks (WSNs) have emerged as a one of the most fascinating areas of lookup in the past few years principally due to its massive quantity of workable applications. However limited energy, node deployment strategy, routing techniques has considerable impact on the overall performance of network. This paper proposes sustainable honey bee ratel based hybrid wireless sensor network (SHHWSN) layering framework for improving load balancing and scalability issues in network. In SHHWSN tessellated hexagonal shape clusters are formed to cover entire geographical region without any gaps. Hybrid routing schema constrained with redundant data identification policy used in this, seeks to optimize energy utilization. The proposed SHHWSN was evaluated and validated by simulation, and the results were compared with earlier schematics where mostly one sided stochastic node deployments were followed. The experimental results show that SHHWSN has superior performance in terms of network alive nodes, delay, energy and throughput. The proposed SHHWSN obtained values of 50 nodes is 3, 0.061, 0.14, 0.89, 100 nodes is 3,0.037, 0.19, 0.551, 150 nodes is 13, 0.081, 0.23, 0.415, and 200 nodes is 23, 1.01, 0.25, 0.356, which is significantly more effective than current techniques.
{"title":"Multitier scalable clustering wireless network design approach using honey bee ratel optimization","authors":"Amruta Amune, Himangi Pande","doi":"10.3233/jhs-230086","DOIUrl":"https://doi.org/10.3233/jhs-230086","url":null,"abstract":"Wireless sensor networks (WSNs) have emerged as a one of the most fascinating areas of lookup in the past few years principally due to its massive quantity of workable applications. However limited energy, node deployment strategy, routing techniques has considerable impact on the overall performance of network. This paper proposes sustainable honey bee ratel based hybrid wireless sensor network (SHHWSN) layering framework for improving load balancing and scalability issues in network. In SHHWSN tessellated hexagonal shape clusters are formed to cover entire geographical region without any gaps. Hybrid routing schema constrained with redundant data identification policy used in this, seeks to optimize energy utilization. The proposed SHHWSN was evaluated and validated by simulation, and the results were compared with earlier schematics where mostly one sided stochastic node deployments were followed. The experimental results show that SHHWSN has superior performance in terms of network alive nodes, delay, energy and throughput. The proposed SHHWSN obtained values of 50 nodes is 3, 0.061, 0.14, 0.89, 100 nodes is 3,0.037, 0.19, 0.551, 150 nodes is 13, 0.081, 0.23, 0.415, and 200 nodes is 23, 1.01, 0.25, 0.356, which is significantly more effective than current techniques.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"34 7","pages":""},"PeriodicalIF":0.9,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139389733","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Massive MIMO (M-MIMO) devices are the key tool to meet the performance stards established for 5G-wireless communication. However, more Radio Frequency (RF) chains needed in base station (BS) with a huge count of transmitting antennas, involve expensive hardware and computing complexities. In order to decrease the RF chains needed in BS, this work intended to use the optimal transmit antenna selection (TAS) strategy. This strategy is gaining a lot of interest since the optimization algorithm aids in the ability to enhance the system performance considerably the efficiency and secrecy rate. This work proposes a novel Coati Adopted Pelican Optimization (CA-PO) for choosing the optimal TA by considering efficiency as well as secrecy rate. In addition, the CA-PO algorithm makes the decision on which antenna to be elected. At last, the supremacy of CA-PO-based TAS is proven from the analysis regarding secrecy rate and EE analysis. Accordingly, the proposed CA-PO method for MF for set up 2 has attained a higher EE of 0.976; whereas, the DMOA, COA, MRFO, POA and BEA techniques have got a relatively lower EE of 0.968.
{"title":"Transmit antenna selection in M-MIMO system using metaheuristic aided model","authors":"Charanjeet Singh, Pawan Kumar Singh","doi":"10.3233/jhs-230087","DOIUrl":"https://doi.org/10.3233/jhs-230087","url":null,"abstract":"Massive MIMO (M-MIMO) devices are the key tool to meet the performance stards established for 5G-wireless communication. However, more Radio Frequency (RF) chains needed in base station (BS) with a huge count of transmitting antennas, involve expensive hardware and computing complexities. In order to decrease the RF chains needed in BS, this work intended to use the optimal transmit antenna selection (TAS) strategy. This strategy is gaining a lot of interest since the optimization algorithm aids in the ability to enhance the system performance considerably the efficiency and secrecy rate. This work proposes a novel Coati Adopted Pelican Optimization (CA-PO) for choosing the optimal TA by considering efficiency as well as secrecy rate. In addition, the CA-PO algorithm makes the decision on which antenna to be elected. At last, the supremacy of CA-PO-based TAS is proven from the analysis regarding secrecy rate and EE analysis. Accordingly, the proposed CA-PO method for MF for set up 2 has attained a higher EE of 0.976; whereas, the DMOA, COA, MRFO, POA and BEA techniques have got a relatively lower EE of 0.968.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"54 26","pages":""},"PeriodicalIF":0.9,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139390006","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In recent years, the human-to-human and human-to-things relationships are becoming complicated and unreliable, which makes harder decisions in a variety of situations. As a result, trust computing is gaining interest in a number of research fields. The Logical Trust (LT) is one of trust computing concepts. In this paper, we design a Fuzzy-based System for Decision of Logical Trust (FSDLT). We implement two models: FSDLTM1 and FSDLTM2. The FSDLTM1 considers three input parameters: Belief (Be), Experience (Ep), Rationality (Ra) and the output parameter is LT. In FSDLTM2, we consider Reliability (Re) as a new parameter. We evaluated the implemented models by computer simulations. The simulation results show that when Be, Ep, Ra and Re are increasing, the LT is increased. For FSDLTM1, when Ep value is 0.9, all LT values are greater than 0.5. While for FSDLTM2, in case when Be is 0.9, for all values of Ra and Re, when Ep is 0.5 and 0.9, all LT values are higher than 0.5. This shows that the person or device is trustworthy. The FSDLTM2 is more complex than FSALTM1 but it makes a better decision for LT by considering four input parameters.
近年来，人与人之间、人与物之间的关系变得越来越复杂和不可靠，这使得在各种情况下做出决策变得更加困难。因此，信任计算越来越受到一些研究领域的关注。逻辑信任（LT）是信任计算概念之一。在本文中，我们设计了一个基于模糊的逻辑信任决策系统（FSDLT）。我们实现了两个模型：FSDLTM1 和 FSDLTM2。FSDLTM1 考虑了三个输入参数：信念（Be）、经验（Ep）和理性（Ra），输出参数为 LT。在 FSDLTM2 中，我们将可靠性 (Re) 作为一个新参数。我们通过计算机模拟对所实施的模型进行了评估。模拟结果表明，当 Be、Ep、Ra 和 Re 增加时，LT 也随之增加。对于 FSDLTM1，当 Ep 值为 0.9 时，所有 LT 值都大于 0.5。而对于 FSDLTM2，当 Be 值为 0.9 时，对于所有 Ra 值和 Re 值，当 Ep 值为 0.5 和 0.9 时，所有 LT 值都大于 0.5。这表明个人或设备是可信的。FSDLTM2 比 FSALTM1 更为复杂，但它通过考虑四个输入参数对 LT 做出了更好的决策。
{"title":"A comparison study of two implemented fuzzy-based models for decision of logical trust","authors":"Shunya Higashi, Phudit Ampririt, Ermioni Qafzezi, Makoto Ikeda, Keita Matsuo, L. Barolli","doi":"10.3233/jhs-230189","DOIUrl":"https://doi.org/10.3233/jhs-230189","url":null,"abstract":"In recent years, the human-to-human and human-to-things relationships are becoming complicated and unreliable, which makes harder decisions in a variety of situations. As a result, trust computing is gaining interest in a number of research fields. The Logical Trust (LT) is one of trust computing concepts. In this paper, we design a Fuzzy-based System for Decision of Logical Trust (FSDLT). We implement two models: FSDLTM1 and FSDLTM2. The FSDLTM1 considers three input parameters: Belief (Be), Experience (Ep), Rationality (Ra) and the output parameter is LT. In FSDLTM2, we consider Reliability (Re) as a new parameter. We evaluated the implemented models by computer simulations. The simulation results show that when Be, Ep, Ra and Re are increasing, the LT is increased. For FSDLTM1, when Ep value is 0.9, all LT values are greater than 0.5. While for FSDLTM2, in case when Be is 0.9, for all values of Ra and Re, when Ep is 0.5 and 0.9, all LT values are higher than 0.5. This shows that the person or device is trustworthy. The FSDLTM2 is more complex than FSALTM1 but it makes a better decision for LT by considering four input parameters.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"69 9","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139164107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Qiuyu Lu, Haibo Li, Jianping Zheng, Jianru Qin, Yinguo Yang, Li Li, Ke Jiang
In order to study the operating characteristics of variable speed constant frequency wind turbine under different working conditions and the monitoring system of wind turbine. In this paper, the simulation model of each component system of wind turbine is established by MATLAB/Simulink module, and the influence law of different wind speed and ground fault types on the output power of wind turbine is studied. The active power of wind turbines under different short-circuit fault types is compared. At the same time, in order to realize real-time monitoring of wind turbine speed and output power, an online monitoring system for wind turbine operation based on industrial Internet of Things is proposed, and the composition and operation characteristics of this remote monitoring system are given. The practical application shows that the on-line monitoring system can accurately and remotely monitor the running status of the wind turbine and avoid the unstable running of the wind turbine. The research conclusions of this paper can provide reference for the design and construction of wind turbines and the operation of connecting to the power grid.
{"title":"Research on fault detection and remote monitoring system of variable speed constant frequency wind turbine based on Internet of things","authors":"Qiuyu Lu, Haibo Li, Jianping Zheng, Jianru Qin, Yinguo Yang, Li Li, Ke Jiang","doi":"10.3233/jhs-222009","DOIUrl":"https://doi.org/10.3233/jhs-222009","url":null,"abstract":"In order to study the operating characteristics of variable speed constant frequency wind turbine under different working conditions and the monitoring system of wind turbine. In this paper, the simulation model of each component system of wind turbine is established by MATLAB/Simulink module, and the influence law of different wind speed and ground fault types on the output power of wind turbine is studied. The active power of wind turbines under different short-circuit fault types is compared. At the same time, in order to realize real-time monitoring of wind turbine speed and output power, an online monitoring system for wind turbine operation based on industrial Internet of Things is proposed, and the composition and operation characteristics of this remote monitoring system are given. The practical application shows that the on-line monitoring system can accurately and remotely monitor the running status of the wind turbine and avoid the unstable running of the wind turbine. The research conclusions of this paper can provide reference for the design and construction of wind turbines and the operation of connecting to the power grid.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"101 14","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138607834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
IP mobility support is based on terminal behavior, recognizing mobility and maintaining a continuous communication session. The existing mobile IP location registration sends a message to one or more routers during a handoff within a domain by using a multicast address to process messages continuously. This implementation requires persistent message processing among all routers to determine new multicast address assignments. To solve this problem, we propose a method that enables the mobile user to obtain a QoS guarantee when the mobile device moves to an overlapping area under the mobile IP. Therefore, dynamic mobility management includes location updates under the mobile IP, and transmission of packets from the expected access points. When a handoff occurs while the mobile device is connected, the mobile host dynamically adapts to the mobility characteristics of the mobile node and transmits missed packets. In addition, by first using a location router, handoff latency reduction and packet loss requirements between domains in the overlapping mobile network environment are resolved. Second, the proposed algorithm has low-control traffic in the mobile network, allowing quick handoffs. Although instantaneous throughput is reduced during handoffs, tunneling is reduced by 10-30%, even after a handoff, by retransmitting packets missed by the mobile host, while location-registration-update times are reduced by 20-80%.
IP 移动性支持以终端行为为基础，识别移动性并保持连续的通信会话。现有的移动 IP 位置注册通过使用多播地址持续处理信息，在域内切换时向一个或多个路由器发送信息。这种实现方式需要在所有路由器之间持续处理信息，以确定新的组播地址分配。为了解决这个问题，我们提出了一种方法，当移动设备移动到移动 IP 下的重叠区域时，移动用户可以获得 QoS 保证。因此，动态移动管理包括移动 IP 下的位置更新，以及从预期接入点传输数据包。当移动设备连接时发生切换，移动主机会动态适应移动节点的移动特性，并传输遗漏数据包。此外，通过首先使用定位路由器，可以解决重叠移动网络环境中域之间的切换延迟降低和数据包丢失要求。其次，建议的算法在移动网络中的控制流量较低，允许快速切换。虽然在切换期间瞬时吞吐量会减少，但通过重传移动主机错过的数据包，即使在切换后，隧道传输也会减少 10-30%，而位置注册更新时间则会减少 20-80%。
{"title":"Efficient dynamic IP datacasting mobility management based on LRS in mobile IP networks","authors":"SangYeob Oh, ChulHo Park","doi":"10.3233/jhs-222035","DOIUrl":"https://doi.org/10.3233/jhs-222035","url":null,"abstract":"IP mobility support is based on terminal behavior, recognizing mobility and maintaining a continuous communication session. The existing mobile IP location registration sends a message to one or more routers during a handoff within a domain by using a multicast address to process messages continuously. This implementation requires persistent message processing among all routers to determine new multicast address assignments. To solve this problem, we propose a method that enables the mobile user to obtain a QoS guarantee when the mobile device moves to an overlapping area under the mobile IP. Therefore, dynamic mobility management includes location updates under the mobile IP, and transmission of packets from the expected access points. When a handoff occurs while the mobile device is connected, the mobile host dynamically adapts to the mobility characteristics of the mobile node and transmits missed packets. In addition, by first using a location router, handoff latency reduction and packet loss requirements between domains in the overlapping mobile network environment are resolved. Second, the proposed algorithm has low-control traffic in the mobile network, allowing quick handoffs. Although instantaneous throughput is reduced during handoffs, tunneling is reduced by 10-30%, even after a handoff, by retransmitting packets missed by the mobile host, while location-registration-update times are reduced by 20-80%.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"76 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2023-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139212700","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Though the existing load balancing designs successfully make full use of available parallel paths and attain high bisection network bandwidth, they reroute flows regardless of their dissimilar performance requirements. But traffic in modern data center networks exhibits short bursts characteristic, which can easily lead to network congestion. The short flows suffer from the problems of large queuing delay and packet reordering, while the long flows fail to obtain high throughput due to low link utilization and packet reordering. In order to solve these inefficiency, we designed a fine-grained load balancing method (FLB), which uses an active monitoring mechanism to split traffic, and flexibly transfers flowlet to non-congested path, effectively reducing the negative impact of burst flow on network performance. Besides, to avoid packet reordering, FLB leverages the probe packets to estimate the end-to-end delay, thus excluding paths that potentially cause packet reordering. The test results of NS2 simulation show that FLB significantly reduces the average and tail flow completion time of flows by up to 59% and 56% compared to the state-of-the-art multi-path transmission scheme with less computational overhead, as well as increases the throughput of long flow.
{"title":"Fine-grained load balancing with proactive prediction and adaptive rerouting in data center","authors":"Weimin Gao, Jiaming Zhong, Caihong Peng, Xinlong Li, Xiangbai Liao","doi":"10.3233/jhs-230003","DOIUrl":"https://doi.org/10.3233/jhs-230003","url":null,"abstract":"Though the existing load balancing designs successfully make full use of available parallel paths and attain high bisection network bandwidth, they reroute flows regardless of their dissimilar performance requirements. But traffic in modern data center networks exhibits short bursts characteristic, which can easily lead to network congestion. The short flows suffer from the problems of large queuing delay and packet reordering, while the long flows fail to obtain high throughput due to low link utilization and packet reordering. In order to solve these inefficiency, we designed a fine-grained load balancing method (FLB), which uses an active monitoring mechanism to split traffic, and flexibly transfers flowlet to non-congested path, effectively reducing the negative impact of burst flow on network performance. Besides, to avoid packet reordering, FLB leverages the probe packets to estimate the end-to-end delay, thus excluding paths that potentially cause packet reordering. The test results of NS2 simulation show that FLB significantly reduces the average and tail flow completion time of flows by up to 59% and 56% compared to the state-of-the-art multi-path transmission scheme with less computational overhead, as well as increases the throughput of long flow.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"120 49","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135136360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
IoT networks can be defined as groups of physically connected things and devices that can connect to the Internet and exchange data with one another. Since enabling an increasing number of internets of things devices to connect with their networks, organizations have become more vulnerable to safety issues and attacks. A major drawback of previous research is that it can find out prior seen types only, also any new device types are considered anomalous. In this manuscript, IoT device type detection utilizing Training deep quantum neural networks optimized with a Chimp optimization algorithm for enhancing IOT security (IOT-DTI-TDQNN-COA-ES) is proposed. The proposed method entails three phases namely data collection, feature extraction and detection. For Data collection phase, real network traffic dataset from different IoT device types are collected. For feature mining phase, the internet traffic features are extracted through automated building extraction (ABE) method. IoT device type identification phase, Training deep quantum neural networks (TDQNN) optimized with Chimp optimization algorithm (COA) is utilized to detect the category of IoT devices as known and unknown device. IoT network is implemented in Python. Then the simulation performance of the proposed IOT-DTI-TDQNN-COA-ES method attains higher accuracy as26.82% and 23.48% respectively, when compared with the existing methods.
物联网网络可以被定义为一组物理连接的事物和设备，它们可以连接到互联网并相互交换数据。由于使越来越多的物联网设备与他们的网络连接，组织变得更容易受到安全问题和攻击。先前研究的一个主要缺点是它只能找到之前看到的类型，而且任何新的设备类型都被认为是异常的。在本文中，提出了利用黑猩猩优化算法优化的训练深度量子神经网络来增强物联网安全性(IoT - dti - tdqnn - coa - es)的物联网设备类型检测。该方法包括数据收集、特征提取和检测三个阶段。数据采集阶段，采集不同物联网设备类型的真实网络流量数据集。在特征挖掘阶段，采用自动化建筑提取(ABE)方法提取互联网流量特征。物联网设备类型识别阶段，利用黑猩猩优化算法(COA)优化的深度量子神经网络(TDQNN)来检测已知和未知物联网设备的类别。IoT网络是用Python实现的。与现有方法相比，本文提出的IOT-DTI-TDQNN-COA-ES方法的仿真性能分别达到26.82%和23.48%。
{"title":"IoT device type identification using training deep quantum neural networks optimized with a chimp optimization algorithm for enhancing IoT security","authors":"C.P. Shirley, Jaydip Kumar, Kantilal Pitambar Rane, Narendra Kumar, Deevi Radha Rani, Kuntamukkula Harshitha, Mohit Tiwari","doi":"10.3233/jhs-230028","DOIUrl":"https://doi.org/10.3233/jhs-230028","url":null,"abstract":"IoT networks can be defined as groups of physically connected things and devices that can connect to the Internet and exchange data with one another. Since enabling an increasing number of internets of things devices to connect with their networks, organizations have become more vulnerable to safety issues and attacks. A major drawback of previous research is that it can find out prior seen types only, also any new device types are considered anomalous. In this manuscript, IoT device type detection utilizing Training deep quantum neural networks optimized with a Chimp optimization algorithm for enhancing IOT security (IOT-DTI-TDQNN-COA-ES) is proposed. The proposed method entails three phases namely data collection, feature extraction and detection. For Data collection phase, real network traffic dataset from different IoT device types are collected. For feature mining phase, the internet traffic features are extracted through automated building extraction (ABE) method. IoT device type identification phase, Training deep quantum neural networks (TDQNN) optimized with Chimp optimization algorithm (COA) is utilized to detect the category of IoT devices as known and unknown device. IoT network is implemented in Python. Then the simulation performance of the proposed IOT-DTI-TDQNN-COA-ES method attains higher accuracy as26.82% and 23.48% respectively, when compared with the existing methods.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"3 21","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135819195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With escalating demands for high-definition video, cache collaboration allows neighbor nodes to share locally stored content in order to reduce download traffic. High energy consumption associated with content delivery remains a concern for Content Distribution Networks (CDNs). Therefore, this paper proposes cluster-based collaborative caching in a core network employing IP over WDM. The aim is to allow sets of core caches to fully share content while minimizing power. A Mixed Integer Linear Programming (MILP) model is used to form energy-efficient cache clusters. The energy consumption of the network is evaluated under different cluster sizes to find the optimum size that minimizes energy. To evaluate the influence of content popularity distribution, a heavy-tailed Zipf distribution and an Equal popularity distribution are evaluated. In addition, the work investigates the influence of downlink traffic behavior and power consumption parameters on optimum cluster sizes. Attained results reveal that maximum savings in energy consumption introduced by cluster-based collaborative caching are up to 34.3% and 21.8% under the Zipf and Equal distribution, respectively. Cache collaboration is not recommended when all core nodes contain fully replicated content servers. Results also show that power consumption parameters do not influence cluster formation. It is recommended keeping cache collaboration in the core network simple, so as to reduce intra-cluster communication.
随着对高清视频的需求不断增加，缓存协作允许相邻节点共享本地存储的内容，以减少下载流量。与内容交付相关的高能耗仍然是内容分发网络(cdn)关注的问题。因此，本文提出了一种基于IP over WDM的核心网集群协同缓存技术。其目的是允许核心缓存集在最小化功耗的同时完全共享内容。采用混合整数线性规划(MILP)模型形成高效节能的缓存簇。通过对不同簇大小下的网络能耗进行评估，找到能量最小的最优簇大小。为了评估内容流行度分布的影响，评估了重尾Zipf分布和等流行度分布。此外，本文还研究了下行流量行为和功耗参数对最优簇大小的影响。所获得的结果表明，在Zipf和Equal分布下，基于集群的协作缓存带来的最大能耗节约分别高达34.3%和21.8%。当所有核心节点都包含完全复制的内容服务器时，不建议使用缓存协作。结果还表明，功耗参数不影响集群的形成。建议将核心网的缓存协作保持简单，以减少集群内的通信。
{"title":"Energy efficiency of cache collaboration in core content distribution networks","authors":"Niemah Izzeldin Osman","doi":"10.3233/jhs-230018","DOIUrl":"https://doi.org/10.3233/jhs-230018","url":null,"abstract":"With escalating demands for high-definition video, cache collaboration allows neighbor nodes to share locally stored content in order to reduce download traffic. High energy consumption associated with content delivery remains a concern for Content Distribution Networks (CDNs). Therefore, this paper proposes cluster-based collaborative caching in a core network employing IP over WDM. The aim is to allow sets of core caches to fully share content while minimizing power. A Mixed Integer Linear Programming (MILP) model is used to form energy-efficient cache clusters. The energy consumption of the network is evaluated under different cluster sizes to find the optimum size that minimizes energy. To evaluate the influence of content popularity distribution, a heavy-tailed Zipf distribution and an Equal popularity distribution are evaluated. In addition, the work investigates the influence of downlink traffic behavior and power consumption parameters on optimum cluster sizes. Attained results reveal that maximum savings in energy consumption introduced by cluster-based collaborative caching are up to 34.3% and 21.8% under the Zipf and Equal distribution, respectively. Cache collaboration is not recommended when all core nodes contain fully replicated content servers. Results also show that power consumption parameters do not influence cluster formation. It is recommended keeping cache collaboration in the core network simple, so as to reduce intra-cluster communication.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"63 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134905983","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we present a hybrid intelligent simulation system for optimization of mesh routers in Wireless Mesh Networks (WMNs) called WMN-PSOHCDGA. We implemented six mesh router replacement methods: CM, RIWM, LDIWM, LDVM, RDVM and FC-RDVM and consider Two Islands distribution of mesh clients. We carry out a comparison study of these router replacement methods for small and middle scale WMNs. We assessed the performance by computer simulations. The simulation results show that six methods have a good performance for connectivity and coverage metrics, for both small and middle scale WMNs. However, they have different behavior for load balancing. For small scale WMNs, the load balancing of LDIWM, RIWM and FC-RDVM is better than CM, LDVM and RDVM. While, comparing LDIWM, RIWM and FC-RDVM, the LDIWM has better load balancing. We found that the load balancing for small scale WMNs is not good, because there is a concentration of mesh routers in some areas. For middle scale WMNs, the CM, LDIWM, LDVM and RDVM have not a good load balancing. While, the RIWM and FC-RDVM have better performance. Comparing RIWM and FC-RDVM, we found that the load balancing of FC-RDVM is better than RIWM.
{"title":"Performance evaluation of six mesh router replacement methods for wireless mesh networks: A comparison study for small and middle scale networks considering two islands distribution of mesh clients","authors":"Leonard Barolli","doi":"10.3233/jhs-230093","DOIUrl":"https://doi.org/10.3233/jhs-230093","url":null,"abstract":"In this paper, we present a hybrid intelligent simulation system for optimization of mesh routers in Wireless Mesh Networks (WMNs) called WMN-PSOHCDGA. We implemented six mesh router replacement methods: CM, RIWM, LDIWM, LDVM, RDVM and FC-RDVM and consider Two Islands distribution of mesh clients. We carry out a comparison study of these router replacement methods for small and middle scale WMNs. We assessed the performance by computer simulations. The simulation results show that six methods have a good performance for connectivity and coverage metrics, for both small and middle scale WMNs. However, they have different behavior for load balancing. For small scale WMNs, the load balancing of LDIWM, RIWM and FC-RDVM is better than CM, LDVM and RDVM. While, comparing LDIWM, RIWM and FC-RDVM, the LDIWM has better load balancing. We found that the load balancing for small scale WMNs is not good, because there is a concentration of mesh routers in some areas. For middle scale WMNs, the CM, LDIWM, LDVM and RDVM have not a good load balancing. While, the RIWM and FC-RDVM have better performance. Comparing RIWM and FC-RDVM, we found that the load balancing of FC-RDVM is better than RIWM.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135315423","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Muhammad Saad Chughtai, Irfana Bibi, Shahid Karim, Syed Wajid Ali Shah, Asif Ali Laghari, Abdullah Ayub Khan
Web applications play a vital role in modern digital world. Their pervasiveness is mainly underpinned by numerous technological advances that can often lead to misconfigurations, thereby opening a way for a variety of attack vectors. The rapid development of E-commerce, big data, cloud computing and other technologies, further enterprise services are entering to the internet world and have increasingly become the key targets of network attacks. Therefore, the appropriate remedies are essential to maintain the very fabric of security in digital world. This paper aims to identify such vulnerabilities that need to be addressed for ensuring the web security. We identify and compare the static, dynamic, and hybrid tools that can counter the prevalent attacks perpetrated through the identified vulnerabilities. Additionally, we also review the applications of AI in intrusion detection and pinpoint the research gaps. Finally, we cross-compare the various security models and highlight the relevant future research directions.
{"title":"Deep learning trends and future perspectives of web security and vulnerabilities","authors":"Muhammad Saad Chughtai, Irfana Bibi, Shahid Karim, Syed Wajid Ali Shah, Asif Ali Laghari, Abdullah Ayub Khan","doi":"10.3233/jhs-230037","DOIUrl":"https://doi.org/10.3233/jhs-230037","url":null,"abstract":"Web applications play a vital role in modern digital world. Their pervasiveness is mainly underpinned by numerous technological advances that can often lead to misconfigurations, thereby opening a way for a variety of attack vectors. The rapid development of E-commerce, big data, cloud computing and other technologies, further enterprise services are entering to the internet world and have increasingly become the key targets of network attacks. Therefore, the appropriate remedies are essential to maintain the very fabric of security in digital world. This paper aims to identify such vulnerabilities that need to be addressed for ensuring the web security. We identify and compare the static, dynamic, and hybrid tools that can counter the prevalent attacks perpetrated through the identified vulnerabilities. Additionally, we also review the applications of AI in intrusion detection and pinpoint the research gaps. Finally, we cross-compare the various security models and highlight the relevant future research directions.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135569757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：