• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.614-619
• /
• 2007

The importance of simulation of plastic flow in the injection mold is increasing as the parts are more complex, but the small-scale enterprises can't afford to invest for the infra individually. CAE (Computer Aided Engineering) service was naturally born based on these needs. This paper presents the engineering collaboration model between the large and the small/medium enterprises in the field of injection molds. Based on the engineering collaboration hub and CAE service, small-scale enterprises could research the necessary technology and develop the proper products. The analysis results of CAE are provided by the integrated visualization system on the web. This paper also deals with the delivery shorting process of CAE service for electric/electronic parts which should meet the needs of customers as soon as possible.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4950-4966
• /
• 2015

Cloud providers now face the problem of estimating the amount of computing resources required to satisfy a future workload. In this paper, a virtual machine provisioning (VMP) mechanism is designed to adapt workload fluctuation. The arrival rate of forthcoming jobs is predicted for acquiring the proper service rate by adopting an exponential smoothing (ES) method. The proper service rate is estimated to guarantee the service level agreement (SLA) constraints by using a diffusion approximation statistical model. The VMP problem is formulated as a facility location problem. Furthermore, it is characterized as the maximization of submodular function subject to the matroid constraints. A greedy-based VMP algorithm is designed to obtain the optimal virtual machine provision pattern. Simulation results illustrate that the proposed mechanism could increase the average profit efficiently without incurring significant quality of service (QoS) violations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1006-1022
• /
• 2010

In this paper, a cross-layer resource allocation mechanism is proposed for wireless multimedia service. In particular, a game theory based on quality of service (QoS) for multimedia users is introduced to deal with the fairness of network resource allocation in wireless networks. Moreover, the channel states of wireless users are additionally regarded under the cross-layer design in WiMAX environment. In details, the bargaining solution is adopted to discover the efficient and fair resource allocation strategy for multimedia service in considering QoS in the peak signal-to-noise ratio (PSNR) and the channel states in the carrier-to-interface ratio (CINR). The proposed mechanism is illustrated and evaluated by simulation results of transmitting video sequences in WiMAX environment.

• Proceedings of the Korea Institute of Fire Science and Engineering Conference
• /
• 2011.11a
• /
• pp.143-146
• /
• 2011

2009년 11월 14일 발생한 부산 실내사격장 화재와 관련하여 조사내용을 토대로 화재 시뮬레이션용 전선유체역학 모델인 FDS를 이용하여 재현하였으며, 시뮬레이션 결과와 화재당시 녹화된 CCTV 영상을 비교하였다. 2층 발사실에서 시작된 화재는 급격히 연소가 진행되어 약 3초 후에 휴게실로 확산되며, 약 7초 후에는 계단 및 1층 홀을 지나 사람들이 통행하는 인도에까지 연기가 분출되는 것으로 나타났다. 시뮬레이션 결과는 2층 발사실과 휴게실에 녹화된 CCTV 영상 및 1층 홀 옆의 귀금속가게에 녹화된 CCTV 영상과 거의 일치하였다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.4
• /
• pp.14-19
• /
• 2005

In general, cell transmission delay is more sensitive for real time video service rather than cell losses in a wireless ATM network. Existing handoff schemes, which are emphasizing the prevention of cell losses, have limitations in cell transmission delay to satisfy QoS. In this paper, we propose a scheme to minimize transmission delay generated during the handoff and to maintain the sequence of cells. Transmission delay can be reduced by transmitting ATM cells with low CLP(i.e., CLP=0) prior to others and by discarding cells with high CLP(i.e., CLP= 1). The simulation results show that the proposed scheme is suitable for delay sensitive real time VBR service as well as fast handoff by giving high CLP to less meaningful MPEG frames.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.53-56
• /
• 2002

In this paper, we study the network structure that can guarantee the end-to-end quality of service in the Explicit multicast network. In order to guarantee the end-to-end quality of service, we adopt the end-to-end measurement based admission control (EMBAC) scheme. For the effective measurement of the network state and minimum influence on the current data traffic, the queue structure, which the drop precedence in assured forwarding (AF) Per hop behavior (PHB) of the differentiated service (Diffserv) is applied to, is proposed. Through a simulation, we show that EMBAC can make tile controlled load service in tile AF PHB applied Xcast network, and the qualify of the admitted traffic is guaranteed. In addition, the performance of the EMBAC is changing according to the selling parameter of AF PHB.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.7
• /
• pp.14-21
• /
• 1998

In providing with low speed multimedia services, a call blocking rate is greatly varied according to the transmission rate, and thereofr, the call blocking rate is remarkably increased for a service having a high transmission rate compared to a service having a low transmission rate. This paper presents three methods of solving this problem; Packing Scheme in which available channels distributed to each frequency channel are concentrated on one frequency channel and a call having a high transmission rate is assigned to the frequency channel; Queuing Scheme in which queuing is assigned to calls under service is temporarily reduced and a call having a high transmission rate is allowed. The result of performance analysis for 13 Kbps and 128 Kbps service through computer simulation showed that the call blocking rate for 128 Kbpx service was reduced by tens of percent accoring to loads.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.3
• /
• pp.757-766
• /
• 2007

Location services are used in mobile ad hoc and hybrid networks to locate either the geographic position of a given node in the network or a data item. One of the main usages of position location services is presented in location based routing algorithms. In particular, geographic routing protocols can route messages more efficiently to their destinations based on the destination node's geographic position, which is provided by a location service. In this paper, we propose an adaptive location service on the basis of fuzzy logic called FHLS (Fuzzy Hierarchical Location Service) for mobile ad hoc networks. The adaptive location update scheme using the fuzzy logic on the basis of the mobility and the call preference of mobile nodes is used by the FHLS. The performance of the FHLS is to be evaluated by a simulation, and compared with that of existing HLS scheme.

• Journal of information and communication convergence engineering
• /
• v.19 no.4
• /
• pp.257-262
• /
• 2021

Providing web services to users has become expensive in recent times. For better web services, a web server is provided with high-performance technology. To achieve great web service experiences, tools such as general-purpose graphics processing units (GPGPUs), artificial intelligence, high-performance computing, and three-dimensional simulation are widely used. However, graphics processing units (GPUs) are used in high-speed operations and have limited general applications. In this study, we developed a task queue in a GPU to improve the performance of a web service using a multiprocessor and studied how to receive and process user requests in bulk. We propose the use of a GPGPU-based task queue to process user requests more than GPGPU based a central processing unit thread, and to process more GPU threads on task queue at about 136% to 233%, and proved that the proposed method is effective for web service.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.2
• /
• pp.123-128
• /
• 2009

In ubiquitous computing environments, service discovery to search for an available service is an important issue. In this paper, we propose an efficient service discovery scheme that is combined a node id-based clustering service discovery scheme and a P2P caching-based information spreading scheme. To search quickly a service, proposed scheme store key information in neighbor's local cache and search services using it's information. We do not use a central look up server and do not rely on flooding. Through simulation, we show that the proposed scheme improves the performance of response time and network load compared to other methods.