摘要：Open reconfigurable network (ORN) is proposed to meet users’ diversified and dynamic requirements. Path deployment is a typical service in the ORN, and can be executed in the way of open nested transaction for high efficiency. In this transaction, each operation on network nodes (NNs) is a sub-transaction, which costs CPU resources. In this paper, first we build the cost model of the path deployment of three kinds of sub-transactions execution—prepare in advance, implement concurrently and prepare dynamically. Secondly, we analyze two main approaches of path deployment in the ORN—unicast and multicast, and we concluded that multicast costs more than unicast when we ignore the time. Finally, based on the comprehensive consideration of cost and time, we propose the optimal way to execute nested transaction in the ORN.
