• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.155-162
• /
• 2003

Fast restoration time and service guarantee are the important goals to achieve the network reliability. In the protection switching scheme, one way to guarantee service fro an application session if a network happens to fail is to establish the restoration path that amounts to the same bandwidth of the working path of the session at the same time. When we setup the restoration path, we can reduce the bandwidth consumption by the restoration path if the path can share the bandwidth required by the other paths. This paper explains the methods how to determine the shared bandwidth of the restoration path in the protection switching scheme, given the maximum bandwidth assigned to a link along the working path. We point out that such sharing algorithm can not reduce the bandwidth consumption by the restoration paths in some cases, which contradict the general conception. We explain why this can happen, and show the simulation results in real network topologies to prove our arguments. We explain the reason of the failure of the sharing effect by the simple sharing algorithm. Finally we propose the way of how we can overcome the failure of the sharing effect, using the complete sharing algorithm based on the link database and showing the results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.4
• /
• pp.744-751
• /
• 2006

Even many kinds of Internet-based services have been generated due to the great development of the Internet. PSTN still exists in the center of the national infrastructure network and the transit exchanges will be maintained the core roles in PSTN for many years in the future. These transit exchanges often suffer from unexpected overload situation because they have to process Intelligent Network calls and mobile calls additionally as well as POTS (Plain Old Telephone Service). In this paper, we suggest an efficient overload control algorithm for the distributed transit switching system under the various types of call services. We also show that this algorithm can be implemented easily cooperating with the network management control functions. The simulation technique is used to show that the proposed algorithm effectively controls calls and maintains safely the call processor's load under the various kinds of overload situations.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.11
• /
• pp.611-621
• /
• 2002

For real-time systems, multiprocessor support is indispensable to handle the large number of requests. Existing real-time on-line scheduling algorithms such as Earliest Deadline First Algorithm (EDF) and Least Laxity Algorithm (LLA) may not be suitable for scheduling real-time tasks in multiprocessor systems. Although EDF has low context switching overhead, it suffers from "multiple processor anomalies." LLA has been shown as suboptimal, but has the potential for higher context switching overhead. Earliest Deadline Zero Laxity (EDZL) solved somewhat the problems of those algorithms, however is suboptimal for only two processors. Another algorithm EDA2 shows very good performance in overload phase, however, is not suboptimal for muitiprocessors. We propose two on-line scheduling algorithms, Earliest Deadline/Least Laxity (ED/LL) and ED2/LL. ED/LL is suboptimal for multiprocessors, and has low context switching overhead and low deadline miss rate in normal load phase. However, ED/LL is ineffective when the system is overloaded. To solve this problem, ED2/LL uses ED/LL or EDZL in normal load phase and uses EDA2 in overload phase. Experimental results show that ED2/LL achieves good performance in overload phase as wet] as in normal load phase.oad phase.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1256-1261
• /
• 2005

In this paper, we propose a low-power Booth multiplication which reduces the switching activities of partial products during multiplication process. Radix-4 Booth algorithm has a characteristic that produces the Booth encoded products with zero when input data have sequentially equal values (0 or 1). Therefore, partial products have higher chances of being zero when an input with a smaller effective dynamic range of two multiplication inputs is used as a multiplier data instead of a multiplicand. The proposed multiplier divides a multiplication expression into several multiplication expressions with smaller bits than those of an original input data, and each multiplication is computed independently for the Booth encoding. Finally, the results of each multiplication are added. This means that the proposed multiplier has a higher chance to have zero encoded products so that we can implement a low power multiplier with the smaller switching activity. Implementation results show the proposed multiplier can save maximally about $20\%$ power dissipation than a previous Booth multiplier.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.27 no.1
• /
• pp.54-61
• /
• 2023

With the development of IoT technologies and artificial intelligent, diverse digital image equipments are being used in industrial sites. Because image data can be easily damaged by noise while it's obtained with a camera or a sensor and the damaged image has a bad effect on the process of image processing, noise removal is being demanded as preprocessing. In this thesis, for the restoration of image damaged by the noise of random impulse, a switching filter algorithm based on noise estimation was suggested. With the proposed algorithm, noise estimation and error distraction were carried out according to the similarity of the pixel values in the local mask of the image, and a filter was chosen and switched depending on the ratio of noise existing in the local mask. Simulations were conducted to analyze the noise removal performance of the proposed algorithm, and as a result of magnified image and PSNR comparison, it showed superior performance compared to the existing method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.12
• /
• pp.41-49
• /
• 2004

