A stateless fairness-driven active queue management scheme for efficient and fair bandwidth allocation in congested Internet routers

Abbas, Ghulam; Manzoor, Sanaullah; Hussain, Masroor

doi:10.1007/s11235-017-0306-3

Cited by 26 publications

(18 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Likewise, to generate TCP traffic, we use file transfer protocol applications transported through TCP Reno. In all scenarios, UDP constitutes almost 12% of the overall traffic to reflect the practical ratio prevalent on the Internet [13,22,[31][32][33][34]. For the considered network topology, the default ns-2 maximum window size of 20 segments may limit the TCP transmission rate by imposing a cap on TCP throughput over the shared link.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…For the considered network topology, the default ns-2 maximum window size of 20 segments may limit the TCP transmission rate by imposing a cap on TCP throughput over the shared link. To ensure that the maximum window size is not a limiting factor of the TCP throughput, each TCP connection is configured with a maximum window size of 300 segments to increase the amount of unacknowledged data that TCP can transmit in order to keep the pipe full [6,7,13,22,35,36]. The performance evaluation metrics include fairness, throughput, goodput, intra-protocol fairness, queuing delay, link utilization and the effect of the various packet and buffer sizes.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…Throughput measures the number of bits received by a destination node per second [13]. The primary objective of a fairness-driven AQM is to assure that all flows (i.e.…”

Section: Throughput and Fairnessmentioning

confidence: 99%

“…Based on the state-space and per-packet processing costs of their control functions, the existing fairness-driven AQM schemes are divided into three categories, namely, stateless (e.g. [5][6][7][8][9][10][11][12][13]), partial-state (e.g. [14][15][16][17][18][19][20][21][22]), and stateful (e.g.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

ARCH: A dual‐mode fairness‐driven AQM for promoting cooperative behaviour in best effort Internet

et al. 2019

Self Cite

View full text Add to dashboard Cite

The cooperative behaviour of end-systems in efficiently and fairly utilizing the scarce bandwidth is of paramount significance in the best effort Internet. Not only does the uncooperative behaviour result in unfairness, but it may also induce congestion collapse. How to urge end-systems to share the bandwidth cooperatively is a problem that depends, in essence, on incentives. This study presents a novel fairness-driven active queue management (AQM)-based incentive scheme to detect and take punitive action against any uncooperative behaviour. Different from all other fairness-driven AQM schemes, the proposed scheme offers a dual-mode control function that can adaptively switch between stateless and partial-state modes in order to be scalable. The control function remains stateless at low to moderate congestion levels and maintains a partial-state when congestion becomes severe. In the stateless mode, the identification and restriction of unresponsive flows are based on a matched-drop mechanism having a dynamic drawing factor to differentially drop packets from unresponsive flows. In the partialstate mode, a fair-share is estimated and flows whose arrival rates exceed the fair-share bandwidth get their rates limited to the fair rate. Simulation results demonstrate the reasonable performance improvement of the proposed scheme over well-known fairness-driven AQM schemes.

show abstract

Section: Performance Evaluationmentioning

confidence: 99%

Section: Performance Evaluationmentioning

confidence: 99%

“…Throughput measures the number of bits received by a destination node per second [13]. The primary objective of a fairness-driven AQM is to assure that all flows (i.e.…”

Section: Throughput and Fairnessmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

ARCH: A dual‐mode fairness‐driven AQM for promoting cooperative behaviour in best effort Internet

et al. 2019

Self Cite

View full text Add to dashboard Cite

show abstract

“…How exactly the dropping probability should evolve and on which factors it should depend, is a long debate among researchers. Several advanced algorithms for computing the dropping probability were proposed to date, see, for example [ 4 , 5 , 6 , 7 ] and the references given there. Some propositions are based on artificial neural networks (e.g., [ 8 ]), fuzzy logic (e.g., [ 9 ]) or genetic algorithms (e.g., [ 10 ]).…”

Section: Introductionmentioning

confidence: 99%

On the Transient Queue with the Dropping Function

Chydziñski

2020

Entropy

View full text Add to dashboard Cite

We deal with a queueing system, in which arriving packets are being dropped with the probability depending on the queue size. Such a scheme is used in several active queue management schemes proposed for Internet routers. In this paper, we derive and analyze a selected transient characteristic of the model, i.e., the probability that in a given time interval the queue size is kept under a predefined level. As the main purpose of the discussed queueing scheme is to maintain the queue size low, this is a natural characteristic to study. In addition to that, the average time to reach a given level is derived. Theoretical results for both characteristics are accompanied by numerical examples. Among other things, they demonstrate that the transient behavior of the queue may vary significantly with the shape of the dropping function, even if the steady-state performance remains unaltered.

show abstract

Evaluation of Utility Function Algorithm for Congestion Control in Computer Networks

Carrión

Ludeña-González

Sandoval

et al. 2020

Information and Communication Technologies

View full text Add to dashboard Cite

A stateless fairness-driven active queue management scheme for efficient and fair bandwidth allocation in congested Internet routers

Cited by 26 publications

References 43 publications

ARCH: A dual‐mode fairness‐driven AQM for promoting cooperative behaviour in best effort Internet

ARCH: A dual‐mode fairness‐driven AQM for promoting cooperative behaviour in best effort Internet

On the Transient Queue with the Dropping Function

Evaluation of Utility Function Algorithm for Congestion Control in Computer Networks

Contact Info

Product

Resources

About