Network Congestion Research Articles

Adaptive Random Early Detection Using Deep Reinforcement Learning for Enhanced Congestion Control in Dynamic TCP/IP Networks

AQM is used to meet targets for congestion control and low delay, high throughput in TCP/IP networks. But methods developed for AQM like Random Early Detection (RED) work strictly on the control parameters pre-set on them and thus may not respond very well to changing network conditions. Thus, this paper presents a composite AQM model using DRL based on DQN, and the ability to learn independently regarding the AQM weight parameter of the queue. The fact that DRL is adaptive means the effectiveness of the proposed system is also assured. As it is observed in implementing traditional model-based approach, the stability and performance degrade when tested in different network conditions; however, DRL’s ability to learn independently enables ML to solve network congestion as it happens. Consequently, more stability is achieved, the delay is lesser, more bandwidth is used and the overall packet drop rate is low; the proposed DRL-RED model is ideal for dynamic network environments. The proposed DRL-RED model is compared with the regular RED algorithm for both low density and high-density networks. This proposed model has achieved sustained throughput of up to 49.9 Mbps with 0.949 % reduction on delay and very low PLR of 8.38043%. From the comparative analysis, it is clear that the employment of DRL with RED improves the stock of network throughput, the reduction on packet drop frequency, and the general delay in network situations. There are two main disadvantages of this approach: first, it cannot reach the heavy-traffic, the problem partly solved by model-based approach; second, the values of the congestion-control parameters cannot be reset, an issue eradicated by DRL as a result of its inherent adaptiveness. Consequently, new stability and increased performance can be achieved under various network conditions.

GTBTL-IoT: An Approach of Curtailing Task Offloading Time for Improved Responsiveness in IoT-MEC Model

INTRODUCTION: The Internet of Things (IoT) has transformed daily life by interconnecting digital devices via integrated sensors, software, and connectivity. Although IoT devices excel at real-time data collection and decision-making, their performance on complex tasks is hindered by limited power, resources, and time. To address this, IoT is often combined with cloud computing (CC) to meet time-sensitive demands. However, the distance between IoT devices and cloud servers can result in latency issues. OBJECTIVES: To mitigate latency challenges, Mobile Edge Computing (MEC) is integrated with IoT. MEC offers cloud-like services through servers located near network edges and IoT devices, enhancing device responsiveness by reducing transmission and processing latency. This study aims to develop a solution to optimize task offloading in IoT-MEC environments, addressing challenges like latency, uneven workloads, and network congestion. METHODS: This research introduces the Game Theory-Based Task Latency (GTBTL-IoT) algorithm, a two-way task offloading approach employing Game Matching Theory and Data Partitioning Theory. Initially, the algorithm matches IoT devices with the nearest MEC server using game-matching theory. Subsequently, it splits the entire task into two halves and allocates them to both local and MEC servers for parallel computation, optimizing resource usage and workload balance. RESULTS: GTBTL-IoT outperforms existing algorithms, such as the Delay-Aware Online Workload Allocation (DAOWA) Algorithm, Fuzzy Algorithm (FA), and Dynamic Task Scheduling (DTS), by an average of 143.75 ms with a 5.5 s system deadline. Additionally, it significantly reduces task transmission, computation latency, and overall job offloading time by 59%. Evaluated in an ENIGMA-based simulation environment, GTBTL-IoT demonstrates its ability to compute requests in real-time with optimal resource usage, ensuring efficient and balanced task execution in the IoT-MEC paradigm. CONCLUSION: The Game Theory-Based Task Latency (GTBTL-IoT) algorithm presents a novel approach to optimize task offloading in IoT-MEC environments. By leveraging Game Matching Theory and Data Partitioning Theory, GTBTL-IoT effectively reduces latency, balances workloads, and optimizes resource usage. The algorithm's superior performance compared to existing methods underscores its potential to enhance the responsiveness and efficiency of IoT devices in real-world applications, ensuring seamless task execution in IoT-MEC systems.

Construction of a digital twin model for incremental aggregation of multi type load information in hybrid microgrids under integrity constraints

