Data networks
Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (TON)
A resource allocation model for QoS management
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Decoupling Bandwidth and Delay Properties in Class Based Queuing
ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
Generalized nash bargaining solution for bandwidth allocation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Autonomic Behaviour in QoS Management
ICAS '07 Proceedings of the Third International Conference on Autonomic and Autonomous Systems
Max-Min Fair Scheduling in Input-Queued Switches
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
In the Internet, applications with very distinct requirements share the same network resources. In order to avoid QoS degradation, the resource manager component from QoS mechanism should distribute the available bandwidth in efficient and fair way. Resource manager works as an arbitrator, when applications compete for scarce resources. This paper reviews and discusses some bandwidth mechanisms from the literature, and proposes a fair scheme for the bandwidth distribution under a class-based allocation. The proposed allocation method is based on Cooperative Games Justice Mode. The Shapley value is evaluated to find fair bandwidth allocations. When the demand exceeds the quantity to be allocated, Bankruptcy Games are applied to extend the Shapley value method. Numeric experiments with allocation of simultaneous flows from multi-class applications in a CBQ node showed the efficiency of the proposed method.