Repozytorium publikacji - Politechnika Gdańska

Failures of network elements can be appropriately dealt with by utilization of alternate disjoint paths to provide redirection of flows affected by failures of the respective working paths. Known approaches can be broadly divided by decision on backup paths installation into proactive and reactive mechanisms, as well as based on the scope of recovery actions into local and global rerouting. There are several important scenarios in which the time needed to calculate the backup paths matters a lot. For instance, in the case of reactive approaches to survivable routing, if a failure of a network element affects multiple flows, a number of attempts need to be performed to determine the respective alternate routes, and, as a result, the time necessary to redirect these flows may be significant. Another important example is related with the need to perform periodic updates of a resilient routing scheme in a global scale, as a response to changing traffic volumes. In this paper, we introduce a new time-efficient algorithm called Shortest Cycle Algorithm (SCA) of establishing the sets of working and backup paths based on cycles. Time-efficiency of paths calculation is achieved by reusing the parts of cycles already determined for other end-to-end flows.

Autorzy

• mgr inż. Kanstantsin Myslitski link otwiera się w nowej karcie ,
• dr hab. inż. Jacek Rak link otwiera się w nowej karcie