摘要

In this paper we consider fair resource allocation in multipath networks where each source-destination pair can have several different paths for data transmission and formulate it as a multipath network utility maximization problem. In order to obtain the optimum of this resource allocation model, we present a novel rate-based flow control algorithm, which depends only on local information. We also give some numerical examples to confirm the convergence of our algorithm within a certain number of iterations.

  • 出版日期2014

全文