#
Effectiveness of Segment Routing Technology in Reducing the Bandwidth and Cloud Resources Provisioning Times in Network Function Virtualization Architectures^{ †}

^{1}

^{2}

^{*}

^{†}

## Abstract

**:**

## 1. Introduction

- the proposal of a scalable and ETSI compliant orchestration architecture in Multi-Provider NFV environments;
- the definition of a SRv6-based data plane for the SFC routing applicable for the proposed scalable orchestration;
- the proposal of an ad hoc algorithm for the proposed orchestration architecture and the investigation of its computational complexity;
- the comparison in terms of computational complexity of the proposed solution with respect to the one of a traditional orchestration.

## 2. Related Work

## 3. Proposal of a Scalable and ETSI Compliant NFV Orchestration Architecture

- the NFVO needs to acquire a lot of information and the graph representing the entire network topology and the available cloud and bandwidth resources can become very complex;
- the SFC Routing and Cloud and Bandwidth resource Allocation (SRCBA) algorithm does not scale with the increase in both the number of servers and switches of the NFVI-PoP networks;
- the solution is not applicable in the case of multi-provider NFV environments in which the providers of each NFVI-PoP may need to hire the organization of their own NFVI-PoP network and not make it visible to the owner of the NFVO.

## 4. Segment Routing Based SFC Routing

## 5. Cloud and Bandwidth Resource Allocation Problem

#### 5.1. NFVI-PoP, Network and Traffic Model

- ${\overline{v}}_{i}\in {\overline{V}}_{A}$ and ${\overline{w}}_{i}\in {\overline{V}}_{A}$ denote the originating and terminating access nodes the SFC;
- ${M}_{i}$ is the number of service functions to be executed for the SFC according to a given order; we assume that the SFs belong to a set of F types;
- $\overrightarrow{{s}_{i}}$ is a 1’s or 0’s matrix of size ${M}_{i}\times F$; the component ${s}_{i}(j,k)$ assumes the value 1 if the j-th SF to be executed is a k-th type SF;
- ${b}_{i}$ is the bandwidth offered by the i-th SFC.

#### 5.2. SFC Routing and Cloud and Bandwidth Resource Allocation (SRCBA) Algorithm

## 6. Numerical Results

## 7. Conclusions

## Author Contributions

## Funding

## Conflicts of Interest

## References

