Bandwidth allocation and pricing for telecommunications network

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.
电信网络带宽分配与定价
未来网络服务的定价应与服务质量相适应。本文提出了一种保证带宽作为服务质量(QoS)要求并优化网络服务提供商收益的分组调度方案。从基于收益的优化问题出发,导出了包调度程序自适应权值更新的封闭公式。权重更新过程快速且不依赖于对连接统计行为的任何假设。对该算法进行了仿真,并与带和不带CAC机制的恒权算法进行了比较。此外,还提出了一种保证不同服务类别的最小平均带宽的机制,作为对CAC过程的补充。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信