Drop counters are enough

Rade Stanojevic, Robert Shorten

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publication2007 Fifteenth IEEE International Workshop on Quality of Service, IWQoS 2007
Pages117-125
Number of pages9
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event2007 Fifteenth IEEE International Workshop on Quality of Service, IWQoS 2007 - Evanston, IL, United States
Duration: 21 Jun 200722 Jun 2007

Other

Other2007 Fifteenth IEEE International Workshop on Quality of Service, IWQoS 2007
CountryUnited States
CityEvanston, IL
Period21/6/0722/6/07

Fingerprint

Frequency allocation
Resource allocation
Static random access storage
Analytical models

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Stanojevic, R., & Shorten, R. (2007). Drop counters are enough. In 2007 Fifteenth IEEE International Workshop on Quality of Service, IWQoS 2007 (pp. 117-125). [4262461] https://doi.org/10.1109/IWQOS.2007.376557

Drop counters are enough. / Stanojevic, Rade; Shorten, Robert.

2007 Fifteenth IEEE International Workshop on Quality of Service, IWQoS 2007. 2007. p. 117-125 4262461.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Stanojevic, R & Shorten, R 2007, Drop counters are enough. in 2007 Fifteenth IEEE International Workshop on Quality of Service, IWQoS 2007., 4262461, pp. 117-125, 2007 Fifteenth IEEE International Workshop on Quality of Service, IWQoS 2007, Evanston, IL, United States, 21/6/07. https://doi.org/10.1109/IWQOS.2007.376557
Stanojevic R, Shorten R. Drop counters are enough. In 2007 Fifteenth IEEE International Workshop on Quality of Service, IWQoS 2007. 2007. p. 117-125. 4262461 https://doi.org/10.1109/IWQOS.2007.376557
Stanojevic, Rade ; Shorten, Robert. / Drop counters are enough. 2007 Fifteenth IEEE International Workshop on Quality of Service, IWQoS 2007. 2007. pp. 117-125
@inproceedings{a47d69849bc54a6e883489558e784240,
title = "Drop counters are enough",
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.",
author = "Rade Stanojevic and Robert Shorten",
year = "2007",
doi = "10.1109/IWQOS.2007.376557",
language = "English",
isbn = "1424411858",
pages = "117--125",
booktitle = "2007 Fifteenth IEEE International Workshop on Quality of Service, IWQoS 2007",

}

TY - GEN

T1 - Drop counters are enough

AU - Stanojevic, Rade

AU - Shorten, Robert

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=34748841920&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34748841920&partnerID=8YFLogxK

U2 - 10.1109/IWQOS.2007.376557

DO - 10.1109/IWQOS.2007.376557

M3 - Conference contribution

SN - 1424411858

SN - 9781424411856

SP - 117

EP - 125

BT - 2007 Fifteenth IEEE International Workshop on Quality of Service, IWQoS 2007

ER -