Terms Of Latency Research Articles

A Qualitative and Comparative Performance Assessment of Logically Centralized SDN Controllers via Mininet Emulator

An alternative networking approach called Software Defined Networking (SDN) enables dynamic, programmatically efficient network construction, hence enhancing network performance. It splits a traditional network into a centralized control plane and a configurable data plane. Because the core component overseeing every data plane action is the controller in the control plane, which may contain one or more controllers and is thought of as the brains of the SDN network, controller functionality and performance are crucial to achieve optimal performances. There is much controller research available in the existing literature. Nevertheless, no qualitative comparison study of OpenFlow-enabled distributed but logically centralized controllers exists. This paper includes a quantitative investigation of the performance of several distributed but logically centralized SDN controllers in custom network scenarios using Mininet, as well as a thorough qualitative comparison of them. More precisely, we give a qualitative evaluation of their attributes and classify and categorize 13 distributed but logically centralized SDN controllers according to their capabilities. Additionally, we offer a comprehensive SDN emulation tool, called Mininet-based SDN controller performance assessment, in this study. Using six performance metrics—bandwidth, round-trip time, delay, jitter, packet loss, and throughput—this work also assesses five distributed but logically centralized controllers within two custom network scenarios (uniform and non-uniform host distribution). Our analysis reveals that the Ryu controller outperforms the OpenDayLight controller in terms of latency, packet loss, and round-trip time, while the OpenDayLight controller performs well in terms of throughput, bandwidth, and jitter. Throughout the entire experiment, the HyperFlow and ONOS controllers performed worst in all performance metrics. Finally, we discuss detailed research findings on performance. These experimental results provide decision-making guidelines when selecting a controller.

Blockchain-based data sharing algorithm in distributed network data storage

This paper proposes a sharing algorithm based on blockchain principles to address the issues of data sharing, low efficiency, and performance in traditional systems. The algorithm is integrated with the domain name system to develop a data storage system based on blockchain. The performance of the sharing algorithm is evaluated, and the data storage system is tested. This demonstrates that the sharing algorithm’s average latency is 436 ms and average throughput is 5439 tps. Furthermore, it outperforms the other comparison algorithms. Additionally, the study conducts performance experiments to compare the data storage system. The data storage system proposed in this study demonstrates a higher average throughput of 6.42*108 tps and a faster data access time of 0.15 s than the other comparison systems. The comprehensive results show that the proposed sharing algorithm and data storage system outperform the comparison algorithm and system in terms of latency, throughput, and data access performance. The constructed model exhibits good centralized and distributed storage crawling performance, which can achieve more secure, efficient, and trustworthy data sharing in distributed network data storage.

Cost-effective internet of things privacy-aware data storage and real-time analysis

<span lang="EN-US">It has been estimated that about 20 billion internet of things (IoT) devices are currently connected to the Internet. This has led to voluminous data generation which makes storaging, managing, and decision making on data to be challenging. Hence, exposes users’ privacy to be vulnerable to unauthorized people. To address these issues, this research proposed cost-effective storage for keeping and processing the IoT data in real-time. The proposed Fframework utilized a reliable hybridised data privacy model to protect the personal information of users. An empirically evaluation was done to identify the best models using data k-anonymity (KA), l-diversity (LD), t-closeness (TC), and differential privacy (DP). The performance evaluation of cloud computing and fog computing was done through simulations. The results obtained show that the combination of two data privacy models: differential privacy and k-anonymity models performed better than any individual model and any other combined models in the protection of users’ personal information. Lastly, fog computing was found to perform better than the cloud in terms of latency, energy consumption, network usage and execution time. In conclusion, the current study strongly recommends the use of hybridised privacy model of differential privacy (DP) and k-anonymity (KA) for the protection of IoT generated data privacy.</span>

Blockchain-secure patient Digital Twin in healthcare using smart contracts.