In the multi type load information of hybrid microgrids, data loss or incompleteness may occur due to network congestion, signal interference, equipment failures, and other reasons. Especially with the continuous generation of new load data, gradually incorporating these new data into the existing aggregation process to achieve continuous updating and optimization of load information. Therefore, this article proposes a digital twin model construction method for incremental aggregation of multi type load information in hybrid microgrids under integrity constraints. The Leida criterion and cubic exponential smoothing method are used to preprocess various load data of hybrid microgrids, remove abnormal data, reduce data fluctuations, and make the data more interpretable. Establish integrity constraints for multiple load data of hybrid microgrids and extract load characteristics of hybrid microgrids. Based on these, establish a digital twin model for the incremental aggregation of multiple load information in a hybrid microgrid, and solve the model using an improved K-means algorithm to achieve continuous updating and optimization of load information. The experimental results show that the data sharing delay of this method is 0.12 s, the load is basically consistent with the actual value, and the relative error of the load data is 4%.

Exploring the Impact of Resource Management Strategies on Simulated Edge Cloud Performance: An Experimental Study

Edge computing has emerged as a critical technology for meeting the needs of latency-sensitive applications and reducing network congestion. This goal is achieved mainly by distributing computational resources closer to end users and away from traditional data centers. Optimizing the utilization of limited edge cloud resources and improving the performance of edge computing systems requires efficient resource-management techniques. In this paper, we primarily discuss the use of simulation tools—EdgeSimPy in particular—to assess edge cloud resource management methods. We give a summary of the main difficulties in managing a limited pool of resources in edge cloud computing, and we go over how simulation programs like EdgeSimPy work and evaluate resource management algorithms. The scenarios we consider for this evaluation involve edge computing while taking into account variables like user location, resource availability, and network structure. We evaluate four resource management algorithms in a fixed, simulated edge computing environment to determine their performance regarding their CPU usage, memory usage, disk usage, power consumption, and latency performance metrics to determine which method performs better in a fixed scenario. This allows us to determine the optimal algorithm for tasks that prioritize minimal resource use, low latency, or a combination of the two. Furthermore, we outline areas of unfilled research needs and potential paths forward for improving the reliability and realism of edge cloud simulation tools.

Hybrid Optimization With Deep Spiking Equilibrium Neural Network for Software Defined Network Based Congestion Prevention Routing

ABSTRACTIn the Internet of Things (IoT) network, within a period of time it constructs a huge network of millions and billions of things that incorporate with each other, leading to various technical and application problems. Also, on‐time delivery of packets is significant in software‐defined networks. In the current software‐defined network, the bandwidth overhead is not considered when an enormous amount of traffic enters the network; this may lead to network congestion. To overcome this issue, a novel method is proposed to detect network congestion based on hybrid optimization, namely, the Hybrid Gannet with Pelican Optimization (HGPO) algorithm. The node‐level congestions and the link‐level congestions, which means the buffer overflow and the multiple nodes trying to utilize the channel at the same time, must be controlled efficiently. Once the network congestion gets controlled, the shortest route path selection and congestion prevention are performed perfectly with the aid of the proposed Deep Spiking Equilibrium Neural Network (DSENN). A few route discovery frequency vectors, such as the interroute discovery time and route discovery time of each node, are determined to prevent congestion. Finally, it is implemented in the Python platform successfully, and the achieved throughput, delay, packet loss ratio, packet delivery ratio, end‐to‐end delay, and performance measures of the proposed method are 140 Mbit/s, 17 ms, 3.8%, 0.35 s, and 100%, respectively, which outperforms the other compared traditional algorithms.

Flexible electricity market clearing zones

Zonal markets and nodal pricing are the dominant designs for liberalized electricity markets. We propose an alternative design that changes zones in each bidding period according to the estimated most efficient dispatch. These flexible electricity market clearing zones consider the grid’s physical constraints to a larger degree than zonal markets but maintain their bidding simplicity and few price areas. We propose a proof-of-concept framework for flexible electricity market clearing zones, including a method to enumerate all zonal configurations. We illustrate the performance of this framework on a case study in the Nordic countries using flow-based market clearing (FBMC), considering a model for the day-ahead market and a real-time balancing market. Our results suggest that flexible electricity market clearing zones on sequential day-ahead and real-time balancing markets achieve costs slightly above nodal stochastic clearing. But, contrary to stochastic clearing, it can guarantee short-term revenue adequacy and cost recovery. Moreover, the flexible market design increases day-ahead market price levels and price variability at the nodal level, particularly in scenarios with high renewable generation, demonstrating its capacity to align price signals with network congestion and real-time supply conditions. Flexible electricity market clearing zones can thus facilitate the integration of renewables by enhancing system adaptability and promoting more efficient resource allocation.

