{"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}
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.