Dynamic Detection and Expulsion Buffer Management Scheme for High-Speed Networks

Yang, Jui-Pin

doi:10.1587/transcom.e94.b.2243

Cited by 4 publications

(6 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The two-layer mapping mechanism imposes additional burden on edge routers, but it can efficiently speed up the packet comparisons while reducing memory consumption on core routers. For instance, if = 8 bits (get first 8 bits from160 bits producing by SHA-1), = 32, = 2, = 7 and = 128, the original AFQ requires 32 × To compare the fairness, we define the Normalized Bandwidth Ratio (NBR) for a specific flow based on Equation (8). NBR j denotes NBR; D j denotes the mean departure rate; and r j denotes the Mean Arrival Rate (MAR), all related to flow j. Additionally, f denotes the Max-Min Fair Share Rate (MMFSR).…”

Section: Adaptive Filtering Queueingmentioning

confidence: 99%

See 1 more Smart Citation

Adaptive Filtering Queueing for Improving Fairness

Yang¹

2015

Applied Sciences

Self Cite

View full text Add to dashboard Cite

Abstract:In this paper, we propose a scalable and efficient Active Queue Management (AQM) scheme to provide fair bandwidth sharing when traffic is congested dubbed Adaptive Filtering Queueing (AFQ). First, AFQ identifies the filtering level of an arriving packet by comparing it with a flow label selected at random from the first level to an estimated level in the filtering level table. Based on the accepted traffic estimation and the previous fair filtering level, AFQ updates the fair filtering level. Next, AFQ uses a simple packet-dropping algorithm to determine whether arriving packets are accepted or discarded. To enhance AFQ's feasibility in high-speed networks, we propose a two-layer mapping mechanism to effectively simplify the packet comparison operations. Simulation results demonstrate that AFQ achieves optimal fairness when compared with Rotating Preference Queues (RPQ), Core-Stateless Fair Queueing (CSFQ), CHOose and Keep for responsive flows, CHOose and Kill for unresponsive flows (CHOKe) and First-In First-Out (FIFO) schemes under a variety of traffic conditions.

show abstract

Section: Adaptive Filtering Queueingmentioning

confidence: 99%

“…DRR needs to maintain per-flow state. In addition, DRR must work with a pushout (PO) buffer management scheme that avoids buffer shortages on certain flows [8]. When a packet arrives at a router with a full buffer, PO will push out one or more residing packets from the longest virtual queue.…”

Section: Introductionmentioning

confidence: 99%

Adaptive Filtering Queueing for Improving Fairness

Yang¹

2015

Applied Sciences

Self Cite

View full text Add to dashboard Cite

show abstract

“…10 If both packets belong to the same flow, the packet size of the residing packet is added. The operation repeats until all residing packets have been compared.…”

Section: Related Workmentioning

confidence: 99%

“…Dynamic Detection and Expulsion (DDE) dynamically detects buffer occupancy and then expels residing packets according to packet comparisons. 10 Compared with CHOKe, DDE has better fairness under various network scenarios. However, DDE has higher complexity because it has to maintain queue status, packet size and flow identification related to each residing packet.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient fairness using Early Discriminative Dropping

Yang

2015

SIMULATION

Self Cite

View full text Add to dashboard Cite

The queue management scheme in a router is critical for computer networks because it not only controls the fairness of bandwidth sharing among competing flows, but also contributes to enhancing the efficiency of congestion control algorithms. In this paper, a new queue management scheme, Early Discriminative Dropping (EDD), is proposed to make routers fairer. EDD employs a single queue. In addition, this scheme consists of three main components. Firstly, a threshold estimator evaluates control thresholds based on queue status and the number of accepted packets. Secondly, a quota estimator allocates quotas, which prevent arriving packets of non-aggressive flows from being discarded during congested traffic. Finally, a simple packet-dropping algorithm determines acceptance or discarding of the arriving packet according to current control threshold and available quotas. Using computer simulations, we show that the EDD scheme demonstrates robust and excellent fairness compared with Rotating Preference Queues, Core-stateless Fair Queueing, Dynamic Detection and Expulsion, CHOose and Keep for responsive flows, CHOose and Kill for unresponsive flows and First In First Out under various network topologies and traffic conditions. EDD has a complexity of O(1). Hence, it is feasible for deployment in computer networks where high-performance and high-speed routers exist.

show abstract

Rotating Preference Queues: An Efficient Queue Management Scheme for Fair Bandwidth Allocation

Yang

2013

IEEE Commun. Lett.

View full text Add to dashboard Cite

Dynamic Detection and Expulsion Buffer Management Scheme for High-Speed Networks

Cited by 4 publications

References 8 publications

Adaptive Filtering Queueing for Improving Fairness

Adaptive Filtering Queueing for Improving Fairness

Efficient fairness using Early Discriminative Dropping

Rotating Preference Queues: An Efficient Queue Management Scheme for Fair Bandwidth Allocation

Contact Info

Product

Resources

About