Name
Abstract | ||
|---|---|---|
A general framework is developed for networks with flows that use all available congestion signals to regulate their rates. It is conceptually a generalization of the existing network utility maximization (NUM) theory for homogeneous congestion control. Instead of a convex optimization characterization in NUM, a game with multiple convex optimizations is formulated to characterize equilibria in such a network. Examples are provided to motivate the needs of this general theory. We also provide some basic properties of the game and point out some possible future directions along this line. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/CISS.2008.4558494 | CISS |
Keywords | Field | DocType |
optimisation,multiple convex optimizations,homogeneous congestion control,telecommunication congestion control,heterogeneous flow control,network utility maximization theory,game theory,computer networks,nash equilibrium,optimization,signal generators,flow control,convex optimization,protocols,games,routing protocols,signal analysis,congestion control | Mathematical optimization,Computer science,Implementation theory,Regular polygon,Flow control (data),Network congestion,Game theory,Nash equilibrium,Convex optimization,Routing protocol | Conference |
ISBN | Citations | PageRank |
978-1-4244-2247-0 | 4 | 0.51 |
References | Authors | |
11 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ao Tang | 1 | 254 | 18.74 |
| L. L.H. Andrew | 2 | 918 | 52.52 |