Modern healthcare has a sharp focus on data aggregation and processing technologies. Consequently, from a data perspective, a patient may be regarded as a timestamped list of medical conditions and their corresponding corrective interventions. Technologies to securely aggregate and access data for individual patients in the quest for precision medicine have led to the adoption of Digital Twins in healthcare. Digital Twins are used in manufacturing and engineering to produce digital models of physical objects that capture the essence of device operation to enable and drive optimization. Thus, a patient's Digital Twin can significantly improve health data sharing. However, creating the Digital Twin from multiple data sources, such as the patient's electronic medical records (EMR) and personal health records (PHR) from wearable devices, presents some risks to the security of the model and the patient. The constituent data for the Digital Twin should be accessible only with permission from relevant entities and thus requires authentication, privacy, and provable provenance. This paper proposes a blockchain-secure patient Digital Twin that relies on smart contracts to automate the updating and communication processes that maintain the Digital Twin. The smart contracts govern the response the Digital Twin provides when queried, based on policies created for each patient. We highlight four research points: access control, interaction, privacy, and security of the Digital Twin and we evaluate the Digital Twin in terms of latency in the network, smart contract execution times, and data storage costs.

Distributed transmission and optimization of relay-assisted space-air-ground IoT systems

This paper investigates the integration of relay-assisted Internet of Things (IoT) systems, focusing on the use of multiple relays to enhance the system performance. The central metric of interest in this study is system outage probability, evaluated in terms of latency. Our research provides a comprehensive analysis of system outage probability, considering different relay selection criteria to optimize the system’s transmission performance. Three relay selection strategies are employed to enhance the system transmission performance. Specifically, the first strategy, optimal relay selection, aims to identify the relay that minimizes the latency and maximizes the data transmission reliability. The second approach, partial relay selection, focuses on selecting a subset of relays strategically to balance the system resources and achieve the latency reduction. The third strategy, random relay selection, explores the potential of opportunistic relay selection without prior knowledge. Through a rigorous investigation, our paper evaluates the impact of these relay selection criteria on the performance of relay-assisted edge computing systems. By assessing the system outage probability in relation to latency, we provide valuable insights into the trade-offs and advantages associated with each selection strategy. Our findings contribute to the design and optimization of reliable and efficient edge computing systems, with implications for various applications, including the IoT and intelligent data processing.

Bridging Software-Hardware for CXL Memory Disaggregation in Billion-Scale Nearest Neighbor Search

We propose CXL-ANNS , a software-hardware collaborative approach to enable scalable approximate nearest neighbor search (ANNS) services. To this end, we first disaggregate DRAM from the host via compute express link (CXL) and place all essential datasets into its memory pool. While this CXL memory pool allows ANNS to handle billion-point graphs without an accuracy loss, we observe that the search performance significantly degrades because of CXL’s far-memory-like characteristics. To address this, CXL-ANNS considers the node-level relationship and caches the neighbors in local memory, which are expected to visit most frequently. For the uncached nodes, CXL-ANNS prefetches a set of nodes most likely to visit soon by understanding the graph traversing behaviors of ANNS. CXL-ANNS is also aware of the architectural structures of the CXL interconnect network and lets different hardware components collaborate with each other for the search. Furthermore, it relaxes the execution dependency of neighbor search tasks and allows ANNS to utilize all hardware in the CXL network in parallel. Our evaluation shows that CXL-ANNS exhibits 93.3% lower query latency than state-of-the-art ANNS platforms that we tested. CXL-ANNS also outperforms an oracle ANNS system that has unlimited local DRAM capacity by 68.0%, in terms of latency.

Optimizing Internet of Things Fog Computing: Through Lyapunov-Based Long Short-Term Memory Particle Swarm Optimization Algorithm for Energy Consumption Optimization.

In the era of continuous development in Internet of Things (IoT) technology, smart services are penetrating various facets of societal life, leading to a growing demand for interconnected devices. Many contemporary devices are no longer mere data producers but also consumers of data. As a result, massive amounts of data are transmitted to the cloud, but the latency generated in edge-to-cloud communication is unacceptable for many tasks. In response to this, this paper introduces a novel contribution-a layered computing network built on the principles of fog computing, accompanied by a newly devised algorithm designed to optimize user tasks and allocate computing resources within rechargeable networks. The proposed algorithm, a synergy of Lyapunov-based, dynamic Long Short-Term Memory (LSTM) networks, and Particle Swarm Optimization (PSO), allows for predictive task allocation. The fog servers dynamically train LSTM networks to effectively forecast the data features of user tasks, facilitating proper unload decisions based on task priorities. In response to the challenge of slower hardware upgrades in edge devices compared to user demands, the algorithm optimizes the utilization of low-power devices and addresses performance limitations. Additionally, this paper considers the unique characteristics of rechargeable networks, where computing nodes acquire energy through charging. Utilizing Lyapunov functions for dynamic resource control enables nodes with abundant resources to maximize their potential, significantly reducing energy consumption and enhancing overall performance. The simulation results demonstrate that our algorithm surpasses traditional methods in terms of energy efficiency and resource allocation optimization. Despite the limitations of prediction accuracy in Fog Servers (FS), the proposed results significantly promote overall performance. The proposed approach improves the efficiency and the user experience of Internet of Things systems in terms of latency and energy consumption.

A Comparative Analysis of Cloud Computing and Fog Computing: Advancing Towards Edge Intelligence

Cloud computing has altered the method we hoard, process, and access data, permitting ascendable and on-demand computing resources. However, with the rise of Internet of Things (IoT) devices and the cumulative prerequisite for real-time data dispensation, the margins of cloud computing in terms of latency, bandwidth, and network mobbing have developed superficial. To address these tasks, fog computing has occurred as a delay of cloud computing, fetching computation closer to the network superiority. In this article, we delve into a comprehensive comparison of cloud, fog, and edge computing. Moreover, the article highlights the systematic shift towards edge computing, where intelligence is distributed across edge devices, gateways, and fog nodes. To facilitate accurate evaluations and analyses, we introduce two simulation tools: CloudSiM for cloud computing and iFogSim for fog computing. These tools provide researchers with realistic environments to simulate cloud and fog computing scenarios, enabling performance evaluation and optimization. Through these simulations, researchers can study critical system of measurement such as response time, energy consumption, and resource utilization.

Machine learning for effective EHR management in blockchain-cloud integration

<p>Machine learning (ML) techniques have gained prominence in effectively managing Electronic Health Record (EHR) systems within the context of blockchain-cloud integration. This study presents a hybrid Machine Learning approach that combines logistic regression (LR) and random forest (RF) techniques for EHR management, leveraging the data stored in a blockchain-cloud integrated system. The tamper-resistant nature of blockchain ensures the authenticity and security of the stored patient information, serving as a reliable source for learning. The proposed LR+RF model is evaluated against other algorithms, considering various performance metrics. The analysis reveals that the LR+RF model achieves an impressive accuracy rate of 98.37%, indicating its efficacy in accurately classifying EHR data and facilitating effective management. Furthermore, the study compares the performance of blockchain-cloud-based decentralized storage with blockchain-based storage and peer-to-peer storage in terms of latency and throughput. The results demonstrate that the blockchain-cloud integrated decentralized storage surpasses other storage methods, achieving an average throughput of 6.8 units and a latency of 4.7 units. These findings highlight the potential of the proposed LR+RF model for EHR management within a blockchain-cloud integrated environment. The use of blockchain as a secure storage environment ensures the integrity of patient information, while Machine Learning techniques enhance the accuracy of classification.</p>

Intelligent Edge-Cloud Framework for Water Quality Monitoring in Water Distribution System

Ensuring consistent high water quality is paramount in water management planning. This paper addresses this objective by proposing an intelligent edge-cloud framework for water quality monitoring within the water distribution system (WDS). Various scenarios—cloud computing, edge computing, and hybrid edge-cloud computing—are applied to identify the most effective platform for the proposed framework. The first scenario brings the analysis closer to the data generation point (at the edge). The second and third scenarios combine both edge and cloud platforms for optimised performance. In the third scenario, sensor data are directly sent to the cloud for analysis. The proposed framework is rigorously tested across these scenarios. The results reveal that edge computing (scenario 1) outperforms cloud computing in terms of latency, throughput, and packet delivery ratio obtaining 20.33 ms, 148 Kb/s, and 97.47%, respectively. Notably, collaboration between the edge and cloud enhances the accuracy of classification models with an accuracy of up to 94.43%, this improvement was achieved while maintaining the energy consumption rate at the lowest value. In conclusion, our study demonstrates the effectiveness of the proposed intelligent edge-cloud framework in optimising water quality monitoring, and the superior performance of edge computing, coupled with collaborative edge-cloud strategies, underscores the practical viability of this approach.

