Rao, Ying (2022) Distributed Provisioning of 5G Service Requests. Masters thesis, Concordia University.
Preview |
Text (application/pdf)
10MBRao_MCompSc_S2022.pdf - Accepted Version Available under License Spectrum Terms of Access. |
Abstract
Service function chain (SFC) plays a prominent role in realizing 5G Slicing and next generation networks. Supported by the emerging techniques such as Software-Defined Networking (SDN) and Network Function Virtualization (NFV), network operators can freely define and configure a variety of complex network services or SFCs based on business needs, policies, and quality of service (QoS) requirements.
Additionally, 5G networks are expected to be highly dynamic, constantly upgrading and scaling, in which case a plug-and-play mechanism is needed to avoid high operational and management costs, for which the flexible and scalable distributed system is well suited.
This thesis investigates the distributed SFC provisioning problem, and propose a fully distributed algorithm that runs with dynamic traffic aiming to find and reserve the best suited network and compute resources for each SFC request with manageable messaging costs.
We implemented the resulting algorithm in the OMNET++ environment and conducted a series of experiments with different dynamic traffic instances running on a distributed network. We then compare its performance with a classical centralized resource constraint shortest path (RCSP) algorithm, the results show that our 5G provisioning algorithm obtains a similar performance to the centralized RCSP in terms of throughput and acceptance rate.
| Divisions: | Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering |
|---|---|
| Item Type: | Thesis (Masters) |
| Authors: | Rao, Ying |
| Institution: | Concordia University |
| Degree Name: | M. Comp. Sc. |
| Program: | Computer Science |
| Date: | 2 February 2022 |
| Thesis Supervisor(s): | Jaumard, Brigitte |
| Keywords: | Distributed Routing, Routing Path Computation, Service Function Chain, Virtual Network Function, Compute Resource Management |
| ID Code: | 990299 |
| Deposited By: | Ying Rao |
| Deposited On: | 16 Jun 2022 15:07 |
| Last Modified: | 16 Jun 2022 15:07 |
References:
[1] U. Agarwal and V. Ramachandran. Faster deterministic all pairs shortest paths in congest model. In 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 11 – 21, 2020.[2] A. Betker, C. Gerlach, R. Hülsermann, M. J ger, M. Barry, S. Bodamer, J. Sp th, C. Gauger, and M. K hn. Reference transport network scenarios. MultiTeraNet Report, 2003.
[3] A. Dwaraki and T. Wolf. Adaptive service-chain routing for virtual network functions in software-defined networks. In Workshop on Hot topics in Middleboxes and Network Function Virtualization (HotMIddlebox), pages 32–37, 2016.
[4] M. Elkin. Distributed exact shortest paths in sublinear time. J. ACM, 67(3), May 2020.
[5] Ericsson. This is 5G. https://www.ericsson.com/49f1c9/assets/local/5g/documents/07052021-ericsson-this-is-5g.pdf, 2021.(accessed: 2021-12-17).
[6] J. J. Garcia-Lunes-Aceves. Loop-free routing using diffusing computations. IEEE/ACM transactions on networking, 1(1):130–141, 1993.
[7] M. Ghaffari and J. Li. Improved distributed algorithms for exact shortest paths. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, page 431–444, New York, NY, USA, 2018. Association for Computing Machinery.
[8] GSA. 5G network slicing for vertical industries. https://www-file.huawei.com/-/media/corporate/pdf/news/gsa-5g-network-slicing-for-vertical-industries.pdf?la=zh, 2017. (accessed: 2021-12-17).
[9] K. Kaur, V. Mangat, and K. Kumar. A comprehensive survey of service function chain provisioning approaches in sdn and nfv architecture. Computer Science Review, 38:100298, 2020.
[10] T.-W. Kuo, B.-H. Liou, K. C.-J. Lin, and M.-J. Tsai. Deploying chains of virtual network functions: On the relation between link and server usage. IEEE/ACM Transactions on Networking, 26(4):1562–1576, 2018.
[11] D. Li, J. Lan, and Y. Hu. Central control over distributed service function path. KSII Transactions on Internet and Information Systems (TIIS), 14(2):577–594, 2020.
[12] Z. Li and J. Garcia-Luna-Aceves. Loop-free constrained path computation for hop-by-hop qos routing. In Computer Networks, volume 51, pages 3278–3293, 2007.
[13] Z. Li and J. J. Garcia-Luna-Aceves. A distributed approach for multi-constrained path selection and routing optimization. In Proceedings of the 3rd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, QShine ’06,
page 36–es, New York, NY, USA, 2006. Association for Computing Machinery.
[14] L. Liu, S. Guo, G. Liu, and Y. Yang. Joint dynamical vnf placement and sfc routing in nfv-enabled sdns. IEEE Transactions on Network and Service Management, 18(4):4263–4276, 2021.
[15] K. Mahdi. A self-optimizing fabric for the 5G era. https://media.ciena.com/documents/A_Self-Optimizing_Fabric_for_the_5G_Era_
WP.pdf, 2020. (accessed: 2020-11-11).
[16] OMNeT++. OMNeT++ discrete event simulator. https://omnetpp.org/. (accessed:12.03.2021).
[17] J. Pei, P. Hong, K. Xue, and D. Li. Efficiently embedding service function chains with dynamic virtual network function placement in geo-distributed cloud system. IEEE Transactions on Parallel and Distributed Systems, 30(10):2179–2192, 2019.
[18] P. S. Prakash and S. Selvan. Optimized multi constrained path quality of service routing protocol. WSEAS Trans. Info. Sci. and App., 8(2):80–95, Feb. 2011.
[19] S. V. Rossem, W. Tavernier, D. Colle, M. Pickavet, and P. Demeester. Profile-based resource allocation for virtualized network functions. IEEE Transactions on Network and Service Management, 16:1374 – 1388, Dec. 2019.
[20] G. L. Santos, D. d. F. Bezerra, . d. S. Rocha, L. Ferreira, A. L. C. Moreira, G. E.Gon alves, M. V. Marquezini, . Recse, A. Mehta, J. Kelner, et al. Service function chain placement in distributed scenarios: A systematic review. Journal of Network and Systems Management, 30(1):1–39, 2022.
[21] J. Simmons. CORONET continental united states (CONUS) topology. http://www.monarchna.com/topology.html. (accessed:20.04.2021).
[22] T. D. Tran, B. Jaumard, H. Duong, and K.-K. Nguyen. Joint service function chain embedding and routing in cloud-based nfv: A deep q-learning based approach. In 2021 IEEE 4th 5G World Forum (5GWF), pages 171–175, 2021.
[23] S. Wijethilaka and M. Liyanage. Survey on network slicing for internet of things realization in 5g networks. IEEE Communications Surveys Tutorials, 23(2):957–994, 2021.
[24] Wikipedia. List of United States cities by population. https://en.wikipedia.org/wiki/List_of_United_States_cities_by_population.(accessed:04.10.2021).
Repository Staff Only: item control page
Download Statistics
Download Statistics