基于随机qos的计算服务水平链路模型分类

A. Mohamed, H. Alnuweiri
{"title":"基于随机qos的计算服务水平链路模型分类","authors":"A. Mohamed, H. Alnuweiri","doi":"10.1109/PACRIM.2005.1517301","DOIUrl":null,"url":null,"abstract":"We investigate the problem of stochastic-QoS-based-classification of traffic streams for a multi-class-link-model with predetermined service levels calculated based on the link's total load. 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 each with arbitrary local QoS requirement, in addition to the bandwidth 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 is 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 constrained integer-linear optimization problem. We then present two efficient algorithms based on branch and bound technique to obtain the optimal classification for a set of traffic streams for link models with predetermined service levels.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"3 21","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Stochastic QoS-based classification for link models with calculated service levels\",\"authors\":\"A. Mohamed, H. Alnuweiri\",\"doi\":\"10.1109/PACRIM.2005.1517301\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the problem of stochastic-QoS-based-classification of traffic streams for a multi-class-link-model with predetermined service levels calculated based on the link's total load. 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 each with arbitrary local QoS requirement, in addition to the bandwidth 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 is 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 constrained integer-linear optimization problem. We then present two efficient algorithms based on branch and bound technique to obtain the optimal classification for a set of traffic streams for link models with predetermined service levels.\",\"PeriodicalId\":346880,\"journal\":{\"name\":\"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.\",\"volume\":\"3 21\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.2005.1517301\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2005.1517301","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

研究了基于多类链路模型的基于随机qos的流量分类问题,该模型根据链路的总负载计算出预先确定的服务水平。具体来说,我们考虑了一个固定服务水平的链路模型,它可以由有限数量的mpls -标签交换路径(lsp)表示。我们的目标是将一组具有任意本地QoS需求的流量流(除了带宽需求)分类为少数服务级别,同时优化流量分类结果的剩余分配资源。剩余分配资源是通过服务量化开销来衡量的,服务量化开销是所有流量流所需的QoS和提供的服务级别之间差异的总和。我们将分类问题表述为一个有约束的整数-线性优化问题。然后,我们提出了基于分支和定界技术的两种高效算法,以获得具有预定服务水平的链路模型的一组流量的最优分类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Stochastic QoS-based classification for link models with calculated service levels
We investigate the problem of stochastic-QoS-based-classification of traffic streams for a multi-class-link-model with predetermined service levels calculated based on the link's total load. 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 each with arbitrary local QoS requirement, in addition to the bandwidth 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 is 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 constrained integer-linear optimization problem. We then present two efficient algorithms based on branch and bound technique to obtain the optimal classification for a set of traffic streams for link models with predetermined service levels.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信