• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.85-91
• /
• 2009

The centralized conference architecture has a restriction in scalability due to the performance reduction as the number of conference participants increases. To solve this problem several distributed conference architectures have been studied recently. In these architectures new conference servers are added dynamically to the conference environment. In this paper, We have proposed a new conference information data model which can be used in these distributed conference architectures. In our newly proposed conference information data model. several components has been added for exchanging conference information between primary conference server and multiple secondary conference servers. We also proposed a procedure of conference information exchange between these conference servers. And the management of conference informations and SIP(Session Initiation Protocol) notifications to the total conference participants can be processed distributedly with these conference servers, therefore the load to the primary conference server can be decreased by using this method. The performance of our proposed model has been evaluated by experiments.

• Journal of Ocean Engineering and Technology
• /
• v.37 no.6
• /
• pp.273-281
• /
• 2023

Recently, offshore structures for eco-friendly energy, such as wind and solar power, have been developed to address the problem of insufficient land space; in the case of energy generation, they are designed on a considerable scale. Therefore, the scalability of offshore structures is crucial. The Korea Research Institute of Ships & Ocean Engineering (KRISO) developed multi-linked floating offshore structures composed of floating bodies and connection beams for floating photovoltaic systems. Large-scale floating photovoltaic systems are mainly designed in a manner that expands through the connection between modules and demonstrates a difference in structural response with connection conditions. A fluid-structure coupled analysis was performed for the multi-linked floating offshore structures. First, the wave load acting on the multi-linked offshore floating structures was calculated through wave load analysis for various wave load conditions. The response amplitude operators (RAOs) for the motions and structural response of the unit structure were calculated by performing finite element analysis. The effects of connection conditions were analyzed through comparative studies of RAOs and the response's maximum magnitude and occurrence location. Hence, comparing the cases of a hinge connection affecting heave and pitch motions and a fixed connection, the maximum bending stress of the structure decreased by approximately 2.5 times, while the mooring tension increased by approximately 20%, confirmed to be the largest change in bending stress and mooring tension compared to fixed connection. Therefore, the change in structural response according to connection condition makes it possible to design a higher structural safety of the structural member through the hinge connection in the construction of a large-scale multi-linked floating offshore structure for large-scale photovoltaic systems in which some unit structures are connected. However, considering the tension of the mooring line increases, a safety evaluation of the mooring line must be performed.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.6
• /
• pp.1087-1094
• /
• 2023

Due to the development of technologies, such as big data, cloud, IoT, and AI, The high data throughput is required, and the importance of network flexibility and scalability is increasing. However, existing network systems are dependent on vendors and equipment, and thus have limitations in meeting the foregoing needs. Accordingly, SDN technology that can configure a software-centered flexible network is attracting attention. In particular, a load balancing method based on SDN can efficiently process massive traffic and optimize network performance. In the existing load balancing studies in SDN environment have limitation in that unnecessary traffic occurs between servers and controllers or performing load balancing only after the server reaches an overload state. In order to solve this problem, this paper proposes a method that minimizes unnecessary traffic and appropriate load balancing can be performed before the server becomes overloaded through a method of assigning weights to servers in stages according to server load.

• Journal of the Korea Society of Computer and Information
• /
• v.29 no.1
• /
• pp.195-209
• /
• 2024

The current road traffic signal controller developed in the 1990s has limitations in flexibility and scalability due to power supply problems, various communication methods, and hierarchical black box structures for various equipment and devices installed to improve traffic safety for road users and autonomous cooperative driving. In this paper, we designed a road traffic safety facilities equipment and devices integrated management system that can cope with the rapidly changing future traffic environment by solving the using direct current(DC) and power supply problem through the power over ethernet(PoE) technology and centralized data-driven control through message broker technology. In addition, a data-driven real-time control method for road traffic safety facilities equipment and devices operating based on time series data was implemented and verified.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1173-1183
• /
• 2006

In this paper, we propose an efficient method for improving visual quality of AR-FGS (Adaptive Reference FGS) which is adopted as a key scheme for SVC (Scalable Video Coding) or H.264 scalable extension. The standard FGS (Fine Granularity Scalability) adopts AR-FGS that introduces temporal prediction into FGS layer by using a high quality reference signal which is constructed by the weighted average between the base layer reconstructed imageand enhancement reference to improve the coding efficiency in the FGS layer. However, when the enhancement stream is truncated at certain bitstream position in transmission, the rest of the data of the FGS layer will not be available at the FGS decoder. Thus the most noticeable problem of using the enhancement layer in prediction is the degraded visual quality caused by drifting because of the mismatch between the reference frame used by the FGS encoder and that by the decoder. To solve this problem, we exploit the principle of cyclical block coding that is used to encode quantized transform coefficients in a cyclical manner in the FGS layer. Encoding block coefficients in a cyclical manner places 'higher-value' bits earlier in the bitstream. The quantized transform coefficients included in the ealry coding cycle of cyclical block coding have higher probability to be correctly received and decoded than the others included in the later cycle of the cyclical block coding. Therefore, we can minimize visual quality degradation caused by bitstream truncation by adjusting weighting factor to control the contribution of the bitstream produced in each coding cycle of cyclical block coding when constructing the enhancement layer reference frame. It is shown by simulations that the improved AR-FGS scheme outperforms the standard AR-FGS by about 1 dB in maximum in the reconstructed visual quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.11
• /
• pp.879-894
• /
• 2013