- Eramo, V.; Tosti, A.; Miucci, E. Server Resource Dimensioning and Routing of Service Function Chain in NFV Network Architectures. J. Electr. Comput. Eng.
**2016**, 2016, 7139852. [Google Scholar] [CrossRef] - Kar, B.; Wu, E.H.K.; Lin, Y.D. Energy Cost Optimization in Dynamic Placement of Virtualized Network Function Chains. IEEE Trans. Netw. Serv. Manag.
**2018**, 15, 372–386. [Google Scholar] [CrossRef] - Carpio, F.; Dhahri, S.; Jukan, A. VNF Placement with Replication for Load Balancing in NFV Networks. In Proceedings of the 2017 IEEE International Conference on Communications (ICC), Paris, France, 21–25 May 2017. [Google Scholar]
- Chen, H.; Wang, X.; Zhao, Y.; Song, T.; Wang, Y.; Xu, S.; Li, L. MOSC: A method to assign the outsourcing of service function chain across multiple clouds. Comput. Netw.
**2018**, 133, 166–182. [Google Scholar] [CrossRef] - Wang, C.-C.; Lin, Y.-D.; Wu, J.-J.; Lin, P.-C.; Hwang, R.-H. Towards Optimal Resource Allocation of Virtualized Network Functions for Hierarchical Datacenters. IEEE Trans. Netw. Serv. Manag.
**2018**, 15, 1532–1544. [Google Scholar] [CrossRef] - Yi, B.; Wang, X.; Li, K.; Das, S.K.; Huang, M. A comprehensive survey of Network Function Virtualization. Comput. Netw.
**2018**, 133, 212–262. [Google Scholar] [CrossRef] - Bari, M.F.; Chowdhury, S.R.; Ahmed, R.; Boutaba, R.; Muniz, O.C.; Duarteyh, B. Orchestrating Virtualized Network Functions. IEEE Trans. Netw. Serv. Manag.
**2016**, 13, 725–739. [Google Scholar] [CrossRef] - De Sousa, N.F.S.; Perez, D.A.L.; Rosa, R.V.; Santos, M.A.S.; Rothenberg, C.E. Network Service Orchestration: A Survey. arXiv, 2018; arXiv:1803.06596. [Google Scholar]
- Mijumbi, R.; Serrat, J.; Gorricho, J.; Bouten, N.; De Turck, F.; Boutaba, R. Network Function Virtualization: State-of-the-art and Research Challenges. IEEE Commun. Surv. Tutor.
**2016**, 18, 236–262. [Google Scholar] [CrossRef] - Wang, Y.; Lu, P.; Lu, W.; Zhu, Z. Cost-Efficient Virtual Network Function Graph (vNFG) Provisioning in Multidomain Elastic Optical Networks. J. Lightwave Technol.
**2017**, 35, 2712–2723. [Google Scholar] [CrossRef] - ETSI. Network Function Virtualization (NFV); Management and Orchestration; Report on Architectural Options. ETSI GS NFV-IFA 009. Available online: https://www.etsi.org/ (accessed on 23 December 2018).
- Cianfrani, A.; Listanti, M.; Polverini, M. Incremental Deployment of Segment Routing Into an ISP Network: A Traffic Engineering Perspective. IEEE/ACM Trans. Netw.
**2017**, 25, 3146–3160. [Google Scholar] [CrossRef] - Paolucci, F. Network Service Chaining Using Segment Routing in Multi-Layer Networks. J. Opt. Commun. Netw.
**2018**, 10, 582–592. [Google Scholar] [CrossRef] - Filsfils, C.; Nainar, N.K.; Pignataro, C.; Cardona, J.C.; Francois, P. The Segment Routing Architecture. In Proceedings of the 2015 IEEE Global Communications Conference (GLOBECOM), San Diego, CA, USA, 6–10 December 2015. [Google Scholar]
- Eramo, V.; Lavacca, F.G.; Catena, T.; Polverini, M.; Cianfrani, A. Proposal and Investigation of a Scalable NFV Orchestrator Based on Segment Routing Data/Control Plane. In Proceedings of the 14th International Conference on Network and Service Management, Rome, Italy, 5–9 November 2018. [Google Scholar]
- Feng, H.; Llorca, J.; Tulino, A.M.; Raz, D.; Molisch, A.F. Approximation Algorithms for the NFV Service Distribution Problem. In Proceedings of the INFOCOM 2017-IEEE Conference on Computer Communications, IEEE, Atlanta, GA, USA, 1–4 April 2017. [Google Scholar]
- Xie, Y.; Liu, Z.; Wang, S.; Wang, Y. Service Function Chaining Resource Allocation: A Survey. arXiv, 2016; arXiv:1608.00095. [Google Scholar]
- Herrera, J.G.; Botero, J.F. Resource Allocation in NFV: A Comprehensive Survey. IEEE Trans. Netw. Serv. Manag.
**2016**, 13, 518–532. [Google Scholar] [CrossRef] - Li, X.; Qian, C. A Survey of Network Function Placement. In Proceedings of the 2016 13th IEEE AnnualConsumer Communications and Networking Conference (CCNC), Las Vegas, CA, USA, 15–16 March 2016; pp. 1–6. [Google Scholar]
- Ghaznavi, M.; Khan, A.; Shahriar, N.; Alsubhi, K.; Ahmed, R.; Boutaba, R. Elastic Virtual Network Function Placement. In Proceedings of the 4th IEEE conference on Cloud Networking (CloudNet) 2015, Niagara Falls, ON, Canada, 5–7 October 2015. [Google Scholar]
- Ghaznavi, M.; Shahriar, N.; Ahmed, R.; Boutaba, R. Service Function Chaining Simplified. arXiv, 2016; arXiv:1601.00751. [Google Scholar]
- Wang, X.; Wu, C.; Le, F.; Liu, A.; Li, Z.; Lau, F. Online VNF Scaling in Datacenters. arXiv, 2016; arXiv:1604.01136. [Google Scholar] [Green Version]
- Liu, J.; Lu, W.; Zhou, F.; Lu, P.; Zhu, Z. On Dynamic Service Function Chain Deployment and Readjustment. IEEE Trans. Netw. Serv Manag.
**2017**, 14, 543–553. [Google Scholar] [CrossRef] - Pei, J.; Hong, P.; Xue, K.; Li, D. Efficiently Embedding Service Function Chains with Dynamic Virtual Network Function Placement in Geo-distributed Cloud System. IEEE Trans. Parallel Distrib. Syst.
**2019**. [Google Scholar] [CrossRef] - Cappanera, P.; Paganelli, F.; Paradiso, F. VNF placement for service chaining in a distributed cloud environment with multiple stakeholders. Comput. Commun.
**2019**, 133, 24–40. [Google Scholar] [CrossRef] - ETSI. Network Functions Virtualisation: Introductory; White Paper; SDN and OpenFlow World Congress. Available online: https://portal.etsi.org/nfv/nfv (accessed on 23 December 2018).
- Desmouceaux, Y.; Pfister, P.; Tollet, J.; Townsley, M.; Clausen, T. The Power of Choices in Load Balancing with Segment Routing. In Proceedings of the 2017 IEEE 37th International Conference on Distributed Computing Systems, Atlanta, GA, USA, 5–8 June 2017. [Google Scholar]
- Duchene, F.; Lebrun, D.; Bonaventure, O. SRv6Pipes: Enabling in-network bytestream functions. In Proceedings of the IFIP Networking 2018, Zurich, Switzerland, 14–16 May 2018. [Google Scholar]
- Lebrun, D.; Bonaventure, O. Implementing IPv6 Segment Routing in the Linux Kernel. In Proceedings of the Applied Networking Research Workshop, Prague, Czech Republic, 15 July 2017. [Google Scholar]
- AbdelSalam, A.; Clad, F.; Filsfils, C.; Salsano, S.; Siracusano, G.; Veltri, L. Implementation of virtual network function chaining through segment routing in a linux-based NFV infrastructure. In Proceedings of the 2017 IEEE Conference on Network Softwarization (NetSoft), Bologna, Italy, 3–7 July 2017. [Google Scholar]
- Abdelsalam, A.; Salsano, S.; Clad, F.; Camarillo, P.; Filsfils, C. SERA: SEgment Routing Aware Firewall for Service Function Chaining scenarios. In Proceedings of the IFIP Networking, Zurich, Switzerland, 14–16 May 2018. [Google Scholar]
- Desmouceaux, Y.; Townsley, M.; Clausen, T.H. Zero-Loss Virtual Machine Migration with IPv6 Segment Routing. In Proceedings of the 2018 14th International Conference on Network and Service Management (CNSM), Rome, Italy, 5–9 November 2018. [Google Scholar]
- Eramo, V.; Lavacca, F.G. Processing and Bandwidth Resource Allocation in Multi-Provider NFV Cloud Infrastructures interconnected by Elastic Optical Networks. In Proceedings of the 2018 20th International Conference on Transparent Optical Networks, Bucharest, Romania, 1–5 July 2018. [Google Scholar]
- Fei, X.; Liu, F.; Xu, H.; Jin, H. Adaptive VNF Scaling and Flow Routing with Proactive Demand Prediction. In Proceedings of the INFOCOM 2018-IEEE Conference on Computer Communications, Honolulu, HI, USA, 16–19 April 2018. [Google Scholar]
- Cheng, X.; Wu, Y.; Min, G.; Zomaya, A.Y. Network Function Virtualization in Dynamic Networks: A Stochastic Perspective. IEEE J. Sel. Areas Commun.
**2018**, 36, 2218–2232. [Google Scholar] [CrossRef] - Filsfils, C.; Garvia, P.C.; Leddy, J.; Voyer, D.; Matsushima, S.; Li, Z. SRv6 Network Programming. Available online: https://tools.ietf.org/html/draft-filsfils-spring-srv6-network-programming-06 (accessed on 9 February 2019).
- Lin, P.-C.; Lin, Y.-D.; Wu, C.-Y.; Lai, Y.-C.; Kao, Y.-C. Balanced Service Chaining in Software-Defined Networks with Network Function Virtualization. Computer
**2016**, 49, 68–76. [Google Scholar] [CrossRef] - Eramo, V.; Lavacca, F.G. Computing and Bandwidth Resource Allocation in Multi-Provider NFV Environment. IEEE Commun. Lett.
**2018**, 22, 2060–2063. [Google Scholar] [CrossRef] - Evolving the Mobile Core to Being Cloud Native. White Paper. Available online: https://ieeexplore.ieee.org/document/8463557 (accessed on 7 February 2019).

