University of Cambridge > Talks.cam > Optimization and Incentives Seminar > Exploring the dynamics of network optimisation

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Exploring the dynamics of network optimisation

Download to your calendar using vCal

If you have a question about this talk, please contact Neil Walton .

As proposed by Frank Kelly, network control protocols can be usefully interpreted as dynamically solving a distributed optimisation problem or, more generally, as seeking the saddle point of a Langrangian function. We will present some graphical notation and theoretical results that we use to explore design options for dynamics in these systems. These techniques allow us to associate a variety of dynamic systems with a given Lagrangian, in each case with an immediate convergence proof.

In the talk we will outline these ideas as they apply to some recent proposals in the area of multipath flow control.

This talk is part of the Optimization and Incentives Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

test Rouse Ball Lectures Law Faculty, Room LG19

Other talks

Talk TBC Talk TBC Title to be confirmed Title to be confirmed Teams Announced What’s my reproduction number? Life history strategies: an interdisciplinary perspective
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity