Performance improvement of active queue management with per-flow scheduling

Nabeshima, Masayoshi; Yata, Kouji

doi:10.1049/ip-com:20045217

Cited by 7 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Suter et al [3] have shown that Longest Queue Drop (LQD) outperforms RED with per-flow scheduling in term of fair bandwidth allocation. Nabeshima and Yata [15] have proposed a new AQM algorithm with per-flow scheduling and have demonstrated through simulation experiments that this mechanism could achieve approximately the same degree of fairness and throughput as LQD but smaller average queueing delay and packet loss ratios that LQD.…”

Section: Introductionmentioning

confidence: 94%

An Analytical Model for Priority-Based AQM in the Presence of Heterogeneous Network Traffic

Wang

Min

Awan

2008

22nd International Conference on Advanced Information Networking and Applications (Aina 2008)

View full text Add to dashboard Cite

Active Queue Management (AQM) coupled with differentiated scheduling mechanism is an important and promising scheme for congestion control and Quality-of-Service (QoS) guarantee in communication networks. This paper develops a new analytical performance model for priority-based AQM subject to heterogeneous bursty traffic modelled by MarkovModulated Poisson Processes (MMPP) and non-bursty traffic modelled by Poisson processes. Individual thresholds for each traffic class and Pre-emptiveResume (PR) priority scheduling mechanism are adopted to control traffic injection rate and support differential QoS. The model derives the expression of the aggregate and marginal performance metrics of the priority-based AQM system. The credibility of the model is demonstrated by comparing the analytic results with those obtained through extensive simulation experiments. The proposed model is used to investigate the impact of the squared coefficient of variation (SCV) of bursty traffic on the performance of AQM.

show abstract

Section: Introductionmentioning

confidence: 94%

An Analytical Model for Priority-Based AQM in the Presence of Heterogeneous Network Traffic

Wang

Min

Awan

2008

22nd International Conference on Advanced Information Networking and Applications (Aina 2008)

View full text Add to dashboard Cite

show abstract

“…LRU-RED [4] was developed based on a LRU list to identify high bandwidth flows. This scheme derived from the fact that a router should see a packet form a fast flow more often than a slow flow, so that the number of states to be kept for maintaining the fairness can be bounded.…”

Section: Scalable Fair Redmentioning

confidence: 99%

“…With the increasing popularity of stream media applications, the fairness of networks has attracted much research attention [1][2][3][4][5][6][7][8][9][10][11]. With these research efforts, a number of schemes [4][5][6][7][8][9][10][11][12] were proposed to improve the fairness in networks with modifications to the queue management schemes implemented in Internet routers.…”

Section: Introductionmentioning

confidence: 99%

“…Although per-flow queue (i.e. Fair Queuing [4,12]) is the most direct solution to the unfair problems, with the large number of flows possibly sharing a link, it is not scalable for an Internet router. Notice that a router sees packets from a fast flow more often than a slow flow; we propose in this paper the Scalable Fair Random Early Copyright © 2009 SciRes.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the Scalable Fairness and Efficient Active Queue Management of RED

Wang¹,

Lin²,

Zhou³

et al. 2009

IJCNS

View full text Add to dashboard Cite

Internet routers generally see packets from a fast flow more often than a slow flow. This suggests that network fairness may be improved without per-flow information. In this paper, we propose a scheme using Most Recently Used List (MRUL)-a list storing statistics of limited active flows that sorted in most recently seen first mode-to improve the fairness of RED. Based on the list, our proposed scheme jointly considers the identification and punish of the fast and unresponsive fast flows, and the protection of slow flows. Its performance improvements are demonstrated with extensive simulations. Different from the previous proposals, the complexity of our proposed scheme is proportional to the size of the MRUL list but not coupled with the queue buffer size or the number of active flows, so it is scalable and suitable for various routers. In addition, another issue we address in this paper is queue management in RED. Specifically, we replace the linear packet dropping function in RED by a judicially designed nonlinear quadratic function, while original RED remains unchanged. We call this new scheme Nonlinear RED, or NLRED. The underlying idea is that, with the proposed nonlinear packet dropping function, packet dropping becomes gentler than RED at light traffic load but more aggressive at heavy load. As a result, at light traffic load, NLRED encourages the router to operate in a range of average queue sizes rather than a fixed one. When the load is heavy and the average queue size approaches the pre-determined maximum threshold (i.e. the queue size may soon get out of control), NLRED allows more aggressive packet dropping to back off from it. Simulations demonstrate that NLRED achieves a higher and more stable throughput than RED and REM. Since NLRED is fully compatible with RED, we can easily upgrade/replace the existing RED implementations by NLRED

show abstract

“…Active queue usually drop or mark packets before the queue is full. Typically, they operate by maintaining one or more drop/mark probabilities (Reddy and Reddy, 2009 In the case of an over estimation of the capacity the stabilization queue length will be positive, otherwise it will be negative (Nabeshima and Yata, 2005;Hassan et al, 2009).…”

Section: Methodsmentioning

confidence: 99%

An Effective Queue Management Scheme for Data Communication

Thavasi¹

2011

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement:The growth in the needs of Internet applications that transmit massive amount of data has led to the emergence of Effective Queue Management. Approach: Queues were used to smooth spikes in incoming packet rates and to allow the router sufficient time for packet processing. When the waiting time is less a better queue management is ensured thereby resulting in increased flow in the queue. When the incoming packet rate was higher than the router's outgoing packet rate, the queue size was increased, eventually exceeding the available buffer space. With respect to TCP's RED queue management, the problem was that the buffer size was reduced to half and the packets were dropped abruptly. The congestion was detected early and the packets were dropped. The merit may be that congestion was detected early but the adverse effect was loss of packets. Results: The sender had to retransmit causing delay onto the network. This caused adverse effects on the network performance. In proposed system queue was extended whenever the number of packets present in the queue exceeds queue threshold. Packet drops were insignificantly even during network congestion. When the queue was continuously extended and if there was steady inflow of high volume of data, packet drop ratio was insignificant. Conclusions: Thus by the adoption of the proposed work, network throughput rose considerably thereby enabling effective data transfer. So it exhibits high bandwidth utilization, good throughput and processing time.

show abstract

Performance improvement of active queue management with per-flow scheduling

Cited by 7 publications

References 6 publications

An Analytical Model for Priority-Based AQM in the Presence of Heterogeneous Network Traffic

An Analytical Model for Priority-Based AQM in the Presence of Heterogeneous Network Traffic

On the Scalable Fairness and Efficient Active Queue Management of RED

An Effective Queue Management Scheme for Data Communication

Contact Info

Product

Resources

About