• TTA Journal
• /
• s.76
• /
• pp.64-74
• /
• 2001

최근, 데이터 트래픽이 폭발적 증가와 함께 전통적인 전화 트랙픽을 양적으로 넘어서게 됨에 따라 정보 통신망은 이를 수용하기 위해서 전반적인 큰 변화를 겪고 있는 중이다. 가입자의 인터넷 요구 대역폭 및 QoS를 만족시키면서 패킷 전송과 라우팅이 처리되며, 경제적이고 단순한 광 네트워크를 구축하기 위해서는 IPOW(Internet Protocol Over WDM)가 가장 적합한 기술이라고 일반적으로 생각되고 있다. 초기에는 주로 장거리 점대점 간 대용량 전송에 기여하던 WDM(wavelength division multiplexing) 기술이 최근 들어 동적인 파장 및 대역 할당을 통해서 망 구성의 유연성과 생존성을 향상시키는데 적용됨에 따라, 광 전송기술과 더불어 광 스위칭 및 라우팅 기술의 중요성이 부각되고 있고 이에 관한 표준화 작업도 빠르게 진행되고 있다. 본 고는 IPOW 기술 및 동향을 간단히 살펴 보고, 광 스위칭/라우팅과 관련한 표준화 동향과 전망에 대하여 살펴 본다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.262-264
• /
• 2001

테이블의 모든 레코드들을 삭제하는 연산과 그 연산을 취소하는 작업은 그 수행에 드는 비용이 매우 크다. 상용 데이타베이스 관리 시스템들은 테이블의 모든 레코드들을 삭제하는 연산을 신속하게 수행하기 위하여 TRUNCATE TABLE문을 제공한다. 그 문을 수행하면 레코드들을 개별적으로 삭제하지 않고 그 화일에 할당된 디스크 공간을 반환하며 그 삭제 연산을 독립된 트랜잭션으로 처리하여 즉시 완료시킨다. 따라서, 그 연산은 일단 실행되고 나면 복귀가 불가능하다. 본 논문은 DELETE문을 WHERE절 없이 사용하는 경우에 대하여 모든 레코드들을 삭제하고자 하는 화일과 동일한 구조를 가지는 하나의 빈(empty)화일을 생성하고 기존 화일과 새로이 생성한 화일 간에 화일 설명자의 내용과 디스크 공간을 교체만 후, 새로이 생성한 화일 자체를 삭제함으로써 로깅 부담을 줄이면서 신속히 모든 레코드들을 삭제하고 그 연산을 복귀할 수 있도록 하는 기법을 제시한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.205-207
• /
• 2013

멀티 클라우드 서비스 제공자가 연동된 환경에서 각 데이터 센터에 위치하고 있는 물리 노드들의 위치에 따라서 클라우드 서비스 사용자와 연결된 네트워크 속도에 차이가 발생하고 이에 의해서 각 물리 노드에서 생성되는 가상 자원 인스턴스의 작업 처리 성능에도 영향을 미치게 된다. 특히 웹 어플리케이션과 같은 네트워크 성능에 의존도가 높은 응용의 경우 이에 대한 성능 영향의 정도가 매우 크게 증가한다. 본 논문에서는 이러한 문제를 해결하기 위하여 클라우드 서비스 사용자와 가상 자원 인스턴스간의 물리적인 거리 및 동적인 네트워크 상황을 고려한 적응적 가상 자원 할당 기법을 소개한다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.10
• /
• pp.24-33
• /
• 1990

Since a number of welding points are distributed in an automobile part, the number of welding points alloted to each robot are large. So, there is an increasing need of an optimal sequence planning to minimize the total welding time. In this paper, an off-line programming scheme for effective teaching of a spot welding robot is presented. A collision free, optimal welding sequence planning is done through applying the modified Traveling Salesman Problem algorithm. Also, a data extraction method from an existing general CAD system is presented for reuse of the existing exact model data produced by a model designer and easy constructing the world model data base. The result show that the proposed system could enhance the efficiency of spot welding robot in automobile industry.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.4
• /
• pp.75-90
• /
• 2009

