• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.728-735
• /
• 2003

It is a mainly issue that provide mobility smoothly in Mobile IP networks. The IP mobility support being standardized in the IETF utilized tunneling of IP packets from a home agent to foreign agent and utilized reverse tunneling of IP packets from foreign agent to home agent. In this paper, We propose that solve the triangular routing problem in IP mobility and that lessen the messages about IETF routing optimization. Through the Mobile Routing Table on the edge router, agent process the message instead of a end node when handoff occur and that lessen the routing path length by sending directly from FA to to Correspond Node's router. This action lessen the message occurrence frequency and the packet drop. We compare the standard IP, Routing Optimization of Mobile IP, Wu's method and the proposed algorithm. Finally, the simulation results are presented.

• Journal of Korea Multimedia Society
• /
• v.10 no.2
• /
• pp.226-235
• /
• 2007

Recently, the lETF NEMO working group on network mobility is standardizing a basic support for moving networks. We need a handover scheme for achieving the performance of transparency during the movement of mobile routers in nested mobile networks. But existing handover schemes for a mobile host are not suitable for network mobility because the packet transmission delay and traffic increase during mobile router's handover in nested mobile networks. Therefore, we propose a new seamless handover scheme using the bi-casting based on Mobile IPv6 for nested mobile networks in this paper. Compared with the handover schemes using bi-directional edge tunneling for host mobility support on simulation. And, the results show that the proposed handover scheme reduces the packet delay during a mobile router changes the point of attachment in nested mobile networks.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10B
• /
• pp.927-937
• /
• 2003

Network based VPN(Virtual Private Network) using MPLS(Multiprotocol Label Switching) technology is regarded as a good solution for intranets or extranets because of the low cost and the flexibility of the service provision. In this paper, we describea mechanism that allows the VPN users to move from one site to another site of the VPN network based on the BGP-E MPLS technology. This mechanism is designed for and implemented on PE(Provider Edge) routers of the backbone network. PE routers connected to the VPN sites establish a new MPLS path to the mobile node after they detect movement of the mobile VPN node. The new location may belong to the same VPN or to different VPN. We designed VPN management and control functions of the PE routers in order to interface with the Mobile IP protocol. The pilot implementation and performance measurement were carried out on a testbed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10c
• /
• pp.575-580
• /
• 2006

인터넷 네트워크에 존재하는 방화벽(Firewall) 또는 라우터(Router) 장비에서의 패킷 필터 기능은 모든 방화벽 장비의 기본적인 기능이 될 수 있다. 하지만 최근에 등장한 세션기반의 악의적 침입과 바이러스의 출현으로 패킷 필터기는 단순한 정적 패킷 필터 기능이 아닌 상태기반 패킷 필터의 동적 패킷 필터 기능을 요구하게 되었다. 또한 최근에 인터넷 속도가 급증하는 환경변화에 맞추어 방화벽 장비의 TCP 패킷 처리기능은 매우 빠른 처리속도를 요구하고 있다. 이에 우리는 매우 빠른 고속의 TCP 상태기반 패킷 필터 처리를 요구하는 에지(Edge)급 라우터의 방화벽 옵션카드를 만들기 위해 하드웨어 기반의 TCAM(Ternary CAM) 관리를 이용한 TCP 세션 상태기반 (Stateful) 패킷 필터기를 구현하였으며, TCAM 제어와 패킷의 상태기반 검사 등 모든 기능처리는 FPGA(Field Programmable Gate Array)를 이용한 하드웨어 로직(Logic) 및 상태기(State Machine)로 구현하였다. 그리고 본 논문의 구현방식을 적용한 방화벽 옵션카드는 인-라인(In-line) 모드로 구성될 경우 1GHz 이상의 Wire Speed를 만족하는 처리성능을 보여주었다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.5
• /
• pp.27-36
• /
• 2004

In this paper, we propose the ethernet Inter-Processor Communication (IPC) network architecture and 10gigabit ethernet frame multiplex/demultiplexer architecture for the edge switch system based on Linux that has 10 Gigabit Ethernet (10Gigabit Ethernet) port with 72Gbps capacities. we discuss the ethernet IPC with ethernet switch and we propose design and implementation of ethernet Inter-Processor Communication (IPC) network architecture and multiple gigabit ethernet frame rnultiplexing/demultiplexing scheme to handle 10gigabit ethernet frame instead of using 10gigabit network processor. And then ethernet Inter-Processor Communication (IPC) network architecture and 10gigabit ethernet frame MUX/DMUX architecture is designed verified and implemented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.10
• /
• pp.817-823
• /
• 2013

This paper examined the performance of differentiated services applied to each different traffic. For this purpose, we used three traffics which have a different quality of service and generate packets from a specific source to destination. To allocate a proper code point according to QoS, a common policy which is the simple policy model of time sliding window with 3 color marking (TSW3CM) was established to each traffic. To evaluate the performance, we investigate and compare code points to each traffic. Simulation results using NS-2 showed that the code points 10, 11, and 12 can be differently allocated to each traffic according to its sending rates 1Mbps, 2.5Mbps, and 4Mbps.

• Journal of the Korea Society for Simulation
• /
• v.18 no.3
• /
• pp.91-102
• /
• 2009

The average window size is most closely related to average throughput. In order to improve fairness, the proposed dropper tries to control the window size of each flow to equal level by intentional packet drop. Intentional packet drop is performed only to the flows that have been occupied bandwidth in a large amount. Because of intentional packet drop, this flow cut down its transmission rate to a half. Accordingly, somewhat capacity of core link comes into existence. And other flow can use this new capacity of this link. Hence other flows have more throughput than before. In this paper, we propose the TRC (Transmission Rate Control) Dropper improving the fairness between individual flows of aggregated sources on DiffServ network. It has the fairness improvement mechanism mentioned above paragraph.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.613-627
• /
• 2004

In this paper, we propose an Aggregate Fairness Maker (ARM) required for an Edge router to improve fairness of throughput among the flows of Assured Service in DiffServ with different round trip time (RTT) and we propose a user flow Three Color Marker (uf-TCM) as a flow marker that marks packets from the flow as green, yellow, or red. A yellow packet is the packet that consumes loss token in uf-TCM as well as that is demoted green packet in AM due to disobey the aggregate traffic profile. The proposed AFH promotes yellow packet to green packet or demotes green packet to yellow packet through the fair method without per-flow management, and it improves the feirness of throughput among the flows as well as link utilization. A yellow packet and a red packet have the same drop precedence at Core Router in our scheme. So we can use the RIO buffer management scheme. We evaluated the performance of our proposed AFM and the REDP Marker that was proposed to improve fairness without per-flow management. Simulation results show that, compared with the REDP marker, proposed AFM can improve performance of throughput fairness among the flows with different RTT and link utilization under the over-provisioning, exact-provisioning, and under-provisioning network environments at Multiple DiffServ domains as well as at Single DiffServ domain.