LPR-Trie: A Fast IPv6 Routing Lookup Algorithm with Virtual Nodes

The number of IPv6 routes in todays backbone routers has grown rapidly,which has put tremendous pressure on route lookup and storage.Based on the analysis of IPv6 address prefix length and distribution characteristics,this paper proposes an IPv6 route lookup architecture called LPR-Trie.The core idea of the algorithm is to utilize more spaces and accelerate routing lookup.Moreover,we put forward the concept of virtual nodes,and leverage the link between virtual nodes and ordinary nodes to accelerate routing lookup.We provide the longest prefix routing entry(LPR)calculation algorithm to achieve the longest prefix match.The experimental results show that the virtual node mechanism increases the search speed up to 244%,and the virtual nodes have better stability by setting an appropriate keep-alive time according to the characteristics of actual traffic.This paper shows that our design improves the routing lookup speed and have better memory utilization.

A novel virtual node method for polygonal elements

A novel polygonal finite element method （PFEM） based on partition of unity is proposed, termed the virtual node method （VNM）. To test the performance of the present method, numerical examples are given for solid mechanics problems. With a polynomial form, the VNM achieves better results than those of traditional PFEMs, including the Wachspress method and the mean value method in standard patch tests. Compared with the standard triangular FEM, the VNM can achieve better accuracy. With the ability to construct shape functions on polygonal elements, the VNM provides greater flexibility in mesh generation. Therefore, several fracture problems are studied to demonstrate the potential implementation. With the advantage of the VNM, the convenient refinement and remeshing strategy are applied.

Research on virtual node placement optimization strategy of cloud platform for information acquisition

A virtual node placement strategy based on service-aware is proposed for an information acquisition platform. The performance preferences and types of services in the information acquisition platform are analyzed as well as a comparison of the running time of services both in virtual node centralized and decentralized placing. All physical hosts are divided into different sub-clusters by using the analytic hierarchy process( AHP),in order to fit service of different performance preferences. In the sub-cluster,both load balance and quality of service are taken into account. Comparing with the heuristic algorithm,the experiment results show that the proposed placement strategy is running for a shorter time. And comparing with the virtual node placement strategy provided by OpenStack,the experiment results show that the proposed placement strategy can improve the execution speed of service in the information acquisition platform,and also can balance the load which improves resources utilization.

A survey of routing techniques for satellite networks

Satellite networks have many advantages over traditional terrestrial networks.However,it is very difficult to design a satellite network with excellent performance.The paper briefly summarizes some existing satellite network routing technologies from the perspective of both single-layer and multilayer satellite constellations,and focuses on the main ideas,characteristics,and existing problems of these routing technologies.For single-layer satellite networks,two routing strategies are discussed,virtual node strategy and virtual topology strategy.Moreover,considering the deficiency of existing multilayer satellite network routing,we discuss the topic invulnerability.Finally,the challenges and problems faced by the satellite network are analyzed and the trend of future development is predicted.