Exploiting anarchy in networks: A game-theoretic approach to combining fairness and throughput

Sreenivas Gollapudi; D. Sivakumar; Aidong Zhang

doi:10.1109/INFCOM.2005.1498490

Exploiting anarchy in networks: A game-theoretic approach to combining fairness and throughput

Sreenivas Gollapudi
, D. Sivakumar
, Aidong Zhang

Department of Computer Science and Engineering

SUNY Buffalo
IBM

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We propose a novel mechanism for routing and bandwidth allocation that exploits the selfish and rational behavior of flows in a network. Our mechanism leads to allocations that simultaneously optimize throughput and fairness criteria. We analyze the performance of our mechanism in terms of the induced Nash equilibrium. We compare the allocations at the Nash equilibrium with throughput-optimal allocations as well as with fairness-optimal allocations. Our mechanism offers a smooth trade-off between these criteria, and allows us to produce allocations that are approximately optimal with respect to both. Our mechanism is also fairly simple and admits an efficient distributed implementation.

Original language	English
Title of host publication	Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies
Editors	K. Makki, E. Knightly
Pages	2147-2158
Number of pages	12
DOIs	https://doi.org/10.1109/INFCOM.2005.1498490
State	Published - 2005
Event	IEEE INFOCOM 2005 - Miami, FL, United States Duration: Mar 13 2005 → Mar 17 2005

Publication series

Name	Proceedings - IEEE INFOCOM
Volume	3
ISSN (Print)	0743-166X

Conference

Conference	IEEE INFOCOM 2005
Country/Territory	United States
City	Miami, FL
Period	03/13/05 → 03/17/05

Access to Document

10.1109/INFCOM.2005.1498490

Cite this

Gollapudi, S., Sivakumar, D., & Zhang, A. (2005). Exploiting anarchy in networks: A game-theoretic approach to combining fairness and throughput. In K. Makki, & E. Knightly (Eds.), Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies (pp. 2147-2158). (Proceedings - IEEE INFOCOM; Vol. 3). https://doi.org/10.1109/INFCOM.2005.1498490

Gollapudi, Sreenivas ; Sivakumar, D. ; Zhang, Aidong. / Exploiting anarchy in networks : A game-theoretic approach to combining fairness and throughput. Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies. editor / K. Makki ; E. Knightly. 2005. pp. 2147-2158 (Proceedings - IEEE INFOCOM).

@inproceedings{140b0907bf4d4d4484fd27c68e8361ce,

title = "Exploiting anarchy in networks: A game-theoretic approach to combining fairness and throughput",

abstract = "We propose a novel mechanism for routing and bandwidth allocation that exploits the selfish and rational behavior of flows in a network. Our mechanism leads to allocations that simultaneously optimize throughput and fairness criteria. We analyze the performance of our mechanism in terms of the induced Nash equilibrium. We compare the allocations at the Nash equilibrium with throughput-optimal allocations as well as with fairness-optimal allocations. Our mechanism offers a smooth trade-off between these criteria, and allows us to produce allocations that are approximately optimal with respect to both. Our mechanism is also fairly simple and admits an efficient distributed implementation.",

author = "Sreenivas Gollapudi and D. Sivakumar and Aidong Zhang",

year = "2005",

doi = "10.1109/INFCOM.2005.1498490",

language = "English",

isbn = "0780389689",

series = "Proceedings - IEEE INFOCOM",

pages = "2147--2158",

editor = "K. Makki and E. Knightly",

booktitle = "Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies",

note = "IEEE INFOCOM 2005 ; Conference date: 13-03-2005 Through 17-03-2005",

}

Gollapudi, S, Sivakumar, D & Zhang, A 2005, Exploiting anarchy in networks: A game-theoretic approach to combining fairness and throughput. in K Makki & E Knightly (eds), Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings - IEEE INFOCOM, vol. 3, pp. 2147-2158, IEEE INFOCOM 2005, Miami, FL, United States, 03/13/05. https://doi.org/10.1109/INFCOM.2005.1498490

Exploiting anarchy in networks: A game-theoretic approach to combining fairness and throughput. / Gollapudi, Sreenivas; Sivakumar, D.; Zhang, Aidong.
Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies. ed. / K. Makki; E. Knightly. 2005. p. 2147-2158 (Proceedings - IEEE INFOCOM; Vol. 3).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Exploiting anarchy in networks

T2 - IEEE INFOCOM 2005

AU - Gollapudi, Sreenivas

AU - Sivakumar, D.

AU - Zhang, Aidong

PY - 2005

Y1 - 2005

N2 - We propose a novel mechanism for routing and bandwidth allocation that exploits the selfish and rational behavior of flows in a network. Our mechanism leads to allocations that simultaneously optimize throughput and fairness criteria. We analyze the performance of our mechanism in terms of the induced Nash equilibrium. We compare the allocations at the Nash equilibrium with throughput-optimal allocations as well as with fairness-optimal allocations. Our mechanism offers a smooth trade-off between these criteria, and allows us to produce allocations that are approximately optimal with respect to both. Our mechanism is also fairly simple and admits an efficient distributed implementation.

AB - We propose a novel mechanism for routing and bandwidth allocation that exploits the selfish and rational behavior of flows in a network. Our mechanism leads to allocations that simultaneously optimize throughput and fairness criteria. We analyze the performance of our mechanism in terms of the induced Nash equilibrium. We compare the allocations at the Nash equilibrium with throughput-optimal allocations as well as with fairness-optimal allocations. Our mechanism offers a smooth trade-off between these criteria, and allows us to produce allocations that are approximately optimal with respect to both. Our mechanism is also fairly simple and admits an efficient distributed implementation.

UR - https://www.scopus.com/pages/publications/25844484661

U2 - 10.1109/INFCOM.2005.1498490

DO - 10.1109/INFCOM.2005.1498490

M3 - Conference contribution

AN - SCOPUS:25844484661

SN - 0780389689

T3 - Proceedings - IEEE INFOCOM

SP - 2147

EP - 2158

BT - Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies

A2 - Makki, K.

A2 - Knightly, E.

Y2 - 13 March 2005 through 17 March 2005

ER -

Gollapudi S, Sivakumar D, Zhang A. Exploiting anarchy in networks: A game-theoretic approach to combining fairness and throughput. In Makki K, Knightly E, editors, Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies. 2005. p. 2147-2158. (Proceedings - IEEE INFOCOM). doi: 10.1109/INFCOM.2005.1498490

Exploiting anarchy in networks: A game-theoretic approach to combining fairness and throughput

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this