• Journal of Korea Society of Industrial Information Systems
• /
• v.29 no.5
• /
• pp.11-19
• /
• 2024

As task offloading from user devices transitions from the cloud to the edge, the demand for efficient resource management techniques has emerged. While numerous studies have employed reinforcement learning to address this challenge, many fail to adequately consider the overhead associated with real-world offloading tasks. This paper proposes a reinforcement learning-based distributed offloading policy generation method that incorporates task overhead. A simulation environment is constructed to validate the proposed approach. Experimental results demonstrate that the proposed method reduces edge queueing time, achieving up to 46.3% performance improvement over existing approaches.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.1
• /
• pp.17-28
• /
• 2014

The increase of smartphone users have made mobile carriers offload increasingly congested traffic of 3/4G by providing Wi-Fi hot-spots in the public places such as coffee shops and subway stations. In the traditional authentication in WLAN, the users should convince the service providers that they are valid customers before they use WLAN services. Since the authentication protocol is designed for service providers. Even with the mutual authentication based on the IEEE 802.1X, which is supported by IEEE 802.11 standard, it is difficult to be convinced of that the service providers really have installed the WLAN APs, which users are confronted with. An attacker can install rogue APs that masquerade as legitimate APs by copying the SSID, MAC address, etc. in order to obtain users' private information. In this paper, we introduce a method of authenticating legitimate APs for smartphone users. And we show our proposal can be well utilized for the current Wi-Fi hot-spots as a security plug-in and prove it through our experiments.

• Archives of Plastic Surgery
• /
• v.46 no.6
• /
• pp.544-549
• /
• 2019

Background As the indications for postmastectomy radiotherapy expand, innovative solutions are required to reduce operative complications and reconstructive failure after prosthetic breast reconstruction. In this study, we investigated the effectiveness of acellular dermal matrix (ADM) inlay grafts in preventing postoperative wound dehiscence of irradiated breasts in the context of prosthetic breast reconstruction. Methods A retrospective analysis was conducted of 45 patients who received two-stage prosthetic reconstruction and radiotherapy following mastectomy. An ADM graft was placed beneath the incisional site during the second-stage operation in 19 patients using marionette sutures, whereas the control group did not receive the ADM reinforcement. Patient demographics and complications such as wound dehiscence, capsular contracture, peri-prosthetic infection, cellulitis, and seroma were compared between the two groups. Results During an average follow-up period of 37.1 months, wound dehiscence occurred significantly less often in the ADM-reinforced closure group (0%) than in the non-ADM group (23.1%) (P=0.032). There was no significant difference between the two groups in relation to other complications, such as capsular contracture, postoperative infection, or seroma. Conclusions The ADM inlay graft is a simple and easily reproducible technique for preventing incisional dehiscence in the setting of radiotherapy after prosthetic breast reconstruction. The ADM graft serves as a buttress to offload tension during healing and provides a mechanical barrier against pathogens. Application of this technique may serve to reduce complications in prosthetic breast reconstruction after radiotherapy.

• 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 Internet Computing and Services
• /
• v.6 no.5
• /
• pp.11-25
• /
• 2005

In MIPv6 environment, an important design consideration for public key based binding update protocols is to minimize asymmetric cryptographic operations in mobile nodes with constraint computational power, such as PDAs and cellular phones, For that, public key based protocols such as CAM-DH. SUCV and Deng-Zhou-Bao's approach provides an optimization to offload asymmetric cryptographic operations of a mobile node to its home agent. However, such protocols have some problems in providing the optimization. Especially, CAM-DH with this optimization does not unload all asymmetric cryptographic operations from the mobile node, while resulting in the home agent's vulnerability to denial of service attacks. In this paper, we improve the drawbacks of CAM-DH. Furthermore, we adopt Aura's two hash-based CGA scheme to increase the cost of brute-force attacks searching for hash collisions in the CGA method. The comparison of our protocol with other public key based protocols shows that our protocol can minimize the MN's computation overhead, in addition to providing better manageability and stronger security than other protocols.

• Journal of Korea Multimedia Society
• /
• v.8 no.11
• /
• pp.1483-1495
• /
• 2005

