File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.comnet.2006.04.007
- Scopus: eid_2-s2.0-33749064179
- WOS: WOS:000241505900015
- Find via
Supplementary
-
Bookmarks:
- CiteULike: 1
- Citations:
- Appears in Collections:
Article: Nonlinear RED: A simple yet efficient active queue management scheme
Title | Nonlinear RED: A simple yet efficient active queue management scheme |
---|---|
Authors | |
Keywords | Active queue management Nonlinear RED Random early marking |
Issue Date | 2006 |
Publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comnet |
Citation | Computer Networks, 2006, v. 50 n. 18, p. 3784-3794 How to Cite? |
Abstract | Among various active queue management schemes (AQM), random early detection (RED) is probably the most extensively studied. Unlike the existing RED enhancement schemes, we replace the linear packet dropping function in RED by a judicially designed nonlinear quadratic function. The rest of the 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, another efficient variant of RED. Since NLRED is fully compatible with RED, we can easily upgrade/replace the existing RED implementations by NLRED. © 2006 Elsevier B.V. All rights reserved. |
Persistent Identifier | http://hdl.handle.net/10722/73681 |
ISSN | 2023 Impact Factor: 4.4 2023 SCImago Journal Rankings: 1.520 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhou, K | en_HK |
dc.contributor.author | Yeung, KL | en_HK |
dc.contributor.author | Li, VOK | en_HK |
dc.date.accessioned | 2010-09-06T06:53:44Z | - |
dc.date.available | 2010-09-06T06:53:44Z | - |
dc.date.issued | 2006 | en_HK |
dc.identifier.citation | Computer Networks, 2006, v. 50 n. 18, p. 3784-3794 | en_HK |
dc.identifier.issn | 1389-1286 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/73681 | - |
dc.description.abstract | Among various active queue management schemes (AQM), random early detection (RED) is probably the most extensively studied. Unlike the existing RED enhancement schemes, we replace the linear packet dropping function in RED by a judicially designed nonlinear quadratic function. The rest of the 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, another efficient variant of RED. Since NLRED is fully compatible with RED, we can easily upgrade/replace the existing RED implementations by NLRED. © 2006 Elsevier B.V. All rights reserved. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comnet | en_HK |
dc.relation.ispartof | Computer Networks | en_HK |
dc.rights | Computer Networks. Copyright © Elsevier BV. | en_HK |
dc.subject | Active queue management | en_HK |
dc.subject | Nonlinear RED | en_HK |
dc.subject | Random early marking | en_HK |
dc.title | Nonlinear RED: A simple yet efficient active queue management scheme | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1389-1286&volume=50&spage=3784&epage=3794&date=2006&atitle=Nonlinear+RED:+A+Simple+Yet+Efficient+Active+Queue+Management+Scheme | en_HK |
dc.identifier.email | Yeung, KL:kyeung@eee.hku.hk | en_HK |
dc.identifier.email | Li, VOK:vli@eee.hku.hk | en_HK |
dc.identifier.authority | Yeung, KL=rp00204 | en_HK |
dc.identifier.authority | Li, VOK=rp00150 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/j.comnet.2006.04.007 | en_HK |
dc.identifier.scopus | eid_2-s2.0-33749064179 | en_HK |
dc.identifier.hkuros | 134471 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-33749064179&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 50 | en_HK |
dc.identifier.issue | 18 | en_HK |
dc.identifier.spage | 3784 | en_HK |
dc.identifier.epage | 3794 | en_HK |
dc.identifier.isi | WOS:000241505900015 | - |
dc.publisher.place | Netherlands | en_HK |
dc.identifier.scopusauthorid | Zhou, K=9044981400 | en_HK |
dc.identifier.scopusauthorid | Yeung, KL=7202424908 | en_HK |
dc.identifier.scopusauthorid | Li, VOK=7202621685 | en_HK |
dc.identifier.citeulike | 11855999 | - |
dc.identifier.issnl | 1389-1286 | - |