A machine learning access network selection in a heterogeneous wireless environment

AbstractIn the context of Heterogeneous Wireless Networks (HWN), achieving the best connectivity is crucial for users. With the availability of multiple Radio Access Technologies (RATs), users are constantly looking to be “Always Best Connected” (ABC) by connecting to the best possible RAT. This challenge is also important in Next‐Generation Networks (NGN), where researchers are proposing models and algorithms to make the ABC paradigm a reality. One such challenge is the network selection problem, which involves the automatic and transparent selection of the best RAT at a given time. Many papers in this field have used Multi‐Attribute Decision‐Making (MADM) methods, which have been implemented with various objectives such as increasing quality of service (QoS), reducing energy consumption and costs etc. This paper proposes a modified machine learning algorithm, specifically an adapted K‐means algorithm, to address this challenge. The results show that this proposal outperforms legacy MADM methods in terms of latency, jitter, packet loss, and data rate. So, the paper presents a new approach to network selection in HWN and NGN, and the results suggest that it could be a promising solution to this important challenge.

Q‐learning‐based task offloading strategy for satellite edge computing

SummaryIn this paper, we study the task offloading optimization problem in satellite edge computing environments to reduce the whole communication latency and energy consumption so as to enhance the offloading success rate. A three‐tier machine learning framework consisting of collaborative edge devices, edge data centers, and cloud data centers has been proposed to ensure an efficient task execution. To accomplish this goal, we also propose a Q‐learning‐based reinforcement learning offloading strategy in which both the time‐sensitive constraints and data requirements of the computation‐intensive tasks are taken into account. It enables various types of tasks to select the most suitable satellite nodes for the computing deployment. Simulation results show that our algorithm outperforms other baseline algorithms in terms of latency, energy consumption, and successful execution efficiency.

Multi-User Mobile Augmented Reality with ID-Aware Visual Interaction

Most existing multi-user Augmented Reality (AR) systems only support multiple co-located users to view a common set of virtual objects but lack the ability to enable each user to directly interact with other users appearing in his/her view. Such multi-user AR systems should be able to detect the human keypoints and estimate device poses (for identifying different users) in the meantime. However, due to the stringent low latency requirements and the intensive computation of the preceding two capabilities, previous research only enables either of the two capabilities for mobile devices even with the aid of the edge server. Integrating the two capabilities is promising but non-trivial in terms of latency, accuracy, and matching. To fill this gap, we propose DiTing to achieve real-time ID-aware multi-device visual interaction for multi-user AR applications, which contains three key innovations: Shared On-device Tracking to merge the similar computation for optimized latency, Tightly Coupled Dual Pipeline to enhance the accuracy of each task through mutual assistance, and Body Affinity Particle Filter to precisely match device poses with human bodies. We implement DiTing on four types of mobile AR devices and develop a multi-user AR game as a case study. Extensive experiments show that DiTing can provide high-quality human keypoint detection and pose estimation in real time (30fps) for ID-aware multi-device interaction and outperform the state-of-the-art baseline approaches.

Enabling Distributed and Optimal RDMA Resource Sharing in Large-Scale Data Center Networks: Modeling, Analysis, and Implementation

Remote Direct Memory Access (RDMA) suffers from unfairness issues and performance degradation when multiple applications share RDMA network resources. Hence, an efficient resource scheduling mechanism is urged to optimally allocates RDMA resources among applications. However, traditional Network Utility Maximization (NUM) based solutions are inadequate for RDMA due to three challenges: 1) The standard NUM-oriented algorithm cannot deal with coupling variables introduced by multiple dependent RDMA operations; 2) The stringent constraint of RDMA on-board resources complicates the standard NUM by bringing extra optimization dimensions; 3) Naively applying traditional algorithms for NUM suffers from scalability issues in solving a large-scale RDMA resource scheduling problem. In this paper, we present how to optimally share the RDMA resources in large-scale data center networks with a distributed manner. First, we propose Distributed RDMA NUM (DRUM) to model the RDMA resource scheduling problem as a new variation of the NUM problem. Second, we present distributed algorithms to efficiently solve the large-scale, interdependent RDMA resource sharing problem for different RDMA use cases. Through theoretical analysis, the convergence and parallelism of proposed algorithms are guaranteed. Finally, we implement the algorithms as a kernel-level indirection module in the real-world RDMA environment, so as to provide end-to-end resource sharing and performance guarantee. Through extensive evaluations by large-scale simulations and testbed experiments, we show that our method significantly improves applications’ performance under resource contention, achieving <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$1.7-3.1\times$</tex-math> </inline-formula> higher throughput, and in a dynamic context, the largest performance improvement reaches <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$98.1\%$</tex-math> </inline-formula> and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$64.1\%$</tex-math> </inline-formula> in terms of latency and throughput, respectively.