**Figure 3.**A segment routing based data/control plane for the scalable NFV orchestration architecture.

**Figure 4.**Application example of the SFC Routing and Cloud and Bandwidth resource Allocation (SRCBA) algorithm to the case of a cloud infrastructure composed by three Network Function Virtualization Infrastructure-Point of Presence (NFVI-PoP), that is NFVI-PoP-1, NFVI-PoP-2 and NFVI-PoP-3 equipped with two, two and one servers, respectively; one FW VNFI and one IDS VNFI are already activated in the NFVI-PoP-1 and NFVI-PoP-3, respectively. The SRCBA algorithm has to accommodate a Service Function Chain (SFC) composed of one Firewall (FW) and one Intrusion Detection System (IDS).

**Figure 5.**Construction of the multi-stage graph for the Scalable Orchestration solution of the SRCBA algorithm. The cases x = 3$ (

**a**) and x = 8$ (

**b**) for the bandwidth interconnection cost between NFVI-PoP-1 and NFVI-PoP-3 of Figure 4 are reported.

**Figure 7.**Construction of the multi-stage graph for the SO solution of the SRCBA algorithm. The cases x = 3$ (

**a**) and x = 8$ (

**b**) for the bandwidth interconnection cost between NFVI-PoP-1 and NFVI-PoP-3 of Figure 4 are reported.

