We develop a mathematical model within a game theoretical framework to capture the flow
control problem for variable rate traffic at a bottleneck node. In this context, we also address …

In Altman and Basar (1998), a dynamic game model of rate-based flow control was
introduced, capturing a scenario in a telecommunication network where M users share a …

We consider a noncooperative game framework for combined routing and flow control in a
network of parallel links, where the number of users (players) is arbitrarily large. The utility …

This paper concerns recently proposed algorithms for network flow control, where source
transmission rates are chosen based on an individual utility function and a network price …

The existence of Nash equilibria in noncooperative flow control in a general product-form
network shared by K users is investigated. The performance objective of each user is to …

We model the interaction between the network and the network users as a noncooperative
game and study the Nash equilibrium points (NEP) of the game. We show that there is a …

We study control of congestion in general topology communication networks within a fairly
general mathematical framework that utilizes noncooperative game theory. We consider a …

Distributed optimal traffic engineering in the presence of multiple paths has been found to be
a difficult problem to solve. In this paper, we introduce a new approach in an attempt to …

We consider a class of convex Nash games where strategy sets are coupled across agents
through a common constraint and payoff functions are linked via a scaled congestion cost …

In this paper, we address the problem of optimal decentralized traffic engineering when
multiple paths are available for each call. More precisely, given a set of possible paths for …