Table of Contents Author Guidelines Submit a Manuscript
Journal of Computer Networks and Communications
Volume 2018 (2018), Article ID 4134878, 13 pages
Review Article

Network Restoration for Next-Generation Communication and Computing Networks

1University of Pretoria, Pretoria, South Africa
2University of Manitoba, Winnipeg, MB, Canada R3T 2N2

Correspondence should be addressed to B. S. Awoyemi; moc.liamg@ednutababimeyowa

Received 8 January 2018; Revised 27 February 2018; Accepted 5 March 2018; Published 3 April 2018

Academic Editor: Ignacio Soto

Copyright © 2018 B. S. Awoyemi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Network failures are undesirable but inevitable occurrences for most modern communication and computing networks. A good network design must be robust enough to handle sudden failures, maintain traffic flow, and restore failed parts of the network within a permissible time frame, at the lowest cost achievable and with as little extra complexity in the network as possible. Emerging next-generation (xG) communication and computing networks such as fifth-generation networks, software-defined networks, and internet-of-things networks have promises of fast speeds, impressive data rates, and remarkable reliability. To achieve these promises, these complex and dynamic xG networks must be built with low failure possibilities, high network restoration capacity, and quick failure recovery capabilities. Hence, improved network restoration models have to be developed and incorporated in their design. In this paper, a comprehensive study on network restoration mechanisms that are being developed for addressing network failures in current and emerging xG networks is carried out. Open-ended problems are identified, while invaluable ideas for better adaptation of network restoration to evolving xG communication and computing paradigms are discussed.