**Figure 9.**NSFNET (USA) network composed of 16 switches and 25 links. The four cases with a number ${N}_{NFVI}$ of NFVI-PoPs equal to 4 (

**a**), 7 (

**b**), 10 (

**c**) and 14 (

**d**) are considered.

**Figure 10.**Composition of the Service Function Chain; four types are considered: the first one composed of a Firewall (FW) (

**a**), the second one composed of an FW and an Intrusion Detection System (IDS) (

**b**); the third one composed of an FW, an IDS and a Network Address Translator (NAT) (

**c**); and the fourth one composed of an FW, an IDS, a NAT and a Proxy (

**d**).

**Figure 11.**SRCBA execution time versus the number of SFC requests for the TO and SO solutions and when the Deutsche Telekom network is considered. The TO solution is investigated when the number ${N}_{s}$ of servers in each NFVI-PoP equals 4.

**Figure 12.**SRCBA execution time versus the number of SFC requests for the TO and SO solutions and when the Deutsche Telekom network is considered. The TO solution is investigated when the number ${N}_{s}$ of servers in each NFVI-PoP is equal to 2, 4 and 6.

**Figure 13.**SRCBA execution time versus the number of SFC requests for the TO and SO solutions. The number ${N}_{NVFI}$ of NFVIs is varied from 4 to 14 and the NFVI-PoPs are located as shown in Figure 9. The TO solution is investigated when the number ${N}_{s}$ of servers in each NFVI-PoP is equal to 4.

**Figure 14.**Total cost versus the number of SFC requests for the TO and SO solutions. The number ${N}_{NVFI}$ of NFVIs is varied from 4 to 14 and the NFVIs are located as shown in Figure 9. The TO solution is investigated when the number ${N}_{s}$ of servers in each NFVI-PoP is equal to 4.

**Table 1.**Maximum processing capacity and allocated number of cores for the software modules implementing FW, IDS, NAT and Proxy.

Maximum Processing Capacity (${\mathit{C}}^{\mathit{pr},\mathit{max}}$) | Number of Cores Allocated (${\mathit{n}}^{\mathit{c}}$) | |
---|---|---|

FW | 0.9 Gbps | 4 |

IDS | 0.6 Gbps | 8 |

NAT | 0.9 Gbps | 2 |

Proxy | 0.9 Gbps | 4 |

© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

## Share and Cite

**MDPI and ACS Style**

Eramo, V.; Lavacca, F.G.; Catena, T.; Polverini, M.; Cianfrani, A.
Effectiveness of Segment Routing Technology in Reducing the Bandwidth and Cloud Resources Provisioning Times in Network Function Virtualization Architectures. *Future Internet* **2019**, *11*, 71.
https://doi.org/10.3390/fi11030071

**AMA Style**

Eramo V, Lavacca FG, Catena T, Polverini M, Cianfrani A.
Effectiveness of Segment Routing Technology in Reducing the Bandwidth and Cloud Resources Provisioning Times in Network Function Virtualization Architectures. *Future Internet*. 2019; 11(3):71.
https://doi.org/10.3390/fi11030071

**Chicago/Turabian Style**

Eramo, Vincenzo, Francesco G. Lavacca, Tiziana Catena, Marco Polverini, and Antonio Cianfrani.
2019. "Effectiveness of Segment Routing Technology in Reducing the Bandwidth and Cloud Resources Provisioning Times in Network Function Virtualization Architectures" *Future Internet* 11, no. 3: 71.
https://doi.org/10.3390/fi11030071