Bandwidth allocation and admission control scheme based on Nash bargaining solution for WiMAX systems

The Nash Bargaining Solution (NBS) has been broadly suggested as an effective solution for the problem of fair allocation of multiple resources, namely bandwidth allocation in datacenters. In spite of being thoroughly studied, and provably strategy-proof for most scenarios, NBS-based allocation methods lack research on the strategic behavior of tenants in the case of proportionality of resource demands, which is common in datacenter workloads. We found that misbehavior is beneficial: by lying about bandwidth demands tenants can improve their allocations. We show that a sequence of selfish improvements leads to trivial demand vectors for all tenants. It essentially removes sharing incentives which are very important for datacenter networks. In this paper, we analytically prove that tenants can misbehave in 2- and 3- tenants cases. We show that misbehavior is possible in one recently proposed NBS-based allocation system if proportionality of demands is taken into account. Monte Carlo simulations were done for 2–15 tenants to show a misbehavior possibility and its impact on aggregated bandwidth. We propose to use another game-theoretic approach, namely Dominant Resource Fairness (DRF) to allocate bandwidth in the case of proportional demands. We show that this method performs significantly better than NBS after misbehavior.

Download Full-text

An admission control scheme for the real-time VBR traffic in the ATM network: deterministic bandwidth allocation

ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220) ◽

10.1109/icc.1998.683075 ◽

2002 ◽

Cited By ~ 3

Author(s):

T. Shan ◽

O.W.W. Yang

Keyword(s):

Real Time ◽

Admission Control ◽

Bandwidth Allocation ◽

The Real ◽

Atm Network ◽

Control Scheme ◽

Admission Control Scheme

Download Full-text

Bandwidth allocation for cooperative relay networks based on Nash bargaining solution

International Journal of Communication Systems ◽

10.1002/dac.1305 ◽

2011 ◽

Vol 25 (8) ◽

pp. 1044-1058 ◽

Cited By ~ 11

Author(s):

Kai Ma ◽

Qiaoni Han ◽

Cailian Chen ◽

Xinping Guan

Keyword(s):

Bandwidth Allocation ◽

Relay Networks ◽

Nash Bargaining Solution ◽

Nash Bargaining ◽

Cooperative Relay ◽

Bargaining Solution ◽

Cooperative Relay Networks

Download Full-text

A Bandwidth Allocation Strategy for Train-to-Ground Communication System of Urban Mass Transit

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.742.669 ◽

2015 ◽

Vol 742 ◽

pp. 669-673

Author(s):

Xin Wen Zhang ◽

Hong Hui Dong

Keyword(s):

Communication System ◽

Bandwidth Allocation ◽

High Speed ◽

Nash Bargaining Solution ◽

Nash Bargaining ◽

Movement Speed ◽

Bargaining Solution ◽

Allocation Strategy ◽

Urban Mass Transit ◽

Train Operation

Train-to-ground communication system as an important part of the train control system , its performance is essential to guarantee the high safety and efficiency of train operation. However, due to the disturbances caused by movement speed of trains ,terrains, and other environmental interferences ,the existing communication system is often unable to provide a high speed link that is stable enough. Therefore, a reasonable bandwidth allocation strategy is necessary to solve the discrepancy between the demanding data rates and the insufficient bandwidth. This paper propose a bandwidth allocation strategy based on 0-1 knapsack problem and Asymmetric Nash Bargaining Solution, which can effectively reflect different bargaining power of all kinds of services, and improve the reliability and security of the transmission system. Finally, we operate a network simulation by NS2. The simulation show that the proposed scheme can enhance the rate of resource utilization ,get small and stable communication delay and ensure reliable transmission of the high-priority services and the safe operation of the train.

Download Full-text