Simple verification improvements of the NETCONF data model in programmable computer Networks

One of the most important aspects of programmable networks is their correctness. The quality of being correct is not something that is built into any architecture of programmable networks. Since it is decoupled into two planes: the control and data plane, it depends on the level of correctness of both planes and the technologies that implement these planes. In cases when the data plane is implemented with Network Configuration Protocol (NETCONF) together with YANG (yet another new generation) modeling language, most of the validation and verification is implemented within the YANG validation. But there is still a verification gap that makes it possible for developers to make mistakes such as setting up the incorrect IP address or ports in the given configuration. This paper proposes enhancements in the data model verification by comparing the loaded configuration with the expected configuration. XML comparison techniques have implemented the verification improvement.