Please use this identifier to cite or link to this item:
Title: H-RAN: An Approach Toward Cloud-RAN Load Balancing
Authors: Mahapatra, Byomakesh
Turuk, Ashok Ku
Ray, Niranjan
Yadav, Awaneesh Ku
Keywords: C-RAN
Load Balancing
Issue Date: Dec-2018
Citation: 17th International Conference on Industrial Technology (ICIT 2018), Bhubaneswar, India, 20-22 December 2018
Abstract: The centralized cloud radio access network (CRAN), change the BS architecture to a large extent, in term of associated cost and coverage. The main limitations of C-RAN architecture is that it has a centralized processing unit, which increases the network latency by increasing the service waiting time. The proposed Heterogeneous Radio Access Network (HRAN) consist of some Edge node and local processing unit (LPU) which resides in remote radio head (RRH). This introduction of enhanced RRH (eRRH) node increases the capacity of the network and decrease the network latency, on the other hand its also share the computing and controlling task of the centralized BBU. The proposed LPU unit consists of a number of small VB which generally handle real-time computing and processing task.In the first section of this paper, we have proposed a new RAN architecture and all the load balancing condition are represented through a detail mathematical model. The paper also present a load-aware dynamic BS switching algorithm (LDBSS) for power optimization and load balancing. The simulation work is carried out with the help of CloudSim 3.0.3 simulator by considering equal number of packet arrival for both C-RAN and H-RAN. The simulated result shows that with the introduction of the middle Edge layer and LPU at the RRH reduces the waiting time and blocking probability of the network as compared the C-RAN architecture.
Description: Copyright of this document belongs to proceedings publisher.
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
2018_ICIT_BMahapatra_H-RAN.pdfConference paper401.69 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.