The Journal of The Korea Institute of Intelligent Transport Systems (한국ITS학회 논문지)

The Korea Institute of Intelligent Transport Systems (한국ITS학회)
권호 표지
DOI QR코드

DOI QR Code

A Bandwidth Allocation Scheme using NBS in a Multiservice Networks

멀티서비스 네트워크에서 NBS를 이용한 대역폭 할당 기법

  • 박재성 (수원대학교 정보보호학과)
  • Received : 2011.11.15
  • Accepted : 2011.12.30
  • Published : 2012.02.29
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, using the bargaining game theory, we propose a bandwidth management scheme that allocates bandwidth in an efficient and proportionally fair manner between the service classes with different service requirements. Since the traffic input rates of the classes are asymmetric in most of the time, the proposed scheme allocates bandwidth in proportion to the traffic input rates to increase the bandwidth utilization while protecting the quality of service of a class against the excessive traffic input of the other classes. In addition, the proposed method considers the weights of classes so that the bandwidth is allocated differentially among the classes.

본 논문에서는 협상 게임 이론의 특성을 이용하여 서비스 요구 사항이 상이한 다수의 서비스 클래스들이 노드의 대역폭을 공유하는 경우 효율성 증대와 클래스별 비례적 공정성을 보장할 수 있는 대역폭 할당 기법을 제안한다. 일반적으로 각 클래스의 트래픽 입력율은 대부분의 시간에 비대칭적이기 때문에 제안기법은 클래스별 입력율에 따라 비례적으로 대역폭을 할당함으로써 시스템 측면에서 대역폭 이용 효율을 증대시킨다. 또한 제안 기법은 특정 클래스의 과도한 트래픽 입력으로 인한 타 클래스의 서비스 품질 저하를 방지하며, 클래스별 가중치에 따라 차등적이며 공정하게 대역폭을 할당한다.

Keywords

References

  1. F. Bonomi and K. W. Fendick, "The rate-based flow control framework for the available bit rate ATM service," IEEE Network Magazine, vol. 9, no. 2, pp.25-39, Mar./Apr. 1995. https://doi.org/10.1109/65.372653
  2. F. Kelly, "Charging and rate control for elastic traffic," European Trans. on Telecommunications, vol. 8, pp.33-37, 1998.
  3. M. J. Osborne and A. Rubinstein, A course in game theory, The MIT Press, pp.117-132, 1994.
  4. J. Nash, "The Bargaining Problem," Econometrics, vol. 18, no. 2, pp.155-162, Apr. 1950. https://doi.org/10.2307/1907266
  5. B. Krithikaviasan, K. Deka and D. Medhi, "Adaptive bandwidth provisioning envelope based on discrete temporal network measurements," IEEE INFOCOM04, pp.1786-1796, Mar. 2004.
  6. B. Al-Manthari, N. A. Ali, N. Nasser and H. Hassanein, "Dynamic bandwidth provisioning with fairness and revenue considerations for broadband wireless communication," IEEE ICC08, pp.4028-4032, May 2008.
  7. S.-L. Hew and L. B. White, "Cooperative resource allocation games in shared networks: symmetric and asymmetric fair bargaining models," IEEE Trans. on wireless communications, vol. 7, no. 11, pp.4166-4175, Nov. 2008. https://doi.org/10.1109/T-WC.2008.06102
  8. H. Lundqvist, "Admission control with resource reallocation," IEEE Teletraffic congress, pp.1-8, Sept. 2009.
  9. C. Touati, E. Altman and J. Galtier, "Generalized Nash Bargaining Solution for Bandwidth Allocation," Elsevier Computer Networks, vol. 50, no. 17, pp.3242-3263, Dec. 2006. https://doi.org/10.1016/j.comnet.2005.12.006
  10. 3GPP TR 25.932, Delay budget within the access stratum version 2.0.0, 3rd generation partnership project (3GPP) technical specification group (TSG) RAN, 2000.
  11. ITU-T Y.1541, "Network Performance Objectives for IP-Based Services," May 2002.
  12. Y. Zhang, Y. Xiao and H. H. Chen, "Queuing analysis for OFDM subcarrier allocation in broadband wireless multiservice networks," IEEE Trans. wireless communications, vol. 7, no. 10, pp.3951-3961 2008. https://doi.org/10.1109/T-WC.2008.070495