Adaptive Congestion Control in IoT Networks: Leveraging One-Way Delay for Enhanced Performance

With the exploding number of IoT devices generating vast data volumes, there is a growing risk of significant performance degradation without efficient congestion management. To tackle this challenge, efficient regulation and supervision are essential for managing congestion in IoT networks. This research work introduces a One-Way-Delay (OWD)-based congestion control (CC) method that estimates data transmission delays of the communication path and adjusts network traffic accordingly. The proposed method enhances IoT device performance by continuously monitoring OWD along the transmission path to identify and mitigate congestion. Comparative analysis with existing methods demonstrates that the proposed approach more effectively utilizes network resources, reduces congestion, and improves throughput while ensuring fairness and reliability within the IoT infrastructure. The experimental simulations show that the proposed OWD-based method outperforms well-established TCP variants such as BBR, TCP Cubic, HTCP, and New Reno, achieving average throughput improvements ranging from 4.1% to 22.7%. The proposed method also maintains fairness in mixed-traffic environments and effectively manages congestion in complex network topologies.

A Blockchain based Secure Authentication Technique for Ensuring User Privacy in Edge Based Smart City Networks

In the past decade, modernization of Information and Communication Technology (ICT), Edge Computing (EC), and Smart Cities has attracted significant academic interest due to its diverse applications in the fields of healthcare, transportation, agriculture, and defense. EC offers numerous advantages, including faster and more efficient services, lower latency, improved data processing, managed bandwidth consumption, scalable, real-time decision-making, security, reduced network congestion, and increased resilience. Despite these benefits, EC networks face persistent challenges, particularly related to security and privacy concerns. Addressing these security challenges requires strong authentication mechanisms, which demand extra resources like processing power and memory, often surpassing the limited capabilities of lightweight edge devices compared to cloud systems. This highlights the critical need for securing edge nodes and ensuring user privacy before real-world deployment and data transfer. User and edge device authentication is vital to prevent external and internal Impersonation and Reflection attacks that threaten system integrity and confidentiality. This paper presents a BlockChain based Authentication technique for Edge Networks (BCAuthEN) that utilizes a Consortium Blockchain (CB) with key agreements for biometric authentication, incorporating a Fuzzy Extractor (FE) to secure user biometrics and passwords. In addition, BCAuthEN offers multifactor and continuous authentication by monitoring user behavior and biometrics. BCAuthEN has been formally verified through Real-Or-Random (RoR) modeling and AVISPA tool, proving its effectiveness in enhancing privacy, and security. The proposed technique ensures robust security by preventing attackers at the potential entry points (edge nodes). In addition, BCAuthEN reduces computation cost, communication overhead and improves throughput. BCAuthEN provides strong resilience by achieving high detection accuracy and reduces false positives against impersonation and reflection attacks. Results have shown that BCAuthEN improves communication costs and reduces overhead by 10% and 7%, respectively, as compared to the recent biometric and key-based user authentication techniques.

Eliminating Distribution Network Congestion Based on Spatial-Temporal Migration of Multiple Base Stations

Eliminating Distribution Network Congestion Based on Spatial-Temporal Migration of Multiple Base Stations

End-to-end latency upper bounds and service chain deployment algorithm based on industrial internet network

The diverse service requests in industrial Internet networks require flexible and efficient service chain deployment to ensure the quality of service (QoS). However, current deployment algorithms for service chains are primarily designed to guarantee only low end-to-end latency; they often overlook the amount of service chains that can be accommodated by the network and could lead to severe network load imbalances, significantly reducing service efficiency and causing serious network congestion issues. To address the above issues, we develop a mathematical model of the network topology and service request chains by integrating Network Function Virtualization (NFV) and Software Defined Networking (SDN). Utilizing network calculus theory, we derive the upper bound of end-to-end delay for service chain routing and analyzed the relationship between the upper bound of service chain routing delay and the resource allocation of Virtual Network Function (VNF) nodes. Based on the aforementioned model, we propose a novel service chain deployment algorithm named the Delay-Aware Load-Balanced Routing Algorithm (DLBRA). DLBRA comprehensively considers network traffic load balancing and end-to-end latency of service chains, rationally allocating VNF node resources to complete the determined service chain routing deployment. Experimental results indicate that, compared to the shortest path and load balancing algorithms, DLBRA not only ensures that the end-to-end delay of the service chain meets its QoS requirements, but also effectively reduces network load imbalance, significantly increasing the number of service chain requests that the network can accommodate. Additionally, DLBRA provides tailored deployment guidance for different types of service chains, such as latency-sensitive and data-intensive service chains, ensuring optimal utilization of network resources. This algorithm enhances the efficiency of service chain deployment in industrial internet scenarios and possesses broad application potential in other network environments where delay optimization and load balancing are critical, such as intelligent transportation, cloud computing, and 5G networks.

