• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.585-591
• /
• 2006

Generalized Processor Sharing(GPS) model provides instantaneous fair services to currently backlogged sessions. Since this fair service distributes server capacity to backlogged sessions in proportion to their weights, the fairness is only valid between the sessions serviced at the same time. From the long time view, however, this fair service provides different server capacity with one session or another, even if these sessions have the same weights. This paper proposes a cumulative fair service(CFS) model to provide fair server capacity to all sessions in the long time view. This model provides fair service in session Viewpoint because it distributes server capacity in proportion to the weights of sessions. The model and an algorithm referencing that model are analyzed for their properties and performances. Performance evaluations verify that the proposed algorithm provides proportional service capacity to sessions in the long time view.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1569-1586
• /
• 2015

This paper considers the optimal cell association and resource allocation for load balancing in a heterogeneous cellular network subject to user's quality-of-service (QoS) constraints. We adopt the proportional fairness (PF) utility maximization formulation which also accommodates the QoS constraints in terms of minimum rate requirements. With equal resource allocation this joint optimization problem is either infeasible or requires relaxation that yields a solution which is difficult to implement. Nevertheless, we show that this joint optimization problem can be effectively solved without any priori assumption on resource allocation and yields a cell association scheme which enforces single BS association for each user. We re-formulated the joint optimization problem as a network-wide resource allocation problem with cardinality constraints. A reweighted heuristic l₁-norm regularization method is used to obtain a sparse solution to the re-formulated problem. The cell association scheme is then derived from the sparsity pattern of the solution, which guarantees a single BS association for each user. Compared with the previously proposed method based on equal resource allocation, the proposed framework results in a feasible cell association scheme and yields a robust solution on resource allocation that satisfies the QoS constraints. Our simulations illustrate the impact of user's minimum rate requirements on cell association and demonstrate that the proposed approach achieves load balancing and enforces single BS association for users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2B
• /
• pp.178-187
• /
• 2009

Cognitive radio (CR) technology is to maximize the spectrum utilization by allocating the unused spectrums to the unlicensed users. In CR environment, it is strictly required for the unlicensed users not to interference with the licensed users. Thus, it is essential to rely on the scheduling algorithm to avoid the interference when utilizing spectrum holes that are changing in time and frequency. However, the existing scheduling algorithms that are applied for the wireless communication environment considering the licensed users only is not appropriate for CR environment. In this paper, we propose downlink scheduling algorithm based on probability of incumbent user presence for cognitive radio networks. With computer simulations, it is shown that the proposed scheduling algorithm outperforms the conventional scheduling algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.5
• /
• pp.280-292
• /
• 2014

Recently, heterogeneous networks consisting of small-cells on top of traditional macro-cellular network has attracted much attention, because traditional macro-cellular network is not suitable to support more demanding mobile data traffic due to its limitation of spatial reuse. However, due to the transmit power difference between macro- and small-cells, most users are associated with macro-cells rather than small-cells. To solve this problem, enhanced inter-cell interference coordination (eICIC) has been introduced. Particularly, in eICIC, the small-cell coverage is forcibly expanded to associate more users with small-cells. Then, to avoid cross-tier interference from macro-cells, these users are allowed to receive the data during almost blank subframe (ABS) in which macro-cells almost remain silent. However, this approach is not sufficient to balance the load between macro- and small-cells because it only expands the small-cell coverage. In this paper, we propose a load balance scheme improving proportional fairness for heterogeneous networks employing eICIC. In particular, the proposed scheme combines the greedy-based user association and the ABS rate determination in a recursive manner to perform the load balance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.4
• /
• pp.37-42
• /
• 2021

NOMA (Non-orthogonal multiple Access) system has been focused on the next generation cellular system for higher spectral efficiency. However, this requires user scheduling as the NOMA system is a multi-user system which accesses simultaneously. There are two representative scheduling schemes, proportionate scheduling (FP) and cumulative distribution function (CFD) scheduling. The PF scheduling is applied, the cell edge user is hard to obtain a transmit opportunity. Recently, CDF scheduling is obviously noted that it offers the same possibility of transmission for a user regardless of the location in a cell. We consider an uplink NOMA system with CDF scheduling, and obtain the channel access probabilities, the outage probabilities of the system with different number of users and different kinds of weights through simulation. The results indicate that the likelihood of each user accessing the channel is the same and the probability of failure decreases as the number of users increases. We found that the effect of the probability of failure is negligible as the weight of the cell edge user increases.

• Journal of Korea Port Economic Association
• /
• v.29 no.2
• /
• pp.1-17
• /
• 2013

This paper aims to review the fairness of carriers' incentive schemes at Gwangyang port in 2010 and to show the desirable incentive allocation rules using the proportional and egalitarian rules under cooperative game theory. The carriers' incentive schemes at Gwangyang port in 2010 did not meet the no-envy and the efficiency, and satisfy the symmetry axiom. According to the research findings, the equal surplus method satisfies the axioms of equity, efficiency, symmetry, and progressivity. However, the uniform losses method meets the axioms of equity, efficiency, symmetry, and regressivity. We use a single allocation criterion of the total throughput to show the regressivity and the symmetry principles into the incentive scheme instead of using multiple criteria such as total throughput, increased volume, and coastal volume. The uniform losses method based on the total throughput can distribute the incentive amount according to the intent of the incentive schemes. Hence, we need to establish a rationing system to allocate reasonably the total amount of different types of incentives, avoiding the temptation to adjust the volume shipped between the ports of carriers considering the efficiency of allocation.