As optical networking deployments increase, multidomain provisioning and survivability are becoming major concerns. A key challenge in multi-domain survivability is the scalability problem. To address this concern, various solutions have already been proposed based upon topology aggregation schemes. However, these mechanisms do not scale well with increasing domain counts and further investigation is required to develop more scalable alternatives. Along these lines, in this paper we propose to use graph partitioning techniques to solve the scalability problem in multi-domain optical networks. To demonstrate the efficiency of our method, we also extend the pcycle concept to multi-domain settings. Overall simulation results show the efficiency of our proposed solution in terms of resource utilization and the number of p-cycle structures.