Effective Congestion Control Research Articles

TCP BBR-n interplay with modern AQM in Wireless-N/AC networks: Quest for the golden pair.

Effective congestion control on the internet has been a problem since its inception. Transmission Control Protocol (TCP), being the most widely used transport layer protocol tries to mitigate it using a variety of congestion control algorithms. Cubic, Reno, and Bottleneck Bandwidth and Round-trip propagation time (BBR) are the most deployed congestion controls. BBR v2 is leading the congestion control race with its superior performance in terms of better throughput and lower latency. Furthermore, Active Queue Management (AQM) algorithms try to mitigate the congestion control at the network layer through active buffer control to avoid bufferbloat. The most efficient congestion control occurs when TCP and AQM work together. Indeed, it is the TCP-AQM algorithm "Golden pair" that can result in the most efficient performance. This paper proposes such a novel pair based on our previously tested and published BBR-n (BBR new) with the most effective of the modern AQMs, that completely gels together to provide lower latency in wireless networks based on Wireless N/AC. Real-time experiments were performed using Flent on our physical testbed with BBR-n and modern AQMs such as Fair Queuing (FQ), Constrained Delay (CoDel), Proportional Integral controller Enhanced (PIE), Common Applications Kept Enhanced (Cake) and Flow Queuing Controlled Delay (FQ_CoDel). Various tests done on our physical testbed helped us identify CAKE as the most optimum AQM that fits with our proposed BBR-n while providing optimum throughput and lower latency in 802.11N/AC-based wireless networks.

Performance evaluation of the congestion severity aware rate regulation (CSRR) algorithm in wireless body area networks

SummaryWireless body area network (WBAN) is a potential low‐cost technology for privacy‐sensitive telemedicine and e‐health monitoring and services. However, it faces limited protocol and physical resource support challenges, which can result in packet transfer difficulties. In particular, WBAN requires an emergency‐aware technology that ensures a promising quality of service (QoS). One significant issue affecting QoS and energy efficiency in WBAN is congestion. Effective congestion control techniques are essential for achieving proper load balancing. To address these challenges, we propose a congestion severity aware rate control (CSRR) algorithm that enhances packet transmission rate by reducing packet losses and retransmissions. The CSRR algorithm incorporates a fuzzy controller to predict congestion rates based on runtime metrics. To regulate congestion window growth in different algorithm phases, we introduce sequences such as the Fibonacci retracement sequence, knight's move sequence, and the binary logarithm of the primorial sequence to regulate congestion window growth in the different phases of the proposed algorithm. We mathematically analyze the proposed CSRR algorithm using a Markov model. The simulation results demonstrate the superiority of our algorithm compared to existing approaches. Specifically, our algorithm achieves significant optimizations in terms of throughput (52.92%), packet loss (38.11%), delay (37.23%), and remaining energy (36.86%) when compared to existing algorithms.

Efficient fuzzy methodology for congestion control in wireless sensor networks

In wireless sensor networks (WSNs), ensuring reliable and efficient communication between nodes requires effective congestion control. This study presents an innovative approach, called FSFG, which combines FCM fuzzy clustering, Fuzzy Inference System (FIS), Support Vector Regression (SVR), and Genetic Algorithm (GA) to address congestion in WSNs. FSFG consists of two phases: Structure Identification and Parameter Identification. In the first phase, fuzzy clustering techniques are employed to determine the desirability of outputs in different classes. Subsequently, support vector regressions are used to determine membership functions with a minimal error rate. In the parameter identification phase, the obtained rules from the FCM method are used to design the desired system, enabling the estimation of necessary outputs based on relevant inputs. Through simulations, the results demonstrate that the FSFG algorithm excels in congestion control, exhibiting a lower error rate and outperforming other algorithms in terms of delay and packet delivery rate.

A fuzzy logic and cross-layered optimization for effective congestion control in wireless sensor networks to improve efficiency and performance

