• Communications for Statistical Applications and Methods
• /
• v.13 no.3
• /
• pp.577-585
• /
• 2006

This paper presents a method for reliability evaluation of a telecommunication network with variable link-capacities when the simple paths of the network are known. The LP-EM, suggested by Lee and Park (2001), identifies a composite path as a subnetwork and adds only a minimal set of links at each step which gives maximal increase on the maximum capacity flow of the subnetwork. Thereby the LP-EM reduces the possible occurrence of redundant composite paths significantly over other existing methods. Based on the LP-EM, our method further reduces the possible redundancy by identifying such simple paths that could give no increase of maximum capacity flow on the current subnetwork and excluding those simple paths from consideration in the process of constructing composite paths.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.331-337
• /
• 2008

In this paper, we investigate survivability in wavelength division multiplexing (WDM) mesh networks and propose a new algorithm called improved shared-path protection (ISPP) to completely tolerate the double-link failures. Compared with previous algorithms for protecting double-link failures, i.e., shared-path protection (SPP) and shared-link protection (SLP), the advantage of ISPP is to allow primary paths and backup paths to share the mixed wavelength-links based on the proposed new rules in which some primary wavelength-links can be changed to mixed wavelength-links, which can be shared by primary paths and backup paths. In addition, some mixed wavelength-links also can be shared by different backup paths for saving resources. Simulation results show that ISPP algorithm performs better in resource utilization ratio and blocking probability than conventional SPP and SLP algorithms.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.15-22
• /
• 1996

This paper presents the generalized method of the prediction of the LOS propagating characteristics in an urban microcell by using theray tracing technique. Whereas the received power is calculated by the finite number of pths, 4~10, on an urban steet, the RMS delay spread is comuted by using the sufficient rays of convergence. To take into account the infinite number of paths the technique of the numbering scheme of image antennas was presented by using the rectangular pulse. As to this the existing restriction of the finitte number of paths was relaxed. based on the method of extending the number of paths and the canyon model the received power and RMS delay spread are computed and their differences according to the number of paths are compared at the frequencies of both 1GHz and 2GHz, respectively.

• Journal of the Korean Ceramic Society
• /
• v.32 no.8
• /
• pp.957-965
• /
• 1995

The ionic conductivityof NASICON solid electrolytes was simulated by using Monte Carlo Method (MCM) based on a hopping model as functions of temoperature and composition. Two conduction paths were used : jumping from Na1 to Na2 and jumping from Na1 to Na2 and jumping from Na2 to Na2. Vacancy availability factor, V was affected by composition, temperature and the conduction paths. For β"-Alumina, it was known that the minimum of charge correlation factor, fc appears at the composition, p=0.5, but there was not shown the minimum of fc for NASICON. When the NASICON composition, x, approaches 2.5, the curve of In σT vs. 1/T* was shown Arrhenius behavior and also In (VWfc) was a linear function of 1/T*. The results of simulations on the considered conduction paths didn't agree with the experimental results. Thus it will be necessary to include the another Na sites as mid-Na site on the conduction path to obtain the better results.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.25 no.7
• /
• pp.455-461
• /
• 2015

The paper deals with the accuracy comparison between two kinds of ultrasonic paths for flow rate measurement. In the Z-path, two transducers are installed on the opposite sides of each other on a pipe, and the ultrasonic waves generated at one transducer propagate to arrive at the other one only by refraction. In the V-path, two transducers are installed on one side of a pipe, and the ultrasonic waves reflected at the inner wall of the pipe are received. Transit times were confirmed to identify the propagation paths by comparing the theoretically calculated results and measured ones. The flow rate measurements with two kinds of ultrasonic paths appeared very similar. It would be possible to select either of the paths by considering the advantages and disadvantages.

• Journal of the military operations research society of Korea
• /
• v.25 no.1
• /
• pp.29-36
• /
• 1999

In this paper, we are concerned with the K-shortest loopless path problem. The MPS algorithm, recently proposed by Martins et al., finds paths efficiently because it solves the shortest path problem only one time unlike other algorithms. But its computational complexity has not been known yet. We propose a few techniques by which the MPS algorithm can be implemented efficiently. First, we use min-heap data structure for the storage of candidate paths in order to reduce searching time for finding minimum distance path. Second, we prevent the eliminated paths from reentering in the list of candidate paths by lower bounding technique. Finally, we choose the source mode as a deviation node, by which selection time for the deviation node is reduced and the performance is improved in spite of the increase of the total number of candidate paths.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2534-2553
• /
• 2018

Source routing is the routing scheme that arranges the whole path from source to target at the origin node that may suit the requirements from the upper layer applications' perspective. The centralized control in SDN (Software-Defined Networking) networks enables the awareness of the global topology at the controller. Therefore, augmented source routing schemes can be designed to achieve various purposes. This paper proposes a source routing scheme that conducts the top-K QoS-aware paths discovery in SDN. First, the novel non-invasive QoS over LLDP scheme is designed to collect QoS information based on LLDP in a piggyback fashion. Then, variations of the KSP (K Shortest Paths) algorithm are derived to find the unconstrained/constrained top-K ranked paths with regard to individual/overall path costs, reflecting the Quality of Service. The experiment results show that the proposed scheme can efficiently collect the QoS information and find the top-K paths. Also, the performance of our scheme is applicable in QoS-sensitive application scenarios compared with previous works.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.3
• /
• pp.123-137
• /
• 1993

In this paper, an integrated approach is proposed to generate gouging-free Cartesian tool paths for machining sculptured surfaces from 3D measurement data. The integrated CAD/CAM system consists of two modules : offset surface module an Carteian tool path module. The offset surface module generates an offset surface of an object from its 3D measurement data, using an offsetting method and a surface fitting method. The offsetting is based on the idea that the envelope of an inversed tool generates an offset surface without self-intersection as the center of the inversed tool moves along on the surface of an object. The surface-fitting is the process of constructing a compact representation to model the surface of an object based on a fairly large number of data points. The resulting offset surtace is a composite Bezier surface without self-intersection. When an appropriate tool-approach direction is selected, the tool path module generates the Cartesian tool paths while the deviation of the tool paths from the surface stays within the user-specified tolerance. The tool path module is a two-step process. The first step adaptively subdivides the offset surface into subpatches until the thickness of each subpatch is small enough to satisfy the user-defined tolerance. The second step generates the Cartesian tool paths by calculating the intersection of the slicing planes and the adaptively subdivided subpatches. This tool path generation approach generates the gouging-free Cartesian CL tool paths, and optimizes the cutter movements by minimizing the number of interpolated points.

• 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 Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.701-712
• /
• 2012

The concept of $k$-shortest disjoint paths is considered important because the establishment of primary and backup forwarding paths exploiting shorter distance and faster propagation time is a dominant consideration for the design of a survivable backbone network. Therefore, we need to evaluate how well the concept of $k$-shortest disjoint paths is exploited for the design of a survivable ship backbone network considering the international standard related to ship backbone networks, the IEC61162-410 standard specifying how to manage redundant message transmissions among ship devices. Performance evaluations are conducted in terms of following objective goals: link capacity, hop and distance of primary and backup paths, even distribution of traffic flows, restoration time of backup forwarding paths, and physical network topology connectivity.