• The Journal of Society for e-Business Studies
• /
• v.18 no.2
• /
• pp.27-46
• /
• 2013

To reduce time to market for converged services, the service provider needs to combine external services and internal processes together, and IT architecture for converged services has to support it. Service Oriented Architecture (SOA) enables the development of a converged service by combining external services and internal processes effectively. However, it is difficult for the existing SOA methods to support the evolution of a converged service, even though the service which consists of the converged service changes over time. In this paper, we argue that a method for profile-based dynamic service binding is required to support evolution of converged services. In order to identify requirements for the proposed method, a business scenario with a smart athletic equipment is given. We then present the concept and architecture of the method for profile-based dynamic service binding to meet the identified requirements. We also demonstrate a prototype implementation for evaluating the proposed method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.10
• /
• pp.746-758
• /
• 2006

Many objects existing on wide area environments have the replication characteristics according to how to categorize using their own names or properties. From the clients' requests, the existing naming and trading services have not supported with the binding service for replicated solver object with the same service type. For this reason, we present an integrated model that can support the selection of replicated object and dynamic binding services on wide-area computing environments. This model suggests provides not only location management of replicated objects but also active binding service which enables to select a least-loaded object on the system to keep the balance of load between systems. In this purpose, constructing both the service plan and model for support solver object's binding with replication property on wide area computing environments has been researched. In this paper, we showed the test environment and analyzed the performance evaluation of client/server binding procedures via integrated binding service in federation model and verified our model under the condition to see whether load balance can be applied to our model. For the performance evaluation of suggested wide area integrated binding service federation model, evaluated the integrated binding service of each domain and analyzed the performance evaluation of process for non-replication object's under federation model environment. Also, we analyzed the performance evaluation of the federation model between domains for wide area environment. From the execution results, we showed the federation model provides lowers search-cost on the physical tree structure of network.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.12
• /
• pp.455-462
• /
• 2014

In recent years, various services in mobile environments due to the growth of mobile devices and related techniques like wireless networks. Furthermore, as the increasing communication traffic in cellular networks has become a new significant issue, many studies for device-to-device(D2D) communication and D2D-based cooperative services have been performed recently. In this paper, we design a smart agent system for D2D-based cooperative services and propose a dynamic service binding method based on service ontology. We classify roles of mobile devices for cooperative services by defining three types of smart agents, and construct a knowledge base in order to describe properties of 'service' unit. The proposed knowledge model, D2D cooperative service ontology, can enable a autonomous cooperative services between mobile devices by binding a requested service to the appropriate member device according to the real-time context in mobile environments.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.307-318
• /
• 2003

In this paper, we design and construct a TMO object group that provides the guaranteed real-time services in the distributed object computing environments, and verify execution power of its model for the correct distributed real-time services. The TMO object group we suggested is based on TINA's object group concept. This model consists of TMO objects having real-time properties and some components that support the object management service and the real-time scheduling service in the TMO object group. Also TMO objects can be duplicated or non-duplicated on distributed systems. Our model can execute the guaranteed distributed real-time service on COTS middlewares without restricting the specially ORB or the of operating system. For achieving goals of our model. we defined the concepts of the TMO object and the structure of the TMO object group. Also we designed and implemented the functions and interactions of components in the object group. The TMO object group includes the Dynamic Binder object and the Scheduler object for supporting the object management service and the real-time scheduling service, respectively The Dynamic Binder object supports the dynamic binding service that selects the appropriate one out of the duplicated TMO objects for the clients'request. And the Scheduler object supports the real-time scheduling service that determines the priority of tasks executed by an arbitrary TMO object for the clients'service requests. And then, in order to verify the executions of our model, we implemented the Dynamic Binder object and the Scheduler object adopting the binding priority algorithm for the dynamic binding service and the EDF algorithm for the real-time scheduling service from extending the existing known algorithms. Finally, from the numerical analyzed results we are shown, we verified whether our TMO object group model could support dynamic binding service for duplicated or non-duplicated TMO objects, also real-time scheduling service for an arbitrary TMO object requested from clients.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.17 no.2
• /
• pp.29-35
• /
• 2021

Recently, with the widespread use of the Internet of Things (IoT), the service structure has been studied to interact with various service domains. A common way to interact with other service domains is to develop the APIs needed to interact on the platform. However, to use a common method, we consider many costs and resources as APIs can increase while adding connections from other service domains. To address this issue, we propose the design and implementation of a dynamic API platform. The proposed platform can dynamically create APIs when requesting service applications, depending on the target service domain. To demonstrate the feasibility of the proposed platform, we develop a COVID-19 weekly infection status, regional infection status, and vaccination status service using dynamic APIs from the Public Data Portal using the proposed dynamic API platform and Node-RED.

• The KIPS Transactions:PartA
• /
• v.14A no.2
• /
• pp.117-124
• /
• 2007

