Research On Atomic Capability Composition And Service Routing Algorithm In Reconfigurable Network

Network functionality composition and service routing strategy have become one of the important research fields in next generation Internet. Enabling fine-grained network functions composition provides the flexibility and scalability for next-generation Internet. This paper first describes atomic capability composition issue in reconfigurable network, then proposes automated composition approach based upon the Petri net. After acquiring composition sequences, we focus on the service-driven routing problem and extend the distributed routing algorithm through effectively reducing the size of routing matrix. The main work in this paper are shown as follows:(1) Research on the building blocks, atomic capability, in reconfigurable network; analysis and formulation of atomic capability composition problem. Specifically, analysis of the features of Petri net; making the specification of end user’s requirement; modelling and formulating the atomic capability composition problem based on Petri net. According to different scenarios of atomic capability composition, we propose three fundamental models: sequential, parallel and conflict. Based on the above models, more complicated and large scale composition models can be built. Finally, we implement automated atomic capability composition and demonstrate its effectiveness through an example.(2) The improvement of distributed service-driven routing algorithm. Unlike traditional routing mechanism, routing problem in next-generation Internet needs to consider the executing order of network functions on the “Service Path”, transforming the traditional cost-driven network routing to the cost-function-driven way. In the distributed service driven routing algorithm based on dynamic programming, the cost increases for each possible composition and the size of the routing table is too huge to maintain in terms of the number of cases of service composition. On this basis, we improve the above distributed routing algorithm by reducing the node within the service composition. The experimental results show that the size of routing table size is maintained stable effectively. Consequently the availability of the distributed routing algorithm is enhanced.