• Journal of the Korea Society of Computer and Information
• /
• v.5 no.3
• /
• pp.112-118
• /
• 2000

In this paper, a hybrid UPC algorithm is proposed, which combines the representative Leaky Bucket UPC algorithm with the EWMA window algorithm in the ATM network and then its performance Is evaluated. The hybrid UPC algorithm is made up of Leaky Bucket and EWMA, which control the Peak bit rate and the mean bit rate, respectively. According to the result of the simulation using BONeS with the On/off traffic source model. it is revealed that the proposed UPC algorithm has superior performance to the existing Leaky Bucket UPC algorithm with regard to both the cell loss rate and the buffer size.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1382-1390
• /
• 1999

본 논문에서는 ATM 망에서 대표적 사용 파라미터 제어(UPC) 알고리즘인 리키버켓 알고리즘과 윈도우 알고리즘의 하나인 EWMA 알고리즘을 결합한 복합형 UPC 알고리즘을 제안하고 그 성능을 평가 분석하였다.제안된 알고리즘은 최대전송율을 제어하는 리키버켓과 평균전송율을 제어하는 EWMA를 병렬로 결합하여, 최대전송율과 평균전송율을 동시에 고려하였다. ON/OFF 트래픽 소스 모델을 적용, BONeS를 이용하여 모의실험한 결과 제안 알고리즘이 기존의 리키버켓 알고리즘에 비해 셀 손실율과 버퍼 크기면에서 우수한 성능을 나타냈다.Abstract In this paper, a hybrid UPC algorithm is proposed, which combines the representative Leaky Bucket UPC algorithm with the EWMA window algorithm in the ATM network and then its performance is evaluated. The hybrid UPC algorithm is made up of Leaky Bucket and EWMA, which control the peak bit rate and the mean bit rate, respectively. According to the result of the simulation using BONeS with the On/Off traffic source model, it is revealed that the proposed UPC algorithm has superior performance to the existing Leaky Bucket UPC algorithm with regard to both the cell loss rate and the buffer size.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.88-90
• /
• 2002

본 논문에서는 ATM 망의 트래픽 제어 기능 중의 하나인 UPC(Usage Parameter Control) 알고리즘을 제안하고 VHDL을 이용하여 칩(chip)을 구현하였다. 제안한 알고리즘은 우선순위가 높은 셀의 손실을 최소로 하고, 트래픽의 다중화 및 역다중화 과정에서 발생되는 트래픽의 군집성을 해소할 수 있다는 장점을 갖고 있다. 구현한 칩은 입력 모듈과 UPC 모듈, 출력 모듈의 3부분으로 이루어지며, 편의상, UPC 모듈에서는 커넥션 테이블의 index를 VCI(Virtual channel Identifier)와 동일하게 할당하였다. 또한 UPC 모듈의VSA(Virtual Scheduling Algorithm)블럭에서 셀의 도착시간을 계수하는 카운터가 랩-어라운드(wrap-around)할 때 생기는 VSA의 오류를 보정하여 구현하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.1
• /
• pp.224-236
• /
• 1997

In order to control the flow of traffic in ATM networks and optimize the usage of network resources, an appropriate control mechanism is necessary to cope with congestion or prevent degradation of network performance caused by congestion. While the conventional UPC algorithm provides only unstable preventive function unrelated with the state of networks and is unable to recover congestion, the proposed adaptive UPC algorithm supervises the situation of ATM networks using the information from OAM cell. Then the monitor of the proposed adaptive UPC algorithm controls leaky rate and buffer threshold value according to QOS. Therefore, the proposed algorithm can cope with congestion as well as prevent and react sensitively to buffer delay. In proportion to the diversity of traffic and the increase of transmission rate in networks, the adaptive UPC-BT algorithm proposed in this paper can be effectively used in ATM networks with wide applications. This paper shows that the proposed algorithm efficiently uses in ATM networks with application. This paper shows that the proposed algorithm efficiently use network resources and provides QOS to users for various kinds of traffics by comparing with conventional UPC algorithms.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2008.06a
• /
• pp.39-45
• /
• 2008

ATM망에서 트래픽의 버스트니스를 완화하기 위한 UPC(Usage Parameter Control) 알고리즘을 제안한다. 기존의 다이나믹 스페이서는 그린 토큰이 축적되어 있을 경우 도착하는 셀을 스페이서와 상관없이 네트워크로 셀을 유입시키는 동적인 스페이서 기능을 수행함으로써 CDV(Cell Delay Variation)에 의한 셀을 위반셀로 구별하지 못하고 그대로 통과시키는 단점이 있다. 즉 스페이서 기능을 사용하지 않음으로써 버스트니스해 질 수 있다. 따라서 본 논문에서는 버스트니스를 완화하기 위한 토큰 버킷을 다이나믹 스페이서 이전에 사용함으로써 다이나믹 스페이서의 버스트니스를 완화시키는 토큰 버킷을 적용한 다이나믹 스페이서 UPC 알고리즘을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.1116-1125
• /
• 1997

