• The KIPS Transactions:PartC
• /
• v.12C no.7 s.103
• /
• pp.1031-1038
• /
• 2005

As the research on home network technologies, sensor network technologies, and ubiquitous network technologies makes rapid progresses, wireless ad-hoc network have attracted a lot of attention. A wireless ad-hoc network is a temporary network formed by a collection of wireless mobile nodes without the aid of my existing network infrastructure or centralized administration, and it is suitable for ubiquitous computing environments. In this paper, we suggest an interconnection scheme between the wireless ad-hoc network environment based on multiple path source routing protocol and a Mobile-IP based network environment. This scheme reduces the overhead of route re-establishment and re-registration by maintaining multiple paths between the mobile host in wireless ad-hoc network and the base station in mobile-IP network. Also it puts the base station in charge of function that performs translation between wireless ad-hoc network packets and Mobile-IP packets, reducing the load of mobile hosts. In this paper, our simulations show that our scheme outperforms existing interconnecting schemes with regards to throughput and end-to-end delay Also we show that our scheme outperforms multi-paths approach using disjoint routes with regards to routing overhead.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.410-417
• /
• 2002

We consider the constraint based explicit routing problem in MPLS based IP Network. In this problem, we are given a set of traffic demands and a network with different link capacities. The problem is to assign the demand commodities to the paths in the network while minimizing the maximum link load ratio. We formulate this problem as an integer programming problem and propose an efficient column generation technique. To strengthen the formulation, we consider some valid inequalities. We also incorporate the column generation technique with variable fixing scheme Computational results show that the algorithm gives high quality solutions in a short execution time.

• Journal of Communications and Networks
• /
• v.5 no.1
• /
• pp.55-64
• /
• 2003

Mobile IP has several inefficiencies, and was not originally designed for situations where both peers are highly mobile. We present a mobility management solution that retains compatibility with existing Internet protocols, whilst increasing the efficiency of communications between two GPRS mobile hosts. Our proposal eradicates triangle routing and minimizes handover latency. We show by numerical analysis that the routing optimization improves the performance of TCP controlled data flows, reducing buffering requirements and minimizing the recovery time after a handover occurs.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11b
• /
• pp.790-793
• /
• 2003

라우터의 IP 주소검색은 라우터에 도착한 IP 패킷의 목적지 주소를 이용하여 적절한 출력링크를 검색하고 결정하는 것으로 고속 IP 주소검색은 초고속 라우터 개발에 필수적인 부분이다. 본 논문은 일반 PC에서도 고속의 라우팅 검색이 가능 하도록 2-단계 트라이를 이용하는 트라이 기반의 IP 주소검색 자료구조를 소개한다. 2-단계 트라이는 최소 크기의 포워딩 데이블을 구축, 접근속도가 빠른 캐시 메모리에 저장함으로써 고속의 검색이 지원된다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.283-285
• /
• 2000

현재의 인터넷은 IPv4를 기반으로 하며, CIDR(Classless InterDomain Routing)을 이용하여 IP의 고갈을 막으려고 노력하고 있다. 그러나, 이는 근본적인 대책이 아니기 EOans에 IP는 점차 고갈되어 미래에는 IPv6로 옮겨갈 것으로 보인다. 이렇게 IPv6로 발전함에 따라 IP 주소는 매우 늘어날 수 있으나, source 주소와 destination 주소의 헤더가 커짐에 따라 헤더의 IP 주소를 모두 읽어보는 데에 많은 비용(cost)이 들게 된다. 따라서, ISP들은 MPLS(Multiprotocol Label Switching)를 사용하게 될 것이다. 또한, MPLS는 기존의 IP 주소를 이용한 라우팅은 경로를 찾기 위해 필요이상으로 많은 정보를 요구한다고 보고, 레이블 개념을 도입하여 스위칭해주는 역할을 한다. 이렇게 하면 라우팅을 위해 IPv6로 인하여 더욱 길어진 IP 주소를 요구하지 않고 단지 레이블을 붙임으로 속도를 향상시킬 수 있다. 이러한 환경에서의 이동 IP는 COA를 얻게되면 레이블을 붙여서 목적지까지 전달되게 된다. 이렇게 전달되는 이동 IP에서 COA와 레이블을 합쳐서 하나로 보내는 방식으로 이동 IP의 효율을 높일 수 있다.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.169-172
• /
• 2000

IP Switching is a new routing technology proposed to improve the performance of IP routers. Flow classification is one of the key issues in IP Switching. To achieve better performance, flow classification should be matched to the varying IP traffic and an IP switch should make use of its hardware switching resources as fully as possible. This paper proposes an adaptive flow classification algorithm for IP Switching. By dynamically adjusting the values of its control parameters in response to the present usage of the hardware switching resources, this adaptive algorithm can efficiently match the varying IP traffic and thus improve the performance of an IP switch.

• International Journal of Computer Science & Network Security
• /
• v.22 no.10
• /
• pp.137-144
• /
• 2022

Wireless community networks (WCNs) are considered another form of ownership of internet protocol (IP) networks, where community members manage and own every piece of equipment in a decentralized way, and routing for traffic is done in a cooperative manner. However, the current routing protocols for WCNs suffer from stability and scalability issues. In this paper, an enhanced routing protocol is proposed based on the optimized link state routing (OLSR) protocol to meet the standards of efficiency in terms of stability and scalability. The proposed routing protocol is enhanced through two phases: multicasting expansion and multipoint relay (MPR) selection based on an analytical hierarchical process (AHP). The experimental results demonstrate that the proposed routing protocol outperforms the OLSR protocol in terms of network control overhead and packet delivery ratio by 18% and 1% respectively.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.5
• /
• pp.178-185
• /
• 2008

This paper proposes a new handover scheme to minimize handover delay and signaling costs, using the fact that a new packet forwarding path could be same or similar to the old one in Mobile IPv4. In the proposed scheme a foreign agent estimates the correlation between the new and old routing paths by using routing costs after receiving a registration request message from a mobile node. If the new packet forwarding path could be same or similar to the old one, the mobile node can receive packets from its old foreign agent without registering its new location with its home agent or correspondent node. The performance analysis shows that the proposed scheme can efficiently reduce handover delay and signaling costs.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.91-103
• /
• 2012

Network mobility (NEMO) based on mobile IP version 6 has been proposed for networks that move as a whole. Route optimization is one of the most important topics in the field of NEMO. The current NEMO basic support protocol defines only the basic working mode for NEMO, and the route optimization problem is not mentioned. Some optimization schemes have been proposed in recent years, but they have limitations. A new NEMO route optimization scheme-involving a combination of the optimized route cache protocol (ORC) and reverse routing header (RRH) and the use of a quota mechanism for optimized sessions (OwR)-is proposed. This scheme focuses on balanced performance in different aspects. It combines the ORC and RRH schemes, and some improvements are made in the session selection mechanism to avoid blindness during route optimization. Simulation results for OwR show great similarity with those for ORC and RRH. Generally speaking, the OwR's performance is at least as good as that of the RRH, and besides, the OwR scheme is capable of setting up optimal routing for a certain number of sessions, so the performance can be improved and the cost of optimal routing in nested NEMO can be decreased.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.329-329
• /
• 2004