대한전자공학회논문지TC (Journal of the Institute of Electronics Engineers of Korea TC)

대한전자공학회 (The Institute of Electronics and Information Engineers)
권호 표지

잉여 대역폭 소비 큐를 이용한 잉여 대역폭 페어 큐잉

Excess Bandwidth Fair Queueing Using Excess Bandwidth Consumer Queue

  • 추호철 (숭실대학교 정보통신전자공학부) ;
  • 김영한 (숭실대학교 정보통신전자공학부)
  • 발행 : 2002.10.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

인터넷에서 서비스 품질을 제공하기 위해 대역폭에 대한 스케줄링 기술은 중요한요소 중 하나로서 많은 알고리즘이 개발되었다. 그러나 기존의 스케쥴링 알고리즘은 잉여 대역폭 분배에 있어 융통성을 제공하고 있지 않다. 이를 보완하여 잉여 대역폭 분배에 융통성을 제공하기 위해 DGPS(decoupled generalized processor sharing)가 제안되었지만/sup 〔1〕구현이 복잡하고 기존의 다양한 알고리즘에 쉽게 적용하기에는 어려움이 따랐다. 본 논문에서는 잉여 대역폭 분배의 융통성을 제공하고 동시에 DGPS의 문제점을 개선하여 기존의 기반 알고리즘에 자연스럽게 적용할 수 있는 스케쥴링 알고리즘을 제안하고 공평성을 분석하였다. 또한 시뮬레이션을 통해 성능을 검증하였다.

Scheduling technology is one of the most important elements required to support the Qos(quality of service) in the Internet and a lot of scheduling algorithms have been developed. However, most of there algorithms are not flexible in the distribution of the excess bandwidth. In order to improve the weakness of existing algorithms, DGPS(decoupled generalized processor sharing)has suggested recently. But, the DGPS algorithm is complex to implement and difficult to apply to the existing algorithms. In this paper, we propose a scheduling algorithm for distribution of the excess bandwidth which improves the implementation complexity of the DGPS and easy to be applied to ordinary algorithms.

키워드

참고문헌

  1. Francois Toutain, 'Decoupled Generalized Processor Sharing: A Fair Queueing Principle for Adaptive Multimedia Applications,' Proc. INFOCOM'98, pp. 291-298, March 1998 https://doi.org/10.1109/INFCOM.1998.659665
  2. A. K. Parekh and R. G. Gallager, 'A Generalized Processor Sharing Approach to Flow Control in Integrated Service Networks: The Single-Node Case,' IEEE/ACM Trans. Networking, pp. 344-357, June 1993 https://doi.org/10.1109/90.234856
  3. S. J. Golestani, 'A Self-Clocked Fair Queueing Schme for Broadband Applications,' Proc. INFOCOM'94, pp. 636-646, June 1994 https://doi.org/10.1109/INFCOM.1994.337677
  4. J.C.R. Bennett and H. Zhang, 'WF2Q: Worst-case fair weighted fair queueing,' Proc. INFOCOM'96, pp. 120-128, March 1996 https://doi.org/10.1109/INFCOM.1996.497885
  5. J.C.R. Bennett and H. Zhang, 'Hierarchical Packet Fair Queueing Algorithms,' Proc. SIGCOMM'96, pp. 143-156, Aug. 1996 https://doi.org/10.1145/248156.248170
  6. G. Xie and S. Lam, 'Delay guarantee of virtual clock server,' IEEE/ACM Transactions on Networking, 3(4) : 683-689, December 1995 https://doi.org/10.1109/90.477714
  7. L. Zhang, 'Virtual clock: A new traffic control algorithm for packet switching networks,' Proceedings of ACM SIGCOMM'90, p. 19-29, September 1990 https://doi.org/10.1145/99508.99525
  8. P. Goyal, H. M. Vin, and H. Chen, 'Start-time Fair Queueing : A scheduling algorithm for integrated service,' Proceedings of ACM-SIGCOMM'96, pp. 157-168, Palo Alto,CA, August 1996 https://doi.org/10.1145/248156.248171
  9. D. Ferrari and D. Verma, 'A scheme for realtime channel establishment in wide-area networks,' IEEE Jounal on Selected Areas in Communications, 8(3):363-376, 1990 https://doi.org/10.1109/49.53013
  10. S. S. Lam and G. G. Xie, 'Group Priority Scheduling,' IEEE/ACM Transaction on Networking, Vol. 5, No. 2, April 1997 https://doi.org/10.1109/90.588083
  11. A. Varma and D. Stiliadis, 'Hardware Implementation of Fair Queueing Algorithm for ATM Network,' IEEE Communication Magazine, December 1997
  12. D. Stiliadis and A. Varma, 'Latency-Rate Serviers: A General Model for Analysis of Traffic Scheduling Algorithms,' Proc. IEEE INFOCOM'96, pp. 111-119, April 1996 https://doi.org/10.1109/INFCOM.1996.497884