• Journal of the Korea Society for Simulation
• /
• v.26 no.4
• /
• pp.51-61
• /
• 2017

Hadoop platform is a representative storing and managing platform for big data. Hadoop consists of distributed computing system called MapReduce and distributed file system called HDFS. It is important to analyse the effectiveness according to the change of cluster constructions and several parameters. However, since it is hard to construct thousands of clusters and analyse the constructed system, simulation method is required to analyse the system. This paper proposes Hadoop simulator based on DEVS formalism which provides hierarchical and modular modeling. Hadoop simulator provides a retargetable experimental environment that is possible to change of various parameters, algorithms and models. It is also possible to design input models reflecting the characteristics of Hadoop applications. To maximize the user's convenience, the user interface, real-time model viewer, and input scenario editor are also provided. In this paper, we validate Hadoop Simulator through the comparison with the Hadoop execution results and perform various experiments.

• Journal of Information Technology Applications and Management
• /
• v.14 no.1
• /
• pp.117-135
• /
• 2007

Globalization changes in market structures and consumer needs, as well as technology innovations force organizations to adopt new structures and collaborative networks to cope with rapidly changing environments. These Collaborative Networks are based on the Idea of virtual enterprise. A virtual enterprise(VE) is a temporary alliance of globally distributed independent enterprises that share core competencies and computer networks. This paper presents a proposal for a methodology to measure a key factor of success and risk First of all, we chose thirty experts' defines on virtual enterprise, fifteen are academic specialist and other fifteen are from industry. For this study we define twenty two factors determining VE's success and seventeen factors determining VE's risk using by Delphi method. And we built the influence model on virtual enterprise. A research model was established according to preceeding research and consensus on experts then the revised model of key factors on virtual enterprise. This survey was based on the Analytical Hierarchy Process (AHP). AHP is an approach to decision making that involves structuring multiple choice criteria into a hierarchy, the assessing the relative important of these criteria, comparing alternative for each criteria, and determining an overall ranking of the alternatives. A model was constructed as 3 level hierarchy. The hierarches are organizational, strategic, technical criteria. for success model on VE has 22 factors and 17 factors for risk model. They are selected by all 30 experts. 14 copies among 30 copies distributed to carry out on the Analytical Hierarchy Process (AHP). Consistency ratio confirm high validity and reliability of instrument and support theoretical model. The results of this study are summarized as follows. (1) This study presented success on VE influenced strategic criteria, and essential factor is Creating a value. Risk on VE influenced strategic criteria, and essential factor is Outcome/Distribution. (2) Its enable that ranking the criteria influence on VE. These are supported VE management and using guideline of VE.

• Journal of KIISE:Software and Applications
• /
• v.32 no.4
• /
• pp.277-289
• /
• 2005

To overcome the long design time/high computational effort/low computational performance of phylogenetic learning featuring selection and reproduction, this paper proposes a genetic representation based on XML. Since genetic programs (GP) and genetic operations of this representation are maintained by the invocation of the built-in off-the-shelf XML parser's API, the proposed approach features significant reduced time consumption of GP design process. Handling only semantically correct GPs with standard XML schema can reduce search space and computational effort. Furthermore, computational performance can be improved by the parallelism of GP caused by the utilization of XML, which is a feasible system and wire format for migration of genetic programs in heterogeneous distributed computer environments. To verify the proposed approach, it is applied to the evolution of social behaviors of multiple agents modeling the predator-prey pursuit problem. The results show that the approach can be applied for fast development and time efficiency of GPs.

• Convergence Security Journal
• /
• v.3 no.2
• /
• pp.1-10
• /
• 2003

In the distributed-computing environment, applications or users have to share resources and communicate with each other in order to perform their jobs more efficiently. In this case, it is important to keep resources and information integrity from the unexpected use by the unauthorized user. Therefore, there is a steady increase in need for a reasonable way to authentication and access control of distributed-shared resources. In RBAC, there are role hierarchies in which a higher case role can perform permissions of a lower case role. No vise versa. Actually, however, it is necessary for a lower case role to perform a higher case role's permission, which is not allowed to a lower case role basically. In this paper, we will propose a permission delegation method, which is a permission delegation server, and a permission delegation protocols with the secret key system. As the result of a permission delegation, junior roles can perform senior role's permissions or senior role itself on the exceptional condition in a dedicated interval.

• Journal of KIISE:Software and Applications
• /
• v.31 no.6
• /
• pp.728-740
• /
• 2004

The increasing complexity and shorter life cycle of software have made it necessary to reuse software. Object-oriented development had not provided extensive reuse and computing infrastructures are evolving from mainframe to distributed environments. However, components provide more advanced means of structuring, describing and developing system, because they are more coarse-grained and have more domain-specific aspects than objects. And they are also suited for distributed environment due to their reusability and granularity. In this paper, we present a process including the static metrics and guidelines that can be applied to transform object-oriented systems into component-based systems. Our process consists of two parts: First, basic components are created based upon composition and inheritance relationships between classes. Second, intermediate system is refined into component-based system with the static metrics and guidelines we propose.

• Journal of KIISE:Software and Applications
• /
• v.26 no.12
• /
• pp.1404-1417
• /
• 1999

