Utility maximization for communication networks with multipath routing

By Xiaojun Lin, Ness B. Shroff. IEEE Transactions on Automatic Control, 2006

306 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures (2007, methodology): “Various designs have been presented based on somewhat different NUM formulations and decomposition methods: MATE in [34], TeXCP in [59], DATE in [49], Overlay TCP in [46], and others [82], [60], [69], [101], [143].”
Joint mobile energy replenishment and data gathering in wireless rechargeable sensor networks (2011, unknown): “…points in time interval k. max r (k) i,a ≥0 Ui( X a r (k) i,a qτ (k) ) − 1 2c X a (r (k) i,a − x (k) i,a ) 2 − X a λ (k) i,a r (k) i,a (9) This local optimization can be solved by a similar approach to that in [27] with the complexity of O(|A (k) | log(|A (k) |)), which is explained as follows.”
Alternative Distributed Algorithms for Network Utility Maximization: Framework and Applications (2007, methodology): “5Recently, a similar formulation of multipath routing utility maximization is considered in [46], where a proximal optimization method followed by full dual decomposition is taken.”