TY - GEN
T1 - Server placement and assignment in virtualized radio access networks
AU - Mijumbi, Rashid
AU - Serrat, Joan
AU - Gorricho, Juan Luis
AU - Rubio-Loyola, Javier
AU - Davy, Steven
N1 - Publisher Copyright:
© 2015 IFIP.
PY - 2015/12/28
Y1 - 2015/12/28
N2 - The virtualization of Radio Access Networks (RANs) has been proposed as one of the important use cases of Network Function Virtualization (NFV). In Virtualized Radio Access Networks (VRANs), some functions from a Base Station (BS), such as those which make up the Base Band Unit (BBU), may be implemented in a shared infrastructure located at either a data center or distributed in network nodes. For the latter option, one challenge is in deciding which subset of the available network nodes can be used to host the physical BBU servers (the placement problem), and then to which of the available physical BBUs each Remote Radio Head (RRH) should be assigned (the assignment problem). These two problems constitute what we refer to as the VRAN Placement and Assignment Problem (VRAN-PAP). In this paper, we start by formally defining the VRAN-PAP before formulating it as a Binary Integer Linear Program (BILP) whose objective is to minimize the server and front haul link setup costs as well as the latency (or distance) between each RRH and its assigned BBU. Since the BILP could become computationally intractable, we also propose a greedy approximation for larger instances of the VRAN-PAP.
AB - The virtualization of Radio Access Networks (RANs) has been proposed as one of the important use cases of Network Function Virtualization (NFV). In Virtualized Radio Access Networks (VRANs), some functions from a Base Station (BS), such as those which make up the Base Band Unit (BBU), may be implemented in a shared infrastructure located at either a data center or distributed in network nodes. For the latter option, one challenge is in deciding which subset of the available network nodes can be used to host the physical BBU servers (the placement problem), and then to which of the available physical BBUs each Remote Radio Head (RRH) should be assigned (the assignment problem). These two problems constitute what we refer to as the VRAN Placement and Assignment Problem (VRAN-PAP). In this paper, we start by formally defining the VRAN-PAP before formulating it as a Binary Integer Linear Program (BILP) whose objective is to minimize the server and front haul link setup costs as well as the latency (or distance) between each RRH and its assigned BBU. Since the BILP could become computationally intractable, we also propose a greedy approximation for larger instances of the VRAN-PAP.
KW - network function virtualization
KW - resource assignment
KW - server placement
KW - virtualized radio access networks
UR - http://www.scopus.com/inward/record.url?scp=84964091596&partnerID=8YFLogxK
U2 - 10.1109/CNSM.2015.7367390
DO - 10.1109/CNSM.2015.7367390
M3 - Conference contribution
AN - SCOPUS:84964091596
T3 - Proceedings of the 11th International Conference on Network and Service Management, CNSM 2015
SP - 398
EP - 401
BT - Proceedings of the 11th International Conference on Network and Service Management, CNSM 2015
A2 - Madeira, Edmundo Roberto Mauro
A2 - Serrat, Joan
A2 - Schonwalder, Jurgen
A2 - Schmitt, Corinna
A2 - Tortonesi, Mauro
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 11th International Conference on Network and Service Management, CNSM 2015
Y2 - 9 November 2015 through 13 November 2015
ER -