Policy-routing system based on grid service and dynamic policy-generating method

Abstract

The invention discloses a policy-routing system based on grid service and a dynamic policy-generating method, mainly solving the defect that user and application needs are hardly and effectively realized in complicated dynamic network environment by the prior routing method. The system comprises an external calling module, a network state monitoring module, a router, a policy decision module, a policy-generating module, a policy collision-solving module and a policy library, wherein the policy-generating module confirms the route attributes of a target routing algorithm subset according to user information, application information and network state information which are received, finds a routing algorithm subset by the one-to-one correspondence relation between the route attributes and routing algorithm subsets, carries out the equation operation, the orthogonal operation and the independence operation of the routing algorithm subset to confirm the target routing algorithm subset and then randomly selects any one routing algorithm from the subset as a routing algorithm in policy operation. The invention has flexible suitability of network environment and is applicable to the Internet for policy routing.

Description

technical field [0001] The present invention belongs to the technical field of communication, and relates to a network routing mechanism, specifically a grid service-based dynamic policy routing mechanism, which is applicable to future complex, dynamic, and heterogeneous networks, and can efficiently calculate and satisfy different users and The end-to-end path required by the application. Background technique [0002] The rapid development of communication networks causes itself to become more and more complex. First, massive users and emerging new applications bring complexity to the network to realize on-demand services. Second, it is becoming more and more difficult to coordinate heterogeneous network resources to achieve end-to-end applications. Finally, the randomness and diversity of network state fluctuations lead to the degradation of application end-to-end performance. These complexities pose serious challenges to the routing mechanisms of communication networks...

AI Technical Summary

Problems solved by technology

[0004] However, the current communication network routing only considers the known network state when designing, and it has better performance only when the network state meets the assumed conditions.

Although the current Internet and military networks support a variety of routing algorithms, it can only select a relatively good one from the available routing algorithms to calculate the end-to-end path, but whether the path can be found, and the path for the dynamic network environment The robustness and ability to achieve application end-to-end goals are entirely dependent on how well the selected routing algorithm adapts to the current network state

Obviously, the existing routing mechanism does not have flexible network adaptability, and it is difficult to effectively achieve the end-to-end goals of users and applications in a complex and dynamic network environment

Images