한국정보처리학회논문지 (The Transactions of the Korea Information Processing Society)
- 제7권11S호
- /
- Pages.3684-3693
- /
- 2000
- /
- 1226-9190(pISSN)
동적우선권제어함수 기반 TBPJ 트래픽 제어방식의 성능분석
Performance Analysis of Threshold-based Bernoulli Priority Jump Traffic Control Scheme
초록
본 논문에서는 다양한 트래픽을 수용해야 하는 차세대 인터넷에서 핵심적인 기능을 담당하는 고속 패킷스위치를 위한 동적우선권제어함수(Dynamic Priority Control Function)이 개념을 도입하고 TBPJ(Threshold-based Bernoulli Priority Jump) 방식에 대한 성능분석을 하였다. 동적우선권제어함수(Dynamic Priority Control Function)는 시스템의 상태에 따라 각 트래픽에 우선권을 동적으로 할당하여 패킷의 스케쥴링(scheduling)을 제어하는 함수 f(.)이다. 클래스 1의 손실민감(loss-sensitive) 트래픽과 클래스 2의 지연민감(delay-sensitive) 트래픽이 고속 패킷스위치의 모든 입력포트에 동일하게 입력되고 스위칭속도(switching capacity)가 m인
In this paper, performance of a nonblocking high speed packet switch with switching capacity m which adopts a dynamic priority control function (DPCF) of a threshold- based Bernoulli priority jump (TBPJ) scheme is considered. Each input queue has two separate buffers with different sizes for two classes of traffics, delay-sensitive and loss-sensitive traffics, and adopts a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Under the TBP] scheme, a head packet of the delay-sensitive traffic buffer goes into the loss -sensitive traffic buffer with Hernoulli probability p according to systems states that represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. In addition to, TBP] scheme shows better performance than that of HOL scheme.
키워드