Wireless Sensor Networks (WSNs) are a fundamental component of the Internet of Things (IoT), used in diverse applications to detect environmental conditions and send information to the Internet. WSNs are susceptible to congestion issues, leading to increased packet loss, extended delays, and reduced throughput. This research introduces a Fuzzy Logic-based Cross-Layered Optimization Model (FL-CLOM) for WSNs to tackle the problem. FL-CLOM is developed by including the signal-to-noise ratio of the wireless channels in the Transmission Control Protocol (TCP) approach, bridging the transmission layer and Media Access Control (MAC) layer. A fuzzy logic system is created by integrating fuzzy control with congestion control to dynamically manage the queue size in crowded nodes and minimize the effects of external uncertainties. Various simulations were conducted using MATLAB and NS-2.34 to compare the suggested FL-CLOM to conventional methods. The results indicate that FL-CLOM efficiently adjusts to queue size changes and demonstrates rapid convergence, reduced average delay, reduced packet loss, and increased throughput.

A Single-Rate Multicast Congestion Control (SRMCC) Mechanism in Information-Centric Networking

Information-centric networking (ICN) is expected to be a candidate for future internet architecture, and it supports features such as multicast that improves bandwidth utilization and transmission efficiency. However, multicast itself does not provide congestion control. When multiple multicast groups coexist, multicast traffic may exhaust all network resources, and cause network congestion and packet loss. Additionally, traditional IP multicast congestion control mechanisms cannot be directly applied to ICN architecture. Therefore, it is necessary to consider an effective congestion control mechanism for ICN multicast. This paper proposes a single-rate multicast congestion control mechanism, called SRMCC. It supports router-assisted awareness of the network congestion state and congestion control message aggregation. Moreover, the fair shared rate estimation method is innovatively proposed to achieve protocol fairness. Most importantly, it adjusts the rate according to different congestion states indicated by the queue occupancy ratio. By introducing a rate selection factor, it can achieve a balance between packet loss rate and throughput. Experimental results show that our proposal outperforms other mechanisms in throughput, packet loss rate, total bandwidth utilization, and overhead, and achieves protocol fairness and better TCP friendliness.

NETWORK CONGESTION PREDICTION USING CLASSIFICATION

Network congestion is a situation that happens when a network is un- able to handle data is more than its threshold value when load becomes high. This situation is known to be network congestion which causes packets to be dropped on the network due to overflow of buffer and therefore leads to data loss and unreliable connection. Therefore, effective congestion control is an important is- sue that needs to be addressed in the transport layer. There are various factors such as hardware, software and miscellaneous factors can lead to network con- gestion. Hardware factors include noncompatible hardware, outdated routers and too many devices connecting to a single router. Software factors include some of the devices following their own protocol, ineffective communication protocols, improper fire walls and proper limitations not defined on the file sizes to be transferred. Poor network design, network hacking and over subscription leads to the miscellaneous factors. As a consequence of such factors, network performance will degrade dramatically, and system performance will be affected. This is an undesirable condition that needs to be corrected. Thus, our model uses classification algorithms which help in predicting network congestion before- hand, thuspreventing the packet loss and damage.

A caching‐enabled light control scheme for aerobics video

The video transmission traffic has account for 60% Internet traffic, and how to optimize the video transmission efficiency has become a major challenge. Especially, the aerobics video is strongly subjected to both temporal locality and spatial locality, and the related contents are also dynamically changeable with the precise and complex movements. Thus, in the age of multimedia, the transmission optimization of aerobics video has the considerable research value. In this paper, a transmission control scheme for aerobics video is proposed. This scheme has the light feature, which is embodied by one heuristic video compression method. Then, this paper realizes the effective congestion control based on the adaptive rate design. Meanwhile, video compression and congestion control are performed in the simultaneous way, and they are completed by using the explored in‐network cache. Given this, the simple cache allocation method is presented at last. Two baselines are compared by evaluating packet loss rate, transmission time and delay jitter, and the experiment results demonstrate the efficiency of the proposed transmission scheme.

An effective congestion control scheme based on early offload for space delay/disruption tolerant network

