DocumentCode :
3014025
Title :
Games networks play a game theoretic approach to networks
Author :
Rextin, Aimal Tariq ; Irfan, Zahid ; Uzmi, Zartash Afzal
Author_Institution :
Lahore Univ. of Manage. Sci., Pakistan
fYear :
2004
fDate :
10-12 May 2004
Firstpage :
451
Lastpage :
456
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.
Keywords :
Internet; distributed algorithms; game theory; pricing; resource allocation; telecommunication congestion control; telecommunication traffic; transport protocols; DAMD; Internet; TCP/IP; distributed algorithmic mechanism design; game theory; game-theoretic routing; games networks; network congestion control; network protocols; optimal network performance; pricing mechanisms; resource distribution; Computer networks; Game theory; Internet; Nash equilibrium; Pricing; Protocols; Resource management; Routing; Telecommunication traffic; Traffic control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on
ISSN :
1087-4089
Print_ISBN :
0-7695-2135-5
Type :
conf
DOI :
10.1109/ISPAN.2004.1300521
Filename :
1300521
Link To Document :
بازگشت