• Flow-level state transition as...

Result: Flow-level state transition as a new switch primitive for sdn

Title:
Flow-level state transition as a new switch primitive for sdn
Authors:
Masoud Moshref, Apoorv Bhargava, Adhip Gupta, Minlan Yu, Ramesh Govindan
Contributors:
The Pennsylvania State University CiteSeerX Archives
Source:
http://nsl.cs.usc.edu/Papers/?action%3Ddownload%26upname%3DMoshref_14b.pdf.
Publication Year:
2014
Collection:
CiteSeerX
Subject Terms:
C.2.0 [Computer-Communication Networks, C.2.1 [Network Architecture and Design, C.2.4 [Distributed Systems, Net- work operating systems Keywords Software-defined Network, State Machine
Document Type:
Academic journal text
File Description:
application/pdf
Language:
English
Relation:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.676.9271; http://nsl.cs.usc.edu/Papers/?action%3Ddownload%26upname%3DMoshref_14b.pdf
Availability:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.676.9271
http://nsl.cs.usc.edu/Papers/?action%3Ddownload%26upname%3DMoshref_14b.pdf
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Accession Number:
edsbas.3C1F0147
Database:
BASE

Further Information

In software-defined networking, the controller installs flow-based rules at switches either proactively or reactively. The reactive ap-proach allows controller applications to make dynamic decisions about incoming traffic, but performs worse than the proactive one due to the controller involvement. To support dynamic applications with better performance, we propose FAST (Flow-level State Tran-sitions) as a new switch primitive for software-defined networks. With FAST, the controller simply preinstalls a state machine and switches can automatically record flow state transitions by match-ing incoming packets to installed filters. FAST can support a vari-ety of dynamic applications, and can be readily implemented with today’s commodity switch components and software switches.