{"title":"具有始终最佳连接用户的无线异构网络的性能","authors":"N. Kaci, P. Maillé, J. Bonnin","doi":"10.1109/NGI.2009.5175776","DOIUrl":null,"url":null,"abstract":"We consider a geographic area covered by two wireless networks. Assuming delay-sensitive users, we study the loss of efficiency of the user equilibrium (the Price of Anarchy) in terms of total delay, with M/M/1 delay functions on each network. The user equilibrium is proved to be less efficient when the network is very heterogeneous, i.e. the two networks have different capacities. \n \nIn order to elicit coordination among users, we suggest to use marginal cost pricing. We investigate the computation of the optimal taxes to use, and give several arguments in favor of the technical feasibility of such a scheme. Applying taxes therefore seems particularly well-suited to improve the overall performance of a network selection game with selfish users.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Performance of Wireless Heterogeneous Networks with Always-best-connected Users\",\"authors\":\"N. Kaci, P. Maillé, J. Bonnin\",\"doi\":\"10.1109/NGI.2009.5175776\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a geographic area covered by two wireless networks. Assuming delay-sensitive users, we study the loss of efficiency of the user equilibrium (the Price of Anarchy) in terms of total delay, with M/M/1 delay functions on each network. The user equilibrium is proved to be less efficient when the network is very heterogeneous, i.e. the two networks have different capacities. \\n \\nIn order to elicit coordination among users, we suggest to use marginal cost pricing. We investigate the computation of the optimal taxes to use, and give several arguments in favor of the technical feasibility of such a scheme. Applying taxes therefore seems particularly well-suited to improve the overall performance of a network selection game with selfish users.\",\"PeriodicalId\":162766,\"journal\":{\"name\":\"2009 Next Generation Internet Networks\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Next Generation Internet Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NGI.2009.5175776\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Next Generation Internet Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NGI.2009.5175776","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Performance of Wireless Heterogeneous Networks with Always-best-connected Users
We consider a geographic area covered by two wireless networks. Assuming delay-sensitive users, we study the loss of efficiency of the user equilibrium (the Price of Anarchy) in terms of total delay, with M/M/1 delay functions on each network. The user equilibrium is proved to be less efficient when the network is very heterogeneous, i.e. the two networks have different capacities.
In order to elicit coordination among users, we suggest to use marginal cost pricing. We investigate the computation of the optimal taxes to use, and give several arguments in favor of the technical feasibility of such a scheme. Applying taxes therefore seems particularly well-suited to improve the overall performance of a network selection game with selfish users.