• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 1997년도 하계학술대회 논문집 D
• /
• pp.822-824
• /
• 1997

The routing and surveying a transmission line should be done in advance of its construction. It is getting more difficult to construct transmission line day by day, due to the rapid increase of people's demand resulting from the recent change of social environment and people's consciousness. In order to solve these complicated conditions actively and rationally, it is necessary to be more scientific, objective and computerizable for the routing and surveying of a transmission line. New technologies on routing and surveying a 765kV transmission line are remote sensing, Global Positioning System and Optimal PowerLine system. Thanks to these technologies, there will be a contribution to making sure of the best quality and developing technolo91r of transmission line.

• Journal of the Society of Naval Architects of Korea
• /
• 제45권4호
• /
• pp.432-440
• /
• 2008

Korean shipbuilders are starting to use three dimensional solid CAD systems to enhance their competitiveness in design and production. Despite many merits, three dimensional CAD systems reveal some problems in pipe-line modeling. Pipe-line modeling is heavily dependent on point data in routing. However, since the models built by sweeping or skinning operations do not have data about points and lines on the surfaces, the point data for routing are currently manually calculated by considering the diameters of the pipes and alignment conditions with other pipes. This process is inefficient and prone to errors. In order to enhance the pipe modeling, this paper presents an Offset Routing Program for a three dimensional CAD system, which aids designers to easily define the start points and to generate the pipe routings using reference objects.

• Journal of the Institute of Convergence Signal Processing
• /
• 제3권2호
• /
• pp.89-95
• /
• 2002

Global routing is to assign each net to routing regions to accomplish the required interconnections. The most popular algorithms for global routing inlcude maze routing algorithm, line-probe algorithm, shortest path based algorithm, and Steiner tree based algorithm. In this paper we propose weighted network heuristic(WNH) as a minimal Steiner tree search method in a routing graph and a genetic algorithm based on WNH for the global routing. We compare the genetic algorithm(GA) with simulated annealing(SA) by analyzing the results of each implementation.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 한국추진공학회 2017년도 제48회 춘계학술대회논문집
• /
• pp.1112-1114
• /
• 2017

The liquid rocket engine determines the routing of the component placement and layout by adapted the cycle method, the hardware configuration, the gimbal type on the functional implementation, and so on. In this paper, the conceptual routing of major pneumatic lines such as helium (He) supply pneumatic line for driving, many purge pneumatic line and main ignition line based on the main components installed in the liquid rocket engine was performed.

• Water for future
• /
• 제27권1호
• /
• pp.89-99
• /
• 1994

Flood forecasting in Korea has been based on the off-line parameter estimation method. But recent flood forecasting studies explore on-line recursive parameter estimation algorithms. In this study, a simultaneous adaptive estimation of system states and parameters for rainfall-runoff model is investigated for on-line real-time flood forecasting and parameter estimation. The proposed flood routing system is composed of Flood forecasting in Korea has been based on the off-line parameter estimation method. But recent flood forecasting studies explore on-line recursive parameter estimation algorithms. In this study, a simultaneous adaptive estimation of system states and parameters for rainfall-runoff model is investigated for on-line real-time flood forecasting and parameter estimation. The proposed flood routing system is composed of ø-index in the assessment of effective rainfall and the cascade of nonlinear reservoirs accounting for translation effect in flood routing. To combine the flood routing model with a parameter estimation model, system states and parameters are treated with the extended state-space formulation. Generalized least squares and maximum a posterior estimation algorithms are comparatively examined as estimation techniques for the state-space model. The sensitivity analysis is to investigate the identifiability of the parameters. The index of sensitivity used in this study is the covariance matrix of the estimated parameters.-index in the assessment of effective rainfall and the cascade of nonlinear reservoirs accounting for translation effect in flood routing. To combine the flood routing model with a parameter estimation model, system states and parameters are treated with the extended state-space formulation. Generalized least squares and maximum a posterior estimation algorithms are comparatively examined as estimation techniques for the state-space model. The sensitivity analysis is to investigate the identifiability of the parameters. The index of sensitivity used in this study is the covariance matrix of the estimated parameters.

• Journal of the Korea Society of Computer and Information
• /
• 제8권1호
• /
• pp.114-119
• /
• 2003

An efficient QoS routing scheme for improving on-line games services needs to find a path that satisfies a given noS requirements while consuming as few resources as possible. In this paper, we propose a scheme of calculating resources' costs for precomputation QoS routing schemes. For a domain in the networks. the routing scheme first precomputes K multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load. We. therefore, expect that the paths are better than any other paths in respect to reserving the network resources on paths. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme.

• Journal of the Korean Operations Research and Management Science Society
• /
• 제9권2호
• /
• pp.46-55
• /
• 1984

The purpose of this parer is to provide a survey of the state of the art of routing methods in store-and-forward computer networks. The survey is carried out in line with a new taxonomy： heuristic methods, user-optimization methods, and system-optimization methods. This taxonomy on routing algorithms is based on two viewpoints： the level of optimization and the relative difficulty for the implementation in real computer networks. Some actual methods implemented in real computer networks are surveyed as well as the theoretical studies in the literature. This paper concludes with some points in need of further researches.

• Journal of Korea Game Society
• /
• 제2권1호
• /
• pp.30-35
• /
• 2002

The deployment of multicast communication services in the Internet is expected to lead a stable packet transfer even in heavy traffic as in On-Line Game environment. The Core Based Tree scheme among many multicast protocols is the most popular and suggested recently. However, CBT exhibit two major deficiencies such as traffic concentration or poor core placement problem. So, measuring the bottleneck link bandwidth along a path is important for understanding the performance of multicast. We propose not only a definition of CBT's core link state that Steady-State(SS), Normal-State(NS) and Bottleneck State(BS) according to the estimation link speed rate, but also the changeover of multicast routing scheme for traffic overload. In addition, we introduce anycast routing tree, a efficient architecture for construct shard multicast trees.

• Journal of the Korean Operations Research and Management Science Society
• /
• 제22권2호
• /
• pp.79-97
• /
• 1997

Many dispatching rules have been developed for the on-line control of product flow in a job shop. The introduction of a flexible manufacturing system (FMS) has added a new requirement to classical job shop control problem : the selection of machines by parts of different types. An FMS can keep a great deal of information on the status of the system, such as information on what is scheduled in the near future, with great accuracy. For example, the knowledge of the time when the next part will arrive at each machine can be neneficial for the routing. This paper tests the effects of the use of this knowledge for part routing on the parts flow time (sum of the time for waiting and service) under a simple routing procedure- a look-ahead routing procedure. A test under many operating conditions shows that the reduction of part flow time from the cases without using this information is between 1% and 11%, which justifies more study on this routing procedure at real production sites when machine capacity is a critical issue. The test results of this paper are also valid for other highly automated systems such as the semi-conductor fabrication plants for routing when the arrivals of parts in the near future are known.