• ETRI Journal
• /
• 제24권5호
• /
• pp.360-372
• /
• 2002

In this paper, we propose the modified dynamic weighted round robin (MDWRR) cell scheduling algorithm, which guarantees the delay property of real-time traffic and also efficiently transmits non-real-time traffic. The proposed scheduling algorithm is a variation of the dynamic weighted round robin (DWRR) algorithm and guarantees the delay property of real-time traffic by adding a cell transmission procedure based on delay priority. It also uses a threshold to prevent the cell loss of non-real-time traffic that is due to the cell transmission procedure based on delay priority. Though the MDWRR scheduling algorithm may be more complex than the conventional DWRR scheme, considering delay priority minimizes cell delay and decreases the required size of the temporary buffer. The results of our performance study show that the proposed scheduling algorithm has better performance than the conventional DWRR scheme because of the delay guarantee of real-time traffic.

• 한국통신학회논문지
• /
• 제19권3호
• /
• pp.479-491
• /
• 1994

본 논문에서는 유한 크기의 출력 버퍼를 가진 ATM 스위치에서 셀 지연 요구와 셀 손실 요구를 고려한 2-레벨 임계치를 갖는 우선순위 제어 방식을 제안하였다. 본 논문에서 제안한 우선 순위 제어 방식은 유한크기를 가진 하나의 버퍼에서 두개의 임계치를 두어 손실에 민감한 셀에 대해서는 셀손실률을 개선하고, 지연에 민감한 셀에 대해서는 셀 지연 시간을 개선하는 방법이다. 본 방식에서는 우선순위 제어 방식을 이론적으로 구하고 수치해석을 통해 셀손실률과 평균셀지연을 구하였다. 셀의 서비스 품질 특성에 따라 두개의 임계치를 적절히 조절함으로써 셀손실률 또는 평균셀지연의 개설효과를 얻을 수 있음을 확실히 알 수 있다.

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1998년도 학술발표대회 논문집 제17권 1호
• /
• pp.339-342
• /
• 1998

The various services that a broadband integrated services digital network (B-ISDN) carries, have a wide range of delay, delay jitter and cell loss probability requirements. Design of appropriate control schemes for B-ISDN is an extremely important and challenging problem. In this paper, we proposes a priority control scheme with a delay counter and a cell counter per each class type. The priority control for required service quality is performed with delay/loss factor obstained by comparing window counter with cell counter. The performance of proposed control scheme is estimated by computer simulation.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(3)
• /
• pp.81-84
• /
• 2000

Scheduling algorithm proposed in this paper is based on both DWRR(Dynamic Weighed Round Robin) method and QLT(Queue Length Threshold) method. The proposed scheduling algorithm guarantees delay property of realtime traffic, not considered in previous DWRR method, with serving realtime traffic preferentially by using RR(Round Robin) method which service each channel equally and QLT algorithm that is dynamic time priority method. Proposed cell scheduling algorithm may increase some complexity over conventional DWRR scheme because of delay priority based cell transmission method. However, due to reliable ABR service and congesition avoidance capacity, proposed scheduling algorithm has good performance over conventional DWRR scheme. Also, delay property based cell transmission method in proposed algorithm minimizes cell delay and requires less temporary buffer size

• 산업경영시스템학회지
• /
• 제28권4호
• /
• pp.14-19
• /
• 2005

In general, cell transmission delay is more sensitive for real time video service rather than cell losses in a wireless ATM network. Existing handoff schemes, which are emphasizing the prevention of cell losses, have limitations in cell transmission delay to satisfy QoS. In this paper, we propose a scheme to minimize transmission delay generated during the handoff and to maintain the sequence of cells. Transmission delay can be reduced by transmitting ATM cells with low CLP(i.e., CLP=0) prior to others and by discarding cells with high CLP(i.e., CLP= 1). The simulation results show that the proposed scheme is suitable for delay sensitive real time VBR service as well as fast handoff by giving high CLP to less meaningful MPEG frames.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.75-78
• /
• 1998

In this paper, we propose a new cell discarding and scheduling scheme which reduce cell loss rate by measuring, in real time, the number of discarded cells in the queuing system with a different loss priority for each class of service such that each class of service meets its cell loss rate requirements and reduce average delay rate for the traffic that is sensitive in cell delay in output buffer of the ATM switch. Throughout the computer simulation, the existing scheduling scheme and proposed scheme are compared with respect to cell loss rate and average delay time.

