• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.139-146
• /
• 2006

This paper describes the design and implementation details of a distributed transactional workflow monitoring system. There have been prevalent research and development trends in the workflow literature - workflow systems tend to be completely distributed architectures to support very large-scale workflow applications on object-oriented and internet-based infrastructures. That is, the active (object), distributed (architecture), system-oriented (transaction), and large-scale (application) workflow systems are the key targets in terms of the research and development aspects. While the passive, centralized, human-oriented, and small/medium scale workflow systems are the typical instances of the traditional workflow systems. Unlike in the traditional (the client-server architecture) workflow systems, the workflow monitoring features should not be easily supported in the recent (the fully distributed architecture) workflow systems. At the same time, they need a set of additional monitoring features, such as gathering and displaying statistical (or overload status) information of the workflow architectural components dispersed on the internet. We, in this paper, introduce the additional workflow monitoring features that are necessarily required for the recent workflow systems, and show how to embed those features into a web-based distributed workflow system.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.1
• /
• pp.81-88
• /
• 2000

As distributed systems become used in wider area of applications, many works has been done to invent more efficient way to manage the distributed systems. The client-server based distributed system management by using SNMP or CMIP has many problems such as scalability, interoperability, flexibility, and so on. Recently, it is evident that managing distributed systems using mobile agents have popularity, and the Java language helps the trend. However, the improvement of performance has to be analyzed when the mechanism of mobile agent is applied In this paper, we discuss a more efficient way to make use of the mobile agent mechanism for managing distributed systems, and propose an Agent-On-Demand (AOD) method. The core of the method is not to use the previous method that mobile agents doing management job is dispatched to the managed nodes by a manager application, but to make agents requested by the managed nodes and then the manager application send the requested agents to that nodes. This process is done through Hierarchical State Threshold (HST). Also we present a performance model for Java RMI and mobile agent, and compare the AOD method with the previous work in terms of network overhead and execution time.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.286-298
• /
• 2002

The Remote Procedure Call(RPC) has been traditionally used for Inter Process Communication(IPC) among precesses in distributed computing environment. As distributed applications have been complicated more and more, the Mobile Agent paradigm for IPC is emerged. Because there are some paradigms for IPC, researches to evaluate and compare the performance of each paradigm are issued recently. But the performance models used in the previous research did not reflect real distributed computing environment correctly, because they did not consider the evacuation elements for providing security services. Since real distributed environment is open, it is very vulnerable to a variety of attacks. In order to execute applications securely in distributed computing environment, security services which protect applications and information against the attacks must be considered. In this paper, we evaluate and compare the performance of the Remote Procedure Call with that of the Mobile Agent in IPC paradigms. We examine security services to execute applications securely, and propose new performance models considering those services. We design performance models, which describe information retrieval system through N database services, using Petri Net. We compare the performance of two paradigms by assigning numerical values to parameters and measuring the execution time of two paradigms. In this paper, the comparison of two performance models with security services for secure communication shows the results that the execution time of the Remote Procedure Call performance model is sharply increased because of many communications with the high cryptography mechanism between hosts, and that the execution time of the Mobile Agent model is gradually increased because the Mobile Agent paradigm can reduce the quantity of the communications between hosts.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.1
• /
• pp.22-32
• /
• 2003

Many of multimedia applications in distributed environments generate the packets which have the real-time characteristics for continuous audio/video data and transmit them according to the teal-time task scheduling theories. In this paper, we model the traffic for continuous media in the distributed multimedia applications based on the high-bandwidth networks and introduce the PDMA algorithm which is the hard real-time task scheduling theory for guaranteeing QoS requested by the clients. Furthermore, we propose the admission control to control the new request not to interfere the current services for maintaining the high quality of services of the applications. Since the proposed admission control is sufficient for the PDMA algorithm, the PDMA algorithm is always able to find the feasible schedule for the set of messages which satisfies it. Therefore, if the set of messages including the new request to generate the new traffic. Otherwise, it rejects the new request. In final, we present the simulation results for showing that the scheduling with the proposed admission control is of practical use.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.333-343
• /
• 2006

MANET and P2P applications have a common nature that they don't have any fixed infrastructures that might maintain network topologies. With such common characteristics, a P2P application can be a killer application over MANET. Due to absence of reliable node which serves indexing services in MANET, fully distributed P2P applications are more suitable for MANET. By using DHT like Chord, we can save network bandwidth and avoid a point of failure of a directory server. However, since MANET allows nodes to depart from network freely, P2P file sharing applications using Chord lookup protocol should address how to recover the keys stored at the departed node. In this paper, we propose BU-Chord in order to detect and recover the departure of nodes by creating and storing backup file information in distributed manner. Our BU-Chord shows off better performance than existing Chord especially in case of high departure rate of nodes.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.1
• /
• pp.101-115
• /
• 2011

