• Journal of Communications and Networks
• /
• v.8 no.2
• /
• pp.228-233
• /
• 2006

Survivability is a very important requirement for the deployment of broadband networks because out of service links can affect volumes of traffic even if it is a very short time. And the data paths of broadband networks, which are critical for traffic engineering, are always necessary to be well protected. The procedure of protection or restoration for a path is initiated when failure is detected within the working path. In order to minimize the influence on transmission quality caused by the failure of links and to provide a definite time for the recovery from the failure, the protection switching time (PST) should be carefully considered in the path arrangement. Several researches have been devoted to construct the protection and restoration schemes of data paths over dense wavelength division multiplexing (DWDM) networks, however, there was rare research on the design of data paths with guaranteed protection switching time. In this paper, the PST-guaranteed scheme, which is based on the concept of short leap shared protection (SLSP), for the arrangement of data paths in DWDM networks is proposed. The proposed scheme provides an efficient procedure to determine a just-enough PST-guaranteed backup paths for a working path. In addition to selecting the PST-guaranteed path, the network cost is also considered in a heuristic manner. The experimental results demonstrate that the paths arranged by the proposed scheme can fully meet the desired PST and the required cost of the selected path is competitive with which of the shared path scheme.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.9
• /
• pp.1202-1208
• /
• 1995

Inter-processor communication is required to manage resources in ATM switching system where processors are distributed. ATM switching system, which was developed in our institute, does't have dedicated communication path for inter-processor communication, but use the ordinary switching network same as user data. Therefore, we should test communication paths and equipments before running various application software programs. In this paper, we propose a method to test communication paths between processors in ATM switching system and describe an implemented program using this method.

• 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.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.29 no.2
• /
• pp.356-366
• /
• 2005

The purpose of this study was to examine a path analysis of perceived service quality, store image, alternative store attraction, consumer satisfaction and switching barrier perception on store loyalty in apparel product purchasing. The questionnaire was administered to 450 women shopped in a department store in Gwang-ju during September, 12-26, 2002. Data collected from 384 women were analyzed by using frequency, multiple regression analysis, path analysis by SPSS for WIN program. The results were as follows ; First, the switching barrier perception, consumer satisfaction, perceived service quality, store image significantly influenced store loyalty. Second, the consumer satisfaction, perceived service quality, store image, alternative store's attraction significantly influenced switching barrier perception. Third, the perceived service quality, store image, alternative store's attraction significantly influenced consumer satisfaction. Fourth, the perceived service quality, store image, alternative store's attraction had indirect effects on store loyalty mediated by consumer satisfaction and switching barrier perception. The consumer satisfaction had indirect effects on store loyalty mediated by switching barrier perception. In short, perceived service quality, store image, alternative store's attraction influenced on store loyalty mediated by consumer satisfaction and switching perception.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.772-776
• /
• 2004

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

• Journal of Korean Society of Steel Construction
• /
• v.21 no.6
• /
• pp.563-574
• /
• 2009

This paper briefly describes the fundamental strategies--path-tracing, pin-pointing, and path-switching--in the computational elastic bifurcation theory of geometrically non-linear single-load-parameter conservative elastic spatial structures. The stability points in the non-linear elasticity may be classified into limit points and bifurcation points. For the limit points, the path tracing scheme that successively computes the regular equilibrium points on the equilibrium path, and the pinpointing scheme that precisely locates the singular equilibrium points were sufficient for the computational stability analysis. For the bifurcation points, however, a specific procedure for path-switching was also necessary to detect the branching paths to be traced in the post-buckling region. After the introduction, a general theory of elastic stability based on the energy concept was given. Then path tracing, an indirect method of detecting multiple bifurcation points, and path switching strategies were described. Next, some numerical examples of bifurcation analysis were carried out for a trussed stardome, and a pin-supported plane circular arch was described. Finally, concluding remarks were given.

