Edilayne M. Salgueiro
ABSTRACT
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.
- R. Anane. Autonomic behaviour in qos management. In ICAS '07: Proceedings of the Third International Conference on Autonomic and Autonomous Systems, page 57, Washington, DC, USA, 2007. IEEE Computer Society. Google Scholar
Digital Library
- C. Aswakul and J. Barria. Error analysis of multiservice single-link system studies using linear approximation model. In IEEE International Conference on Communications, ICC 2005, volume 1, pages 191--195, May 2005.Google ScholarCross Ref
- D. Bertsekas and R. Gallager. Data Networks. Prentice Hall, 1992. Google ScholarDigital Library
- J. L. Boudec. Rate adaptation, congestion control and fairness: A tutorial. Technical Report 3132, Ecole Polytechnique Federale de Lausanne (EPFL), 2005.Google Scholar
- R. Denda, A. Banchs, and W. Effelsberg. The fairness challenge in computer networks. In QofIS, pages 208--220, 2000. Google ScholarDigital Library
- S. Floyd and V. Jacobson. Link-sharing and resource management models for packet networks. IEEE/ACM Transactions on Networking, 3(4):365--386, 1995. Google ScholarDigital Library
- M. Hosaagrahara and H. Sethu. Max-min fair scheduling in input-queued switches. IEEE Transactions on Parallel and Distributed Systems, 19(4):462--475, 2008. Google ScholarDigital Library
- J. M. Jaffe. Bottleneck flow control. IEEE Trans. on Communications, 29(7):954--962, 1981.Google ScholarCross Ref
- R. Jain, D. Chiu, and W. Hawe. A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. Technical Report TR-301, DEC Research Report, Sep. 1984.Google Scholar
- F. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8:33--37, January 1997.Google ScholarCross Ref
- A. Mas-Colell, M. D. Whinston, and J. R. Green. Microeconomic Theory. Oxford University Press, 1995.Google Scholar
- B. O'Neill. A problem of rights arbitration from the talmud. Mathematical Social Sciences, 2(4):345--371, June 1982.Google ScholarCross Ref
- R. Rajkumar, C. Lee, J. Lehoczky, and D. Siewiorek. A resource allocation model for qos management. In Proceedings of the IEEE Real-Time Systems Symposium, 1997. Google ScholarDigital Library
- F. Risso. Decoupling Bandwidth and Delay Properties in Class Based Queueing. In Proceedings of the 6th IEEE Symposium on Computers and Communications, july 2001. Google ScholarDigital Library
- L. S. Shapley. A value for n-person games. Contrib. to the Theory of Games, 2:307--317, 1953.Google Scholar
- Siemens and Juniper. High availability network architectures for triple play services. White paper, Siemens Communications and Juniper Networks, 2006.Google Scholar
- W. Thomson. Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey. Mathematical Social Sciences, 45(3):249--297, 2003.Google ScholarCross Ref
- C. Touati, E. Altman, and J. Galtier. Generalized nash bargain solution for bandwidth allocation. Computer Networks, 50:3242--3263, 2006. Google ScholarDigital Library
- J. von Neumann and O. Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, London, 1953.Google Scholar
- H. Yaïche and R. R. M. C. Rosenberg. Distributed algorithms for fair bandwidth allocation to elastic services in broadband networks. In Proceedings of the Conference on Computer Communications (IEEE Infocom), Tel Aviv, Israel, march 2000.Google ScholarCross Ref
Index Terms
- Fair bandwidth sharing using Shapley value
Recommendations
Extensions to P2MP RSVP-TE for VPN-specific state provisioning with fair resource sharing
Among the resource provisioning algorithms for the hose-based Virtual Private Network (VPN) Quality of Service (QoS), VPN-specific state provisioning allows the service provider to obtain highest resource multiplexing gains. In this paper, we show that ...
A provision-aware fair bandwidth distribution marker algorithm for DiffServ networks
The rise in demand for real-time applications on the Internet necessitates Quality of Service (QoS). Differentiated Services (DiffServ) is one of the technologies used currently to provide QoS and service differentiation. It is simple and scalable. It ...
QoS-aware hierarchical token bucket (QHTB) queuing disciplines for QoS-guaranteed Diffserv provisioning with optimized bandwidth utilization and priority-based preemption
ICOIN '13: Proceedings of the 2013 International Conference on Information Networking (ICOIN)In most commercial IP routers, the traffic engineering is not fully supporting the optimized bandwidth sharing for QoS-guaranteed DiffServ provisioning with optimized bandwidth sharing that dynamically redistributes any unused bandwidth to backlogged ...
Comments