• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.154-156
• /
• 2001

최근 호스트의 이동성을 IP 네트워크상에서 지원하는 연구가 이루어지고 있으며, 현재 Mobile IP가 이러한 연구의 기본으로 사용되고 있다. 그러나 mobile IF는 유니캐스트에 대한 지원을 기본으로 하기 때문에, 본 논문에서는 Mobile IP에 멀티캐스트까지 지원하는 프로토콜을 제시하고자 한다. 여기서 모든 전송은 GMR(group Management router)를 통해 이루어지며. GMR은 모바잎 호스트가 위치하는 멀티캐스트 트리상의 라우터들 중에서 각 멀티캐스트 그룹의 세션을 관리하기 위해 선택된다. GMR을 통만 멀티캐스트 전송은 triangle 문제를 해결하고 가장 최적의 경로로 전송이 이루어진다. 다른 모바일 멀티캐스트 프로토콜인 Bi-directional Tunneling과 MoM보다 네트워크상에 적은 수의 메지가 전송되기 때문에 더 나은 성능을 가짐을 보여준다.

• Electronics and Telecommunications Trends
• /
• v.15 no.5 s.65
• /
• pp.41-48
• /
• 2000

MPLS(Multiprotocol Label Switching)를 이용한 IP 기반의 VPN은 고수익을 원하는 서비스제공자들과 저비용을 원하는 기업들에게 인트라넷(intranet)과 익스트라넷(extranet)의 해결책으로서 많은 관심을 끌고 있다. MPLS VPN에 대한 표준화는 IETF에서 추진되고 있는데, BGP multiprotocol extension(BGP-E)이라는 프로토콜을 이용하는 구조와 Virtual Router(VR)라는 개념을 이용하는 구조가 제안되었다. BGP-E 방식은 시스코에 의해 제안되어 RFC2547로 채택되었다. 이 방식에서는 BGP-E를 이용하여 도달성과 멤버쉽 정보를 PE간에 교환한다. VR 방식은 노텔과 루슨트를 중심으로 여러 기업들이 지지하고 있고 드래프트 형태로 작업중이다. 이 방식에서는 PE들에 VPN별로 VR들을 배치하고 같은 VPN에 속하는 VR들끼리 기존의 라우팅 프로토콜을 이용하여 라우팅 정보를 교환한다. 두 방식의 근본적 차이는 도달성과 멤버쉽 메커니즘의 분리 여부이다. 세계적으로 이름 있는 통신 회사들이 경쟁적으로 MPLS 시스템을 개발하고 있는 상황에서 MPLS VPN 기술도 빠르게 시장에 확산될 것으로 전망된다. 그러나 서로 다른 기술적 접근을 하고 있는 서비스제공자들간의 MPLS VPN에 대한 호환성은 시급히 풀어야 할 숙제로 남아 있다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.29-36
• /
• 2007

IP paging strategy, one of the solutions for derived problems in IP mobility support protocol, reduces the messages and the overheads over the network, since there is not registration procedure when a mobile terminal moves into a new router within the same paging area. However, the fact that the mobile terminals with the previous strategy consume electrical power continuously for paging signal reception obstructs the application of IP paging strategy to the IP-based wireless sensor networks. In this paper, we propose a discontinuous paging reception strategy based on the characteristics of the wireless sensor networks and their mobile terminals. As a result of the mathematical analysis, the proposed strategy significantly reduces the terminals' power consumption. In addition, by setting the relating parameters as appropriate values, the proposed strategy can be switched to the continuous reception strategy, or can be adjusted to limit the terminals' power consumption or paging delay.

• ETRI Journal
• /
• v.24 no.4
• /
• pp.311-322
• /
• 2002

Presently, optical burst switching (OBS) technology is under study as a promising solution for the backbone of the optical Internet in the near future because OBS eliminates the optical buffer problem at the switching node with the help of no optical/electro/optical conversion and guarantees class of service without any buffering. To implement the OBS network, there are a lot of challenging issues to be solved. The edge router, burst offset time management, and burst assembly mechanism are critical issues. In addition, the core router needs data burst and control header packet scheduling, a protection and restoration mechanism, and a contention resolution scheme. In this paper, we focus on the burst assembly mechanism. We present a novel data burst generation algorithm that uses hysteresis characteristics in the queueing model for the ingress edge node in optical burst switching networks. Simulation with Poisson and self-similar traffic models shows that this algorithm adaptively changes the data burst size according to the offered load and offers high average data burst utilization with a lower timer operation. It also reduces the possibility of a continuous blocking problem in the bandwidth reservation request, limits the maximum queueing delay, and minimizes the required burst size by lifting up data burst utilization for bursty input IP traffic.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1997.03a
• /
• pp.163-181
• /
• 1997

