• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2B
• /
• pp.138-143
• /
• 2003

One of the important design issues for IP routers responsible for packet forwarding in computer networks is the route-lookup mechanism. For each incoming packet, IP routing requires that a router performs a longest-prefix-match address lookup in order to determine the next hop that the incoming packet should be forwarded to. In this paper, we present a new scheme which applies the hashing function for IP address lookup. In the proposed scheme, the forwarding table is composed of multiple SRAMs, and each SRAM represents an address lookup table in each prefix. Hashing function is applied in order to find out the matching entries from the address lookup tables in parallel, and the entry with the longest prefix match among them is selected. Simulation using the MAE-WEST router example shows that a large routing table with 37000 entries can be compacted to a forwarding table of 300 Kbytes in the proposed scheme. It is also shown that the proposed scheme achieves one route lookup every 1.93 memory accesses in average.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.4
• /
• pp.370-379
• /
• 2014

Recently, the interest in optical network with multifiber link is continuing to rise since the network traffic has been growing exponentially. However, growing traffic in network leads to increasing the energy consumption of the network equipment. In this paper, we propose a dynamic routing and wavelength assignment (RWA) algorithm based on V-like cost function and layered graph to improve energy efficiency in IP over WDM network with multifiber link. The V-like cost function is used to decide the fiber cost according to the number of used wavelengths. The layered graph with multifiber link is used to select the energy efficient route and wavelength. The proposed RWA algorithm is compared and analyzed with conventional algorithm in view of average power consumption and blocking probability through OPNET modeler.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.71-76
• /
• 2003

Internet traffic is getting tremendously heavier due to the exponential growth of the Internet users, the spread of the E-commerce and the network games. High-speed routers for fast packet forwarding are commercially available to satisfy the growing bandwidth. A high-speed router, which has the decentralized multiprocessing architecture for IP and routing functions, consists of host processors, line interfaces and switch fabrics. In this paper, we propose a software architecture tuned for high-speed non-forwarding packet manipulation. IPCMP (Inter-Processor Communication Message Protocol), which is a mechanism for IPC (Inter-Processor Communication), is also proposed and implemented as well. Proposed IPC mechanism results in faster packet-processing rate by 10% as compared to the conventional IPC mechanism using UDP/IP.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.875-882
• /
• 2002

The active packets unlike traditional IP packets should be executed at each active node along their path. To execute the active program at each active node, the active packets for an active program should go through the same active nodes and all packets are delivered without any loss. This paper presents the new active engine for every active packet which execute an active program to be routed through the same intermediate active nodes and to be delivered reliably. Proposed active engine requires fewer changes to existing IP protocols and guarantees the reliable delivery of the active packets. Moreover, even if the sender does not have any information about the intermediate nodes every active packet is routed through the same intermediate active nodes. The simulation results show that proposed active engine achieves an efficient transmission with high data delivery and low communication overhead compared with the other existing transmission protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.403-418
• /
• 2009

IP version 6 (IPv6) is a new If addressing scheme that has 128-bit address space. IPv6 is proposed to solve the address space problem of IP version 4 (IPv4) which has 32-bit address space. For a given IPv6 routing set, if a forwarding table is built using a trio structure, the trio has a lot more levels than that for IPv4. Hence, for IPv6 address lookup, the binary search on trio levels would be more appropriate and give better search performance than linear search on trio levels. This paper proposes a new IPv6 address lookup algorithm performing binary search on trio levels. The proposed algorithm uses a Bloom filter in pre-filtering levels which do not have matching nodes, and hence it reduces the number of off-chip memory accesses. Simulation has been performed using actual IPv6 routing sets, and the result shows that an IPv6 address lookup can be performed with 1-3 memory accesses in average for a routing data set with 1096 prefixes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.547-549
• /
• 2001

