CN109802890B - IPv 6-based service customized reliable routing system and method - Google Patents
IPv 6-based service customized reliable routing system and method Download PDFInfo
- Publication number
- CN109802890B CN109802890B CN201910249650.2A CN201910249650A CN109802890B CN 109802890 B CN109802890 B CN 109802890B CN 201910249650 A CN201910249650 A CN 201910249650A CN 109802890 B CN109802890 B CN 109802890B
- Authority
- CN
- China
- Prior art keywords
- user
- node
- network service
- backup
- formula
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a service customization reliable routing system and method based on IPv6, wherein the system comprises a routing customization module and a routing backup module, and the routing customization module is connected with the routing backup module; the method is based on the actual requirements of a plurality of users, comprehensively considers the utility of the users and the utility of a network service provider, and forms a routing service customization strategy; the user selects whether to perform node backup or path backup according to the actual situation; the invention makes the network intelligent and has the capability of customizing the reliability of the network according to the different requirements of the users. The network plans and configures routing service in advance according to different application requirements of different users, instantiates the routing, and constructs reasonable mapping from the service request to the reliable routing according to the reliable service type selected by the user. For users, the invention enables the users to select a proper reliable service level according to specific requirements and economic bearing capacity, and is helpful for constructing a good and healthy network economic model.
Description
Technical Field
The invention relates to the field of computer networks, in particular to a service customization reliable routing system and method based on IPv 6.
Background
IPv6 is an abbreviation of Internet Protocol Version 6, and is an upgrade and replacement of IPv 4. In the actual design and application process, the new generation of IP protocol fully covers and integrates various high-tech network technologies of different types, has strong universality, advancement, stability and expansibility, becomes a key protocol for future network development, and is also the basis for future network protocol development. With the popularization and spread of the internet, new network applications are becoming abundant, and users have increasingly diversified and diversified network service requirements, which brings great challenges to the traditional routing configuration model. The current internet architecture is not flexible and cannot realize dynamic self-organization of functions according to the requirements of users. The above-mentioned needs have spurred a change in the conventional IPv6 routing method.
Among the secure trust indicators that network services need to consider, reliability is one. Generally, the nature of reliability refers to the ability of a system to perform relevant tasks and services for an extended period of time; average time to failure is currently considered. From the perspective of ensuring the reliability of routing, the method mainly adopted is through node backup and multipath routing.
From a protocol stack perspective, higher or lower layer customization may be performed. The transport layer protocol includes a user datagram protocol and a transmission control protocol. Similarly, the link layer protocol may also be adapted to suit a particular environment, such as a wireless network or an optical network. From a middleware perspective, the internet has extended functionality beyond IPv4 forwarding by configuring devices, such as firewalls, network address translation, intrusion detection systems, and the like. These functions, while offering options, are very expensive and not scalable to deploy specialized hardware devices for each customized function. It is therefore necessary to design a new web services customization architecture.
Disclosure of Invention
The purpose of the invention is as follows: in order to enable a network to have service customization capability under an IPv6 environment and provide functional components of a reliable network according to user requirements so as to improve the reliability of the network, the invention provides a service customization reliable routing system and method based on IPv 6.
The technical scheme adopted by the invention is an IPv 6-based service customized reliable routing system, which comprises the following steps:
the system comprises a route customization module and a route backup module, wherein the route customization module is connected with the route backup module;
the routing customization module analyzes user demand attributes on the basis of actual demands of a plurality of users, and forms a routing service customization strategy by considering user utility and network service provider utility;
the route backup module is used for completing node backup and path backup;
a service customization reliable routing method based on IPv6 is realized by adopting the service customization reliable routing system based on IPv6, and the specific steps are as follows;
the system collects the actual requirements of various clients of different types and constructs user documents;
step 2, performing attribute analysis on the obtained user document, and classifying and grading requirements;
defining the service type as S, and dividing each service into SL service classes, wherein indexes corresponding to each service are broadband, delay, jitter and packet loss rate;
step 3, ensuring balance between the service cost and profit provided by the user demand and the network provider ISP, and making an optimal routing service customization strategy meeting the benefits of both parties;
step 4, the user submits the demand information to the background server of the route customization module, the network service provider provides the current link state of the network to the background server of the route customization module, and the server matches the supply and demand of the user and the network service provider according to the summarized demand and the link state;
and step 5, on the basis of classifying the network services, the ISP can define certain services as services with high reliability requirements, and the reliability of the services is further ensured on the network connectivity while the transmission performance is ensured. If the user needs the service, node backup or path backup is carried out, otherwise, the process is ended;
and 6, performing data forwarding on the established routing strategy, routing strategy and node backup data or routing strategy and path backup data in a data forwarding layer.
The step 3 specifically includes:
user utility calculation and network service provider utility calculation;
3.1 the user utility calculation comprises:
user utility is defined as the degree of satisfaction with the ISP to provide service. The greater the service satisfaction, the more acceptable the user is to the resource configuration of the network, and the greater the user utility.
First, membership functions f (bw), f (dl), f (jt), and f (ls) are defined, corresponding to bandwidth, delay, jitter, and packet loss rate.
In need ofOn the basis of classification and grading, the required intervals of the applied bandwidth, delay, jitter and packet loss rate are assumed to be [ Bw respectivelyL，BwH]、[DlL，DlH]、[JtL，JtH]And [ LsL，LsH]The parameters of actual bandwidth, delay, jitter and packet loss rate that a certain service can provide are bw, dl, jt and ls, respectively.
The membership function formula for the bandwidth required by the user is as follows:
in the above formula, BwLAnd BwHMinimum and maximum bandwidth requests for traffic, C, on behalf of the userbwAnd kbwAre each a constant between 0 and 1.
The membership function formula for the delay required by the user is as follows:
in the above formula, DlLAnd DlHMaximum delay request and service minimum delay request on behalf of the user, CdlAnd kdlAre each a constant between 0 and 1.
The membership function formula for the jitter requirement of the user is as follows:
in the above formula, JtLAnd JtHMaximum jitter request and service minimum jitter request on behalf of the user, CjtAnd kjtAre each a constant between 0 and 1.
The membership function formula for the packet loss rate required by the user is as follows:
in the above formula, LsLAnd LsHMaximum packet loss rate and service minimum packet loss rate request representing user needs, ClsAnd klsAre each a constant between 0 and 1.
The evaluation matrix is constructed by the membership functions f (bw), f (dl), f (jt) and f (ls)
F ═ F (bw) F (dl) F (jt) F (ls) ]. Different types of services define different weights for the indexes according to the importance degree of the QoS indexes, the weights for bandwidth, delay, jitter and packet loss rate are respectively alpha, beta, gamma and lambda according to the categories to which the user demands belong, a weight matrix W is constructed to be [ alpha beta [ gamma lambda ], the weights are all values between 0 and 1, and the weight sum is 1;
defining the customized service Satisfaction as Satisfailure ═ W · FTIn which F isTFor the transpose of F, a greater value of satisfaction indicates a higher user satisfaction with the current resource configuration.
The customized service satisfaction is divided into four different satisfaction levels, specifically as the following formula:
in the above formula, α1、α2、α3Setting according to actual conditions;
and solving the corresponding user utility according to the customized service satisfaction:
3.2 the utility calculation step of the network service provider comprises the following steps:
3.2.1 determining candidate network service providers connected with the current node;
assuming that the current node is i, the i network service providers connected with the current node and satisfying the constraint condition are all considered as candidate network service providers.
3.2.2 determination of n evaluation indexes. Such as bandwidth resource amount, delay, jitter, packet loss rate, n is 4.
3.2.3 define an evaluation matrix F, which is constructed from the candidate network service providers and the corresponding set of evaluation metrics. Wherein, the y-th evaluation index value corresponding to the x-th candidate network service provider is fxy(1. ltoreq. x. ltoreq.l, 1. ltoreq. y. ltoreq. n), each column in turn corresponding to the evaluation index mentioned in the preceding step.
3.2.4 calculating fmin，y、fmax，yAnd fmid，yRespectively representing a minimum value, a maximum value and a middle value of the y-th evaluation index, as shown in a formula:
3.2.5 modify the matrix F. Each evaluation index value in the evaluation matrix F is normalized.
A normalization processing formula for evaluating a higher evaluation index as the value is larger:
a normalization processing formula of an evaluation index whose evaluation is higher as the value is smaller:
a normalization processing formula for the evaluation index whose value tends to be more intermediate and higher:
the delay, jitter and packet loss rate are subjected to standardized correction according to a standardized processing formula with smaller value and higher evaluation, and the available bandwidth is subjected to standardized correction according to a standardized processing formula with larger value and higher evaluation.
3.2.6 calculating the sample variance of each evaluation index, and reflecting the influence of different evaluation indexes on the comprehensive index. The influence of one evaluation index is much larger than that of the other evaluation index, and can be balanced by a weight coefficient.
Wherein l represents the number of network service providers connected to the current node while satisfying the constraint condition,
and the mean value of the y-th evaluation index corresponding to each candidate network service provider is represented.
3.2.7 calculating the weight ratio of each evaluation index according to the sample variance of each evaluation index, wherein the sum of the weight ratios of all the evaluation indexes is 1, and w is defined in the textyAnd the weight ratio of the y-th evaluation index is obtained. The calculation formula is as follows:
wherein in the formula
In particular to the sample variance of the y-th evaluation index,
the sample variance of the i-th evaluation index is broadly referred to.
3.2.8 score each candidate network service provider. Converting the composite score into a corresponding score, and using the calculated score as a utility of the corresponding candidate network service provider, the formula is as follows:
the step 4 specifically includes:
in the process of matching the user with the network service provider, the factor to be considered is mainly the matching between the user requirement and the supply of the network service provider, and the two-person game is selected for matching in the design.
And selecting a two-person game to complete the matching of the user and the network service provider, wherein the game objects are the user U and the network service provider S. The policy of the user U is selection or non-selection of the current path, and the policy of the network service provider S includes provision or non-provision of the current path. The matrix constructed by the two is as follows:
in the above formula, S is definedU is a user utility matrix, and UU is a network service provider utility matrix. Respectively satisfied minimum value is formed by s0And u0Represents; the corresponding utilities of the user and the network service provider are represented by skAnd ukAnd (4) showing. The value of alpha is greater than 1, and punishment is given when the user does not select the strategy provided by the network service provider or the network service provider does not provide the current network service; defining 0 < beta < 1, when the network service provider does not provide service but the user selects, or the user does not select the network service provided by the corresponding network service provider, the loss of the two is caused. When the user does not select and the network service provider does not provide, the corresponding utility is 0. In the utility matrix, if the corresponding value is negative, it indicates that the user and the network service provider are not satisfied with each other, and the path is not selected.
In the utility matrices SU and UU, if there is an optimal solution (m)*，n*) So that the formula
The corresponding inequalities hold, i.e., m x n is the set of optimal solutions that satisfy the inequalities, then one such strategy is a set of Nash equilibrium solutions. In the above formula, amnAnd bmnAnd respectively representing values in the user utility matrix SU and the network service provider utility matrix UU, and if the corresponding strategy is that the user selects the path and the network service provider provides the path, the path is a path obtained by customizing the strategy for the routing service. If the corresponding strategy is other combination, the corresponding path is not the optimal solution.
The step 5 specifically includes:
node backup
Setting the priority of the router and proposing a position selection algorithm of a backup node by using fields determined in the router advertisement message by IPv6 RFC4191, wherein the specific flow of the algorithm is as follows:
5.1, acquiring relevant parameters of the current overall network environment, including node degree, link width, load, time delay, communication cost and packet loss rate;
5.2, adding the node with the maximum node degree into the candidate node set C;
5.3, calculating the weight occupied by each node;
the weight w (v) of the switch node not only reflects the importance of the node, but also represents the node traffic. The node degree dv is used to measure the weight of the node.
Thus constructing the weights w (v) and the node degrees dvThe mathematical function between the two defines the formula as follows:
w(v)＝f(dv)
the function f is generally understood as a reasonable metric, as shown by the formula:
wherein d ismax＝maxv∈VdvdmaxIs the maximum node degree;
5.4, solving to obtain paths from each node to the backup router candidate node according to a routing algorithm based on the parameter indexes corresponding to the links, and determining the minimum routing cost;
the transmission cost from the switch node to the backup router is represented by f (v, c), that is, the cost brought by the data information from the node to the backup router. In addition, various different influence factors need to be considered, and the following indexes corresponding to the link are considered in the text, and the indexes are respectively bandwidth, time delay, communication cost, packet loss rate and load.
In the transmission cost solving process from the switch node to the backup router, the combination solving can be carried out through the indexes, and if a single index is selected, the calculation is directly carried out; if a plurality of indexes are selected, weighting and summing the indexes according to the attention degree of the user requirements on different QoS indexes, ensuring the weight sum to be one, and further solving. Wherein, a weighted expression method formula is as follows:
f(v，c)＝a·delay+b·bandwidth+c·loss+d·cost+e·load
in the above formula, 0 ≦ a, b, c, d, e ≦ 1, a + b + c + d + e ≦ 1, delay, bandwidth, loss, cost, and load represent normalized influence factors, and further, the minimum path cost is determined, and f (v, c) is calculated.
In addition, not all nodes can be used as candidate nodes, and the optimal position node must be fully calculated and considered, so that the complexity is reduced, and the candidate node set is defined
And then selects the optimal location node from them.
The average cost function expression defining the data stream request is as follows:
where n represents the number of nodes, w (v) represents the weight of the nodes, and f (v, v) represents the transmission cost.
5.5, calculating the average cost of the backup router at the candidate position node;
two influencing factors, w (v) and f (v, v), are the most critical. In this document, the parameter of node weight is quantified by using the switch node degree, the parameter of transmission cost is quantified by using the transmission cost from the switch to the backup router, and the selection of the best position node is completed by quantifying the parameter. Therefore, the point at which the average cost function of the data flow request can take the minimum value is selected from the candidate node set C as the best deployment node of the backup router. The formula is as follows:
and if a plurality of nodes all meet h, (c) the optimal node, selecting the node with the maximum node degree for deployment.
And 5.6, traversing the candidate node set C to determine the optimal node.
Path backup
Route backupThe method mainly adopted is multipath routing. The final determination of the backup path is determined by a combination of link quality and path correlation. Link quality linkqualityThe success rate of data transmission is quantified, and the correlation of the path is calculated according to the path correlation factor eta, as shown in the formula:
linkbackup＝f×linkquality-g×η
η＝ηnode+ηlink
in the formula, f is the proportion of link quality, g is the proportion corresponding to the path correlation factor, and can be adjusted automatically according to the requirement, etanodeRepresenting the number of phase joints, eta, in two pathslinkRepresenting the number of related paths in the two paths, and considering the two paths to be independent if the nodes of the two paths are completely different. When the backup path is selected, the possibility that all possible backup paths are selected is calculated according to the link information obtained by the nodes, and the path with the largest value is selected as the backup path.
The beneficial technical effects of the invention are as follows: the network is intelligentized, and the capability of customizing the network reliability according to the different requirements of the users is provided. The network plans and configures routing service in advance according to different application requirements of different users, instantiates the routing, and constructs reasonable mapping from the service request to the reliable routing according to the reliable service type selected by the user. For users, the invention enables the users to select a proper reliable service level according to specific requirements and economic bearing capacity, and is helpful for constructing a good and healthy network economic model.
Drawings
FIG. 1 is a diagram of an IPv6 based service customized reliable routing system architecture in accordance with an embodiment of the present invention;
FIG. 2 is a flow chart of an IPv6 based service customized reliable routing method according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of selecting routers based on router priorities in accordance with an embodiment of the present invention;
FIG. 4 is a schematic diagram of a node backup mechanism according to an embodiment of the present invention;
FIG. 5 is a graph of membership functions for user requested bandwidths according to an embodiment of the present invention;
FIG. 6 is a graph of user-requested delay membership functions according to an embodiment of the present invention;
FIG. 7 is a graph of a user requested jitter membership function according to an embodiment of the present invention;
fig. 8 is a graph of membership functions for user requested packet loss rates according to embodiments of the present invention.
Detailed Description
The invention is further illustrated with reference to the following figures and examples.
As shown in fig. 1: the technical scheme adopted by the invention is an IPv 6-based service customized reliable routing system, which comprises the following steps:
the route customization module is connected with the route backup module;
the route customizing module is used as an upper layer module to firstly collect and analyze user requirements and judge whether to call the route backup module according to the category of the user requirements.
The routing customization module analyzes the user requirement attribute and considers the user utility and the network service provider utility on the basis of the actual requirements of a plurality of users to form a routing service customization strategy;
as shown in fig. 2, an IPv 6-based service customized reliable routing method includes:
the system collects the actual requirements of various clients of different types and constructs user documents;
in the specific implementation process, different types of users can request different QoS parameters and store the QoS parameters as QoS documents according to the actual needs of the users.
And 2, analyzing the user requirement attribute. The service type supported by the network is set to be S. For each service, the attribute corresponding to each service can be defined and divided into SL service classes. The classification is based on service attributes, for example, jitter sensitive services may be classified into service classes according to jitter size, and the service classes are as follows:
wherein, Maxbws、Mindls、MinjtsAnd MinlssRespectively representing maximum bandwidth, minimum delay, minimum jitter and minimum packet loss rate constraints for service S. If the delay is less than the minimum delay, the bandwidth is greater than the maximum bandwidth, etc., the quality of service is almost equivalent and cannot be effectively distinguished. For each service, there are defined SL classes of service. Wherein bwSL、dlSL、jtSLAnd LsSLRespectively representing the minimum bandwidth, maximum delay, maximum jitter and maximum packet loss rate constraints of the service S at the SL level, the service level classification of a certain service is shown in the following table:
step 3, ensuring balance between the cost and profit of meeting the user demand and the cost and profit of providing service by the network provider ISP, calculating the utility of the user and the ISP, and making an optimal routing service customization strategy meeting the benefits of both parties; the method comprises two parts of user utility calculation and network service provider utility calculation, and the specific calculation method comprises the following steps:
3.1 user utility calculation comprises the following steps:
membership functions are defined. In the above process, the user requirements have been classified and ranked according to the user profile, and now it is assumed that the applied QoS requirement interval is [ Bw ]L，BwH]、[DlL，DlH]、[JtL，JtH]And [ LsL，LsH]Wherein BwLAnd BwHMinimum bandwidth request and service maximum bandwidth request, Dl, on behalf of the userLAnd DlHMaximum delay request and service minimum delay request, Jt, on behalf of the userLAnd JtHMaximum jitter request and service minimum jitter request, Ls, on behalf of the userLAnd LsHRepresenting the maximum packet loss rate required by the user and the minimum packet loss rate request of the service. The actual QoS parameters that a service can provide are bw, dl, jt, and ls.
The membership function formula for the bandwidth requirement of the user is as follows:
wherein k isbwIs a constant between 0 and 1 and is set to 1 by default. CbwValues are as in FIG. 5;
the membership function formula for the delay required by the user is as follows:
wherein k isdlIs a constant between 0 and 1 and is set to 1 by default. CdlValues are as in FIG. 6;
the membership function formula for the jitter requirement of the user is as follows:
wherein k isjtIs a constant between 0 and 1 and is set to 1 by default. CjtThe values are shown in FIG. 7;
the membership function formula for the packet loss rate required by the user is as follows:
wherein k islsIs a constant between 0 and 1 and is set to 1 by default. ClsValues are as in FIG. 8;
next, the structure evaluation matrix F ═ F (bw) F (dl) F (jt) F (ls)]. Service of different kinds according to importanceDefining different weights for QoS indexes, giving the weights of bandwidth, delay, jitter and packet loss rate as alpha, beta, gamma and lambda according to the classification of user requirements, and constructing a weight matrix W as [ alpha beta [ gamma ] lambda ]](0<α，β，γ，λ<1). Defining the Satisfaction degree of customized service as Satisfailure ═ W.FTIn which F isTIs the transpose of F. The larger the corresponding value is, the higher the user satisfaction with the current resource configuration is indicated.
It is divided into four different satisfaction levels, as shown in the formula:
in the above formula, α1、α2、α3Setting according to actual conditions. The user satisfaction and the relevance of the user utility are shown as follows:
3.2 network service provider utility computation comprises the steps of:
3.2.1 determining candidate network service providers connected with the current node;
assuming that the current node is i, the i network service providers connected with the current node and satisfying the constraint condition are all considered as candidate network service providers.
3.2.2 determination of n evaluation indexes. Such as bandwidth resource amount, delay, jitter, packet loss rate, n is 4.
3.3.3 defines an evaluation matrix F, which is constructed from the candidate network service providers and the corresponding set of evaluation metrics. Wherein, the y-th evaluation index value corresponding to the x-th candidate network service provider is fxy(1. ltoreq. x. ltoreq.l, 1. ltoreq. y. ltoreq. n), each column in turn corresponding to the evaluation index mentioned in the preceding step.
3.3.4 calculating fmin，y、fmax，yAnd fmid，yRespectively representing a minimum value, a maximum value and a middle value of the y-th evaluation index, as shown in a formula:
3.3.5 the correction matrix F. Each evaluation index value in the evaluation matrix F is normalized.
A normalization processing formula for evaluating a higher evaluation index as the value is larger:
a normalization processing formula of an evaluation index whose evaluation is higher as the value is smaller:
a normalization processing formula for the evaluation index whose value tends to be more intermediate and higher:
the delay, jitter and packet loss rate are subjected to standardized correction according to a standardized processing formula with smaller value and higher evaluation, and the available bandwidth is subjected to standardized correction according to a standardized processing formula with larger value and higher evaluation.
3.3.6 calculating the sample variance of each evaluation index, and reflecting the influence of different evaluation indexes on the comprehensive index. The influence of one evaluation index is much larger than that of the other evaluation index, and can be balanced by a weight coefficient.
Wherein l represents the number of network service providers connected to the current node while satisfying the constraint condition,
and the mean value of the y-th evaluation index corresponding to each candidate network service provider is represented.
3.3.7 calculating the weight ratio of each evaluation index according to the sample variance of each evaluation index, wherein the sum of the weight ratios of all evaluation indexes is 1, and w is defined hereinyAnd the weight ratio of the y-th evaluation index is obtained. The calculation formula is as follows:
wherein in the formula
In particular to the sample variance of the y-th evaluation index,
the sample variance of the i-th evaluation index is broadly referred to.
3.3.8 score each candidate network service provider. Converting the composite score into a corresponding score, and using the calculated score as a utility of the corresponding candidate network service provider, the formula is as follows:
step 4, the user submits the demand information to the background server of the route customization module, the network service provider provides the current link state of the network to the background server of the route customization module, and the server matches the supply and demand of the user and the network service provider according to the summarized demand and the link state;
and selecting a two-person game to complete the matching of the user and the network service provider, wherein the game objects are the user U and the network service provider S. The policy of the user U is selection or non-selection of the current path, and the policy of the network service provider S includes provision or non-provision of the current path. The matrix constructed by the two is as follows:
in the formula, SU is defined as a user utility matrix, and UU is defined as a network service provider utility matrix. Respectively satisfied minimum value is formed by s0And u0Represents; the corresponding utilities of the user and the network service provider are represented by skAnd ukAnd (4) showing. The value of alpha is greater than 1, and punishment is given when the user does not select the strategy provided by the network service provider or the network service provider does not provide the current network service; defining 0 < beta < 1, when the network service provider does not provide service but the user selects, or the user does not select the network service provided by the corresponding network service provider, the loss of the two is caused. When the user does not select, the network clothesIf the service provider does not provide the service, the corresponding utility is 0. In the utility matrix, if the corresponding value is negative, it indicates that the user and the network service provider are not satisfied with each other, and the path is not selected.
In the utility matrices SU and UU, if there is an optimal solution (m)*，n*) So that the formula
The corresponding inequalities hold, i.e., m x n is the set of optimal solutions that satisfy the inequalities, then one such strategy is a set of Nash equilibrium solutions. In the above formula, amnAnd bmnRespectively representing values in the user utility matrix SU and the network service provider utility matrix UU. If the corresponding policy is that the user selects the path, and the network service provider provides the path, the path is a path obtained by customizing the policy for the routing service. And if the corresponding strategy is other combinations, the corresponding path is not the optimal solution.
And step 5, on the basis of classifying the network services, the ISP can define certain services as services with high reliability requirements, and the reliability of the services is further ensured on the network connectivity while the transmission performance is ensured. If the user needs the service, node backup or path backup is carried out, otherwise, the process is ended;
node backup
The RFC4191 field of Prf (Default Router preference) added in the Router advertisement message is based on
The router advertisement message defines the router priority as shown in the table:
the IPv6 host is set by default according to the priority of the router, and is selected when the router with high priority has abnormal fault
Selecting a backup router to replace, wherein the specific router backup steps are as follows:
(1) the router 1 and the router 2 send announcements;
(2) setting a default router list according to the priority of the router, wherein the router with high priority is used as a main router, and the router with low priority is used as a backup router;
steps 1-2 are shown in fig. 3:
the low-performance low-priority router 1 and the high-performance high-priority router 2 send different router advertisement messages to the hosts 1 and 2:
the router 1 announces a message: router priority: is low in
The router 2 announces a message: router priority: height of
Then, the default router lists of the two hosts are updated as follows:
Router 2, master router
(3) The IPv6 message is forwarded through the router 2;
(4) the main router fails;
(5) detecting that the master router 2 is unreachable;
(6) setting the router 1 as a main router;
the steps 4-6 are shown in FIG. 4:
when the router 2 fails, the host sends a neighbor solicitation message to the router 2, and the host sends own default route
The device list is updated as follows:
Router 2, failed router
The neighbor list is updated as follows:
Router 2, neighbor unreachable
(7) The new IPv6 message is forwarded through router 1.
The selection of the node backup position is restricted by a plurality of factors, and has great influence on the network reliability, and the document provides a node backup position selection method, which comprises the following specific steps:
step 5.1, obtaining relevant parameters of the current overall network environment, including node degree, link width, load, time delay, communication cost and packet loss rate;
step 5.2, adding the node with the maximum node degree into the candidate node set C;
step 5.3, calculating the weight occupied by each node;
and selecting the position of the backup node.
In the optimal deployment decision process of the backup router, two key factors need to be considered. One of them is the weight of the switch node, and the other important factor is the transmission cost from the switch node to the backup router. The weight w (v) of the switch node not only reflects the importance of the node, but also represents the node traffic. In this context, the node degree d is usedvAnd weighing the weight of the node.
The weight w (v) of the switch node not only reflects the importance of the node, but also represents the node traffic. Using node degree dvAnd weighing the weight of the node.
Thus constructing the weights w (v) and the node degrees dvThe mathematical function between the two defines the formula as follows:
w(v)＝f(dv)
the function f is generally understood as a reasonable metric, as shown by the formula:
wherein d ismax＝maxv∈Vdv。dmaxIs the maximum node degree;
step 5.4, based on the parameter indexes corresponding to the links, solving according to a routing algorithm to obtain paths from each node to the candidate nodes of the backup router, and determining the minimum routing cost;
the transmission cost from the switch node to the backup router is represented by f (v, c), that is, the cost brought by the data information from the node to the backup router. In addition, various different influence factors need to be considered, and the following indexes corresponding to the link are considered in the text, and the indexes are respectively bandwidth, time delay, communication cost, packet loss rate and load.
In the transmission cost solving process from the switch node to the backup router, the combination solving can be carried out through the indexes, and if a single index is selected, the calculation is directly carried out; if a plurality of indexes are selected, weighting and summing the indexes according to the attention degree of the user requirements on different QoS indexes, ensuring the weight sum to be one, and further solving. Wherein, a weighted expression method formula is as follows:
f(v，c)＝a·delay+b·bandwidth+c·loss+d·cost+e·load
in the above formula, 0 ≦ a, b, c, d, e ≦ 1, a + b + c + d + e ≦ 1, delay, bandwidth, loss, cost, and load represent normalized influence factors, and further, the minimum path cost is determined, and f (v, c) is calculated.
In addition, not all nodes can be used as candidate nodes, and the optimal position node must be fully calculated and considered, so that the complexity is reduced, and the candidate node set is defined
And then selects the optimal location node from them.
The average cost function expression defining the data stream request is as follows:
where n represents the number of nodes, w (v) represents the weight of the nodes, and f (v, c) represents the transmission cost.
Step 5.5, calculating the average cost of the backup router at the candidate position node;
two influencing factors, w (v) and f (v, c), are the most critical. In this document, the parameter of node weight is quantified by using the switch node degree, the parameter of transmission cost is quantified by using the transmission cost from the switch to the backup router, and the selection of the best position node is completed by quantifying the parameter. Therefore, the point at which the average cost function of the data flow request can take the minimum value is selected from the candidate node set C as the best deployment node of the backup router. The formula is as follows:
and if a plurality of nodes all meet h, (c) the optimal node, selecting the node with the maximum node degree for deployment.
And 5.6, traversing the candidate node set C to determine the optimal node.
Path backup
The method mainly adopted by path backup is multipath routing. The final determination of the backup path is determined by a combination of link quality and path correlation. Link quality linkqualityThe success rate of data transmission is quantified, and the correlation of the path is calculated according to the path correlation factor eta, as shown in the formula:
linkbackup＝f×linkquality-g×n
η＝ηnode+ηlink
in the formula, f is the proportion of link quality, g is the proportion corresponding to the path correlation factor, and can be adjusted automatically according to the requirement, etanodeRepresenting the number of phase joints, eta, in two pathslinkRepresenting the number of related paths in the two paths, and considering the two paths to be independent if the nodes of the two paths are completely different. When the backup path is selected, the possibility that all possible backup paths are selected is calculated according to the link information obtained by the nodes, and the path with the largest value is selected as the backup path.
And 6, performing data forwarding on the established routing strategy, routing strategy and node backup data or routing strategy and path backup data in a data forwarding layer.
Claims (4)
1. An IPv 6-based service customized reliable routing method is characterized in that the method is realized by adopting an IPv 6-based service customized reliable routing system, and the system comprises the following steps: the system comprises a route customization module and a route backup module, wherein the route customization module is connected with the route backup module; the routing customization module analyzes user demand attributes on the basis of actual demands of a plurality of users, and forms a routing service customization strategy by considering user utility and network service provider utility; the route backup module is used for completing node backup and path backup; the method specifically comprises the following steps:
step 1, acquiring different types of communication requirements of users, and defining the communication requirements of the users as user documents; the system collects the actual requirements of various clients of different types and constructs user documents;
step 2, performing attribute analysis on the obtained user document, and classifying and grading requirements;
defining the service type as S, and dividing each service into SL service classes, wherein indexes corresponding to each service are broadband, delay, jitter and packet loss rate;
step 3, ensuring balance between the service cost and profit provided by the user demand and the network provider ISP, and making an optimal routing service customization strategy meeting the benefits of both parties; the method specifically comprises the following steps:
step 3.1 user utility calculation includes:
defining the user utility as the satisfaction degree of providing the service to the ISP, wherein the larger the service satisfaction degree is, the more approved the resource configuration of the user to the network is indicated, and the larger the user utility is;
firstly, defining membership functions f (bw), f (dl), f (jt) and f (ls), which are in one-to-one correspondence with bandwidth, delay, jitter and packet loss rate;
on the basis of classifying and grading the requirements, the bandwidth, delay, jitter and packet loss rate requirement intervals of the application are assumed to be [ Bw respectivelyL，BwH]、[DlL，DlH]、[JtL，JtH]And [ LsL，LsH]The parameters of actual bandwidth, delay, jitter and packet loss rate which can be provided by a certain service are bw, dl, jt and ls respectively;
the membership function formula for the bandwidth required by the user is as follows:
in the above formula, BwLAnd BwHMinimum and maximum bandwidth requests for traffic, C, on behalf of the userbwAnd kbwAre each a constant between 0 and 1;
the membership function formula for the delay required by the user is as follows:
in the above formula, DlLAnd DlHMaximum delay request and service minimum delay request on behalf of the user, CdlAnd kdlAre each a constant between 0 and 1;
the membership function formula for the jitter requirement of the user is as follows:
in the above formula, JtLAnd JtHMaximum jitter request and service minimum jitter request on behalf of the user, CjtAnd kjtAre each a constant between 0 and 1;
the membership function formula for the packet loss rate required by the user is as follows:
in the above formula, LsLAnd LsHMaximum packet loss rate and service minimum packet loss rate request representing user needs, ClsAnd klsAre each a constant between 0 and 1;
constructing an evaluation matrix F ═ F (bw) F (dl) F (jt) F (ls) through membership functions F (bw), F (dl), F (jt) and F (ls), defining different weights for indexes according to the importance degree of QoS indexes by different services, respectively giving the weights of bandwidth, delay, jitter and packet loss rate to alpha, beta, gamma and lambda according to the classes to which user demands belong, constructing a weight matrix W ═ alpha beta gamma lambda, wherein the weights are all values between 0 and 1, and the weight sum is 1;
defining the customized service Satisfaction as Satisfailure ═ W · FTIn which F isTThe value of the satisfaction degree is larger for the transposition of the F, which indicates that the satisfaction degree of the user on the current resource configuration is higher;
the customized service satisfaction is divided into four different satisfaction levels, specifically as the following formula:
in the above formula, α1、α2、α3Setting according to actual conditions;
and solving the corresponding user utility according to the customized service satisfaction:
step 3.2 network service provider utility calculation, comprising the steps of:
3.2.1 determining candidate network service providers connected with the current node;
assuming that the current node is i, considering that all the network service providers which are connected with the current node and meet the constraint condition are candidate network service providers;
3.2.2, determining n evaluation indexes, such as bandwidth resource amount, delay, jitter and packet loss rate, wherein n is 4;
3.2.3 defining an evaluation matrix F, the matrix F is formed according to candidate network service providers and corresponding evaluation index sets, wherein, the y-th evaluation index value corresponding to the x-th candidate network service provider is Fxy(1. ltoreq. x. ltoreq.l, 1. ltoreq. y. ltoreq. n), each column corresponding in turn to the evaluation index mentioned in the preceding step;
3.2.4 calculating fmin，y、fmax，yAnd fmid，yRespectively representing a minimum value, a maximum value and a middle value of the y-th evaluation index, as shown in a formula:
3.2.5 correcting the matrix F, standardizing each evaluation index value in the evaluation matrix F;
a normalization processing formula for evaluating a higher evaluation index as the value is larger:
a normalization processing formula of an evaluation index whose evaluation is higher as the value is smaller:
a normalization processing formula for the evaluation index whose value tends to be more intermediate and higher:
the delay, jitter and packet loss rate are subjected to standardized correction according to a standardized processing formula with smaller value and higher evaluation, and the available bandwidth is subjected to standardized correction according to a standardized processing formula with larger value and higher evaluation;
3.2.6 calculating the sample variance of each evaluation index, which can reflect the influence of different evaluation indexes on the comprehensive index, wherein the influence of one evaluation index is far greater than the influence of the other evaluation index, and the influence can be balanced by a weight coefficient;
wherein l represents the number of network service providers connected to the current node while satisfying the constraint condition,
the mean value of the y-th evaluation index corresponding to each candidate network service provider is represented;
3.2.7 calculating the weight ratio of each evaluation index according to the sample variance of each evaluation index, wherein the sum of the weight ratios of all the evaluation indexes is 1, and w is defined in the textyFor the weight ratio of the y-th evaluation index, the calculation formula is as follows:
wherein in the formula
In particular to the sample variance of the y-th evaluation index,
the sample variance of the ith evaluation index is generally referred to;
3.2.8 score each candidate network service provider, convert the composite score to a corresponding score, and use the calculated score as the utility of the corresponding candidate network service provider, the formula is as follows:
step 4, the user submits the demand information to the background server of the route customization module, the network service provider provides the current link state of the network to the background server of the route customization module, and the server matches the supply and demand of the user and the network service provider according to the summarized demand and the link state;
step 5, on the basis of classifying the network services, the ISP can define certain services as services with high reliability requirements, and the reliability of the services is further ensured on the network connectivity while the transmission performance is ensured; if the user needs the service, node backup or path backup is carried out, otherwise, the process is ended;
and 6, performing data forwarding on the established routing strategy, routing strategy and node backup data or routing strategy and path backup data in a data forwarding layer.
2. The IPv 6-based service customized reliable routing method according to claim 1, wherein the step 4 includes:
in the process of matching the user with the network service provider, the factor to be considered is mainly the matching between the user requirement and the supply of the network service provider, and a two-person game is selected for matching in the design;
selecting a two-person game to complete the matching of the user and the network service provider, wherein the game objects are a user U and a network service provider S, the strategy of the user U is selected or not selected for the current path, the strategy of the network service provider S comprises the provision or non-provision for the current path, and a matrix constructed by the user U and the network service provider S is as follows:
in the formula, SU is defined as a user utility matrix, and UU is defined as a network service provider utility matrix; respectively satisfied minimum value is formed by s0And u0Represents; the corresponding utilities of the user and the network service provider are represented by skAnd ukIndicating that alpha is a value larger than 1, and punishment is given when the user does not select the strategy provided by the network service provider or the network service provider does not provide the current network service; defining 0 < beta < 1, and when the network service provider does not provide service but the user selects the network service or the user does not select the network service provided by the corresponding network service provider, causing the loss of the network service provider and the user; when the user does not select and the network service provider does not provide, the corresponding utility is 0; in the utility matrix, if the corresponding numerical value is negative, the user and the network service provider are not satisfied with each other, and the path is not selected;
in the utility matrices SU and UU, if there is an optimal solution (m)*，n*) So that the formula
Corresponding inequalities are set, i.e. m n is a set of optimal solutions satisfying the inequalities, then one such strategy is a set of Nash equilibrium solutions, in the above formula, amnAnd bmnRespectively representing the values in the user utility matrix SU and the network service provider utility matrix UU, if the corresponding strategy is that the user selects the path, the network service provider provides the pathAnd if the corresponding strategy is other combinations, the corresponding path is not the optimal solution.
3. The IPv 6-based service customized reliable routing method according to claim 1, wherein the step 5 includes:
node backup
Step 5.1, obtaining relevant parameters of the current overall network environment, including node degree, link width, load, time delay, communication cost and packet loss rate;
step 5.2, adding the node with the maximum node degree into the candidate node set C;
step 5.3, calculating the weight occupied by each node;
the weight w (v) of the switch node not only reflects the importance of the node, but also represents the node flow, and the node degree d is usedvWeighing the weight of the node;
thus constructing the weights w (v) and the node degrees dvThe mathematical function between the two defines the formula as follows:
w(v)＝f(dv)
the function f is generally understood as a reasonable metric, as shown by the formula:
wherein d ismax＝maxv∈Vdv，dmaxIs the maximum node degree;
step 5.4, based on the parameter indexes corresponding to the links, solving according to a routing algorithm to obtain paths from each node to the candidate nodes of the backup router, and determining the minimum routing cost;
the transmission cost from the switch node to the backup router is represented by f (v, c), namely the cost brought by the data information from the node to the backup router, and the following indexes corresponding to the link are considered, wherein the indexes are respectively bandwidth, time delay, communication cost, packet loss rate and load;
in the transmission cost solving process from the switch node to the backup router, the combination solving can be carried out through the indexes, and if a single index is selected, the calculation is directly carried out; if a plurality of indexes are selected, weighting and summing the indexes according to the attention degree of the user requirements on different QoS indexes, ensuring the weight sum to be one, and further solving; wherein, a weighted expression method formula is as follows:
f(v，c)＝a·delay+b·bandwidth+c·loss+d·cost+e·load
in the above formula, a is more than or equal to 0, b, c, d, e is less than or equal to 1, a + b + c + d + e is 1, delay, bandwidth, loss, cost, and load represent normalized influence factors, and then the minimum path cost is determined, and f (v, c) is calculated;
in addition, not all nodes can be used as candidate nodes, and the optimal position node must be fully calculated and considered, so that the complexity is reduced, and the candidate node set is defined
Then selecting an optimal position node from the position information;
the average cost function expression defining the data stream request is as follows:
wherein n represents the number of nodes, w (v) represents the weight of the nodes, and f (v, c) represents the transmission cost;
step 5.5, calculating the average cost of the backup router at the candidate position node;
the parameter of node weight is quantized by using the switch node degree, the parameter of transmission cost is quantized by using the transmission cost from the switch to the backup router, and the selection of the best position node is completed by quantizing the parameter, so that the point with the minimum value of the average cost function of the data flow request selected from the candidate node set C can be used as the best deployment node of the backup router, and the formula is as follows:
if a plurality of nodes all meet h, (c) optimal, selecting the node with the maximum node degree for deployment;
and 5.6, traversing the candidate node set C to determine the optimal node.
4. The IPv 6-based service customized reliable routing method according to claim 1, wherein the step 5 includes:
path backup
The path backup mainly adopts a method of multi-path routing, the final determination of the backup path is comprehensively determined by link quality and path correlation, and the link quality linkqualityThe success rate of data transmission is quantified, and the correlation of the path is calculated according to the path correlation factor eta, as shown in the formula:
linkbackup＝f×linkquality-g×η
η＝ηnode+ηlink
in the formula, f is the proportion of link quality, g is the proportion corresponding to the path correlation factor, and can be adjusted automatically according to the requirement, etanodeRepresenting the number of phase joints, eta, in two pathslinkAnd representing the number of related paths in the two paths, if the nodes of the two paths are completely different, considering that the two paths are independent, when a backup path is selected, calculating the possibility that all possible backup paths are selected according to link information obtained by the nodes, and selecting the path with the largest value as the backup path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910249650.2A CN109802890B (en) | 2019-03-29 | 2019-03-29 | IPv 6-based service customized reliable routing system and method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910249650.2A CN109802890B (en) | 2019-03-29 | 2019-03-29 | IPv 6-based service customized reliable routing system and method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109802890A CN109802890A (en) | 2019-05-24 |
| CN109802890B true CN109802890B (en) | 2021-06-08 |
Family
ID=66564307
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910249650.2A Active CN109802890B (en) | 2019-03-29 | 2019-03-29 | IPv 6-based service customized reliable routing system and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109802890B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111865793B (en) * | 2020-08-04 | 2021-07-13 | 东北大学 | IPv6 network service customized reliable routing system and method based on function learning |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101056187B (en) * | 2006-04-14 | 2010-05-26 | 王伟珣 | A system and method for oriented and customized distribution of the network contents |
| US9197569B2 (en) * | 2013-12-06 | 2015-11-24 | Algoblu Holdings Limited | Hierarchical control in software-defined network (SDN) |
| CN103841053A (en) * | 2014-02-24 | 2014-06-04 | 齐齐哈尔大学 | Novel bandwidth allocation algorithm supporting QoS |
| DE112017007523T5 (en) * | 2017-05-09 | 2020-02-27 | Intel Corporation | CREATE A COMPUTER SYSTEM |
-
2019
- 2019-03-29 CN CN201910249650.2A patent/CN109802890B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN109802890A (en) | 2019-05-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10673763B2 (en) | Learning or emulation approach to traffic engineering in information-centric networks | |
| US8064432B2 (en) | System for utilizing genetic algorithm to provide constraint-based routing of packets in a communication network | |
| US6912587B1 (en) | Method for utilizing a generic algorithm to provide constraint-based routing of packets in a communication network | |
| Shanbhag et al. | SoCCeR: Services over content-centric routing | |
| Han et al. | Autosec: An integrated middleware framework for dynamic service brokering | |
| JP2005539437A (en) | Radio resource control system | |
| Lei et al. | An entropy-based probabilistic forwarding strategy in named data networking | |
| Al-Sadi et al. | Routing algorithm optimization for software defined network WAN | |
| Torkzadeh et al. | Energy-aware routing considering load balancing for SDN: a minimum graph-based Ant Colony Optimization | |
| Rego et al. | Dynamic metric OSPF-based routing protocol for software defined networks | |
| CN109802890B (en) | IPv 6-based service customized reliable routing system and method | |
| Bharanidharan et al. | An enhanced framework for traffic load balancing and QoS provisioning in SDN | |
| Jin et al. | Source-based qos service routing in distributed service networks | |
| Wang et al. | Edge-based traffic engineering for OSPF networks | |
| Lao et al. | Algorithms and trade-offs in multicast service overlay design | |
| Ahdan et al. | Adaptive Forwarding Strategy in Named Data Networking: A Survey | |
| Shirmarz et al. | A novel flow routing algorithm based on non-dominated ranking and crowd distance sorting to improve the performance in SDN | |
| Hou et al. | Service-differentiated QoS routing based on ant colony optimisation for named data networking | |
| Kamboj et al. | A policy based framework for quality of service management in software defined networks | |
| Lin et al. | Proactive multipath routing with a predictive mechanism in software‐defined networks | |
| Hsu et al. | DiffServ‐based bandwidth‐constrained anycast routing in a mobile IPv6 network | |
| Tivig et al. | Critical analysis of multi-controller placement problem in large SDN networks | |
| Jin et al. | QoS service routing in one-to-one and one-to-many scenarios in next-generation service-oriented networks | |
| Pang et al. | Horizon: a QoS management framework for SDN-based data center networks | |
| CN112822107A (en) | Wide area network optimization method based on artificial intelligence |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |