Multi-user flow control as a Nash game: Performance of various algorithms

Rajiv T. Maheswaran, M Tamer Basar

Research output: Contribution to journalConference article


In a recent paper, a dynamic game model of rate-based flow control was introduced, capturing a scenario in a telecommunication network where M users share a common bottleneck queue. For such a model, existence of dynamic Nash equilibria was studied, and various algorithms were proposed for its computation. In this paper, we undertake a comprehensive numerical study of various algorithms that arise in this context, and also address the more general case where the performance measure also assigns cost to jitter, that is to variations in the transmission rate.

Original languageEnglish (US)
Pages (from-to)1090-1095
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
StatePublished - Dec 1 1998
EventProceedings of the 1998 37th IEEE Conference on Decision and Control (CDC) - Tampa, FL, USA
Duration: Dec 16 1998Dec 18 1998


ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this