• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.6A
• /
• pp.1060-1066
• /
• 2001

레이어2 스위칭과 레이어3 라우팅의 통합 모델로써 MPLS(Multi-Protocol Label Switching) 환경에서 ATM LSR(Label-Switching Routers)은 백본망에서의 고속 전송이 가능하여 현재의 라우터 구조로써 제안되어지고 있다. MPLS가 코어 라이터로써 적용이 될 경우 확장성을 위해 label merging이라는 기술이 필요하다. VC(Virtual Circuit) merging은 ATM LSR에서 많은 IP 라우터를 하나의 라벨로 매핑을 시키며 수천 개의 목적지에 전송할 수 있는 확장성 있는 매핑 기술이다. VC merging은 같은 목적지인 다른 패킷들 간의 셀들의 섞임을 방지하기 위해 재 조합 버퍼가 요구된다. 재 조합 버퍼 사용시 일시적인 체증 현상이 발생하며 Non-VC merging과 비교시 많은 셀 손실과 많은 버퍼를 요구하게 된다. 본 논문에서는 RED(Random Early Detection) 알고리즘을 적용하여 VC merging이 필요한 버퍼의 요구량과 셀 손실을 줄였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1537-1540
• /
• 2000

MPLS 는 ATM 과 같은 기존의 레이어 2 계층의 스위칭 기술을 사용하여 IP와 같은 레이어 3 계층기능을 효과적으로 제공하기 위해서 제안되었다. 이러한 MPLS가 코어라우터에 적용될 때 확장성을 제공하기 위한 필수적인 방안으로 VC merging 기능이 요구된다. VC merging 기능은 수신된 ATM 셀들을 VCC 별로 AAL5 프레임 단위로 다중화하고 동일한 목적지를 갖는 ATM 셀에 대해서 동일한 VPI/VCI 값을 갖도록 ATM 셀을 생성한다. 본 논문에서는 최대 1Gbps 데이터를 처리하는 SAR 소자를 사용하여 VC merging 장치를 구현하였다. 그리고 이를 MPLS 망에 적용시키기 위해서 VCC 연결 설정에 제한성을 갖는 SAR 소자에도 적용 가능한 연결 설정 및 해제 절차를 제공하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1629-1632
• /
• 2000

인터넷 트래픽의 폭발적인 증가로 인해 라우터에서 목적지로 포워딩 해야 할 트래픽의 양도 함께 증가하게 되었다. 그와 같은 트래픽들 중에 최근에 급격히 증가하고 있는 음성트래픽의 주를 이루는 것이 바로 인터넷 전화로 발생되는 트래픽들이다. 본 논문에서는 인터넷 전화시 발생하는 음성트래픽의 특성에 대해 살펴보고, 라우터에서 트래픽 폭주시 이를 제어하는 큐잉 방식을 비교분석하고, MNS(MPLS Network Simulation)툴을 이용하여 코어망을 MPLS 네트워크로 구성한 후 UDP 음성트래픽을 생성하여 각 라우터(LSR: Label Switch Router)의 버퍼에서 요구되어지는 폭주제어기법들에 대해 시뮬레이션을 하여 그것을 통해 얻은 결과를 바탕으로 실제 인터넷 전화 시스템의 통화품질에 적절하게 대처할 수 있는 큐잉 기법을 고찰한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1107-1114
• /
• 2004

System Packet Interface Level 4 Phase 2(SPI-4.2) is an interface for packet and cell transfer between a physical layer(PHY) device and a link layer device, for aggregate bandwidths of OC-192 ATM and Packet Over Sonet/SDH(POS), as well as 10Gbps Ethernet applications. SPI-4.2 core consists of Tx and Rx modules and supports full duplex communication. Tx module of SPI-4.2 core writes 64-bit data word and 14-bit header information from the user interface into asynchronous FIFO and transmits DDR(Double Data Rate) data over PL4 interface. Rx module of SPI-4.2 core operates in vice versa. Tx and Rx modules of SPI-4.2 core are designed to support maximum 256-channel and control the bandwidth allocation by configuring the calendar memory. Automatic DIP4 and DIP-2 parity generation and checking are implemented within the designed core. The designed core uses Xilinx ISE 5.li tool and is described in VHDL Language and is simulated by Model_SIM 5.6a. The designed core operates at 720Mbps data rate per line, which provides an aggregate bandwidth of 11.52Gbps. SPI-4.2 interface core is suited for line cards in gigabit/terabit routers, and optical cross-connect switches, and SONET/SDH-based transmission systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.235-245
• /
• 2005

