• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.3008-3025
• /
• 2012

In this paper, the downlink resource allocation of OFDMA system with decode-and-forward (DF) relaying is investigated. A non-convex optimization problem maximizing system throughput with users' satisfaction constraints is formulated with joint relay selection, subcarrier assignment and power allocation. We first transform it to a standard convex problem and then solve it by dual decomposition. In particular, an Optimal resource allocation scheme With Time-sharing (OWT) is proposed with combination of relay selection, subcarrier allocation and power control. Due to its poor adaption to the fast-varying environment, an improved version with subcarrier Monopolization (OWM) is put forward, whose performance promotes about 20% compared with that of OWT in the fast-varying vehicular environment. In fact, OWM is the special case of OWT with binary time-sharing factor and OWT can be seen as the tight upper bound of the OWM. To the best of our knowledge, such algorithms and their relation have not been accurately investigated in cooperative OFDMA networks in the literature. Simulation results show that both the system throughput and the users' satisfaction of the proposed algorithms outperform the traditional ones.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.436-438
• /
• 2022

National Research Data Commons aims to build a system that can be used jointly by arranging analysis resources such as computing infrastructure, software, toolkit, API, and services used for data analysis together with research data to maximize the use of research data. do. The sharing and utilization system for publications and research data in the R&D process is well known. However, the environment in which data and tightly coupled software and computing infrastructure can be shared and utilized is insignificant and there is no management system. In this study, a data model is designed to systematically manage information on digital research resources required in the data-oriented R&D research process. This will be used to register and manage digital research resource information in the National Research Data Commons Service.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.272-275
• /
• 2007

유비쿼터스 환경은 보이지 않는 수많은 장치들과 소프트웨어들이 서로 연결되어 각각의 사용자들에게 편리한 서비스를 제공한다. 이러한 서비스를 제공 받기 위해서는 사용자와 서비스간의 매개체 역할을 하는 모바일 디바이스가 필요하다. 하지만 자원이 제한적인 모바일 디바이스의 특성상 다양한 서비스를 이용할 수는 없다. 따라서 본 논문에서는 사용자의 프로파일을 고려한 사용자 맞춤 차원 공유 시스템을 개발하여 주변의 다양한 자원을 실시간으로 공유 할 수 있도록 함으로써 모바일 디바이스의 제한적인 리소스 문제를 해결 하고자한다. 본 논문에서는 테스트 시나리오를 이용하여 제안하는 사용자 맞춤 자원 공유 시스템을 검증한다.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.11 no.1
• /
• pp.51-58
• /
• 2011

Extensible processors provide an efficient mechanism to boost the performance of the whole system without losing much flexibility. However, due to the intense demand of low cost and power consumption, customizing an embedded system has been more difficult than ever. In this paper, we present a framework for custom instruction generation considering both area constraints and resource sharing. We also present how we can speed up the process through pruning and library-based design space exploration.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2568-2588
• /
• 2021

Shared mesh protection (SMP) protects traffic against failures occurring in a working path, as with linear protection, and allows resource sharing of protection paths with different endpoints. The SMP mechanism coordinates multiple protection paths that require shared resources when failures occur on multiple working paths. When multiple failures occur in SMP networks sharing limited resources, activation can fail because some of the resources in the protection path are already in use. In this case, a node confirming that a resource is not available has the option to wait until the resource is available or to withdraw activation of the protection path. In this study, we recognize that the protection switching time and the number of protected services can be different, depending on which option is used for SMP networks. Moreover, we propose a detailed design for the implementation of SMP by considering options and algorithms that are commonly needed for network nodes. A simulation shows the performance of an SMP system implemented with the proposed design and utilizing two options. The results demonstrate that resource utilization can be increased or protection switching time can be shortened depending on the option selected by the network administrator.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2001.10a
• /
• pp.104-107
• /
• 2001

Based on the analysis of the functions of ship management company, this paper aims to explore how to build the platform to transmit anti process the information about ships by means of modern information management so as to solve a series of problems caused by blockages in information transmitting in present ship’s management. The paper also talks about the necessity of establishing various resource bases and using different information communicating methods to realize the resource sharing and intellectualization of ship’s business.

• Journal of Computing Science and Engineering
• /
• v.7 no.1
• /
• pp.44-52
• /
• 2013

This paper addresses the problem of resource scheduling in a grid computing environment. One of the main goals of grid computing is to share system resources among geographically dispersed users, and schedule resource requests in an efficient manner. Grid computing resources are distributed, heterogeneous, dynamic, and autonomous, which makes resource scheduling a complex problem. This paper proposes a new approach to resource scheduling in grid computing environments, the hierarchical stochastic Petri net (HSPN). The HSPN optimizes grid resource sharing, by categorizing resource requests in three layers, where each layer has special functions for receiving subtasks from, and delivering data to, the layer above or below. We compare the HSPN performance with the Min-min and Max-min resource scheduling algorithms. Our results show that the HSPN performs better than Max-min, but slightly underperforms Min-min.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.9
• /
• pp.19-26
• /
• 2011

Users want to receive customized service using users' personal device. To fulfill this requirement, the mobile device has to support a lot of functions. However, the mobile device has limitations such as tiny display screens. To solve this limitation problem and provide customized service to users, this paper proposes the environment to provide services by sharing resources and the method to recommend user-suitable resources among sharable resources. For the resource recommendation, This paper analyzes user's behavior pattern from usage history and proposes the method for recommending customized resources. This paper also shows that the approach is reasonable one for resource recommendation through the satisfaction evaluation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3A
• /
• pp.140-150
• /
• 2003

In this paper, we propose a novel code sharing method for downlink transmission of mobile satellite communication systems using a multibeam geosynchronous-orbit satellite. In the proposed system, spreading codes are shared among downlink beams in order to increase the system capacity. We also propose efficient radio resource and transmit power allocation schemes for the proposed system. Simplified analysis and simulation results on the system capacity show the capacity improvement by the proposed scheme. The simulation results show that the capacity of the proposed system is more than 2 times as large as that of a conventional multibeam satellite system. In the frequency-selective fading channel, the capacity improvement increases as the interference between orthogonal spreading codes decrease.

• The Journal of Society for e-Business Studies
• /
• v.1 no.1
• /
• pp.227-247
• /
• 1996

Presented in this paper is a control model for developing virtual factory simulator, which is being operated under the distributed environment. The control model consists of production activity plan and information flows. To incorporate elements of the characteristics of the distributed control system, we suggested a collaboration model. This model is working under the client/server architecture, and also designed for cooperative-distributed shop control(CDSC) system in order to exploit several advantages of client/server architecture. Collaboration among each agent(or client) is done through negotiation and task sharing. Based on a contract net model, the CDSC system has three kinds of agents-order agent, resource agent, and communication forwarding agent. Each agent performs shop scheduling and control through negotiation on contract net. No node in CDSC system can have authority over other node. A bidding scheme is employed far negotiation between order agent and resource agents. The CDSC system can support re-negotiation among resource agents and an algorithm for re-negotiation is also developed. Experimental results are shown to advocate the effectiveness of the CDSC system for CIM environments.