• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.29-37
• /
• 2000

Asynchronous transfer mode is flexible to support multimedia communication services using asynchronous time-sharing and statistical multimedia techniques to the existing data communication area, ATM ABR service controls network traffic using feedback information on the network congestion situation in order to guarantee the demanded service qualities and the available cell rates, In this paper we apply the control method using queue length prediction to the formation of feedback information for more efficient ABR traffic control. If backward node receive the longer delayed feedback information on the impending congestion, the switch can be already congested from the uncontrolled arriving traffic and the fluctuation of queue length can be inefficiently high in the continuing time intervals, The feedback control method proposed in this paper predicts the queue length in the switch using the slope of queue length prediction function and queue length changes in time-series, The predicted congestion information is backward to the node, NLMS and neural network are used as the predictive control functions, and they are compared from performance on the queue length prediction. Simulation results show the efficiency of the proposed method compared to the feedback control method without the prediction, Therefore, we conclude that the efficient congestion and stability of the queue length controls are possible using the prediction scheme that can resolve the problems caused from the longer delays of the feedback information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.5
• /
• pp.675-684
• /
• 1993

In this paper, we analyze a traffic control schemes at the interworking unit(IWU) of the IEEE 802.6 DQDB MAN and the B-ISDN, and estimate its performance via computer simulation. We also study traffic management, relaying sublayers for the cases of four service classes defined in the B-ISDN. As for performance criteria, we consider slot waiting time, slot loss rate, and the fairness between DQDB nodes in access networks. We propose a simple control algorithm that decreases the waitint delay at the OWU. With the buffer size of 40 [slots] at the IWU, we have found that the slot loss rate was nearly zero at traffic load below 0.9, and the slot waiting time became less than 15 slot times.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.8
• /
• pp.1647-1653
• /
• 2004

In a contention-based wireless LAN protocol, maximization of channel utilization and fair bandwidth allocations are main topics to deal with. But it is very difficult to achieve these two goals simultaneously. Many studies have been done to achieve these goals. In this paper we propose a control mechanism to support fair transmissions among traffic classes in IEEE 802.11e Wireless LAN. The proposed algorithm uses short-term and long-term transmission times of each traffic classes to control their $CW_{min}$ for fairness. The proposed algorithm don't need to know the exact number of nodes in the networks to support fairness as other studies do. Furthermore any modifications in AP and mobile hosts are not required.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.125-128
• /
• 2001

Earlier efforts on optical access concentrated on the design of PONs for the collection and distribution portion of the access network. PON architecture is very simple but it requires MAC protocol for control of upstream traffic. This paper proposes a MAC protocol for a broadband access network using an ATM Passive Optical Network supporting CBR/rtVBR, nrtVBR, ABR aild UBR traffic. For the proposed MAC scheme, we present grant field format, minislot format, and bandwidth allocation algorithm.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.5A
• /
• pp.763-772
• /
• 2001

본 논문에서는 ATM망상의 다수의 종단간(End-to-end) 연결에서 망의 구성장치인 교환기들 간의 상호연동성능에 관하여 평가하였다. ATM Forum의 Traffic Management Specification 4.0에서 제시한 스위치 메커니즘 중에는 Binary Feedback 기법과 Explicit Rate Feedback 기법과 Explicit Rate Feedback 기법이 있다. 전자의 경우에는 망으로부터의 궤환정보를 이용하여 종단시스템에서 트래픽 제어가 이루어지나, 후자의 경우에는 스위치로부터의 정보에 의하여 종단시스템의 전송 가능한 트래픽 양이 정해진다. 상이한 방식으로 동작하는 교환기로 구성된 망에서는 그 제어방식의 차이로 동일한 방식을 가지는 교환기들로 구성된 종단간 연결과 비교할 때 망자원의 활용도, 망 제어 측면에서 성능저하를 예상할 수 있다. 이에 본 논문에서는 4가지의 기법에 대하여 각각 망을 구성하고, 구성의 차이에 따른 성능을 비교하고 그 원인을 분석하였다. 상이한 방식들로 구성된 경우 각 구성형태에 따라서 성능 차이가 나타났으며, 폭주가 발생하는 노드의 교환기 동작성능이 전체 망 전송성능을 결정하는 것을 볼 수 있었다.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1788-1796
• /
• 1997

In this paper, we propose a new connection admission control(CAC) algorithm for traffic control in ATM network in which traffic estimation is performed based on user-specified parameters at every moment of connection request or connection release by recursive formula which makes real-time calculation possible. And traffic estimation using cell flow measurement is carried out when the number of connectioned calls does not change during a measurement reflection period. Performance analysis of the proposed method is carried out using several aspects for homogeneous and heterogeneous bursty traffic. The results showed that the proposed CAC method revealed better performance, than conventional CAC method for burst model in both utilization and QoS point of view.

• The Journal of Information Technology
• /
• v.1 no.2
• /
• pp.65-79
• /
• 1998

In this thesis, a buffer alloction and management algorithm is proposed in order to satisfy the QoS of CBR/VBR traffics incomming to ATM networks. Proposed traffic menagement algorithm is based on the route seperation mechanism that allocates buffers acoording to traffic characterics, and sets threshold to allocated buffers. We developed a cell scheduling algorithm and evaluated cell delay and loss probability characteristics according to incomming traffic classes. The cell scheduling algorithm uses buffer size thresholds to control overload traffic flow.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.08a
• /
• pp.33-36
• /
• 2000

ATM 트래픽 제어를 위해서 효과적인 호 수락 제어 방법이 필요하다. 이것은 호 수락 과정에서 서로 다른 종류의 서비스들에 대해서 높은 이용률과 공정성을 제공하여야 한다. 본 논문에서는 호 수락의 공정성과 대역폭 이용률을 높이기 위하여 링크에 문턱 값을 적용한 새로운 CST(Complete Sharing with Threshold)알고리즘을 제안하였으며 부하와 문턱 값의 변화에 따른 성능을 분석하였다.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.783-788
• /
• 2002

Adaptive Cyclic Packet Dropping algorithm (ACPD), and Non-adaptive Cyclic Packet Dropping algorithm (NCPD) are applying stricter drop precedence than that of RIO algorithm. Especially, the ACPD algorithm drops adaptively packets for the congestion control, as predicting traffic pattern between each cycle. Therefore the ACPD algorithm makes up for the drawback of RIO algorithm and minimizes the wastes of the bandwidth being capable of predicting in the NCPD algorithm. And we executed a simulation and analyzed the throughput and packet drop rate based on Sending Priority changing dynamically depending on network traffic. In this algorithm, applying strict drop precedence policy, we get better performance on priority levels. The results show that the proposed algorithms may provide more efficient and stricter drop precedence policy as compared to RIO independent of traffic load. The ACPD algorithm can provide better performance on priority levels and keep stricter drop policy than RIO and the NCPD algorithm.