• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.885-890
• /
• 2003

The Core Base Tree (CBT) multicast routing architecture is a multicast routing protocol for the internet. The CBT establishes a single shared tree for a multicast connection. The shared tree Is rooted at a center node called core. The location of the core may affect the cost and performance of the CBT. The core placement method requires the knowledge of the network topology In this Paper, we propose a simple and effective method for selecting the core. This method requires the distance vector information. in addition, we used results that calculated sample correlation coefficient. And then we select suitable routing algorithm according to member's arrangement states in muliticast group. we select core node that have minimum average cost or PIM-SM protocol is selected. The performance of this method is compared with several other methods by extensive simulations (i.e mean delay, maximum delay, and total cost). Our results shows that this method for Selecting Core is very effective.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2221-2234
• /
• 1997

Distributed mutual exclusion algorithms have employed two approaches to achieve mutual exclusion and can be divided into two broad classes:token-based and permission-based. Token-based algorithms share a unique token among the nodes and a node is allowed to access its common resources if it possesses the token. Permission-based algorithms require one or more successive rounds of message exchanges among the nodes to obtain the permission to access the common resources. A hypercube architecture has earned wide acceptance in multiprocessor systems in the past few years because of its simple, yet rich topology. Accordingly, we study distributed permission-based mutual exclusion algorithms for hypercubes, and design a distributed permission-based mutual exclusion algorithm based on a new information structure adapted to the hypercubes. The new information structure is a request set of T-pattern from a logical mesh that is embedded into a hypercube. If a node wants to access the common resources, it sends request message to all nodes in the request set by Lan's multicast algorithm. Once the node receives a grant message from all nodes in the request set, it accesses the common resource. We evaluate our algorithm with respect to minimum round-trip delay, blocking delay, and the number of messages per access to the common resource.

• Journal of the Society of Naval Architects of Korea
• /
• v.54 no.3
• /
• pp.187-195
• /
• 2017

The operation planning of transports used to move blocks is the one of key factors. Furthermore, reducing the running time through the effective plan contributes to pulling forward the whole logistic process of the shipyard and substantially saving the fuel consumption of itself as well. The past researches of the transporter focused on finding only the shortest distances, so called, Manhattan distance. However, these searching approaches cannot help having the significant difference in the real operational time and distance with the minimum cost approach which considers the speed retardation for turns or safety at the intersection. This study suggests the noble transporter's operational model which could take account of the consuming operational time around the crossroads on the shipyard. Concretely, the proposed method guarantees the minimization of transporters' turns and passage number which are huge burdensome to the operation time and the whole planning of transports with the given period. Resultantly, this paper is willing to explain the appropriateness of our approach, compared with the previous ones.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.663-668
• /
• 1990

This paper deals with the application of a Generalized Predictive Control (CPC) to a Pressurized Water Reactor (P.W.R) Nuclear Power Plant. Generalized Predictive Control is a sort of Explicit Self-Tuning Control. Current self-tuning algorithms lack robustness to prior choices of either dead-time (input time delay of a plant) or model order. GPC is shown by simulation studies to be superior to accepted self-tuning techniques such as minimum variance and pole-placement from the viewpoint that it is robust to prior choices of dead-time or model order. In this paper a GPC controller is designed to control the P.W.R. nuclear power rlant with varying dead-time and through the designing procedure the designer is free from the constraint of knowing the exact dead-time. The controller is constructed based on the 2nd order linear model approximated in the vicinity of operating point. To ensure that this low-order model describes the complex real dynamics well enough for control purposes, model parameters are updated on-line with a Recursive Least Squares algorithm. Simulation results are successful and show the possibilities of the GPC control application to actual plants with varying or unknown dead-time.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.3
• /
• pp.110-119
• /
• 2017

This study develops a passive traffic signal priority control algorithm for emergency vehicles. The passive priority control estimates and applies signal times for each signalized intersection on the emergency vehicle's route when an emergency call is received. As signals are controlled before the emergency vehicle leaves for its destination, it is possible to clear the queues at each intersection more effectively. Most of the previous studies applied preemption, which ends green time of cross streets when the emergency vehicle arrives at each intersection. This study applies green extension and early green in order not to shift the order of phases, and guarantees minimum green time for each phase. Simulation results show that the delay of emergency vehicles decreases when the signals are controlled. It is expected that delays can be decreased further by integrating the active priority control with the passive priority control algorithm presented in this study.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.11
• /
• pp.66-76
• /
• 2009

