Stable match approach to determine vital link to preserve shortest path length

Content Delivery Network is a large distributed system consisting of multiple servers deployed in much geographical location that delivers the content to end user with high performance and high availability. But the increase load of content delivery server and network degrades the quality of service. Also 70% of unintentional failures are Single link failure which creates potential failure along the delivery chains. To get over the problem some mirror server are placed in the network where a request is transferred to one of the mirror servers such that connectivity between user and server is within small hop count even during the failure. This paper targets the stability of network reliability by providing hop length stability and network connectivity. We use the stable matching approach on the network to find the vital link to be protected so that user can access the server within small hop count even if non — vital links fails. Moreover, we prove that the problem can solved in polynomial time conditioned when hop count is determined to be one.