• Title/Summary/Keyword: Slice Allocation

Search Result 7, Processing Time 0.02 seconds

Efficient Slice Allocation Method using Cluster Technology in Fifth-Generation Core Networks

  • Park, Sang-Myeon;Mun, Young-Song
    • Journal of information and communication convergence engineering
    • /
    • v.17 no.3
    • /
    • pp.185-190
    • /
    • 2019
  • The explosive growth of data traffic and services has created cost challenges for networks. Studies have attempted to effectively apply network slicing in fifth generation networks to provide high speed, low latency, and various compatible services. However, in network slicing using mixed-integer linear programming, the operation count increases exponentially with the number of physical servers and virtual network functions (VNFs) to be allocated. Therefore, we propose an efficient slice allocation method based on cluster technology, comprising the following three steps: i) clustering physical servers; ii) selecting an appropriate cluster to allocate a VNF; iii) selecting an appropriate physical server for VNF allocation. Solver runtimes of the existing and proposed methods are compared, under similar settings, with respect to intra-slice isolation. The results show that solver runtime decreases, by approximately 30% on average, with an increase in the number of physical servers within the cluster in the presence of intra-slice isolation.

Multi-Slice Joint Task Offloading and Resource Allocation Scheme for Massive MIMO Enabled Network

  • Yin Ren;Aihuang Guo;Chunlin Song
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.3
    • /
    • pp.794-815
    • /
    • 2023
  • The rapid development of mobile communication not only has made the industry gradually diversified, but also has enhanced the service quality requirements of users. In this regard, it is imperative to consider jointly network slicing and mobile edge computing. The former mainly ensures the requirements of varied vertical services preferably, and the latter solves the conflict between the user's own energy and harsh latency. At present, the integration of the two faces many challenges and need to carry out at different levels. The main target of the paper is to minimize the energy consumption of the system, and introduce a multi-slice joint task offloading and resource allocation scheme for massive multiple input multiple output enabled heterogeneous networks. The problem is formulated by collaborative optimizing offloading ratios, user association, transmission power and resource slicing, while being limited by the dissimilar latency and rate of multi-slice. To solve it, assign the optimal problem to two sub-problems of offloading decision and resource allocation, then solve them separately by exploiting the alternative optimization technique and Karush-Kuhn-Tucker conditions. Finally, a novel slices task offloading and resource allocation algorithm is proposed to get the offloading and resource allocation strategies. Numerous simulation results manifest that the proposed scheme has certain feasibility and effectiveness, and its performance is better than the other baseline scheme.

Resource Allocation Method using Credit Value in 5G Core Networks (5G 코어 네트워크에서 Credit Value를 이용한 자원 할당 방안)

  • Park, Sang-Myeon;Mun, Young-Song
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.4
    • /
    • pp.515-521
    • /
    • 2020
  • Recently, data traffic has exploded due to development of various industries, which causes problems about losing of efficiency and overloaded existing networks. To solve these problems, network slicing, which uses a virtualization technology and provides a network optimized for various services, has received a lot of attention. In this paper, we propose a resource allocation method using credit value. In the method using the clustering technology, an operation for selecting a cluster is performed whenever an allocation request for various services occurs. On the other hand, in the proposed method, the credit value is set by using the residual capacity and balancing so that the slice request can be processed without performing the operation required for cluster selection. To prove proposed method, we perform processing time and balancing simulation. As a result, the processing time and the error factor of the proposed method are reduced by about 13.72% and about 7.96% compared with the clustering method.

A Framework of Resource Provisioning and Customized Energy-Efficiency Optimization in Virtualized Small Cell Networks

  • Sun, Guolin;Clement, Addo Prince;Boateng, Gordon Owusu;Jiang, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5701-5722
    • /
    • 2018
  • The continuous increase in the cost of energy production and concerns for environmental sustainability are leading research communities, governments and industries to amass efforts to reduce energy consumption and global $CO_2$ footprint. Players in the information and communication industry are keen on reducing the operational expenditures (OpEx) and maintaining the profitability of cellular networks. Meanwhile, network virtualization has been proposed in this regard as the main enabler for 5G mobile cellular networks. In this paper, we propose a generic framework of slice resource provisioning and customized physical resource allocation for energy-efficiency and quality of service optimization. In resource slicing, we consider user demand and population resources provisioning scheme aiming to satisfy quality of service (QoS). In customized physical resource allocation, we formulate this problem with an integer non-linear programming model, which is solved by a heuristic algorithm based on minimum vertex coverage. The proposed algorithm is compared with the existing approaches, without consideration of slice resource constraints via system-level simulations. From the perspective of infrastructure providers, traffic is scheduled over a limited number of active small-cell base stations (sc-BSs) that significantly reduce the system energy consumption and improve the system's spectral efficiency. From the perspective of virtual network operators and mobile users, the proposed approach can guarantee QoS for mobile users and improve user satisfaction.

