• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.27-30
• /
• 2000

In this paper, we propose a new dynamic bandwidth allocation and call admission control method for the VBR video sources with QoS constraints to provide user's quality of service requirements and at the same time to achieve an efficient resource management in networks. The proposed mechanism dynamically adjusts the necessary bandwidth by the networks based on the provided quality of service satisfaction degree of each connection in respect to the user's requirements in terms of loss ratio and average delay Simulation results show that our proposed dynamic method is able to provide the desired level of quality of service and high utilization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.2
• /
• pp.288-307
• /
• 2013

This paper formulates resource allocation for decode-and-forward (DF) relay assisted multi-cell orthogonal frequency division multiple (OFDM) networks as an optimization problem taking into account of inter-cell interference and users fairness. To maximize the transmit rate of system we propose a joint interference coordination, subcarrier and power allocation algorithm. To reduce the complexity, this semi-distributed algorithm divides the primal optimization into three sub-optimization problems, which transforms the mixed binary nonlinear programming problem (BNLP) into standard convex optimization problems. The first layer optimization problem is used to get the optimal subcarrier distribution index. The second is to solve the problem that how to allocate power optimally in a certain subcarrier distribution order. Based on the concept of equivalent channel gain (ECG) we transform the max-min function into standard closed expression. Subsequently, with the aid of dual decomposition, water-filling theorem and iterative power allocation algorithm the optimal solution of the original problem can be got with acceptable complexity. The third sub-problem considers dynamic co-channel interference caused by adjacent cells and redistributes resources to achieve the goal of maximizing system throughput. Finally, simulation results are provided to corroborate the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.2
• /
• pp.298-306
• /
• 2015

In this paper, we propose an efficient resource allocation scheme for the integrated satellite/terrestrial networks. The proposed scheme is a frequency sharing technique to mitigate the inter-component interferences which can be generated between a satellite beam and terrestrial cells that are operated in the same frequency. The proposed dynamic resource allocation scheme can mitigate the total inter-component interference by optimizing the total transmission power and it can expect a result of which can lead to an increase in capacity. In such a system, the interference situation can be affected by the distributed traffic demands or up/down link communications environments. In this point of view, we evaluate the performance of the total consumed power, the amount of inter-component interference with respect to different traffic distributions and interference environments between the satellite beam and terrestrial systems.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7A
• /
• pp.693-701
• /
• 2008

In OFDMA (Orthogonal Frequency Division Multiple Access) system that frequency reuse factor is 1, as the same channels in the neighborhood cells creates inter-cell co-channel interference which provides a resource underutilization problem, channel allocation schemes to minimize inter-cell interference have been studied. This paper proposes a new CNIR (Carrier to Noise and Interference Ratio)-based distributed Inter-cell DCA (Dynamic Channel Allocation) algorithm in the OFDMA environment with frequency reuse factor of 1. When a channel allocation is requested, if there is not a free channel in home cell or the available free channels in home cell do not satisfy a required threshold value, the proposed Inter-cell DCA algorithm finds CNIR values of available free channels in the neighborhood cells and then allocates a free channel with maximum CNIR value. Through the simulation results, we find that the proposed scheme decreases both new call block rate and forced termination rate due to new call generation at the same time because it increases channel allocation probability.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.10
• /
• pp.40-46
• /
• 2009

Recently CAN (Controller Area Network) is widely used as an in-vehicle networking protocol for intelligent vehicle. The identifier field (ID) of CAN is used not only to differentiate the messages but also to give different priorities to access the bus. This paper presents a dynamic 10 allocation algorithm in order to enhance the real-time quality-of-service (QoS) performance. When the network traffic is increased, this algorithm can allocate a network resource to lower priority message without degradation of the real-time QoS performance of higher priority message. In order to demonstrate the algorithm's feasibility, message transmission delays have been measured with and without the algorithm on an experimental network test bed.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.256-259
• /
• 2007

Multicast and Broadcast Service (MBS) provides flexible and efficient transmission of the same information to multiple users using shared radio resources on WiBro network. The advantage of this service is to achieve the most efficient use of radio and network resources as well as to lessen sender's processing load when sending the same information to multiple users. Though radio resources are saved since a multicast or broadcast transport connection is associated with a service flow, it is hard to change MBS service channel dynamically. In this paper, we propose a Radio Resource Management System (RRMS) for supporting dynamic scheduling of MBS service channels. Results show that our proposed scheme using Radio Resource Allocation Table (RRAT) can efficiently support MBS services by providing dynamic schedule for MBS service channels.

• International journal of advanced smart convergence
• /
• v.12 no.4
• /
• pp.126-133
• /
• 2023

Recent advancements in cloud service virtualization technologies have witnessed a shift from a Virtual Machine-centric approach to a container-centric paradigm, offering advantages such as faster deployment and enhanced portability. Container orchestration has emerged as a key technology for efficient management and scheduling of these containers. However, with the increasing complexity and diversity of heterogeneous workloads and service types, resource scheduling has become a challenging task. Various research endeavors are underway to address the challenges posed by diverse workloads and services. Yet, a systematic approach to container orchestration for effective cloud management has not been clearly defined. This paper proposes the DRA-Engine (Dynamic Resource Allocation Engine) for resource scheduling in container orchestration. The proposed engine comprises the Request Load Procedure, Required Resource Measurement Procedure, and Resource Provision Decision Procedure. Through these components, the DRA-Engine dynamically allocates resources according to the application's requirements, presenting a solution to the challenges of resource scheduling in container orchestration.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.519-522
• /
• 1998

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 rea-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. The constructive simulation system is one of the famous real-time system software, nd the one common feature of all real-time systems is defined as the correctness of the system depend not only on the logical result of computation, but also on the time at which the results are produced. Conventionally, scheduling and resource allocation activities which have timing constraints are major problem of real-time computing systems. To overcome these 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 rae monotonic scheduling.

• International Journal of Contents
• /
• v.16 no.4
• /
• pp.16-25
• /
• 2020

The size of observation data in astronomy has been increasing exponentially with the advents of wide-field optical telescopes. This means the needs of changes to the way used for large-scale astronomy data analysis. The complexity of analysis tools and the lack of extensibility of computing environments, however, lead to the difficulty and inefficiency of dealing with the huge observation data. To address this problem, this paper proposes a workflow execution system for analyzing large-scale astronomy data efficiently. The proposed system is composed of two parts: 1) a workflow execution manager and its RESTful endpoints that can automate and control data analysis tasks based on workflow templates and 2) an elastic resource manager as an underlying mechanism that can dynamically add/remove virtualized computing resources (i.e., virtual machines) according to the analysis requests. To realize our workflow execution system, we implement it on a testbed using OpenStack IaaS (Infrastructure as a Service) toolkit and HTCondor workload manager. We also exhaustively perform a broad range of experiments with different resource allocation patterns, system loads, etc. to show the effectiveness of the proposed system. The results show that the resource allocation mechanism works properly according to the number of queued and running tasks, resulting in improving resource utilization, and the workflow execution manager can handle more than 1,000 concurrent requests within a second with reasonable average response times. We finally describe a case study of data reduction system as an example application of our workflow execution system.