• 한국통신학회논문지
• /
• 제40권4호
• /
• pp.653-658
• /
• 2015

다양한 강점을 지닌 클라우드 서비스는 현대 IT 사업에 주요 이슈 중 하나이다. 클라우드 환경에서 서비스 제공자는 사용자의 동적인 자원 요구량을 예측하여 사용자의 QoS를 만족시켜야 한다. 사용자의 자원 요구량을 예측하는 기존 모델들은 사용자의 QoS는 만족시키지만 서비스 제공자의 이득은 보장하지 않는다. 본 논문에서는 Q-learning 기반의 자원 예측 모델을 제안하여 사용자의 QoS 뿐만 아니라 서비스 제공자의 이득을 최대화하였다. 또한 제안 기법의 성능 분석을 위해 실측 데이터를 이용하여 다른 예측 모델들과 비교함으로써 제안 기법의 우수함을 증명하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.1973-1991
• /
• 2018

Multimedia applications over wireless networks have been evolving to augmented reality or virtual reality services. However, a rich data size compared to conventional multimedia services causes bandwidth bottlenecks over wireless networks, which is one of the main reasons why those applications are not used widely. To overcome this limitation, bandwidth aggregation techniques, which exploit a multi-path transmission, have been considered to maximize link utilization. Currently, most of the conventional researches have been focusing on the user end problems to improve the quality of service (QoS) through optimal load distribution. In this paper, we address the joint pricing and load distribution problem for multi-homing in heterogeneous wireless access networks (ANs), considering the interests of both the users and the service providers. Specifically, we consider profit from resource allocation and cost of power consumption expenditure for operation as an utility of each service provider. Here, users decide how much to request the resource and how to split the resource over heterogeneous wireless ANs to minimize their cost while supporting the required QoS. Then, service providers compete with each other by setting the price to maximize their utilities over user reactions. We study the behaviors of users and service providers by analyzing their hierarchical decision-making process as a multileader-, multifollower Stackelberg game. We show that both the user and service provider strategies are closed form solutions. Finally, we discuss how the proposed scheme is well converged to equilibrium points.

• International Journal of Computer Science & Network Security
• /
• 제22권4호
• /
• pp.27-32
• /
• 2022

The fifth generation (5G) mobile communication technology is designed to meet all communication needs. Heterogeneous networks (HetNets) are a new emerging network structure. HetNets have greater potential for radio resource reuse and better service quality than homogeneous networks since they can evolve small cells into macrocells. Effective resource allocation techniques reduce inter-user interference while optimizing the utilization of limited spectrum resources in HetNets. This article discusses resource allocation in 5G HetNets. This paper explains HetNets and how they work. Typical cell types in HetNets are summarized. Also, HetNets models are explained in the third section. The fourth component addresses radio resource control and mobility management. Moreover, future study in this subject may benefit from this article's significant insights on how HetNets function.

• 디지털융복합연구
• /
• 제18권10호
• /
• pp.225-232
• /
• 2020

5G 셀룰러 네트워크 하의 언더레이 기법은 매우 전망 있는 자원공유 기법으로써 이 기법은 5G의 서비스 성능향상과 셀룰러 링크와 D2D(Device to Device) 링크 간의 통신 부하를 줄일 수 있는 효과적인 기법이다. 본 논문에서는 gNB(gNodeB)상에서 5G기반의 멀티 클래스 서비스를 수행하는데 있어서 발생하는 자원간섭을 최소화하고, 분석된 간섭의 제어조건에 따라 5G 통신 서비스를 극대화하기 위한 협력적 우선순위 기반의 자원할당 스케줄링 CPRAS(Cooperative Priority-based Resource Allocation Scheduling)기법을 제안한다. 제안된 CPRAS기법은 각 디바이스들에 대한 통신 자원을 최적화하며, 5G의 통신에 필요한 서비스 요청과 네트워크의 현재 상태에 따라 자원할당을 최적화한다. 또한 제안된 기법은 gNB하의 셀룰러 링크와 D2D링크 간의 자원간섭을 최소화함으로써 기가급의 서비스를 보장하는 기능을 제공한다. 시뮬레이션 결과 제안된 기법이 Pure cellular기법과 Force cellular기법에 비해서 더 나은 시스템 성능을 보였으며, 특히 우선순위가 높고 UE(User Equipment)들 간의 협력이 높을수록 자원간섭 제어가 효과적임을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권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.

• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.106-115
• /
• 2006