In this paper, the modified UPC(Usage Parameter Control) algorithm is proposed. The proposed UPC algorithm is based on Leakey Bucket algorithm and adds the characteristics of the jumping window algorithm for monitoring the average bit rate. The proposed algorithm let a cell, which is tagged by Leaky Bucket algorithm, pass through the network, if the network does not violate the average bit rate. The measuring method of window mechanism like jumping window. This paper supposes On/Off traffic source model of rthe performance evaluation and analysis of the proposed algorithm. Therefore, as simulation results, the proposed algorithm acquires more reduced results of the cell loss rate and bucket size than the Leaky Bucket algorithm.

• Journal of Korea Multimedia Society
• /
• v.8 no.2
• /
• pp.192-200
• /
• 2005

In this paper, an improved User Parameter Control (UPC) algorithm is proposed for controlling traffic in ATM networks. The present algorithm consists of Cell Buffer, Red Token Pool, Green Token Pool, and Spacer. A token is generated at a certain time period, and the tokens are consumed one each time a cell arrives. At this time, if the delay element, named Spacer, is empty, the cell comes into the network. On the other hand, if Spacer is not empty, the cell cannot come into the network. In addition, in the case that tokens do not exist in Token Pool, the corresponding cell is thrown away The arbitrary function of the token used in this paper is removed. Instead, the token is used only to control network traffic. This research proposes new UPC Algorithm to improve the current cell delay rate and cell loss rate by dynamically adopting the delay element, named Spacer, with respect to the traffic condition, which is different from controlling that the cell comes into the network after a certain delay time period.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12C
• /
• pp.181-189
• /
• 2001

In this thesis, a policing algorithm is proposed, which is one of the traffic management function in ATM networks. The proposed algorithm minimizes CLR(Cell Loss patio) of high priority cells and solves burstiness problem of the traffic caused by multiplexing and demultiplexing process. The proposed algorithm has been implemented with VHDL and is divided into three parts, which are an input module, an UPC module, and an output module. In implementation of the UPC module\`s memory access, memory address is assigned according to VCI\`s LSB(Lowest Significant Byte) of ATM header for convenience. And the error of VSA operation from counter\`s wrap-around can be recovered by the proposed method. ANAM library 0.25 $\mu\textrm{m}$ and design compiler of Synopsys are used for synthesis of the algorithm and Synopsys VSS tool is used for VHDL simulation of it

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.12B
• /
• pp.2003-2015
• /
• 2000

본 논문에서는 ATM 망을 구성하고 있는 노드(node) 간의 셀(cell) 전송시에 출력 링크(output link)로 전송된 셀이 수신 노드에서 수행하는 UPC/NPC에 의해 손실되지 않는 트래픽 정형화기(shaper)를 제안한다. 제안한 정형화기는 비실시간 가변비트율(nrt-VBR) 트래픽을 대상으로 한 것으로 각 ATM 연결(connection)에 대해 독립된 큐(queue)를 할당하였으며, 출력 링크로 전송할 셀을 저장하고 있는 큐를 선정하기 위해 모든 큐에 대해 Generic Cell Rate Algorithm(GCRA)를 수행하여 큐의 상태를 결정하고, 그 결과 전송 가능 상태에 있는 모든 큐들을 대상으로 본 논문에서 제안한 시간의존 확률적 스케줄링(time-dependent probability scheduling) 알고리즘을 적용하여 특정 큐를 선택하여 셀을 전송한다. 제안한 정형화기의 성능평가를 위해 WRR(Weighted Round Robin) 스케줄링 알고리즘을 사용한 정형화기 및 WFQ(Weighted Fair Queueing) 스케줄링 알고리즘을 적용한 정형화기에 대한 모의실험을 하였으며, 그 결과 제안한 정형화기는 비실시간 가변비트율(nrt-VBR) 트래픽의 정형화(shaping)에 우수한 성능을 나타냄을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1296-1304
• /
• 1999

In this paper, we propose an enhanced usage parameter control algorithm, which is one of the preventive traffic control method in ATM networks. Proposed algorithm is based on the cell loss priority bit in the ATM cell header. This algorithm can eliminate the measurement phasing problem in cell conformance testing in ATM networks. Proposed algorithm can minimize the cell loss ratio of high priority cell(CLP = 0) and resolve the burstiness of cells which may be introduced in traffic multiplexing and demultiplexing procedure. For the performance evaluation, we simulate the proposed algorithm with discrete time input traffic model, the results show that the performance of proposed algorithm is better than that of ITU-T usage parameter control algorithm.