• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8B
• /
• pp.541-548
• /
• 2005

IP lookup and forwarding process becomes the bottleneck of packet transmission as IP traffic increases. Previous hardware-based IP address lookup schemes using an index-based table are not memory-efficient due to sparse distribution of the routing prefixes. In this paper, we propose memory-efficient hardware based IP lookup scheme called set-associative IP address lookup scheme, which provides the same IP lookup speed with much smaller memory requirement. In the proposed scheme, an NHA entry stores the prefix and next hop together. The IP lookup procedure compares a destination IP address with eight entries in a corresponding set simultaneously and finds the longest matched prefix. The memory requirement of the proposed scheme is about $42\%$ of that of Lin's scheme. Thus, the set-associative IP address lookup scheme is a memory-efficient hardware based IP address lookup scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.10C
• /
• pp.980-986
• /
• 2002

In the fast data communication system, synchronized by a clock source, the loss of data will often occur due to several reasons as a differential routing path between data and clock, a differential propagation delay of components or an unstable phase of clock and data by external noise. In this paper, we describe the ASIC implementation of the data compensation circuit which can detect the data loss from above problems and recovery to original data with stable synchronization. Especially it supports a strong stability and a good BER in the communication system for fast data transfer as optic area. This circuit is implemented by Verilog HDL and available to the digital ASIC implementations related to fast data transfer.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.2
• /
• pp.238-240
• /
• 2016

Recently, the improvement in the data communication networks in terms of availability and reliability is emerging as a critical issue. In this context, the high availability and reliability of routers that control data flow and routing path between networks on the data communication network are being recognized as critical problems. Many methods for providing high availability to minimize the loss cost caused by the failure of a router are being studied. This paper proposed a BGP session takeover method using the Docker to support the high availability of the BGP session and to improve the takeover performance.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.45-54
• /
• 2002

MPLS(Multiprotocol Label Switching) is regarded as a core technology for migrating to the next generation Internet. In this paper, we propose an dynamic flow admission control supporting DiffServ(Differentiated Services) to provide QoS in MPLS networks. Our proposed model dynamically adjusts the amount of admissible traffic based on transmittable capacity over one outgoing port. It then transmits the Packets while avoiding congested area resulting traffic loss. Ingress LSRs find out the congested area by collecting network state information at QoS state update for QoS routing table. Our Proposed model manages the resource efficiently by protecting the waste of resources that is a critical Problem of DiffServ and makes much more flows enter the network to be served.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.2
• /
• pp.43-51
• /
• 2017

Recently, MANET has been used in many fields as the range of applications increases. However, the dynamic topology that MANET has makes it difficult to route and provides the cause of exposure to security vulnerabilities. Therefore, the security features that can be robust to many attacks must have been applied in the routing technique provided in the MANET. In this paper, we propose a secure routing method that secure route is established by reliability evaluation of nodes and secure data communication has applied through key exchange mechanism. The proposed technique used hierarchical structure for efficiency of reliability evaluation of nodes. The reliability of nodes is performed by trust management node and reliability of nodes managed periodically is broadcasted. And the key exchange for secure data transmission is dene without CA as the certificate issuing organization. This allows fast key exchange and the integrity of data transmission improved. The proposed technique improves the security of the data transmission because a secure route to the destination node is established by the reliability evaluation and the data transmission is performed after the key between the source node and the destination node is exchanged through the established route.

• The KIPS Transactions:PartC
• /
• v.15C no.1
• /
• pp.51-60
• /
• 2008

Micro-mobility protocols have been developed to reduce the control message overhead due to movements of mobile nodes. With the spread of mobile devices, services using mobile nodes are increasing and multicast services are becoming more important in providing multimedia services. In this paper we propose a new multicast protocol suitable for micro-mobility environments. The proposed protocol is designed to maintain optimal multicast routing paths and continue to provide multicast services without disruption in spite of frequent handoffs due to movements of mobile nodes. We used simulation to evaluate the proposed protocol, compared its performance with existing multicast protocols for mobile environments including bi-directional tunneling, remote subscription, and MMA, and observed that the proposed protocol exhibited better performance in terms of transmission success ratio and overhead on the network.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.160-163
• /
• 2014

