This paper creates a novel availability model for backup resources, based on which we propose a novel availability-aware routing algorithm while the backup resources are allowed to be shared by the incoming requests after computing the availability of the backup resources. For primary-backup sharing, we introduces a comparison of the requested availabilities of every connection being covered by the backup link and the incoming request, based on which we evaluate the availability of the backup link and apply it to computing availability-aware routing. The novelty compared with the previous research cases is that the backup resource availability correlates with the requested availability of incoming connections. Through simulation, our algorithm can get more profitability on availability and better blocking performance.
Published in:
High Performance Switching and Routing, 2008. HSPR 2008. International Conference on
Date of Conference: 15-17 May 2008