• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.35-54
• /
• 1995

Routing in ATM network is set up by combination of both virtual path routing and virtual channel routing. While virtual channel is similar concept to virtual circuit of data networks, virtual path is a special concept which is not used in traditional data networks. Virtual path can rearrange in structure and size by simply changing virtual path routing tables and giving the network the capability to eash allocate network resources according to the demand needs. This paper provides reconfiguration models of virtual path network which give the bandwidth of link and the routing path for each traffic class. The reconfiguration models are network optimization problems of multicommodity network flow type. The numerical examples are also included.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.12 no.1
• /
• pp.596-604
• /
• 2020

Previous studies on pipe auto-routing algorithms generally used such algorithms as A*, Dijkstra, Genetic Algorithm, Particle Swarm Optimization, and Ant Colony Optimization, to satisfy the relevant constraints of its own field and improve the output quality. On the other hand, this study aimed to significantly improve path-finding speed by applying the Jump Point Search (JPS) algorithm, which requires lower search cost than the abovementioned algorithms, for pipe routing. The existing JPS, however, is limited to two-dimensional spaces and can only find the shortest path. Thus, it requires several improvements to be applied to pipe routing. Pipe routing is performed in a three-dimensional space, and the path of piping must be parallel to the axis to minimize its interference with other facilities. In addition, the number of elbows must be reduced to the maximum from an economic perspective, and preferred spaces in the path must also be included. The existing JPS was improved for the pipe routing problem such that it can consider the above-mentioned problem. The fast path-finding speed of the proposed algorithm was verified by comparing it with the conventional A* algorithm in terms of resolution.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.1
• /
• pp.108-113
• /
• 2012

Routing paths are mightily important for the network security in WSNs. To maintain such routing paths, sustained path re-selection and path management are needed. Region segmentation based path selection method (RSPSM) provides a path selection method that a sensor network is divided into several subregions, so that the regional path selection and path management are available. Therefore, RSPSM can reduce energy consumption when the path re-selection process is executed. However, it is hard to guarantee optimized secure routing path at all times since the information using the path re-selection process is limited in scope. In this paper, we propose partial path selection method in each subregion using preselected partial paths made by RSPSM for routing path optimization in SEF based sensor networks. In the proposed method, the base station collects the information of the all partial paths from every subregion and then, evaluates all the candidates that can be the optimized routing path for each node using a evaluation function. After the evaluation process is done, the result is sent to each super DN using the global routing path information (GPI) message. Thus, each super DN provides the optimized secure routing paths using the GPI. We show the effectiveness of the proposed method via the simulation results. We expect that our method can be useful for the improvement of RSPSM.

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.342-352
• /
• 2021

Multicast Routings is a big challenge due to limitations such as node power and bandwidth Mobile Ad-hoc Network (MANET). The path to be chosen from the source to the destination node requires protocols. Multicast protocols support group-oriented operations in a bandwidth-efficient way. While several protocols for multi-cast MANETs have been evolved, security remains a challenging problem. Consequently, MANET is required for high quality of service measures (QoS) such infrastructure and application to be identified. The goal of a MANETs QoS-aware protocol is to discover more optimal pathways between the network source/destination nodes and hence the QoS demands. It works by employing the optimization method to pick the route path with the emphasis on several QoS metrics. In this paper safe routing is guaranteed using the Secured Multicast Routing offered in MANET by utilizing the Ant Colony Optimization (ACO) technique to integrate the QOS-conscious route setup into the route selection. This implies that only the data transmission may select the way to meet the QoS limitations from source to destination. Furthermore, the track reliability is considered when selecting the best path between the source and destination nodes. For the optimization of the best path and its performance, the optimized algorithm called the micro artificial bee colony approach is chosen about the probabilistic ant routing technique.

• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1145-1151
• /
• 2014

