Additive Increase Multiplicative Decrease Algorithm Research Articles

Blockchain Based Privacy Preserving Authentication and Malicious Node Detection in Internet of Underwater Things (IoUT) Networks

Internet of Underwater Things (IoUT) Networks are used to sense different aquatic parameters like temperature, pressure, pollution, etc. They are also used to forecast the ocean’s weather to collect information about natural disasters. However, they are easily compromised by attackers due to deployment in unattended environments. To overcome these issues, security is required in IoUT networks to avoid unauthorized access and ensure network credibility. This work proposes an authentication and a malicious node detection mechanism to restrict the unauthorized external nodes from accessing the network and the internal nodes from acting maliciously, respectively. Moreover, blockchain stores the hashes of sensor nodes’ credentials during the registration process to make the system secure and traceable. Meanwhile, a weighted trust evaluation mechanism is implemented for data aggregation and detection of malicious nodes. Moreover, an additive increase multiplicative decrease algorithm puts malicious nodes in an intensive observation queue to verify the data of malicious nodes before aggregating. Moreover, weights are assigned to sensor nodes based on their behaviour. If the weight of a sensor node becomes zero, it is revoked by the blockchain. The simulation results show the efficiency of our proposed malicious node detection mechanism in terms of energy consumption and propagation delay.

Leave No Cash on the Table: An Optimal Approach for Controlling Wireless TCP AIMD

The class of additive-increase/multiplicative-decrease (AIMD) algorithms constitutes a key mechanism for congestion control in modern communication networks, such as the current Internet. However, when wireless links are present, the algorithmic behavior of an AIMD algorithm is distorted. Spurious backoffs may be triggered due to packet reordering and non-congestive loss. Prior solutions are developed based on empirical observations without a complete examination of the available design options, thereby overlooking more efficient algorithmic designs (i.e. cash on the table). In this paper, we provide a systematic approach for attaining an optimal enhancement of wireless TCP AIMD. We formulate the design of wireless TCP AIMD as an optimal control problem with the design space of TCP AIMD as the feasible set. With a complete, formal characterization of the design space, we derive a compensation scheme that gives rise to a family of the optimal AIMD algorithms, which can fully filter out the effects due to packet reordering and non-congestive loss. We further identify some properties that help explain the impact of AIMD-based TCP enhancements systematically on the network. We have devised a simple module that realizes the compensation scheme. The module demonstrates a significant performance improvement over existing wireless TCP enhancements through packet level simulation.

Development of an efficient mechanism for rapid protocols using NS-2 simulator

The delivered effort in this manuscript is grounded on NS-2 (The Network Simulator 2) to implement the congestion control process of classic TCP (Transmission Control Protocol), with new congestion control mechanism. In this paper, a novel congestion control algorithm is offered, which contains of slow-start and congestion avoidance mechanisms. The proposed slow-start algorithm assumes a duplicating and an interpolating approach to the congestion window (cwnd) for each increment instead of the exponential increment used by other TCP source variants such as Reno, Vega, Tahoe, Newreno, Fack, and Sack. Furthermore, the enhanced congestion avoidance algorithm is built by using an improved Additive Increase Multiplicative Decrease (AIMD) algorithm with multi TCP flow facility, to provide an enhanced congestion control algorithm with some valuable properties to improve TCP routine for high speed protocols. The improvement strategy based on merging of slow start, congestion avoidance mechanism that are used in TCP congestion control, to create a new AIMD algorithm with a new relationship between the pair parameters a and b. This paper is also involved in the creation of rapid agent in NS-2 models designed to identify the modified TCP and to configure the NS-2 platform. A fast TCP also includes an innovative scheme to slow the rapid start to help TCP to start faster through the high speed networks and also to postpone the congestion state as much as possible.

Optimization based AIMD saturated algorithms for public charging of electric vehicles

