Browsing by Author "Lai, Chia-Lin"

Now showing 1 - 5 of 5

End-to-End Slicing as a Service with Computing and Communication Resource Allocation for Multi-Tenant 5G Systems
(2019-10-01)
Chien, Hsu-Tung
;
Lin, Ying-Dar
;
Lai, Chia-Lin
;
Wang, Chien-Ting
;
交大名義發表
5G services, such as Ultra-reliable and Low Latency Communications, Massive Machine Type Communications and Enhanced Mobile Broadband, support low (or ultra-low) latency, a huge number of connections, and high bandwidth. Typically, 5G platforms are shared by multiple tenants, where each tenant has different service deployment requirements and thus requires different amounts of resources from the lower tier (i.e., radio access network and mobile edge) and upper tier (i.e., transport network and central office) of the 5G architecture. Consequently, slicing is a key technology in 5G networks for providing scalability and flexibility in allocating the 5G resources with appropriate isolation. This study proposes an Endto- End Slicing as a Service framework for slicing both computing and communication resources across the full 2-tier multi-access edge computing architecture. The framework is implemented using open source tools. It is shown that the framework successfully isolates the 5G resources, which are computing and communication, between slices (slicing isolation effect ratio equals 1) and ensures that resources of the deployed slices are merely sufficient to meet the latency requirements of the tenants. Moreover, the experiments show that URLLC and mMTC services require more than 70 percent of the needed computing and communication resources be provided by the edge and RAN in order to satisfy their tighter latency requirements. Overall, the results suggest a central to edge resource allocation ratio of 9:1, 3:7, and 1:9 for the eMBB, URLLC, mMTC applications, respectively. Therefore,
End-to-End Slicing With Optimized Communication and Computing Resource Allocation in Multi-Tenant 5G Systems
(2020-02-01)
Chien, Hsu-Tung
;
Lin, Ying-Dar
;
Lai, Chia-Lin
;
Wang, Chien-Ting
;
交大名義發表
Slicing is a key technology in 5G networks to provide scalability and flexibility in allocating computing and communication resources among multiple tenants. Typically, 5G networks have a 2-tier architecture consisting of a central office and transport network in the upper tier and a multi-access edge and radio access network in the lower tier. The tenants which share the 2-tier architecture typically have different service-dependent resource requirements. This study proposes an algorithm, designated as Upper-tier First with Latency-bounded Over-provisioning Prevention (UFLOP), to adjust the capacity and traffic allocation in such a way as to minimize the "over-provisioning ratio" while still satisfying the latency constraints and Service Level Agreements (SLAs) of the tenants. The performance of UFLOP is evaluated experimentally with a real testbed on an end-to-end slicing framework using three typical 5G services, namely Enhanced Mobile Broadband (eMBB), Ultra-Reliable Low Latency (URLLC), and massive Machine Type Connection (mMTC). It is shown that UFLOP successfully determines the critical traffic allocation ratio between the central office and the edge which achieves an over-provisioning ratio close to zero while still meeting the latency requirements. The results suggest optimal resource allocation ratios of 10:0, 1.5:8.5 and 7.8:2.2 for the eMBB, URLLC and mMTC applications, respectively. Furthermore, it is shown that the computing resource behaves as a bottleneck for the eMBB and mMTC services, while the communication resource serves as a bottleneck for the URLLC service.
Multi-operator Fairness in Transparent RAN Sharing
(2018-01-01)
Lin, Ying-Dar
;
Chien, Hsu-Tung
;
Chang, Hsien-Wen
;
Lai, Chia-Lin
;
資訊工程學系
Radio access network (RAN) sharing attracts much attention from telecom operators. However, current mechanisms applied to RAN sharing do not consider fairness among operators such that the RAN is not fairly shared, and either under-or over-utilized. Fairness cannot be guaranteed among operators because resources are distributed on a first-come-first-serve basis. "Soft-partition with Blocking and Dropping" (SBD)" is proposed to offer inter-operator fairness based on a "soft-partition" concept. Subscribers to an operator may overuse the predefined service-level-agreement (SLA) when the shared RAN is under-utilized, but become blocked or even dropped when over-utilized. According to our simulation results, SBD maintains inter-operator fairness at 0.997, even better than hard-partition at 0.98 and much better than no-partition at 0.6. Meanwhile, it retains high utilization of shared RAN at 98%. SBD reduces blocking rate from 35% of hard partition to almost 0%, while controlling dropping rate at 5%.
Multi-Operator Fairness in Transparent RAN Sharing by Soft-Partition With Blocking and Dropping Mechanism
(2018-12-01)
Chien, Hsu-Tung
;
Lin, Ying-Dar
;
Chang, Hsien-Wen
;
Lai, Chia-Lin
;
資訊工程學系
Radio access network (RAN) sharing has attracted significant attention from telecom operators as a means of accommodating data surges. However, current mechanisms for RAN sharing ignore the fairness issue among operators, and hence the RAN may be under- or over-utilized. Furthermore, the fairness among different operators cannot be guaranteed, since the RAN resources are distributed on a first come, first served basis. Accordingly, the present study proposes a "soft-partition with blocking and dropping" (SBD) mechanism that offers inter-operator fairness using a "soft-partition" approach. In particular, the operator subscribers are permitted to overuse the resources specified in the predefined service-level-agreement when the shared RAN is under-utilized, but are blocked (or even dropped) when the RAN is over-utilized. The simulation results show that SBD achieves an inter-operator fairness of 0.997, which is higher than that of both a hard-partition approach (0.98) and a no-partition approach (0.6) while maintaining a shared RAN utilization rate of 98%. Furthermore, SBD reduces the blocking rate from 35% (hard partition approach) to almost 0%, whereas controlling the dropping rate at 5%. Notably, the dropping rate can be reduced to almost 0% using a newly proposed bandwidth scale down procedure.
TRANSPARENT RAN SHARING OF 5G SMALL CELLS AND MACROCELLS
(2017-12-01)
Lin, Ying-Dar
;
Chien, Hsu-Tung
;
Chang, Hsien-Wen
;
Lai, Chia-Lin
;
Lin, Kun-Yi
To cope with the growth of mobile data traffic in 5G systems, telecom operators have to set up more small cells and macrocells in the same area. However, because of space limitations, it is difficult for each operator to do so, and RAN sharing would thus become mandatory for 5G systems. In this work, RANP is proposed, which will achieve transparent RAN sharing by setting up RANP between a base station to be shared and multiple core networks. Over and above the general one-level proxy architecture, an extended two-level architecture is proposed that will share both small cells and macrocells. According to our emulation results, additional packet processing time of a RANP is about 2 ms, 3.8 percent of the total end-to-end latency. Its impact on throughput is about 3 percent and can be regarded as irrelevant.