• 정보처리학회논문지C
• /
• 제8C권6호
• /
• pp.805-814
• /
• 2001

본 논문에서는 기존의 DWRR(Dynamic Weighted Round Robin) 알고리즘이 고려하지 못한 실시간 트래픽의 지연 특성을 보장하면서, 비실시간 트래픽도 효율적으로 전송할 수 있는 셀 스케쥴링 알고리즘을 제안하고자 한다. 이 스케쥴링 알고리즘은 기존의 DWRR 알고리즘을 개선한 것으로, 지연 우선 순위 기반의 셀 전송방식을 추가하여 실시간 트래픽의 지연 특성을 보장하면서, 그로 인한 비실시간 트래픽의 셀 손실을 막기 위해 비실시간 트래픽에 임계치를 설정한다. 제안한 스케쥴링 알고리즘은 지연 우선 순위 기반의 셀 전송방식이 추가되어 기존의 DWRR 알고리즘에 비하여 복잡도가 다소 증가될 수 있으나, 실시간 트래픽의 지연을 최소화하고 버퍼 크기를 감소시킬 수 있으며, CBR, VBR 트래픽 뿐만 아니라 대역폭에 유연성을 지니는 ABR 트래픽의 서비스를 효과적으로 지원한다.

• 전자공학회논문지A
• /
• 제31A권6호
• /
• pp.199-208
• /
• 1994

This paper proposes a delay fault test technique for ICs and PCBs with the boundary-scan architectures supporting ANSI/IEEE Std 1149.1-1990. The hybrid delay fault model, which comprises both of gate delay faults and path delay faults, is selected. We developed a procedure for testing delay faults in the circuits with typical boundary scan cells supporting the standard. Analyzing it,we concluded that it is impractical because the test clock must be 2.5 times faster than the system clock with the cell architect-ures following up the state transition of the TAP controller and test instruction set. We modified the boundary-scan cell and developed test instructions and the test procedure. The modified cell and the procedure need test clock two times slower than the system clock and support the ANSI/IEEE standard perfectly. A 4-bit ALU is selected for the circuits under test. and delay tests are simulated by the SILOS simulator. The simulation results ascertain the accurate operation and effectiveeness of the modified mechanism.

• 한국통신학회논문지
• /
• 제28권9B호
• /
• pp.751-759
• /
• 2003

진행형 지연선로 또는 지연선 루프를 저장 유닛으로 사용하는 시간 분할 다중합(TDM) 광 출력 버퍼의 셀 손실 확률, 셀 지연 시간 등의 성능을 분석하여 보았다. 저장 유닛으로 사용되는 진행형 지연선로는 지연선 루프보다 그 구조가 단순하고, 저장 신호의 질적인 면에서 더 우수하여, 기존 TDM 광 출력 버퍼에 사용되었다. 반면에, 지연선 루프는 루프 내에서의 셀 회전 수 조절을 통해 저장 시간을 조절할 수 있다는 점에서 진행형 지연선로보다 그 유연성이 우수하다. 따라서 지연선 루프를 저장 유닛으로 사용하는 새로운 TDM 광 출력 버퍼를 제안하였다. 제안한 TDM 광 출력 버퍼는 $10^{-9}$ 이하의 셀 손실 확률을 얻기 위해 필요한 저장 유닛의 수를 줄일 수 있음을 보였다. 그리고 저장 유닛의 수가 충분히 클 때, 두 가지 TDM 광 출력 버퍼는 동일한 셀 지연 시간 특성을 보였다.

• 전자공학회논문지A
• /
• 제33A권6호
• /
• pp.23-32
• /
• 1996

This paper proposes a new buffer management scheme to service delay-sensitive traffic and loss-sensitive traffic fairly in ATM networks. The proposed scheme uses tow buffers for delay-sensitive traffic and loss-sensitive traffic. To satisfy the average delay time of delay-sensitive traffic, cells in real-time buffer are served first. When congestion occurs in nonreal-time buffer, low loss priority cell in real-time buffer can be pushed out by high loss priority cell in nonreal-time buffer can be transferred to real-time buffer considering threshold value in real-time buffer. Using computer simulation, the existing methods and proposed scheme are compared and analyzed with respect to cell loss rate and average delay time. Simulation results show that the proposed scheme have superior performance to conventional schemes.