비연결성 서비스를 위한 ATM 네트워크에서의 스케줄링 방법 : Frame-Weighted Scheduling for Connectionless Services in ATM Networks

Cited 0 time in Web of Science Cited 0 time in Scopus

호경중; 서승우; 김성철

Issue Date
한국통신학회 = Korea Information and Communications Society (KICS)
한국통신학회논문지, 25(7B), pp. 1292-1300, 2000
논문번호 : 99128-0330
본 논문에서는 연결지향적인 ATM 네트워크에서 비연결지향적인 데이터 전송을 효율적으로 하기 위한 방법으로 Frame-Weighted(FW) 스케줄링 기법을 제시한다. 본 방법은 기존의 GPS 계열이 갖는 셀 단위에서의 스케줄링으로 인한 낮은 효율 및 높은 셀 손실을 프레임 단위에서의 스케줄링으로 극복한다. 이를 이용하면 네트워크 내의 버퍼 점유율을 낮춤으로써 프레임 지연을 단축하고 셀 손실을 최소화할 수 있어 데이터 전송에 효과적으로 쓰일 수 있다.

In this paper, we consider the problem caused when a connection-oriented ATM network supports connecionless IP traffic in a buffer usage aspect. In processing cells in conventional ATM network, GPS-related scheduling schemes are used to satisfy the fairness principle. We argue that GPS-related scheduling disciplines are good in pure ATM networks, but in supporting IP traffic these disciplines lead to inefficiency, high cell loss rate and much delay. We propose an alternative scheduling discipline in which we schedule cells with respect to IP packets and weight the priority of cells in the same IP packet until the end cell of a packet is processed. We show that this shortens the time in which IP packets stay in networks, thus can lower the usage of buffers. We demonstrate the effect of our schefuling principle through simulation.
Files in This Item:
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Electrical and Computer Engineering (전기·정보공학부)Journal Papers (저널논문_전기·정보공학부)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.