J. Joutsensalo, A. Viinikainen, Timo Hämäläinen, Mika Wikström
{"title":"Bandwidth allocation and pricing for telecommunications network","authors":"J. Joutsensalo, A. Viinikainen, Timo Hämäläinen, Mika Wikström","doi":"10.1109/NGI.2005.1431662","DOIUrl":null,"url":null,"abstract":"The pricing of future network services should comparable to the service quality. In this paper we present a packet scheduling scheme which ensures bandwidth as a quality of service (QoS) requirement and optimizes revenue of the network service provider. We derive a closed form formula for updating the adaptive weights of a packet scheduler from a revenue-based optimization problem. The weight updating procedure is fast and independent on any assumption of the connections' statistical behavior. The algorithm is simulated and compared to constant weights with and without a call admission control (CAC) mechanism. Also, a mechanism for guaranteeing a minimum mean bandwidth for different service classes is presented as supplement to the CAC procedure.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Next Generation Internet Networks, 2005","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NGI.2005.1431662","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
The pricing of future network services should comparable to the service quality. In this paper we present a packet scheduling scheme which ensures bandwidth as a quality of service (QoS) requirement and optimizes revenue of the network service provider. We derive a closed form formula for updating the adaptive weights of a packet scheduler from a revenue-based optimization problem. The weight updating procedure is fast and independent on any assumption of the connections' statistical behavior. The algorithm is simulated and compared to constant weights with and without a call admission control (CAC) mechanism. Also, a mechanism for guaranteeing a minimum mean bandwidth for different service classes is presented as supplement to the CAC procedure.