Reactive Service Function Path Discovery Approach in Software Defined Network

Mihaeljans, Martins; Skrastiņš, Andris

doi:10.1109/telfor52709.2021.9653356

Cited by 2 publications

(5 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…VII. CONCLUSION This paper is a continuation of our research of Reactive SF path discovery Approach in Software Defined Network [2] proposing reactive SF path discovery as an alternative to proactive SF path discovery. While proactive SF path discovery relies on the use of a manually configured predefined SF path policy, reactive SF path discovery leverages data flow reclassification for SF path generation reactively at the arrival of a previously unknown data flow.…”

Section: F Sf Path Discovery Expensesmentioning

confidence: 85%

“…This paper is a continuation of our study of Reactive Service Function Path Discovery Approach in Software Defined Network [2]. We have argued that preset of a complete SF path policy before initial data flow arrival is an unnecessary requirement.…”

Section: Introductionmentioning

confidence: 94%

“…In our previous study Reactive Service Function Path Discovery Approach in Software Defined Network [2] we proposed Reactive SF path discovery method (shown in Fig. 6) as an alternative to proactive discovery.…”

Section: Reactive Service Function Path Discoverymentioning

confidence: 99%

“…SF participation in path policy update process has been covered in our previous research study [2] as well. Unlike study [7] we do not encourage hosting classification rules at SFs as it might not only prolong policy update process but also lead to policy synchronization issues and requirement for SF hierarchy to eliminate concurring extensive path policy update requests.…”

Section: Introductionmentioning

confidence: 99%

“…Unlike study [7] we do not encourage hosting classification rules at SFs as it might not only prolong policy update process but also lead to policy synchronization issues and requirement for SF hierarchy to eliminate concurring extensive path policy update requests. This paper is revised and expanded version of the paper presented at the 29th Telecommunications Forum TELFOR 2021 [2].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Evaluation of reactive service function path discovery in symmetrical environment

Mihaeljans¹,

Skrastiņš²

2022

Telfor J

Self Cite

View full text Add to dashboard Cite

In this paper we continue our study of path discovery process for Service Function Chaining (SFC) in Software Defined Network (SDN). By default, service function (SF) paths are established proactively - before data transmission takes place. We have argued that this constraint can be eliminated with the use of our proposed Reactive SF path discovery approach. Such SFs as network address translation (NAT) or stateful firewall (FW) are SF path's symmetry dependent requiring a visit of both ingress and egress flows. Thus, we evaluated SF path discovery processes in Mininet emulation network. Outcome of this study is a comparison of proactive and reactive SF path discovery processes for both asymmetrical and symmetrical SF paths. It shows that even in symmetrical environment reactive SF path discovery has a higher probability of successful SF path detection.

show abstract

Section: F Sf Path Discovery Expensesmentioning

confidence: 85%

Section: Introductionmentioning

confidence: 94%

Section: Reactive Service Function Path Discoverymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations