Competitive Routing in Multiuser Communication Networks

被引：312

作者：

Orda, Ariel ^{[1
]}

Rom, Raphael ^{[1
,2
]}

Shimkin, Nahum ^{[1
]}

机构：

[1] Technion Israel Inst Technol, Fac Elect Engn, Haifa, Israel

[2] Sun Microsyst Inc, Mountain View, CA 94043 USA

来源：

IEEE-ACM TRANSACTIONS ON NETWORKING | 1993年 / 1卷 / 05期

关键词：

D O I：

10.1109/90.251910

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We consider a communication network shared by several selfish users. Each user seeks to optimize its own performance by controlling the routing of its given flow demand, giving rise to a noncooperative game. We investigate the Nash equilibrium of such systems. For a two-node multiple links system, uniqueness of the Nash equilibrium is proven under reasonable convexity conditions. It is shown that this Nash equilibrium point possesses interesting monotonicity properties. For general networks, these convexity conditions are not sufficient for guaranteeing uniqueness, and a counterexample is presented. Nonetheless, uniqueness of the Nash equilibrium for general topologies is established under various assumptions.

引用

页码：510 / 521

页数：12

共 24 条

[1]

[Anonymous], 1957, GAMES DECIS

[2]

Basar T, 1982, DYNAMIC NONCOOPERATI

[3]

Bertsekas D., 1987, DATA NETWORKS

[4]

BOVOPOULOS AD, 1988, PROCEEDINGS OF THE 22ND CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1 & 2, P1051

[5]

CLARK D, 1989, 1102 RFC DDN NETW IN

[6] TRAFFIC ASSIGNMENT PROBLEM FOR A GENERAL NETWORK [J].

DAFERMOS, SC ;

SPARROW, FT .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1969, B 73 (02) :91-+

[7]

ECONOMIDES AA, P INFOCOM 91, P1220

[8]

FERGUSON D, 1989, P IEEE INFOCOM 89, P110

[9]

Fratta L., 1973, NETWORKS, V3, P97, DOI DOI 10.1002/NET.3230030202

[10] MINIMUM DELAY ROUTING ALGORITHM USING DISTRIBUTED COMPUTATION [J].

GALLAGER, RG .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1977, 25 (01) :73-85

← 1 2 3 →