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

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

Preventive Adaption Threshold Mechanism in Buffer Allocation for Shared Memory Buffer

공유 메모리 버퍼에서의 예방적 적응 한계치 버퍼 할당 기법

  • 신태호 (한국항공대학교 통신정보공학과) ;
  • 이성창 (한국항공대학교 전자.정보통신.컴퓨터공학부) ;
  • 이형호 (한국전자통신연구원 네트워크 기술연구소)
  • Published : 2001.10.25
Download PDF
⟨ Previous Next ⟩

Abstract

Delay, delay variation and packet loss rate are principal QoS(Quality of Service) elements of packet communication. This paper proposes a new buffer allocation mechanism to improve the packet loss performance in such a situation that multiple logical buffers share a single physical memory buffer. In the proposed buffer allocation mechanism, the movement of dynamic threshold follows a curved track instead of a straight line which is used in the DT(dynamic threshold) mechanism. In order evaluate the effectiveness of the proposed mechanism, it is compared with the existing previously proposed mechanisms in several aspects including NC(no control), ST(Static Threshold) and DT mechanisms.

패킷 통신에 있어서 주요 서비스 품질(QoS : Quality of Service) 요소로는 지연(delay), 지연 변이(delay variation), 패킷 손실율(loss rate) 등이 있다. 본 논문에서는 복수의 논리적 버퍼가 하나의 메모리 버퍼를 공유할 때, 논리버퍼의 손실율 성능을 향상시키기 위한 새로운 버퍼 할당 기법을 제안한다. 제안된 예방적 적응 한계치(PAT : Preventive Adaption Threshold) 버퍼 할당 기법은 기존의 동적 한계치 (Dynamic Threshold)기법에서 사용하는 패킷 폐기 한계치(threshold)의 직선적 변화 궤적과는 다른 한계치 동적 변화 궤적을 사용함으로써 패킷 손실율 성능을 개선하였다. 제안된 기법의 성능을 평가하기 위하여 기존의 무제어(NC : No Control), 고정 한계치(ST : Static Threshold), 동적 한계치(DT : Dynamic Threshold)등의 기법과 여러 측면에서 손실율 성능을 비교하였다.

Keywords

References

  1. K. Parekh and R.G. Gallager, 'A generalized processor shming approach to flow control in integrated services networks: The multiple node case,' IEEF/ACM Trans. Networking, vol. 2. no. 2, pp. 137-150. April 1994 https://doi.org/10.1109/90.298432
  2. M. Shreedher and G. Varghese, 'Efficient fair queueing using deficit round robin,' IEEE/ACM Trans. Networking, vol. 4, no. 3, pp. 375-385, June 1996 https://doi.org/10.1109/90.502236
  3. L. Zhang. 'Virtual clock: A new traffic control algorithm for packet switched networks,' ACM Trans. Comp. Sys., vol. 9, no. 2, pp. 101-124, May 1991 https://doi.org/10.1145/103720.103721
  4. H. Yokota. M. Forsberg, T. Asarni. 'Exetntion to weighted round robin packet scheduling for variable-length packet networks, ' IEICE Trans. INF. & SYST., vol. E82-D, no. 3, March 1999
  5. L,. Georgiadis, I. Cidun, R. Guerin, and A, Khamisy, 'Optimal Duffer Sharing', in Proc. IEEE INFOCOM' 95, vol.1 (Boston, Massachusetts), pp.24-31, Apr. 1995
  6. F. A Tobagi, 'Fast packet switch architectures for broad-band integrated services digital networks,' in Proceedings of IEEE, vol. 78, no. 1, Jan. 1990
  7. M. G. Illuchyj and M. J. Karol, 'Queueing in lligh-Pertorrmmce Packet Switching,' IEEE J. Select. Areas Commun, vol. 6, pp. 1587-1597, Dec. 1988 https://doi.org/10.1109/49.12886
  8. H. Kuwahara, N. Endo, M. Ogino, T. Kozaki, 'A shared buffer memory switch for an ATMI exchange.' in Proceedings ICC' 89, pp. 118. June 1989
  9. G. J. Foschini and B. C,opinaU1, 'Shruing memory optimally,' IEEE Trans. Commun., vol. 3, pp. 352-360, March 1983 https://doi.org/10.1109/TCOM.1983.1095819
  10. M. I. Irland, 'Buffer management in a packet switch,' IEEE Trans. Commun., vol. 26, pp. 328-339, March 1978 https://doi.org/10.1109/TCOM.1978.1094076
  11. F. Kamoun and L. Kleinrock, 'Analysis of shared finate storage in a computer network node Environment under general traffic conditions,' IEEE Trans. commun., vol. 28, pp. 992-1003, July 1980 https://doi.org/10.1109/TCOM.1980.1094756
  12. S. X. Wci. E. J, Coyle, and M. T. Hsiao, 'An optimal buffer management policy for high performancc packet switching,' in Proc. IEEE GLOBECOM' 91, pp. 924-928, Dec. 1991
  13. A.K. Choudhury and E.L.Hahne, 'Dynamic Queue Length Thresholds in a Shared Memory ATM Switch', Proc. INFOCOM' 96, San Francisco, CA, March 1996 https://doi.org/10.1109/INFCOM.1996.493364
  14. A.K. Choudhury and E. L. Hahne. 'Space Pnority Magement in a Shared Memory ATM Switch', in Proc. IEEE GLOBECOM' 93, vol.3.(Houston, Texas), pp.1375-1383, Dec. 1933
  15. A.K. Choudhury and E. L. Hahne. 'A Simulation Study of Space Prioritics in a Shared Memory ATM Switch', Jounlal of High Speed Networks. vol.3, pp.491-512, Nov. 1994
  16. J. Garcia-Haro, R.Marin Sillue, and J.L.Melus Moreno, 'Description of a Simulmion Environment to Evaluate High Performance ATM Fast Packet Switches', 5th IEIP Conf. on High Performance Networking, pp. 421-436, June 27- July 1, 1994, Grenoble(France)
  17. Simon Fong, Samar Singh, 'Queuing analvsis of shared-buffer Switches with control scheme under bursty traffic'. Computer Cummunications 21. 1998