Defining bandwidth constraints with cooperative games

This paper proposes the use of cooperative game models to arbitrate bandwidth constraints in bandwidth constraint models. This work adopts cooperative games as a mathematical tool for arbitrating bandwidth constraints, considering differentiated service classes and network load information. Game solutions based on the Shapley Value are used to compose bandwidth constraints in two Bandwidth Constraint Models. Overload scenarios are explored in performance evaluation, and the new models are compared to the maximum allocation with reservation model. The results show that game-based allocations can not only achieve greater efficiency in bandwidth sharing but also provide bandwidth protection against QoS degradation and respect service differentiation for high, normal and low priority services.