A restoration scheme for virtual networks using switches

Despite the success story of Internet, the ossification in the underlying infrastructure has become a key problem for its development. Network virtualization allows de-ossifying the internet and it is already a hot research topic nowadays. Virtualization is a very successful technique for sharing and reusing of resources, resulting in higher efficiency. On the other side, there is a need to cope with heterogeneity and a higher complexity in resource management. We will focus here on traffic restoration in virtual networks. The aim of this paper is to propose a simplified scalable restoration scheme for virtual networks using switches. The scheme is very easy to implement and do not need global information on the state of network. The failure is treated only locally and the other nodes in the network do not need to know nothing about it or to undertake special actions. In contrast to conventional IP routing schemes, each node routes the traffic on the basis of the entering arc and on the destination. We show that this is sufficient to deal with all link failure situations in the network, assuming that the network is two-link connected. We model the dimensioning problem with an Integer Linear Program which can be solved exactly for small networks of the literature.