• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.5
• /
• pp.92-98
• /
• 2007

We propose the schemes for the dynamic channel allocation (DCA) in multi-cell OFDMA systems to avoid co-channel interference (CCI) without the additional complexity. The allocatable subcarriers areas, which is designed to avoid CCI among cells, are determined for each cell. Each cell allocates the subcarriers within the allocatable subcarriers area of the cell independently. We consider the trade off between the reduced frequency selection diversity and the amount of CCI on a subcarrier by the determination of allocatable subcarriers area. Hence, the equal allocation bound scheme for the high selectivity channel and the flexible allocation bound scheme for the low selectivity channel are proposed. Through the numerical results, it is confirmed that the proposed schemes have better performance in the aspects of the number of overlapping allocated subcarriers, the capacity and the outage probability compared to the case which does not determined the allocatable subcarriers area.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.525-530
• /
• 2003

This paper is concerned with a control allocation strategy using the dynamic inversion which generates the nominal control input trajectories, and autopilot design using the time-varying control technique which is time-varying version of pole placement of linear time-invariant system for an agile missile with aerodynamic fin and thrust vectoring control. Dynamic inversion can decide the amount of the deflection of each control effector, aerodynamic fin and thrust vectoring control, to extract the maximum performance by combining the action of them. Time-varying control technique for autopilot design enhance the robustness of the tracking performance for a reference command. Nonlinear simulations demonstrates the dynamic inversion provides the effective nominal control input trajectories to achieve the angle of attack command, and time-varying control technique exhibits good robustness for a wide range of angle of attack.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.268-279
• /
• 1997

In this paper, we show the movable boundary (MB) method is the effective bandwidth allocation strategy for the ABR service among existing bandwidth allocation methods. The MB method can gurantee the QOS requirement according to the service priority and improve bandwidth utilization using the characteristics of the ABR service. The threshold values of the MB, which have an important effect upon connection blocking probability(CBP) performance of each service, are obtained by simulation. The MB method with the fixed thresholds, however, may not have good performance to variation of input traffic parameters. We suggest the dynamic MB method which changes the threshold values adaptively according to the required bandwidth of input traffic. We also show that the dynamic MB method can urantee the CBP performance according to the service priority regardless of variation of input traffic parameters.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.747-748
• /
• 2013

This paper proposes a new dynamic polling method for XGPON1 (10-Gbps-capable passive optical network stage 1). XGPON1 system supports 2.5 Gbps for upstream and 10 Gbps for downstream. In XGPON1 system, if the polling frequency is high, then the efficiency of dynamic bandwidth allocation increases whereas the upstream bandwidth is wasted. The proposed method decreases the upstream bandwidth wastage owing to polling and efficiently increases the polling frequency.

• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.29-34
• /
• 2007

This paper proposes a MAC protocol for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed protocol is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters, and a priority scheme of the slot allocation. The design objective of the proposed protocol is to guarantee the real-time constraint of rt-VBR traffic. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. The wireless terminal establishes an rt-VBR connection to the base station with a contention-based scheme. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed protocol can guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.477-486
• /
• 2009

This paper proposes a dynamic bandwidth allocation (DBA) algorithm with adaptive maximum transmission window (DBA-AMTW) to increase channel utilization in Ethernet passive optical networks (EPONs). A polling mechanism in EPON determines channel utilization and puts constraints on DBA algorithm and scheduling. DBA algorithms based on interleaved polling with stop (IPS) allocate transmission windows to optical network units (ONU) considering requests of all ONUs. However channel idle time when any ONU does not transmit packets decreases channel utilization. Proposed DBA-AMTW improves efficiency of a network and allocates transmission windows effectively by appropriate DBA computation from REPORT messages of all ONUs. An adaptive maximum transmission window for each ONU determined by a DBA computation in the previous scheduling cycle. Simulation results show that the proposed DBA algorithm improves performance of throughput and average delay time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1A
• /
• pp.91-103
• /
• 2005

In designing a video-on-demand (VoD) system, the major challenge may be how to reduce the channels concurrently used maintaining the client's waiting time. For this reason, the various architectures which integrate the multicast streams with the unicast streams were suggested in order to improve channel efficiency in recent years. In combining multicast with unicast, the ways to group the unicast channels together are important so that clients can share the multicast transmission channels. This paper proposes a hybrid video-on-demand system which gathers the unicast channels in new ways and shares multicast transmission channels efficiently by using dynamic channel allocation architecture. The numerical results demonstrate that the proposed architecture in some case achieves performance gain of $551{\%}$ compared to existing architecture. This paper presents procedure of channel release and reuse, performance analysis, and simulation results of the dynamic channel allocation architecture.

• ETRI Journal
• /
• v.24 no.4
• /
• pp.280-289
• /
• 2002

In this work, we present a novel approach to the bit allocation problem that aims to minimize overall distortion subject to a bit rate constraint. The optimal solution can be found by the Lagrangian method with dynamic programming. However, the optimal bit allocation for block-based interframe coding is practically unattainable because of the interframe dependency of macroblocks caused by motion compensation. To reduce the computational burden while maintaining a result close to the optimum, i.e., near optimum, we propose an alternative method. First, we present a partitioned form of the bit allocation problem: a "frame-level problem" and "one-frame macroblock-level problems." We show that the solution to this new form is also the solution to the conventional bit allocation problem. Further, we propose a bit allocation algorithm using a "two-phase optimization technique" with an interframe dependency model and a rate-distortion model.

• Journal of Computing Science and Engineering
• /
• v.9 no.2
• /
• pp.51-72
• /
• 2015

Time predictability is crucial in hard real-time and safety-critical systems. Cache memories, while useful for improving the average-case memory performance, are not time predictable, especially when they are shared in multicore processors. To achieve time predictability while minimizing the impact on performance, this paper explores several time-predictable scratch-pad memory (SPM) based architectures for multicore processors. To support these architectures, we propose the dynamic memory objects allocation based partition, the static allocation based partition, and the static allocation based priority L2 SPM strategy to retain the characteristic of time predictability while attempting to maximize the performance and energy efficiency. The SPM based multicore architectural design and the related allocation methods thus form a comprehensive solution to hard real-time multicore based computing. Our experimental results indicate the strengths and weaknesses of each proposed architecture and the allocation method, which offers interesting on-chip memory design options to enable multicore platforms for hard real-time systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4320-4333
• /
• 2017

Energy-efficient virtual resource allocation algorithm has become a hot research topic in cloud computing. However, most of the existing allocation schemes cannot ensure each type of resource be fully utilized. To solve the problem, this paper proposes a virtual machine (VM) allocation algorithm on the basis of multi-dimensional resource, considering the diversity of user's requests. First, we analyze the usage of each dimension resource of physical machines (PMs) and build a D-dimensional resource state model. Second, we introduce an energy-resource state metric (PAR) and then propose an energy-aware multi-dimensional resource allocation algorithm called MRBEA to allocate resources according to the resource state and energy consumption of PMs. Third, we validate the effectiveness of the proposed algorithm by real-world datasets. Experimental results show that MRBEA has a better performance in terms of energy consumption, SLA violations and the number of VM migrations.