Service Function Chaining Based on Grammar in Software Defined Networks

Document Type : Computer Article

Authors

1 Islamic Azad University Yazd branch

2 Department of Engineering, Yazd Branch, Islamic Azad University, Yazd, Iran

3 Faculty of Electrical and Computer Engineering, University of Yazd, Yazd, Iran.

4 . Department of Computer Engineering, Shahrekord Branch, Islamic Azad University, Shahrekord, Iran

Abstract

Service Function Chaining is an architecture for orchestrating network services that assign choice to the network. This architecture is essentially a policy structure that should form the proper chain of services. Managing these networks is susceptible to error due to the combination of services with dedicated configurations. Accordingly, solutions will be needed to provide an appropriate ambiance for such a situation. Therefore, before running, the chains must be fully controlled, which requires the definition of chaining rules. Among the issues raised in this architecture are: checking the accuracy of the chains, as well as reducing the number of combinations of service chains. To solve these issues, the grammar is used in this paper. In this way, based on the scenarios in the Internet Engineering Task Force, they first create them and then their grammar is obtained using Regular Expressions and Finite Automaton. Subsequently, using the Cocke–Younger–Kasami algorithm, the grammar evaluation is performed and the number of combinations of services is also shown. The results show that this grammar can be verified by checking the service chain and also significantly reducing the number of combinations of service chains.

Keywords

Main Subjects

References

[1] J. Halpern, and C. Pignataro, "Service Function Chaining (SFC) Architecture", IETF Secretariat, RFC7665, 2015.
[2] W. Lee, Y. H. Choi and N. Kim, "Study on Virtual Service Chain for Secure Software-Defined Networking", Advanced Science and Technology Letters, Vol. 29, NO. 13, 2013, pp. 177-180.
[3] W. John, K. Pentikousis, G. Agapiou, E. Jacob, M. Kind, A. Manzalini, F. Risso, D. Staessens, R. Steinert and C. Meirosu, "Research directions in network service chaining", IEEE SDN for InFuture Networks and Services, 2013, pp. 1-7.
[4] P. Quinn, and T. Nadeau, "Problem Statement for Service Function Chaining", IETF Secretariat, RFC7498, 2015.
[5] J. Blendin, J. Ruckert, N. Leymann, G. Schyguda, and D. Hausheer, "Position paper: software-defined network service chaining", 3rd European Workshop on Software Defined Networks, 2014, pp. 109-114.
[6] P. Quinn and J. Guichard, "Service function chaining: Creating a service plane via network service headers", Computer, Vol. 47, NO. 11, 2014, pp. 38-44.
[7] H. Oh, D. Yu, Y.-H. Choi, and N. Kim, "Study on Search Algorithm for Finding an Efficient Service-Chaining Path", Advanced Science and Technology Letters, Vol. 51, NO. 1, 2014, pp. 102-105.
[8] S. Mehraghdam, M. Keller, and H. Karl, "Specifying and placing chains of virtual network functions", 3rd IEEE International Conference on Cloud Networking, 2014, pp. 7-13.
[9] M. Shirazipour, H. Mahkonen, M. Xia, R. Manghirmalani, A. Takacs, and V. S. Vega, "A monitoring framework at layer 4-7 granularity using network service headers", IEEE Conference on Network Function Virtualization and Software Defined Network, 2015, pp. 54-60.
[10] M. Medhat, G. Carella, C. Luck, M.-I. Corici, and T. Magedanz, "Near optimal service function path instantiation in a multi-datacenter environment", 11th International Conference on Network and Service Management, 2015, pp. 336-341.
[11] M. C. Luizelli, L. R. Bays, L. S. Buriol, M. P. Barcellos, and L. P. Gaspary, "Piecing together the nfv provisioning puzzle: Efficient placement and chaining of virtual network functions", IFIP/IEEE International Symposium on Integrated Network Management, 2015, pp. 98-106.
[12] T. Na and J. Kim, "Cloud-based service function chaining with distributed VMs and its underlay-aware improvement", International Conference on Information Networking, 2015, pp. 428-429.
[13] S. Mehraghdam and H. Karl, "Specification of Complex Structures in Distributed Service Function Chaining Using a YANG Data Model", Computing Research Repository, Vol. abs/1503.02442, 2015, eprint arXiv:1503.02442.
[14] S. Sahhaf, W. Tavernier, J. Czentye, B. Sonkoly, P. Skoldstrom, D. Jocha and J., Garay, "Scalable Architecture for Service Function Chain Orchestration", 4th European Workshop on Software Defined Networks, 2015, pp. 19-24.
[15] S. Mehraghdam and H. Karl, "Placement of Services with Flexible Structures Specified by a YANG Data Model", IEEE NetSoft Conference and Workshops, 2016, pp. 184-192.
[16] محمد علی بهشتی نیا و نیلوفر قاضی وکیلی، "ارزیابی الگوریتم‌های زمانبندی تولید کارگاهی انعطاف پذیر و مقایسه آنها با الگوریتم ژنتیک دوبخشی"، نشریه مدل‌سازی در مهندسی, دوره 13، شماره 40، سال 1394، صفحه 1-16.
[17] فرشاد حکیم پور، سیامک طلعت اهری و ابوالفضل رنجبر، "ارزیابی و مقایسه الگوریتم‌های بهینه سازی ژنتیک، شبیه سازی تبرید و فاخته‌ها در مکان یابی رقابتی تسهیلات (مطالعه موردی: بانکها)"، مدل سازی در مهندسی، دوره 15، شماره 48، سال 1396، صفحه 231-246.
[18] عباس رستمی، امیر نوروزی، هادی مختاری و یاسر نعمتی، "مساله بهینه سازی پورتفولیوی چندهدفه با اهداف حداکثر کردن بازده، حداقل کردن ریسک و حداقل کردن تعداد دارایی"، مدل سازی در مهندسی، دوره 14، شماره 45، سال 1395، صفحه 99-109.
[19] X. Li and C. Qian, "A survey of network function placement", 13th IEEE Annual Consumer Communications & Networking Conference, 2016, pp. 948-953.
[20] B. Reus, Limits of Computation: From a Programming Perspective, Springer International Publishing, Switzerland, 2016.
[21] S. Kumar, M. Tufail, S. Majee, C. Captari, and S. Homma, "Service Function Chaining Use Cases In Data Centers",  IETF Secretariat, draft-ietf-sfc-dc-use-cases-06, 2017.
[22] W. Haeffner, J. Napper, M. Stiemerling, D. Lopez, and J. Uttaro, "Service Function Chaining Use Cases in Mobile Net-works", IETF Secretariat, draft-ietf-sfc-use-case-mobility-07, 2017.
[23] E. Wang, K. Leung, J. Felix, J. Iyer, and P. Patel, "Service Function Chaining Use Cases for Network Security", IETF Secretariat, draft-wang-sfc-ns-use-cases-03, 2017.
[24] P. Martin, J. S. Jan, M. K. Boˇrivoj, "Tree Compression Pushdown Automaton", Kybernetika, Vol. 48, NO. 3, 2012, pp. 429-452.
Journal of Modeling in Engineering
Volume 17, Issue 57
July 2019
Pages 187-199

Files

History

  • Receive Date: 20 April 2018
  • Revise Date: 29 January 2019
  • Accept Date: 06 February 2019

Share

How to cite

Statistics