QoS-based partitioning and resource allocation for link models with variable service levels

Amr Mohamed, Hussein Alnuweiri

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

Abstract

We consider the problem of QoS-based partitioning of traffic streams for a link model with adjustable service levels. Specifically, we consider a link model with variable service levels which may be mapped to a finite number of MPLS Label-Switehed-Paths (LSPs). Our target is to partition a set of traffic streams each with arbitrary local QoS-demand into a small number of classes and find the service level for each class while optimiadng the residual-allocated- resources as a result of the traffic partitioning. 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 partitioning process as a Dynamic Programming problem. We then present two polynomial time algorithms to obtain the QoS-based optimal partition with bandwidth allocation. Our results indicate that using 4 or 5 service levels will accomplish the trade-off between complexity and granularity irrespective of the distribution of the QoS requirements.

Original languageEnglish
Title of host publicationProceedings - 11th IEEE Symposium on Computers and Communications, ISCC 2006
Pages890-896
Number of pages7
DOIs
Publication statusPublished - 1 Dec 2006
Externally publishedYes
Event11th IEEE Symposium on Computers and Communications, ISCC 2006 - Cagliari, Sardinia, Italy
Duration: 26 Jun 200629 Jun 2006

Other

Other11th IEEE Symposium on Computers and Communications, ISCC 2006
CountryItaly
CityCagliari, Sardinia
Period26/6/0629/6/06

Fingerprint

Service Levels
Resource Allocation
Resource allocation
Partitioning
Quality of service
Traffic
Telecommunication traffic
Optimal Partition
Bandwidth Allocation
Resources
Model
Frequency allocation
Granularity
Dynamic programming
Summation
Polynomial-time Algorithm
Telecommunication links
Dynamic Programming
Labels
Quantization

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Mathematics(all)
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Mohamed, A., & Alnuweiri, H. (2006). QoS-based partitioning and resource allocation for link models with variable service levels. In Proceedings - 11th IEEE Symposium on Computers and Communications, ISCC 2006 (pp. 890-896). [1691136] https://doi.org/10.1109/ISCC.2006.136

QoS-based partitioning and resource allocation for link models with variable service levels. / Mohamed, Amr; Alnuweiri, Hussein.

Proceedings - 11th IEEE Symposium on Computers and Communications, ISCC 2006. 2006. p. 890-896 1691136.

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

Mohamed, A & Alnuweiri, H 2006, QoS-based partitioning and resource allocation for link models with variable service levels. in Proceedings - 11th IEEE Symposium on Computers and Communications, ISCC 2006., 1691136, pp. 890-896, 11th IEEE Symposium on Computers and Communications, ISCC 2006, Cagliari, Sardinia, Italy, 26/6/06. https://doi.org/10.1109/ISCC.2006.136
Mohamed A, Alnuweiri H. QoS-based partitioning and resource allocation for link models with variable service levels. In Proceedings - 11th IEEE Symposium on Computers and Communications, ISCC 2006. 2006. p. 890-896. 1691136 https://doi.org/10.1109/ISCC.2006.136
Mohamed, Amr ; Alnuweiri, Hussein. / QoS-based partitioning and resource allocation for link models with variable service levels. Proceedings - 11th IEEE Symposium on Computers and Communications, ISCC 2006. 2006. pp. 890-896
@inproceedings{a723e0cc81704bd6826ab46c2329165f,
title = "QoS-based partitioning and resource allocation for link models with variable service levels",
abstract = "We consider the problem of QoS-based partitioning of traffic streams for a link model with adjustable service levels. Specifically, we consider a link model with variable service levels which may be mapped to a finite number of MPLS Label-Switehed-Paths (LSPs). Our target is to partition a set of traffic streams each with arbitrary local QoS-demand into a small number of classes and find the service level for each class while optimiadng the residual-allocated- resources as a result of the traffic partitioning. 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 partitioning process as a Dynamic Programming problem. We then present two polynomial time algorithms to obtain the QoS-based optimal partition with bandwidth allocation. Our results indicate that using 4 or 5 service levels will accomplish the trade-off between complexity and granularity irrespective of the distribution of the QoS requirements.",
author = "Amr Mohamed and Hussein Alnuweiri",
year = "2006",
month = "12",
day = "1",
doi = "10.1109/ISCC.2006.136",
language = "English",
isbn = "0769525881",
pages = "890--896",
booktitle = "Proceedings - 11th IEEE Symposium on Computers and Communications, ISCC 2006",

}

TY - GEN

T1 - QoS-based partitioning and resource allocation for link models with variable service levels

AU - Mohamed, Amr

AU - Alnuweiri, Hussein

PY - 2006/12/1

Y1 - 2006/12/1

N2 - We consider the problem of QoS-based partitioning of traffic streams for a link model with adjustable service levels. Specifically, we consider a link model with variable service levels which may be mapped to a finite number of MPLS Label-Switehed-Paths (LSPs). Our target is to partition a set of traffic streams each with arbitrary local QoS-demand into a small number of classes and find the service level for each class while optimiadng the residual-allocated- resources as a result of the traffic partitioning. 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 partitioning process as a Dynamic Programming problem. We then present two polynomial time algorithms to obtain the QoS-based optimal partition with bandwidth allocation. Our results indicate that using 4 or 5 service levels will accomplish the trade-off between complexity and granularity irrespective of the distribution of the QoS requirements.

AB - We consider the problem of QoS-based partitioning of traffic streams for a link model with adjustable service levels. Specifically, we consider a link model with variable service levels which may be mapped to a finite number of MPLS Label-Switehed-Paths (LSPs). Our target is to partition a set of traffic streams each with arbitrary local QoS-demand into a small number of classes and find the service level for each class while optimiadng the residual-allocated- resources as a result of the traffic partitioning. 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 partitioning process as a Dynamic Programming problem. We then present two polynomial time algorithms to obtain the QoS-based optimal partition with bandwidth allocation. Our results indicate that using 4 or 5 service levels will accomplish the trade-off between complexity and granularity irrespective of the distribution of the QoS requirements.

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

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

U2 - 10.1109/ISCC.2006.136

DO - 10.1109/ISCC.2006.136

M3 - Conference contribution

SN - 0769525881

SN - 9780769525884

SP - 890

EP - 896

BT - Proceedings - 11th IEEE Symposium on Computers and Communications, ISCC 2006

ER -