The optimal flow control of noncooperative users in multiservice networks is investigated in a
game-theoretic way. We adopt a model that differs from previously considered ones in that a …

We study optimal flow control in multiservice networks, in which users (controllers) optimize
their performance objectives in a decentralized manner. We adopt a model that differs from …

In this paper, we consider the flow control in a general multi‐node multi‐link communication
network with competing users. Each user has a source node, a destination node, and an …

We study in this paper a noncooperative approach for sharing resources of a common pool
among users, wherein each user strives to maximize its own utility. The optimality notion is …

This paper is concerned with deriving an optimal flow and routing control policy for two-node
parallel link communication networks with multiple competing users. The model assumes …

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 …

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 …

Flow and congestion control allow the users of a telecommunication network to regulate the
traffic they send into the network according to the quality of service that they require. The …

We present a pricing mechanism which implements in Nash equilibria a rate allocation
problem in unicast service provisioning. This mechanism is different from the ones which …

The capacity allocation problem in a network that is to be shared by noncooperative users is
considered. Each user decides independently upon its routing strategy so as to optimize its …