Service Function Chaining Based on Grammar in Software Defined Networks
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 wit...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
Semnan University
2019-06-01
|
| Series: | مجله مدل سازی در مهندسی |
| Subjects: | |
| Online Access: | https://modelling.semnan.ac.ir/article_3918_0f5da7006b2db9875a15265577edcf2b.pdf |
| _version_ | 1797296524117409792 |
|---|---|
| author | Pouya Khosravian Dehkordi Sima Emadi Ghasem Mirjalily Behzad Zamani |
| author_facet | Pouya Khosravian Dehkordi Sima Emadi Ghasem Mirjalily Behzad Zamani |
| author_sort | Pouya Khosravian Dehkordi |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-03-07T22:06:00Z |
| format | Article |
| id | doaj.art-38b32e5a81cc4d39b0b3fa7927745173 |
| institution | Directory Open Access Journal |
| issn | 2008-4854 2783-2538 |
| language | fas |
| last_indexed | 2024-03-07T22:06:00Z |
| publishDate | 2019-06-01 |
| publisher | Semnan University |
| record_format | Article |
| series | مجله مدل سازی در مهندسی |
| spelling | doaj.art-38b32e5a81cc4d39b0b3fa79277451732024-02-23T19:06:13ZfasSemnan Universityمجله مدل سازی در مهندسی2008-48542783-25382019-06-01175718719910.22075/jme.2019.14463.14283918Service Function Chaining Based on Grammar in Software Defined NetworksPouya Khosravian Dehkordi0Sima Emadi1Ghasem Mirjalily2Behzad Zamani3Islamic Azad University Yazd branchDepartment of Engineering, Yazd Branch, Islamic Azad University, Yazd, IranFaculty of Electrical and Computer Engineering, University of Yazd, Yazd, Iran.. Department of Computer Engineering, Shahrekord Branch, Islamic Azad University, Shahrekord, IranService 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.https://modelling.semnan.ac.ir/article_3918_0f5da7006b2db9875a15265577edcf2b.pdfsoftware defined networksservice function chainingautomatonfinite automatonregular expressionand regular grammar |
| spellingShingle | Pouya Khosravian Dehkordi Sima Emadi Ghasem Mirjalily Behzad Zamani Service Function Chaining Based on Grammar in Software Defined Networks مجله مدل سازی در مهندسی software defined networks service function chaining automaton finite automaton regular expression and regular grammar |
| title | Service Function Chaining Based on Grammar in Software Defined Networks |
| title_full | Service Function Chaining Based on Grammar in Software Defined Networks |
| title_fullStr | Service Function Chaining Based on Grammar in Software Defined Networks |
| title_full_unstemmed | Service Function Chaining Based on Grammar in Software Defined Networks |
| title_short | Service Function Chaining Based on Grammar in Software Defined Networks |
| title_sort | service function chaining based on grammar in software defined networks |
| topic | software defined networks service function chaining automaton finite automaton regular expression and regular grammar |
| url | https://modelling.semnan.ac.ir/article_3918_0f5da7006b2db9875a15265577edcf2b.pdf |
| work_keys_str_mv | AT pouyakhosraviandehkordi servicefunctionchainingbasedongrammarinsoftwaredefinednetworks AT simaemadi servicefunctionchainingbasedongrammarinsoftwaredefinednetworks AT ghasemmirjalily servicefunctionchainingbasedongrammarinsoftwaredefinednetworks AT behzadzamani servicefunctionchainingbasedongrammarinsoftwaredefinednetworks |