Interactions in Transport Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Model Checking Optimisation Based Congestion Control Algorithms
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
| Hi-index | 0.00 |
Many network control problems can be formulated and studied using the machinery of optimisation theory and Lagrange duality. The goal of the control process is to find the saddle point of the Lagrangian. We present a stability result for a class of dynamic processes for this problem. Our formulation automatically derives a Lyapunov function from the form of the dynamic equations. We show how several stability results from the literature of distributed flow control in networks fit into this formalism.