The storage resources and communication resources of spatial network nodes are generally very limited, and they have the characteristics of large time delay and cannot guarantee the existence of end-to-end path all the time. Messages may reside in the intermediate nodes for a long time, which makes the congestion of spatial network inevitable and leads to the decline of network performance. In order to solve this problem, an effective congestion control scheme for space delay/disruption networks based on early unloading is proposed. In this scheme, the change rate of node cache is monitored at all times, and measures are taken in advance when congestion is about to occur, so that messages are transmitted through the non-optimal path prior to the optimal path, so as to alleviate the node storage pressure. Simulation results indicate that the presented scheme can achieve higher success rate of message delivery and more uniform network traffic distribution.

An effective congestion control scheme based on early offload for space delay/disruption tolerant network

An effective congestion control scheme based on early offload for space delay/disruption tolerant network

Multi-Objective Control Optimization for Congestion Avoidance in Computer Networks

Effective congestion control is an issue strongly impacting basic features demanded from modern network environment as reliability, high and stable throughput, and low delays. These characteristics define the quality of communication channels. Optimizing network nodes configuration for only one of mentioned features, can exacerbate other parameters. This paper focuses on avoiding and alleviating network congestions using multi-objective optimization for gain setting of used controllers. Unlike in other presented approaches, in this case the non-stationary, discrete, dynamical model is discussed. The significant advantage of this approach is in the better reflection of the real environment conditions, where the transmission delay is floating. As the further development of the control strategy, the controller with the memory of previous steps have been deployed. Such control strategy mitigates the unfavorable impact of extended delays. Both proposed control strategies tune the presented model of communication channel to alleviate the results of sudden, unexpected network state changes. It is obtained by maximization of available bandwidth usage combined with minimization of buffer utilization. This supports avoiding undesirable congestion effects like packet dropping, retransmissions, high delay, and low network throughput.

An Effective Congestion Control Algorithm based on Traffic Assignment and Reassignment in Wireless Sensor Network

Background: It is important to improve the quality of service by using congestion detection technology to find the potential congestion as early as possible in wireless sensor network. Methods: So an improved congestion control scheme based on traffic assignment and reassignment algorithm is proposed for congestion avoidance, detection and mitigation. The congestion area of the network is detected by predicting and setting threshold. When the congestion occurs, sensor nodes can be recovery quickly from congestion by adopting reasonable method of traffic reassignment. And the method can ensure the data in the congestion areas can be transferred to noncongestion areas as soon as possible. Results: The simulation results indicate that the proposed scheme can reduce the number of loss packets, improve the throughput, stabilize the average transmission rate of source node and reduce the end-to-end delay. Conclusion: : So the proposed scheme can enhance the overall performance of the network. Keywords: wireless sensor network; congestion control; congestion detection; congestion mitigation; traffic assignment; traffic reassignment.

An Effective Congestion Control Scheme for MANET with Relative Traffic Link Matrix Routing

In mobile ad hoc networks (MANETs), obstacle happens owing to the loss of packet, which could be effectively minimized by linking congestion control schemes (comprising of routing methods) and control inflow at the network layer. Here, we propose a link matrix technique for MANETs that minimizes congestion links based on the range before the distortion level of each selected transmission node to get better system ability. The effectiveness of the chosen traffic matrix technique is analyzed by comparing its performance with Capacity Optimized COoperative communication (COCO). Experiments suggest that the traffic matrix technique significantly improves the accuracy to derive traffic patterns in MANETs. The simulation results proved that the proposed method is performed well compared to the COCO method in terms of throughput (41%), delay (28%), energy (60%), overhead (48%) and packet delivery ratio (5%).

An Effective Congestion Control Approach through Route Delay Estimation Using Packet Loss in Wireless Sensor Network

