Network function virtualization (NFV) flexibly provides servoces by virtualizing network functions on a general-purpose server, and attracted research interest in recent years. In NFV environment, providing service chaining, which dynamically connects each network function (virtual network function: VNF), is critical issue. However, as it is challenging to select the optimal sequence of VNF services in the service chain in a decentralized manner, the distances between the VNFs tend to increase, leading to longer communication and processing delays. Furthermore, it has never considered that certain VNFs that can be exchange the order of services with one another. To address this problem, in this paper, we propose a distributed search method for ordered VNFs to reduce delays while considering the load on control server, by exploiting an in-network guidance technology, called Breadcrrmubs, for query messages.