Dynamic programming QoS-based classification for links with limited service levels

Amr Mohamed; Hussein Alnuweiri

doi:10.1109/LCN.2005.56

Dynamic programming QoS-based classification for links with limited service levels

Amr Mohamed^*, Hussein Alnuweiri

^*Corresponding author for this work

University of British Columbia

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Citation (Scopus)

Abstract

We investigate the QoS-based classification of traffic streams for a multi-class link model with predetermined service levels, Specifically, we consider a link model with fixed service levels or fixed class weights which may be represented by a finite number of MPLS Label-Switched-Paths (LSPs). Our target is to classify a set of traffic streams each with arbitrary local QoS-demand into a small number of service levels while optimizing the residual-allocated-resources as a result of the traffic classification. The residual-allocated-resources will be measured by the service-quantization- overhead which is the summation of the differences between the required QoS and the offered service level for all traffic streams. We formulate the classification as a Dynamic-Programming problem. We then present a group of polynomial-time-algorithms to obtain the optimal classification for soft and hard QoS requirements. We also present the concept of "differentiation factor" and show the effect of this factor on minimizing the quantization-overhead.

Original language	English
Title of host publication	Proceedings - The IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005
Pages	51-58
Number of pages	8
DOIs	https://doi.org/10.1109/LCN.2005.56
Publication status	Published - 2005
Externally published	Yes
Event	IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005 - Sydney, Australia Duration: 15 Nov 2005 → 17 Nov 2005

Publication series

Name	Proceedings - Conference on Local Computer Networks, LCN
Volume	2005

Conference

Conference	IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005
Country/Territory	Australia
City	Sydney
Period	15/11/05 → 17/11/05

Access to Document

10.1109/LCN.2005.56

Cite this

@inproceedings{b455f4b2d8d84c859ecab7f962b60394,

title = "Dynamic programming QoS-based classification for links with limited service levels",

abstract = "We investigate the QoS-based classification of traffic streams for a multi-class link model with predetermined service levels, Specifically, we consider a link model with fixed service levels or fixed class weights which may be represented by a finite number of MPLS Label-Switched-Paths (LSPs). Our target is to classify a set of traffic streams each with arbitrary local QoS-demand into a small number of service levels while optimizing the residual-allocated-resources as a result of the traffic classification. The residual-allocated-resources will be measured by the service-quantization- overhead which is the summation of the differences between the required QoS and the offered service level for all traffic streams. We formulate the classification as a Dynamic-Programming problem. We then present a group of polynomial-time-algorithms to obtain the optimal classification for soft and hard QoS requirements. We also present the concept of {"}differentiation factor{"} and show the effect of this factor on minimizing the quantization-overhead.",

author = "Amr Mohamed and Hussein Alnuweiri",

year = "2005",

doi = "10.1109/LCN.2005.56",

language = "English",

isbn = "0769524214",

series = "Proceedings - Conference on Local Computer Networks, LCN",

pages = "51--58",

booktitle = "Proceedings - The IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005",

note = "IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005 ; Conference date: 15-11-2005 Through 17-11-2005",

}

Mohamed, A & Alnuweiri, H 2005, Dynamic programming QoS-based classification for links with limited service levels. in Proceedings - The IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005., 1550840, Proceedings - Conference on Local Computer Networks, LCN, vol. 2005, pp. 51-58, IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005, Sydney, Australia, 15/11/05. https://doi.org/10.1109/LCN.2005.56

Dynamic programming QoS-based classification for links with limited service levels. / Mohamed, Amr; Alnuweiri, Hussein.
Proceedings - The IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005. 2005. p. 51-58 1550840 (Proceedings - Conference on Local Computer Networks, LCN; Vol. 2005).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Dynamic programming QoS-based classification for links with limited service levels

AU - Mohamed, Amr

AU - Alnuweiri, Hussein

PY - 2005

Y1 - 2005

N2 - We investigate the QoS-based classification of traffic streams for a multi-class link model with predetermined service levels, Specifically, we consider a link model with fixed service levels or fixed class weights which may be represented by a finite number of MPLS Label-Switched-Paths (LSPs). Our target is to classify a set of traffic streams each with arbitrary local QoS-demand into a small number of service levels while optimizing the residual-allocated-resources as a result of the traffic classification. The residual-allocated-resources will be measured by the service-quantization- overhead which is the summation of the differences between the required QoS and the offered service level for all traffic streams. We formulate the classification as a Dynamic-Programming problem. We then present a group of polynomial-time-algorithms to obtain the optimal classification for soft and hard QoS requirements. We also present the concept of "differentiation factor" and show the effect of this factor on minimizing the quantization-overhead.

AB - We investigate the QoS-based classification of traffic streams for a multi-class link model with predetermined service levels, Specifically, we consider a link model with fixed service levels or fixed class weights which may be represented by a finite number of MPLS Label-Switched-Paths (LSPs). Our target is to classify a set of traffic streams each with arbitrary local QoS-demand into a small number of service levels while optimizing the residual-allocated-resources as a result of the traffic classification. The residual-allocated-resources will be measured by the service-quantization- overhead which is the summation of the differences between the required QoS and the offered service level for all traffic streams. We formulate the classification as a Dynamic-Programming problem. We then present a group of polynomial-time-algorithms to obtain the optimal classification for soft and hard QoS requirements. We also present the concept of "differentiation factor" and show the effect of this factor on minimizing the quantization-overhead.

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

U2 - 10.1109/LCN.2005.56

DO - 10.1109/LCN.2005.56

M3 - Conference contribution

AN - SCOPUS:33751400290

SN - 0769524214

SN - 9780769524214

T3 - Proceedings - Conference on Local Computer Networks, LCN

SP - 51

EP - 58

BT - Proceedings - The IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005

T2 - IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005

Y2 - 15 November 2005 through 17 November 2005

ER -

Dynamic programming QoS-based classification for links with limited service levels

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this