• Structural Engineering and Mechanics
• /
• v.11 no.2
• /
• pp.199-210
• /
• 2001

Axially compressed circular cylinders repeat symmetry-breaking bifurcation in the postbuckling region. There exist stable equilibria with all symmetry broken in the buckled configuration, and the minimum postbuckling strength is attained at the deep bottom of closely spaced equilibrium branches. The load level corresponding to such postbuckling stable solutions is usually much lower than the initial buckling load and may serve as a strength limit in shell stability design. The primary concern in the present paper is to compute these possible postbuckling stable solutions at the deep bottom of the postbuckling region. Two computational approaches are used for this purpose. One is the application of individual procedures in computational bifurcation theory. Path-tracing, pinpointing bifurcation points and (local) branch-switching are all applied to follow carefully the postbuckling branches with the decreasing load in order to attain the target at the bottom of the postbuckling region. The buckled shell configuration loses its symmetry stepwise after each (local) branch-switching procedure. The other is to introduce the idea of path jumping (namely, generalized global branch-switching) with static imperfection. The static response of the cylinder under two-parameter loading is computed to enable a direct access to postbuckling equilibria from the prebuckling state. In the numerical example of an elastic perfect circular cylinder, stable postbuckling solutions are computed in these two approaches. It is demonstrated that a direct path jump from the undeformed state to postbuckling stable equilibria is possible for an appropriate choice of static perturbations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3511-3532
• /
• 2019

Coverage-guided fuzzing is an efficient solution that has been widely used in software testing. By guiding fuzzers through the coverage information, seeds that generate new paths will be retained to continually increase the coverage. However, we observed that most samples follow the same few high-frequency paths. The seeds that exercise a high-frequency path are saved for the subsequent mutation process until the user terminates the test process, which directly affects the efficiency with which the low-frequency paths are tested. In this paper, we propose a fuzzing solution, ER-Fuzz, that truncates the recording of a high-frequency path to influence coverage. It utilizes a deep learning-based classifier to locate the high and low-frequency path transfer points; then, it instruments at the transfer position to promote the probability low-frequency transfer paths while eliminating subsequent variations of the high-frequency path seeds. We implemented a prototype of ER-Fuzz based on the popular fuzzer AFL and evaluated it on several applications. The experimental results show that ER-Fuzz improves the coverage of the original AFL method to different degrees. In terms of the number of crash discoveries, in the best case, ER-Fuzz found 115% more unique crashes than did AFL. In total, seven new bugs were found and new CVEs were assigned.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1965-1970
• /
• 2011

This paper proposes the method of switching function implementation using switching function extraction based on graph over finite fields. After we deduce the matrix equation from path number of directional graph, we propose the switching function circuit algorithm, also we propose the code assignment algorithm for nodes which is satisfied the directional graph characteristics with designed circuits. We can implement more optimal switching function compare with former algorithm, also we can design the switching function circuit which have any natural number path through the proposed switching function circuit implementation algorithms. Also the proposed switching function implementation using graph theory over finite fields have decrement number of input-output, circuit construction simplification, increment arithmetic speed and decrement cost etc.

• The Journal of Korea Robotics Society
• /
• v.15 no.2
• /
• pp.147-159
• /
• 2020

Over the last years, a number of different path following methods for the autonomous parking system have been proposed for tracking planned paths. However, it is difficult to find a study comparing path following methods for a short path length with large curvature such as a parking path. In this paper, we conduct a comparative study of the path following methods for perpendicular parking. By using Monte-Carlo simulation, we determine the optimal parameters of each controller and analyze the performance of the path following. In addition, we consider the path following error occurred at the switching point where forward and reverse paths are switched. To address this error, we conduct the comparative study of the path following methods with the one thousand switching points generated by the Monte-Carlo method. The performance of each controller is analyzed using the V-rep simulator. With the simulation results, this paper provides a deep discussion about the effectiveness and limitations of each algorithm.