Centralized approaches for virtual network function placement in SDN-enabled networks
Abstract Software-defined networking (SDN) and network function virtualization (NFV) represent significant changes to the architecture of data networks. SDN provides clean separation of the control plane from the data plane while NFV helps virtualize functions typically implemented using middleboxes...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2018-08-01
|
| Series: | EURASIP Journal on Wireless Communications and Networking |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s13638-018-1216-0 |
| _version_ | 1818957797971197952 |
|---|---|
| author | Akshay Gadre Anix Anbiah Krishna M. Sivalingam |
| author_facet | Akshay Gadre Anix Anbiah Krishna M. Sivalingam |
| author_sort | Akshay Gadre |
| collection | DOAJ |
| description | Abstract Software-defined networking (SDN) and network function virtualization (NFV) represent significant changes to the architecture of data networks. SDN provides clean separation of the control plane from the data plane while NFV helps virtualize functions typically implemented using middleboxes into virtual network functions (VNFs). The network function placement (NFP) problem involves placing VNFs to satisfy the service function chaining (SFC) requests of the flows in the network. Current solutions to this problem are slow and cannot handle real-time requests. In this paper, a static NFP solution that uses a divide-and-conquer approach is discussed first, with complexity similar to that of existing solutions. It is shown that the solution is complete and sound. Next, customization of this solution to obtain an agile version that trades off precision for time complexity is discussed. A combination of this divide-and-conquer solution with a modified version of Dijkstra’s algorithm is used to solve the problem for dynamic requests. Finally, a centralized, online SDN-enabled approach to solving the problem is proposed. The proposed architecture and algorithms are simulated and analyzed with various system parameters and are shown to scale to large data center network (DCN) topologies. |
| first_indexed | 2024-12-20T11:15:34Z |
| format | Article |
| id | doaj.art-f2ddb0f7061044ccbfd65d82a7d604f7 |
| institution | Directory Open Access Journal |
| issn | 1687-1499 |
| language | English |
| last_indexed | 2024-12-20T11:15:34Z |
| publishDate | 2018-08-01 |
| publisher | SpringerOpen |
| record_format | Article |
| series | EURASIP Journal on Wireless Communications and Networking |
| spelling | doaj.art-f2ddb0f7061044ccbfd65d82a7d604f72022-12-21T19:42:38ZengSpringerOpenEURASIP Journal on Wireless Communications and Networking1687-14992018-08-012018111910.1186/s13638-018-1216-0Centralized approaches for virtual network function placement in SDN-enabled networksAkshay Gadre0Anix Anbiah1Krishna M. Sivalingam2Department of Computer Science and Engineering, Indian Institute of Technology MadrasDepartment of Computer Science and Engineering, Indian Institute of Technology MadrasDepartment of Computer Science and Engineering, Indian Institute of Technology MadrasAbstract Software-defined networking (SDN) and network function virtualization (NFV) represent significant changes to the architecture of data networks. SDN provides clean separation of the control plane from the data plane while NFV helps virtualize functions typically implemented using middleboxes into virtual network functions (VNFs). The network function placement (NFP) problem involves placing VNFs to satisfy the service function chaining (SFC) requests of the flows in the network. Current solutions to this problem are slow and cannot handle real-time requests. In this paper, a static NFP solution that uses a divide-and-conquer approach is discussed first, with complexity similar to that of existing solutions. It is shown that the solution is complete and sound. Next, customization of this solution to obtain an agile version that trades off precision for time complexity is discussed. A combination of this divide-and-conquer solution with a modified version of Dijkstra’s algorithm is used to solve the problem for dynamic requests. Finally, a centralized, online SDN-enabled approach to solving the problem is proposed. The proposed architecture and algorithms are simulated and analyzed with various system parameters and are shown to scale to large data center network (DCN) topologies.http://link.springer.com/article/10.1186/s13638-018-1216-0VNFNFVSDNNFPDivide-and-ConquerMANO |
| spellingShingle | Akshay Gadre Anix Anbiah Krishna M. Sivalingam Centralized approaches for virtual network function placement in SDN-enabled networks EURASIP Journal on Wireless Communications and Networking VNF NFV SDN NFP Divide-and-Conquer MANO |
| title | Centralized approaches for virtual network function placement in SDN-enabled networks |
| title_full | Centralized approaches for virtual network function placement in SDN-enabled networks |
| title_fullStr | Centralized approaches for virtual network function placement in SDN-enabled networks |
| title_full_unstemmed | Centralized approaches for virtual network function placement in SDN-enabled networks |
| title_short | Centralized approaches for virtual network function placement in SDN-enabled networks |
| title_sort | centralized approaches for virtual network function placement in sdn enabled networks |
| topic | VNF NFV SDN NFP Divide-and-Conquer MANO |
| url | http://link.springer.com/article/10.1186/s13638-018-1216-0 |
| work_keys_str_mv | AT akshaygadre centralizedapproachesforvirtualnetworkfunctionplacementinsdnenablednetworks AT anixanbiah centralizedapproachesforvirtualnetworkfunctionplacementinsdnenablednetworks AT krishnamsivalingam centralizedapproachesforvirtualnetworkfunctionplacementinsdnenablednetworks |