• Title/Summary/Keyword: Paths

Search Result 3,539, Processing Time 0.031 seconds

Congestion Aware Fast Link Failure Recovery of SDN Network Based on Source Routing

  • Huang, Liaoruo;Shen, Qingguo;Shao, Wenjuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5200-5222
    • /
    • 2017
  • The separation of control plane and data plane in Software Defined Network (SDN) makes it flexible to control the network behavior, while also causes some inconveniences to the link failure recovery due to the delay between fail point and the controller. To avoid delay and packet loss, pre-defined backup paths are used to reroute the disrupted flows when failure occurs. However, it may introduce large overhead to build and maintain these backup paths and is hard to dynamically construct backup paths according to the network status so as to avoid congestion during rerouting process. In order to realize congestion aware fast link failure recovery, this paper proposes a novel method which installs multi backup paths for every link via source routing and per-hop-tags and spread flows into different paths at fail point to avoid congestion. We carry out experiments and simulations to evaluate the performance of the method and the results demonstrate that our method can achieve congestion aware fast link failure recovery in SDN with a very low overhead.

A Path-level Smooth Transition Method with Curvature Bound between Non-smoothly Connected Paths (매끄럽지 않게 연결된 두 곡선에 대해 제한된 곡률로 부드럽게 연결할 수 있는 천이 궤적 생성 방법)

  • Choi, Yun-Jong;Park, Poo-Gyeon
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.45 no.4
    • /
    • pp.68-78
    • /
    • 2008
  • For a smooth transition between consecutive paths, conventional robot controllers usually generate a transition trajectory by blending consecutive paths in a time coordinate. However, this has two inherent drawbacks: the shape of a transition path cannot be designed coherently and the speed during transition is uncontrollable. To overcome these problems, this paper provides a path-level, rather than trajectory-level, smooth transition method with the curvature bound between non-smoothly connected paths. The experiment results show that the resultant transition trajectory is more smoothly connected than the conventional methods and the curvature is closely limited to the desired bound within the guaranteed level ($0.02{\sim}1$).

Lane Spare Widths Reflecting Vehicles' Rearview Mirror Widths and Lateral Wheel Paths (차량의 후사경 폭과 횡방향 이격거리를 반영한 차로여유폭 산정)

  • Yoo, Hye-Min;Han, Man-Seob;Oh, Heung-Un
    • International Journal of Highway Engineering
    • /
    • v.16 no.1
    • /
    • pp.41-48
    • /
    • 2014
  • PURPOSES : The lane width of the domestic highway is 3.5 ~ 3.6m and it has been designed nationwide. However, the distribution of the average vehicle widths, rearview mirror widths and lateral wheel paths by region appear different. Then, lane spare widths may differ by region followingly. Thus, the flexible design of freeway lane widths is required. METHODS : The methodologies of this paper are as follows. First, vehicle widths rearview mirror widths lateral wheel paths of vehicles driven four national expressways were measured. Second, lane spare widths by vehicle widths were calculated. Third, lane spare widths reflecting rearview mirror widths were calculated by using interval estimation. Additionally, lane spare widths reflecting vehicles lateral wheel paths were calculated. RESULTS : The results of this paper are as follows. First, lane spare widths by vehicle widths ranges 0.83 to 0.95m. Second, lane spare widths reflecting rearview mirror widths ranges 0.518 to 0.747m at the confidence interval 95%. Third, lane spare widths reflecting vehicles' lateral wheel paths ranges -0.022 to 0.322m at the curved sections and the confidence interval 95%. CONCLUSIONS : It may be concluded that the present lane spare widths are relatively narrow at the curved section. Thus, there is a need to consider expanded lane widths at the curved sections. Additionally, there is a need to consider flexible design of lane widths by various conditions.

Modeling wind load paths and sharing in a wood-frame building

  • He, Jing;Pan, Fang;Cai, C.S.
    • Wind and Structures
    • /
    • v.29 no.3
    • /
    • pp.177-194
    • /
    • 2019
  • While establishing adequate load paths in the light-frame wood structures is critical to maintain the overall structural integrity and avoid significant damage under extreme wind events, the understanding of the load paths is limited by the high redundant nature of this building type. The objective of the current study is to evaluate the system effects and investigate the load paths in the wood structures especially the older buildings for a better performance assessment of the existing building stock under high winds, which will provide guidance for building constructions in the future. This is done by developing building models with configurations that are suspicious to induce failure per post damage reconnaissance. The effect of each configuration to the structural integrity is evaluated by the first failure wind speed, amajor indicator beyond the linear to the nonlinear range. A 3D finite-element (FE) building model is adopted as a control case that is modeled using a validated methodology in a highly-detailed fashion where the nonlinearity of connections is explicitly simulated. This model is then altered systematically to analyze the effects of configuration variations in the model such as the gable end sheathing continuity and the gable end truss stiffness, etc. The resolution of the wind loads from scaled wind tunnel tests is also discussed by comparing the effects to wind loads derived from large-scale wind tests.