TCP/IP is the most commonly used protocol to communicate among servers, and is used in a wide range of applications. Unfortunately, Data transmission through TCP/IP places a very heavy burden on host CPUs. And it hardly makes another job to be processed. So, TOE(TCP/IP Offload Engine) is considered in many servers. But, most of TOE modules tends to not support binary compatibility for standard socket interfaces. So, it has problems that existing applications should be modified and recompiled to get advantage of TOE device. In this paper, to resolve upper problems, we suppose design and implementation of TOE module supporting binary compatibility for standard socket interfaces. Also, it can make a usage of multiple TOEs and NICs simultaneously.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2563-2568
• /
• 2013

Recently, various solutions to support explosively growing mobile data traffic have attracted intensive attentions. However, the range of spectrum which can be exploited for mobile communications is very limited. Small cell networks are actively investigated because they can efficiently offload mobile data traffic from macro cells without using additional spectrum. In this paper, we developed a system-level simulator considering small cell networks in the indoor environments. We compare the performance of outage probability when a load-balancing algorithm is utilized or not. We can reduce the outage probability of congested BS with the load-balancing algorithm. In addition, overall outage probability of whole wireless systems can be reduced by using the proposed load-balancing algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2422-2443
• /
• 2020

This paper studies a single-user Mobile Edge Computing (MEC) system where mobile device (MD) includes an application consisting of multiple computation components or tasks with dependencies. MD can offload part of each computation-intensive latency-sensitive task to the AP integrated with MEC server. In order to accomplish the application faultlessly, we calculate out the optimal task offloading strategy in a time-division manner for a predetermined execution order under the constraints of limited computation and communication resources. The problem is formulated as an optimization problem that can minimize the energy consumption of mobile device while satisfying the constraints of computation tasks and mobile device resources. The optimization problem is equivalently transformed into solving a nonlinear equation with a linear inequality constraint by leveraging the Lagrange Multiplier method. And the proposed dual Bi-Section Search algorithm Bi-JOTD can efficiently solve the nonlinear equation. In the outer Bi-Section Search, the proposed algorithm searches for the optimal Lagrangian multiplier variable between the lower and upper boundaries. The inner Bi-Section Search achieves the Lagrangian multiplier vector corresponding to a given variable receiving from the outer layer. Numerical results demonstrate that the proposed algorithm has significant performance improvement than other baselines. The novel scheme not only reduces the difficulty of problem solving, but also obtains less energy consumption and better performance.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.1
• /
• pp.31-38
• /
• 2012

Next generation cellular applications and smart phone usage generate very heavy wireless data traffic. It becomes ineluctable for mobile network operators to have multiple core network entities such as Serving Gateway and Packet Data Network Gateway in 4G-LTE to share this high traffic generated. A typical configuration consists of multiple serving gateways behind a load-balancer which would determine which serving gateway would service a end-users'request. Such hardware is expensive, has a rigid policy set, and is a single point of failure. Another perspective of today's increasingly high data traffic is that besides it is being widely accepted that the high bandwidth L TE provides is creating bottlenecks for service providers by the increasing user bandwidth demands without creating any corresponding revenue improvements, a hidden problem that is also passively advancing on the newly emerging 4G-LTE that may need more immediate attention is the network signaling traffic, also known as the control-plane traffic that is generated by the applications developed for smartphones and tablets. With this as starting point, in this paper, we propose a solution, by a new approach considering OpenFlow switch connected to a controller, which gains flexibility in policy, costs less, and has the potential to be more robust to failure with future generations of switches. This also solves the problem of scaling the control-plane traffic that is imperative to preserve revenue and ensure customer satisfaction. Thus, with the proposed architecture with OpenFlow, mobile network operators could manipulate the traffic generated by the control-plane signaling separated from the data-plane, besides also reducing the cost in installing multiple core-network entities.

• Journal of KIISE
• /
• v.44 no.7
• /
• pp.703-709
• /
• 2017

Outsourcing databases is to offload storage and computationally intensive tasks to the third party server. Therefore, data owners can manage big data, and handle queries from clients, without building a costly infrastructure. However, because of the insecurity of network systems, the third-party server may be untrusted, thus the query results from the server may be tampered with. This problem has motivated significant research efforts on authenticating various queries such as range query, kNN query, function query, etc. Although aggregation queries play a key role in analyzing big data, authenticating aggregation queries has not been extensively studied, and the previous works are not efficient for data with high dimension or a large number of distinct values. In this paper, we propose the AMR-tree that is a data structure, applied to authenticate aggregation queries. We also propose an efficient proof construction method and a verification method with the AMR-tree. Furthermore, we validate the performance of the proposed algorithm by conducting various experiments through changing parameters such as the number of distinct values, the number of records, and the dimension of data.