• Journal of the Korea Society of Computer and Information
• /
• v.14 no.11
• /
• pp.145-157
• /
• 2009

OSGi enables services to be dynamically discovered through its service registry for fostering interactions among themselves, positioning itself as one of the most prominent SOA technologies. Web Services also provide a mature technical base of open business services being employed over the Internet and allow more value-added applications to be built up from component services. In this paper, we propose a new architecture, built on the concept of dynamic service binding, to support interbred service compositions of OSGi and Web Services. Web Services are imported into OSGi domains, and the compositions are described in WS-BPEL language. The support for crossbred compositions of OSGi services and Web Services opens up a new opportunity of a wider range of applications beyond their respective traditional target domains of home gateways in LAN environments and business applications in global Internet environments.

• The KIPS Transactions:PartB
• /
• v.15B no.5
• /
• pp.465-476
• /
• 2008

To provide autonomous and dynamic services for users in a ubiquitous environment where heterogeneity, mobility and variability are main characteristics, an efficient service description/structuring mechanism and a service composition method are essential. Service composition can consider context in real-time and compose appropriate services. In this research, we propose a mechanism for extracting services from a specific domain and structuring them into hierarchical service ontology. Each service is described using the proposed service specification. Based on this service ontology, users can represent their goals using various abstraction levels of services, and then our service overloading method enables to invoke the most appropriate service at the execution time. Moreover, we present a method which can discovery an alternative service by referencing the service ontology, when the requested service is not available. The experimental result shows that our service ontology could improve the success probability of users' goals and reduce service binding time compare to using just an unstructured list of services.

• Journal of KIISE:Software and Applications
• /
• v.41 no.8
• /
• pp.569-579
• /
• 2014

In a tactical-edge environment, where multiple weapon resources are coordinated together via services, it is essential to make an efficient binding between an abstract service and a resource that are needed to execute composite services for accomplishing a given mission. However, the tactical network that is used in military operation has low bandwidth and a high rate of packet loss. Therefore, communication overhead between services must be minimized to execute composite services in a stable manner in the tactical network. In addition, a tactical-edge environment changes dynamically, and it affects the connectivity and bandwidth of the tactical network. To deal with these characteristics of the tactical network we propose two service-resource reallocation methods which minimize the communication overhead between service gateways and effectively manage neutralization of gateways during distributed service coordination. We compared the effectiveness of these two - methods in terms of total communication overhead between service gateways and resource-allocation similarity between the initial resource allocation and the reallocation result.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.12
• /
• pp.620-627
• /
• 2017

An open sharing market is a market providing a sharing business. It provides open sharing services handling various products, unlike existing sharing services providing specific products. Sharing under an open sharing market can include all products that are difficult for customers to deal with, and provides fluidity of trade through negotiating sharing periods and costs among sharers. There are many variant elements when you provide sharing services for various products. Therefore, in this paper, we propose an extensible architecture that can reflect the variant elements in open sharing markets. We expect the proposed architecture can continuously improve the extensibility of sharing services for various products, because we design sharing services as components to efficiently manage and provide various sharing services, and provide dynamic binding of variant elements.

• Journal of Internet Computing and Services
• /
• v.12 no.1
• /
• pp.11-25
• /
• 2011

In ubiquitous computing environment, OSGi has applied to many areas such as digital mobile phones, vehicles, telematics, embedded appliances, residential gateways, industrial computers, desktop PCs, and high-end servers including mainframes. Therefore, interoperability is required for remote OSGi services which are built on various devices. In this paper, we proposed a method which was able to interoperate remote OSGi services using RMI paradigm. RMI is a representative middleware technology in distributed computing environment. The suggested method is based on the standard OSGi technology. It is possible to provide remote OSGi service registration, finding, and binding methods which were suitable for the OSGi service-oriented architecture. We also provided reliability of the dynamic remote OSGi services by maintaining consistent properties of them, and we could provide location transparency of the remote OSGi services by generating proxy bundles and proxy services dynamically.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.473-476
• /
• 2003

Nowaday, Internet is doing the role of a large distributed information service tenter and various information and database servers managing it are in distributed network environment. However, the we have several difficulties in deciding the server to disposal input data depending on data properties. In this paper, we designed server mining mechanism and Intellectual data mining system architecture for the best efficiently dealing with input data pattern by using neural network among the various data in distributed environment. As a result, the new input data pattern could be operated after deciding the destination server according to dynamic binding method implemented by neural network. This mechanism can be applied Datawarehous, telecommunication and load pattern analysis, population census analysis and medical data analysis.

• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.71-83
• /
• 2005

In this paper, we developed the Distributed Programming Developing Tool(DPDT) which can make distributed application program efficiency based on the distributed object group framework supporting group management and dynamic binding for object resources requested from clients on distributed systems. The distributed object group framework we constructed provides not only the group register/withdraw, the access right and the name/property services for server objects from a point of view of group management services, but also dynamic binding, replicated object supporting, load balance, and federation among the object groups from a point of view of the supporting services of distributed application, When developing distributed application, by using our tool, server programming developer implements objects in each server system, next registers the properties to need for service provision to the object group. Client programming developer can also develop client program easily by obtaining the access right for the object or the object group and using the properties of objects with the access right permitted to the client. For providing above application developing environment in this paper. we described the definition of object group, the architecture of the distributed object group framework which our tool supports, and its functionalities, then specified the 3 GUI environments of DPDT implemented for providing efficient interfaces between the distributed object group and distributed applications. Finally, by using the DPDT, we showed the group register/withdraw and the access right grant procedure of objects which are server programs, the developing process of client program, and the executing results of the distributed application developed.

• Journal of KIISE:Software and Applications
• /
• v.34 no.5
• /
• pp.431-446
• /
• 2007

Executable composite Web services are selected by binding a given abstract workflow with the specific Web services that satisfy given QoS requirements. Considering the rapidly increasing number of Web services and their highly dynamic QoS environment, the fast selection of composite services is important. This paper presents a method for quality driven comosite Web services selection based on a workflow partition strategy. The proposed method partitions an abstract workflow into two sub-workflows to decrease the number of candidate services that should be considered. The QoS requirement is also decomposed for each partitioned workflow. Since the decomposition of a QoS requirement is based on heuristics, the selection might fail to find composite Web services. To avoid such a failure, the tightness of a QoS requirement is defined and a workflow is determined to be partitioned according to the tightness. A mixed integer linear programming is utilized for the efficient service selection. Experimental results show that the success rate of partitioning is above 99%. Particularly, the proposed method performs faster and selects composite services whose qualities are not significantly different (less than 5%) from the optimal one.