Restoration in all-optical GMPLS networks with limited wavelength conversion
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Applications and users require different recovery services. Some applications are delay sensitive and demand fast restoration, while others are data sensitive and require 100% data recovery. Dynamic restoration techniques, on the other hand, have exclusive restoration abilities in terms of latency, restoration throughput, and complexity. It is therefore important to comprehend the diversity among dynamic restoration techniques in order to effectively mesh their aptitudes to applications requirements. Accordingly, in this paper we evaluate distinct types of dynamic restoration approaches, namely disjoint path, partially joint path, and link restoration to identify their specialty and deficiency in terms of blocking probability, restoration delay, and computational complexity. Our results reveal that partially joint path restoration always obtains the lowest blocking probability. Nevertheless, this scheme has the highest computational complexity. Link restoration is the fastest if fast fault localization is achieved ahead of the restoration process. Conversely, disjoint path restoration always has the highest average restoration delay. However, this approach is the simplest and obtains the lowest computational complexity.