{"title":"简单有效的多业务网络定价机制","authors":"R. Simon, B. Jukic, Woan Sun Chang","doi":"10.1109/LCN.2001.990807","DOIUrl":null,"url":null,"abstract":"This paper presents a fully distributed simple and efficient pricing mechanism that combines admission control for QoS traffic with pricing policies for both best-effort and QoS traffic. Using readily available network measurements, we show how near-optimal pricing policies can be obtained for resource allocation between QoS and best-effort traffic. One of the advantages of our scheme is that it is ex-ante, meaning that the price structure does not change after service has begun.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Simple and efficient pricing mechanisms for multi-service networks\",\"authors\":\"R. Simon, B. Jukic, Woan Sun Chang\",\"doi\":\"10.1109/LCN.2001.990807\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a fully distributed simple and efficient pricing mechanism that combines admission control for QoS traffic with pricing policies for both best-effort and QoS traffic. Using readily available network measurements, we show how near-optimal pricing policies can be obtained for resource allocation between QoS and best-effort traffic. One of the advantages of our scheme is that it is ex-ante, meaning that the price structure does not change after service has begun.\",\"PeriodicalId\":213526,\"journal\":{\"name\":\"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2001.990807\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2001.990807","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Simple and efficient pricing mechanisms for multi-service networks
This paper presents a fully distributed simple and efficient pricing mechanism that combines admission control for QoS traffic with pricing policies for both best-effort and QoS traffic. Using readily available network measurements, we show how near-optimal pricing policies can be obtained for resource allocation between QoS and best-effort traffic. One of the advantages of our scheme is that it is ex-ante, meaning that the price structure does not change after service has begun.