{"title":"在QoS和预算约束下公平分配带宽的机制","authors":"Sreenivas Gollapudi, D. Sivakumar","doi":"10.1109/IWQOS.2004.1309370","DOIUrl":null,"url":null,"abstract":"Equitable bandwidth allocation is essential when QoS requirements and purchasing power vary among users. To this end, we present a mechanism for bandwidth allocation based on differential pricing. In our model, the QoS vs. cost trade-off induces a minimum acceptable allocation, a maximum acceptable allocation, and a unique optimal allocation for each user. We analyze the fairness and truthfulness properties of our mechanism from a game-theoretic perspective. We show that it produces allocations that provably satisfy a variant of the classical notion of max-min fairness. It ensures that flows with higher QoS requirements need to pay at higher rates to increase their likelihood of being served. Furthermore, the Nash equilibrium induced by our mechanism leads to allocations that are comparable to \"socially optimal\" allocations; hence users gain very little by being untruthful.","PeriodicalId":266235,"journal":{"name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A mechanism for equitable bandwidth allocation under QoS and budget constraints\",\"authors\":\"Sreenivas Gollapudi, D. Sivakumar\",\"doi\":\"10.1109/IWQOS.2004.1309370\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Equitable bandwidth allocation is essential when QoS requirements and purchasing power vary among users. To this end, we present a mechanism for bandwidth allocation based on differential pricing. In our model, the QoS vs. cost trade-off induces a minimum acceptable allocation, a maximum acceptable allocation, and a unique optimal allocation for each user. We analyze the fairness and truthfulness properties of our mechanism from a game-theoretic perspective. We show that it produces allocations that provably satisfy a variant of the classical notion of max-min fairness. It ensures that flows with higher QoS requirements need to pay at higher rates to increase their likelihood of being served. Furthermore, the Nash equilibrium induced by our mechanism leads to allocations that are comparable to \\\"socially optimal\\\" allocations; hence users gain very little by being untruthful.\",\"PeriodicalId\":266235,\"journal\":{\"name\":\"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWQOS.2004.1309370\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWQOS.2004.1309370","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A mechanism for equitable bandwidth allocation under QoS and budget constraints
Equitable bandwidth allocation is essential when QoS requirements and purchasing power vary among users. To this end, we present a mechanism for bandwidth allocation based on differential pricing. In our model, the QoS vs. cost trade-off induces a minimum acceptable allocation, a maximum acceptable allocation, and a unique optimal allocation for each user. We analyze the fairness and truthfulness properties of our mechanism from a game-theoretic perspective. We show that it produces allocations that provably satisfy a variant of the classical notion of max-min fairness. It ensures that flows with higher QoS requirements need to pay at higher rates to increase their likelihood of being served. Furthermore, the Nash equilibrium induced by our mechanism leads to allocations that are comparable to "socially optimal" allocations; hence users gain very little by being untruthful.