多播与私有流:用于拥塞控制的有效定价方案

Patrick Maillé
{"title":"多播与私有流:用于拥塞控制的有效定价方案","authors":"Patrick Maillé","doi":"10.1109/NGI.2005.1431655","DOIUrl":null,"url":null,"abstract":"In this paper, we suggest to use an auction scheme to share the available resource of a communication link among several flows, where several users may be interested in the same flow, like multicast/streaming sessions. The auction scheme we introduce is inspired by the previously defined multi-bid auctions, which have been designed to share the available capacity of a communication link among selfish users. We study precisely the behaviour of users, and establish that their best strategy is to actually reveal what the resource is worth to them. The efficiency of the resulting allocation in terms of social welfare is also proved.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multicast versus private flows: an efficient pricing scheme for congestion control\",\"authors\":\"Patrick Maillé\",\"doi\":\"10.1109/NGI.2005.1431655\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we suggest to use an auction scheme to share the available resource of a communication link among several flows, where several users may be interested in the same flow, like multicast/streaming sessions. The auction scheme we introduce is inspired by the previously defined multi-bid auctions, which have been designed to share the available capacity of a communication link among selfish users. We study precisely the behaviour of users, and establish that their best strategy is to actually reveal what the resource is worth to them. The efficiency of the resulting allocation in terms of social welfare is also proved.\",\"PeriodicalId\":435785,\"journal\":{\"name\":\"Next Generation Internet Networks, 2005\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-04-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Next Generation Internet Networks, 2005\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NGI.2005.1431655\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Next Generation Internet Networks, 2005","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NGI.2005.1431655","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们建议使用拍卖方案在多个流之间共享通信链路的可用资源,其中多个用户可能对同一流感兴趣,如多播/流会话。我们引入的拍卖方案受到先前定义的多竞价拍卖的启发,该拍卖方案被设计为在自私的用户之间共享通信链路的可用容量。我们精确地研究用户的行为,并确定他们的最佳策略是揭示资源对他们的价值。由此产生的社会福利分配效率也得到了证明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multicast versus private flows: an efficient pricing scheme for congestion control
In this paper, we suggest to use an auction scheme to share the available resource of a communication link among several flows, where several users may be interested in the same flow, like multicast/streaming sessions. The auction scheme we introduce is inspired by the previously defined multi-bid auctions, which have been designed to share the available capacity of a communication link among selfish users. We study precisely the behaviour of users, and establish that their best strategy is to actually reveal what the resource is worth to them. The efficiency of the resulting allocation in terms of social welfare is also proved.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信