In wireless sensor networks, congestion control and efficient routing are in much needed due to the increase in the usage of sensor devices in the diverse applications. Even in the randomness in the mobility of the devices creates dynamic topology which causes delay or packet loss in routing. The occurrence of congestion mostly due to the high volume of traffic inflow and low outflow of the data rate. This change in transmission rate results in routing delays and reduced throughput. The rate control is the major concern in applications performing regular streaming, particularly in wireless networks. This paper aims to propose an efficient Congestion Control approach through Route Delay Estimation (CC-RDE) using packet loss to control data rate for effective to minimize the packet loss during congestion. The CC-RDE mechanism will present an illustration for Delay Recognition (DR) and a method for Routing Delay Estimation (RDE) to improve the throughput and reduce the routing delay. The experiment evaluation is performed over a reactive routing protocol to improvise the throughput and reduce delay and energy consumption in comparison with other protocols.

TCP-NCL: A serialized-timer approach for enhancing TCP over heterogeneous wired/wireless networks

In heterogeneous wired/wireless networks, TCP performs unsatisfactorily since packet reordering and non-congestive losses may be falsely interpreted as congestive losses. This causes TCP to trigger fast retransmission and fast recovery spuriously, leading to under-utilization of available network resources. In this paper, we have developed a smart TCP sender (STS) model to differentiate congestive issues from the non-congestive ones for constructing more reliable signals of packet loss and network congestion over general error-prone channels. Two serialized timers are employed so that their expirations offer two separate signals of a packet loss and network congestion. The first timer is started when a packet is first injected into the network, and it will be cancelled if the acknowledgement is received. Otherwise, the packet will be retransmitted and the second timer is started upon the expiration of the first timer. The STS model is constructed based on the concept of minimizing expected cost and optimal setting of expiration periods for timer is determined. We have devised a novel TCP variant, known as TCP for non-congestive loss (TCP-NCL), as a practical approximation of the STS model. TCP-NCL can thus serve as a unified solution for effective congestion control, sequencing control, and loss recovery over wireless networks. The deployment of TCP-NCL requires modifications to sender-side TCP only, thereby facilitating possible future wide deployment. Our simulation studies show that TCP-NCL is robust against packet reordering as well as non-congestive packet loss while maintaining good responsiveness against congestive loss.

Simulation Modeling and Performance Comparison of RED and ERED Algorithms using Congestion Indicators

Random early detection (RED) is an effective congestion control mechanism acting on the intermediate gateways. The gateway detects and controlling packet dropping function with average queue size. The gateway could notify contacts of congestion either by simply dropping packets arriving in the gateway or simply by setting a bit within packet headers. When the average queue size surpasses a preset threshold, the gateway drops or represents each arriving packet along with a certain probability, where exact probability is a function of the average queue size. In this study describe a new active queue management scheme, Effective RED (ERED) that aims to reduce packet loss rates in a simple and scalable manner. I made a few changes to the packet drop function of the existing RED scheme. The rest of the original RED remains unchanged. In this study, the Simulations demonstrate that ERED achieves a highest throughput and lowest packet drops than RED. ERED is fully compatible with RED, can easily upgrade/replace the existing RED implementations by ERED.

Dynamic Traffic Scheduling and Congestion Control across Data Centers Based on SDN

Software-defined Networking (SDN) and Data Center Network (DCN) are receiving considerable attention and eliciting widespread interest from both academia and industry. When the traditionally shortest path routing protocol among multiple data centers is used, congestion will frequently occur in the shortest path link, which may severely reduce the quality of network services due to long delay and low throughput. The flexibility and agility of SDN can effectively ameliorate the aforementioned problem. However, the utilization of link resources across data centers is still insufficient, and has not yet been well addressed. In this paper, we focused on this issue and proposed an intelligent approach of real-time processing and dynamic scheduling that could make full use of the network resources. The traffic among the data centers could be classified into different types, and different strategies were proposed for these types of real-time traffic. Considering the prolonged occupation of the bandwidth by malicious flows, we employed the multilevel feedback queue mechanism and proposed an effective congestion control algorithm. Simulation experiments showed that our scheme exhibited the favorable feasibility and demonstrated a better traffic scheduling effect and great improvement in bandwidth utilization across data centers.

Shapely Value Perspective on Adapting Transmit Power for Periodic Vehicular Communications

