Network utility maximisation scheduling in mesh networks

An optimal scheduling algorithm to maximise network utility is presented in a mesh network operating in a time-division fashion. The proposed scheduling algorithm consists of the shortest path search and the binary search.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[3]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..