In this paper, we propose MPLO(Multi-Path routing with Local Optimization) for load balancing in the tactical backbone network. The MPLO manages global metric and local metric separately. The global metric is propagated to other routers via a routing protocol and is used for configuring loop-free multi-path. The local metric reflecting link utilization is used to find an alternate path when congestion occurs. We verified MPLO could effectively distribute user traffic among available routers by simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1281-1286
• /
• 2010

Ant-based routing methods belong to a class of ant colony optimization algorithms which apply the behavior of ants in nature to routing mechanism. Since the topology of mobile ad-hoc network(MANET) changes dynamically, it is needed to establish paths based on the local information. Subsequently, it is known that routing in MANET is one of applications of ant colony optimization. In this paper, we propose a routing method, namely EPMAR, which enhances SIR in terms of route selection method and the process upon link failure. The performance of the proposed method is compared with those of AntHocNet and SIR. Based on he analysis, it is proved that the proposed method provided higher packet delivery ratio and less critical link failure than AntHocNet and SIR.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.3
• /
• pp.59-68
• /
• 2010

In the paper, we proposed the Using Correspondent Information for Route Optimization on PMIPv6 over Inter-MAG. Proxy Mobile IPv6 has the problem that a mobile node sends data packets through inefficient routing paths when communicating other mobile node. Route optimization schemes are proposed to solve the triangle routing problem that creates the shortest routing path by leaving the inefficient routing paths. We proposed Correspondent Information Route Optimization scheme to reduce signaling cost as compared with other route optimization scheme. We can reduce signaling cost of route optimization through the Correspondent Information message on basic PMIPv6 and hand-off environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4451-4466
• /
• 2014

We present joint radio selection and relay scheme that delivers data from a source to a sink in heterogeneous stationary sensor networks consisting of various radio interfaces. The proposed scheme finds the optimal relay nodes and their corresponding radio interfaces that minimize energy consumption throughout the network while satisfying the end-to-end packet deadline requirement. We formulate the problem of routing through radio interface selection into binary integer programs, and obtain the optimal solution by solving with an optimization solver. We examine a trade-off relationship between energy consumption and packet delay based on network level simulations. We show that given the end-to-end deadline requirement, our routing algorithm finds the most energy-efficient routing path and radio interface across mesh hops. We demonstrate that the proposed routing scheme exploits the given packet delivery time to turn into network benefit of reducing energy consumption compared to routing based on single radio interface.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.131-138
• /
• 2022

A Mobile Ad-hoc Network (MANET) is a collection of moving nodes that communicate and collaborate without relying on a pre-existing infrastructure. In this type of network, nodes can freely move in any direction. Routing in this sort of network has always been problematic because of the mobility of nodes. Most existing protocols use simple routing algorithms and criteria, while another important criterion is path selection. The existing protocols should be optimized to resolve these deficiencies. 'Particle Swarm Optimization (PSO)' is an influenced method as it resembles the social behavior of a flock of birds. Genetic algorithms (GA) are search algorithms that use natural selection and genetic principles. This paper applies these optimization models to the OLSR routing protocol and compares their performances across different metrics and varying node sizes. The experimental analysis shows that the Genetic Algorithm is better compared to PSO. The comparison was carried out with the help of the simulation tool NS2, NAM (Network Animator), and xgraph, which was used to create the graphs from the trace files.

• ETRI Journal
• /
• v.31 no.1
• /
• pp.31-41
• /
• 2009

Optical burst switching is a promising switching paradigm for the next IP-over-optical network backbones. However, its burst loss performance is greatly affected by burst contention. Several methods have been proposed to address this problem, some of them requiring the network to be flooded by frequent state dissemination signaling messages. In this work, we present a traffic engineering approach for path selection with the objective of minimizing contention using only topological information. The main idea is to balance the traffic across the network to reduce congestion without incurring link state dissemination protocol penalties. We propose and evaluate two path selection strategies that clearly outperform shortest path routing. The proposed path selection strategies can be used in combination with other contention resolution methods to achieve higher levels of performance and support the network reaching stability when it is pushed under stringent working conditions. Results show that the network connectivity is an important parameter to consider.