Preview

Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS)

Advanced search

Testing switch rules in software defined networks

https://doi.org/10.15514/ISPRAS-2018-30(6)-4

Abstract

SDN-technology is efficiently used for implementing service function chains can be efficiently implemented utilizing common resources and their management principles in virtual networks. The network is based on a connected undirected graph of physical links called usually referred to as resource network connectivity topology (RNCT); graph nodes are network switches and hosts and each host is connected exactly with one switch. Switches operate based on rule tables that are configured by a controller that operates independently of network equipment. The configuration of network switches provides the transmission of packets from the initial to final hosts depending on the values of the packet parameters. The paper discusses the relationship between switch configurations and paths which are created for trasmitting packets depending on RNCT properties. It is shown that, in general, not any configuration of any switch is verifiable. Testing abilities depend on the accepted hypotheses about the switch operating. Two hypotheses are discussed in the paper: the switch hypothesis assumes that the switch operation does not depend on the settings of other switches; a stronger hypothesis about the rule, besides this, assumes that the switch operation according to this rule does not depend on other rules in the configuration of this switch. Section 2 contains preliminaries while Section 3 is devoted to the relationship between switch rules and sets of paths to be implemented. In Section 4, the problem of testing the switch configuration is considered based on the rule hypothesis; a number of statements are estableshed, in particular, the necessary and sufficient conditions of the ability of testing a given rule of a given switch. Section 5 discusses and proves the necessary (but not sufficient) condition and sufficient (but not necessary) condition for checking any switch configuration based on the switch hypothesis. In conclusion, the problems of establishing the necessary and sufficient conditions for verifiability of any switch configuration are discussed.

About the Authors

I. B. Burdonov
Ivannikov Institute for System Programming of the Russian Academy of Sciences
Russian Federation


N. V. Yevtushenko
Ivannikov Institute for System Programming of the Russian Academy of Sciences
Russian Federation


A. S. Kossatchev
Ivannikov Institute for System Programming of the Russian Academy of Sciences
Russian Federation


References

1. [1]. Sezer S., Scott-Hayward S., Chouhan P. K. et al. Are we ready for sdn? Implementation challenges for software-defined networks. IEEE Communications Magazine, vol. 51, no. 7, 2013, pp. 36–43.

2. [2]. Gill P., Jain N., and Nagappan N. Understanding network failures in data centers: Measurement, analysis, and implications. In Proc. of the ACM SIGCOMM 2011 Conference, SIGCOMM ’11, 2011, pp. 350–361.

3. [3]. Scott C., Wundsam A., Raghavan B. et al. Troubleshooting blackbox sdn control software with minimal causal sequences. ACM SIGCOMM Computer Communication Review, vol. 44, no. 4, 2015, pp. 395–406.

4. [4]. Shalimov A., Zuikov D., Zimarina D., Pashkov V., and Smeliansky R. Advanced study of sdn/openflow controllers. In Proc. of the 9th Central & Eastern European Software Engineering Conference in Russia, 2013.

5. [5]. Yao J., Wang Z., Yin X., Shiyz X., and Wu J. Formal modeling and systematic black-box testing of sdn data plane. In The IEEE 22nd International Conference on Network Protocols, 2014, pp. 179–190.

6. [6]. Zhang Z., Yuan D., and Hu H. (2016). Multi-layer modeling of openflow based on efsm. In Proceedings of the 2016 4th International Conference on Machinery, Materials and Information Technology Applications, 2016, pp. 524-529.

7. [7]. J López, N. Kushik, D. Zeghlache. Quality Estimation of Virtual Machine Placement in Cloud Infrastructures. Lecture Notes in Computer Science, vol. 10533, 2017, pp. 213-229.

8. [8]. Canini M., Kostic D., Rexford J., and Venzano D. Automating the testing of openflow applications. In Proceedings of the 1st International Workshop on Rigorous Protocol Engineering, 2011.

9. [9]. Canini M., Venzano D., Peresini P. et al. A nice way to test openflow applications. In Proc. of the 9th USENIX conference on Networked Systems Design and Implementation, 2012, pages 127–140.

10. [10]. A. Berriri, J. López, N. Kushik, N. Yevtushenko, D. Zeghlache. Towards Model based Testing for Software Defined Networks. In Proc. of the 13th International Conference on Evaluation of Novel Approaches to Software Engineering, 2018, pp. 440-446.

11. [11]. ONOS Project. Key and field description. Available at: https://wiki.onosproject.org/display/ONOS/Flow+Rules#FlowRules-Keyandfielddescription. Accessed 15.11.2018.


Review

For citations:


Burdonov I.B., Yevtushenko N.V., Kossatchev A.S. Testing switch rules in software defined networks. Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS). 2018;30(6):69-88. (In Russ.) https://doi.org/10.15514/ISPRAS-2018-30(6)-4



Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 2079-8156 (Print)
ISSN 2220-6426 (Online)