• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.142-144
• /
• 2016

Recent promising technologies of the manufacturing sector interest, and the interest in 3D printing that is expected to cause a huge ripple effect rapidly, and various types of products advertised in accordance with the falling price of 3D printers is spreading. However, the personal 3D printers that are currently being advertised is used for Injection output of the simple type that does not require a high processing precision in accordance with the limitation of technical performance, and consumer satisfaction is very low. In this paper, we propose a 3D printer, 3D precision to overcome existing limitations in the way the printer's high SLA 3D printer that combines injection method and the LSU (Laser Scanning Unit) in the office laser printer polygon mirror scanning method. 3D printers which are proposed to improve the accuracy and manufacturing speed is expected to replace the existing entry-level 3D printer.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.6
• /
• pp.1892-1912
• /
• 2022

With the massive demand and growth of cloud computing, virtualization plays an important role in providing services to end-users efficiently. However, with the increase in services over Cloud Computing, it is becoming more challenging to manage and run multiple Virtual Machines (VMs) in Cloud Computing because of excessive power consumption. It is thus important to overcome these challenges by adopting an efficient technique to manage and monitor the status of VMs in a cloud environment. Reduction of power/energy consumption can be done by managing VMs more effectively in the datacenters of the cloud environment by switching between the active and inactive states of a VM. As a result, energy consumption reduces carbon emissions, leading to green cloud computing. The proposed Efficient Dynamic VM Scheduling approach minimizes Service Level Agreement (SLA) violations and manages VM migration by lowering the energy consumption effectively along with the balanced load. In the proposed work, VM Scheduling for Efficient Dynamically Migrated VM (VMS-EDMVM) approach first detects the over-utilized host using the Modified Weighted Linear Regression (MWLR) algorithm and along with the dynamic utilization model for an underutilized host. Maximum Power Reduction and Reduced Time (MPRRT) approach has been developed for the VM selection followed by a two-phase Best-Fit CPU, BW (BFCB) VM Scheduling mechanism which is simulated in CloudSim based on the adaptive utilization threshold base. The proposed work achieved a Power consumption of 108.45 kWh, and the total SLA violation was 0.1%. The VM migration count was reduced to 2,202 times, revealing better performance as compared to other methods mentioned in this paper.

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

Energy-efficient virtual resource allocation algorithm has become a hot research topic in cloud computing. However, most of the existing allocation schemes cannot ensure each type of resource be fully utilized. To solve the problem, this paper proposes a virtual machine (VM) allocation algorithm on the basis of multi-dimensional resource, considering the diversity of user's requests. First, we analyze the usage of each dimension resource of physical machines (PMs) and build a D-dimensional resource state model. Second, we introduce an energy-resource state metric (PAR) and then propose an energy-aware multi-dimensional resource allocation algorithm called MRBEA to allocate resources according to the resource state and energy consumption of PMs. Third, we validate the effectiveness of the proposed algorithm by real-world datasets. Experimental results show that MRBEA has a better performance in terms of energy consumption, SLA violations and the number of VM migrations.

• Weed & Turfgrass Science
• /
• v.4 no.4
• /
• pp.338-347
• /
• 2015

Reinforcement cells are used to aid grass growth and taken together, this serves to extend greenery beyond the conventional spaces of lawns, tree pits, gardens, and parks, and is advantageous to urban cities since space for greening is often limited. Drought has variable effects on plant life and the resilience of turf to drought resistance also varies with species. Changes in photosynthetic ability were more pronounced for media rather than grass species. The media of sand without organic matter was found to be least suited for drought resistance. Normalized difference vegetation index (NDVI) and digital image analysis (DIA) data were generally in favour of Zoysia species as oppose to A. compressus. In A. compressus, selective traits such as, a more extensive root system and lower specific leaf area (SLA) were not an underlying factor that assisted this grass with enhanced drought resistance. Generally, WUE was found to be strongly related to plant characterises such as overall biomass, photosynthetic features as well as the lushness indexes, and specific leaf area. This study found a strong relationship between WUE and a suite of plant characteristics. These traits should serve as useful selection criteria for species with the ability to resist water stress.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4B
• /
• pp.444-454
• /
• 2004

To support diverse transmission requirements of multimedia applications, Quality of Service (QoS) should be provided in the Internet, where only the best-effort service is available. In this paper, we describe our recent effort on the implementation and verification of an extendable and flexible QoS allocation and resource management system based on the bandwidth broker model for realizing the IETF differentiated service (DiffServ). Focusing on the bandwidth issue over single administrative domain, the implemented system provides real-time resource reservation and allocation, delayed call admission control, simple QoS negotiation between sewer and users, and simple resource monitoring. The implemented system is verified by evaluating the performance of a resource-intensive application over the real-world testbed network.

