On the problem of subsequences inclusion into the data packages headers

The possibility to apply models and techniques of the Software Defined Networks (SDN-technologies) to optimize traffic control in computer networks is discussed. An algebraic formalization for the problem of subwords inclusion into the words over the given alphabet is suggested. There are analyzed problem-oriented conditions and algorithms that implement and optimize checking for limited length subwords (subsequences) inclusion into the lines of big switching tables. Some additional SDN-based abilities to speed up data processing in computer networks are demonstrated.