웹과 같은 분산 환경에서는, 웹 브라우저 상에서 SQL 형식의 공간 질의를 수행시키는 것과 또한 서버로부터 그 질의 결과를 보는 것이 가능하다. 그러나, 격자 이미지(raster image)와 같은 대용량 공간 데이타를 포함하는 질의 결과를 웹 브라우징할 때 발생하는 많은 문제점들 중에서, 사용자 응답 시간의 지연은 매우 중요한 문제이다. 본 논문에서는 사용자의 재요청(callback) 접근 패턴이 공간적 근접성(spatial locality)을 따른다는 가정하에서의, 사용자 응답 시간을 최소화하기 위한 새로운 프리페치(prefetch) 전략에 대해서 서술한다. 본 논문의 프리페치 전략은 다음과 같이 요약될 수 있다. 첫째, 프리페치 알고리즘은 사용자의 접근 패턴을 잘 반영하는 힐버트 곡선(Hilbert-curve) 모델을 바탕으로 한다. 둘째, 프리페치 전송 비용을 줄이기 위해서 사용자의 재요청 시간 간격(think time)을 이용한다. 본 논문에서는, 힐버트 곡선을 이용한 프리페치 전략의 성능 평가를 위해서 다양한 실험을 하였으며, 그 결과로 프리페치를 하지 않는 방식보다 높은 성능 향상이 있음을 보인다.Abstract In distributed environment(e.g., WWW), it would be possible for the users to submit SQL-like spatial queries and to see their query results from the server on the Web browser. However, of many obstacles which result from browsing query results including large spatial data such as raster image, the delay of user response time is very critical. In this paper we present a new prefetch policy which can alleviate user response time on the assumption that user's callback access pattern has spatial locality. Our prefetch policy can be summerized as follows: 1) our prefetch algorithm is based on the Hibert-curve model which well replects user's access pattern, and 2) it utilizes user's callback interval to reduce prefetch network transmission cost. In this paper we conducted diverse experiments to show that our prefetch policy achieves higher performance improvement compared to other non-prefetch methods.

• The Journal of the Korea Contents Association
• /
• v.20 no.8
• /
• pp.42-53
• /
• 2020

With the development of social network services, graph structures have been utilized to represent relationships among objects in various applications. Recently, a demand of subgraph matching in real-time graph streams has been increased. Therefore, an efficient approximate Top-k subgraph matching scheme for low latency in real-time graph streams is required. In this paper, we propose an approximate Top-k subgraph matching scheme considering data reuse in graph stream environments. The proposed scheme utilizes the distributed stream processing platform, called Storm to handle a large amount of stream data. We also utilize an existing data reuse scheme to decrease stream processing costs. We propose a distance based summary indexing technique to generate Top-k subgraph matching results. The proposed summary indexing technique costs very low since it only stores distances among vertices that are selected in advance. Finally, we provide k subgraph matching results to users by performing an approximate Top-k matching on the summary indexing. In order to show the superiority of the proposed scheme, we conduct various performance evaluations in diverse real world datasets.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2599-2613
• /
• 2015

Multi-index hashing (MIH) is the state-of-the-art method for indexing binary codes, as it di-vides long codes into substrings and builds multiple hash tables. However, MIH is based on the dataset codes uniform distribution assumption, and will lose efficiency in dealing with non-uniformly distributed codes. Besides, there are lots of results sharing the same Hamming distance to a query, which makes the distance measure ambiguous. In this paper, we propose a data-oriented multi-index hashing method (DOMIH). We first compute the covariance ma-trix of bits and learn adaptive projection vector for each binary substring. Instead of using substrings as direct indices into hash tables, we project them with corresponding projection vectors to generate new indices. With adaptive projection, the indices in each hash table are near uniformly distributed. Then with covariance matrix, we propose a ranking method for the binary codes. By assigning different bit-level weights to different bits, the returned bina-ry codes are ranked at a finer-grained binary code level. Experiments conducted on reference large scale datasets show that compared to MIH the time performance of DOMIH can be improved by 36.9%-87.4%, and the search accuracy can be improved by 22.2%. To pinpoint the potential of DOMIH, we further use near-duplicate image retrieval as examples to show the applications and the good performance of our method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.8
• /
• pp.19-24
• /
• 2018

The IP Multimedia Subsystem(IMS) is an architectural framework for delivering IP multimedia services to mobile users. In order to guarantee the reliability and Quality of Service(QoS) of a variety of multimedia services, we need a new evolutionary approach that maintains the IMS based signaling platform which can perform the processing of flow through distributed controllers. Software Defined Network(SDN) is an architecture purporting to be distributed, dynamic, cost-effectives as well as adapting and seeking to be suitable for the high-bandwidth, dynamic nature of today's applications. It requires some methods for the control plane to communication with the data plane. One of such mechanisms is OpenFlow which is a prominent standard protocol and interface that is responsible for managing the network resources by using the remote SDN controller. In this paper, we propose a straightforward approach for integrating SDN technology together with the IMS architecture. Therefore we propose and construct a combined architecture model that performs flow processing using OpenFlow via the IMS based signaling platform, which maintains the existing telecom call service. Additionally, we describe some relevant experimentation results from the proposed architecture.

• The Journal of the Korea Contents Association
• /
• v.12 no.4
• /
• pp.31-39
• /
• 2012

DVC(Distributed Video Coding) techniques have been attracting a lot of research works since these enable us to implement the light-weight video encoder and to provide good coding efficiency by introducing the feedback channel. However, the feedback channel causes the decoder to increase the decoding complexity and requires very high decoding latency because of numerous iterative decoding processes. So, in order to reduce the decoding delay and then to implement in a real-time environment, this paper proposes several parity bit estimation methods which are based on the temporal correlation, spatial correlation and spatio-temporal correlations between LDPCA frames on each bit plane in the consecutive video frames in pixel-domain Wyner-Ziv video coding scheme and then the performances of these methods are compared in fast DVC scheme. Through computer simulations, it is shown that the adaptive spatio-temporal correlation-based estimation method and the temporal correlation-based estimation method outperform others for the video frames with the highly active contents and the low active contents, respectively. By using these results, the proposed estimation schemes will be able to be effectively used in a variety of different applications.