Stanojević, Rade and Shorten, Robert N. (2007) Drop counters are enough. In: 2007 Fifteenth IEEE International Workshop on Quality of Service. IEEE, pp. 117-125. ISBN 1-4244-1185-8
Download (5MB)
|
Abstract
Small Flow Completion Time (FCT) of short-lived flows, and fair bandwidth allocation of long-lived flows have been two major, usually concurrent, goals in the design of resource allocation algorithms. In this paper we present a framework that naturally unifies these two objectives under a single umbrella; namely by proposing resource allocation algorithm Markov Active Yield (MAY). Based on a probabilistic strategy: "drop proportional to the amount of past drops", MAY achieves very small FCT among short-lived flows as well as max-min fair bandwidth allocation among long-lived flows, using only the information of short history of already dropped packets. It turns out that extremely small amount of on-chip SRAM (roughly 1 bit per flow in Pareto-like flow size distributions) is enough for storing this drop history. Analytical models are presented and analyzed and accuracy of results is verified experimentally using packet level ns2 simulations.
Item Type: | Book Section |
---|---|
Additional Information: | "©2007 IEEE. Reprinted from 2007 Fifteenth IEEE International Workshop on Quality of Service. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE." http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4262461&isnumber=4262440 |
Keywords: | Markov processes; SRAM chips; Bandwidth allocation; Resource allocation; Telecommunication networks; Telecommunication traffic; Markov active yield; SRAM on-chip; Communication network; Flow completion time; Max-min fair bandwidth allocation; Packet level ns2 simulation; Resource allocation algorithm; Hamilton Institute. |
Academic Unit: | Faculty of Science and Engineering > Computer Science Faculty of Science and Engineering > Research Institutes > Hamilton Institute |
Item ID: | 1758 |
Identification Number: | https://doi.org/10.1109/IWQOS.2007.376557 |
Depositing User: | Hamilton Editor |
Date Deposited: | 22 Dec 2009 10:35 |
Publisher: | IEEE |
Refereed: | Yes |
URI: | |
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)
Item control page |
Downloads
Downloads per month over past year