• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.974-985
• /
• 2016

Riverbed Modeler, which is a commercial packet-level discrete event simulator is used to model, design, and simulate complicated communication protocols and large-scale network. Riverbed Modeler got credit for its reliability in field of network simulation. In the MANET simulation environment using Riverbed Modeler, it is very complicated to add a new routing protocol into existing architecture of routing protocols because it is required lots of modifications of protocol recognition. In this paper, we propose Routing Adding Framework which can reduce errors or mistakes during modifying the existing routing support architecture. Routing Adding Framework is provided as a adapter API for protocol recognition. and it is only minimum modifications for protocol identifiers when a new routing protocol is added to the child process of manet_mgr process which manages routing protocols for IP layer. With Routing Adding Framework, we can reduce less than half modification. Then, we shows an example of implementation of a hybrid routing protocol AntHocNet using Routing Adding Framework, and we verify its design and application of the Routing Adding Framework by obtaining simulation result with similar result given by AntHocNet.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.7
• /
• pp.773-778
• /
• 2014

IDS(Intrusion Detection System) can be used as a countermeasure for blackhole attacks which cause degrade of transmission performance by causing of malicious intrusion to routing function of networks. In this paper, effects of IDS for transmission performance based on mobility patterns is analyzed for MANET(Mobile Ad-hoc Networks), a suggestion for effective countermeasure is considered. Computer simulation based on NS-2 is used in performance analysis, VoIP(Voice over Internet Protocol) as an application service is chosen for performance measure. MOS(Mean Opinion Score), call connection ratio and end-to-end delay is used as performance parameter.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.6
• /
• pp.1187-1193
• /
• 2003

The interest for IPv6, which is next generation IP, increases, while the difficulty for adopting it into IT industries also increases too. We also expect that Internet technologies develop on basis of All-IP networks, which include various heterogeneous networks. Therefore, it is necessary for network to support mobility and multicast capability to create applications with wide-variety. In this paper, we propose a new mobile multicasting protocol called Mobile IPv6 Multicast Protocol(MIMP). The proposed scheme satisfies no packet losses from roaming and optimal routing efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12B
• /
• pp.1063-1069
• /
• 2004

There are some problems with the methods of paging and routing cache(PRC) and quasi soft handoff that are proposed to improve the performance for the transmission of real time data. This paper proposed a reasonable solution of these problems by proposing a new method using a combined cache(CC) and applying a different handoff procedure according to each type of data. The combined cache dose not maintain the handoff state but the idlle/active state. The simulation results in a better performance than the above methods in terms of the control packet traffic load, initial recevied data packet traffic load and arrival tune of real time packet at the epoch of handoff.

• Nuclear Engineering and Technology
• /
• v.54 no.11
• /
• pp.3975-3984
• /
• 2022

Distributed control system architecture is adopted for I&C systems of Prototype Fast Breeder Reactor, where the geographically distributed control systems are connected to centralized servers & display stations via switched Ethernet networks. TCP/IP communication plays a significant role in the successful operations of this architecture. The communication tasks at control nodes are taken care by TCP/IP offload modules; local area switched network is realized using layer-2/3 switches, which are finally connected to network interfaces of centralized servers & display stations. Safety, security, reliability, and fault tolerance of control systems used for safety-related applications of nuclear power plants is ensured by indigenous design and qualification as per guidelines laid down by regulatory authorities. In the case of commercially available components, appropriate suitability analysis is required for getting the operation clearances from regulatory authorities. This paper details the proposed approach for the suitability analysis of TCP/IP communication nodes, including control systems at the field, network switches, and servers/display stations. Development of test platform using commercially available tools and diagnostics software engineered for control nodes/display stations are described. Each TCP link behavior with impaired packets and multiple traffic loads is described, followed by benchmarking of the network switch's routing characteristics and security features.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.178-185
• /
• 2005

