Fair allocation using a fast smart market auction

Allocation of network resources may be formulated as an optimization problem seeking to maximize the sum of the utility function of each flow. Individual flows collectively achieve social welfare with a constraint that global fairness must be provided by a congestion control scheme using congestion indication feedback signals. However, in the reality, non-cooperative flows without employing any congestion control scheme do not respond to congestion indication feedback signals. In this paper, we analyze fairness of congestion control with cooperative and non-cooperative flows for communication networks. Furthermore, we propose a fast smart-market auction approach to achieve social welfare in the environment that cooperative and non-cooperative flows coexist. Through detailed simulations, the proposed approach is proven to be effective in providing fairness.