域间网络中保证QoS契约建立的博弈论

D. Barth, Boubkeur Boudaoud, T. Mautor
{"title":"域间网络中保证QoS契约建立的博弈论","authors":"D. Barth, Boubkeur Boudaoud, T. Mautor","doi":"10.1109/ICCITECHNOL.2012.6285807","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce and present a new model for resources management and for a guaranteed QoS in the interdomain routing framework. This new model is called the stock model, we study it using game theory. The stock model is based on a reverse cascade approach and is applied in a distributed context. The goal of each transit provider in the network is to be able to provisioning the necessary capacity on each route that it wants to buy. Therefore, we use a repeated game with incomplete information for this study. A linear reward inaction algorithm is used to update strategy of each player (domain or operator). We show how each player chooses its best strategy on each route to satisfy the demands of its customers and to provide a maximum benefit. Finally, we analyze and provide some simulation results obtained by applying the game model on simple topologies where the model stabilizes and converges to Nash equilibriums.","PeriodicalId":435718,"journal":{"name":"2012 International Conference on Communications and Information Technology (ICCIT)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Game theory for contracts establishment with guaranteed QoS in the interdomain network\",\"authors\":\"D. Barth, Boubkeur Boudaoud, T. Mautor\",\"doi\":\"10.1109/ICCITECHNOL.2012.6285807\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we introduce and present a new model for resources management and for a guaranteed QoS in the interdomain routing framework. This new model is called the stock model, we study it using game theory. The stock model is based on a reverse cascade approach and is applied in a distributed context. The goal of each transit provider in the network is to be able to provisioning the necessary capacity on each route that it wants to buy. Therefore, we use a repeated game with incomplete information for this study. A linear reward inaction algorithm is used to update strategy of each player (domain or operator). We show how each player chooses its best strategy on each route to satisfy the demands of its customers and to provide a maximum benefit. Finally, we analyze and provide some simulation results obtained by applying the game model on simple topologies where the model stabilizes and converges to Nash equilibriums.\",\"PeriodicalId\":435718,\"journal\":{\"name\":\"2012 International Conference on Communications and Information Technology (ICCIT)\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Communications and Information Technology (ICCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCITECHNOL.2012.6285807\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Communications and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHNOL.2012.6285807","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文介绍并提出了一种新的域间路由框架中的资源管理和QoS保证模型。这个新的模型被称为股票模型,我们用博弈论来研究它。库存模型基于反向级联方法,并应用于分布式上下文中。网络中每个运输提供商的目标是能够在它想要购买的每条路线上提供必要的容量。因此,我们在本研究中使用了不完全信息的重复博弈。采用线性奖励不作为算法更新每个参与人(域或算子)的策略。我们展示了每个参与者如何在每条路线上选择最佳策略,以满足其客户的需求并提供最大的利益。最后,我们分析并提供了一些在简单拓扑上应用该博弈模型的仿真结果,该模型趋于稳定并收敛于纳什均衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Game theory for contracts establishment with guaranteed QoS in the interdomain network
In this paper, we introduce and present a new model for resources management and for a guaranteed QoS in the interdomain routing framework. This new model is called the stock model, we study it using game theory. The stock model is based on a reverse cascade approach and is applied in a distributed context. The goal of each transit provider in the network is to be able to provisioning the necessary capacity on each route that it wants to buy. Therefore, we use a repeated game with incomplete information for this study. A linear reward inaction algorithm is used to update strategy of each player (domain or operator). We show how each player chooses its best strategy on each route to satisfy the demands of its customers and to provide a maximum benefit. Finally, we analyze and provide some simulation results obtained by applying the game model on simple topologies where the model stabilizes and converges to Nash equilibriums.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On the BEP performance of binary noncoherent modulation schemes in frequency-nonselective M2M double Hoyt fading channels Sequential spectrum sensing based on higher-order statistics for cognitive radios TPC-H benchmarking of Pig Latin on a Hadoop cluster Enhanced Slotted ALOHA protocol with collision processing and relay cooperation Case study: Impacts on information systems governance, agility and strategic flexibility of simultaneous implementation of several process approaches
×
引用
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