인터넷의 확산과 All-IP망으로의 망의 진화에 대한 논의가 활발하게 이루어지고 있다. 더불어 IPv6[1]망에서의 이동성 지원을 위하여 IETF(Internet Engineering Task Force)에서 Mobile IPv6를 제안하였다. Mobile IPv6[5]의 기본 발상은 Routing Table의 변경에 의에 다른 링크로 이동한 호스트에게 Packet를 전달할 수 있게 하는 것이다. (Triangle Routing[4]). Mobile IPv6을 구성하는 요소 중 Mobile Node의 기본 구조를 제시했다. Mobile Node 자신의 위치 정보를 갱신하는 Move Detection이 핵심적인 부분이다. 본 논문에서는 이 절차에 대한 보다 실제적인 고찰과 이를 의한 설계를 제시한다.

• Management Science and Financial Engineering
• /
• v.18 no.1
• /
• pp.27-37
• /
• 2012

This paper is motivated by a military cargo-plane routing problem which is a pickup-and-delivery problem in which load splits and node revisits are allowed (PDPLS). Although this recent evolution of a VRP-model enhances the efficiency of routing, a solution method is more of a challenge since the node revisits entail closed walks in modeling vehicle routes. For such a case, even a compact IP-formulation is not available and an effective method had been lacking until Nowak et al. (2008b) proposed a heuristic based on a tabu search. Their method provides very reasonable solu-tions as demonstrated by the experiments not only in their paper (Nowak et al., 2008b) but also in ours. However, the computation time seems intensive especially for the class of problems with dynamic transportation requests, including the military cargo-plane routing problem. This paper proposes a more scalable algorithm hybridizing a tabu search for pricing subproblem paused as a single-vehicle routing problem, with a column generation approach based on Dantzig-Wolfe decomposition. As tested on a wide variety of instances, our algorithm produces, in average, a solution of an equiva-lent quality in 10~20% of the computation time of the previous method.

• Journal of Communications and Networks
• /
• v.15 no.3
• /
• pp.301-311
• /
• 2013

This paper proposes a policy-based quality of service (QoS) management framework for adaptive routing decisions. We present an approach considering interior gateway protocol (IGP) for path discovery mechanisms and QoS-aware policies for configuring the network elements. The integration of the aforementioned modules into this policy-based network management (PBNM) system is demonstrated by conducting experiments in a real environment, the hellenic public administration network SYZEFXIS. These experiments combine different traffic conditioning mechanisms through event detectors, consider IP service level agreement mechanisms that interoperate with the PBNM system and analyze the enforcement of IGP and QoS policies. Finally, validation and measurement tools are used to prove the efficiency of this framework. It is shown that this architecture offers significantly increased performance and learning capabilities, while the PBNM system achieves adaptive QoS routing through automated configuration considering the avoidance of suboptimal routing issues or under-performance conditions of the network entities.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.448-450
• /
• 2004

오버레이 멀티캐스트는 응용 계층에서의 멀티캐스트를 구현함으로써, IP 멀티캐스트 도입에 따른 문제점을 극복하기 위한 새로운 멀티캐스트 방식이다. IP 멀티캐스트와 같이 오버레이 멀티캐스트도 데이터의 전송을 위한 트리 구성이 필요하며, 좀 더 효율적이고 QoS를 지원할 수 있는 트리 구성에 대해 많은 연구가 진행되고 있다. 본 논문은 오버레이 멀티캐스트 상에서 경로 설정에 소요되는 시간을 최소화하고. QoS를 보장받기 위한 경로 설정 기법을 제시하고자 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.652-654
• /
• 2004

Ad Hoc On-Demand Routing Protocol(AODV)이 ad hoc 네트워크에 알맞게 잘 설계되었지만, 인터넷과의 통신에는 그렇지 못하다. 인터넷과 ad hoc 네트워크의 통합에 몇 가지 해결책이 제안되었다. 그러나 그 제안들은 몇 가지 결점을 가지고 있다. 그에 따라 우리는 중복 제어 패킷을 처리하는 동안의 제어패킷 오버헤드와 전원 소모를 줄인 동적 에이전트 광고를 제안하였으며 패킷 전송에 대한 오버헤드를 기존의 해결책과 비교하였다.