A Study on the Improvement of Real-Time Traffic QoS using the Delay Guarantee Queue Service Discipline of End-to-End

종단간 지연 큐 서비스 방식을 이용한 실시간 트래픽 QoS 개선에 관한 연구

  • 김광준 (조선대학교 전자정보공과대학) ;
  • 나상동 (조선대학교 전자정보공과대학)
  • Published : 2002.04.01

Abstract

We propose a cell-multiplexing scheme for the real-time communication service in ATM network and a new service discipline guarantee end-to-end delay based on pseudo-isochronous cell switching. The proposed scheme consists of two level frame hierarchy, upper and lower frame, which is used to assign the bandwidth and to guarantee the requested delay bound, respectively. Since the Proposed algorithm employs two level frame hierarchy, it can overcome the coupling problem which is inherent to the framing strategy It can be comparatively reduce the complexity, and still guarantee the diverse delay bounds of end-to-end. Besides, it consists of two components, traffic controller and scheduller, as the imput traffic description model and regulates the input traffic specification. The function of the traffic controller is to shape real -time traffic to have the same input pattern at every switch along the path. The end-to-end delay is bounded by the scheduller which can limit the delay variation without using per-session jitter controllers, and therefore it can decrease the required buffer size. The proposed algorithm can support the QoS's of non-real time traffic as well as those of real time traffic.

ATM망에서 큐 서비스 방식에서는 상위 프레임과 하위 프레임을 따로 정의하여 대역폭 할당과 전송 지연 보장을 분리할 수 있기 때문에 종단간 전송한계에서 QoS를 보장 할 수 있는 단순화한 큐 서비스 구현을 제안하였다. 제안한 큐 서비스 방식은 실시간 트래픽과 비실시간 트래픽을 나누어 저장하기 때문 에 연결별 트래픽 조절기 없이도 지연 지터 특성이 개선되었다. 제안된 큐 서비스 방식을 이용하여 연결 수락 제어는 트래픽 왜곡의 영향을 계산할 수 없는 트래픽 왜곡의 영향이 실재로 존재한다는 가정 하에 트래픽 왜곡에 대한 영향에 종단간 지연을 보장함으로 서 연결 수락 가능 범위를 다양한 프레임의 길이에 대해 나타내었으며, 프레임의 길이가 클수록 제안된 큐 서비스 방식의 연결 수 락 범위가 지연 EDD방식과 비교해서 많은 차이를 보이지만 프레임의 길이를 점차 줄여갈수록 연결 수락 가능 범위가 지연 EDD 방식에 근접함을 나타내었다.

Keywords

References

  1. C. Li, Y. Ofek, A, Segall, and K. Sohraby, 'Pseudo-isochronous Cell Switching in ATM Networks,' in Proc. IEEE infocom'94, pp.428-437, 1994
  2. C. Parris, G. Ventre and H. Zhang, 'Graceful Adaptation of Guaranteed Performance Service Connections,' In Proceedings of IEEE GLOBECOM'93, Houston, TX, November, 1993
  3. H. Kanakia, P. Mishra and A. Reibman, 'An Adaptive Congestion Control Scheme for Real-time Packet Video Transport,' In Proc.of ACM SIGCOMM'93, San francisco, California, pp.20-31, Sept. 1993
  4. H. Kroner, 'Comparative Performance Study of Space Priority Mechanisms for ATM Networks,' In Proc. of the IEEE INFOCOM, pp.1136-1143, June 1990
  5. J. C. R. Bennett and H. Zhang, 'Hierarchical Packet Fair Queueing Algorithm,' Proc.of SIGCOMM '96, August 1996
  6. L. Zhang, 'Virtual Clock: a New Traffic Control Algorithm for Packet Switching,' In Proc. ACM Sigcomm'90, pp.19-29, 1990
  7. M. Juiano et al. White Paper, 'ATM Traffic Management and Congestion Control Fore System," Inc., February 1994
  8. R. Chipalkatti, J. F. Kurose and D. Towsley, 'Scheduling Policies for Real-time and Non-real-time Traffic in a Statistical Multiplexer,' In Proc. of IEEE INFOCOM, April 1989
  9. H. Zhang and S. Keshav, 'Comparison of Rate-based Service Disciplines,' In Proc. ACM Sigcomm'91, pp.113-121, 1991
  10. Ian R. Philp and Jane W. S. Liu, 'End-to-End Scheduling in Real-time Packet Switched Networks,' In Proc. International Conference on Network Protocol, Columbus, Ohio, pp.23-30, October 1996
  11. J. C. R. Bennett and H. Zhang, 'WF2Q : Worst-case Fair Weighted Fair Queueing,' In Proc. IEEE Infocom'96, pp.120-128, 1996
  12. S. Jamaloddin Golestani, 'A Stop-and-Go Queueing Framework for Congestion Management'In SIGCOMM' 90Symposium, Communication Architecture & Protocols, Philadelphia Pennsylvania, Sept. 1990