A common assumption behind most of the recent research on network rate allocation is that
traffic flows are elastic, which means that their utility functions are concave and continuous …

A common assumption behind most of the recent research on network utility maximization is
that traffic flows are elastic, which implies that their utility functions are concave and there …

In this paper, we investigate the problem of distributively allocating transmission data rates
to users in the Internet. We allow users to have concave as well as sigmoidal utility functions …

In a communication network, a good rate allocation algorithm should reflect the utilities of the
users while being fair. We investigate this fundamental problem of achieving the system …

In this paper, we consider the max-min fair resource allocation problem as applied to elastic
flows. We are interested in computing the optimal max-min fair rate allocation. The proposed …

The current framework of network utility maximization for rate allocation and its price-based
algorithms assumes that each link provides a fixed-size transmission" pipe" and each user's …

We address the problem of allocating transmission rates to a set of network sessions with
end-to-end bandwidth and delay requirements. We give a unified convex programming …

The Network Utility Maximization problem has recently been used extensively to analyze
and design distributed rate allocation in networks such as the Internet. A major limitation in …

The design of pricing mechanisms for network resource allocation has two important
objectives: 1) a simple and scalable end-to-end implementation and 2) efficiency of the …

Network function virtualization (NFV) decouples the traditional network functions from
specific or proprietary hardware, such that virtualized network functions (VNFs) can run in …