Utility optimization for resource allocation in multipath networks with random losses

This paper considers fair resource allocation schemes for multipath networks with non-congestion related packet losses which can be caused by, for example, errors on links on the routes, and develops a relaxed multipath network utility maximization problem. In order to obtain the optimum, a primal algorithm is presented and shown to be globally stable in the absence of round-trip delays. When round-trip delays are considered, decentralized sufficient conditions for local stability of the algorithm are proposed in continuous-time form. These conditions can give us some useful guidelines for effective implementation of multipath transmission protocols in Internet in order to achieve the stability of network in the presence of round-trip delays.