Improvement of productivity and efficient process management need to define the problem of the previous work. If it takes long time to gather necessary information, it becomes difficult to continuously manage processes to satisfy customers' needs and to enhance business efficiency. This paper proposes methods and a context awareness system for decision making to solve problems originated in management of manufacturing process through real-time information acquisition. We implement the context awareness by suggesting decision logics that automatically classify works with acquired information. And we also implement a system for case study which makes workers recognize problems and notifies instructions to them. Consistency between real object and stored data and continuous process monitoring with this system could find inefficient resources or delayed works, resolve them and improve processes efficiency.

• KOREAN JOURNAL OF PACKAGING SCIENCE & TECHNOLOGY
• /
• v.28 no.3
• /
• pp.183-192
• /
• 2022

With the growth of the packaging industry, demand on the packaging printing comes in various forms. Customers' orders are diversifying and the standards for quality are increasing. Offset printing is mainly used in the packaging printing since it is easy to print in large quantities. However, productivity of the offset printing decreases when printing various order. This is because it takes time to change colors for each printing unit. Therefore, scheduling that minimizes the color replacement time and shortens the overall makespan is required. By the existing manual method based on workers' experience or intuition, scheduling results may vary for workers and this uncertainty increase the production cost. In this study, we propose an automated scheduling method of parallel offset printing process for packaging printing. We decompose the original problem into assigning and sequencing orders, and ink arrangement for printing problems. Vehicle routing problem and assignment problem are applied to each part. Mixed integer programming is used to model the problem mathematically. But it needs a lot of computational time to solve as the size of the problem grows. So guided local search algorithm is used to solve the problem. Through actual data experiments, we reviewed our method's applicability and role in the field.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.105-113
• /
• 2005

In this paper, through the implementation of the application service, we evaluated the feasibility and availability of the staged application service platform, which is based on the sharing of the PVM cluster. Application service platform provides three managers for dividing the request processing steps into two stages, such as a request processing stage and a service providing stage. Three managers and its relation to the divided stages are as follows, service manager and load manager to distribute the request in front-end server for a request processing stage, job manager in clustered(back-end) servers for a service providing stage. The experiment shows that the staged application service platform provides more stable and scalable characteristics and better performance improvement on the dynamic load changes than the single server system. And also it shows that real application service system can be implemented easily without modification of the proposed service platform.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.39-48
• /
• 2013

A cloud system has to deal with highly variable workloads resulting from dynamic usage patterns in order to keep the QoS within the predefined SLA. Aside from the aspects regarding services, another emerging concern is to keep the energy consumption at a minimum. This requires the cloud providers to consider energy and performance trade-off when allocating virtualized resources in cloud data centers. In this paper, we propose a resource provisioning approach based on dynamic thresholds to detect the workload level of the host machines. The VM selection policy uses utilization data to choose a VM for migration, while the VM allocation policy designates VMs to a host based on its service reputation. We evaluated our work through simulations and results show that our work outperforms non-power aware methods that don't support migration as well as those based on static thresholds and random selection policy.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.157-159
• /
• 2015

Most cargo truck drivers of small and medium-sized firms often process their works using a paper document containing the transport-related information. However, these paper documents that are used to plan route or check the list for cargo loading have the potential to be lost or damaged. Also, it is not easy to manage cargo using certain devices not the paper document in case of small and medium-sized firms because the budget is limited. In this paper, we implement the cargo transportation system for desktop and android-based application in order to solve these problems. A manager for cargo transportation is provided a simple interface to manage the transport-related information through the desktop application. A cargo truck driver is provided functions such as plan route and make a call to manage the transport-related information through the android-based application. This system is implemented to improve the efficiency of cargo transportation.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.3
• /
• pp.73-80
• /
• 2010

The advancement of communication and networking technologies has enabled e-science and commercial application that often require the transport of large volume of data over wide-area network. Schedulable high-bandwidth low-latency connectivity is required to transport the large volume of data. But the public Internet does not provide predictable service performance. Especially, if data providers and users are far away, dedicated bandwidth channels are needed to support remote process efficiently. Currently several network research projects are in progress to develop dedicated connectionsy sA bandwidth scheduler computes an user requested path based on network topology information and link bandwidth allocationsy In this paper, we have proposed an efficient algorithm for finding the earliest time interval when minimum bandwidth and duration are giveny Our algorithm is experimentally compared with the known algorithm.