• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2003.05a
• /
• pp.14-19
• /
• 2003

IPv6에서는 호스트의 주소 재지정 뿐만 아니라 라우터에 대해서도 주소 재지정 메커니즘을 제공한다. IPv6에서는 기존 망 환경 외에도 Mobile-IP나 Ad-hoc 네트워크 상에서 라우터의 주소를 손쉽게 관리할 수 있는 메커니즘이 절대적으로 필요하다. 이러한 방법으로는 RR(Router Renumbering)이나 APDP(Automatic Prefix Delegation Protocol), DHCPv6 등이 있다. 본 논문에서는 라우터 주소 재지정 기법 중에서 APDP 기법을 리눅스 커널 2.4.x 기반 환경에서 구현하였다. 구현된 프로그램은 기존의 radvd와 통합하여 구성하였으며, 리눅스를 이용한 PC-라우터로 테스트베드를 구성하여 동작을 검증하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.6
• /
• pp.1302-1308
• /
• 2005

Propose Cellular-IP/PRC network with united paging and Cellular IP special duality that use roof information administration cache to secure lake acceptance method in wireless Internet environment and QoS in lesser extent cell environment. When speech quality is secured considering increment of interference to receive in case of suppose that proposed acceptance method grooves base radio station capacity of transfer node is plenty, and moat of contiguity cell transfer node was accepted at groove base radio station with a blow, groove base radio station new trench lake acceptance method based on transmission of a message electric power estimate of transfer node be. Do it so that may apply composing PC(Paging Cache) and RC(Routing Cache) that was used to manage paging and router in radio Internet network in integral management and all nodes as one PRC(Paging Router Cache), and add hand off state machine in transfer node so that can manage hand off of transfer node and Roaming state efficiently, and studies so that achieve connection function at node. Analyze benevolent person who influence on telephone traffic in system environment and forecasts each link currency rank and imbalance degree, forecast most close and important lake interception probability and lake falling off probability, GoS(Grade of Service), efficiency of cell capacity in QoS because applies algorithm proposing based on algorithm use gun send-receive electric power that judge by looking downward link whether currency book was limited and accepts or intercept lake and handles and displays QoS performance improvement.

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

Efficient hardware implementation of address lookup is one of the most important design issues of internet routers. Address lookup significantly impacts router performance since routers need to process tens-to-hundred millions of packets per second in real time. In this paper, we propose a practical IP address lookup structure based on the binary tree of prefixes of different lengths. The proposed structure produces multiple balanced trees, and hence it solve the issues due to the unbalanced binary prefix tree of the existing scheme. The proposed structure is implemented using pipelined binary search combined with a small size TCAM. Performance evaluation results show that the proposed architecture requires a 2000-entry TCAM and total 245 kbyte SRAMs to store about 30,000 prefix samples from MAE-WEST router, and an address lookup is achieved by a single memory access. The proposed scheme scales very well with both of large databases and longer addresses as in IPv6.

• 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 the Korea Contents Association
• /
• v.1 no.1
• /
• pp.130-136
• /
• 2001

Real-time applications like VoIP in mobile networks need smooth handovers in order to minimize or eliminate packet loss as a mobile host(MH) transitions between network links. In this paper, we design a new variable buffering mechanism for IPv6 by which an MH can request that the router on its current subnet buffers pad(eta on its behalf while the MH completes registration procedures with the router of a new subnet. Performance results show that our proposed queueing scheme with a variable space allocation is quite appropriate for mobile internet environment in terms of the packet loss rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1100-1105
• /
• 2003

In this paper, we propose a solution, called DQDMR, for generating delay-constrained bandwidth- appropriated multicast routing trees to reduce end-to-end delay and conserved bandwidth resources. At the current router system the router keep the information of link which neighboring node in the routing table to guarantee QoS(Quality of Service). When we construct multicast tree, DQDMR algorithm dynamically adjusts the path in the least delay and appropriate bandwidth. Through simulations comparing to another multicast algorithms, we reach a conclusion that DQDMR algorithm can simply and dynamically adjusts the construction of multicast tree in hight-speed and conserve bandwidth resources.

• Journal of Digital Contents Society
• /
• v.18 no.5
• /
• pp.983-987
• /
• 2017

Multi-homing mobile router separates network for user connection and network for internet access using various interfaces for internet access. This paper proposes a load balancing metric in order that multi-network mobile router distributes its traffic to one of several heterogeneous network interfaces. To evaluate the performance of the load balancing metric, experiments on traffic balancing is performed on real commercial networks were used in Korea and Hong Kong.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.325-338
• /
• 2004

As the recent rapid development of internet technology and the wide spread of multimedia communication, massive increase of network traffic causes some problems such as the lack of network paths and the bad quality of service. To resolve these problems, this paper presents a traffic control agent that can perform the dynamic resource allocation by controlling traffic flows on a DiffServ network. In addition, this paper presents a router that can support DiffServ on Linux to support selective QoS in IP network environment. To implement a method for selective traffic transmission based on priority on a DiffServ router, this paper changes the queuing discipline in Linux, and presents the traffic control agent so that it can efficiently control routers, efficiently allocates network resources according to service requests, and relocate resources in response to state changes of the network. Particularly for the efficient processing of Assured Forwarding(AF) Per Hop Behavior(PHB), this paper proposes an ACWF$^2$Q$^{+}$ packet scheduler on a DiffServ router to enhance the throughput of packet transmission and the fairness of traffic services.s.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.275-278
• /
• 2000

Recently ATM(Asynchronous Transfer Mode) technology is facing challenges from Integrated Service IP(Internet Protocol), IP router, Gigabit Ethernet. Although ATM is approved by ITU-T as the standard technology in B-ISDN, its survival is still in question. In the ATM networks, the Guaranteed Frame Rate(GFR) service has been designed to accommodate non-real-time applications, such as TCP(Transmission Control Protocol)/IP based traffic. The GFR service not only guarantees a minimum throughput at the frame level, but also supports a fairshare of available resources. We have studied different discarding and scheduling schemes, and compared their throughput and fairness when TCP/IP Traffic is carried. Through simulations, we know that only per-VC queueing with weighted Round Robin(WRR) can guarantee Minimum Cell Rate Among all the Schemes that have been experimented, we recommend DT-EPD(Dynamic Threshold-Early Packet Discard) integrated with MCRplus(Minimum Cell Rate) to support the GFR service.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.793-796
• /
• 2013

스마트폰, IPTV(Internet Protocol Television), VoIP(Voice over Internet Protocol) 등의 인터넷을 활용한 서비스의 증가는 IPv4(Internet Protocol Version4)의 주소 부족문제를 야기시켰으며 이를 해결하기 위한 장기적인 해결방안으로는 IPv6(Internet Protocol Version6)가 제시되었고 단기적으로는 NAT(Network Address Translator)가 제안되었다. NAT는 사설 IP 주소를 공인 IP 주소로 활용하여 네트워크에 접속할 수 있도록 지원하며 주소 부족 문제를 해결하고 내부 네트워크를 보호하는 긍정적인 기능도 하지만 역으로 해커들에게 숨은 공간을 제공하는 역할을 하기도 한다. 본 논문에서는 NAT 기능을 활용한 IP 공유기를 통해 내부 보안 프로세스를 우회할 수 있는 단말기를 검출하는 탐색 알고리즘을 분석하고 이를 병렬화하여 정확도를 높일 수 있는 검출 시스템을 연구하고자 한다.