Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10328825 | Electronic Notes in Theoretical Computer Science | 2005 | 18 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Nigel Walker, Marc Wennink,