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

Amr Mohamed, Hussein Alnuweiri

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

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 languageEnglish
Title of host publicationProceedings - The IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005
Pages51-58
Number of pages8
Volume2005
DOIs
Publication statusPublished - 1 Dec 2005
Externally publishedYes
EventIEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005 - Sydney, Australia
Duration: 15 Nov 200517 Nov 2005

Other

OtherIEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005
CountryAustralia
CitySydney
Period15/11/0517/11/05

Fingerprint

Dynamic programming
Quality of service
Telecommunication traffic
Telecommunication links
Labels
Polynomials

ASJC Scopus subject areas

  • Engineering(all)

Cite this

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 (Vol. 2005, pp. 51-58). [1550840] 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. Vol. 2005 2005. p. 51-58 1550840.

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

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. vol. 2005, 1550840, 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
Mohamed A, Alnuweiri H. Dynamic programming QoS-based classification for links with limited service levels. In Proceedings - The IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005. Vol. 2005. 2005. p. 51-58. 1550840 https://doi.org/10.1109/LCN.2005.56
Mohamed, Amr ; Alnuweiri, Hussein. / Dynamic programming QoS-based classification for links with limited service levels. Proceedings - The IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005. Vol. 2005 2005. pp. 51-58
@inproceedings{adf79297256e40b4bd36551d51e12089,
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",
month = "12",
day = "1",
doi = "10.1109/LCN.2005.56",
language = "English",
isbn = "0769524214",
volume = "2005",
pages = "51--58",
booktitle = "Proceedings - The IEEE Conference on Local Computer Networks - 30th Anniversary, LCN 2005",

}

TY - GEN

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

AU - Mohamed, Amr

AU - Alnuweiri, Hussein

PY - 2005/12/1

Y1 - 2005/12/1

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

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

U2 - 10.1109/LCN.2005.56

DO - 10.1109/LCN.2005.56

M3 - Conference contribution

SN - 0769524214

SN - 9780769524214

VL - 2005

SP - 51

EP - 58

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

ER -