Making greed work in networks: a game-theoretic analysis of switch service disciplines

S. Shenker
{"title":"Making greed work in networks: a game-theoretic analysis of switch service disciplines","authors":"S. Shenker","doi":"10.1145/190314.190319","DOIUrl":null,"url":null,"abstract":"This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and selfish, and (2) central administrative control is exercised only at the network switches. The operating points resulting from selfish user behavior depend crucially on the service disciplines implemented in network switches. This effect is investigated in a simple model consisting of a single exponential server shared by many Poisson sources. We discuss the extent to which one can guarantee, through the choice of switch service disciplines, that these selfish operating points will be efficient and fair. We also discuss to what extent the choice of switch service disciplines can ensure that these selfish operating points are unique and are easily and rapidly accessible by simple self-optimization techniques. We show that no service discipline can guarantee optimal efficiency. As for the other properties, we show that the traditional FIFO service discipline guarantees none of these properties, but that a service discipline called Fair Share guarantees all of them. While the treatment utilizes game-theoretic concepts, no previous knowledge of game theory is assumed.","PeriodicalId":142337,"journal":{"name":"Proceedings of the conference on Communications architectures, protocols and applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"236","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the conference on Communications architectures, protocols and applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/190314.190319","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 236

Abstract

This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and selfish, and (2) central administrative control is exercised only at the network switches. The operating points resulting from selfish user behavior depend crucially on the service disciplines implemented in network switches. This effect is investigated in a simple model consisting of a single exponential server shared by many Poisson sources. We discuss the extent to which one can guarantee, through the choice of switch service disciplines, that these selfish operating points will be efficient and fair. We also discuss to what extent the choice of switch service disciplines can ensure that these selfish operating points are unique and are easily and rapidly accessible by simple self-optimization techniques. We show that no service discipline can guarantee optimal efficiency. As for the other properties, we show that the traditional FIFO service discipline guarantees none of these properties, but that a service discipline called Fair Share guarantees all of them. While the treatment utilizes game-theoretic concepts, no previous knowledge of game theory is assumed.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使贪婪在网络中起作用:开关服务学科的博弈论分析
本文从博弈论的角度讨论了拥塞控制问题。有两个基本前提:(1)假定用户是独立和自私的;(2)只在网络交换机上执行中央管理控制。用户自私行为导致的工作点在很大程度上取决于网络交换机中实现的业务纪律。在一个由多个泊松源共享的单一指数服务器组成的简单模型中研究了这种效应。我们讨论通过选择开关服务学科,可以在多大程度上保证这些自私的操作点是高效和公平的。我们还讨论了开关服务学科的选择在多大程度上可以确保这些自操点是唯一的,并且可以通过简单的自优化技术轻松快速地访问。我们的研究表明,没有任何服务纪律可以保证最优的效率。至于其他属性,我们表明,传统的FIFO服务原则不能保证这些属性,但称为公平共享的服务原则保证所有这些属性。虽然治疗利用博弈论的概念,没有先前的博弈论知识的假设。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Making greed work in networks: a game-theoretic analysis of switch service disciplines Wide-area traffic: the failure of Poisson modeling Proceedings of the conference on Communications architectures, protocols and applications Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers A methodology for designing communication 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