2012 Fourth International Conference on Computational Intelligence, Communication Systems and Networks 2012
DOI: 10.1109/cicsyn.2012.72
|View full text |Cite
|
Sign up to set email alerts
|

Process Algebraic Specification of Software Defined Networks

Abstract: In this paper, we first present a formal specification for a part of Software Defined Networks(SDN) using a process algebra called Algebra of Communicating Shard Resources(ACSR). To provide a correct and efficient solution for forwarding packets on the Software Defined Networks, ACSR can express processes running concurrently and communicating switches and a controller. Forwarding packets can be modeled as prioritized synchronization of events in ACSR. During specifying formally, we could find the Subtle Ambig… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…Most of them model the whole SDN network. Kang et al [15] use a process algebra called Algebra of Communicating Shared Resources (ACSR) to specify the concurrent processes of both controller and switches. Then they [16] add Z notation, a formal specification language based on a set theory and a first-order logic, to supplement data packets with ACSR.…”
Section: A Sdn Formal Model and Verificationmentioning
confidence: 99%
See 1 more Smart Citation
“…Most of them model the whole SDN network. Kang et al [15] use a process algebra called Algebra of Communicating Shared Resources (ACSR) to specify the concurrent processes of both controller and switches. Then they [16] add Z notation, a formal specification language based on a set theory and a first-order logic, to supplement data packets with ACSR.…”
Section: A Sdn Formal Model and Verificationmentioning
confidence: 99%
“…Then we can get the local test sequence of M i , which is P ath i . After all transitions are covered, we can generate the shortest preamble directly (Line [15][16][17]. For searching the…”
Section: Definitionmentioning
confidence: 99%