Abstract: With the development of network function virtualization (NFV), it is more flexible and important for service function chain (SFC) constrained traffic flows to find the shortest path to get through the network. Existing works only consider conditions within a single-domain network. However, when it comes to multiple domains or geo-distributed networks, due to the network’s concern of revealing sensitive information, member networks conceal their own network details to each other. This paper proposed a new algorithm, privacy-preserved multi-domain shortest path problem under service function chaining constraints, to solve the multi-domain transfer problem of traffic flows, preserving the privacy information of each member network as well as choosing the shortest path for the flows.