Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:




Library Locked Library locked




Author, Editor

Author(s):

Pyrga, Evangelia
Chung, Christine

dblp
dblp

Not MPG Author(s):

Chung, Christine

Editor(s):

Mavronicolas, Marios
Papadopoulou, Vicky G.

dblp
dblp

Not MPII Editor(s):

Mavronicolas, Marios
Papadopoulou, Vicky G.

BibTeX cite key*:

Pyrga2009

Title, Booktitle

Title*:

Stochastic Stability in Internet Router Congestion Games

Booktitle*:

Algorithmic Game Theory : Second International Symposium, SAGT 2009

Event, URLs

URL of the conference:

http://www.cs.ucy.ac.cy/~mavronic/sagt2009/

URL for downloading the paper:

http://www.springerlink.com/content/84q7k636h068v511/fulltext.pdf

Event Address*:

Paphos, Cyprus

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

18 October 2009

Event End Date:

20 October 2009

Publisher

Name*:

Springer

URL:

http://www.springer.com/

Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

5814

Number:


Month:

October

Pages:

183-195

Year*:

2009

VG Wort Pages:


ISBN/ISSN:

978-3-642-04644-5

Sequence Number:


DOI:

10.1007/978-3-642-04645-2



Note, Abstract, ©


(LaTeX) Abstract:

Congestion control at bottleneck routers on the internet is a long standing problem. Many policies have been proposed for effective ways to drop packets from the queues of these routers so that network endpoints will be inclined to share router capacity fairly and minimize the overflow of packets trying to enter the queues. We study just how effective some of these queuing policies are when each network endpoint is a self-interested player with no information about the other players’ actions or preferences. By employing the adaptive learning model of evolutionary game theory, we study policies such as Droptail, RED, and the greedy-flow-punishing policy proposed by Gao et al. [10] to find the stochastically stable states: the states of the system that will be reached in the long run.

Keywords:

Game Theory, Internet Routing



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Pyrga2009,
AUTHOR = {Pyrga, Evangelia and Chung, Christine},
EDITOR = {Mavronicolas, Marios and Papadopoulou, Vicky G.},
TITLE = {Stochastic Stability in Internet Router Congestion Games},
BOOKTITLE = {Algorithmic Game Theory : Second International Symposium, SAGT 2009},
PUBLISHER = {Springer},
YEAR = {2009},
VOLUME = {5814},
PAGES = {183--195},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Paphos, Cyprus},
MONTH = {October},
ISBN = {978-3-642-04644-5},
DOI = {10.1007/978-3-642-04645-2},
}


Entry last modified by Manuel Lamotte-Schubert, 03/21/2011
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]
Created
02/11/2010 03:01:46 PM
Revisions
2.
1.
0.

Editor(s)
Manuel Lamotte-Schubert
Anja Becker
Evangelia Pyrga

Edit Dates
21.03.2011 08:41:17
09.03.2010 14:23:20
02/11/2010 03:01:46 PM

Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section