• 한국경영과학회지
• /
• 제20권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
• /
• 제12권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.

• 한국지능시스템학회논문지
• /
• 제22권1호
• /
• pp.108-113
• /
• 2012

무선 센서 네트워크에서 라우팅 경로는 네트워크 보안 유지를 위해 매우 중요하다. 이러한 라우팅 경로를 유지하기 위해선 지속적인 경로 재설정 및 관리가 요구된다. 영역 분할 기반 경로 설정 기법은 통계적 여과 기법이 적용된 센서 네트워크를 여러 개의 하위 영역으로 나누고 각 영역별로 경로 설정 및 관리하는 방법을 제공한다. 이 기법은 부분적인 네트워크 위상 변화 또는 노드의 에너지 고갈 등의 문제로 인한 경로 재설정 시 사용되는 에너지 소모를 많은 부분 절약할 수 있다. 하지만 경로 설정에 사용되는 정보가 해당 영역에만 제한되어 전체 네트워크 관점에서 항상 최적화된 보안 라우팅 경로를 보장하기 어렵다. 본 논문에서는 통계적 여과 기법 기반 센서 네트워크에서 기존 영역 분할 기반 경로 설정 기법으로 설정된 라우팅 경로 최적화를 위한 영역별 부분 경로 선택 방법을 제안한다. 제안 기법에서는 기지 노드가 영역 단위로 설정된 부분 경로 정보를 수집하여 모든 후보 경로들을 평가 함수를 이용해 평가한다. 평가를 통해 결정된 보안 라우팅 경로 정보는 전체 경로 정보 메시지를 통해 각 영역의 최상위 노드(Super DN)에 전달된다. 따라서 각 영역의 최상위 노드는 해당 경로 정보를 이용해 이벤트 발생 위치에 따른 최적화된 라우팅 경로를 제공할 수 있다. 시뮬레이션을 통해 제안 기법의 성능을 검증하였으며, 제안 기법은 기존 영역 분할 기반 경로 설정 기법의 성능 향상을 위해 유용하게 활용할 수 있을 것으로 기대된다.

• International Journal of Computer Science & Network Security
• /
• 제21권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.

• 정보과학회 논문지
• /
• 제41권12호
• /
• pp.1145-1151
• /
• 2014

본 논문에서는 전술 백본망에서 부하 분산을 위한 다중 경로 지역 최적화 기법을 제안하였다. 제안된 기법은 라우팅 메트릭을 전역 메트릭과 지역 메트릭으로 구분하여 관리한다. 전역 메트릭은 라우팅 프로토콜을 통해 다른 라우터들에게 전파되며 루프 방지가 보장되는 다중 경로 구성에 사용되고, 지역 메트릭은 링크 사용율을 반영하여 링크 과부하 발생시 우회 경로를 탐색하는 용도로 활용되며 각 라우터 내에서만 관리된다. 모의 실험을 통해 다중 경로 지역 최적화 기법 적용시 사용자 트래픽이 효과적으로 가용 링크들을 통해 분산되는 것을 확인하였다.

• 한국통신학회논문지
• /
• 제35권9B호
• /
• pp.1281-1286
• /
• 2010

개미 기반 라우팅 방안은 개미집단 최적화 알고리즘의 한 부류로, 자연에서 서식하는 개미의 행동양식을 라우팅에 적용한 방안이다. 이동 애드혹 네트워크는 토폴로지가 동적으로 변하므로 경로 설정이 지역적 정보에 기반을 둘 필요가 있다. 따라서 이동 애드혹 네트워크에서의 라우팅은 개미집단 최적화의 한 응용분야로 알려져 있다. 본 논문에서는 이동 애드혹 네트워크에 적용한 개미 기반 라우팅 알고리즘인 SIR (swarm intelligence routing)에 경로선택과 링크 장애 시 처리 방법을 개선한 방안인 EPMAR (ant-based routing method using enhanced path maintenance)을 제안하고, 그 성능을 AntHocNet 및 SIR과 비교, 분석하였다. 분석 결과, 제안한 방안이 AntHocNet이나 SIR보다 패킷 전달율은 높고, 치명적 경로 장애가 더 적게 발생함을 입증하였다.

• 디지털산업정보학회논문지
• /
• 제6권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)
• /
• 제8권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
• /
• 제22권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
• /
• 제31권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.