Efficient path selection and content availability in the optical datacenter networks are essential for business continuity. To measure quantitatively the connectivity of content and give protection to diverse type of contents, the idea of k-node content connectivity is becoming popular. However, the assignment of dedicated spectrum for each end-to-end content path consumes too many resources. In order to enhance the resource efficiency, the spectrum can be shared between end-to-content paths of various requests. The spectrum sharing minimizes the backup spectrum requirement and has been a topic of research.In this study, an innovative model, namely, end-to-end content connectivity based quasi-bipartite graphs (E-QBG) for the possible path prediction and maximum matching by Hungarian path prediction (MM-HPP) are implemented for the spectrum efficiency and the disaster resilient datacenter networks. The objective is to minimize the entire backup spectrum resource and operations path. The quasi-bipartite graph is used for the end-to-end content backup route evaluation including spectrum sharing on various links, while the Hungarian algorithm is utilized for accurate maximum matching prediction between various end-to-end route sets. We introduce the concept of maximum dissortativity path based on the weight factor. The proposed E-QBG and MM-HPP reduces spectrum consumption which guarantees survivability against multi-failure and natural disasters. This method leads to an approach for more effective utilization of the resources for end-to-end content connected elastic optical datacenter networks as compared with the existing techniques.