博弈网络是用博弈论的方法来研究网络的

A. Rextin, Zahid Irfan, Z. Uzmi
{"title":"博弈网络是用博弈论的方法来研究网络的","authors":"A. Rextin, Zahid Irfan, Z. Uzmi","doi":"10.1109/ISPAN.2004.1300521","DOIUrl":null,"url":null,"abstract":"Traditional network protocols such as TCP/IP require cooperation between traffic sources to achieve optimal network performance. This approach does not always work, as evident by frequent congestion problems in the Internet. Recent research in protocol design using game theory removes this limitation by modeling traffic sources as competing players and results in efficient and fair distribution of resources. This paper provides theoretical background of the game theoretic approach as applied to networks, describes some previously proposed schemes for minimizing network congestion, elaborates on pricing mechanisms and discusses game-theoretic routing solutions. Pricing provides a feasible solution for congestion control but application of distributed algorithmic mechanism design (DAMD) can be adapted for congestion control.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Games networks play a game theoretic approach to networks\",\"authors\":\"A. Rextin, Zahid Irfan, Z. Uzmi\",\"doi\":\"10.1109/ISPAN.2004.1300521\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traditional network protocols such as TCP/IP require cooperation between traffic sources to achieve optimal network performance. This approach does not always work, as evident by frequent congestion problems in the Internet. Recent research in protocol design using game theory removes this limitation by modeling traffic sources as competing players and results in efficient and fair distribution of resources. This paper provides theoretical background of the game theoretic approach as applied to networks, describes some previously proposed schemes for minimizing network congestion, elaborates on pricing mechanisms and discusses game-theoretic routing solutions. Pricing provides a feasible solution for congestion control but application of distributed algorithmic mechanism design (DAMD) can be adapted for congestion control.\",\"PeriodicalId\":198404,\"journal\":{\"name\":\"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-05-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPAN.2004.1300521\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.2004.1300521","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

传统的网络协议,如TCP/IP,需要流量源之间的合作,以达到最优的网络性能。这种方法并不总是有效,正如Internet中频繁出现的拥塞问题所证明的那样。最近在协议设计中使用博弈论的研究通过将流量源建模为竞争参与者来消除这一限制,从而实现有效和公平的资源分配。本文提供了应用于网络的博弈论方法的理论背景,描述了一些先前提出的最小化网络拥塞的方案,详细阐述了定价机制,并讨论了博弈论路由解决方案。定价为拥塞控制提供了一种可行的解决方案,但分布式算法机制设计(DAMD)的应用可以适用于拥塞控制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Games networks play a game theoretic approach to networks
Traditional network protocols such as TCP/IP require cooperation between traffic sources to achieve optimal network performance. This approach does not always work, as evident by frequent congestion problems in the Internet. Recent research in protocol design using game theory removes this limitation by modeling traffic sources as competing players and results in efficient and fair distribution of resources. This paper provides theoretical background of the game theoretic approach as applied to networks, describes some previously proposed schemes for minimizing network congestion, elaborates on pricing mechanisms and discusses game-theoretic routing solutions. Pricing provides a feasible solution for congestion control but application of distributed algorithmic mechanism design (DAMD) can be adapted for congestion control.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Proxy placement in coordinated en-route transcoding caching for tree networks Optimal adaptive fault diagnosis of cubic Hamiltonian graphs The spanning diameter of the star graphs Particle swarm optimization algorithm in signal detection and blind extraction An approach to achieve message efficient early-stopping uniform consensus protocols
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1