• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.158-166
• /
• 2004

Address lookup is one of the most essential functions of the Internet routers and a very important feature in evaluating router performance. Due to the facts that the Internet traffic keeps growing and the number of routing table entries is continuously growing, efficient address-lookup mechanism is indispensable. In recent years, various fast address-lookup schemes have been proposed, but most of those schemes are not practical in terms of the memory size required for routing table and the complexity required in table update In this paper, we have proposed a parallel IP address lookup architecture based on multiple hashing. The proposed scheme has advantages in required memory size, the number of memory accesses, and table update. We have evaluated the performance of the proposed scheme through simulation using data from MAE-WEST router. The simulation result shows that the proposed scheme requires a single memory access for the address lookup of each route when 203kbytes of memory and a few-hundred-entry TCAM are used.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.544-550
• /
• 2006

Next-generation wireless/mobile networks are envisioned to have an IP-based infrastructure. One of the research challenges for next-generation all IP-based networks is the design of intelligent mobility management technologies that have a seamless mobility and minimal signaling overhead. Recently, HMIPv6 was proposed by the IETF for efficient mobility management. HMIPv6 reduces the amount of signaling and improves the performance of MIPv6 in terms of handover latency. However the MAP can be a single point of performance bottleneck when there are a lot of local movements. HMIPv6 can cause signaling overhead due to the unnecessary location update of idle mobile nodes. Therefore, in this paper, we propose the dynamic paging Mobile IPv6 that reduces the signaling cost of the unnecessary location updates using IP paging and organizes dynamically optimal MAP area according to user's mobility and traffic. We show performance results that are obtained from the average total location update cost and packet delivery cost.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.6
• /
• pp.90-97
• /
• 2012

In this paper, the new user mobility model which can be utilized to register user's location for interworking with heterogeneous overlay convergent networks under the time-varying radio propagation environment has been proposed. Thus the user mobility model is considered in order to evaluate the behaviors of users in the overlay convergent networks. This Mobile IP user mobility model will be very useful to model the user mobility behaviors and can be used to estimate the signaling traffic and frequency spectrum demands for massive data transfer for the heterogeneous overlay convergent networks.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.5
• /
• pp.103-111
• /
• 2002

Historically, IP-based internets have been able to provide a simple best-effort delivery service to all applications they carry. Best effort treats all packets equally, with no service level, packet loss, and delay. The best-effort style has generally worked fine. But the needs of users have changed. The want to use the new real-time, multimedia, and multicasting applications. Thus, there is a strong need to be able to support a variety of traffic with a variety of quality-of-service requirements, within the TCP/IP architecture. This paper propose a framework that offers QoS in a DS domain using dynamic node setting method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.12
• /
• pp.2166-2172
• /
• 2006

This paper presents a quality-of-service-enabled next generation local area network architecture which can provide efficiently convergence services over the Internet protocol. The basic concept of the architecture is to combine such three principle technologies as programmable switched network quality-of-service resource management and Internet protocol based network convergence. We discuss system entities and technologies development, which constitute the proposed network. The architecture of the network is then described. Implementation of systems verifies the proposed technologies. The network as a next generation local area network can provide quality-of-service-enabled real-time communication services as well as existing data traffic, and the open programmable interface can facilitates to adopt cost-effectively emerging new services or functionalities.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.873-886
• /
• 2003

Lookup Is one of important factors for network traffic on peer-to-peer network. Especially, large amount of network resources are required for lookup process in p2p file sharing system that clients use the dynamic If and they import to p2p network in random. In this paper, we employ efficient lookup mechanism which searches lookup with the combined information of ISP key values and the extracted key values from SHA-1 hashing function for shared contents id. The proposed mechanism efficiently searches files on the network because the mechanism processes P2P lookup with consideration the routing information of ISP. We suggest the adapted simulation environment based upon the famous file sharing system of emule P2P and experiment the proposed system.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2002.11a
• /
• pp.400-406
• /
• 2002

Historically, IP-based internets have been able to provide a simple best-effort delivery service to all applications they carry. Best effort treats all packets equally, with no service level, packet loss, and delay. The best-effort style has generally worked fine. But the needs of users have changed. The want to use the new real-time, multimedia, and multicasting applications. Thus, there is a strong need to be able to support a variety of traffic with a variety of quality-of-service requirements, within the TCP/IP architecture. This paper propose a framework that offers QoS in a DS domain using dynamic node setting method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.822-825
• /
• 2007

현재 인터넷 아키텍처가 가지고 있는 가장 큰 문제는 routing과 addressing의 핵심으로 사용되는 IP 주소의 의미의 중복 (overloading semantics)이다. 즉 IP 주소는 라우팅을 위한 정보 (how), 단말의 위치 정보 (where), 그리고 이 외에 전송 계층 상위에서 사용되는 단말의 식별자 정보(who)로 사용되며, 이 의미 중복은 결국 global routing의 scalability문제를 발생시키게 된다. 즉 이러한 IP 주소의 의미 중복을 분리한다면 멀티호밍, Traffic engineering, 그리고 renumbering 등을 scalability에 영향을 주지 않고 이것들을 지원할 수 있게 되는 것이다. IETF는 이러한 라우팅과 어드레싱의 확장성 문제를 해결하기 위하여 68차 IETF 회의에서 ROAP (ROuing and Addressing Problem) BoF (Birds of a Feather) 회의를 공식적으로 개최 하였으며, 이를 통해 결정된 사항은 새로운 인터넷 아키텍처를 설계하기 위해 식별자(Identifier)와 위치정보(locator)를 분리하는 구조(ID/Loc 분리) 또는 다중 계층의 위치정보 획득이 가능한 구조(Multi-level locator design)로의 새로운 아키텍처를 만드는 것이다. 이 작업은 ROPA BoF회의 이후 IRTF의 RRG (Routing Research Group)에서 계속적으로 진행되고 있으며, 현재 관련 많은 솔루션들이 나온 상황이다. 본 논문은 이러한 ROAP에 관한 기본적인 설명과 함께, 문제점 그리고 논의되고 있는 솔루션들의 분류, 목적, 그리고 공통 이슈들에 대한 최근 동향을 설명한다.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.11a
• /
• pp.400-406
• /
• 2002

Historically, IP-based internets have been able to provide a simple best-effort delivery service to all applications they carry. Best effort treats all packets equally, with no service level, packet loss, and delay. The best-effort style has generally worked One. But the needs of users have changed. The want to use the new real-time multimedia, and multicasting applications. Thus, there is a strong need to be able to support a variety of traffic with a variety of quality-or-service requirements, within the TCP/IP architecture. This paper propose a framework that offers QoS in a DS domain using dynamic node setting method.

• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.937-942
• /
• 2003

In this paper, we measured and examined RTT delays and packet losses according to the changes of stationary loads for two typical stream-type traffics, a DV and a MPGE2 on the R＆D Gigabit Network testbed, JGN. As the result of our actual measurements, we realized that the packet size of stationary load have no effects on a DV and a MPGE2 stream on the very high-speed network(50Mbps, IP over ATM). When its bandwidth and stationary load exceeds 95％ of network bandwidth, packet losses appeared and RTT delay increased rapidly. Also we realized that the number and size of Receive ＆ Transmit buffer on the end systems have no effects on packet losses and RTT delays.