• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4A
• /
• pp.316-323
• /
• 2009

Power allocation of soft frequency reuse(SFR) to increase cell edge user throughput by reducing inter-cell interference is proposed for coordinated cellular systems. SFR is the effective technique to increase cell edge user throughput, however, it costs the degradation of total system throughput. The cost increases when SFR operated in distributed resource controlled systems fails to be fast adaptive in the change of user distribution. The proposed scheme enables coordinated cells to control transmit power adaptively depending on user distribution so that it minimizes the loss of system throughput introduced from SFR while it guarantees enhancement of cell edge user throughput. Through system level simulation considering neighboring two cells, evaluation result for adaptive power allocation is shown compared with static power allocation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.677-686
• /
• 2012

In the presence of a high power cellular network, picocells are added to a Macro-cell layout aiming to enhance total system throughput from cell-splitting. While because of the different transmission power between macrocell and picocell, and co-channel interference challenges between the existing macrocell and the new low power node-picocell, these problems result in no substantive improvement to total system effective throughput. Some works have investigated on these problems. Pico Cell Range Expansion (CRE) technique tries to employ some methods (such as adding a bias for Pico cell RSRP) to drive to offload some UEs to camp on picocells. In this work, we propose two solution schemes (including cell selection method, channel allocation and serving process) and combine new adaptive frequency partitioning reuse scheme to improve the total system throughput. In the simulation, we evaluate the performances of heterogeneous networks for downlink transmission in terms of channel utilization per cell (pico and macro), call blocking probability, outage probability and effective throughput. The simulation results show that the call blocking probability and outage probability are reduced remarkably and the throughput is increased effectively.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.13 no.7
• /
• pp.641-648
• /
• 2002

The study on the chip waveform design to minimize multiple-access interference (MAI) and its performance evaluation are very important since chip waveform decides the signal quality and system capacity of the direct-sequence CDMA wireless communication system. This paper suggests the analytical chip waveform to minimize the MAI. The BER and throughput performances achieved by the proposed analytical optimum chip waveform are compared with those of the conventional chip waveforms in the Nakagami-m distribution frequency selective channel when the differential phase shift keying (DPSK) is employed in DS-CDMA system. From the numerical results, capacity and throughput are improved about 2 times and 1.4 times respectively when it is compared with the Kaiser chip waveform that is considered as one of the best in the conventional ones.

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.193-202
• /
• 2007

In this paper, a performance evaluation model of the Multistage Interconnection Network(MIN) with the multiple-buffered crossbar switches under Hot-spot environment is proposed and examined. Buffered switch technique is well known to solve the data collision problem of the MIN. The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch. The performance of the multiple-buffered $a{\times}a$ crossbar switch is analyzed. Steady state probability concept is used to simplify the analyzing processes. Two important parameters of the network performance, throughput and delay, are then evaluated. To validate the proposed analysis model, the simulation is carried out on a Baseline network that uses the multiple buffered crossbar switches. Less than 2% differences between analysis and simulation results are observed. It is also shown that the network performance is significantly improved when the small number of buffer spaces is given. However, the throughput elevation is getting reduced and network delay becomes increasing as more buffer spaces are added in a switch.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.244-253
• /
• 2005

In this paper, a performance evaluation model of the switch router with the multiple-buffered crossbar switches is proposed and examined. Buffered switch technique is well known to solve the data collision problem of the crossbar switch. The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch with output-buffers. The performance of the multiple-buffered crossbar switch is analyzed. Steady state probability concept is used to simplify the analyzing processes. Two important parameters of the network performance, throughput and delay, are then evaluated. To validate the proposed analysis model, the simulation is carried out on a network that uses the multiple buffered crossbar switches. Less than $2\%$ differences between analysis and simulation results are observed. It is also shown that the network performance is significantly improved when the small number of buffer spaces is given. However, the throughput elevation is getting reduced and network delay becomes increasing as more buffer spaces are added in a switch.

• Journal of KIISE:Information Networking
• /
• v.29 no.6
• /
• pp.738-748
• /
• 2002

In this paper, a performance evaluation model of the Multistage Interconnection Network(MIN) with the multiple-buffered crossbar switches is Proposed and examined. Buffered switch technique is well known to solve the data collision problem of the MIN. The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch with output-buffers. The performance of the multiple-buffered${\alpha}{\times}{\alpha}$ crossbar switch is analyzed. Steady state probability concept is used to simplify the analyzing processes, Two important parameters of the network performance, throughput and delay, are then evaluated, To validate the proposed analysis model, the simulation is carried out on a Baseline network that uses the multiple buffered crossbar switches. Less than 2% differences between analysis and simulation results are observed. It is also shown that the network performance is significantly improved when the small number of buffer spaces is given. However, the throughput elevation is getting reduced and network delay becomes increasing as more buffer spaces are added in a switch.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.230-245
• /
• 2002

Usually the network-throughput maximization problem for constant-bit-rate (CBR) circuit-switched traffic is posed for a fixed offered load profile. Then choices of routes and of admission control policies are sought to achieve maximum throughput (usually under QoS constraints). However, similarly to the notion of channel “capacity,” it is also of interest to determine the “network capacity;” i.e., for a given network we would like to know the maximum throughput it can deliver (again subject to specified QoS constraints) if the appropriate traffic load is supplied. Thus, in addition to determining routes and admission controls, we would like to specify the vector of offered loads between each source/destination pair that “achieves capacity.” Since the combined problem of choosing all three parameters (i.e., offered load, admission control, and routing) is too complex to address, we consider here only the optimal determination of offered load for given routing and admission control policies. We provide an off-line algorithm, which is based on Lagrangian techniques that perform robustly in this rigorously formulated nonlinear optimization problem with nonlinear constraints. We demonstrate that significant improvement is obtained, as compared with simple uniform loading schemes, and that fairness mechanisms can be incorporated with little loss in overall throughput.

• The KIPS Transactions:PartA
• /
• v.15A no.3
• /
• pp.167-180
• /
• 2008

Consolidating servers into a virtualized system increases entire system utilization, while suffers from performance degradation due to the additional virtualization layer. In this paper, we proposed a performance evaluation methodology for comparing virtualized systems with native non-virtualized systems. We defined a system waste rate per consolidated throughput as a metric, and described the method for calculating system waste rate and consolidated throughput for both of virtualized systems and non-virtualized systems. Using the proposing performance evaluation methodology, we established testbeds, evaluated their performance, and compared the metrics of both systems. As a result of the evaluation, we could show the appropriateness of our methodology and analyze the effect of the application characteristics.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.3
• /
• pp.446-452
• /
• 2006

In this paper, I evaluated the throughput of various multimedia traffic by using computer simulation over wireless LAN environment based on 802.11e MAC protocol. The number of mobile terminals which generate various traffic and have different Internet QoS varies to improve the reliability of performance evaluation by simulation. Therefore, we investigate throughput of traffic that each mobile terminal generates. I expect that the result of study will be utilized as a fundamental data to control priorities of various types of traffic in case of formulating a scheduling policy supporting a variety of Internet QoS over wired and wireless networks.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.123-126
• /
• 2000

In this paper, we are proposed to pushing window input buffer A.T.M Switch that is not use memory read and write of general window police. Pushing window switch is superior to general window switch in performance but is large to general window switch in cross point number. Max throughput and Cell occupying probability results are verified by analysis an simulation. The evaluation of performance is max throughput and cell loss probability and mean queue length.