SERAV Deep-MAD: Deep Learning-Based Security–Reliability–Availability Aware Multiple D2D Environment

The tremendous growth of internet-connected devices can lead to network congestion, making it essential to incorporate new technologies to optimize performance. Thus, Device to Device(D2D) communication has been deemed as an emerging technology that can be used to communicate efficiently. However, establishing a secure and reliable mechanism for Device-to-Device (D2D) communication that ensures security, reliability, and availability poses a significant challenge. To tackle these issues a novel deep learning-based security-reliability-availability aware multiple D2D environment (SERAV Deep-MAD) has been proposed for Secure D-2-D Communication in a Fog environment. The proposed method utilizes a Fully Homomorphic Quantum Diffie Hellman Encryption (FHQDHE) to secure the data while transmitting. The proposed method utilizes the novel secure Quantum Diffie Hellman key exchange (QDHKE) technique for sharing the key to transform the plain data into cipher data, then applies FH operations on the encrypted data before transferring it to the Fog environment. Whenever a client requests data from the Fog, the Fog provider verifies the client's access rights. Moreover, the Attention-based Bi-GRU model is utilized to categorize whether the device is non-attack or attack, if the data is attacked then the proposed model classifies multiple attacks. The NS2 Simulator is used to verify and validate the proposed SERAV Deep-MAD model, and resiliency analysis is done to assess performance. The proposed techniques attain a higher accuracy of 98.18% which is 1.58%, 2.02%, and 2.41% better than MECC, MIMO, andAAKA-D2D respectively.

Advanced Beamforming and Multi‐Access Edge Computing: Empowering Ultra‐Reliable and Low‐Latency Applications in 6G Networks

ABSTRACT6G technology is expected to transform communications by allowing the Internet of Everything, representing a huge advance in 2030. While B5G has not yet been established, various nations are actively working on 5G, but certain research groups are presently devoting their attention to the creation of 6G technologies. The upcoming 6G networks promise higher quality of service (QoS) features, including virtual reality and holographic communications. Multi‐Access Edge Computing (MEC) and, in particular, the offloading idea are key components of 6G innovation that enable resource‐intensive application design. If the wireless link used for computational offloading is inefficient, MEC's true potential can be impeded. Intelligent beamforming and MEC have garnered attention recently. Systematically optimizing the wireless communication environment, these developments improve connectivity between user equipment (UE) and base station (BS). By increasing the electrical charge of the reflectable signal, intelligent beamforming increases the range and efficacy of Back Communication. Particularly, this study assesses how well the MEC structure performs in urban microcellular settings when intelligent beamforming is used in communications. It has been demonstrated that the use of Intelligent Reflecting Surfaces (IRS) greatly reduces spectrum and energy usage. This study's results are implemented in Python software. Our suggested strategy shows better latency compared to other optimization methods and shorter task completion times than traditional methods. When compared to conventional techniques, the suggested MEC‐enabled network showcasing lower latency (4.9 ms) and efficient network congestion management and task completion time (30 ms) demonstrates a significant performance. These results highlight how intelligent beamforming and MEC have a lot of potential to shape the architecture of 6G networks in the future.

Navigating electricity network congestion: An examination of a principle‐based regulatory theory and strategy

