#### Filter Results:

#### Publication Year

2011

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

—The current optimal joint rate and power control algorithms for wireless networks are mainly for elastic traffic which has strictly concave utility functions. In the multiclass service networks such that elastic and inelastic, the inelastic traffic is usually associated with the sigmoidal utilities which are nonconcave functions. Therefore, the… (More)

In this article, we consider the network utility maximization (NUM) problem for the random access network with multiclass traffic. The utilities associated with the users are not only concave, but also nonconcave functions. Consequently, the random access NUM problem becomes more difficult to solve. Based on the successive approximation method, we propose… (More)

The IEEE 802.11 DCF (Distributed Coordination Function) is based on CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance). However, the CSMA-based random access protocol can cause serious unfairness or flow starvation. In this paper, we propose a multi-channel MAC with the power control (STPC-MMAC) to mitigate the starvation by exploiting the… (More)

The concave utilities in the basic network utility maximisation (NUM) problem are only suitable for elastic flows. In networks with both elastic and inelastic traffic, the utilities of inelastic traffic are usually modelled by the sigmoidal functions which are non-concave functions. Hence, the basic NUM problem becomes a non-convex optimisation problem. To… (More)

—In this paper, we solve the network utility maxi-mization (NUM) problem for networks with both multi-path and single-path users. To deal with the non-strictly convexity and non-separability of the problem, we approximate it to a new strictly convex and separable problem which is efficiently solved by the standard dual-based decomposition approach. After a… (More)

In content-oriented networks, popular contents are replicated at the intermediate nodes to enhance content delivery performance. Under cooperative caching, the caching nodes collaborate to leverage one another's cache capability and to reduce the amount of traffic transferring inside the network. This study considers the cooperation among service providers… (More)

In current networks, end-user devices are usually equipped with several network interfaces. The design of a multipath protocol that can cooperate with current single-path transport protocols is an interesting research field. Most previous works on multipath network utility maximization (NUM) lead to rate-based control protocols. Moreover, these studies do… (More)

This work proposes a cooperative caching model which supports adaptive bit-rate streaming in content delivery networks. A linear program (LP) problem is applied to maximize the total user satisfaction. The optimal content placement and content fetching strategies are the solutions to the LP. The LP is a large-scale optimization problem because of the large… (More)

The canonical multi-path NUM model which is extended directly from the single-path NUM has been studied widely in the literature. Most of the previous approaches do not specify the case of subflows on paths with different characteristics. Moreover, the transport protocol derived from the canonical multi-path NUM exhibits flappiness in the subflows because… (More)

—We consider the network with two kinds of traffic: inelastic and elastic traffic. The inelastic traffic requires fixed throughput, high priority while the elastic traffic has controllable rate and low priority. Giving the fixed rate of inelastic traffic, how to inject the elastic traffic into the network to achieve the maximum utility of elastic traffic is… (More)