• Journal of the Korean Society for information Management
• /
• v.24 no.3
• /
• pp.21-41
• /
• 2007

IT outsourcing has become a critical component of organizations, but improper expectations, ambiguous contracts and unclear goals frequently cause the failure of IT outsourcing. Especially we have to be concerned about the uncareful management of customer-supplier relationships based on a psychological contract perspective. This study focuses on the obligations of contractual parties for IT outsourcing which influence the outsourcing relationship(OR) and the successful performance of IT outsourcing(OP). The supplier obligations consist of the achievable infrastructure(S1) and capability(S2), and the customer obligations is composed of the acceptable environment(C1) and acceptability(C2) for IT outsourcing. This paper shows that the S1, S2, and C2 have an effect on the OR, the OR on the OP, and the S2 also on the OP directly. The four components of customer-supplier obligations are mutually related to each other. What is more, we must notice that the S2 has strong connections with the C2.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4C
• /
• pp.461-471
• /
• 2004

Recently, subscribers have strong desire to get QoS based personalized services in high-speed Internet access. Service providers have been rapidly replacing ADSL, cable broadband access networks with Metro-Ethernet based VDSL. But, it is difficult for Motto-Ethernet based broadband access networks to provide QoS based personalized services, because already deployed network elements cannot distinguish subscribers by specific traffic characteristics. In this paper, when the access network has tree topology, we show that it is possible to provide QoS for each downstream flow with only per flow traffic shaping at the edge node without QoS functions in access networks. In order to show that our suggested scheduling algorithm at the edge node can support the assured service in tree topology access networks, we evaluated its performance by simulation. The suggested scheduling algorithm can shape per-flow traffic based on the maximum bandwidth, and guarantees minimum bandwidth per flow by modifying the DRR scheduler. Simulation results show that congestion and loss in the access network elements are greatly reduced, TCP performance is highly enhanced and loss for assured CBR service flows is reduced by only shaping per-flow traffic at the edge node using our proposed scheduling algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.711-721
• /
• 2004

To provide the end-to-end service differentiation for assured services, the random early demotion and promotion (REDP) marker in the edge router at each domain boundary monitors the aggregate flow of the incoming in-profile packets and demotes in-profile packets or promotes the previously demoted in-profile packets at the aggregate flow level according to the negotiated interdomain service level agreement (SLA). The REDP marker achieves UDP fairness in demoting and promoting packets through random and early marking decisions on packets. But, TCP fairness of the REDP marker is not obvious as fur UDP sources. In this paper, to improve TCP fairness of the REDP marker, we combine a dropper with the REDP marker. To make packet transmission rates of TCP flows more fair, at the aggregate flow level the combined dropper drops incoming excessive in-profile packets randomly with a constant probability when the token level in the leaky bucket stays In demotion region without incoming demoted in-profile packets. It performs a dropping in the demotion at a domain boundary only if there is no prior demotion. The concatenate dropping at multiple domains is avoided to manifest the effect of a dropping at a domain boundary on TCP fairness. We experiment with the REDP marker with the combined dropper using ns2 simulator for TCP sources. The simulation results show that the REDP marker with the combined dropper improves TCP fairness in demoting and promoting packets by generating fair demoted in-profile traffic compared to the REDP marker. The effectiveness of the selected drop probability is also investigated with showing its impact on the performance of the REDP marker with the combined dropper.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.8
• /
• pp.335-342
• /
• 2013

Nowadays, the traffic type and behavior are extremely diverse due to the growth of network speed and the appearance of various services on Internet. For efficient network operation and management, the importance of application-level traffic identification is more and more increasing in the area of traffic analysis. In recent years traffic identification methodology using statistical features of traffic flow has been broadly studied. However, there are several problems to be considered in the identification methodology base on statistical features of flow to improve the analysis accuracy. In this paper, we recognize these problems by analyzing the ground-truth traffic and propose the solution of these problems. The four problems considered in this paper are the distance measurement of features, the selection of the representative value of features, the abnormal behavior of TCP sessions, and the weight assignment to the feature. The proposed solutions were verified by showing the performance improvement through experiments in campus network.

• The KIPS Transactions:PartC
• /
• v.18C no.4
• /
• pp.243-250
• /
• 2011

Nowadays, the traffic type and behavior are extremely diverse due to the appearance of various services on Internet, which makes the need of traffic identification important for efficient operation and management of network. In recent years traffic identification methodology using statistical features of flow has been broadly studied. We also proposed a traffic identification methodology using payload size distribution in our previous work, which has a problem of low completeness. In this paper, we improved the completeness by solving the PSD conflict using IP and port. And we improved the accuracy by changing the distance measurement between flow and statistic signature from vector distance to per-packet distance. The feasibility of our methodology was proved via experimental evaluation on our campus network.