VRED: AN IMPROVEMENT OVER RED ALGORITHM BY USING QUEUE LENGTH GROWTH VELOCITY

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

JAMALI SHAHRAM; ALIPASANDI BITA; ALIPASANDI NEDA

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ADVANCES IN COMPUTER RESEARCH Year:2013 | Volume:4 | Issue:1 (11) Page(s): 31-38

Download Full-Text

View:

412

Download:

Cites:

Information Journal Paper

Title

VRED: AN IMPROVEMENT OVER RED ALGORITHM BY USING QUEUE LENGTH GROWTH VELOCITY

Author(s)

JAMALI SHAHRAM | ALIPASANDI BITA | ALIPASANDI NEDA | Issue Writer Certificate

Keywords

CONGESTION CONTROL

ACTIVE QUEUE MANAGEMENT

RANDOM EARLY DETECTION

PACKET DROPPING

UTILIZATION

Abstract

Active Queue Management (AQM) plays an important role in the Internet CONGESTION CONTROL. It tries to enhance CONGESTION CONTROL, and to achieve tradeoff between bottleneck UTILIZATION and delay. RANDOM EARLY DETECTION (RED) is the most popular ACTIVE QUEUE MANAGEMENT algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED algorithm uses only the average queue length as a congestion meter to trigger PACKET DROPPING or packet marking as a congestion feedback. Since the average queue length considers only long–term behavior of any queue, this approach fails to see instantaneous changes of the queue length and hence its reaction is not fast enough. This paperincludes another meter i.e. queue length growth velocity to measure congestion level in the router. This leads to fast reaction to the congestion and hence improves the network performance. Simulation results show that the proposed algorithm outperforms RED algorithm in terms of number of dropped packets and bottleneck UTILIZATION.

Cites

No record.

References

Cite

APA: Copy

JAMALI, SHAHRAM, ALIPASANDI, BITA, & ALIPASANDI, NEDA. (2013). VRED: AN IMPROVEMENT OVER RED ALGORITHM BY USING QUEUE LENGTH GROWTH VELOCITY. JOURNAL OF ADVANCES IN COMPUTER RESEARCH, 4(1 (11)), 31-38. SID. https://sid.ir/paper/328724/en

Vancouver: Copy

JAMALI SHAHRAM, ALIPASANDI BITA, ALIPASANDI NEDA. VRED: AN IMPROVEMENT OVER RED ALGORITHM BY USING QUEUE LENGTH GROWTH VELOCITY. JOURNAL OF ADVANCES IN COMPUTER RESEARCH[Internet]. 2013;4(1 (11)):31-38. Available from: https://sid.ir/paper/328724/en

IEEE: Copy

SHAHRAM JAMALI, BITA ALIPASANDI, and NEDA ALIPASANDI, “VRED: AN IMPROVEMENT OVER RED ALGORITHM BY USING QUEUE LENGTH GROWTH VELOCITY,” JOURNAL OF ADVANCES IN COMPUTER RESEARCH, vol. 4, no. 1 (11), pp. 31–38, 2013, [Online]. Available: https://sid.ir/paper/328724/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops