• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2827-2835
• /
• 2000

In recent years, much attention has been focused on improving I/O devices' processing speed which is essential in such large data processing areas as multimedia data processing. And studies on high-performance parallel file systems are considered to be one of such efforts. In this paper, an efficient disk allocation scheme is proposed for high-performance parallel file systems. In other words, the concept of a parallel disk file's parallelism is defined using data declustering characteristic of a given parallel file. With the concept, an efficient disk allocation scheme is proposed which calculates the appropriate degree of data declustering on disks for each parallel file in order to obtain the maximum throughput when more than one parallel file is used at the same time. Since, calculation for obtaining the maximum throughput is too complex as the number of parallel files increases, an approximate disk allocation algorithm is also proposed in this paper. The approximate algorithm is very simple and especially provides very good results when I/O workload is high. In addition, it has shown that the approximate algorithm provides the optimal disk allocation for the maximum throughput when the arrival rate of I/O requests is infinite.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.4
• /
• pp.125-132
• /
• 2001

Traffic unbalance between uplink and downlink is one of the most notable characteristics in the next generation cellular mobile systems which provide multimedia services such as voice and video telephony, high-speed internet access, and mobile computing, etc. The CDMA/TDD system with unbalanced slot allocation between two links is a good solution for the traffic unbalance in this paper, we formulate the time slot and channel allocation problem for the CDMA/TDD systems in general multicell environments, which is to maximize the system capacity under the given traffic unbalance, and solve that problem by simulated annealing technique. Computational experiments show that the proposed scheme yields a good performance.

• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.88-94
• /
• 2006

In wireless cellular networks, previous researches on admission control policies and resource allocation algorithm considered the QoS (Quality of Service) in terms of CDP (Call Dropping Probability) and CBP (Call Blocking Probability). However, since the QoS was considered only within a predetermined cell capacity, the results indicated a serious overload problem of systems not guaranteeing both CDP and CBP constraints, especially in the hotspot cell. That is why a close interrelationship between CDP, CBP and cell capacity exists. Thus, it is indispensable to consider optimal cell capacity guaranteeing multiple QoS (CDP and CBP) at the time of initial cell planning for networks deployment. In this paper, we will suggest a distributed determination scheme of optimal cell capacity guaranteeing both CDP and CBP from a long-term perspective for initial cell planning. The cell-provisioning scheme is performed by using both the two-dimensional continuous-time Markov chain and an iterative method called the Gauss-Seidel method. Finally, numerical and simulation results will demonstrate that our scheme successfully determines an optimal cell capacity guaranteeing both CDP and CBP constraints for initial cell planning.

• Journal of Industrial Convergence
• /
• v.17 no.4
• /
• pp.131-137
• /
• 2019

In infrastructure wireless mesh networks (WMNs), in order to improve mobile users' satisfaction for the given cache hit ratio, we investigate an User centric Cache Allocation (UCA) scheme while reducing cache cost in a mesh router (MR) and expected transmission time (ETT) for content search in cache. To minimize ETT values of mobile users, a genetic algorithm based UCA (GA-UCA) scheme is provided. The goal is to maximize mobile users' satisfaction via our well defined utility, which considers content popularity and the number of mobile users. Finally, through solving optimization problem we show the optimal cache can be allocated for UCA and GA-UCA. Besides, a WMN provider can find the optimal number of mobile users for user centric cache allocation in infrastructure WMNs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.7
• /
• pp.546-551
• /
• 2014

This paper proposes an opportunistic subchannel allocation (OSA) scheme for relay-based marine communication networks to improve a sum-rate capacity. In most previous works for relay-based networks, each RS delivers the data received from the BS immediately to the corresponding ships in each frame. The achievable data-rate of the two-hop transmission (BS-RS and RS-ship links) is thus limited by the channel quality between BS-RS and RS-ship links. Hence, the radio resources can be wasted according to the difference in the channel quality between the BS-RS link and the RS-ship link. The proposed OSA scheme reduces the waste of radio resources by efficiently and independently allocating the radio resources at the BS-RS link and at the RS-ship link according to the channel quality of each link. The proposed OSA scheme, however, increases the computational complexity, because the BS finds the optimal OFDMA resource by checking the channel quality of all BS-RS links and RS-ship links. The simulation results show that the sum-rate capacity of the proposed OSA scheme improves maximum 14.0% compared with the conventional scheme.