The motion estimation in video encoding system occupies the biggest part. So, we require the motion estimator with efficient structure for real-time operation. And for motion estimator's implementation, it is desired to design hardware module of an exclusive use that perform the encoding process at high speed. This paper proposes motion estimation detection block(MED), 41 SADs(Sum of Absolute Difference) calculation block, minimum SAD calculation and motion vector generation block based on parallel processing. The parallel processing can reduce effectively the amount of the operation. The minimum SAD calculation and MED block uses the pre-computation technique for reducing switching activity of the input signal. It results in high-speed operation. The MED and 41 SADs calculation blocks are composed of adder tree which causes the problem of critical path. So, the structure of adder tree has changed the most commonly used ripple carry adder(RCA) with carry skip adder(CSA). It enables adder tree to operate at high speed. In addition, as we enabled to easily control key variables such as control signal of search range from the outside, the efficiency of hardware structure increased. Simulation and FPGA verification results show that the delay of MED block generating the critical path at the motion estimator is reduced about 19.89% than the conventional strukcture.

• Journal of IKEEE
• /
• v.18 no.2
• /
• pp.248-254
• /
• 2014

The hierarchical conference causes the data delay because the exchanged data between terminals in the conference go through the hierarchical structure. In this paper, we propose an algorithm which minimizes the average path distance between terminals in a non-incremental hierarchical conference, and which considers the computing resource. For terminals which want to join the ongoing hierarchical conference, our algorithm selects terminals that the new connection is possible among terminals in the conference with the computing resource consideration. Then, after all distance values between the selected terminals and terminals which want to join the ongoing hierarchical conference are computed, and the terminal-pair which have minimum distance value is selected, the ongoing hierarchical conference is extended with a connection of the terminal-pair which consists of a terminal among selected terminals and other terminal among terminals which want to join the ongoing hierarchical conference. This continues until all terminals are included in the conference. As the experimental results with the proposed non-incremental scheme, the hierarchical conference can be organized with 24% better performance than the earlier incremental scheme on the basis of average path distance between terminals.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.2
• /
• pp.47-56
• /
• 2015

In an energy saving server cluster environment, the power modes of servers are controlled according to load situation, that is, by making ON only minimum number of servers needed to handle current load while making the other servers OFF. This algorithm works well under normal circumstances, but does not guarantee QoS under abnormal circumstances such as sharply rising or falling loads. This is because the number of ON servers cannot be increased immediately due to the time delay for servers to turn ON from OFF. In this paper, we propose a new prediction algorithm of the power consumption for improving QoS under not only normal but also abnormal circumstances. The proposed prediction algorithm consists of two parts: prediction based on the conventional time series analysis and prediction adjustment based on trend analysis. We performed experiments using 15 PCs and compared performance for 4 types of conventional time series based prediction methods and their modified methods with our prediction algorithm. Experimental results show that Exponential Smoothing with Trend Adjusted (ESTA) and its modified ESTA (MESTA) proposed in this paper are outperforming among 4 types of prediction methods in terms of normalized QoS and number of good reponses per power consumed, and QoS of MESTA proposed in this paper is 7.5% and 3.3% better than that of conventional ESTA for artificial load pattern and real load pattern, respectively.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.9
• /
• pp.39-48
• /
• 2008

Recently, many multimedia services have emerged in Internet such as real-time and non- real time services. However, in this Internet environment, we have some limitations to satisfy each service feature. To guarantee the service features in Measurement-Based Admission Control(MBAC) based system on the flow-aware network, there is the method applying Dynamic Priority Scheduling(DPS) algorithm that gives a higher priority to an earlier incoming flow in all of the link bandwidth. This paper classifies all flows under several groups according to flow characteristics on per-flow MBAC algorithm based system. In each flow group, DPS algorithm is applied. This paper proposes two methods that are a DPS based bandwidth borrowing method and a bandwidth dynamic allocation method. The former is that if low priority class has available bandwidths, the flow of high priority class borrows the bandwidth of low priority class when high priority flow has insufficient bandwidth to connect a flow call. The later is that the each group has a minimum bandwidth and is allocated the bandwidth dynamically according to the excess rate for available bandwidth. We compare and analyze the characteristics of the two proposed methods through the simulation experiments. As the results of the experiment, the proposed methods are more effective than existing DPS based method on the packet loss and delay characteristics. Consequently the proposed two methods are very useful in various multimedia network environments.

• Journal of Korea Multimedia Society
• /
• v.15 no.4
• /
• pp.516-525
• /
• 2012

In this paper, an efficient technique for enhancing the QoS of multimedia service for an WiMedia network applying distributed cooperative medium access (D-MAC) protocol is proposed. D-MAC protocol has been proposed to support high-rate Wireless Personal Area Networks (HR-WPANs) by the WiMedia Alliance. Unlike the centralized IEEE 802.15.3 MAC, the D-MAC UWB specified by WiMedia supports all devices to be self-organized and removes the SOP (Simultaneous Operating Piconet) problem, i.e., packet collisions between overlapped piconets in the centralized IEEE 802.15.3 MAC. However the WiMedia D-MAC can't prevent reduce the throughput degradation occurred by mobile nodes with low data rate. Therefore, a distributed cooperative MAC protocol for multi-hop UWB network is proposed in this paper. The proposed technique can intelligently select the transmission path with higher data rate to provide real-time multimedia services with minimum delay, thus enhances QoS of multimedia service.