• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.3
• /
• pp.1-10
• /
• 1996

In this paper, the problem of simultaneously allocating servers and loadings of stations in a class of manufacturing systems modelled as network of queues is considered. The throughput function of the closed network of queues is demonstrated as a Schur convex function of server allocation, that is, increasing the server allocation vector under majorization increases the performance in the ship in terms of the throughput. It also reduces the congestion in the open network of queues in terms of reducing the total number of jobs in the sense of likelihood ratio ordering. These are the extentions of the numerical results of Green and Guha (1995) in the service system with independent M/M/c systems to the network of queues. The results can be used to support production planning in certain manufacturing systems.

• Journal of Family Resource Management and Policy Review
• /
• v.1 no.2
• /
• pp.31-43
• /
• 1997

The purpose of this study was to analyze financial management and satisfaction of the elderly households using System’s Approach. 1) Financial management behavior was influenced by age, present job, husband’s job before retirement, assets, family income, living expenses, experiences of financial management. 2) Financial satisfaction was influenced by age, present job, husband’s job before retirement, assets, family income, living expenses, experiences of financial management, and assessment of family financial conditions. 3) The result of regression analysis of input variables on the throughput variable showed that age of respondent and the middle age experiences of financial management emerged as predictors of financial management. There variables accounted for 48% of variance in the financial management behavior. 4) When financial satisfaction was regressed against input and throughput variables, 55% of the total variance of the financial satisfaction was explained by financial goal and assessment of family conditions.

• 정보저장시스템학회:학술대회논문집
• /
• 2005.10a
• /
• pp.103-110
• /
• 2005

We present a powerful error control decoder which can be used in all of the commercial DVD systems. The decoder exploits the error information from the modulation decoder in order to increase the error correcting capability. We can identify that the modulation decoder in DVD system can detect errors more than $60\%$ of total errors when burst errors are occurred. In results, fur a decoded block, error correcting capability of the proposed scheme is improved up to $25\%$ more than that of the original error control decoder. In addition, the more the burst error length is increased, the better the decoder performance. Also, a pipeline-balanced RSPC decoder with a low hardware complexity is designed to maximize the throughput. The maximum throughput of the RSPC decoder is 740Mbps@100MHz and the number of gate counts is 20.3K for RS (182, 172, 11) decoder and 30.7K for RS (208, 192, 17) decoder, respectively

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1286-1302
• /
• 2012

In this paper, the resource allocation problem with proportional fairness rate in cognitive OFDM-based wireless network is studied. It aims to maximize the total system throughput subject to constraints that include total transmit power for secondary users, maximum tolerable interferences of primary users, bit error rate, and proportional fairness rate among secondary users. It is a nonlinear optimization problem, for which obtaining the optimal solution is known to be NP-hard. An efficient bio-inspired suboptimal algorithm called immune clonal optimization is proposed to solve the resource allocation problem in two steps. That is, subcarriers are firstly allocated to secondary users assuming equal power assignment and then the power allocation is performed with an improved immune clonal algorithm. Suitable immune operators such as matrix encoding and adaptive mutation are designed for resource allocation problem. Simulation results show that the proposed algorithm achieves near-optimal throughput and more satisfying proportional fairness rate among secondary users with lower computational complexity.

• Journal of Korea Multimedia Society
• /
• v.15 no.12
• /
• pp.1456-1463
• /
• 2012

In this paper, we study the ON/OFF control policy of base stations in two-tier heterogeneous cellular networks to minimize the total power consumption of the system. Using heterogeneous cellular networks is a potential approach of providing higher throughput and coverage compared to conventional networks with only macrocell deployment, but in fact heterogeneous cellular networks often operates regardless of total power consumption, which is a very important issue of modern cellular networks. We propose a policy that controls the activation/deactivation of base stations in heterogeneous cellular networks to minimize total power consumption. Under this policy, the total power consumed can be significantly reduced when the traffic is low while the QoS requirement is satisfied.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4A
• /
• pp.412-420
• /
• 2006

With the appearance of various types of traffic services in communication networks, a study on QoS(Quality of Service) packet scheduling mechanisms which can support differentiated service to each traffic service becomes very important. To meet this requirement, IEEE 802.11 Working Group established the IEEE 802.11e MAC protocol which categorizes every traffic services into 4 access categories(AC) and provides the differentiated service to each AC. In addition, the physical layer of IEEE 802.11a/g standards provide up to 54 Mbps transmission rate per one wireless LAN terminal. However, since the radio resource is hardly limited in wireless channel, it is necessary to find an efficient packet scheduling scheme to maximize the transmission efficiency. Therefore, in this paper, we proposed a new packet scheduling scheme that can enhance the total throughput by setting different contention windows(CW) of CSMA-CA channel access scheme to each wireless LAN terminal according its current channel states. Numerical results derived from using NS-2 network simulator have shown that our proposed packet scheduling scheme can enhance the performance of IEEE 802.11e more and more.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.421-425
• /
• 2005

The increasing number of wireless subscribers who can use internet service any time and any place have caused wireless communications networks to flourish. However, since total communication channel bandwidth for wireless communications is limited, it is very important to find the solution for maximizing the channel utilization. Thus, in this work we propose a QoS packet scheduler for IEEE 802.11e EDCA scheme which is able to maximize the channel throughput with changing the CW value considering wireless channel condition. This proposed scheme is evaluated with NS-2 network simulator under various environments and it is easily shown from the numerical results that the proposed scheme provides better performance than that of the original IEEE 802.11e scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5A
• /
• pp.451-458
• /
• 2006

In this paper, we propose a novel scheduling algorithm for downlink transmission which utilizes scarce wireless resource efficiently in an Orthogonal Frequency Division Multiple Access/Time Division Duplex system. Scheduling schemes which exploit channel information between a Base Station and terminals have been proposed recently for improved performance. Time series analysis is used to estimate the channel state of mobile terminals. The predicted information is then used for prioritized scheduling of downlink transmissions for improved throughput, delay and jitter performance. Through simulation, we show that the total throughput and mean delay of the proposed scheduling algorithm are improved compared with those of the Proportional Fairness and Maximum Carrier to Interference Ratio schemes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.3 s.357
• /
• pp.41-50
• /
• 2007

In this paper, a new Dual Round-Robin (DRR) based iterative SLIP (iSLIP) scheduling scheme, called DiSLIP is proposed for IP switching systems. By using DRR followed by iSLIP, DiSLIP can exploit desynchronization effect of DRR and high performance of iSLIP, while the drawbacks of two schemes are minimized. 'Through computer simulation, we verify the switch throughput and total waiting time of the proposed scheme under nonuniform and correlated self-similar traffic. Moreover, the proposed scheme can considerably reduce the complexity of parallel matching logics compared to iSLIP. From the result, we observe that the proposed scheme outperforms DRR on throughput as well as iSLIP schemes on complextiy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3A
• /
• pp.214-220
• /
• 2006

In this paper, we propose the transmit power controlled adaptive modulated OFDM with frequency symbol spreading and equalization(TPC-AMS/FSS-OFDM) system. In the transmitter of the TPC-AMS/FSS-OFDM, each SP transformed signal is spread by orthogonal spreading codes and combined, so the detected signals obtain the same SINR(signal interference to noise ration) for each frequency symbol spreading block. In this case, we can assign the same modulation level and transmit power for each frequency symbol spreading block. Thus, the proposed system provides the increased throughput performance with reducing the total transmit power, FBI and MLI.