• ETRI Journal
• /
• v.36 no.3
• /
• pp.396-406
• /
• 2014

We have designed and investigated a new congestion control scheme, called optimal and fully explicit (OFEX) controller. Different from existing relatively explicit controllers, this new scheme can provide not only optimal bandwidth allocation but also a fully explicit congestion signal to sources. It uses the congestion signal from the most congested link instead of the cumulative signal from the flow path. In this way, it overcomes the drawback of relatively explicit controllers exhibiting bias toward multi-bottlenecked users and significantly improves their convergence speed and source throughput performance. Furthermore, our OFEX-controller design considers a dynamic model by proposing a remedial measure against the unpredictable bandwidth changes in contention-based multi-access networks. Compared with former works/controllers, this remedy also effectively reduces the instantaneous queue size in a router and thus significantly improves queuing delay and packet loss performance. We have evaluated the effectiveness of the OFEX controller in OPNET. The experimental comparison with the existing relatively explicit controllers verifies the superiority of our new scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.9
• /
• pp.1641-1647
• /
• 1994

This paper describes an optimal communication protocol for high-speed networks. This scheme can support multimedia services and provide fast data transmission using the distributed gueue scheme and the dynamic bandwidth allocation architecture, based on ATM(Asynchronous Transfer Mode). Performance analyses and simulation results are presented to illustrate the effectiveness of the proposed scheme in a variety of communication environments.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.136-140
• /
• 2007

In this paper, an adaptive minimum transmit power modulation scheme under constant data rate and fixed bit error rate (BER) for the multiple-input multiple-output (MIMO) system is proposed. It adjusts the modulation order and allocates the transmit power to each spatial sub-channel when meeting the user's requirements at the cost of minimum transmission power. Compared to the other algorithm, it can obtain good performance with lower computational complexity and can be applied to the wireless communication system. Computer simulation results present the efficiency of the proposed scheme. And its performance under different channel condition has been compared with the other algorithm.

• Journal of Communications and Networks
• /
• v.17 no.4
• /
• pp.394-405
• /
• 2015

This paper considers a wideband cognitive radio network which can simultaneously sense multiple narrowband channels and thus aggregate the detected available channels for transmission and proposes a novel cognitive radio system that exhibits improved sensing throughput and can save power consumption of secondary user (SU) compared to the conventional cognitive radio system studied so far. More specifically, under the proposed cognitive radio system, we study the problem of designing the optimal sensing time and power allocation strategy, in order to maximize the ergodic throughput of the proposed cognitive radio system under two different schemes, namely the wideband sensing-based spectrum sharing scheme and the wideband opportunistic spectrum access scheme. In our analysis, besides the average interference power constraint at primary user, the average transmit power constraint of SU is also considered for the two schemes and then a subgradient algorithm is developed to obtain the optimal sensing time and the corresponding power allocation strategy. Finally, numerical simulations are presented to verify the performance of the two proposed schemes.

• Journal of Korean Society for Quality Management
• /
• v.24 no.2
• /
• pp.25-43
• /
• 1996

This paper presents the optimal and practical constant-stress accelerated life test plans for the lognormal lifetime distribution tinder assumptions of intermittent inspection and Type-I censoring. In an optimal plan, the low stress level and the proportions of test units allocated at each stress are determined under given inspection scheme and number of inspections such that the asymptotic variance of the maximum likelihood estimator of a certain quantile at use condition is minimized. Although the practical plan adopts the same design criterion, it involves three rather than two overstress levels in order to compromise the practical deficiencies of the optimal plan. Computational experiments are conducted to choose an allocation plan and a inspection scheme of the practical plan and to compare with test plans over a range of parameter values.