Periodic beacons in vehicular ad hoc networks are transmitted with high message frequency to achieve the higher level of awareness required for the vehicular safety applications. Currently, the existing 10-MHz control channel in the dedicated short range communication (DSRC) standard is not compliant with the communication requirements in vehicular safety applications, i.e., the stipulated amendments in the DSRC offer little relief to congestion caused by the periodic beacon transmissions on the control channel, which adversely affects the message reception. In this paper, we seek to address the problem of congestion with a transmit power adaptation approach, based on the principles of cooperative game theory. The proposed approach, Adaptive transmit power Cooperative Congestion Control (AC3), is designed to allow vehicles to select their transmit power autonomously with respect to their local channel congestion. Since the number of neighbours of each vehicle and their corresponding transmit power levels vary, AC3 requires that each vehicle reduces its transmit power fairly during congestion. Explicitly, the proposed approach introduces the notion of marginal contributions of vehicles towards congestion and determines a fair power decrease for vehicles using a shapely value system model. This model requires the vehicles with the highest marginal contributions to reduce the most transmit power and vice versa. The simulation results demonstrate the utility of the proposed approach (i.e., capability to determine fair power decrease for an effective congestion control).

A lightweight reliability mechanism proposed for datagram congestion control protocol over wireless multimedia sensor networks

AbstractTransmission of multimedia data over wireless multimedia sensor networks (WMSNs) is a challenging task and requires an effective design for the transport layer protocols to meet both the resource‐constrained WMSN and the requirements of multimedia streaming. The standard transport layer protocols (eg, UDP, TCP, SCTP, and DCCP) have been shown inefficient to transport multimedia data over WMSN without modification in the design of end‐to‐end (ETE) reliability and the congestion control mechanisms. This paper proposed a lightweight reliability mechanism for datagram congestion control protocol (LW‐DCCP) over WMSNs. The lightweight reliability mechanism consists of caching and retransmission algorithms that consider the resource‐constrained WMSNs and the requirements of video streaming over WMSN. Moreover, this paper presents an important modification to TCP‐friendly rate control congestion control mechanism that calculates the loss interval based on intracoded frame sending time. The LW‐DCCP has been evaluated through comprehensive simulation experiments and compared with baseline transport protocols using the 2 frameworks (Eval‐SCTP and Eval‐DCCP) that we developed in NS‐2 environment. The experimental results show that LW‐DCCP ensures effective congestion control and ETE reliability for video transmission over WMSN. In addition, LW‐DCCP experiences better performance in terms of energy consumption, ETE delay, jitter delay, frame delivery ratio, frame peak signal‐to‐noise ratio, and visual quality of the received video as compared to the baseline transport layer protocols.

A SECURE AND ROBUST CONGESTION CONTROL MODEL WITH FRAGMENTATION FOR CLUSTERED DISTRIBUTED DATABASE SYSTEM

The purpose of this paper is to present a secure and robust way to adopt Distributed Database System (DDBS). Distributed database is becoming very popular now a day. Today’s business environment has an increasingly need for distributed database and client/server applications. We know that the aim of current technologies is to fulfil the desire for consistent, scalable, reliable and accessible information i.e. steadily growing information. In Distributed Database System, the data fragmentation and distributed database site’s clustering problems are NP-Hard in nature and difficult to solve. One of the points considered that may cause loss of data means, while upgrading from Relational Database System, data distribution over different data-sites uses fragmentation. The database queries to access the applications on the data-sites and should be performed effectively. Therefore, the fragments that accessed by queries are needed to be allocated to the distributed database sites. Thus, fragmentation should be as secure as data be lossless during query execution. And, the second one may cause expensiveness of technology changes. Thus, we present a method for grouping the sites (clustering) of Distributed Database Systems in order to achieve not only secure fragmentation but also robust and cost effective congestion control.

An Effective Load Balanced and Congestion Control Protocol for Wireless Multimedia Networks

An Effective Load Balanced and Congestion Control Protocol for Wireless Multimedia Networks