• 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 Computing Science and Engineering
• /
• v.6 no.2
• /
• pp.89-104
• /
• 2012

In dynamic Web service environments, the performance of the Internet is unpredictable; the reliability and effectiveness of remote Web services are also unclear. Therefore, it can hardly be guaranteed that the quality of Web service (QoWS) attributes of Web services do not fluctuate with the dynamic Web service environments. When a composite service is planned in the context of dynamic service environments, there is another aspect which has not been taken into account by existing works, namely, concurrency - the fact that multiple requests to a composite service may arrive at the same time. Considering the dynamics of Web service environments and concurrency of requests, we propose in this paper a service selection scheme which adopts top-k dominating queries to generate a composition solution rather than only select the best composition solution for a given request. The experimental results have investigated the efficiency and effectiveness of our approach and shown that it outperforms baseline and traditional methods for service selection.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4398-4417
• /
• 2017

Multi-user Multiple-Input and Multiple-Output (MU-MIMO) has potential for prominently enhancing the capacity of wireless network by simultaneously transmitting to multiple users. User selection is an unavoidable problem which bottlenecks the gain of MU-MIMO to a great extent. Major state-of-the-art works are focusing on improving network throughput by using Channel State Information (CSI), however, the overhead of CSI feedback becomes unacceptable when the number of users is large. Some work does well in balancing tradeoff between complexity and achievable throughput but is lack of consideration of fairness. Current works universally ignore the rational utilizing of time resources, which may lead the improvements of network throughput to a standstill. In this paper, we propose TOUSE, a scalable and fair user selection scheme for MU-MIMO. The core design is dynamic-time-warping-based user selection mechanism for downlink MU-MIMO, which could make full use of concurrent transmitting time. TOUSE also presents a novel data-rate estimation method without any CSI feedback, providing supports for user selections. Simulation result shows that TOUSE significantly outperforms traditional contention-based user selection schemes in both throughput and fairness in an indoor condition.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.3
• /
• pp.891-910
• /
• 2021

Previous QoS-aware service composition methods mainly focus on how to generate composite service with the optimal QoS efficiently for a single request. However, in the real application scenarios, there are multiple service requests and multiple service providers. It is more important to compose services with suboptimal QoS and maintain the load balance between services. To solve this problem, in this paper, we propose a service composition method, named as dynamically change and balancing composition method (DCBC). It assumes that the QoS of service is not static, and the services can adjust the value of QoS to gain more opportunities to be selected for composition. The method mainly includes two steps, which are the preprocessing step and the service selection step. In the preprocessing step, a backward global best QoS calculation is performed which regarding the static and dynamic QoS respectively; then guided by the global QoS, the feasible services can be selected efficiently in the service selection step. The experiments show that the DCBC method can not only improve the overall quality of composite services but also guarantee the fulfill ratio of requests and the load balance of services.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1817-1836
• /
• 2020

Network convergence is considered as one of the key solutions to the problem of achieving future high-capacity and reliable communications. This approach overcomes the limitations of separate wireless technologies. Efficient interface selection is one of the most important issues in convergence networks. This paper solves the problem faced by users of selecting the most appropriate interface in the heterogeneous radio-access network (RAN) environment. Our proposed scheme combines a hierarchical evaluation of networks and game theory to solve the network-selection problem. Instead, of considering a fixed weight system while ranking the networks, the proposed scheme considers the service requirements, as well as static and dynamic network attributes. The best network is selected for a particular service request. To establish a hierarchy among the network-evaluation criteria for service requests, an analytical hierarchy process (AHP) is used. To determine the optimum network selection, the network hierarchy is combined with game theory. AHP attains the network hierarchy. The weights of different access networks for a service are calculated. It is performed by combining AHP scores considering user's experienced static network attributes and dynamic radio parameters. This paper provides a strategic game. In this game, the network scores of service requests for various RANs and the user's willingness to pay for these services are used to model a network-versus-user game. The Nash equilibria signify those access networks that are chosen by individual user and result maximum payoff. The examples for the interface selection illustrate the effectiveness of the proposed scheme.

• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.570-577
• /
• 2018

With the increasing number of network nodes, traditional client/server node selection mechanisms are under tremendous pressure. In order to select efficient cooperative nodes in a highly dynamic P2P network topology, this article uses greedy algorithm to translate the overall optimization into multiple local optimal problems, and to quickly select service nodes. Therefore, the service node with the largest comprehensive capacity is selected to reduce the transmission delay and improve the throughput of the service node. The final simulation results show that the node selection strategy based on greedy algorithm can effectively improve the overall performance of P2P streaming media system.

• International Journal of Computer Science & Network Security
• /
• v.22 no.3
• /
• pp.95-100
• /
• 2022

Cloud computing platform is a shared pool of resources and services with various kind of models delivered to the customers through the Internet. The methods include an on-demand dynamically-scalable form charged using a pay-per-use model. The main problem with this model is the allocation of resource in dynamic. In this paper, we have proposed a mechanism to optimize the resource provisioning task by reducing the job completion time while, minimizing the associated cost. We present the Cooperative Agents Dynamic Resource Allocation and Monitoring in Cloud Computing CADRAM system, which includes more than one agent in order to manage and observe resource provided by the service provider while considering the Clients' quality of service (QoS) requirements as defined in the service-level agreement (SLA). Moreover, CADRAM contains a new Virtual Machine (VM) selection algorithm called the Node Failure Discovery (NFD) algorithm. The performance of the CADRAM system is evaluated using the CloudSim tool. The results illustrated that CADRAM system increases resource utilization and decreases power consumption while avoiding SLA violations.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.510-516
• /
• 2008

In ubiquitous environment, there are no limits to utilize networks whenever and wherever you are. That pervasive networks are combined with the information devices and then create various services such as car navigation of LBS(location based service) and DMB(Digital Multimedia Broadcasting). As these kinds of services are getting more various, the complexity is also getting higher and ultimately the convergence will make people feel frustrated. One of the solutions is Context-Awareness[1] technology. User interface with context-awareness filters unnecessary information and prevents users from being blocked due to the massive information. In this paper, we describe the seamless service system based on location-awareness, which is a type of context-awareness. We developed the system based on UPnP AV Framework. This system provides the automatic terminal device selection for the nomadic user. The system establishes new connections for the ongoing streaming playback session with the new AV devices without substantial loss of playback so that the user can enjoy the seamless service. The AV device selection based on the user's location needs no user's intervention or notification so it achieves the improvement of usability and complexity.

• ETRI Journal
• /
• v.41 no.5
• /
• pp.574-584
• /
• 2019

A new Mirai variant found recently was equipped with a dynamic update ability, which increases the level of difficulty for DDoS mitigation. Continuous development of 5G technology and an increasing number of Internet of Things (IoT) devices connected to the network pose serious threats to cyber security. Therefore, researchers have tried to develop better DDoS mitigation systems. However, the majority of the existing models provide centralized solutions either by deploying the system with additional servers at the host site, on the cloud, or at third party locations, which may cause latency. Since Internet service providers (ISP) are links between the internet and users, deploying the defense system within the ISP domain is the panacea for delivering an efficient solution. To cope with the dynamic nature of the new DDoS attacks, we utilized an unsupervised artificial neural network to develop a hierarchical two-layered self-organizing map equipped with a twofold feature selection for DDoS mitigation within the ISP domain.

• Communications for Statistical Applications and Methods
• /
• v.10 no.3
• /
• pp.695-705
• /
• 2003

In this article, we propose a regression and correlation analysis via dynamic graphs and implement them in Java Web Start. For the polynomial relations between dependent and independent variables, dynamic graphics are implemented for both polynomial regression and spline estimates for an instant model selection. The results include basic statistics. They are available both as a web-based service and an application.