Interactions in Transport Networks

Authors:
Nigel Walker;Marc Wennink
Affiliations:
BT Research, B54, 141, Adastral Park, Ipswich, IP5 3RE, UK;BT Research, B54, 141, Adastral Park, Ipswich, IP5 3RE, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 8
Cited 3

Theory of linear and integer programming

Theory of linear and integer programming
Routing in the Internet (2nd ed.)

Routing in the Internet (2nd ed.)
The stable paths problem and interdomain routing

IEEE/ACM Transactions on Networking (TON)
Convex Optimization

Convex Optimization
Computational-Mechanism Design: A Call to Arms

IEEE Intelligent Systems
Principles of Constraint Programming

Principles of Constraint Programming
A market-oriented programming environment and its application to distributed multicommodity flow problems

Journal of Artificial Intelligence Research
The generalized distributive law

IEEE Transactions on Information Theory

Optimisation-based overload control

NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Lyapunov convergence for Lagrangian models of network control

NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Model Checking Optimisation Based Congestion Control Algorithms

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a model that captures basic interactions occurring in transport networks, including routing and flow control. Many network processes can be seen as solving an optimisation problem, or seeking a balance between competing interests. The problem structure is illustrated by means of a 'component graph', which dictates the communication and interaction patterns between different parts of the system. We show how the same formalism also captures interactions in electrical circuits.