An efficient and fair explicit congestion control protocol for high bandwidth-delay product networks

Wu, Hangxing; Ren, Fengyuan; Mu, Dejun; Gong, Xianwu

doi:10.1016/j.comcom.2008.11.016

Cited by 9 publications

(7 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The estimations of the key parameters and the congestion window update scheme are given next. More detailed descriptions can be found in .…”

Section: An Overview Of Efxcpmentioning

confidence: 99%

“…By combining the value in ToS field and mathematical deduction from Equation (1), per‐virtual flow average throughput

\overset{γ}{false}

is estimated as

\overset{γ}{false} = \frac{\sum r_{i} \times \frac{1}{n_{i}}}{\sum \frac{1}{n_{i}} \times To S_{i}} = \frac{\sum r_{i} \times \frac{s_{i}}{r_{i} \times t_{s}}}{\sum \frac{s_{i}}{r_{i} \times t_{s}} \times To S_{i}} = \frac{\sum s_{i}}{\sum \frac{s_{i}}{r_{i}} \times To S_{i}}

More detailed interpretation can be found in . Here is an instance tovalidate Equation (5).…”

Section: E2fxcp: a Priority‐based Bandwidth Allocationmentioning

confidence: 99%

“…EFXCP is an explicit congestion control protocol ; it can achieve excellent network performance: high bandwidth utilization, good stability, and convergence while maintaining a low and stable queue length, which means the low delay and low delay jitter. Moreover, EFXCP can allocate bandwidth exactly to competing flows, and no per‐flow state information is needed.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A universal QoS scheme for web applications

Wang

Zhang

2016

Int J Communication

Self Cite

View full text Add to dashboard Cite

SUMMARYThe common QoS metrics include delay, delay jitter, bandwidth guarantee, and so forth. Furthermore, the higher bandwidth requirement is also very important for some web applications, for instance, video on demand. Although QoS in networks has been well investigated during the past two decades, the existing QoS schemes usually aimed to satisfy only one QoS requirement for a particular web application. These schemes lack universality.Efficient and Fair eXplicit Congestion control Protocol (EFXCP) can achieve good network performance while maintaining low and stable queue length, which means low delay and delay jitter. In this paper, a new universal QoS scheme, E 2 FXCP, was proposed by extending EFXCP. Firstly, by utilizing the type of service field in the IP header to classify web applications into different priorities, a priority-based bandwidth allocation is implemented in E 2 FXCP, which can satisfy higher bandwidth requirement of some web applications. Secondly, by utilizing three bits in EFXCP header to mark different states of a web application with bandwidth guarantee requirement, E 2 FXCP can provide bandwidth guarantee to the web application. Simulations in Network Simulator 2 (NS2) have validated that E 2 FXCP is a universal QoS scheme, which can simultaneously satisfy multiple common QoS metrics for various web applications while maintaining good network performance.

show abstract

“…The estimations of the key parameters and the congestion window update scheme are given next. More detailed descriptions can be found in .…”

Section: An Overview Of Efxcpmentioning

confidence: 99%

“…By combining the value in ToS field and mathematical deduction from Equation (1), per‐virtual flow average throughput

\overset{γ}{false}

is estimated as

\overset{γ}{false} = \frac{\sum r_{i} \times \frac{1}{n_{i}}}{\sum \frac{1}{n_{i}} \times To S_{i}} = \frac{\sum r_{i} \times \frac{s_{i}}{r_{i} \times t_{s}}}{\sum \frac{s_{i}}{r_{i} \times t_{s}} \times To S_{i}} = \frac{\sum s_{i}}{\sum \frac{s_{i}}{r_{i}} \times To S_{i}}

More detailed interpretation can be found in . Here is an instance tovalidate Equation (5).…”

Section: E2fxcp: a Priority‐based Bandwidth Allocationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A universal QoS scheme for web applications

Wang

Zhang

2016

Int J Communication

Self Cite

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

“…A working example of an AQM scheme is random early detection (RED) designed by Floyd and Jacobson [8]. Due to the vulnerability of single-bit congestion notification, various researchers also proposed the use of two-bit [9], or multi-bit fields [10,11] for achieving better accuracy and faster convergence rates in data flow control. However, unlike the single-bit ECN, the multi-bit congestion notification requires appropriate changes to be introduced into the existing TCP rules, which hinders wider acceptance of those proposals.…”

Section: Introductionmentioning

confidence: 99%

Active queue management with discrete sliding modes in TCP networks

Ignaciuk¹,

Karbowańczyk²

2014

Bulletin of the Polish Academy of Sciences Technical Sciences

View full text Add to dashboard Cite

Abstract. In this paper, a new active queue management (AQM) algorithm for data traffic control in TCP/IP networks is developed. The algorithm design is based on the principles of discrete sliding-mode control. Unlike majority of earlier studies, the design procedure considers the effects of both non-negligible delay in transferring data and feedback information and unpredictable capacity variations. The switching function is selected to incorporate a delay compensation mechanism, which ensures efficient network operation even for large bandwidthdelay product connections. The proposed algorithm, implemented as a packet marking scheme, is tested in discrete event ns-2 simulator. The results show that the algorithm provides fast convergence to steady state after sudden, unanticipated capacity changes. By generating smaller overshoots, the proposed algorithm also allows for reducing buffer space requirements to avoid packet loss as compared to the benchmark AQM solutions.

show abstract

An efficient and fair explicit congestion control protocol for high bandwidth-delay product networks

Cited by 9 publications

References 13 publications

A universal QoS scheme for web applications

A universal QoS scheme for web applications

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

Active queue management with discrete sliding modes in TCP networks

Contact Info

Product

Resources

About