IP 네트워크를 통해 전송되는 실시간 스트라밍은 네트워크 상태에 따라 데이터 손실 및 전송 지연의 문제가 발생 할 수 있다. 이에 멀티미디어 네트워킹 애플리케이션은 RTP(Realtime Transport Protocol)와 RTCP(RTP Control Protocol)를 지원하는 RTSP(Realtime Streaming Protocol)를 사용한다. RTSP를 사용하는 송신단은 패킷 손실과 전송지연이 발생할 경우 끊김 없는 멀티미디어 스티리밍을 제공하기 위해 네트워크 상태에 따라 전송률을 변경한다. 하지만 전송률이 낮아지면 멀티미디어 품질이 떨어지게 된다. 만약 짧은 시간 동안 전송률이 빈번하게 변경된다면 일관성 있는 품질의 서비스를 제공하기 어렵다. 본 논문에서는 SDN 환경에서 실시간 스트리밍을 효과적으로 제어하기 위해 중앙 컨트롤러가 RTCP를 수신하고 송신단의 전송률과 현재 링크의 가용 전송율을 추정한다. 추정된 가용 전송율이 송신단의 전송률보다 낮다며 각 스위치의 활성화된 플로우 엔트리가 낮은 스위치로 라우팅 경로를 선택하는 메커니즘을 제안한다.

• The KIPS Transactions:PartC
• /
• v.17C no.2
• /
• pp.153-158
• /
• 2010

Mobile IPv6 is one of method can keep Mobile node's session. To solve legacy Mobile IPv4's triangular routing problem, in Mobile IPv6, Mobile Node could directly communicate with Correspond node by Binding Update. But, attacker could interfere Return Routability Procedure that is Correspond node check Home address and Care of address reachable. At this result, Attacker is able to hijack Session to correspond node from Mobile node. In This paper, We propose new Binding Update scheme for solving that problem. Our approach is that MN gives association both home token and care of token using onewayness of keyed hash fuction. From security and performance analysis, we can see that proposed binding Update Scheme can achieve stronger security than legacy scheme and at the same time requires minimal computational overhead.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1760-1762
• /
• 2010

본 논문에서 3치가산기와 승산기(multiplier)는 전류모드 CMOS에 의해서 구현된다. 첫째, 3치 T-gate를 집적회로 설계의 유효 가용성을 갖고 있는 전류모드 CMOS를 이용하여 구현한다. 둘째, 3치 T-gates를 이용해 회로가 유한체 GF (3)에 대하여 2변수 3치 가산표 (2-variable ternary addition table) 및 구구표 (multiplication table)가 실현되도록 구현한다. 마지막으로, 이러한 동작 회로들은 1.5 CMOS 표준 기술과 $15{\mu}A$ 단위전류(unit current) 및 3.3V 소스 전압 (VDD voltage)에 의해 활성화 된다. 활성화 결과는 만족할 만한 전류 특성을 나타냈다. 전류 모드 CMOS에 의하여 실행되는 3치가산기 및 승산기는 단순하며 와이어 라우팅(wire routing)에 대하여 정규적이고, 또한 셀 배열 (cell array)과 함께 모듈성 (modularity)의 특성을 갖고 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.954-957
• /
• 2007

AODV 에서는 RREQ 메시지 전송을 통해 라우팅 경로를 설정한다. Ad-hoc 네트워크에서 노드가 자주 이동하거나 전송 지연 시간이 클 경우 RREQ 메시지 발생이 증가한다. 이러한 네트워크 변동에 따른 RREQ 메시지 발생 증가는 결과적으로 데이터 패킷 수신율을 저하시킬 뿐만 아니라, 노드의 에너지 소모율도 증가시킨다. 본 논문에서는 네트워크 토폴로지 변동 상황을 감지하여 AODV 에서의 RREQ 메시지 발생 빈도를 효과적으로 조절하는 알고리즘을 제안하였다. 제안된 알고리즘을 50개의 노드가 10m/s 이하의 속도로 무작위로 이동하는 Ad-hoc 네트워크에 적용한 결과, 기존 AODV 알고리즘에 비해 RREQ 메시지 발생 빈도가 25% 감소하였다. 뿐만 아니라 RREP 패킷과 RERR 패킷 역시 각각 26% 및 31%씩 감소하였다. 모든 종류의 메시지 발생 빈도 수가 감소함에 따라 데이터 패킷 수신율은 3% 증가했으며, 에너지 소모율 역시 13% 감소하였다.