期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

域间路由中的机制设计研究综述 被引量：1

An Overview on Mechanism Design in Interdomain Routing
下载PDF
导出
摘要 域间路由中每个自治系统都是独立的理性主体,它们策略性地选择行为,进行路由.倘若自治系统的路由策略不加限制则会引起网络运行异常.借助于专门研究理性主体自利行为的机制设计理论,激励自治系统,可以在保证每个自治系统利益的前提下,实现域间路由网络系统的整体目标.首先概述了机制设计理论,接着将目前域间路由中的机制设计研究归纳为最小代价路由机制设计和策略路由机制设计,总结了研究现状.最后指出未来研究方向. Every autonomous system in interdomain routing is an independent rational agent. They choose actions strategically to route. If all agents are allowed to act arbitrarily, the network will work abnormally. Based on mechanism design theory in microeconomics, the whole network＇s target can be realized through incentive. At the same time, the interests of autonomous systems are also satisfied. Firstly, mechanism design theory is introduced briefly. Mechanism design models in interdomain routing are classified into two models： lowest-cost-path mechanism design and policy based routing mechanism design. These two models＂ research advances are summarized. Finally, future research directions are proposed.
作者 游文霞 李文武 王仁明
机构地区 三峡大学电气信息学院
出处 《三峡大学学报（自然科学版）》 CAS 2007年第4期358-362,共5页 Journal of China Three Gorges University：Natural Sciences
基金 三峡大学博士基金项目(600108)
关键词 域间路由 机制设计 激励 VCG机制 算法复杂性 interdomain routing mechanism design incentive VCG mechanism algorithm complexity
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献17

  • 1Varadhan K,Govindan R,Estrin D.Persistent Route Oscillations in Interdomain Routing[J].Computer Networks,2000(1):1-16.
  • 2Gao L,Rexford J.Stable Internet Routing without Global Coordination[J].IEEE/ACM Trans.Networking,2001(6):681-692.
  • 3Nisan N,Rosen A.Algorithmic Mechanism Design[J].Games and Economic Behavior,2001,35:166-196.
  • 4张维迎.博弈论与信息经济学[M].上海：上海三联书店、上海人民出版社,2000.P82-85.
  • 5游文霞,王先甲,冯霞,文俊浩.机制设计理论及其在计算机网络协议设计中的应用研究[J].计算机科学,2007,34(3):44-49. 被引量：4
  • 6Dakdouk R R,Salihoglu S,Wang H,et al.Interdomain Routing as Social Xhoice[C].26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06).Washington D.C.:IEEE Computer Society Press,2006:38-38.
  • 7Groves T.Incentives in Teams[J].Econometrica,1973,41:617-631.
  • 8Hershberger J,Suri S.Vickrey Prices and Shortest Paths:What is an Edge Worth?[C].In Proceedings of the 42nd Symposium on the Foundations of Computer Science.Los Alamitos:IEEE Computer Society Press,2002:129-140.
  • 9Archer A,Tardos E.Frugal Path Mechanisms[C].In Proceedings of 13th ACM-SIAM Symposium on Discrete Algorithms.New York:ACM Press/SIAM,2002:991-999.
  • 10Elkind E,Sahai A,Steiglitz K.Frugality in Path Auctions[C].In:Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA '04).New York:ACM Press/SIAM,2004:701-709.

二级参考文献65

  • 1Rekhter Y, Li T. A Border Gateway Protocol 4 (BGP-4). RFC 1771,1995-03.
  • 2Halabi B. Internet Routing Architectures. Cisco Press, 1997.
  • 3Gao L, Rexford J. Stable Internet Routing Without Global Coordination. IEEE/ACM Trans. Networking, 2001, 9(6): 681-692.
  • 4Gao L, Griffin T, Rexford J. Inherently Safe Backup Routing with BGP. In: Proc. of IEEE INFOCOM, 2001:547-556.
  • 5Gao L. On Inferring Autonomous System Relationships in the Internet[J]. IEEE/ACM Transactions on Networking, 2001,9(6): 733.
  • 6Subramanian L, Agarwal S, Rexford J, et al. Characterizing the Internet Hierarchy from Multiple Vantage Points[C], In: Proc. of IEEE INFOCOM'02, New York, NY: IEEE Press. 2002:618-627.
  • 7BGR Table Statistic Home Page. http://bgp.potaroo.net/,2004-07-04.
  • 8RIPE.Routing Information Service Raw Data. http://abcoude.ripe.nerlris/rawdata/, 2004-07-04.
  • 9Vickrey W.Counter speculation,auctions and competitive sealed tenders Journal of Finance,1961.8～37
  • 10Clarke E H.Multipart pricing of public goods.Public Choice,1971.17～33

共引文献123

同被引文献5

引证文献1

三峡大学学报（自然科学版）
2007年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部