AbstractThe digitisation of the energy sector is moving fast. At the same time, the transition to renewable energy brings challenges. However, legislative developments either move slowly or are introduced in a piecemeal manner. This situation is sometimes perceived as a regulatory mismatch and is problematic from the perspective of achieving climate and sustainability goals. The limited capacity of energy grids to transport electricity is a prime example of why we need a regulatory system that takes into account the fast‐paced development of technology while providing a consistent pathway for the future. In this contribution, we build on the scholarship that identifies energy principles. We analyse the extent to which principles play a role in new energy regulation and in Dutch mitigatory policies. As a theoretical framework for explaining the crucial role of principles in regulation, we use Fleming's normative proposal of the trias of energy regulation.

The Evolution of Edge Computing in a Data-Driven World

Edge computing is revolutionizing data processing and storage by bringing computational and data storage facilities closer to the data sources. This technique tackles the challenges faced by conventional clouds such as high latency and network congestion by employing the concept of data processed at the edge of the network in real-time. This paper discusses the edge computing paradigm and its evolution by covering the relevant concepts, benefits and trends that are changing within various industries. In particular, we assess the factors that make edge computing beneficial in terms of security, performance and efficiency concerns in smart cities, self-driving cars and internet of things (IoT) industries. This paper also reviews and reflects on the challenges of edge computing in terms of security, interoperability and scalability issues and how it can be overcome by integrating edge computing with fog computing, 5G and artificial intelligence (AI).

Mitigating power grid impact from proactive data center workload shifts: A coordinated scheduling strategy integrating synergistic traffic - data - power networks

The widespread adoption of cloud computing has markedly escalated the demand for Internet services, rendering Internet Data Centers (IDCs) a critical component in the consideration for demand response (DR) initiatives and grid energy management. This work proposes a flexible scheduling strategy integrating data, traffic, and power networks (DN-TN-PN) to mitigate the impact of proactive IDC workload transfers on power system balance. The spatial-temporal transfer characteristics of EV charging and discharging loads are utilized to track the proactive spatial-temporal transfer of IDC workloads. Considering the influence of weather factors and traffic congestion on EV travel time, an incentive pricing model for EV users is introduced to alleviate bus load fluctuation and line congestion in the distribution network. Numerical simulations demonstrate that the proposed EV pricing strategy, which accounts for the coupled DN-TN-PN, reduces IDC-induced load fluctuations by over 20 % and decreases transmission line occupancy by approximately 15 %, opening up more opportunities for the implementation of DR programs.

Dynamic clustering based risk aware congestion control technique for vehicular network

In order to improve road safety and offer extra services to cars and their users, vehicular ad hoc networks, or VANETs, are essential parts of intelligent transportation systems (ITS). The primary aim of this research is to suggest and assess a new approach for mitigating network congestion in VANET technology through the implementation of dynamic grouping of vehicles for safety (DGVS). To do this, virtual regions are created around cars using the DBSCAN and K Mean method. This allows vehicles to communicate directly with others within the same DGVS, eliminating the need to broadcast messages across the entire network.The ultimate goal is to drastically decrease traffic while preserving vital data transfer for VANET traffic control and safety. The suggested technique determines the optimal transmission rate in accordance with the existing channel circumstances, yielding a balanced performance concerning both packet delivery and channel congestion. With this novel method, cars may only talk to other vehicles that are in the same DGVS, thus there’s no need to broadcast messages to the whole network. With the use of this technique, the efficacy of DGVS in reducing VANET congestion and enhancing network performance will be thoroughly assessed. The study’s conclusions demonstrate how well the suggested dynamic grouping of vehicles for safety (DGVS) technique works to reduce VANET congestion. It was shown through simulation-based studies that, in comparison to current approaches, DGVS dramatically decrease network congestion, resulting in notable gains in network performance and decreased communication delay. Additionally, the study found a number of possible uses for DGVS in the transportation industry, such as emergency response, traffic management, and accident prevention.

Performance Analysis of Multi-Core Systems in Multistage Interconnection Networks: Investigating Challenges in Inter-Processor Communication

