The principal aim of cognitive networking is to equip traditional networks with some sort of intelligence, in order to make them evolve and achieve higher levels of performance than those that can currently be achieved . Typical characteristics of cognitive networks are the ability to monitor the environment they are deployed in, to take reasoned actions based on current conditions towards an end-to-end objective, and to learn from past experience. Such enhanced networks will likely be characterized by a nonnegligible complexity, which can be tolerated if accompanied by relevant benefits, such as performance increase or mitigation of management burden. Different cognitive proposals have been proposed thus far in the literature, ranging from general framework definitions , to cognitive node architectures , to specific implementations . This contribution aims to illustrate the concepts we advanced in previous works , in which we described how the cognitive networking paradigm can fill the gap between service-oriented architectures and network, and extend them, by enabling reasoning with external information, i.e. information that is not locally available and is sensed elsewhere in the network. This enables the cognitive process to achieve a global vision of the network, which should facilitate the achievement of better end-to-end performance.

Multipath routing is a promising technique to increase the Internet’s reliability and to give users greater control over the service they receive. However, past proposals choose paths which are not guaranteed to have high diversity. In this paper, we propose yet another multipath routing scheme (YAMR) for the interdomain case. YAMR provably constructs a set of paths that is resilient to any one inter-domain link failure, thus achieving high reliability in a systematic way. Further, even though YAMR maintains more paths than BGP, it actually requires significantly less control traffic, thus alleviating instead of worsening one of the Internet’s scalability problems. This reduction in churn is achieved by a novel hiding technique that automatically localizes failures leaving the greater part of the Internet completely oblivious .

DNS was not designed to be secure. The biggest security hole in DNS is the lack of support for data integrity authentication, source authentication, and authorization. In this paper, a secure DNS scheme based on intrusion tolerance is proposed. This secure DNS is intrusion-tolerant by using Byzantine intrusion tolerant technique and voting mechanism. The scheme provides high integrity, robustness, and availability of service in the presence of arbitrary failures including failures due to malicious attacks. The proposed scheme consists of 3f+1 tightly coupled replicas per name server and guarantees safety and liveness properties of the system assuming no more than f replicas are faulty. By adding authentification of client and using symmetric key cryptography, the system guarantees a secure communication mechanism by providing a way to detect whether DNS data has been corrupted during communication over the Internet .Experimental results show that the scheme can provide a much higher degree of security and reliability, as well or even better than an implementation of the DNS security extension.