Stanojević, Rade and Shorten, Robert N. (2007) Beyond CHOKe: stateless fair queueing. In: Network control and optimization: first EuroFGI international conference. Springer. ISBN 978-3-540-72708-8
PDF
Mnetcoop.pdf
Download (160kB)
Mnetcoop.pdf
Download (160kB)
Abstract
Making drop decisions to enforce the max-min fair resource
allocation in a network of standard TCP flows without any explicit state information is a challenging problem. Here we propose a solution to this problem by developing a suite of stateless queue management schemes that we refer to as Multi-Level Comparison with index l (MLC(l)). We show analytically, using a Markov chain model, that for an arbitrary network topology of standard TCP flows and queues employing MLC(l), the resource allocation converges to max-min fair as l increases. The analytical findings are verified experimentally using packet level ns2 simulations.
Item Type: | Book Section |
---|---|
Keywords: | Stateless fair queueing; Multi level comparison; CHOKe; Model and analysis of power-drop; Hamilton Institute. |
Academic Unit: | Faculty of Science and Engineering > Research Institutes > Hamilton Institute |
Item ID: | 1681 |
Depositing User: | Hamilton Editor |
Date Deposited: | 23 Nov 2009 16:51 |
Journal or Publication Title: | Network control and optimization: first EuroFGI international conference |
Publisher: | Springer |
Refereed: | Yes |
URI: | https://mu.eprints-hosting.org/id/eprint/1681 |
Use Licence: | This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here |
Repository Staff Only (login required)
Downloads
Downloads per month over past year