Explicit congestion control based on 1-bit probabilistic marking

Almeida, António Betâmio de; Belo, Carlos A. C.

doi:10.1016/j.comcom.2010.04.012

Cited by 6 publications

(2 citation statements)

References 58 publications

(60 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In explicit signaling, if the node gets congestion it can send direct a packet to the source or destination of the data to inform them about congestion. The difference between a choke packet and explicit signaling is that with explicit signaling, the signal is embedded in the data packets rather than being created as a separate packet as with choke packet [31] [32].…”

Section: Explicit Signalingmentioning

confidence: 99%

Congestion Avoidance using Traffic Load Balancing (CATLB) in Computer Networks

Altameemi

Nassar

2022

IJICI

View full text Add to dashboard Cite

Congestion in computer networks is one of the most crucial subjects in the world of networks since it has a significant influence on the network and the quality of service and decreased efficiency of it, which frequently results in service interruptions, In order to preserve the continuity of data flow in the network, it is necessary to design approaches and processes to avoid congestion or minimize its effects. Congestion is avoided at two levels, knot and link, by using different techniques, including close loop or open loop. This paper proposed a new method (CATLB) to avoid congestion by using the traffic load balancing technique, CATLB is based on the popular algorithm Round Robin in the process of distributing packets coming to a particular node on the links connected to it, which leads to the same destination to avoid congestion on one of the links and out of service and thus leads to more load on the other links until the network collapses. Method has been simulated using OMNET++ and got around 15% improvement in the performance from the most popular similar algorithms in this field ECMP and TinyFlow.

show abstract

Section: Explicit Signalingmentioning

confidence: 99%

Congestion Avoidance using Traffic Load Balancing (CATLB) in Computer Networks

Altameemi

Nassar

2022

IJICI

View full text Add to dashboard Cite

show abstract

“…It is common knowledge, however, that using packet drops to drive the congestion control actions exhibits some limitations in wireless networks—where discarding packets due to transmission errors is not a rare event—and in networks with a large bandwidth ×delay product, where sharply halving the window size may be an overreaction. This is the motivation behind a plethora of protocol proposals that either propose the use of more feedback information about congestion, such as eXplicit Control Protocol (XCP) variants , or directly advocate the use of congestion signals of a different kind. The class of delay‐based congestion avoidance algorithms (DCAs) includes, for instance, Congestion Avoidance using Round‐trip Delay or CARD , DUAL , Vegas , (FAST) and Low Extra Delay Background Transport (LEDBAT) , in chronological order.…”

Section: Introductionmentioning

confidence: 99%

Common problems in delay‐based congestion control algorithms: a gallery of solutions

Rodríguez-Pérez¹,

Herrería-Alonso²,

Fernández‐Veiga³

et al. 2011

Trans Emerging Tel Tech

View full text Add to dashboard Cite

SUMMARYAlthough delay-based congestion control protocols such as FAST promise to deliver better performance than traditional TCP Reno, they have not yet been widely incorporated to the Internet. Several factors have contributed to their lack of deployment. Probably, the main contributing factor is that they are not able to compete fairly against loss-based congestion control protocols. In fact, the transmission rate in equilibrium of delay-based approaches is always less than their fair share when they share the network with traditional TCP-Reno derivatives, that employ packet losses as their congestion signal. There are also other performance impairments caused by the sensitivity to errors in the measurement of the congestion signal (queuing delay) that reduce the efficiency and the intra-protocol fairness of the algorithms. In this paper we report, analyze and discuss some recent proposals in the literature to improve the dynamic behavior of delaybased congestion control algorithms, and FAST in particular. Coexistence of sources reacting differently to congestion, identifying congestion appearance in the reverse path and the persistent congestion problem are the issues specifically addressed.

show abstract

Congestion Control in Data Transmission Networks: Historical Perspective

Ignaciuk

Bartoszewicz

2012

Congestion Control in Data Transmission Networks

View full text Add to dashboard Cite

Explicit congestion control based on 1-bit probabilistic marking

Cited by 6 publications

References 58 publications

Congestion Avoidance using Traffic Load Balancing (CATLB) in Computer Networks

Congestion Avoidance using Traffic Load Balancing (CATLB) in Computer Networks

Common problems in delay‐based congestion control algorithms: a gallery of solutions

Congestion Control in Data Transmission Networks: Historical Perspective

Contact Info

Product

Resources

About