In this paper we present a translation lookaside buffer (TLB) system with low power consumption for embedded processors. The proposed TLB is constructed as multiple banks, each with an associated block buffer and a corresponding comparator. Either the block buffer or the main bank is selectively accessed on the basis of two bits in the block buffer (tag buffer). Dynamic power savings are achieved by reducing the number of entries accessed in parallel, as a result of using the tag buffer as a filtering mechanism. The performance overhead of the proposed TLB is negligible compared with other hierarchical TLB structures. For example, the two-cycle overhead of the proposed TLB is only about 1%, as compared with 5% overhead for a filter (micro) TLB and 14% overhead for a same structure without continuos accessing distinction algorithm. We show that the average hit ratios of the block buffers and the main banks of the proposed TLB are 95% and 5% respectively. Dynamic power is reduced by about 95% with respect to with a fully associative TLB, 90% with respect to a filter TLB, and 40% relative to a same structure without continuos accessing distinction algorithm.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.293-306
• /
• 2003

In recent years, distributed computing environments have been radically changing to a structure of global, heterogeneous, federative and wide-area systems. This structure's environments consist of a let of objects which are implemented on telecommunication network to provide a wide range of services. Furthermore, all of objects existing on the earth have the duplicated characteristics according to how to categorize their own names or properties. But, the existing naming or trading mechanism has not supported the binding services of duplicated objects, because of deficiency of independent location service. Also, if the duplicated objects which is existing on different nodes provide the same service, it is possible to distribute the client requests considering each system's load. For this reason, we designed and implemented a new model that can not only support the location management of replication objects, but also provide the dynamic binding service of objects located in a system with minimum overload for maintaining load balancing among nodes in wide-area object computing environments. Our model is functionally divided into two parts; one part is to obtain an unique object handle of replicated objects with same property as a naming and trading service, and the other is to search one or more contact addresses by a location service using a given object handle. From a given model mentioned above, we present the procedures for the integrated binding mechanism in design phase, that is, Naming/Trading Service and Location Service. And then, we described in details the architecture of components for Integrated Binding Service implemented. Finally, we showed our implement environment and executing result of our model.

• Journal of KIISE:Software and Applications
• /
• v.35 no.2
• /
• pp.91-104
• /
• 2008

Service-Oriented Computing (SOC) is the development method that published services are selected and composed at runtime to deliver the expected functionality to service clients. SOC should get maximum benefits not only supporting business agility but also reducing the development time. Services are selected and composed at runtime to improve the benefits. However, current programming language, SOC platforms, business process modeling language, and tools support either manual selection or static binding of published services. There is a limitation on reconfiguring and redeploying the business process to deliver the expected services to each client. Therefore, dynamic selection is needed for composing appropriate services to service clients in a quick and flexible manner. In this paper, we propose Dynamic Selection Handler (DSH) on ESB. we present a design method of Dynamic Selection Handler which consists of four components; Invocation Listener, Service Selector, Service Binder and Interface Transformer. We apply appropriate design patterns for each component to maximize reusability of components. Finally, we describe a case study that shows the feasibility of DSH on ESB.

• Journal of Internet Computing and Services
• /
• v.8 no.3
• /
• pp.131-143
• /
• 2007

The current trends in information technology and intelligent systems use data mining techniques to discover patterns and extract rules from distributed databases. In distributed environment, the extracted rules from data mining techniques can be used in dynamic replications, adaptive load balancing and other schemes. However, transmission of large data through the system can cause errors and unreliable results. This paper proposes the intelligent distributed platform based on dynamic group binding using mobile agents which addresses the use of intelligence in distributed environment. The proposed grouping service implements classification scheme of objects. Data compressor agent and data miner agent extracts rules and compresses data, respectively, from the service node databases. The proposed algorithm performs preprocessing where it merges the less frequent dataset using neuro-fuzzy classifier before sending the data. Object group classification, data mining the service node database, data compression method, and rule extraction were simulated. Result of experiments in efficient data compression and reliable rule extraction shows that the proposed algorithm has better performance compared to other methods.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.8
• /
• pp.432-444
• /
• 2004

In this paper, we construct the TMO-based object group model on distributed environment, and analyze and evaluate the executability for distributed real-time service of our object group model by developing the distributed real-time application simulator applying the model. The Time-triggered Message-triggered Object(TMO) is a real-time server object having real-time property itself. The TMO-based object group is defined as a set of objects which logically reconfigured the physically distributed one or more TMOs on network by a given distributed application. For supporting group management of the server objects, the TMO-based object group we suggested provides the functions which register and withdraw the solver objects as a group member to an arbitrary object group, and also provides the functions which insert and delete the access rights of server objects from clients. Also, our model was designed and implemented to support the appropriate object selection and dynamic binding service for a single TMO as well as the duplicated TMOs, and to support the real-time scheduling service for the clients which are requesting the service. Finally, we developed the Defence System against Invading Enemy Planes(DSIEP) simulator as a practical example of distributed real-time application by applying our model, and evaluated the adaptability of distributed service strategies for the group components and the executability of real-time services that the TMO-based object group model provides.