The Additive Increase Multiplicative Decrease (AIMD) algorithm is an interesting approach in congestion control of communication networks, as it maintains the good features of a distributed strategy, without sacrificing the network stability and robustness. Recent applications of these algorithms also concern other industrial fields such as Electric Vehicles (EVs) based transportation systems, for which the introduction of an optimal charging policy is an important challenge for power systems operation. Moreover, saturation constraints on the resource allocated to each vehicle need to be taken into account in order to avoid peak power requirements and grid overloads. Optimization based AIMD algorithms with saturation constraints are proposed in this paper for public charging of EVs. Specifically, a new AIMD approach is presented in order to capture the main advantages of optimal algorithms which minimize either the sum of charging times or the operation time of each vehicle, giving rise to a mixed AIMD strategy. Simulation results illustrate the performance of the proposal, even in comparison to the corresponding centralized optimal solutions.

Development of an efficient mechanism for rapid protocols using NS-2 simulator

The delivered effort in this manuscript is grounded on NS-2 (The Network Simulator 2) to implement the congestion control process of classic TCP (Transmission Control Protocol), with new congestion control mechanism. In this paper, a novel congestion control algorithm is offered, which contains of slow-start and congestion avoidance mechanisms. The proposed slow-start algorithm assumes a duplicating and an interpolating approach to the congestion window (cwnd) for each increment instead of the exponential increment used by other TCP source variants such as Reno, Vega, Tahoe, Newreno, Fack, and Sack. Furthermore, the enhanced congestion avoidance algorithm is built by using an improved Additive Increase Multiplicative Decrease (AIMD) algorithm with multi TCP flow facility, to provide an enhanced congestion control algorithm with some valuable properties to improve TCP routine for high speed protocols. The improvement strategy based on merging of slow start, congestion avoidance mechanism that are used in TCP congestion control, to create a new AIMD algorithm with a new relationship between the pair parameters a and b. This paper is also involved in the creation of rapid agent in NS-2 models designed to identify the modified TCP and to configure the NS-2 platform. A fast TCP also includes an innovative scheme to slow the rapid start to help TCP to start faster through the high speed networks and also to postpone the congestion state as much as possible.

On the AIMD Algorithm Under Saturation Constraints

One of the most successful distributed resource allocation algorithms to be deployed in industry is the Additive-Increase Multiplicative-Decrease (AIMD) algorithm of Jain and Chiu. This algorithm already underpins the transport layer of the internet, and is now starting to find application in new areas in the context of Smart Grid and Smart Transportation applications. A distinguishing feature of these latter application areas, when compared with the internet, is the need to modify AIMD to account for lower and upper bounds in the resource allocated to individual agents. Our objective in this note is to demonstrate that the dynamic system arising from AIMD in this extended form has system theoretic properties similar to the classical algorithm.

Online control algorithm for sub-half-hourly operation of LV connected energy storage device owned by DNO

Change in consumer behaviour through uptake of low carbon technologies is likely to put existing distribution networks under strain and worsen the operational requirements of the network. Deployment of energy storage and power electronics is a feasible alternative to traditional network reinforcement. This study presents two control algorithms used with an energy storage device deployed as part of New Thames Valley Vision Project. The two algorithms are aimed at (i) equalising phase loading with correction of power factor and (ii) providing voltage support with Additive Increase Multiplicative Decrease algorithm for active and reactive power control.

A Two Stage Increase-decrease Algorithm to Optimize Distributed Generation in a Virtual Power Plant

Abstract A two stage algorithm is proposed in this paper to optimize cost of generation with application to a virtual power plant. First stage of the algorithm presents a methodology to draw a hierarchy for the choice of distributed generators based on the cost of generation. Second stage of the algorithm optimizes generation to minimize cost. An Additive Increase and Multiplicative Decrease algorithm, which is already used for optimization in microgrids is improved further and is presented as Modified Additive Increase Multiplicative Decrease algorithm and is applied in the second stage of the algorithm for optimization. The Modified Additive Increase Multiplicative Decrease algorithm is validated by implementing to schedule generation of distributed generators with intermittent power availability in a Virtual Power Plant in grid connected mode to optimize the cost of generation. The Modified AIMD algorithm is proved to be much more effective than the original AIMD algorithm.

Optimization of Renewable Energy Sources in a Microgrid Using Artificial Fish Swarm Algorithm

