• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.6
• /
• pp.397-401
• /
• 2007

Recent applications on continuous queries on moving objects are extended quickly to various parts. These applications need not only 2-dimensional space data but also high-dimensional space data. If we use previous index for overlapped continuous range queries on high-dimensional space data, as the number of continuous range queries on a large number of moving objects becomes larger, their performance degrades significantly. We focus on stationary queries, non-exponential increase of storage cost and efficient processing time for large data sets. In this paper, to solve these problems, we present a novel query indexing method, denoted as PAB(Projected Attribute Bit)-based query index. We transfer information of high-dimensional continuous range query on each axis into one-dimensional bit lists by projecting technique. Also proposed query index supports incremental update for efficient query processing. Through various experiments, we show that our method outperforms the CES(containment-encoded squares)-based indexing method which is one of the most recent research.

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.368-378
• /
• 2008

In recent years, publish-subscribe (pub-sub) systems based on XML document filtering have received much attention. In a typical pub-sub system, subscribed users specify their interest in profiles expressed in the XPath language, and each new content is matched against the user profiles so that the content is delivered to only the interested subscribers. As the number of subscribed users and their profiles can grow very large, the scalability of the system is critical to the success of pub-sub services. In this paper, we propose a fast and scalable XML filtering system called SFiST which is an extension of the FiST system. Sharable segments are extracted from twig patterns and stored into the hash-based Segment Table in SFiST system. Segments are used to represent user profiles as Terse Sequences and stored in the Compact Segment Index during filtering. Our experimental study shows that SFiST system has better performance than FiST system in terms of filtering time and memory usage.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.68-79
• /
• 2005

The popularity of Web service is ever increasing. As the number of services and clients continue to increase, the problem of providing a system that scales with this increase is becoming more difficult. A costly and ineffective method is to buy a new system that is more powerful every time the load becomes unbearable. h more cost effective solution is to expand the system as the need arises. This is the approach taken in Web cluster systems. However, providing effective scalability in a Web cluster system is stil1 an open issue. In this study, we implement a Web cluster system based on Layer 7 switching technique on Linux. The implementation is based on a design proposed and implemented by Aron et al., but on the FreeBSD. Though the design li the same, due to the vast difference between the FreeBSD and Linux, the implementation presented in this paper is totally new. We also propose the Dual Scheduling (DS) load distribution algorithm that distributes the requests to the system resources by observing the variations in the request rate. We show through measurement on our implementation that the DS alorithm performs considerably bettor than previous algorithms.

• The Journal of the Korea Contents Association
• /
• v.7 no.6
• /
• pp.1-8
• /
• 2007

In electronic commerce, it is important for users to recommend the proper item among large item sets with saving time and effort. Therefore, if the recommendation system can be recommended the suitable item, we will gain a good satisfaction to the user. In this paper, we proposed the associative relation clustering split method in the collaborative filtering in order to perform the accuracy and the scalability. We produce the lift between associative items using the ratings data. and then split the node group that consists of the item to improve an efficiency of the associative relation cluster. This method differs the association about the items of groups. If the association of groups is filled, the reminding items combine. To estimate the performance, the suggested method is compared with the K-means and EM in the MovieLens data set.

• Journal of Korea Society of Industrial Information Systems
• /
• v.21 no.2
• /
• pp.73-91
• /
• 2016

This study sheds light on the quality aspect of cloud computing services as next IT platform. Three tasks of the research are to extract the quality factors of cloud service from the user's viewpoint, empirically analyze the perceptual differences between the user group and the provider group by applying the IPA technique, and suggest some quality factors that need to be improved. Based on the previous researches and focus group evaluation, 13 quality factors have been established. Two field surveys have been performed respectively to collect the perceptual importance and satisfaction level of the users and the providers. It is shown that the quality satisfaction of the user group is lower than the quality perceived by the providers. And there exist significant differences between two groups in respect to quality importance level and IPA matrix. In conclusion, 6 quality factors that need to be improved are suggested such as service functionality, service availability, interoperability, scalability, confidentiality, and provider's responsiveness.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2285-2301
• /
• 2012

