Abstract
This paper investigates the implementation of virtual networks on the SDN data plane modeled by a graph of physical connections between network nodes. A virtual network is defined as a set of ordered host pairs (sender and receiver) and is implemented by a set of host–host paths that uniquely determine the settings of switches. A set of paths is said to be perfect if any subset of its paths can be implemented loop-free, i.e., without endless movement of packets in a loop, without duplicate paths (when the host receives the same packet several times), and without unintended paths (when the host receives a packet directed to some other host). In the case where the switchgraph is a complete graph, sufficient conditions for the existence of the largest perfect set of paths connecting all pairs of different hosts are established. Algorithms for constructing this largest perfect set are proposed and their complexity is estimated. The paper also reports preliminary results of conducted computer experiments, which suggest that the proposed sufficient conditions are not necessary ones.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Notes
In this paper, we consider packets for a single flow (a flow with one identifier); therefore, when describing rules and paths, the parameter vector σ is omitted.
REFERENCES
Sezer, S., Scott-Hayward, S., Chouhan, P.K., Fraser, B., Lake, D., Finnegan, J., Viljoen, N., Miller, M., and Rao, N., Are we ready for SDN? Implementation challenges for software-defined networks, IEEE Commun. Mag., 2013, vol. 51, no. 7, pp. 36–43.
López, J., Kushik, N., Yevtushenko, N., and Zeghlache, D., Analyzing and validating virtual network requests, Proc. 12th Int. Conf. Software Technologies, 2017, pp. 441–446.
Yevtushenko, N., Kossatchev, A., Lopez, J., Kushik, N., and Zeghlache, D., Test derivation for the software defined networking platforms: Novel fault models and test completeness, Proc. IEEE East-West Design and Test Symp., 2018, pp. 1–6.
Burdonov, I.B., Yevtushenko, N.V., and Kossatchev, A.S., Testing switch rules in software defined networks, Tr. Inst. Sist. Program. Ross. Akad. Nauk (Proc. Inst. Syst. Program. Russ. Acad. Sci.), 2018, vol. 30, no. 6, pp. 69–88.
Burdonov, I., Kossatchev, A., Yevtushenko, N., López, J., Kushik, N., and Zeghlache, D., Verifying SDN data path requests, arXiv:1906.03101, 2019.
Boufkhad, Y., De La Paz, R., Linguaglossa, L., Mathieu, F., Perino, D., and Viennot, L., Forwarding tables verification through representative header sets, arXiv:1601.07002, 2016.
Burdonov, I., Yevtushenko, N., and Kossatchev, A., Implementing a virtual network on the SDN data plane, Proc. IEEE East-West Design and Test Symp., 2020.
Kuliamin, V.V. and Petukhov, A.A., A survey of methods for constructing covering arrays, Program. Comput. Software, 2011, vol. 37, no. 3, pp. 121–146. https://doi.org/10.1134/S0361768811030029
Kleitman, D.J. and Spencer, J., Families of k-independent sets, Discrete Math., 1973, vol. 6, pp. 255–262.
Soohak, Ch., Kwang, K.H., and Yeol, O.D., Structures and lower bounds for binary covering arrays, Discrete Math., 2012, vol. 312, pp. 2958–2968.
Vereshchagin, N.K. and Shen, A., Lectures on mathematical logic and theory of algorithms. Part 2: Languages and calculus, Moscow Center for Continuous Mathematical Education, 2012.
Yurichev, D., SAT/SMT by example. https://yurichev.com/SAT_SMT.html. Accessed July 20, 2020.
Vinarskii, E., Perfect_set. https://github.com/vinevg1996/perfect_set. Accessed July 20, 2020.
Funding
This work was supported by the Russian Foundation for Basic Research, project no. 20-07-00338-a.
Author information
Authors and Affiliations
Corresponding authors
Additional information
Translated by Yu. Kornienko
Rights and permissions
About this article
Cite this article
Burdonov, I.B., Vinarskii, E.M., Yevtushenko, N.V. et al. Perfect Sets of Paths in the Full Graph of SDN Switches. Program Comput Soft 47, 505–514 (2021). https://doi.org/10.1134/S0361768821070033
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0361768821070033