Abstract Advances in microgrid enabling technologies and utilization of Renewable Energy Sources are prompting more and more number of smaller investors to invest in Renewable energy generation and distribution at microgrid level. The increased competition requires the energy producers to offer energy at minimum possible cost to gain the confidence of consumers, which needs efficient methods to schedule the energy generation among the available Renewable Energy Sources. Optimal scheduling of generation is one of the methods used to reduce the cost of generation. Out of many types of algorithms used effectively to solve the problem, evolutionary program techniques are proven and time tested to be one of the best solutions. A stochastic based search algorithm, called Artificial Fish Swarm Algorithm is used in this article to solve the problem of optimal scheduling of energy generation among the available Renewable Energy Sources. The effectiveness of the algorithm is validated by implementing to schedule generation in a microgrid scenario. The results are validated by comparing to an already tested Additive Increase Multiplicative Decrease algorithm.

Distributed Energy Storage Control for Dynamic Load Impact Mitigation

The future uptake of electric vehicles (EV) in low-voltage distribution networks can cause increased voltage violations and thermal overloading of network assets, especially in networks with limited headroom at times of high or peak demand. To address this problem, this paper proposes a distributed battery energy storage solution, controlled using an additive increase multiplicative decrease (AIMD) algorithm. The improved algorithm (AIMD+) uses local bus voltage measurements and a reference voltage threshold to determine the additive increase parameter and to control the charging, as well as discharging rate of the battery. The used voltage threshold is dependent on the network topology and is calculated using power flow analysis tools, with peak demand equally allocated amongst all loads. Simulations were performed on the IEEE LV European Test feeder and a number of real U.K. suburban power distribution network models, together with European demand data and a realistic electric vehicle charging model. The performance of the standard AIMD algorithm with a fixed voltage threshold and the proposed AIMD+ algorithm with the reference voltage profile are compared. Results show that, compared to the standard AIMD case, the proposed AIMD+ algorithm further improves the network’s voltage profiles, reduces thermal overload occurrences and ensures a more equal battery utilisation.

TCP Karak: A New TCP AIMD Algorithm Based on Duplicated Acknowledgements for MANET

Transmission Control Protocol (TCP) performance over MANET is an area of extensive research. Congestion control mechanisms are major components of TCP which affect its performance. The improvement of these mechanisms represents a big challenge especially over wireless environments. Additive Increase Multiplicative Decrease (AIMD) mechanisms control the amount of increment and decrement of the transmission rate as a response to changes in the level of contention on routers buffer space and links bandwidth. The role of an AIMD mechanism in transmitting the proper amount of data is not easy, especially over MANET. This is because MANET has a very dynamic topology and high bit error rate wireless links that cause packet loss. Such a loss could be misinterpreted as severe congestion by the transmitting TCP node. This leads to unnecessary sharp reduction in the transmission rate which could degrades TCP throughput. This paper introduces a new AIMD algorithm that takes the number of already received duplicated ACK, when a timeout takes place, into account in deciding the amount of multiplicative decrease. Specifically, it decides the point from which Slow-start mechanism should begin its recovery of the congestion window size. The new AIMD algorithm has been developed as a new TCP variant which we call TCP Karak. The aim of TCP Karak is to be more adaptive to mobile wireless networks conditions by being able to distinguish between loss due to severe congestion and that due to link breakages or bit errors. Several simulated experiments have been conducted to evaluate TCP Karak and compare its performance with TCP NewReno. Results have shown that TCP Karak is able to achieve higher throughput and goodput than TCP NewReno under various mobility speeds, traffic loads, and bit error rates.

On the competitiveness of AIMD-TCP within a general network

This paper studies the performance of AIMD (Additive Increase Multiplicative Decrease) TCP as an online distributed scheduling algorithm for allocating transmission rate to sessions/jobs running on a general network. The network consists of a set of routers which in this context act only as bottlenecks, i.e. when a router’s capacity has been reached, it informs the jobs passing through it to multiplicatively back off transmission rates. The analysis is easier when this AIMD algorithm is modeled by a continuous algorithm. We improve on that presented by Kelly to better capture the interconnectedness of the network. Extending the paper by Edmonds, Datta, and Dymond that solves the single-bottleneck case, we prove that with extra resources, this algorithm AIMDEQUI is competitive against the optimal global algorithm in minimizing the average transmission time of the jobs. We also bound the fairness of this resource allocation according to three different definitions of fairness.

