• DocumentCode
    1945202
  • Title

    Oblivious router policies and Nash equilibrium

  • Author

    Almendral, Juan A. ; Fernandez, L.L. ; Cholvi, Vicent ; Sanjuán, Miguel A F

  • Author_Institution
    Grupo de Dinamica No Lineal y Teoria del Caos, Univ. Rey Juan Carlos, Madrid, Spain
  • Volume
    2
  • fYear
    2004
  • fDate
    28 June-1 July 2004
  • Firstpage
    736
  • Abstract
    Most of congestion control schemes require users to behave in a cooperative way, so that they respect some "social responsible" rules. However, without forcing end users to adopt a centralized mandated algorithm controlling their behavior (which is not advisable), it is not possible to guarantee that they will not act in a selfish manner. Consequently, a fundamental issue is to evaluate the impact of having users that act in such a manner. In such a scenario, having a Nash equilibrium guarantees that no selfish user has incentive to unilaterally deviate from its current state (i.e., it guarantees that we are in a stable state in the presence of selfish users). However, here we formally prove that an efficient Nash equilibrium can not be reached in practice for any oblivious control policy.
  • Keywords
    game theory; telecommunication congestion control; telecommunication network routing; Nash equilibrium; congestion control scheme; router policy; Centralized control; Communication system control; Communication systems; Game theory; Inductors; Large scale integration; Nash equilibrium;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computers and Communications, 2004. Proceedings. ISCC 2004. Ninth International Symposium on
  • Print_ISBN
    0-7803-8623-X
  • Type

    conf

  • DOI
    10.1109/ISCC.2004.1358628
  • Filename
    1358628