摘要：Open Reconfigurable Network (abbreviated as ORN) is a new type of distributed network architecture, which is composed by integrated network management nodes (abbreviated as MN) and more open reconfigurable routing or switching nodes (abbreviated as NN), which are managed by MN. During the path deployment among NN, there probably exists failures and even repeated failures due to the resources occupation and conflict causes, so it is inefficient to use the traditional transaction model. To improve deployment efficiency, this paper focuses on time performance of dynamical nested transactions in the ORN. In this paper, firstly, we proposed the dynamic nested transaction algorithm on the basis of the existing nested transaction; secondly, we established the nested transaction mathematical model in the ORN; finally, we proved the superiority of the model compared with the traditional model through mathematical analysis and made results more intuitive by digital experiment.