The current trend toward the utilization of the Internet as a common means for the offer of heterogeneous services imposes to address the issues related to end-to-end service assurance in the inter-domain scenario. In this paper, we first present an architecture for service management in networks based on service level specifications (SLS). The architecture is designed to be independent both of the specific network technology adopted and of the high level service semantics. Then, we focus on a specific functionality of the proposed architecture: Resource allocation in the multi-domain scenario. A distributed admission control algorithm is introduced, its complexity is evaluated and a comparison with related solutions is provided.

• 방송공학회논문지
• /
• 제13권6호
• /
• pp.883-891
• /
• 2008

최근 차세대 무선 통신 시스템으로 다중 안테나 직교 주파수 다중접속 방식(OFDM)에서 적응적 자원 할당 기술은 사용자들의 QoS를 보장하며 성능을 개선 할 수 있는 중요한 연구 분야로 각광을 받고 있다. 그러나, 현재까지, 대부분의 자원 할당 알고리즘은 유니캐스트 시스템에 국한되어 연구가 진행되고 있다. 따라서, 본 논문에서는 다중 안테나 직교 주파수 다중접속 방식 시스템에서 멀티캐스트 서비스를 위한 동적 자원 할당 기술을 제안하고 이에 대한 전산모의 실험 결과를 통하여 성능 개선 효과를 분석하였다. 실험 분석 결과, 제안하는 동적 자원 할당 기술이 기존의 방식에 비해 우월함을 증명하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.237-239
• /
• 2007

In the paper, we analyze the performances of random access channels in multi-service multi-user OFDMA systems. The resource of the random access channels in OFDMA systems is the nubmer of available sub-channels and PN-codes. For given available sub-channels and PN-codes. we analyze the performances of the random access channels of OFDMA systems according to three resource allocation methods (resource full sharing, resource partial sharing, resource partition) in tenus of the access success probability, the blocking probability, the access delay and the throughput of each service class. Further, we find the feasible region of the access probability of each service class in which the allowable minimum access success probability, the allowable maximum blocking probability and the allowable maximum access delay are satisfied. The results also can be utilized to find proper region of the access probabilities of each service class for differentiated quality of service(QoS)s, and for the system operations.

• ETRI Journal
• /
• 제37권6호
• /
• pp.1242-1250
• /
• 2015

It is very important to provide a parameterized quality of service (QoS) using traffic specification (TSPEC), such as mean data rate, maximum burst size, and peak data rate, when packets from the application layer need to be transmitted with guaranteed services in a high-rate wireless personal area network (HR-WPAN). As medium resources are limited, the optimal medium time required for each device needs to be estimated to share the resources efficiently among devices. This paper proposes a variable-service interval-based resource allocation algorithm to efficiently make a reservation of medium resources based on a parameterized QoS. In other words, the proposed algorithm calculates the number of medium access slots (MASs) based on TSPEC, local resources, and local conditions and determines suitable locations for the MASs within a superframe to accommodate more devices. The simulation results show that the proposed algorithm can accommodate more devices and has greater than 10% resource allocation efficiency in an HR-WPAN compared to existing schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권7호
• /
• pp.3134-3155
• /
• 2020

In this paper, we study the joint radio and computational resource allocation in the ultra-dense mobile-edge computing networks. In which, the scenario which including both computation offloading and communication service is discussed. That is, some mobile users ask for computation offloading, while the others ask for communication with the minimum communication rate requirements. We formulate the problem as a joint channel assignment, power control and computational resource allocation to minimize the offloading cost of computing offloading, with the precondition that the transmission rate of communication nodes are satisfied. Since the formulated problem is a mixed-integer nonlinear programming (MINLP), which is NP-hard. By leveraging the particular mathematical structure of the problem, i.e., the computational resource allocation variable is independent with other variables in the objective function and constraints, and then the original problem is decomposed into a computational resource allocation subproblem and a joint channel assignment and power allocation subproblem. Since the former is a convex programming, the KKT (Karush-Kuhn-Tucker) conditions can be used to find the closed optimal solution. For the latter, which is still NP-hard, is further decomposed into two subproblems, i.e., the power allocation and the channel assignment, to optimize alternatively. Finally, two heuristic algorithms are proposed, i.e., the Co-channel Equal Power allocation algorithm (CEP) and the Enhanced CEP (ECEP) algorithm to obtain the suboptimal solutions. Numerical results are presented at last to verify the performance of the proposed algorithms.