• Journal of the Korea Society for Simulation
• /
• v.12 no.4
• /
• pp.51-59
• /
• 2003

Real-Time applications on Grid environment have several problems in terms of resource management addressed as follows; (1) dynamic resource allocation to provide QoS objectives, (2) heterogeneous resources that is different scale, or capacity in same unit, and (3) resource availability, and resource needs. This paper describes the techniques of resource manager (RM) handling above problems to support QoS of dynamic real-time applications on Grid. The contributions of this paper to solve problems are as follows: unification of dynamic resource requirements among heterogeneous hosts, control of resources in heterogeneous environments, and dynamic load balancing/sharing. Our heuristic allocation scheme works not only 257% better than random, 142% better than round robin, and 36.4% better than least load in QoS sensitivity, but also 38.6% better than random, 28.5% better than round robin, and 31.6% better than least load in QoS.

• Journal of the military operations research society of Korea
• /
• v.25 no.1
• /
• pp.199-214
• /
• 1999

The Constructive Battle Simulation Model is very important to the recent military training for the substitution of the field training. However, real battlefield systems operate under real-time conditions, they are inherently distributed, concurrent and dynamic. In order to reflect these properties by the computer-based simulation systems which represent real world processes, we have been developing constructive simulation model for several years. Conventionally, scheduling and resource allocation activities which have timing constraints, we elaborated on these issues and developed the simulation system on commercially available hardware and operating system with lock-free resource allocation scheme and rate monotonic scheduling.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.4 s.42
• /
• pp.69-75
• /
• 2006

Internet-based distributed computing environment have been developed for advanced science and engineering by sharing large-scale resources. Therefore efficient scheduling algorithms for allocating user job to resources in the Internet-based distributed computing environment are required. Many scheduling algorithms have been proposed. but these algorithms are not suitable for the Internet-based Distributed computing environment. That is the previous scheduling algorithm does not consider peer self-control. In this paper, we propose a Peer Availability Period Prediction Strategy for Internet-based distributed computing environment and show that our Strategy has better performance than other Strategy through extensive simulation.

• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.784-795
• /
• 2016

In this paper, we investigate the resource allocation problem in time-varying heterogeneous wireless networks (HetNet) with multi-homing user equipments (UE). The stochastic optimization model is employed to maximize the network utility, which is defined as the difference between the HetNet's throughput and the total energy consumption cost. In harmony with the hierarchical architecture of HetNet, the problem of stochastic optimization of resource allocation is decomposed into two subproblems by the Lyapunov optimization theory, associated with the flow control in transport layer and the power allocation in physical (PHY) layer, respectively. For avoiding the signaling overhead, outdated dynamic information, and scalability issues, the distributed resource allocation method is developed for solving the two subproblems based on the primal-dual decomposition theory. After that, the adaptive resource allocation algorithm is developed to accommodate the timevarying wireless network only according to the current network state information, i.e. the queue state information (QSI) at radio access networks (RAN) and the channel state information (CSI) of RANs-UE links. The tradeoff between network utility and delay is derived, where the increase of delay is approximately linear in V and the increase of network utility is at the speed of 1/V with a control parameter V. Extensive simulations are presented to show the effectiveness of our proposed scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.230-236
• /
• 2007

This paper presents a resource management mechanism for the mesh networking in IEEE 802.15.3 High-rate WPAN. IEEE 802.15 TGS is standardizing the MAC and PHY for mese networking. This task group researches the mechanism that are extension of network coverage without increasing transmit power of receive sensitivity, and studies the enhanced reliability via route redundancy. In this paper we propose the distributed resource management scheme that is fairly using the channel resource in the piconet without centralized piconet coordinator. Each DEV reserves the channel time and broadcasts its information. This scheme has unfairness for later associated DEV because of preoccupation of earlier associated DEVs. This paper presents the method that fairly allocates the channel time in MAC layer. And we evaluate the performance enhancement using simple simulations.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.128-130
• /
• 2021

Smart cities collect data from thousands of IoT-based sensor devices for intelligent application-based services. Centralized cloud servers support application tasks with higher computation resources but introduce network latency. Fog layer-based data centers bring data processing at the edge, but fewer available computation resources and poor task allocation strategy prevent real-time data analysis. In this paper, tasks generated from devices are distributed as high resource and low resource intensity tasks. The novelty of this research lies in deploying a virtual node assigned to each cluster of IoT sensor machines serving a joint application. The node allocates tasks based on the task intensity to either cloud-computing or fog computing resources. The proposed Task Allocation Strategy provides seamless allocation of jobs based on process requirements.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.7
• /
• pp.1250-1256
• /
• 2001

A resource management scheme for ad hoc wireless local area networks (AWLAN's) is presented. This scheme combines distributed resource management scheme and orthogonal frequency division multiplexing-code division multiple access(OFDM-CDMA) technique to support multimedia services with QoS guarantees. The performance evaluation has done in terms of blocking rates and QoS loss probability.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.4
• /
• pp.246-251
• /
• 2013

In this paper, it is proposed a bandwidth allocation Scheme based on Bankruptcy theory in Distributed Mobile Multimedia Network. The proposed scheme is guaranteed a minimum allocation. So, the minimum quality of each service are guaranteed. Therefore efficient and fairness network can be configured. The performance evaluation results indicate that the proposed scheme has good performance than other existing schemes by the fairness index and the Erlang blocking formular calculation. The minimum bandwidth of the proposed scheme can be applied to other techniques of a priority based bandwidth allocation scheme and dynamic bandwidth allocation scheme.

• ETRI Journal
• /
• v.31 no.1
• /
• pp.89-91
• /
• 2009

This letter considers the problem of resource sharing among a relay and multiple user nodes in cooperative transmission networks. We formulate this problem as a sellers' market competition and use a noncooperative game to jointly consider the benefits of the relay and the users. We also develop a distributed algorithm to search the Nash equilibrium, the solution of the game. The convergence of the proposed algorithm is analyzed. Simulation results demonstrate that the proposed game can stimulate cooperative diversity among the selfish user nodes and coordinate resource allocation among the user nodes effectively.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.723-724
• /
• 2017

Recently, researches are being conducted to build a smart environment using various sensors and devices and to provide customized services to users through inter object communication. However, the existing system utilizes a centralized method of transmitting measured sensor data in real time to the server and processing it in batches and As the system is expanded, there is a problem that a high-end server must be configured. In this paper, we design a Resource Allocation Algorithm for IoT distributed processing environment to solve these problems. The resources required for the device to operate are transferred to the server and the server allocates resources in comparison to the task in progress. Therefore, it is expected that the data throughput of the server will be reduced and various devices can be configured in a server having a low specification.