• Journal of Internet Computing and Services
• /
• v.24 no.2
• /
• pp.1-10
• /
• 2023

The Multi-access Edge Computing (MEC) paradigm equips network edge telecommunication infrastructure with cloud computing resources. It seeks to transform the edge into an IT services platform for hosting resource-intensive and delay-stringent services for mobile users, thereby significantly enhancing perceived service quality of experience. However, erratic user mobility impedes seamless service continuity as well as satisfying delay-stringent service requirements, especially as users roam farther away from the serving MEC resource, which deteriorates quality of experience. This work proposes a deep reinforcement learning based service mobility management approach for ensuring seamless migration of service instances along user mobility. The proposed approach focuses on the problem of selecting the optimal MEC resource to host services for high mobility users, thereby reducing service migration rejection rate and enhancing service availability. Efficacy of the proposed approach is confirmed through simulation experiments, where results show that on average, the proposed scheme reduces service delay by 8%, task computing time by 36%, and migration rejection rate by more than 90%, when comparing to a baseline scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.7
• /
• pp.512-518
• /
• 2013

A resource allocation algorithm has a high impact on user satisfaction as well as the ability to accommodate and process services in a distributed cloud computing. In other words, service rejections, which occur when datacenters have no enough resources, degrade the user satisfaction level. Therefore, in this paper, we propose a resource allocation algorithm considering the cloud domain's remaining resources to minimize the number of service rejections. The resource allocation rate based on Q-Learning increases when the remaining resources are sufficient to allocate the maximum allocation rate otherwise and avoids the service rejection. To demonstrate, We compare the proposed algorithm with two previous works and show that the proposed algorithm has the smaller number of the service rejections.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.11a
• /
• pp.26-30
• /
• 2006

Internet phone service is a new service technology that provides voice call services through Internet not through the pre-existing PSTN. It enables a cheap voice call service regardless of distance. We may expect that the Internet phone service may substitute for the voice call service through the PSTN, but not in a short period. There are several problems to be solved for this transition, such as, voice call quality, numbering scheme, billing, standardization, and support of several functions. In this paper, we provided and designed a UA (User Agent) that can support functions regarding voice call, such as call forwarding, auto-connection, call rejection and restriction of individual call, using SIP (Session Initiation Protocol) which is proposed by SIP-Working Group as the standard Internet phone service management protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.8
• /
• pp.1958-1969
• /
• 1996

This paper proposed a new approach to adaptive call admission control based on a neural network for multiple service classes with different quality of service (QoS) in the ATM-based Broadband Integrated Services Digital Networks. the proposed method extend Hiramatsu's neural network based "leaky pattern table" method for the single QoS[1, 2, 3] to deal with multiple services with different QoS by constructing multiple pattern tables based on each service's acceptance or rejection at the call set-up requests, and by simultaneously controlling each service's QoS according to the target QoS of the service and the trunk capacity. Computer simulation results on two service classes with different traffic characteristics and different cell loss rates as QoS, highlight good performance and effectiveness of the proposed call admission controller for multiple service classes.e classes.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.3
• /
• pp.3-9
• /
• 1999

This paper presents the study on the rejection capability based on anti-phone modeling for vocabulary independent speech recognition system. The rejection system detects and rejects out-of-vocabulary words which were not included in candidate words which are defined while the speech recognizer is made. The rejection system can be classified into two categories by their implementation methods, keyword spotting method and utterance verification method. The keyword spotting method uses an extra filler model as a candidate word as well as keyword models. The utterance verification method uses the anti-models for each phoneme for the calculation of confidence score after it has constructed the anti-models for all phonemes. We implemented an utterance verification algorithm which can be used for vocabulary independent speech recognizer. We also compared three kinds of means for the calculation of confidence score, and found out that the geometric mean had shown the best result. For the normalization of confidence score, usually Sigmoid function is used. On using it, we compared the effect of the weight constant for Sigmoid function and determined the optimal value. And we compared the effects of the size of cohort set, the results showed that the larger set gave the better results. And finally we found out optimal confidence score threshold value. In case of using the threshold value, the overall recognition rate including rejection errors was about 76%. This results are going to be adapted for stock information system based on speech recognizer which is currently provided as an experimental service by Korea Telecom.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1413-1415
• /
• 2004

This paper proposes a SVM(Support Vector Machine) training algorithm to control a service robot with voice command. The service robot with a stereo vision system and dual manipulators of four degrees of freedom implements a User-Dependent Voice Control System. The training of SVM algorithm that is one of the statistical learning theories leads to a QP(quadratic programming) problem. In this paper, we present an efficient SVM speech recognition scheme especially based on less learning data comparing with conventional approaches. SVM discriminator decides rejection or acceptance of user's extracted voice features by the MFCC(Mel Frequency Cepstrum Coefficient). Among several SVM kernels, the exponential RBF function gives the best classification and the accurate user recognition. The numerical simulation and the experiment verified the usefulness of the proposed algorithm.

• Korean Management Science Review
• /
• v.26 no.3
• /
• pp.11-21
• /
• 2009

In this paper, we proposed some valuable analysis results of cultivation campaign marketing in A mobile telephone company. The cultivation campaign marketing is a new outbound TM campaign strategy composed of 4 steps for new subscribers. During the analyses, attrition rate of A mobile company, outbound TM rejection rate, contact rate/call success rate and additional service attrition rate after subscription are measured as an effect of cultivation campaign. The results showed that there were no statistical significance in improving retention rate between customers experienced 4 step cultivation campaign and control group. However, the cultivation campaign had a better effect on improving response rate and success of selling additional service product of mobile company compared to general selling campaign. This is because cultivation campaign group had been taking care of from subscription time. It is suggested that cultivation campaign had better confined customers more likely to buy additional service to outbound TM for the sake of financial efficiency.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.30 no.7 s.155
• /
• pp.1116-1125
• /
• 2006

This study investigated consumer satisfaction and dissatisfaction experiences in post-purchase product return process. As an exploratory research the study collected qualitative data of subjective consumer experiences using an open-ended questionnaire and identified and classified themes and patterns of satisfaction and dissatisfaction experiences. A total of 113 cases were categorized into satisfied experiences, unsatisfied experiences, and neutral experiences. Further, satisfied experiences were sub-categorized into kind sales associates, quick and easy return process, and services higher than expected based on sources of satisfaction in the return process while unsatisfied experiences were sub-classified into rejection of return, attitude of sales associates, and hassle of return process. In-store adaptive behaviors and intentions on future behaviors were also observed. The results indicated that service quality in the post-purchase service encounter and consumer expectation were important in determining satisfaction and dissatisfaction in the return process. Insights for research questions were proposed.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2010.11a
• /
• pp.331-334
• /
• 2010

Operating characteristics of DGT-5 being developed by Doosan Heavy Industries & Construction Co., Ltd. for power generation service was evaluated. Starting behavior was improved by a series of tests to investigate the effect of various fuel schedule and several combination of bleed valve control. The engine showed stable operation without any instability of compressor in the full operating regime covering from start-up to load conditions. If there is a rapid change of load in the condition of synchronization to Grid, the engine can be controlled stably based on the analysis of dynamic responses of the engine to an rapid load change and a sudden load rejection.