Abstract

Traditional network protocols such as TCP/IP require cooperation between traffic sources to achieve optimal network performance. This approach does not always work, as evident by frequent congestion problems in the Internet. Recent research in protocol design using game theory removes this limitation by modeling traffic sources as competing players and results in efficient and fair distribution of resources. This paper provides theoretical background of the game theoretic approach as applied to networks, describes some previously proposed schemes for minimizing network congestion, elaborates on pricing mechanisms and discusses game-theoretic routing solutions. Pricing provides a feasible solution for congestion control but application of distributed algorithmic mechanism design (DAMD) can be adapted for congestion control.


Original document

The different versions of the original document can be found in:

https://dblp.uni-trier.de/db/conf/ispan/ispan2004.html#RextinIU04,
http://www.mpi-sws.org/%7Ezartash/publications/2004-05-ISPAN-Games.pdf,
https://academic.microsoft.com/#/detail/2121518684
http://dx.doi.org/10.1109/ispan.2004.1300521
Back to Top

Document information

Published on 01/01/2004

Volume 2004, 2004
DOI: 10.1109/ispan.2004.1300521
Licence: CC BY-NC-SA license

Document Score

0

Views 0
Recommendations 0

Share this document

Keywords

claim authorship

Are you one of the authors of this document?