NEMO basic support is a solution that provides network mobility in the Internet topology. Yet, when multiple mobile networks are nested, this basic solution suffers ken pinball-routing and a severe routing overhead. Therefore, several solutions for route optimization in a nested mobile network have already been suggested by the IETF NEMO WG. However, the current paper proposes Regional Information-based Route Optimization (RIRO) in which mobile routers maintain a Nested Router List (NRL) to obtain next-hop information, and packets are transmitted with a new routing header called an RIRO Routing Header (RIRO-RH). We showed that RIRO had the minimum packet overhead that remained constant, irrespective of how deep the mobile network was nested, in comparison with two earlier proposed schemes - Reverse Routing Header (RRH) and Bi-directional tunnel between HA and Top-Level mobile router (BHT).

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.5 s.347
• /
• pp.137-146
• /
• 2006

IP address lookup has become a major bottleneck of packet forwarding and a critical issue for high-speed networking techniques in routers. In this paper, we propose an efficient high-speed IP address lookup scheme using adaptive multiple hashing and prefix grouping. According to our analysis results based on routing data distributions, we grouped prefix lengths and selected the number of hash functions in each group adaptively. As a result, we can reduce collisions caused by hashing. Accordingly, a forwarding table of our scheme has good memory efficiency, and thus is organized with the proper number of memory modules. Also, the proposed scheme has the fast building and searching mechanisms to develop the forwarding table only during a single memory access.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.10
• /
• pp.41-48
• /
• 2001

It is necessary to provide the QoS guaranteed end to-end routing services using the internet protocol through the connectionless network based on high speed network. From the above necessities, this paper classified the existing traffic into two type traffics such as real time traffics and non real time traffics and proposes the ATM based IP switching method with traffic type VC merging which allows many routes according to traffic type to be mapped to the same VC label. And this paper suggests the optimum switching architecture through simulation and performance analysis of proposed VC merging output module. From the simulation results, we confirmed the performance of the proposed method better than existing VC merging system under mixed traffic circumstances.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.938-945
• /
• 2004

This paper describes the problems of the existing two multi-layer routing policies(policy 1 and policy 2) and suggests new multi-layer routing policy(policy 3) which is established the packet LSP by inquiry on packet LSP lambda routing tables for GMPLS based optical If Network. All policies of multi-layer routing schemes first try to allocate a newly requested electrical path to an existing optical path that directly connects the source and destination nodes. U such a path is not available, all policies employ different procedures. Policy 1 tries to find available existing optical paths with two or more hops that connect the source and destination nodes and policy 2 tries to establish a new one-hop optical path between source and destination nodes. Policy 3 tries to establish a new one-hop optical path by inquiry on information of the packet LSP lambda routing tables between source and destination nodes. The performances of the three multi-routing policies are evaluated by computer simulation. Simulation results show that policy 3 is the excellent of routing time and traffic acceptance capabilities compare to existing two polices if p is large, where p is the number of packet-switching-capable ports p.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.691-700
• /
• 2006

Based on the destination IP address of incoming packets, the Internet routers determine next hops and forward packets toward final destinations through If address lookup. The bandwidth of communication links increases exponentially fast as well as the routing table size grows significant as the number of single host networks attached to the Internet increases. Since packets should be processed at wire-speed, the increased link speed reduces the processing time of a packet in routers, and hence more efficient and fast IP address lookup algorithms and architectures are required in the next generation routers. Most of the previous IP lookup schemes compare routing prefixes of shorter length first with a given input IP address. Since IP address lookup needs to find the most specific route of the given input, search continues until the longest matched prefix is found while it keeps remembering the current test matching prefix. In this paper, based on binary search on prefix length, we proposed a new IP address lookup algorithm which compares longer prefixes first. The proposed scheme is consisted of multiple tries with prefixes on leaves only. The trie composed of the longest prefixes is primarily searched whether there is a match with the given input. This processing is repeated for the trio of the next longer prefixes until there finds a match. Hence the proposed algorithm provides the fast search speed. The proposed algorithm also provides the incremental update of prefixes while the previous binary search on length scheme does not provide the incremental update because of pre-processing requirement. In this paper, we performed extensive simulations and showed the performance comparisons with related works.