Recently, due to a explosive growth in the mobile Internet traffic, the problem of excessive data traffic handling on core network and thus scalability problem have been magnified in 3GPP LTE/SAE networks. Current LTE/SAE network based on the central P-GW (PDN Gateway) used as mobility anchor cannot deal with such demand for exponentially increasing mobile Internet traffic. In this paper, we propose a new LTE/SAE network architecture supporting distributed P-GWs and corresponding distributed mobility management to solve these problems. For this, in addition to the deployment of such distributed P-GWs, we propose a dynamic and distributed mobility management by distributing MMEs (Mobility Management Entities) which dynamically manages the location information of a UE's PDN connection, and also propose a handover procedure of such PDN connections by using the proposed distributed P-GWs and MMEs. The performance of the proposed dynamic and distributed LTE/SAE network system is compared with the current LTE/SAE network system in terms of handover latency and network throughput.

• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.68-78
• /
• 2010

As the IP multicast function is very slowly deployed in Internet due to its scalability problem and inter-domain interoperability problem, interest in the P2P(Peer-to-Peer) streaming technologies for the realtime multimedia multicast applications such as IPTV is highly growing. This paper proposes a P2P streaming method for the QoS-sensitive multimedia multicast applications such as highly-interactive personal IPTV and video conferences. The proposed P2P streaming method allows an application to construct a reliable streaming tree in which a proper number of backup peers are placed according to its reliability requirement. The reliable streaming tree reduces the reconnection delay, occurred in the case of a normal and/or abnormal peer leave, so as to minimize the loss of streaming data. In the proposed P2P streaming method, the join delay of a peer called startup delay is also substantially reduced because the bandwidth and end-to-end delay information of every peer kept in a distributed way allows the target peer for a joining peer to be able to be quickly determined. Moreover, the proposed method's peer admission control mechanism based on the bandwidth and end-to-end delay enables the delay-bounded streaming services to be provided for its corresponding applications.

• Journal of Intelligence and Information Systems
• /
• v.19 no.4
• /
• pp.1-10
• /
• 2013

Personalization aims to provide customized contents to each user by using the user's personal preferences. In this sense, the core parts of personalization are regarded as recommendation technologies, which can recommend the proper contents or products to each user according to his/her preference. Prior studies have proposed novel recommendation technologies because they recognized the importance of recommender systems. Among several recommendation technologies, collaborative filtering (CF) has been actively studied and applied in real-world applications. The CF, however, often suffers sparsity or scalability problems. Prior research also recognized the importance of these two problems and therefore proposed many solutions. Many prior studies, however, suffered from problems, such as requiring additional time and cost for solving the limitations by utilizing additional information from other sources besides the existing user-item matrix. This study proposes a novel implicit rating approach for collaborative filtering in order to mitigate the sparsity problem as well as to enhance the performance of recommender systems. In this study, we propose the methods of reducing the sparsity problem through supplementing the user-item matrix based on the implicit rating approach, which measures the trust level among users via the existing user-item matrix. This study provides the preliminary experimental results for testing the usefulness of the proposed model.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.485-494
• /
• 2008

Huge amounts of various web items such as keywords, images, and web pages are being made widely available on the Web. The popularities of such web items continuously change over time, and mining temporal patterns in popularities of web items is an important problem that is useful for several web applications. For example, the temporal patterns in popularities of search keywords help web search enterprises predict future popular keywords, enabling them to make price decisions when marketing search keywords to advertisers. However, presence of millions of web items makes it difficult to scale up previous techniques for this problem. This paper proposes an efficient method for mining temporal patterns in popularities of web items. We treat the popularities of web items as time-series, and propose gapmeasure to quantify the similarity between the popularities of two web items. To reduce the computation overhead for this measure, an efficient method using the Fast Fourier Transform (FFT) is presented. We assume that the popularities of web items are not necessarily following any probabilistic distribution or periodic. For finding clusters of web items with similar popularity trends, we propose to use a density-based clustering algorithm based on the gap measure. Our experiments using the popularity trends of search keywords obtained from the Google Trends web site illustrate the scalability and usefulness of the proposed approach in real-world applications.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2105-2112
• /
• 2009

Recently RFID system has been adopted in various fields rapidly. However, we ought to solve the problem of privacy invasion that can be occurred by obtaining information of RFID Tag without any permission for popularization of RFID system To solve the problems, it is Ohkubo et al.'s Hash-Chain Scheme which is the safest method. However, this method has a problem that requesting lots of computing process because of increasing numbers of Tag. Therefore, We suggest the way (process) satisfied with all necessary security of Privacy Protection Shreme and decreased in Tag Identification Time in this paper. First, We'll suggest the SP-Division Algorithm seperating SPs using the Performance Measurement consequence of each node after framing the program to create Hash-Chain Calculated table to get optimized performance because of character of the grid environment comprised of heterogeneous system. If we compare consequence fixed the number of nodes to 4 with a single node, equal partition, and SP partition, when the total number of SPs is 1000, 40%, 49%, when the total number of SPs is 2000, 42%, 51%, when the total number of SPs is 3000, 39%, 49%, and when the total number of SPs is 4000, 46%, 56% is improved.