Region-of-Interest Coding using Sub-Picture Slice Structure (내부 영상 슬라이스 구조를 이용한 관심 영역 부호화)

  • 김우식
    • Journal of Broadcast Engineering
    • /
    • v.7 no.4
    • /
    • pp.335-344
    • /
    • 2002
  • A sub-picture slice structure is proposed which can perform the region-of-interest coding effectively, where the subjective quality can be improved by coding the region-of-interest in higher quality than the background region. In addition, the bit allocation mechanism is Proposed where the interval between quantization parameters of the foreground and background region is fixed. And the method to reduce the boundary effect between the foreground and background region is proposed. The foreground region is better protected to the network channel error than the background region. which results in the overall subjective quality improvement in the error prone environments.

Sliced Channel Allocation Method for Multirate Communtiaction Environments using DAMA Scheduler (Multirate 통신환경에서 DAMA 스케줄러를 이용한 슬라이스 채널 할당방법)

  • Yu, Byung-Kwan;Kim, Hae-Ki;An, Chy-Hun;Kim, Nam;Kim, Soo-Hyung
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.10 no.2
    • /
    • pp.157-168
    • /
    • 1999
  • In this paper the new channel allocation method which is important in designing mobile radio system, is proposed. If the channel is allocated by time-frequency-code sliced and using DAMA scheduler, the blocking probability is lower than TA channel allocation method. With traffic load $\rho$=0.8 and 2% of blocking probability, TFS method can allocate 36 slices compared to 11 slices in TA method. At traffic load $\rho$=0.9 and 1% of blocking probability, the maximum available slices are 13 in TA method, but in TFS method 40 slices are allocated to user, so TFS method is better frequency availability by 3.75 times than TA method. TFS method could be suitable for system planning to multirate communication users.

  • PDF

R-lambda Model based Rate Control for GOP Parallel Coding in A Real-Time HEVC Software Encoder (HEVC 실시간 소프트웨어 인코더에서 GOP 병렬 부호화를 지원하는 R-lambda 모델 기반의 율 제어 방법)

  • Kim, Dae-Eun;Chang, Yongjun;Kim, Munchurl;Lim, Woong;Kim, Hui Yong;Seok, Jin Wook
    • Journal of Broadcast Engineering
    • /
    • v.22 no.2
    • /
    • pp.193-206
    • /
    • 2017
  • In this paper, we propose a rate control method based on the $R-{\lambda}$ model that supports a parallel encoding structure in GOP levels or IDR period levels for 4K UHD input video in real-time. For this, a slice-level bit allocation method is proposed for parallel encoding instead of sequential encoding. When a rate control algorithm is applied in the GOP level or IDR period level parallelism, the information of how many bits are consumed cannot be shared among the frames belonging to a same frame level except the lowest frame level of the hierarchical B structure. Therefore, it is impossible to manage the bit budget with the existing bit allocation method. In order to solve this problem, we improve the bit allocation procedure of the conventional ones that allocate target bits sequentially according to the encoding order. That is, the proposed bit allocation strategy is to assign the target bits in GOPs first, then to distribute the assigned target bits from the lowest depth level to the highest depth level of the HEVC hierarchical B structure within each GOP. In addition, we proposed a processing method that is used to improve subjective image qualities by allocating the bits according to the coding complexities of the frames. Experimental results show that the proposed bit allocation method works well for frame-level parallel HEVC software encoders and it is confirmed that the performance of our rate controller can be improved with a more elaborate bit allocation strategy by using the preprocessing results.