Increase of internet users and new types of applied traffics, have led to demand for more bandwidth for each application. Hence, the amount of internet traffic has risen sharply and it has demanded to use limited resources, such as wavelength and bandwidth, more effectively. These kind of needs can be satisfied with OXC(Optical cross-connects) based on GMPLS that carry out IP packet switching and wavelength switching at the same time and Provide very wide bandwidth. In RSVP-TE signaling of GMPLS studied by IETF. every lambda router in core network should be able to convert wavelength. So, lots of wavelength converters and needed and building and managing cost is high. Another problem is that optimized traffic is limited. In this paper We suggest strengthened GMPLS RSVP-TE signaling algorithm for a better lightpath setup. When setup signaling is blocked suggested algorithm does not send PathErr message to Edge Router, but looks for nearest lambda router which can convert wavelength and carry out setup signaling from that node. Such algorithm can reduce the chance of blocked lightpath setup signaling and provide effective arrangement of lambda router in core network by calculating proper number of wavelength converter.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.7 no.2
• /
• pp.129-136
• /
• 2002

A single-phase inverter using a diode bridge-type resonant circuit to implement ZVT(Zero Voltage Transition) switching is presented. It Is shown that the ZACE(Zero Average Current Error) algorithm based Polarized ramptime current control can provide a suitable interface between DC link of diode bridge-type resonant circuit and the inverter. The current control algorithm is analyzed about how to design the circuit with auxiliary switch which can ZVT operation for the main power switch. The simulation and experimental results would be shown to verify the proposed current algorithm, because the main Power switch is turn on with ZVT and the hi-directional inverter is operated.

• The KIPS Transactions:PartA
• /
• v.12A no.1 s.91
• /
• pp.1-6
• /
• 2005

This paper presents a new algorithm on low power survivor path memory implementation of the trace-back systolic array Viterbi algorithm. A novel idea is to reuse the already-generated trace-back routes to reduce the number of trace-back operations. And the spurious switching activity of the trace-back unit is reduced by making use of a clock gating method. Using the SYNOPSYS power estimation tool, DesignPower, our experimental result shows the average $40{\%}$ power reduction and $23{\%}$ area increase against the trace-back unit introduced in [1].

• Journal of Power Electronics
• /
• v.10 no.5
• /
• pp.491-497
• /
• 2010

This paper proposes an estimation algorithm for the electrical parameters of synchronous reluctance motors (SynRMs) by using a synchronous PI current regulator at standstill. In reality, the electrical parameters are only measured or estimated in limited conditions without fully considering the effects of the switching devices, connecting wires, and magnetic saturation. As a result, the acquired electrical parameters are different from the real parameters of the motor drive system. In this paper, the effects of switching devices, connecting wires, and the magnetic saturation are considered by simultaneously using the short pulse and closed loop equations of resistance and synchronous inductances. Therefore, the proposed algorithm can be easily and safely implemented with a reduced measuring time. In addition, it does not need any external or additional measurement equipment, information on the motor's dimensions, and material characteristics as in the case of FEM. Several experimental results verify the effectiveness of the proposed algorithm.

• Industrial Engineering and Management Systems
• /
• v.3 no.2
• /
• pp.92-99
• /
• 2004

We consider the ATM switching node location problem (ANLP). In this problem, there are two kinds of facilities, hub facilities and remote facilities, with different capacities and installation costs. We are given a set of customers with each demand requirements, a set of candidate installation sites of facilities, and connection costs between facilities. We need to determine the locations to place facilities, the number of facilities for each selected location, the set of customers who are connected to each installed hub via installed remote facilities with minimum cost, while satisfying demand requirements of each customer. We formulate this problem as a general integer programming problem and solve it to optimality. In this paper, we present a preprocessing procedure to tighten the formulation and develop a branch-and-price algorithm. In the algorithm, we consider the integer knapsack problem as the column generation problem. Computational experiments show that the algorithm gives optimal solutions in a reasonable time.