Braess-like paradoxes in distributed computer systems

被引：48

作者：

Kameda, H ^{[1
]}

Altman, E

Kozawa, T

Hosokawa, Y

机构：

[1] Univ Tsukuba, Inst Informat Sci & Elect, Tsukuba Sci City, Ibaraki 3058573, Japan

[2] INRIA, F-06902 Sophia Antipolis, France

[3] Univ Tsukuba, Doctoral Program Engn, Tsukuba Sci City, Ibaraki 3058573, Japan

[4] Univ Tsukuba, Grad Sch Syst & Informat Engn, Tsukuba Sci City, Ibaraki 3058573, Japan

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 2000年 / 45卷 / 09期

基金：

日本学术振兴会;

关键词：

Braess paradox; load balancing; Nash equilibrium; performance optimization; Wardrop equilibrium;

D O I：

10.1109/9.880619

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We consider optimal distributed decisions in distributed computer systems. We identify a Braess-like paradox in which adding capacity to the system may degrade the performance of all users. Unlike the original Braess paradox, we show that this behavior occurs only in the case of finitely many users and not in the case of infinite number of users.

引用

页码：1687 / 1691

页数：5

共 18 条

[1] Braess's paradox in a queueing network with state-dependent routing [J].

Calvert, B ;

Solomon, W ;

Ziedins, I .

JOURNAL OF APPLIED PROBABILITY, 1997, 34 (01) :134-154

[2] A PARADOX OF CONGESTION IN A QUEUING NETWORK [J].

COHEN, JE ;

KELLY, FP .

JOURNAL OF APPLIED PROBABILITY, 1990, 27 (03) :730-734

[3]

COHEN JE, 1997, IEEE ACM T NETWO APR, P1220

[4] ON THE RELATIONSHIP BETWEEN NASH-COURNOT AND WARDROP EQUILIBRIA [J].

HAURIE, A ;

MARCOTTE, P .

NETWORKS, 1985, 15 (03) :295-308

[5] UNIQUENESS OF THE SOLUTION FOR OPTIMAL STATIC ROUTING IN OPEN BCMP QUEUING-NETWORKS [J].

KAMEDA, H ;

ZHANG, Y .

MATHEMATICAL AND COMPUTER MODELLING, 1995, 22 (10-12) :119-130

[6]

Kameda H, 1997, OPTIMAL LOAD BALANCI, DOI DOI 10.1007/978-1-4471-0969-3

[7]

Kameda H., 1997, P 1 WORLD C SYST SIM, P459

[8]

KAMEDA H, 1998, ISETR98157 U TSUK I

[9]

Kim C., 1990, Proceedings. The 10th International Conference on Distributed Computing Systems (Cat. No.90CH2878-7), P562, DOI 10.1109/ICDCS.1990.89264

[10]

KIM C, 1990, IEEE T COMPUT, V41, P381

← 1 2 →