An ergodic AIMD algorithm with application to high-speed networks

In this article we propose a version of the Additive-Increase Multiplicative-Decrease (AIMD) algorithm that provides a suitable basis to develop congestion control protocols that can be deployed in both conventional and high-speed communication networks. Our algorithm retains many of the properties of the standard AIMD algorithm. However, unlike other non-standard AIMD algorithms, our scheme can be shown to be ergodic under very general assumptions.

Deterministic and stochastic convergence properties of AIMD algorithms with nonlinear back-off functions

In this paper we establish basic stability results for a class of nonlinear AIMD (additive-increase multiplicative-decrease) algorithms. We consider networks in which the nonlinearity enters through the multiplicative-decrease mechanism. In particular, where the multiplicative-decrease function depends in a nonlinear fashion on the achieved rate. For synchronized deterministic networks, we establish stability and convergence results. For non-synchronized stochastic networks, basic convergence results are also established. In particular, we give conditions for the existence of a unique invariant stationary distribution, and conditions under which time- and ensemble-averages converge to the same unique value (irrespective of initial conditions).

On the Fair Coexistence of Loss- and Delay-Based TCP

This paper presents and develops a novel delay-based additive increase, multiplicative decrease (AIMD) congestion control algorithm. The main features of the proposed solution include: 1) low standing queues and delay in homogeneous environments (with delay-based flows only); 2) fair coexistence of delay- and loss-based flows in heterogeneous environments; 3) delay-based flows behave as loss-based flows when loss-based flows are present in the network; otherwise they revert to delay-based operation. It is also shown that these properties can be achieved without any appreciable increase in network loss rate over that which would be present in a comparable network of standard TCP flows (loss-based AIMD). To demonstrate the potential of the presented algorithm, both analytical and simulation results are provided in a range of different network scenarios. These include stability and convergence results in general multiple-bottleneck networks and a number of simulation scenarios to demonstrate the utility of the proposed scheme. In particular, we show that networks employing our algorithm have the features of networks in which RED AQM's are deployed. Furthermore, in a wide range of situations (including high-speed scenarios), we show that low delay is achieved irrespective of the queueing algorithm employed in the network, with only sender-side modification to the basic AIMD algorithm.

On the delay and link utilization with the new-additive increase multiplicative decrease congestion avoidance and control algorithm

Additive increase multiplicative decrease (AIMD) algorithm is the prevailing algorithm for congestion avoidance and control in the Internet. Reducing the end-to-end delays and enhancement of the link utilization are the important goals of this algorithm. In this work, we continue to study the performance of the New-AIMD (additive increase multiplicative decrease) mechanism as one of the core protocols for TCP, to avoid and control the congestion. We want to evaluate the effect of using the AIMD algorithm after developing it, which we called the New-AIMD algorithm, to find a new approach to measure the end-to-end delay and bottleneck link utilization and use the NCTUns simulator to obtain the results after making the modification for the mechanism. We will use the DropTail mechanism as the active queue management mechanism (AQM) in the bottleneck router. After the implementation of our new approach with a different number of flows, we expect the end-to-end delay to be less when we measure the delay dependent on the throughput for the entire system. In addition, we will measure the bottleneck link utilization using this mechanism and expect to get high utilization for bottleneck link and avoid the collisions in the link.

An Active Congestion Control Mechanism for Transmission Control Protocol