For high-performance computers and data-heavy apps, how well multi-core systems work in multistage interconnection networks (MINs) is very important. As the need for parallel processing grows, inter-processor communication (IPC) has become a major issue that affects both the speed of work and the ability of the system to grow. This essay looks into the problems with IPC in multi-core systems set up with MINs, mainly delay, bandwidth limits, and network congestion. imulation-based performance review is used to test multi-core systems with different amounts of traffic, message sizes, and route techniques. A mix of mathematical models and simulation tools are used to test different MIN designs on measures like delay, speed, and fault tolerance. It is also looked at how network structures and methods for controlling crowding affect IPC efficiency. According to the results, MINs can be used to connect multiple devices, but when there is a lot of traffic, the delay goes up a lot because of bottlenecks in some parts of the network. Also, in higher-dimensional networks, processors fighting over bandwidth causes speed to drop. Some of these problems can be solved with optimized transport methods and adaptable congestion control systems, which also make IPC work better overall. This study shows how important it is to keep improving how processors talk to each other in multi-core systems, especially when it comes to making network switching and managing congestion more efficient.

Bandwidth Management with Mikrotik OS Routers Using the Per Connection Queue Method

Services that use the Internet as Business Cafe, Online Games, education, defense and security, online businesses, e-mail service providers, and others will experience barriers in carrying out their activities. Often problems arise in internet service providers are setting up or managing broadband. The implementation of broadband management is aimed at optimizing the bandwidth available to provide broadband guarantees for Internet users, such as network congestion (through traffic) and unstable broadband received by Internet service providers (ISPs). Bandwidth management in Mikrotik with the PCQ (Per Connection Queue) method, basically, uses queue methods for the bandwidth balance used on multiple clients. The main purpose of this method is to automatically and unevenly share bandwidth sharing, with a simple turn-line if only one subscriber actively uses another temporary bandwidth will be in the standby position, then the subscriber can use maximum bandwidth which is available, but if another customer is active, then the maximum bandwidth can be used by both customers who have maximum width / 2, if there are subscribers at the same time active, each will receive the maximum bandwidth allowance / all clients, so will not be a fair wide-ranging distribution for all customers.

TCP Congestion Management Using Deep Reinforcement Trained Agent for RED

ABSTRACTIncreasing data transmission volumes are causing more frequent and more severe network congestion. In order to handle spikes in network traffic, a substantially bigger buffer has been included into the system. Bufferbloat, which happens when a bigger buffer is implemented, exacerbates network congestion. Using the transfer control protocol (TCP) congestion management strategy with active queue management (AQM) can fix this issue. As congestion increases, it becomes increasingly difficult to forecast and fine‐tune dynamic AQM/TCP systems in order to achieve acceptable performance. To shed new light on the AQM system, we plan to use deep reinforcement learning (DRL) techniques. It is possible that AQM can learn about the appropriate drop policy the same way people do when using a model‐free technique like DRL‐AQM. After training in a simple network scenario, DRL‐AQM is able to recognize complex patterns in the data traffic model and apply them to improve performance in a wide variety of scenarios. Offline training precedes deployment in our approach. In many cases, the model does not require any further parameter tweaks after training. Even in the most complicated networks, AQM algorithms have proven to be effective, regardless of the network's complexity. Minimizing buffer capacity use is an important goal of DRL‐AQM. It automatically and continually adjusts to changes in network connectivity.

Comparative Analysis of Different Transport Layer Protocol Techniques Incognitive Network

Most of the networks employ TCP protocol for transmission control in transport mechanism. Although it offers numerous services such as reliability, end-to-end delivery, secure transmission of data, and so on to applications functioning across the World Wide Web, TCP needs to have effective congestion management techniques in order to handle traffic with a lot of data. Still, TCP have poor performance during data transmission in the network. The network community continues conducting research to develop a method that should provide a fair and effective transmission bandwidth distribution. Numerous congestion control strategies have been developed based on previous research in this area. This work discusses, identifies, compares, and analyses the behaviour of a few network congestion control strategies to determine their benefits and limitations. The widely known network simulator ns2 is employed for the simulation. The performance metrics for QTCP, TCP new Reno, TCP- Hybla, L-TCP and RL-TCP are throughput, average delay, PDR, packet loss, average jitter, latency and fairness are considered. The RL-TCP exhibits superior performance in multiple measures when it is compared to alternative TCP protocols, as indicated by simulation results. These metrics encompass throughput, average delay, packet delivery ratio (PDR), packet loss, jitter, latency, and fairness. Furthermore, several TCP protocols, such as L-TCP, TCP-Hybla, QTCP, and TCP-New Reno, have undergone evaluation, uncovering disparities in their individual performance attributes. Nevertheless, the RL-TCP regularly demonstrates superior performance in all aspects.