• Title/Summary/Keyword: Path Selection

Search Result 496, Processing Time 0.03 seconds

Machine Learning Based Neighbor Path Selection Model in a Communication Network

  • Lee, Yong-Jin
    • International journal of advanced smart convergence
    • /
    • v.10 no.1
    • /
    • pp.56-61
    • /
    • 2021
  • Neighbor path selection is to pre-select alternate routes in case geographically correlated failures occur simultaneously on the communication network. Conventional heuristic-based algorithms no longer improve solutions because they cannot sufficiently utilize historical failure information. We present a novel solution model for neighbor path selection by using machine learning technique. Our proposed machine learning neighbor path selection (ML-NPS) model is composed of five modules- random graph generation, data set creation, machine learning modeling, neighbor path prediction, and path information acquisition. It is implemented by Python with Keras on Tensorflow and executed on the tiny computer, Raspberry PI 4B. Performance evaluations via numerical simulation show that the neighbor path communication success probability of our model is better than that of the conventional heuristic by 26% on the average.

A Point-to-Multipoint Routing Path Selection Algorithm for Dynamic Routing Based ATM Network (동적 라우팅기반의 점대다중점 라우팅 경로 선택)

  • 신현순;이상호;이경호;박권철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.8A
    • /
    • pp.581-590
    • /
    • 2003
  • This paper proposes the routing path selection mechanism for source routing-based PtMP (Point-to-Multipoint) call in ATM switching system. Especially, it suggests PtMP routing path selection method that can share the maximum resource prior to the optimal path selection, guarantee the reduction of path calculation time and cycle prevention. The searching for the nearest branch point from destination node to make the maximum share of resource is the purpose of this algorithm. Therefore among neighbor nodes from destination node by back-tracking, this algorithm fixes the node crossing first the node on existing path having the same Call ID as branch node, constructs the optimal PtMP routing path. The optimal node to be selected by back-tracking is selected by the use of Dijkstra algorithm. That is to say, PtMP routing path selection performs the step of cross node selection among neighboring nodes by back-tracking and the step of optimal node selection(optimal path calculation) among neighboring nodes by back-tracking. This technique reduces the process of search of routing information table for path selection and path calculation, also solves the cycle prevention easily during path establishment.

Partial Path Selection Method in Each Subregion for Routing Path Optimization in SEF Based Sensor Networks (통계적 여과 기법 기반 센서 네트워크에서 라우팅 경로 최적화를 위한 영역별 부분 경로 선택 방법)

  • Park, Hyuk;Cho, Tae-Ho
    • 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.

A Bandwidth Adaptive Path Selection Scheme in IEEE 802.16 Relay Networks

  • Lee, Sung-Hee;Ko, Young-Bae
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.3
    • /
    • pp.477-493
    • /
    • 2011
  • The IEEE 802.16 mobile multi-hop relay (MMR) task group 'j' (TGj) has introduced the multi-hop relaying concept in the IEEE 802.16 Wireless MAN, wherein a relay station (RS) is employed to improve network coverage and capacity. Several RSs can be deployed between a base station and mobile stations, and configured to form a tree-like multi-hop topology. In such architecture, we consider the problem of a path selection through which the mobile station in and outside the coverage can communicate with the base station. In this paper, we propose a new path selection algorithm that ensures more efficient distribution of resources such as bandwidth among the relaying nodes for improving the overall performance of the network. Performance of our proposed scheme is compared with the path selection algorithms based on loss rate and the shortest path algorithm. Based on the simulation results using ns-2, we show our proposal significantly improves the performance on throughput, latency and bandwidth consumption.

The Case Study for Path Selection Verification of IGP Routing Protocol (IGP 라우팅 프로토콜의 경로선택 검증을 위한 구현 사례)

  • Kim, No-Whan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.9
    • /
    • pp.197-204
    • /
    • 2014
  • RIP, EIGRP, OSPF are the interior gateway protocol for sending and receiving routing information among routers in AS(Autonomous System). Various path selection methods using the metric in regard to them have been studied recently but there are few examples that the contents learners understand theoretically are verified by the practice. The Best Path is determined by calculating the Cost value based on the relevant topology of each routing protocol. After implementing the virtual network, it is certain that the results tracking and verifying the relevant path selection of each routing protocol are consistent with the Best Path. If methods suggested in this paper are applied properly, the relevant path selection process of routing protocol can be understood systematically. And it is expected that the outstanding results of learning will be able to be achieved.