PECOLE (Peer-to-Peer Collaborative Environment) is a P2P-based multimedia distributed collaborative environment supporting a collaborative workspace which is composed of a variety of collaborative applications such as multi-chat, video conferencing, screen sharing and etc. Unfortunately, due to the PECOLE's simple group management, it is impossible to perform collaboration activities while joining multiple groups. In this paper, we present the design and implementation of PECOLE+ which is an extension of PECOLE. PECOLE+ resolves the drawback of PECOLE by providing the Group Management Service and the Workspace Management Service. The Group Management Service provides functionalities such as creating groups, joining multiple groups, and searching groups, and etc. The Workspace Management Service provides each group with an associated workspace, supporting the execution of collaborative applications over the workspace. In addition, any collaborative applications with the provided plug-in interfaces can be executed over the workspace as a PECOLE+ collaborative application.

• Journal of KIISE:Software and Applications
• /
• v.29 no.12
• /
• pp.907-925
• /
• 2002

Due to the emersion of J2EE(Java 2, Enterprise Edition), many enterprises inside and outside of the country have been developing the enterprise applications appropriate to the J2EE model. With the help of the component model of Enterprise Java Beans(EJH) which is the J2EE core technology, we can develop the distributed object applications quite simple. EJB application can be implemented by using the component-oriented object transaction middleware and the most applications utilize the distributed transaction. EJB developers can concentrate on the business logic because the EJB server covers the middleware service. Due to these characteristics, EJB technology became popular and then the study for EJB based application has been done quite actively However, the research of metrics for measuring the performance during run-time of the EJB applications has not been done enough. Tn this paper, we explore the workflow for the EJB application service on the run-time and classify the internal operation into several elements. We propose the metrics for evaluating the performance up to the bean level by using the classified elements. First, we analyze the lifecycle according to the bean types which comes from the EJB application on the run-time as to extract each factor used in performance measurement. We also find factors related to a performance and allocate the Performance factors to the metrics as the bean types. We also consider the characteristics like the bean's activation and message passing which happens during bean message call and then analyze the relations of the beans participating in the workflow of the application to make the workflow performance measurement possible. And we devise means to bring performance enhancement of the EJB application using the propose.

• Journal of Internet Computing and Services
• /
• v.18 no.3
• /
• pp.1-9
• /
• 2017

Smart Cities intelligently manage numerous infrastructures, including Smart-City IoT devices, and provide a variety of smart-city applications to citizen. In order to provide various information needed for smart-city applications, Smart Cities require a function to intelligently process large-scale streamed big data that are constantly generated from a large number of IoT devices. To provide smart services in Smart-City, the Smart-City Consortium uses stream reasoning. Our stream reasoning requires real-time processing of big data. However, there are limitations associated with real-time processing of large-scale streamed big data in Smart Cities. In this paper, we introduce one of our researches on cloud computing based real-time distributed-parallel-processing to be used in stream-reasoning of IoT big data in Smart Cities. The Smart-City Consortium introduced its previously developed smart-city middleware. In the research for this paper, we made cloud computing based real-time distributed-parallel-processing available in the cloud computing platform of the smart-city middleware developed in the previous research, so that we can perform real-time distributed-parallel-processing with them. This paper introduces a real-time distributed-parallel-processing method and system for stream reasoning with IoT big data transmitted from various sensors of Smart Cities and evaluate the performance of real-time distributed-parallel-processing of the system where the method is implemented.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.8
• /
• pp.239-244
• /
• 2015

WebCL was proposed for high complex computing in Javascript. Since WebCL-based applications are distributed and executed on an unspecified number of general clients, it is important to profile their performances on different clients. Several profilers have been introduced to support various programming languages but WebCL profiler has not been developed yet. In this paper, we present a WebCL profiler to evaluate WebCL-based applications and monitor the status of GPU on which they run. This profiler helps developers know the execution time of applications, memory read/write time, GPU statues such as its power consumption, temperature, and clock speed.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06c
• /
• pp.351.1-355
• /
• 1998

Network-based real-time multimedia applications require guaranteed performances of communication service. Also according to increased bandwidth and processing performance in the future high speed networks, it is possible to make multimedia real-time applications such as distributed real-time applications including video conference, medical imaging, and video education. These applications have characteristics of stringent performance requirements in terms of delay, delay jitter and maximum loss rate. This paper proposes a new delay control for Broadband networks with FCFS queueing. The delay control provides an alternative solution to a current problem in real-time communication; traffic distortion, which makes it difficult to meet such real-time requirements. In simulations, it shows that the proposed delay control can guarantee local and end-to-end delay.