Optimal QoS-based classification for link models with predetermined service levels

A. Mohamed, H. Alnuweiri
{"title":"Optimal QoS-based classification for link models with predetermined service levels","authors":"A. Mohamed, H. Alnuweiri","doi":"10.1109/CONTEL.2005.185910","DOIUrl":null,"url":null,"abstract":"We investigate the problem of optimal QoS- based classification of traffic streams in the context of multi- class link model with predetermined service levels. Specifically, we consider a link model with fixed service levels which may be represented by a finite number of MPLS Label Switched Paths (LSPs). Our target is to classify a set of traffic streams with arbitrary local QoS, in addition to the bandwidth requirements, to these service levels while achieving the minimum quantization overhead. The quantization overhead is defined as a function of the differences between the required and offered service levels. We formulate the classification as a constrained integer linear optimization problem. We then present two efficient algorithms to obtain the optimal classification for a set of traffic streams for link models with predetermined service levels to minimize the quantization overhead. Our results indicate that by properly selecting the service class weights, the quantization overhead can become as low as 2% using as few as 5 service levels for clustered QoS distribution. On the other hands, if the class weights are not selected appropriately the quantization overhead is around 32% for uniform QoS distribution.","PeriodicalId":265923,"journal":{"name":"Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005.","volume":"497 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 8th International Conference on Telecommunications, 2005. ConTEL 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONTEL.2005.185910","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

We investigate the problem of optimal QoS- based classification of traffic streams in the context of multi- class link model with predetermined service levels. Specifically, we consider a link model with fixed service levels which may be represented by a finite number of MPLS Label Switched Paths (LSPs). Our target is to classify a set of traffic streams with arbitrary local QoS, in addition to the bandwidth requirements, to these service levels while achieving the minimum quantization overhead. The quantization overhead is defined as a function of the differences between the required and offered service levels. We formulate the classification as a constrained integer linear optimization problem. We then present two efficient algorithms to obtain the optimal classification for a set of traffic streams for link models with predetermined service levels to minimize the quantization overhead. Our results indicate that by properly selecting the service class weights, the quantization overhead can become as low as 2% using as few as 5 service levels for clustered QoS distribution. On the other hands, if the class weights are not selected appropriately the quantization overhead is around 32% for uniform QoS distribution.
具有预定服务水平的链路模型的最优qos分类
研究了具有预定服务等级的多类链路模型中基于最优QoS的流分类问题。具体来说,我们考虑了一个具有固定服务水平的链路模型,它可以由有限数量的MPLS标签交换路径(lsp)表示。我们的目标是将一组具有任意本地QoS的流量流分类到这些服务级别,同时实现最小的量化开销。量化开销被定义为所需和提供的服务级别之间差异的函数。我们将分类问题表述为一个有约束的整数线性优化问题。然后,我们提出了两种有效的算法来获得具有预定服务水平的链路模型的一组流量流的最佳分类,以最小化量化开销。我们的结果表明,通过正确选择服务类权重,量化开销可以低至2%,使用最少5个服务级别进行集群QoS分布。另一方面,如果没有适当地选择类权重,则均匀QoS分布的量化开销约为32%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信