APRIANI S, ROSA and Puspita, Fitri Maya and Indrawati, Indrawati (2018) IMPROVED MODEL DOWNLINK CLOUD RADIO ACCESS NETWORK (C-RAN) PADA EFISIENSI KONSUMSI BANDWIDTH DALAM JARINGAN. Undergraduate thesis, Sriwijaya University.
Preview |
Text
RAMA_44201_08011281419039_0006107501_0010067102_01_front_ref.pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (741kB) | Preview |
Text
RAMA_44201_08011281419039_0006107501_0010067102_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (323kB) | Request a copy |
|
Text
RAMA_44201_08011281419039_0006107501_0010067102_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (162kB) | Request a copy |
|
Text
RAMA_44201_08011281419039_0006107501_0010067102_04.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (1MB) | Request a copy |
|
Text
RAMA_44201_08011281419039_0006107501_0010067102_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (91kB) | Request a copy |
|
Text
RAMA_44201_08011281419039_0006107501_0010067102_06_ref.pdf - Bibliography Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (170kB) | Request a copy |
Abstract
This research attempts to improve and analyze the optimal networking pricing schemes by using downlink C-RAN model. Downlink C-RAN is cloud computing which is focuses on transmitting centralized data and connecting to mobile antennas and sending them to radio anntenas network by backhaul digital linked. This research was solved as a problem of Mixed Integer Linear Programming (MILP). An optimal pricing scheme is applied to a local data server, including lpse traffic and proxy. Downlink C-RAN model was divided into VI cases based on using bandwidth consumption and time such a busy time used dynamic bs clustering model and used static bs clustering to others. The maximum result obtained in case II by using dynamic bs clustering with a value of 3521.865/kbps. Downlink C-RAN model established is solved by using LINGO. Based on the analysis that has been done, the results of this research showed that; dynamic bs clustering model can be utilized to maximize revenue by resetting the sales of networking connections.
Item Type: | Thesis (Undergraduate) |
---|---|
Uncontrolled Keywords: | Downlink C-RAN, Bandwidth, Dynamic Bs Clustering, Static Bs Clustering, MILP, LINGO |
Subjects: | Q Science > QA Mathematics > QA1-939 Mathematics Q Science > QA Mathematics > QA75-76.95 Calculating machines > QA75 Electronic computers. Computer science |
Divisions: | 08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1) |
Depositing User: | Mrs Dies Meirita Sari |
Date Deposited: | 08 Aug 2019 04:26 |
Last Modified: | 08 Aug 2019 04:26 |
URI: | http://repository.unsri.ac.id/id/eprint/3024 |
Actions (login required)
View Item |