• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1B
• /
• pp.18-26
• /
• 2003

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 Request-Counter MAC protocol for a broadband access network using an ATM Passive Optical Network supporting CBR/rtVBR, nrtVBR, UBR and ABR traffic For the proposed MAC scheme, we present Grant Field format, Minislot format, and bandwidth allocation algorithm From the simulation result, we have confirmed that our proposed scheme can reduce the average cell delay in comparison to that of conventional MAC schemes.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.374-376
• /
• 1998

ABR서비스는 ATM 망의 이용률을 증대시키고, 매우 버스트한 트래픽 응용을 지원하기위해 설계되었다. ATM 포럼에서는 망에서 소스의 셀 전송률을 조절하고 셀 손실을 최소화하기 위한 ABR 서비스 표준으로 폐쇄루프와 전송률기반의 폭주 제어 알고리즘을 채택하였다. 이러한 폭주 제어 알고리즘 중에서 대표적인 것이 ERIVCA(Explicit Rare Indication for Congestion Avoidance) 이다. 본 논문에서는 ERIVCA 의 견고성, 공평성 LAN/WAN 환경에 대해서 성능을 시험하고. 그 결과로 성능을 향상시키기 위해 개선된 최대-최소 구조를 제공한다. 또한 제안된 구조에 대한 시뮬레이션을 하여 기존 ERIVCA 알고리즘의 성능과 비교 분석한다.

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

In this paper, it aims at two different situation such that a preventive control which means, it never has network information in case of occurring congestion in network, and a reactive control which means, after the congestion simply happens. it is not effective to recover with congestion just because of extensive delay for an electric wave. To solve the problems, threshold is set up with buffer in multiplex system, and executes a congestion control by FBLB which is FeedBack Leaky Bucket Algorithm. As suggested by FBLB Algorithm. the outcome of performance could be compared with Buffered Leaky Bucket Algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.6
• /
• pp.516-525
• /
• 1990

This paper proposes a hierarchical control algorithm for an efficient network management of a loosely-coupled system which consists of functional division and duplicating structure with a LAN to enhance reliability and availability. The algorithm is modeled using the Perti-net and verified with the reachability tree. Here, the proposed algorithm is compared with the purely centralized control algorithm and distributed control algorithm in terms of message traffic for the network management. The result shows that the message traffic related to system performance is as low as centralized control algorithm and the system availability is independent of a specific processor failure.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.380-382
• /
• 1998

ABR 은 ATM의 서비스 중에서 가장 최근에 추가된 것으로서 트래픽 소스의 전송률을 제어하기 위해서 피드백 메커니즘을 사용한다. ABR 서비스의 성능은 스위치를 통해서 피드백되는 RM 셀에 의해서 결정적인 영향을 받는다. ATM 표준에는 EPRCA, CAPC, ERICA 등의 알고리즘을 다루고 있다. 하지만 이러한 스위치 알고리즘에 대한 성능평가 및 분석 은 자세히 이루어지지 않고 있다. 본 논문에서는 현재 사용중인 ABR 스위치 알고리즘 중 단순히 큐의 길이에 위해 폭주를 판단하는 EPRCA 방법에 대해서 자세히 분석하고 EPRCA 의 단점을 극복하기 위해서 큐의 길이뿐만 아니라 새로운 변수 즉 평균 분산 및 표준편차을 이용해서 각 송신원의 공정성을 높이고 시스템의 효율성을 증대시키는 방안을 제시한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.58-64
• /
• 2005

The nodes of Ad-hoc network are made up of location registration for sending information and a great number of packet transmissions to maintain routing route among the nodes. under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extend of the traffic in order to control the traffics of the multi-hop in Ad-hoc.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6A
• /
• pp.458-467
• /
• 2009

Long Tenn Evolution (LTE) is the next generation mobile phone technology which has being standardized by the Third Generation Partnership Project (3GPP). In the existing mobile communication networks, voice traffic is delivered through circuit switched networks. In LTE, however, all kinds of traffic are transferred through IP based packet switched networks which has best-effort characteristic. Therefore, providing QoS in LTE system is difficult. In order to provide QoS in LTE, RRM is very important. Especially, in part of RRM, call admission control (CAC) performs an important function to reduce network congestion and guarantee a certain level of QoS for on-going calls. In this paper, we propose a CAC algorithm in order to provide QoS for various kinds of services in LTE system. The performance of the proposed algorithm is evaluated with various simulation environments. The results show that the proposed algorithm provides QoS through rejections of requested calls. Especially, the proposed CAC algorithm can be satisfied with packet delay requirement defined in LTE specification.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.3
• /
• pp.303-308
• /
• 2016

Recently, as the rapid development of network technology and the increase of services required high bandwidth such as multimedia service, the network traffic dramatically increases. This massive increase of network traffic causes some problems such as the degradation of QoS and the lack of network resources and, to solve these problems, various research to guarantee QoS have been performing. Currently, The most representative method to guarantee the QoS is the DiffServ(: Differentiated Service). The DiffServ defines the AF(: Assured Forwarding) PHB(: Per Hop Behavior) and statistically ensures the throughput over the certain level of data rate. However, the TCP congestion control method that make up the majority of the Internet traffic is not fundamentally suitable to the DiffServ that guarantees the throughput without managing the individual flow. Therefore, in this paper, we present this mismatch through the simulation as an example and propose the solution by controlling the TCP of the terminal in the network. The proposed scheme utilizes the information of the reception window size included in the ACK frame and does not require any modification of the TCP algorithms currently in use.

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

현재의 인터넷 라우터는 Drop tail 방식으로 큐 안의 패킷을 관리한다. 따라서 네트워크 트래픽의 지수적인 증가로 인해 발생하는 혼잡 상황을 명시적으로 해결 한 수 없다. 이 문제를 해결하기 위해 IETF (Internet Engineering Task Force)에서는 RED(Random Early Detection)알고리즘과 같은 능동적인 큐 관리 알고리즘(AQM: Active Queue Algorithm)을 제시하였다. 하지만 RED 알고리즘은 네트워크 환경에 따른 매개 변수의 설정의 어려움을 가지고 있어 잘못된 매개변수 설정으로 인하여 네트워크 성능을 저하시키는 문제를 발생시키며 전체 망에 불안정한 혼잡제어를 야기 시킨다. 본 논문에서는 기존의 AQM를 개선한 SOQuM(Stabilized Operation of Queue Management) 알고리즘을 제안하였다. 제안한 알고리즘의 성능을 검증하기 위해 기존의 방법과 시뮬레이션을 이용하여 비교하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.8
• /
• pp.45-53
• /
• 2004

This paper proposes and analyzes a new media access control (MAC) scheduling algorithm, “Interleaved Polling with Deficit Round Robin (IPDRR)” that supports weighted fairness among ONUs in Ethernet Passive Optical Network (PON). The purpose of the proposed IPDRR algerian is not only to eliminate the unused bandwidth of upstream ONU traffic, but also to provide weighted fair sharing of upstream bandwidth among ONUs in Ethernet PON systems. Simulation results show that the IPDRR improves the utilization of upstream channel by removing the unused bandwidth and provides weighted fairness among ONUs, although the IPACT scheduling is unfair according to traffic characteristics.