Performance comparison based on priority between 802.11p and C-V2X

With the increasing number of vehicles, the issue of traffic safety has become more and more prominent. There is a growing demand for real-time vehicle monitoring and vehicle-to-vehicle communication, which has led to the rapid development of connected car technology. Currently, the two mainstream wireless access technologies that support vehicle-to-everything (V2X) communication are Dedicated Short-Range Communications (DSRC) and Cellular-V2X (C-V2X) or LTE-V2X. This paper aims to compare the performance of these two technologies by studying two types of information, Cooperative Awareness Messages (CAM) and Decentralized Environmental Notification Messages (DENM), as well as the prioritization defined for C-V2X. Additionally, this paper compares the prioritization of 802.11p with different priority levels of C-V2X. Through simulation experiments, it is ultimately proven that 802.11p outperforms C-V2X in terms of latency but is inferior to C-V2X in terms of collision probability.

Tele-proctoring for minimally invasive surgery across Japan: Aninitial step toward a new approach to improving the disparity of surgical care and supporting surgical education.

The aim of this study was to verify the clinical feasibility of tele-proctoring using our ultra-low latency communication system with shared internet access. Connections between two multiple remote locations at various distances were established through the TELEPRO® tele-proctoring system. The server records the latency between the two locations for tele-proctoring using the annotations. Questionnaires were administered to the surgeons, assistants, and medical staff. Respondents rated the quickness and quality of communication in terms of latency and disturbances in the audio, video, and usefulness of the live telestrations with annotation. Seven hospitals tele-proctored with Sapporo Medical University between January 2021 and September 2022. The median latency of annotation between the two locations ranged from 24.5 to 48.5 ms. No major technological problems occurred, such as streaming interruption, loss of video or audio, poor resolution. The video encoding time was 10 ms, and its decoding time was 0.8 ms. The total latency positively correlated with the distance between two locations (R = 0.55, p < 0.01). The quality of communication regarding latency, disturbance, and surgical education with intraoperative annotative instructions showed similar trends, with perfectly fine being the most common response. No significant differences in surgical quality, educational effect, or social impact were observed between the latency ≥30 and <30 ms groups for whether the size of latency affects surgical education. The feasibility of the tele-proctoring system is expected to be a sustainable approach to help education for young surgeons and surgical supports in rural areas, thereby reducing disparities in health care.

Optimization of Energy Consumption in 5G Networks Using Learning Algorithms in Reinforcement Learning

The 5G network is an evolution of the 4G LTE (Long Term Evolution) fast internet network that is widely adopted in smart phones or gadgets. 5G networks offer faster wireless internet for various purposes. This research is a literature review of several articles related to machine learning, specifically regarding energy consumption optimization with 5G networks and reinforcement learning algorithms.The results show that various techniques have evolved to overcome the complexity of large energy intake including integration with 5G networks and algorithms have been completed by many researchers. Related to electricity consumption, it was found that during 5G use cases, in a low site visitor load scenario and while reducing power intake takes precedence over QoS, power savings can be made by 80% with 50 ms latency, 75% with 20 ms and 10 ms latency, and 20% with 1 ms latency. If QoS is prioritized, then power savings reach a maximum of five percent with minimum impact in terms of latency. Moreover, with regards to power performance, it has been observed that DQN-assisted motion can offer improvements.

A three-level slicing algorithm in a multi-slice multi-numerology context