In this paper, a simplified QoS model of MPLS-based backbone network. Conventional scheme proposed by IETF(IETF schem) is to embed a DiffServ model in MPLS network. However, this approach results in overall upgrade of MPLS system and so it is difficult to deploy this approach. Our proposed model, however, uses a Vidual Link which is a set of Label Switched Path(LSP) connected from an Ingress Label Edge Router(LER) to an Egress LER. In this model, Per-Hop-Behavior(PHB) is implemented only at each LSP in ingress LER and Core Label Switch Routers(LSRs) just guarantee each LSP's bandwidth, not service. This bandwidth guarantee service is fully provided by legacy MPLS model. Also we propose flow allocation mechanism and the flow distribution among LSPs of the virtual link by the flow according to the network status. To evaluate the simplified approach, the characteristics of the approach are compared logically with these of IETF's one through simulations.

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.358-367
• /
• 2002

The IETF Differentiated Services (Diffserv) WG focused on Providing service differentiation on the Internet. One problem of the Diffserv Assured Services (AS) architecture is that it cannot guarantee fairness and throughput assurance. In this paper, we propose two schemes for guaranteeing fairness among the various target rates in the AS architecture. One is a variant of RED with IN and OUT (RIO), called the improved RIO (IRIO). The other is a variant of Time Sliding Window (TSW), called the improved TSW (ITSW). To validate the Proposed schemes, their behaviors are then examined under various simulation environments. The simulation results showed that IRIO and ITSW improved fairness and the throughput assurance in the AS architecture.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.2
• /
• pp.234-243
• /
• 2000

We design a modified network architecture with condsidering current Internet network model and traffic characteristics, and propose EDCBT(Enhanced Dispersed Core-based Tree) multicast routing protocol, which enhances scalabity, reliability, end-to-end delay and resource utilization EDBCT adopts bidirectional dispersed shared trees and manages both of intradomain and interdomain multicast trees for a multicast group. Each regional multicast tree is estabilshed from its core router and they are interconnected by the operation between border routers on edges of each regional network. As a result, interdomain multicast tree can be easily established. We introduce a new concept named RBTS(Region-based Tree Switching), which dramatically enhances QoS and network utilization. Finally, protocol performance and the effect of core router location are evaluated with MIL3 OPNet network simulator, in terms of end-to-end delay, packet loss and throughput.

• Journal of KIISE:Information Networking
• /
• v.29 no.6
• /
• pp.722-737
• /
• 2002

As the number of multimedia applications increases, various protocols and architectures have been proposed to provide QoS(Quality of Service) guarantees in the Internet. Most of these techniques, though, bear inherent contradiction between the scalability and the capability of providing QoS guarantees. In this paper, we propose a protocol, named DQSP(Dynamic QoS Support Protocol), which provides the dynamic resource allocation and admission control for QoS guarantees in a scalable way. In DQSP, the core routers only maintain the per source-edge router resource allocation state information. Each of the source-edge routers maintains the usage information for the resources allocated to itself on each of the network links. Based on this information, the source edge routers perform admission control for the incoming flows. For the resource reservation and admission control, DQSP does not incur per flow signaling at the core network, and the amount of state information at the core routers depends on the scale of the topology instead of the number of user flows. Simulation results show that DQSP achieves efficient resource utilization without incurring the number of user flow related scalability problems as with IntServ, which is one of the representative architectures providing end-to-end QoS guarantees.

• Journal of Korea Game Society
• /
• v.4 no.4
• /
• pp.3-9
• /
• 2004

Expansion of internet and construction of high speed network which require multimedia services like MMORPG are exceeding the infra-structure. In this work, CBT is analyzed by focusing on the multicast routing protoco and the algorithm which is transformable to Anycast scheme from CBT scheme is suggested to adapt game traffic. Anycast routing scheme is suitable to distribute high density traffic. Simulation model was set per a number of group and group member, which enabled to reflect real environments. Performance evaluation of routing based on the characteristics of end-to-end delay of CBT and Anycast was mainly focused, The result showed that Anycast method was improved up 8.7%, 25.5%, 34.0%, 38.6% and 51.8%, 56.6% comparing with PIM-DM and CBT routing when packet site was 128, 512 and 1K byte respectively. From the simulation, CBT/Anycast routing scheme can be presented as a flexible and solid solution for the MMORPG traffic to improve the delay characteristics of game packets.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.136-144
• /
• 2003

In this paper, we propose a scheme that can control the loss probability of low priority class bursts by dynamically adjusting the assembly threshold of low priority class. The key ideas is that the loss Probability of the longer burst increases as the load increases, thus reduced low priority class burst length decreases the loss priority at high traffic load. To achieve this aim, we first derive the relation among the loss probability, the assembly threshold, and the traffic load. In this paper we derive the relation by curve fitting on the simulation results. The ingress edge routers periodically or by event-driven receives the proper corresponding assembly threshold information from the core routers. This assembly threshold is calculated from the derived relation so that the required loss probability of the low priority class bursts in the network is satisfied. The simulation results show that the proposed scheme performs well to meet the loss probability target as expected.