• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.11
• /
• pp.250-255
• /
• 2020

For the resolution of the latency problem of the cloud center-based cloud computing, fog computing was proposed that allows end devices to offload computations to nearby fog nodes. In the fog computing, virtualized service images are placed on fog nodes and, if service images are placed close to end devices, the duplicate service image placement problem may occur. Therefore, in this paper, we propose a service image placement mechanism based on the logical fog network that reduces duplicate service images by considering the pattern of collected service requests. For the performance evaluation of the proposed mechanism, through simulations, we compare ours with the on-demand mechanism placing a service image upon the receipt of a service request. We consider the performance factors like the number of service images, the number of non-accommodated service requests, and the network cost.

• Journal of Digital Contents Society
• /
• v.17 no.6
• /
• pp.479-487
• /
• 2016

In a Web 2.0 context, users are exposed to numerous smart devices and services that allow real-time interaction between users (or consumers) and developers (or producers). For the provisioning of new user-created services based on user's context, the data management of service creation experiences becomes a non-trivial task. This article introduces a data model for service creation and then proposes a service creation management architecture which enables new service creation using the data model, the management of the service creation data, and the semantic service discovery across internal/external service repositories. The article also explains the use of the proposed architecture with two different scenarios: home and mobile environments. The proposed architecture for service creation data management offers consistent and seamless handling of the service creation data throughout its usage lifecycle.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2711-2733
• /
• 2018

Minimizing power consumption in bandwidth limited optical traffic grooming networks is presented as a two-objective optimization problem. Since the main objective is to route a connection, the network throughput is maximized first, and then the minimum power consumption solution is found for this maximized throughput. Both transparent IP over WDM (Tp-IPoWDM) and translucent IP over WDM (Tl-IPoWDM) network may be applied to examine such bi-objective algorithms. Simulations show that the bi-objective algorithms are more energy-efficient than the single objective algorithms where only the throughput is optimized. For a Tp-IPoWDM network, both link based ILP (LB-ILP) and path based ILP (PB-ILP) methods are formulated and solved. Simulation results show that PB-ILP can save more power than LB-ILP because PB-ILP has more path selections when lightpath lengths are limited. For a Tl-IPoWDM network, only PB-ILP is formulated and we show that the Tl-IPoWDM network consumes less energy than the Tp-IPoWDM network, especially under a sparse network topology. For both kinds of networks, it is shown that network energy efficiency can be improved by over-provisioning wavelengths, which gives the network more path choices.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.9
• /
• pp.38-45
• /
• 2007

With the emergence of new applications, packet classification is essential for supporting advanced internet applications, such as network security and QoS provisioning. As the packet classification on multiple-fields is a difficult and time consuming problem, internet routers need to classify incoming packet quickly into flows. In this paper, we present multi-phase packet classification architecture using an internal buffer for fast packet processing. Using internal buffer between address pair searching phase and remained fields searching phases, we can hide latency from the characteristic that search times of source and destination header fields are different. Moreover we guarantee the improvement by using single entry caching. The proposed architecture is easy to apply to different needs owing to its simplicity and generality.

• Journal of Advanced Navigation Technology
• /
• v.14 no.4
• /
• pp.530-536
• /
• 2010

This paper proposes a QoS/QoE guaranteeing scheme by reassembling packets that have already been delivered to the end systems under the condition that there is no other way to fulfill user's QoS/QoE with the current network conditions. The proposed scheme is a QoS/QoE provisioning scheme that can be applied when IPTV streaming packets have not been consecutively received by the receiver. The receiving end system modifies the continuous counter field in the MPEG-2 Transport Stream and reassembles packets based on this information. In the simulation, broadcasting streaming environment has been implemented in order to verity the QoS/QoE performance of the proposed scheme under the good and poor network conditions.

• The Journal of the Korea Contents Association
• /
• v.13 no.12
• /
• pp.568-574
• /
• 2013

In recent years, IT companies offer various cloud services using hardware-based technologies or software-based technologies. User can access these cloud services without the constraints of location or devices. The technologies are virtualization, provisioning, and big data processing. However, security incidents are constantly occurring even with these techniques. Thus, many companies build and operate private cloud service to prevent the leak of critical data. If virtual environment are different according to user permission, many system are needed, and user should login several virtual system to execute an program. In this paper, I suggest the access control method for application software on virtual operating system using the Open Authentication protocol in the Cloud system.

