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

被引:89
作者
Shenker, SJ
机构
[1] Palo Alto Research Center, Xerox Corporation, Palo, Alto
关键词
D O I
10.1109/90.477727
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper discusses congestion control from a game-theoretic perspective. There are two basic premises, 1) Users are assumed to be independent and selfish, 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.
引用
收藏
页码:819 / 831
页数:13
相关论文
共 35 条
[1]  
BOVOPOULOS A, 1987, 25TH P ALL C COMM CO
[2]  
COFFMAN E, 1980, OPERATIONS RES 2, V28
[3]  
Demers A., 1990, Internetworking: Research and Experience, V1, P3
[4]   A GAME THEORETIC PERSPECTIVE TO FLOW-CONTROL IN TELECOMMUNICATION NETWORKS [J].
DOULIGERIS, C ;
MAZUMDAR, R .
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1992, 329 (02) :383-402
[5]  
DOULIGERIS C, 1988, 25TH P ALL C COMM CO
[6]  
DOULIGERIS C, 1987, 25TH P ALL C COMM CO
[7]  
FERGUSON D, 1989, IEEE INFOCOM
[8]  
FRIEDMAN E, 1993, E COMMUNICATION
[9]   ROUND-ROBIN SCHEDULING FOR MAX MIN FAIRNESS IN DATA-NETWORKS [J].
HAHNE, EL .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1991, 9 (07) :1024-1039
[10]  
HSIAO MTT, 1988, PERFORMANCE 87