This dissertation provides a theroetic study on the network security in general , the firewall in particular . In fact, the firewall has been recognized as a very promising option to obtain the security in the real world network environment . The dissertation provides a thorough theoretic investigation on the various problems raised in the computer network, and also explores a methodology of the security against IP spoofing. Moreover, it investigates a systematic procedure to make analysis plans of the firewall configuration. Based on the above investigation and analysis , this dissertation provides two approaches to network security, which address a number of issues both at the network and at application level. At the network level. a new methdo is proposed which uses packet filtering based on the analysis of the counter plot about the screen router. On the other hand at the application level, a novel method is exlored which employs security software , Firewall-1, on Bastion host. To demonstrate the feasibility and the effectiveness of the proposed methodologes, a prototype implementation is made. The experiment result shows that the screen router employing the proposesed anti-IP spoofing method at the network level is effective enough for the system to remain secure without being invaded by any illegarl packets entering from external hackers. Meanwhile , at the application level. the proposed software approach employing Firewall -1 is proved to be robust enough to provent hackings from the outer point to point protocol connection. Theoretically, it is not possible to provide complete secuirty to the network system, because the network security involove a number of issues raised from low level network equipments form high level network protocol. The result in this dissertation provides a very promising solution to network security due to its high efficiency of the implementation and superb protectiveness from a variety of hacking.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.324-333
• /
• 2001

The Differentiated Services (Diffserv) framework has been proposed by the IETF as a simple service structure that can provide different Quality of Service (QoS) to different classes of packets in IP networks. IP packets are classified into one of a limited number of service classes, and are marked in the packet header for easy classification and differentiated treatments when transferred within a Diffserv domain. The Diffserv framework defines simple and efficient QoS differentiation mechanisms for the Internet. However, the original Diffserv concept does not provide a complete QoS management framework. Since traffic flows in IP networks are unidirectional from one network point to the other and routing paths and traffic demand get dynamically altered, it is important to monitor end-to-end traffic status, as well as traffic status in a single node. This paper suggests a distributed QoS monitoring method that collects the statistical data of each service class in every Diffserv router and calculates edge-to-edge QoS of the aggregated IP flows by combining routing topology and traffic status. A format modeling of edge-to-edge Diffserv flows and algorithms for aggregating edge-to-edge QoS is presented. Also an SNMP-based QoS management prototype system for Diffserv networks is presented, which validates our QoS management framework and demonstrates useful service management functionality.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.1
• /
• pp.88-97
• /
• 2000

We have proposed and analysed a novel Lookup Algorithm which had a short switching speed and tiny memory size for IP router. This algorithm could simply be implemeted by a hardware with SRAM because of simple structure. This Lookup scheme needs 1${\sim}$3 memory access times. When we simulated with 40,000 routing record obtained from IPMA Website, the maximum memory size of this algorithm was 316KB(the offset threshold for compression algorithm was 8). When we simulated by HDL using ALTERA EPM7256 series and 100MHz clock and SRAM of 10ns access time, the total lookup time was 45ns for two memory access, 175ns for three memory access.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.167-172
• /
• 2004

Although Mobile IP proposed in IETF is effective. it has inefficiency in case mobile hosts communicate with each others while they are roaming frequently in a specific area. It occurs lots of latency because mobile hosts must be registered and establish an secure path under the internet emvironments and transmitting data on the path. Additionally this inefficiency is more aggravated in case mobile hosts has high mobility. Thus this paper propose a method using Anchor foreign agent by Anchor chain method which combine an pointer forwarding and a cache method plus a border router as a way to complement the above problem which exists in an mobility management in a specific area.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.21 no.6
• /
• pp.826-841
• /
• 2018

The military satellite communication of ROK military, ANASIS is designed for analog data such as voice and streaming data. ANASIS cannot fully support ALL-IP communications due to its long propagation delay. The next generation satellite communication system is being designed to overcome the limitation. Next generation satellite communications system considers both high-speed and low-speed networks to support various operating environment. The low-speed satellite supports both broadband and narrow-band communication. This network works as the infrastructure for of wide-area internetworking over multiple AS's in the terrestrial network. It requires minimum satellite frequency and minimum power and works without PEP and router. In this paper, we propose a network operation structure to enable the inter-operation between high and low-speed satellite networks. In addition, we propose a data link protocol for low speed satellite networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.65-71
• /
• 2005

The primary function of the Internet routers is to forward incoming packets toward their final destinations. IP address lookup is one of the most important functions in evaluating router performance since IP address lookup should be performed in wire-speed for the hundred-millions of incoming packets per second. With CIDR, the IP prefixes of routing table have arbitrary lengths, and hence address lookup by exact match is no longer valid. As a result, when packets arrive, routers compare the destination IP addresses of input packets with all prefixes in its routing table and determine the most specific entry among matching entries, and this is called the longest prefix matching. In this paper, based on parallel multiple hashing and prefix grouping, we have proposed a hardware architecture which performs an address lookup with a single memory access.