• Journal of Korean Society of Environmental Engineers
• /
• v.38 no.10
• /
• pp.580-587
• /
• 2016

This study aims to estimate the values of freshwater ecosystem services from demand and supply perspectives. From demand side, unit-values of ecosystem services are derived from Environmental Valuation Information System (EVIS) and aggregated to 5 main watersheds in Korea. The derived unit-values are based on the willingness to pay estimates per household from stated preference methods. The nation-wide average total values of water quantity supply, water purification, and natural disaster control are estimated as 501.2, 410.4, and 242.4 billion won/year, respectively. From supply side, we examine the direct and indirect public expenditures (or investment) in 2013 to improve freshwater ecosystem services by the government. The total sum of government expenditures corresponds to 8,882 billion won in 2013, where 12.9, 81.3, 0.3 and 5.3% are spent to improve provisioning, regulating, supporting and cultural services, respectively, indicating that most efforts are concentrated in enhancing regulating services.

• International Journal of Contents
• /
• v.13 no.2
• /
• pp.29-34
• /
• 2017

Cloud computing is becoming an effective and efficient way of computing resources and computing service integration. Through centralized management of resources and services, cloud computing delivers hosted services over the internet, such that access to shared hardware, software, applications, information, and all resources is elastically provided to the consumer on-demand. The main enabling technology for cloud computing is virtualization. Virtualization software creates a temporarily simulated or extended version of computing and network resources. The objectives of virtualization are as follows: first, to fully utilize the shared resources by applying partitioning and time-sharing; second, to centralize resource management; third, to enhance cloud data center agility and provide the required scalability and elasticity for on-demand capabilities; fourth, to improve testing and running software diagnostics on different operating platforms; and fifth, to improve the portability of applications and workload migration capabilities. One of the key features of cloud computing is elasticity. It enables users to create and remove virtual computing resources dynamically according to the changing demand, but it is not easy to make a decision regarding the right amount of resources. Indeed, proper provisioning of the resources to applications is an important issue in IaaS cloud computing. Most web applications encounter large and fluctuating task requests. In predictable situations, the resources can be provisioned in advance through capacity planning techniques. But in case of unplanned and spike requests, it would be desirable to automatically scale the resources, called auto-scaling, which adjusts the resources allocated to applications based on its need at any given time. This would free the user from the burden of deciding how many resources are necessary each time. In this work, we propose an analytical and efficient VM-level scaling scheme by modeling each VM in a data center as an M/M/1 processor sharing queue. Our proposed VM-level scaling scheme is validated via a numerical experiment.

• KIISE Transactions on Computing Practices
• /
• v.23 no.5
• /
• pp.293-298
• /
• 2017

Recently, much research has been devoted to implementing and provisioning high-performance computing environment using clusters with multiple computers and high-performance networking technologies. In-memory based Key-Value stores, such as Redis or Memcached, are widely used in high performance cluster environments to improve the data processing performance. We can distribute data at different storage nodes, and each computing node can access it at a high speed using these In-memory based Key-Value stores. InfiniBand is a de-facto technology that is widely used to interconnect each node of a cluster. In this paper, we propose a new data pre-fetching scheme for Key-Value store based on high performance clusters to improve the performance. The proposed scheme utilizes the data transfer characteristics of InfiniBand. The results of the simulation show that the proposed scheme can reduce the data transfer time by up to about 28%.

• Journal of Korea Multimedia Society
• /
• v.10 no.4
• /
• pp.462-469
• /
• 2007

ATM protocol has the techniques such as cell discarding priority, traffic shaping and traffic policing. ATM based MPLS(Multiprotocol Label Switching) is discussed for its provisioning QoS commitment capabilities, traffic engineering and smooth migration for BcN using conventional ATM infra in Korea. This paper proposes preventive congestion control mechanism for detecting HTR(Hard To Reach) LSP(Label Switched Path) in ATM based MPLS systems. In particular, we decide HTR LSP using real time signaling information(etc., PTI,AIS/RDI) for applying HTR concept in circuit switching to ATM based MPLS systems and use those session gap and percentage based control algorithm that were used in conventional PSTN call controls. We concluded that it maximized the efficiency of network resources by restricting ineffective machine attempts. Proposed control can handle 208% call processing and more than 147% success call, than those without control. It can handle 187% BHCA(Busy Hour Call Attempts) with 100 times less than use of exchange memory.