Gateway Discovery Algorithm Based on Multiple QoS Path Parameters Between Mobile Node and Gateway Node

  • Bouk, Safdar Hussain;Sasase, Iwao;Ahmed, Syed Hassan;Javaid, Nadeem
    • Journal of Communications and Networks
    • /
    • v.14 no.4
    • /
    • pp.434-442
    • /
    • 2012
  • Several gateway selection schemes have been proposed that select gateway nodes based on a single Quality of Service (QoS) path parameter, for instance path availability period, link capacity or end-to-end delay, etc. or on multiple non-QoS parameters, for instance the combination of gateway node speed, residual energy, and number of hops, for Mobile Ad hoc NETworks (MANETs). Each scheme just focuses on the ment of improve only a single network performance, i.e., network throughput, packet delivery ratio, end-to-end delay, or packet drop ratio. However, none of these schemes improves the overall network performance because they focus on a single QoS path parameter or on set of non-QoS parameters. To improve the overall network performance, it is necessary to select a gateway with stable path, a path with themaximum residual load capacity and the minimum latency. In this paper, we propose a gateway selection scheme that considers multiple QoS path parameters such as path availability period, available capacity and latency, to select a potential gateway node. We improve the path availability computation accuracy, we introduce a feedback system to updated path dynamics to the traffic source node and we propose an efficient method to propagate QoS parameters in our scheme. Computer simulations show that our gateway selection scheme improves throughput and packet delivery ratio with less per node energy consumption. It also improves the end-to-end delay compared to single QoS path parameter gateway selection schemes. In addition, we simulate the proposed scheme by considering weighting factors to gateway selection parameters and results show that the weighting factors improve the throughput and end-to-end delay compared to the conventional schemes.

Clock period optimaization by gate sizing and path sensitization (게미트 사이징과 감작 경로를 이용한 클럭 주기 최적화 기법)

  • 김주호
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.1
    • /
    • pp.1-9
    • /
    • 1998
  • In the circuit model that outputs are latched and input vectors are successively applied at inputs, the gate resizing approach to reduce the delay of the critical pathe may not improve the performance. Since the clock period is etermined by delays of both long and short paths in combinational circuits, the performance (clock period) can be optimized by decreasing the delay of the longest path, or increasing the delay of the shortest path. In order to achieve the desired clock period of a circuit, gates lying in sensitizable long and short paths can be selected for resizing. However, the gate selection in path sensitization approach is a difficult problem due to the fact that resizing a gate in shortest path may change the longest sensitizable path and viceversa. For feasible settings of the clock period, new algorithms and corresponding gate selection methods for resizing are proposed in this paper. Our new gate selection methods prevent the delay of the longest path from increasing while resizing a gate in the shortest path and prevent the delay of the shortest path from decreasing while resizing a gate in the longest sensitizable path. As a result, each resizing step is guaranteed not to increase the clock period. Our algorithmsare teted on ISCAS85 benchmark circuits and experimental results show that the clock period can beoptimized efficiently with out gate selection methods.

  • PDF

Edge-Node Deployed Routing Strategies for Load Balancing in Optical Burst Switched Networks

  • Barradas, Alvaro L.;Medeiros, Maria Do Carmo R.
    • 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.

  • PDF

Predicting the rate of inbreeding in populations undergoing four-path selection on genomically enhanced breeding values

  • Togashi, Kenji;Adachi, Kazunori;Kurogi, Kazuhito;Yasumori, Takanori;Watanabe, Toshio;Toda, Shohei;Matsubara, Satoshi;Hirohama, Kiyohide;Takahashi, Tsutomu;Matsuo, Shoichi
    • Animal Bioscience
    • /
    • v.35 no.6
    • /
    • pp.804-813
    • /
    • 2022
  • Objective: A formula is needed that is practical for current livestock breeding methods and that predicts the approximate rate of inbreeding (ΔF) in populations where selection is performed according to four-path programs (sires to breed sons, sires to breed daughters, dams to breed sons, and dams to breed daughters). The formula widely used to predict inbreeding neglects selection, we need to develop a new formula that can be applied with or without selection. Methods: The core of the prediction is to incorporate the long-tern genetic influence of the selected parents in four-selection paths executed as sires to breed sons, sires to breed daughters, dams to breed sons, and dams to breed daughters. The rate of inbreeding was computed as the magnitude that is proportional to the sum of squared long-term genetic contributions of the parents of four-selection paths to the selected offspring. Results: We developed a formula to predict the rate of inbreeding in populations undergoing four-path selection on genomically enhanced breeding values and with discrete generations. The new formula can be applied with or without selection. Neglecting the effects of selection led to underestimation of the rate of inbreeding by 40% to 45%. Conclusion: The formula we developed here would be highly useful as a practical method for predicting the approximate rate of inbreeding (ΔF) in populations where selection is performed according to four-path programs.

A Path Fragment Management Structure for Fast Projection Candidate Selection of the Path Prediction Algorithm (경로 예측 알고리즘의 빠른 투영 후보 선택을 위한 경로 단편 관리 구조)

  • Jeong, Dongwon;Lee, Sukhoon;Baik, Doo-Kwon
    • Journal of KIISE
    • /
    • v.42 no.2
    • /
    • pp.145-154
    • /
    • 2015
  • This paper proposes an enhanced projection candidate selection algorithm to improve the performance of the existing path prediction algorithm. Various user path prediction algorithms have previously been developed, but those algorithms are inappropriate for a real-time and close user path prediction environment. To resolve this issue, a new prediction algorithm has been proposed, but several problems still remain. In particular, this algorithm should be enhanced to provide much faster processing performance. The major cause of the high processing time of the previous path prediction algorithm is the high time complexity of its projection candidate selection. Therefore, this paper proposes a new path fragment management structure and an improved projection candidate selection algorithm to improve the processing speed of the existing projection candidate selection algorithm. This paper also shows the effectiveness of the algorithm herein proposed through a comparative performance evaluation.