Active queue management(AQM)methods manage the queued packets at the router buffer,prevent buffer congestion,and stabilize the network performance.The bursty nature of the traffic passing by the network routers and th...Active queue management(AQM)methods manage the queued packets at the router buffer,prevent buffer congestion,and stabilize the network performance.The bursty nature of the traffic passing by the network routers and the slake behavior of the existing AQM methods leads to unnecessary packet dropping.This paper proposes a fully adaptive active queue management(AAQM)method to maintain stable network performance,avoid congestion and packet loss,and eliminate unnecessary packet dropping.The proposed AAQM method is based on load and queue length indicators and uses an adaptive mechanism to adjust the dropping probability based on the buffer status.The proposed AAQM method adapts to single and multiclass traffic models.Extensive simulation results over two types of traffic showed that the proposed method achieved the best results compared to the existing methods,including Random Early Detection(RED),BLUE,Effective RED(ERED),Fuzzy RED(FRED),Fuzzy Gentle RED(FGRED),and Fuzzy BLUE(FBLUE).The proposed and compared methods achieved similar results with low or moderate traffic load.However,under high traffic load,the proposed AAQM method achieved the best rate of zero loss,similar to BLUE,compared to 0.01 for RED,0.27 for ERED,0.04 for FRED,0.12 for FGRED,and 0.44 for FBLUE.For throughput,the proposed AAQM method achieved the highest rate of 0.54,surpassing the BLUE method’s throughput of 0.43.For delay,the proposed AAQM method achieved the second-best delay of 28.51,while the BLUE method achieved the best delay of 13.18;however,the BLUE results are insufficient because of the low throughput.Consequently,the proposed AAQM method outperformed the compared methods with its superior throughput and acceptable delay.展开更多
By applying the method of average and variance, a new queue management algorithm named the Classified-Random Early Detection (CRED) algorithm is presented which can identify the media streaming, TCP traffic and othe...By applying the method of average and variance, a new queue management algorithm named the Classified-Random Early Detection (CRED) algorithm is presented which can identify the media streaming, TCP traffic and other UDP traffic at the edge routers. The algorithm discriminates the slow start and the congestion control phase of the TCP traffic and combines the TCP congestion control with the IP congestion control to alleviate the congestion effectively. Simulation shows that CRED can not only make the media streaming obtain the resources needed but also protect the TCP traffic transmitted effectively and reliably.展开更多
In this paper, we propose a new mechanism called explicit rate notification(ERN) to be used in end-to-end communications. The ERN scheme encodes in the header of transmission control protocol(TCP) packets information ...In this paper, we propose a new mechanism called explicit rate notification(ERN) to be used in end-to-end communications. The ERN scheme encodes in the header of transmission control protocol(TCP) packets information about the sending rate and the round trip time(RTT) of the flows. This new available information to the intermediate nodes(routers) is used to improve fairness, increase utilization, decrease the number of drops, and minimize queueing delays. Thus, it induces a better management of the queue. A comparison of our scheme with preexistent schemes, like the explicit congestion notification scheme, shows the effectiveness of the proposed mechanism.展开更多
Active Queue Management (AQM) is an active research area in the Internet community. Random Early Detection (RED) is a typical AQM algorithm, but it is known that it is difficult to configure its parameters and its ave...Active Queue Management (AQM) is an active research area in the Internet community. Random Early Detection (RED) is a typical AQM algorithm, but it is known that it is difficult to configure its parameters and its average queue length is closely related to the load level. This paper proposes an effective fuzzy congestion control algorithm based on fuzzy logic which uses the pre- dominance of fuzzy logic to deal with uncertain events. The main advantage of this new congestion control algorithm is that it discards the packet dropping mechanism of RED, and calculates packet loss according to a preconfigured fuzzy logic by using the queue length and the buffer usage ratio. Theo- retical analysis and Network Simulator (NS) simulation results show that the proposed algorithm achieves more throughput and more stable queue length than traditional schemes. It really improves a router's ability in network congestion control in IP network.展开更多
A considerable number of applications are running over IP networks.This increased the contention on the network resource,which ultimately results in congestion.Active queue management(AQM)aims to reduce the serious co...A considerable number of applications are running over IP networks.This increased the contention on the network resource,which ultimately results in congestion.Active queue management(AQM)aims to reduce the serious consequences of network congestion in the router buffer and its negative effects on network performance.AQM methods implement different techniques in accordance with congestion indicators,such as queue length and average queue length.The performance of the network is evaluated using delay,loss,and throughput.The gap between congestion indicators and network performance measurements leads to the decline in network performance.In this study,delay and loss predictions are used as congestion indicators in a novel stochastic approach for AQM.The proposed method estimates the congestion in the router buffer and then uses the indicators to calculate the dropping probability,which is responsible for managing the router buffer.The experimental results,based on two sets of experiments,have shown that the proposed method outperformed the existing benchmark algorithms including RED,ERED and BLUE algorithms.For instance,in the first experiment,the proposed method resides in the third-place in terms of delay when compared to the benchmark algorithms.In addition,the proposed method outperformed the benchmark algorithms in terms of packet loss,packet dropping,and packet retransmission.Overall,the proposed method outperformed the benchmark algorithms because it preserves packet loss while maintaining reasonable queuing delay.展开更多
Based on the linearized model of the TCP connections through the congested routers, this paper puts forward an active queue management algorithm (FVS-T). The algorithm utilizes the fuzzy variable structure control alg...Based on the linearized model of the TCP connections through the congested routers, this paper puts forward an active queue management algorithm (FVS-T). The algorithm utilizes the fuzzy variable structure control algorithm with delay factor to compensate time varying round-trip times (RTT) and uncertainties with respect to the number of active TCP sessions. By analyzing the robustness and performance of the control scheme for the nonlinear TCP/AQM model, we show that the proposed design has good performance and robustness, which are central to the notion of AQM. Implementation issues were discussed and ns simulations were provided to validate the design and compare its performance to other peer schemes in different scenarios. The results show that the proposed design significantly outperforms the other congestion schemes in terms of packet loss ratio, throughput and buffer fluctuation.展开更多
A variable structure based control scheme was proposed for Active Queue Management(AQM) by using sliding model algorithm and reach law method. This approach aims to address the tradeoff between good performance and ro...A variable structure based control scheme was proposed for Active Queue Management(AQM) by using sliding model algorithm and reach law method. This approach aims to address the tradeoff between good performance and robustness with respect to the uncertainties of the round-trip time and the number of active connections. Ns simulations results show that the proposed design significantly outperforms the peer AQM schemes in terms of fluctuation in the queue length, packet throughput, and loss ratio. The conclusion is that proposed scheme is in favor of the achievement to AQM objectives due to its good transient and steady performance.展开更多
Improving the Quality of Service (QoS) of Internet traffic is widely recognized as a critical issue for the next-generation networks. In this paper, we present a new algorithm for the active queue management, namely R...Improving the Quality of Service (QoS) of Internet traffic is widely recognized as a critical issue for the next-generation networks. In this paper, we present a new algorithm for the active queue management, namely RED-DTB. This buffer control technique is used to enforce approximate fairness among a large number of concurrent Internet flows. Like RED (Random Early Detection) algorithm, the RED-DTB mechanism can be deployed to actively respond to the gateway congestion, keep the gateway in a healthy state, and protect the fragile flows from being stolen bandwidth by greedy ones. The algorithm is based on the so-called Dual Token Bucket (DTB) pattern. That is, on the one hand, every flow is rate-limited by its own token bucket, to ensure that it can not consume more than its fair share of bandwidth; On the other hand, to make some compensations to less aggressive flows, such as connections with larger round trip time or smaller sending window, and to gain a relatively higher system utilization coefficient, all flows, depending on their individual behavior, may have a chance to fetch tokens from the public token bucket when they run out of their own share of tokens. The algorithm is analyzed and evaluated by simulations, and is proved to be effective in protecting the gateway buffer and controlling the fair allocation of bandwidth among flows.展开更多
Congestion control is one of the main obstacles in cyberspace traffic.Overcrowding in internet traffic may cause several problems;such as high packet hold-up,high packet dropping,and low packet output.In the course of...Congestion control is one of the main obstacles in cyberspace traffic.Overcrowding in internet traffic may cause several problems;such as high packet hold-up,high packet dropping,and low packet output.In the course of data transmission for various applications in the Internet of things,such problems are usually generated relative to the input.To tackle such problems,this paper presents an analytical model using an optimized Random Early Detection(RED)algorithm-based approach for internet traffic management.The validity of the proposed model is checked through extensive simulation-based experiments.An analysis is observed for different functions on internet traffic.Four performance metrics are taken into consideration,namely,the possibility of packet loss,throughput,mean queue length and mean queue delay.Three sets of experiments are observed with varying simulation results.The experiments are thoroughly analyzed and the best packet dropping operation with minimum packet loss is identified using the proposed model.展开更多
Wireless Sensor Networks (WSNs) consist of numerous sensor nodes which can be used in many new emerging applications like healthcare. One of the major challenges in healthcare environments is to manage congestion, bec...Wireless Sensor Networks (WSNs) consist of numerous sensor nodes which can be used in many new emerging applications like healthcare. One of the major challenges in healthcare environments is to manage congestion, because in applications, such as medical emergencies or patients remote monitoring, transmitted data is important and critical. So it is essential in the first place to avoid congestion as much as possible and in cases when congestion avoidance is not possible, to control the congestion. In this paper, a class based congestion management protocol has been proposed for healthcare applications. We distinguish between sensitive, non-sensitive and control traffics, and service the input traffics based on their priority and quality of service requirements (QoS). The proposed protocol which is called COCM avoids congestion in the first step using multipath routing. The proposed AQM algorithm uses separate virtual queue's condition on a single physical queue to accept or drop the incoming packets. In cases where input traffic rate increases and congestion cannot be avoided, it mitigates congestion by using an optimized congestion control algorithm. This paper deals with parameters like end to end delay, packet loss, energy consumption, lifetime and fairness which are important in healthcare applications. The performance of COCM was evaluated using the OPNET simulator. Simulation results indicated that COCM achieves its goals.展开更多
Since Internet is dominated by TCP-based applications, active queue management (AQM) is considered as an effective way for congestion control. However, most AQM schemes suffer obvious performance degradation with dy...Since Internet is dominated by TCP-based applications, active queue management (AQM) is considered as an effective way for congestion control. However, most AQM schemes suffer obvious performance degradation with dynamic traffic. Extensive measurements found that Internet traffic is extremely bursty and possibly self-similar. We propose in this paper a new AQM scheme called multiscale controller (MSC) based on the understanding of traffic burstiness in multiple time scale. Different from most of other AQM schemes, MSC combines rate-based and queue-based control in two time scales. While the rate-based dropping on burst level (large time scales) determines the packet drop aggressiveness and is responsible for low and stable queuing delay, good robustness and responsiveness, the queue-based modulation of the packet drop probability on packet level (small time scales) will bring low loss and high throughput. Stability analysis is performed based on a fluid-flow model of the TCP/MSC congestion control system and simulation results show that MSC outperforms many of the current AQM schemes.展开更多
基金funded by Arab Open University Grant Number(AOURG2023–005).
文摘Active queue management(AQM)methods manage the queued packets at the router buffer,prevent buffer congestion,and stabilize the network performance.The bursty nature of the traffic passing by the network routers and the slake behavior of the existing AQM methods leads to unnecessary packet dropping.This paper proposes a fully adaptive active queue management(AAQM)method to maintain stable network performance,avoid congestion and packet loss,and eliminate unnecessary packet dropping.The proposed AAQM method is based on load and queue length indicators and uses an adaptive mechanism to adjust the dropping probability based on the buffer status.The proposed AAQM method adapts to single and multiclass traffic models.Extensive simulation results over two types of traffic showed that the proposed method achieved the best results compared to the existing methods,including Random Early Detection(RED),BLUE,Effective RED(ERED),Fuzzy RED(FRED),Fuzzy Gentle RED(FGRED),and Fuzzy BLUE(FBLUE).The proposed and compared methods achieved similar results with low or moderate traffic load.However,under high traffic load,the proposed AAQM method achieved the best rate of zero loss,similar to BLUE,compared to 0.01 for RED,0.27 for ERED,0.04 for FRED,0.12 for FGRED,and 0.44 for FBLUE.For throughput,the proposed AAQM method achieved the highest rate of 0.54,surpassing the BLUE method’s throughput of 0.43.For delay,the proposed AAQM method achieved the second-best delay of 28.51,while the BLUE method achieved the best delay of 13.18;however,the BLUE results are insufficient because of the low throughput.Consequently,the proposed AAQM method outperformed the compared methods with its superior throughput and acceptable delay.
基金This paper is supported by the Foundation of Science and Technology Development of Shaanxi Province.
文摘By applying the method of average and variance, a new queue management algorithm named the Classified-Random Early Detection (CRED) algorithm is presented which can identify the media streaming, TCP traffic and other UDP traffic at the edge routers. The algorithm discriminates the slow start and the congestion control phase of the TCP traffic and combines the TCP congestion control with the IP congestion control to alleviate the congestion effectively. Simulation shows that CRED can not only make the media streaming obtain the resources needed but also protect the TCP traffic transmitted effectively and reliably.
文摘In this paper, we propose a new mechanism called explicit rate notification(ERN) to be used in end-to-end communications. The ERN scheme encodes in the header of transmission control protocol(TCP) packets information about the sending rate and the round trip time(RTT) of the flows. This new available information to the intermediate nodes(routers) is used to improve fairness, increase utilization, decrease the number of drops, and minimize queueing delays. Thus, it induces a better management of the queue. A comparison of our scheme with preexistent schemes, like the explicit congestion notification scheme, shows the effectiveness of the proposed mechanism.
基金Supported by the National High Technology Research and Development of China (863 Program) (No.2003AA121560)the High Technology Research and Development Program of Jiangsu Province (No.BEG2003001).
文摘Active Queue Management (AQM) is an active research area in the Internet community. Random Early Detection (RED) is a typical AQM algorithm, but it is known that it is difficult to configure its parameters and its average queue length is closely related to the load level. This paper proposes an effective fuzzy congestion control algorithm based on fuzzy logic which uses the pre- dominance of fuzzy logic to deal with uncertain events. The main advantage of this new congestion control algorithm is that it discards the packet dropping mechanism of RED, and calculates packet loss according to a preconfigured fuzzy logic by using the queue length and the buffer usage ratio. Theo- retical analysis and Network Simulator (NS) simulation results show that the proposed algorithm achieves more throughput and more stable queue length than traditional schemes. It really improves a router's ability in network congestion control in IP network.
文摘A considerable number of applications are running over IP networks.This increased the contention on the network resource,which ultimately results in congestion.Active queue management(AQM)aims to reduce the serious consequences of network congestion in the router buffer and its negative effects on network performance.AQM methods implement different techniques in accordance with congestion indicators,such as queue length and average queue length.The performance of the network is evaluated using delay,loss,and throughput.The gap between congestion indicators and network performance measurements leads to the decline in network performance.In this study,delay and loss predictions are used as congestion indicators in a novel stochastic approach for AQM.The proposed method estimates the congestion in the router buffer and then uses the indicators to calculate the dropping probability,which is responsible for managing the router buffer.The experimental results,based on two sets of experiments,have shown that the proposed method outperformed the existing benchmark algorithms including RED,ERED and BLUE algorithms.For instance,in the first experiment,the proposed method resides in the third-place in terms of delay when compared to the benchmark algorithms.In addition,the proposed method outperformed the benchmark algorithms in terms of packet loss,packet dropping,and packet retransmission.Overall,the proposed method outperformed the benchmark algorithms because it preserves packet loss while maintaining reasonable queuing delay.
文摘Based on the linearized model of the TCP connections through the congested routers, this paper puts forward an active queue management algorithm (FVS-T). The algorithm utilizes the fuzzy variable structure control algorithm with delay factor to compensate time varying round-trip times (RTT) and uncertainties with respect to the number of active TCP sessions. By analyzing the robustness and performance of the control scheme for the nonlinear TCP/AQM model, we show that the proposed design has good performance and robustness, which are central to the notion of AQM. Implementation issues were discussed and ns simulations were provided to validate the design and compare its performance to other peer schemes in different scenarios. The results show that the proposed design significantly outperforms the other congestion schemes in terms of packet loss ratio, throughput and buffer fluctuation.
文摘A variable structure based control scheme was proposed for Active Queue Management(AQM) by using sliding model algorithm and reach law method. This approach aims to address the tradeoff between good performance and robustness with respect to the uncertainties of the round-trip time and the number of active connections. Ns simulations results show that the proposed design significantly outperforms the peer AQM schemes in terms of fluctuation in the queue length, packet throughput, and loss ratio. The conclusion is that proposed scheme is in favor of the achievement to AQM objectives due to its good transient and steady performance.
基金the National Natural Science Foundation of China(60132030)and the National Education Department Doctorial Foundation Project(RFDP1999048602)
文摘Improving the Quality of Service (QoS) of Internet traffic is widely recognized as a critical issue for the next-generation networks. In this paper, we present a new algorithm for the active queue management, namely RED-DTB. This buffer control technique is used to enforce approximate fairness among a large number of concurrent Internet flows. Like RED (Random Early Detection) algorithm, the RED-DTB mechanism can be deployed to actively respond to the gateway congestion, keep the gateway in a healthy state, and protect the fragile flows from being stolen bandwidth by greedy ones. The algorithm is based on the so-called Dual Token Bucket (DTB) pattern. That is, on the one hand, every flow is rate-limited by its own token bucket, to ensure that it can not consume more than its fair share of bandwidth; On the other hand, to make some compensations to less aggressive flows, such as connections with larger round trip time or smaller sending window, and to gain a relatively higher system utilization coefficient, all flows, depending on their individual behavior, may have a chance to fetch tokens from the public token bucket when they run out of their own share of tokens. The algorithm is analyzed and evaluated by simulations, and is proved to be effective in protecting the gateway buffer and controlling the fair allocation of bandwidth among flows.
文摘Congestion control is one of the main obstacles in cyberspace traffic.Overcrowding in internet traffic may cause several problems;such as high packet hold-up,high packet dropping,and low packet output.In the course of data transmission for various applications in the Internet of things,such problems are usually generated relative to the input.To tackle such problems,this paper presents an analytical model using an optimized Random Early Detection(RED)algorithm-based approach for internet traffic management.The validity of the proposed model is checked through extensive simulation-based experiments.An analysis is observed for different functions on internet traffic.Four performance metrics are taken into consideration,namely,the possibility of packet loss,throughput,mean queue length and mean queue delay.Three sets of experiments are observed with varying simulation results.The experiments are thoroughly analyzed and the best packet dropping operation with minimum packet loss is identified using the proposed model.
文摘Wireless Sensor Networks (WSNs) consist of numerous sensor nodes which can be used in many new emerging applications like healthcare. One of the major challenges in healthcare environments is to manage congestion, because in applications, such as medical emergencies or patients remote monitoring, transmitted data is important and critical. So it is essential in the first place to avoid congestion as much as possible and in cases when congestion avoidance is not possible, to control the congestion. In this paper, a class based congestion management protocol has been proposed for healthcare applications. We distinguish between sensitive, non-sensitive and control traffics, and service the input traffics based on their priority and quality of service requirements (QoS). The proposed protocol which is called COCM avoids congestion in the first step using multipath routing. The proposed AQM algorithm uses separate virtual queue's condition on a single physical queue to accept or drop the incoming packets. In cases where input traffic rate increases and congestion cannot be avoided, it mitigates congestion by using an optimized congestion control algorithm. This paper deals with parameters like end to end delay, packet loss, energy consumption, lifetime and fairness which are important in healthcare applications. The performance of COCM was evaluated using the OPNET simulator. Simulation results indicated that COCM achieves its goals.
基金Supported by the National Grand Fundamental Research 973 Program of China under Grant No. 2003CB314801, the National Research Foundation for the Doctoral Program of Higher Education of China under Grant No. 20040286001 and the National Natural Science Foundation of China under Grant No. 90604003. Acknowledgments The authors would like to thank Professor Guan-Qun Gu for his supervision and Professor Jun Shen for his comments on an early draft of this paper.
文摘Since Internet is dominated by TCP-based applications, active queue management (AQM) is considered as an effective way for congestion control. However, most AQM schemes suffer obvious performance degradation with dynamic traffic. Extensive measurements found that Internet traffic is extremely bursty and possibly self-similar. We propose in this paper a new AQM scheme called multiscale controller (MSC) based on the understanding of traffic burstiness in multiple time scale. Different from most of other AQM schemes, MSC combines rate-based and queue-based control in two time scales. While the rate-based dropping on burst level (large time scales) determines the packet drop aggressiveness and is responsible for low and stable queuing delay, good robustness and responsiveness, the queue-based modulation of the packet drop probability on packet level (small time scales) will bring low loss and high throughput. Stability analysis is performed based on a fluid-flow model of the TCP/MSC congestion control system and simulation results show that MSC outperforms many of the current AQM schemes.