Peer-to-Peer (P2P) networks are becoming more and more popular in video content delivery services, such as Video on Demand (VoD). Scalability feature of P2P allows a higher number of simultaneous users at a given server load and bandwidth to use stream service. However, the quality of service (QoS) in these networks is difficult to be guaranteed because of the free-riding problem that nodes download the recourses while never uploading recourses, which degrades the performance of P2P VoD networks. In this paper, a distributed trust model is designed to reduce node's free-riding phenomenon in P2P VoD networks. In this model, the P2P network is abstracted to be a super node hierarchical structure to monitor the reputation of nodes. In order to calculate the reputation of nodes, the Hidden Markov Model (HMM) is introduced in this paper. Besides, a distinction algorithm is proposed to distinguish the free-riders and malicious nodes. The free-riders are the nodes which have a low frequency to free-ride. And the malicious nodes have a high frequency to free-ride. The distinction algorithm takes different measures to response to the request of these two kinds of free-riders. The simulation results demonstrate that this proposed trust model can improve QoS effectively in P2P VoD networks.

• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.119-128
• /
• 2010

Computing environment in these days aim for user-oriented development called RIA (Rich Internet Application). As a representative development method of RIA, Flex Framework overcomes the weaknesses of the Mainframe and C/S (Client/Server). However, the issues, such as, difficulties in memory management, complexity of the binding structure and large capacities of the compile outputs are left to be solved. The purpose of this paper is to implement the framework which enables the fast and accurate development of user-oriented web application on the Flex platform. DDX (Dynamic Data eXchange) framework proposes standardized and efficient development environment in a Flex platform. And by using scalability-prepared library that is applicable for various job areas, the framework enhances the performance, increase development productivity and help construct stable system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.11
• /
• pp.2437-2445
• /
• 2012

This paper presents the efficient measurement method of radio resource by analyzing various medium occupied elements. The medium occupied time consists of 802.11 frames, wireless interference, and protocol waiting time from a wireless node on a current channel. And it is used to performance metric. Existing research is only measured partial occupied elements, and is lack of validation of measurement unit and scalability on various IEEE 802.11 radio. This paper presents the measurement method of classified occupied elements. To achieve this, we modified 802.11n based OpenHAL device driver to collect the register information of wireless chipset, and to analyze receiving frames in an virtual monitor mode. We conclude accurate medium occupied time measurement system from various validation methods.

• Journal of Internet Computing and Services
• /
• v.8 no.6
• /
• pp.21-28
• /
• 2007

Hierarchical Mobile IPv6 improves performance of Mobile IPv6 by managing Binding Update in terms of location, With improved handover delay, realization of delay-sensitive services (e,g, VoIP or video streaming) has become more persuadable, Comparing with Mobile IPv6, however, Hierarchical Mobile IPv6 brings security threats related to Local Binding Update to mobile network, In the RFC 4140, specific methods to authenticate Local Binding Update message are not explicitly presented. It is essential that design secure architecture to address problems related to authenticating Local Binding Update, Many secure suggestions for Local Binding Update, however, concentrate on infrastructure-based solutions such as AAA PKI. These approaches may cause scalability problem when the suggested solutions are applied to real network. Therefore we suggest authentication method that doesn't require infrastructure, In addition to authentication of Local Binding Update, our method also provides mobile node with power saving ability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10A
• /
• pp.1517-1531
• /
• 1999

The Internet is recently evolving into the directions which is capable of incorporating stream-type services such as voice and video services. However, the existing Internet can only support a best-effort delivery model and thus it is difficult to satisfy these requirements as well as to provide the QoS beyond a certain degree. Accordingly, it is imperative to develop QoS based routing algorithm in order to allow the routing by the user's QoS demand and to be applied into wide area networks. In this thesis, we presented new routing algorithms and made performance evaluations. The proposed algorithms allow the routing by the user’s QoS demand level in order to provide the diverse Internet application services based on ATM network environment that is expected to play a role as an infrastructure of high-speed communication network. They also have a feature of shortening the waiting time for address analysis and have a quality-proven characteristics with enhanced network scalability.