Fifth generation (5G) mobile networks feature a new concept called Bandwidth Part (BWP) that permits applying various multiple Orthogonal Frequency-Division Multiplexing (OFDM) subcarrier spacing, also coined numerologies, in the same band. With flexible numerology, the sought-after purpose is achieving lower latency for the Ultra Reliable Low Latency Communications (URLLC) service. However, the lucrative multiple numerology gains might not stand because of the ensuing Inter-Numerology Interference (INI) problems. In this paper, we assess the feasibility, as well as the profitability, of multi-numerology in a multi-slice setting. In such a context, it is paramount to study the radio resource allocation problem at the Radio Access Network (RAN) level. To that aim, we propose a three-level slicing algorithm that efficiently selects the BWP serving the URLLC users from a set of BWPs using different numerologies, designs a guard band among these BWPs to reduce INI without wasting radio resources, and attributes a bandwidth to each slice depending on multiple parameters such as the users’ Key Performance Indicators (KPIs), channel conditions, INI, and the incurred monetary cost. This work considers the three 5G services, namely the enhanced Mobile BroadBand (eMBB) service, the URLLC service and the massive Machine-Type Communications (mMTC) service. The proposed algorithm combines various tools from Game Theory, Deep-Q learning Networks as well as savvy heuristics. The performance evaluation demonstrates the high efficiency of our solution in terms of latency and throughput compared to well-known approaches in the State-of-the-Art.

A scalable and lightweight group authentication framework for Internet of Medical Things using integrated blockchain and fog computing

The Internet of Medical Things (IoMT) is the network of medical devices, software applications, and healthcare information systems used for remote monitoring and delivery of healthcare services. Despite the several advantages of IoMT for today smart healthcare, security issues are growing due to the inadequate computation, limited storage and insufficient self-protection capabilities of IoMT devices. Authentication of IoMT devices is the main requirement to secure IoMT systems. Although, the recent authentication schemes based on tamper-proof decentralized architecture of blockchain technology are robust and enjoy a high level of security, yet they require high computation, more storage, and long authentication time. These issues lead to reduced scalability and time efficiency, which are necessary for large-scale, time-sensitive IoMT systems. To this end, this paper proposes a novel group authentication framework for IoMT Systems. The group authentication scheme is implemented through a four-phase process, including setup, registration, secret construction, and authentication. To enhance both efficiency and scalability, the proposed group authentication framework employs a combination of elliptic curve cryptography (ECC), Shamir’s secret sharing (SSS) algorithm, and blockchain-based fog computing technologies. We simulated the proposed framework through the Ethereum platform and Solidity language and its performance is evaluated using the Hyperledger Caliper tool. The simulation experiments of the proposed framework showed that the average latency of authenticating IoMT devices was 0.5 second and the throughput was 400 transactions per second. Our analysis of the proposed framework’s performance against other cutting-edge blockchain-based authentication techniques showed that it outperformed them in terms of latency and throughput. A security analysis of the proposed framework was conducted using the widely accepted Automated Validation of Internet Security Protocols and Applications (AVISPA) tool. The formal and informal security analysis demonstrated that the proposed framework is secure and resistant to potential authentication-related attacks. We also noted that the average latency of the proposed framework maintains a fairly narrow range when the number of submitted transactions rises, indicating that it supports the scalability of the IoMT system.

Discrete spider monkey optimization algorithm for latency‐sensitive VNF deployment and resource allocation

SummaryThe next‐generation networks are expected to support diverse latency‐sensitive services, that is, auto‐driving, telemedicine, and so on. Deploying these services in current hardware‐based networks faces significant challenges. The emergence of network function virtualization (NFV) and software defined network (SDN) makes network deployment flexible and agile. In order to meet the strict latency constraints, joint VNF deployment and resource allocation problems are needed. In this paper, we consider the resource‐delay interpendency and formulate the joint VNF deployment and resource allocation problems as linear programming (LP) problems. Discrete spider monkey optimization (DSMO) algorithm is proposed to solve this problem, which imitates spider monkeys' fission and fusion social behavior during foraging. The two‐phase decision update mechanism greatly increases the diversity of the spider monkey decision population and promotes the algorithm to perform a global search of the solution space. Evaluation results show that the proposed solutions achieve superior performance in terms of latency, CPU utilization and service acceptance rate.