International Journal of Network Management最新文献

{"title":"Workload prediction based on improved error correlation logistic regression algorithm and Cross-TRCN of spatiotemporal neural network","authors":"Xin Wan,&nbsp;Xiang Huang,&nbsp;Fuzhi Wang","doi":"10.1002/nem.2272","DOIUrl":"10.1002/nem.2272","url":null,"abstract":"<p>In view of the randomness of user network usage behavior in data centers, which leads to a large randomness in power load, and considering that a single randomness processing method is usually difficult to fully characterize the uncertain characteristics of the system, this paper proposes a dual fusion prediction analysis model based on an improved error correlation logic regression algorithm and a novel spatiotemporal neural network structure called Cross-TRCN. Two weight coefficients λ1 and λ2 are introduced to fuse the prediction results with different long-term sequence prediction performance, thereby further eliminating the influence of random errors. The results show that it is feasible to predict the workload of data centers based on the improved error correlation logic regression algorithm and the innovative spatiotemporal neural network structure Cross-TRCN.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"35 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140840115","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"SMS2DC: Synchronous mobile sinks scheduling for data collection in internet of things-enabled wireless sensor networks","authors":"Nagalapuram Selvarajan Swapna,&nbsp;Raguru Jaya Krishna,&nbsp;Avija Vishnuvardhan Reddy,&nbsp;Patike Kiran Rao,&nbsp;Perumalla Suman Prakash","doi":"10.1002/nem.2267","DOIUrl":"10.1002/nem.2267","url":null,"abstract":"<div>\u0000 \u0000 <p>Energy-efficient data collection in wireless sensor networks (WSNs) is crucial due to the limited battery capacity of sensor nodes (SNs). Using a mobile sink (MS) for data collection can lower the energy consumption of SNs to avoid relaying in WSNs. However, a single MS is not a feasible solution for large-scale WSNs, so it was necessary to use multiple MSs to collect data. A synchronous MS scheduling strategy for data collection (SMS2DC) is proposed in this paper, which uses two types of MS, a local MS to collect data from SN and a global MS to collect data from local MS. In this process, we begin by partitioning the network based on chemical reaction optimization. For each partition, a MS is assigned and scheduled using a path construction strategy according to a geometric path construction approach. In addition, a global MS is scheduled based on a local MS trajectory by identifying the most appropriate collision point to collect data. As a result, the algorithm increases data collection accuracy while minimizing network data loss. The asymptotic time complexity of the proposed SMS2DC algorithm needed <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>O</mi>\u0000 <mfenced>\u0000 <msup>\u0000 <mi>n</mi>\u0000 <mn>2</mn>\u0000 </msup>\u0000 </mfenced>\u0000 </mrow>\u0000 <annotation>$$ Oleft({n}^2right) $$</annotation>\u0000 </semantics></math>. The comparison results show the superiority of the proposed SMS2DC strategy under multiple scenarios under various deployment conditions.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"35 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140612709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Data sharing mode of dispatching automation system based on distributed machine learning","authors":"Xiaoli He,&nbsp;Mi Luo,&nbsp;Yurui Hu,&nbsp;Feng Xiong","doi":"10.1002/nem.2269","DOIUrl":"10.1002/nem.2269","url":null,"abstract":"<p>The difficulties of sending massive amounts of data between several data centres are examined in this work, with particular attention paid to how poorly current scheduling algorithms handle point-to-multipoint transfers and transmission time limits. In this research, a new method called multicast source-based tree (MSBT) is proposed for effectively handling point-to-multipoint transmissions in a certain amount of time. By allowing receivers to simultaneously receive data from several source points, MSBT introduces the idea of ‘source selection’ for the creation of multicast tree structure-based algorithms. Large data blocks are distributed as efficiently as possible using this method, which also guarantees effective transmission from a single-source point to several recipient locations. Furthermore covered in the article is how PV producers and sellers' capacity allocation is affected by the discount rate. These results offer insightful information on how decisions are made in related sectors. The development of new energy big data platforms underscores their significance; leaders in the industry, like United Power, Vision Energy and Goldwind, serve as prime examples.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"35 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140603077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Dynamic mobility and handover management in software-defined networking-based fifth-generation heterogeneous networks","authors":"Adil Khan,&nbsp;Shabeer Ahmad,&nbsp;Ihsan Ali,&nbsp;Babar Hayat,&nbsp;Yanan Tian,&nbsp;Weixing Liu","doi":"10.1002/nem.2268","DOIUrl":"10.1002/nem.2268","url":null,"abstract":"<p>The adoption and application of mobile communication technology have rapidly escalated, leading to a significant upsurge in the demand of data traffic. Ultra-densification stands as one of the network solutions within the realm of 5G and beyond technologies, aimed to enhance data rates and network capacity. Heterogeneous networks (HetNets) are deployed with different types of small cells (SCs) in mobile networks to provide high capacity, data rate, throughput, and low latency communication. HetNet solves the problem of network densification at the expense of mobility management problems such as ping-pong handover, unnecessary handovers, handover delay, and cell load. This paper introduces an enhanced optimal cell selection technique employing software-defined networking (SDN) to tackle the challenges of handover and mobility management in 5G and beyond 5G (B5G) HetNet. The proposed SDN-based cell selection scheme leverages linear programming (LP) to manage the mobility of users dynamically, facilitating the selection of the optimal cell for user equipment (UE) handover. This selection is based on multi-attribute decision-making criteria, which include user direction, received signal strength (RSS) value, cell load, and dwell time. By applying LP, computational overhead during cell selection is significantly reduced. The results indicate that the proposed scheme leads to a 39% reduction in number of handovers. This reduction signifies a substantial advancement in mitigating issues associated with frequent and unnecessary handovers, ultimately leading to minimized signaling overhead between UE and cells. Moreover, the proposed solution outperformed the existing scheme in terms of system's throughput and selects an optimal target cell with a lower cell load.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"35 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/nem.2268","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140324443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Athena: Smart order routing on centralized crypto exchanges using a unified order book","authors":"Robert Henker,&nbsp;Daniel Atzberger,&nbsp;Jan Ole Vollmer,&nbsp;Willy Scheibel,&nbsp;Jürgen Döllner,&nbsp;Markus Bick","doi":"10.1002/nem.2266","DOIUrl":"10.1002/nem.2266","url":null,"abstract":"<p>Most cryptocurrency spot trading occurs on centralized crypto exchanges, where offers for buying and selling are organized via an order book. In liquid markets, the price achieved for buying and selling deviates only slightly from the assumed reference price, that is, trading is associated with low implicit costs. However, compared to traditional finance, crypto markets are still illiquid, and consequently, the reduction of implicit costs is crucial for any trading strategy and of high interest, especially for institutional investors. This paper describes the design and implementation of Athena, a system that automatically splits orders across multiple exchanges to minimize implicit costs. For this purpose, order books are collected from several centralized crypto exchanges and merged into an internal unified order book. In addition to price and quantity, the entries in the unified order book are enriched with information about the exchange. This enables a smart order routing algorithm to split an order into several slices and execute these on several exchanges to reduce implicit costs and achieve a better price. An extensive evaluation shows the savings of using the smart order routing algorithm.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 4","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/nem.2266","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140314422","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Out-of-band transaction pool sync for large dynamic blockchain networks","authors":"Novak Boskov,&nbsp;Xingyu Chen,&nbsp;Sevval Simsek,&nbsp;Ari Trachtenberg,&nbsp;David Starobinski","doi":"10.1002/nem.2265","DOIUrl":"10.1002/nem.2265","url":null,"abstract":"<p>Synchronization of transaction pools (<i>mempools</i>) has shown potential for improving the performance and block propagation delay of state-of-the-art blockchains. Indeed, various heuristics have been proposed in the literature to incorporate early exchanges of <i>unconfirmed</i> transactions into the block propagation protocol. In this work, we take a different approach, maintaining transaction synchronization externally (and independently) of the block propagation channel. In the process, we formalize the synchronization problem within a graph theoretic framework and introduce a novel algorithm (<i>SREP</i>—<i>set reconciliation-enhanced propagation</i>) with quantifiable guarantees. We analyze the algorithm's performance for various realistic network topologies and show that it converges on static connected graphs in a time bounded by the diameter of the graph. In graphs with dynamic edges, <i>SREP</i> converges in an expected time that is linear in the number of nodes. We confirm our analytical findings through extensive simulations that include comparisons with <i>MempoolSync</i>, a recent approach from the literature. Our simulations show that <i>SREP</i> incurs reasonable bandwidth overhead and scales gracefully with the size of the network (unlike <i>MempoolSync</i>).</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 5","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140300514","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A security-enhanced equipment predictive maintenance solution for the ETO manufacturing","authors":"Xiangyu Cao,&nbsp;Zhengjun Jing,&nbsp;Xiaorong Zhao,&nbsp;Xiaolong Xu","doi":"10.1002/nem.2263","DOIUrl":"10.1002/nem.2263","url":null,"abstract":"<div>\u0000 \u0000 <p>With the rapid advancement of intelligent manufacturing, ensuring equipment safety has become a crucial prerequisite for enterprise production. In the engineer-to-order (ETO) production mode, characterized by diverse equipment types and frequent adjustments in production lines, equipment maintenance has become increasingly complex. Traditional maintenance plans are no longer adequate to meet the evolving demands of equipment maintenance. This paper proposes a security-enhanced predictive maintenance scheme specifically designed for ETO-type production equipment. The scheme utilizes industrial Internet of Things (IIoT) technology to monitor machines and equipment, constructs prediction models using machine learning methods, and reinforces the security of the prediction system through adoption of a decentralized architecture with blockchain distributed storage. In this experiment, six supervised learning models were compared, and it was found that the model based on the random forest algorithm achieved an outstanding accuracy rate of 98.88%. Furthermore, the average total response time for generating predictions within the system is 2.0 s, demonstrating a performance suitable for practical equipment maintenance applications.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 6","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139946551","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"IGXSS: XSS payload detection model based on inductive GCN","authors":"Qiuhua Wang,&nbsp;Chuangchuang Li,&nbsp;Dong Wang,&nbsp;Lifeng Yuan,&nbsp;Gaoning Pan,&nbsp;Yanyu Cheng,&nbsp;Mingde Hu,&nbsp;Yizhi Ren","doi":"10.1002/nem.2264","DOIUrl":"10.1002/nem.2264","url":null,"abstract":"<p>To facilitate the management, Internet of Things (IoT) vendors usually apply remote ways such as HTTP services to uniformly manage IoT devices, leading to traditional web application vulnerabilities that also endanger the cloud interfaces of IoT, such as cross-site scripting (XSS), code injection, and Remote Command/Code Execute (RCE). XSS is one of the most common web application attacks, which allows the attacker to obtain private user information or attack IoT devices and IoT cloud platforms. Most of the existing XSS payload detection models are based on machine learning or deep learning, which usually require a lot of external resources, such as pretrained word vectors, to achieve a better performance on unknown samples. But in the field of XSS payload detection, high-quality vector representations of samples are often difficult to obtain. In addition, existing models all perform substantially worse when the distribution of XSS payloads and benign samples in the test dataset is extremely unbalanced (e.g., XSS payloads: benign samples = 1: 20). While in the real XSS attack scenario against IoT, an XSS payload is often hidden in a massive amount of normal user requests, indicating that these models are not practical. In response to the above issues, we propose an XSS payload detection model based on inductive graph neural networks, IGXSS (XSS payload detection model based on inductive GCN), to detect XSS payloads targeting IoT. Firstly, we treat the samples and words obtained from segmenting the samples as nodes and attach lines between them in order to form a graph. Then, we obtain the feature matrix of nodes and edges utilizing information between nodes only (instead of external resources such as pretrained word vectors). Finally, we feed the obtained feature matrix into a two-layer GCN for training and validate the performance of models in several datasets with different sample distributions. Extensive experiments on the real datasets show that IGXSS performs better compared to other models under various sample distributions. In particular, when the sample distribution is extremely unbalanced, the recall and F1 score of IGXSS still reach 1.000 and 0.846, demonstrating that IGXSS is more robust and more suitable for practical scenarios.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 6","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139773683","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Reducing the propagation delay of compact block in Bitcoin network","authors":"Aeri Kim,&nbsp;Meryam Essaid,&nbsp;Sejin Park,&nbsp;Hongtaek Ju","doi":"10.1002/nem.2262","DOIUrl":"10.1002/nem.2262","url":null,"abstract":"<div>\u0000 \u0000 <p>Bitcoin is a Blockchain-based network in which thousands of nodes are directly connected and communicate via a gossip-based flooding protocol. Mined blocks are propagated to all participating nodes in the network through a CBR (compact block relay) protocol developed to reduce the block propagation delay. However, propagation delay persists. The relay time between nodes must be measured and analyzed to determine the cause of the delay and provide solutions for reducing block propagation time. Previously, we measured the relay time and investigated the cause of the delay. According to the findings of the previous study, the delay of the relay time occurs when assembling compact blocks, depending on whether transactions are requested. In this paper, we find the reasons for requesting transactions. The reasons are due to the transaction propagation method and the characteristics of the transaction itself. We propose a solution based on this. It is a method of reducing probability of requesting transactions by using the compact block's “PREFILLEDTXN” to send the transactions expected to be requested with the block. The probability of requesting is reduced by up to 67% when transactions that have just entered the memory pool are propagated by PREFILLEDTXN. The block relay time is reduced by up to 44% as a result. Finally, this research reduces block relay time between nodes.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 3","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139590560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Deeper: A shared liquidity decentralized exchange design for low trading volume tokens to enhance average liquidity","authors":"Srisht Fateh Singh,&nbsp;Panagiotis Michalopoulos,&nbsp;Andreas Veneris","doi":"10.1002/nem.2261","DOIUrl":"10.1002/nem.2261","url":null,"abstract":"<p>This paper presents <span>Deeper</span>, a design for a decentralized exchange that enhances liquidity via reserve sharing. By doing this, it addresses the problem of shallow liquidity in low trading volume token pairs. Shallow liquidity impairs the functioning of on-chain markets by creating room for unwanted phenomena such as high slippage and sandwich attacks. <span>Deeper</span> solves this by allowing liquidity providers of multiple trading pairs against a common token to share liquidity. This is achieved by creating a common reserve pool for the shared token that is accessible by each trading pair. Independent from the shared liquidity, providers are free to add liquidity to individual token pairs without any restriction. The trading between one token pair does not affect the price of other token pairs even though the reserve of the shared token changes. The proposed design is an extension of concentrated liquidity automated market maker DEXs that is simple enough to be implemented on smart contracts. This is demonstrated by providing a template for a hook-based smart contract that adds our custom functionality to <span>Uniswap V4</span>. Experiments on historical prices show that for a batch consisting of eight trading pairs, <span>Deeper</span> enhances liquidity by over 2.6–\u0000<span></span><math>\u0000 <mn>5</mn>\u0000 <mo>.</mo>\u0000 <mn>9</mn>\u0000 <mo>×</mo></math>. The enhancement in liquidity can be increased further by increasing the participating tokens in the shared pool. While providing shared liquidity, liquidity providers should be cautious of certain risks and pitfalls, which are described. Overall, <span>Deeper</span> enables the creation of fair markets for low trading volume token pairs.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 4","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/nem.2261","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139498570","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}