PDF HTML阅读 XML下载 导出引用 引用提醒 一种传输控制协议中的主动拥塞控制机制 DOI: 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: Supported by the Foundation of National Development and Reform Commission of China under Grant No.CNGI-04-4-2D (国家发改委基金); the Natural Science Foundation Project of CQ CSTC of China under Grant No.2006BB2164 (重庆市科委自然学科基金) An Active Congestion Control Mechanism for Transmission Control Protocol Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:TCP Reno是当前Internet中流行的TCP(transmission control protocol)版本,为改善其性能,提出一种TCP Reno的改进方案,取名DAA-TCP(dual AMID-based active TCP).DAA-TCP融合了双重AIMD(additive-increase multiplicative-decrease)算法,添加了主动拥塞控制,即在满足给定条件下,可主动降低拥塞窗口,即便此时网络并未发生拥塞.仿真分析了DAA-TCP的性能,结果表明,与TCP Reno相比,使用DAA-TCP可提高吞吐量、减少重传报文、降低报文重传率;DAA-TCP也能与TCP Reno友好共存.另外, DAA-TCP可由TCP Reno发送方作较小修改得到.因此,DAA-TCP容易实现,所增加的额外开销较少. Abstract:To improve performance of TCP (transmission control protocol) Reno, a widely used TCP version, an improved TCP Reno named DAA-TCP is proposed. DAA-TCP (dual AMID-based active TCP) combines dual AIMD (additive-increase multiplicative-decrease) algorithms and adds an active congestion control manner, i.e., the congestion window may be decreased when some given conditions are satisfied before the congestion really occurs. DAA-TCP performances are investigated through simulations. Comparing with TCP Reno, the throughput may be improved; the retransmitted packets and the retransmit probability may be decreased. DAA-TCP can coexist with TCP Reno very friendly. In addition, DAA-TCP is obtained through a little modification from TCP Reno at the sender side, so DAA-TCP can be easily developed and the additional overheads are very low. 参考文献 相似文献 引证文献

Performance analysis of TCP/AQM with generalized AIMD under intermediate buffer sizes

For TCP/AQM systems, the issue of buffer sizing has recently received much attention. The classical rule-of-thumb suggests O(N) buffer size to ensure full link utilization when N TCP flows share a bottleneck link of capacity O(N), while recent empirical study shows the buffer of size O(N) is enough to yield high utilization (say, 95%) for large N. However, these results are all limited to the drop-tail scheme and there has been no systematic modeling framework for any buffer sizing between O(N) and O(N). In this paper, we study the limiting behavior of a TCP/AQM system for an intermediate buffer sizing of O(N^@c) (0.5=<@c<1). We develop a stochastic model in a discrete-time setting to characterize the system dynamics and then show that we can have 100% link utilization and zero packet loss probability for a large number of flows when the buffer size is chosen anywhere between O(N) and O(N). Our model is general enough to cover any queue-based AQM scheme with ECN marking (including the drop-tail) and various generalized AIMD (additive-increase-multiplicative-decrease) algorithms for each TCP flow. We also provide arguments showing that the discrete-time based modeling can effectively capture all the essential system dynamics under our choice of scaling (0.5=<@c<1) for buffer size as well as AQM parameters.

State Dependent AIMD Algorithms and Consensus Problems

AbstractThis papers analyses a class of nonlinear positive systems that model the dynamics of nonlinear additive‐increase multiplicative‐decrease (AIMD) protocols. The system class covers a range of protocols that are currently used in real communication networks, such as standard TCP, and recent proposals for congestion control protocols such as Scalable TCP. (© 2006 WILEY‐VCH Verlag GmbH &amp; Co. KGaA, Weinheim)

Analysis of MIMD congestion control algorithm for high speed networks

Proposals to improve the performance of TCP in high speed networks have been recently put forward. Examples of such proposals include High Speed TCP, Scalable TCP, and FAST. In contrast to the additive increase multiplicative decrease algorithm used in the standard TCP, Scalable TCP uses a multiplicative increase multiplicative decrease (MIMD) algorithm for the window size evolution. In this paper, we present a mathematical analysis of the MIMD congestion control algorithm in the presence of random losses. Random losses are typical to wireless networks but can also be used to model losses in wireline networks with a high bandwidth-delay product. Our approach is based on showing that the logarithm of the window size evolution has the same behaviour as the workload process in a standard G/G/1 queue. The Laplace–Stieltjes transform of the equivalent queue is then shown to directly provide the throughput of the congestion control algorithm and the higher moments of the window size. Using ns-2 simulations, we validate our findings using Scalable TCP.