Hybrid Coordination of Flow Networks

The first section of this chapter recalls some terminology about flow networks. The second section introduces first coordination algorithm. The analysis presented in the third section shows that practical load balancing is achieved in finite time. The fourth section provides a robustness analysis of the algorithm in case of delays and when the local clocks used to determine the sequence of sampling times have skews. In all these sections, the focus is on practical load balancing. The modification of the algorithm that leads to this desired behavior is proposed and analyzed in the fifth section. Some final remarks are provided in the sixth section. © 2013 by John Wiley & Sons, Inc.