PathGAN: Local path planning with attentive generative adversarial networks

  • Dooseop Choi;Seung-Jun Han;Kyoung-Wook Min;Jeongdan Choi
    • ETRI Journal
    • /
    • v.44 no.6
    • /
    • pp.1004-1019
    • /
    • 2022
  • For autonomous driving without high-definition maps, we present a model capable of generating multiple plausible paths from egocentric images for autonomous vehicles. Our generative model comprises two neural networks: feature extraction network (FEN) and path generation network (PGN). The FEN extracts meaningful features from an egocentric image, whereas the PGN generates multiple paths from the features, given a driving intention and speed. To ensure that the paths generated are plausible and consistent with the intention, we introduce an attentive discriminator and train it with the PGN under a generative adversarial network framework. Furthermore, we devise an interaction model between the positions in the paths and the intentions hidden in the positions and design a novel PGN architecture that reflects the interaction model for improving the accuracy and diversity of the generated paths. Finally, we introduce ETRIDriving, a dataset for autonomous driving, in which the recorded sensor data are labeled with discrete high-level driving actions, and demonstrate the state-of-the-art performance of the proposed model on ETRIDriving in terms of accuracy and diversity.

CONDITIONAL FIRST VARIATION OVER WIENER PATHS IN ABSTRACT WIENER SPACE

  • CHO, DONG HYUN
    • Journal of the Korean Mathematical Society
    • /
    • v.42 no.5
    • /
    • pp.1031-1056
    • /
    • 2005
  • In this paper, we define the conditional first variation over Wiener paths in abstract Wiener space and investigate its properties. Using these properties, we also investigate relationships among first variation, conditional first variation, Fourier-Feynman transform and conditional Fourier-Feynman transforms of functions in a Banach algebra which is equivalent to the Fresnel class. Finally, we provide another method evaluating the Fourier-Feynman transform for the product of a function in the Banach algebra with n linear factors.

THE DOBRAKOV INTEGRAL OVER PATHS

  • Ryu, Kun Sik
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.19 no.1
    • /
    • pp.61-68
    • /
    • 2006
  • In 2002, the author introduced the definition and its properties of an analogue of Wiener measure over paths. In this article, using these concepts, we will derive an operator-valued measure over paths and will investigate the properties for integral with respect to the measure. Specially, we will prove the Wiener integral formula for our integral and give some example of it.

  • PDF

GENERATING FUNCTIONS FOR PLATEAUS IN MOTZKIN PATHS

  • Drake, Dan;Gantner, Ryan
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.25 no.3
    • /
    • pp.475-489
    • /
    • 2012
  • A plateau in a Motzkin path is a sequence of three steps: an up step, a horizontal step, then a down step. We find three different forms for the bivariate generating function for plateaus in Motzkin paths, then generalize to longer plateaus. We conclude by describing a further generalization: a continued fraction form from which one can easily derive new multivariate generating functions for various kinds of path statistics. Several examples of generating functions are given using this technique.

CONDITIONAL FOURIER-FEYNMAN TRANSFORMS OF VARIATIONS OVER WIENER PATHS IN ABSTRACT WIENER SPACE

  • Cho, Dong-Hyun
    • Journal of the Korean Mathematical Society
    • /
    • v.43 no.5
    • /
    • pp.967-990
    • /
    • 2006
  • In this paper, we evaluate first variations, conditional first variations and conditional Fourier-Feynman transforms of cylinder type functions over Wiener paths in abstract Wiener space and then, investigate relationships among first variation, conditional first variation, Fourier-Feynman transform and conditional Fourier-Feynman transform of those functions. Finally, we derive the conditional Fourier-Feynman transform for the product of cylinder type function which defines the functions in a Banach algebra introduced by Yoo, with n linear factors.

An Ant Colony Optimization Approach for the Two Disjoint Paths Problem with Dual Link Cost Structure

  • Jeong, Ji-Bok;Seo, Yong-Won
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2008.10a
    • /
    • pp.308-311
    • /
    • 2008
  • The ant colony optimization (ACO) is a metaheuristic inspired by the behavior of real ants. Recently, ACO has been widely used to solve the difficult combinatorial optimization problems. In this paper, we propose an ACO algorithm to solve the two disjoint paths problem with dual link cost structure (TDPDCP). We propose a dual pheromone structure and a procedure for solution construction which is appropriate for the TDPDCP. Computational comparisons with the state-of-the-arts algorithms are also provided.

  • PDF