A. Viinikainen, J. Joutsensalo, M. Wikstrom, T. Hamalainen
{"title":"下一代网络的定价和带宽分配","authors":"A. Viinikainen, J. Joutsensalo, M. Wikstrom, T. Hamalainen","doi":"10.1109/ICACT.2005.245823","DOIUrl":null,"url":null,"abstract":"In this paper we propose a packet scheduling scheme for ensuring bandwidth as a quality of service (QoS) requirement and optimizing revenue of the network service provider. A closed form formula for updating the weights of a packet scheduler is derived from a revenue-based optimization problem. The weight updating procedure is fast and independent on the assumption of the connections' statistical behavior. Also, a call admission control (CAC) is implemented in context of our scenario","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"416 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Pricing and bandwidth allocation for the next generation networks\",\"authors\":\"A. Viinikainen, J. Joutsensalo, M. Wikstrom, T. Hamalainen\",\"doi\":\"10.1109/ICACT.2005.245823\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose a packet scheduling scheme for ensuring bandwidth as a quality of service (QoS) requirement and optimizing revenue of the network service provider. A closed form formula for updating the weights of a packet scheduler is derived from a revenue-based optimization problem. The weight updating procedure is fast and independent on the assumption of the connections' statistical behavior. Also, a call admission control (CAC) is implemented in context of our scenario\",\"PeriodicalId\":293442,\"journal\":{\"name\":\"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.\",\"volume\":\"416 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACT.2005.245823\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACT.2005.245823","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Pricing and bandwidth allocation for the next generation networks
In this paper we propose a packet scheduling scheme for ensuring bandwidth as a quality of service (QoS) requirement and optimizing revenue of the network service provider. A closed form formula for updating the weights of a packet scheduler is derived from a revenue-based optimization problem. The weight updating procedure is fast and independent on the assumption of the connections' statistical behavior. Also, a call admission control (CAC) is implemented in context of our scenario
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
