CN114301849B - SRv 6-based network path priority analysis method and system - Google Patents
SRv 6-based network path priority analysis method and system Download PDFInfo
- Publication number
- CN114301849B CN114301849B CN202111533296.XA CN202111533296A CN114301849B CN 114301849 B CN114301849 B CN 114301849B CN 202111533296 A CN202111533296 A CN 202111533296A CN 114301849 B CN114301849 B CN 114301849B
- Authority
- CN
- China
- Prior art keywords
- node
- probability
- priority
- processing
- transition
- 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
- 238000004458 analytical method Methods 0.000 title claims abstract description 14
- 238000000034 method Methods 0.000 claims abstract description 8
- 238000012545 processing Methods 0.000 claims description 63
- 230000007704 transition Effects 0.000 claims description 59
- 230000005540 biological transmission Effects 0.000 abstract description 3
- 238000005516 engineering process Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 239000011159 matrix material Substances 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 238000005206 flow analysis Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000002689 soil Substances 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Computer And Data Communications (AREA)
Abstract
A network path priority analysis method and system based on SRv, comprising the following steps: s1: periodically analyzing the priority levels of the messages sent by the plurality of sending SR nodes to the target SR node through a database; s2: the target SR node processes the messages in each time period sequentially for each sending SR node according to the priority level. By simultaneously sending message requests to the same target SR node aiming at a plurality of SR node paths in SRv network, the target SR node is difficult to achieve the priority selection and timeliness requirements of the analysis message, and a more intelligent SRv network path priority analysis method is introduced to improve SRv network equipment and transmission capacity.
Description
Technical Field
The invention relates to the technical field of flow analysis, in particular to a network path priority analysis method and system based on SRv.
Background
With the rapid development of computer technology, information networks have become an important guarantee of social development. Under the large background of the cloud network convergence age, the flexible and agile network service capability directly influences the competitiveness of operators. SR (Segment Routing) is one of source routing technologies, SRv is an application of SR technology in IPv6 networks. SRv6 is a huge innovation, and the programmable network is enabled by combining SDN technology, so that innovative soil is provided for network basic services and value-added network services in the cloud network era. Under such a large network scale, when multiple IPv6 source network paths in the SRv network send a message request to the same destination node at the same time, the destination node is difficult to meet the requirements of priority selection and timeliness of the analysis message, so that a more intelligent SRv network path priority analysis method is introduced to improve the capacities of SRv network devices and transmission.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides a network path priority analysis method and system based on SRv.
In order to achieve the above purpose, the present invention adopts the following technical scheme:
A network path priority analysis method based on SRv comprises the following steps:
S1: periodically analyzing the priority levels of the messages sent by the plurality of sending SR nodes to the target SR node through a database;
s2: the target SR node processes the messages in each time period sequentially for each sending SR node according to the priority level.
In order to optimize the technical scheme, the specific measures adopted further comprise:
Further, the specific content of the step S1 is:
s1.1: the database analyzes the probability a of the prior processing of the SR node and the probability b of the non-prior processing of the corresponding SR node in the last period according to the historical data;
S1.2: the database analyzes the transition probability c that the transition to the non-priority processing is in the next period in the probability a that the corresponding sending SR node is processed preferentially and the transition probability d that the transition to the priority processing is still in the next period in the probability a that the corresponding sending SR node is processed preferentially according to the historical data; and a transition probability e of transition to priority processing in the next period in the probability b of non-priority processing of the corresponding transmitting SR node, and a transition probability f of transition to non-priority processing in the next period in the probability b of non-priority processing of the corresponding transmitting SR node; wherein a+b=1, c+d=1, e+f=1;
S1.3: calculating the probability of the corresponding transmitting SR node being preferentially processed in the next period, wherein g=a+b+e;
s1.4: the priority level is identified according to the magnitude of the probability g that each transmitting SR node is prioritized in the next phase.
Further, a network path priority parsing system based on SRv is characterized by comprising:
The SR node is used for sending the data information to the target SR node for processing;
A database for periodically analyzing priority levels of messages sent by the plurality of sending SR nodes to the target SR node;
and the target SR node is used for processing the messages sent by the sending SR node in sequence according to the priority level.
Further, the database is further configured to:
analyzing the probability a of the prior processing of the SR node and the probability b of the non-prior processing of the corresponding SR node in the last period according to the historical data;
Analyzing transition probability c which is changed to be non-preferential processing in the next period in the probability a which is processed by the corresponding sending SR node preferentially and transition probability d which is still changed to be preferential processing in the next period in the probability a which is processed by the corresponding sending SR node preferentially according to the historical data; and a transition probability e of transition to priority processing in the next period in the probability b of non-priority processing of the corresponding transmitting SR node, and a transition probability f of transition to non-priority processing in the next period in the probability b of non-priority processing of the corresponding transmitting SR node; wherein a+b=1, c+d=1, e+f=1;
calculating the probability of the corresponding transmitting SR node being preferentially processed in the next period, wherein g=a+b+e;
the priority level is identified according to the magnitude of the probability g that each transmitting SR node is prioritized in the next phase.
The beneficial effects of the invention are as follows:
1. By marking the priority levels for the plurality of sending SR nodes, the target SR node can process the data according to the priority levels for a period of time, so that the data with higher priority levels can be ensured to be processed in time, and the disorder of the unordered processed data in the traditional data processing is avoided.
2. The priorities of the plurality of sending SR nodes are updated regularly so as to ensure the accuracy of the priorities and avoid untimely data transmission.
Drawings
Fig. 1 is a schematic diagram of calculating a next month priority probability for a transmitting SR node according to an embodiment of the present invention.
Detailed Description
The invention will now be described in further detail with reference to the accompanying drawings.
A network path priority analysis method based on SRv comprises the following steps:
S1: periodically analyzing the priority levels of the messages sent by the plurality of sending SR nodes to the target SR node through a database;
s2: the target SR node processes the messages in each time period sequentially for each sending SR node according to the priority level.
The specific content of step S1 is as follows:
s1.1: the database analyzes the probability a of the prior processing of the SR node and the probability b of the non-prior processing of the corresponding SR node in the last period according to the historical data;
S1.2: the database analyzes the transition probability c that the transition to the non-priority processing is in the next period in the probability a that the corresponding sending SR node is processed preferentially and the transition probability d that the transition to the priority processing is still in the next period in the probability a that the corresponding sending SR node is processed preferentially according to the historical data; and a transition probability e of transition to priority processing in the next period in the probability b of non-priority processing of the corresponding transmitting SR node, and a transition probability f of transition to non-priority processing in the next period in the probability b of non-priority processing of the corresponding transmitting SR node; wherein a+b=1, c+d=1, e+f=1;
S1.3: calculating the probability of the corresponding transmitting SR node being preferentially processed in the next period, wherein g=a+b+e;
s1.4: the priority level is identified according to the magnitude of the probability g that each transmitting SR node is prioritized in the next phase.
A SRv-based network path priority resolution system, comprising:
The SR node is used for sending the data information to the target SR node for processing;
A database for periodically analyzing priority levels of messages sent by the plurality of sending SR nodes to the target SR node;
and the target SR node is used for processing the messages sent by the sending SR node in sequence according to the priority level.
Wherein the database is further for:
analyzing the probability a of the prior processing of the SR node and the probability b of the non-prior processing of the corresponding SR node in the last period according to the historical data;
Analyzing transition probability c which is changed to be non-preferential processing in the next period in the probability a which is processed by the corresponding sending SR node preferentially and transition probability d which is still changed to be preferential processing in the next period in the probability a which is processed by the corresponding sending SR node preferentially according to the historical data; and a transition probability e of transition to priority processing in the next period in the probability b of non-priority processing of the corresponding transmitting SR node, and a transition probability f of transition to non-priority processing in the next period in the probability b of non-priority processing of the corresponding transmitting SR node; wherein a+b=1, c+d=1, e+f=1;
calculating the probability of the corresponding transmitting SR node being preferentially processed in the next period, wherein g=a+b+e;
the priority level is identified according to the magnitude of the probability g that each transmitting SR node is prioritized in the next phase.
After calculating the priority orders of the plurality of sending SR nodes, the target SR node performs data processing according to the priority orders for a period of time.
For example, refer to fig. 1. Now there are 10 transmitting SR nodes, all of which transmit data information to 1 target SR node; the database analyzes the probability a that each transmitting SR node is processed preferentially in the previous month and the probability b that the corresponding SR node is processed non-preferentially through the historical data, and meanwhile, the database also analyzes the transition probability c, the transition probability d, the transition probability e and the transition probability f of the corresponding transmitting SR node in the next month through the historical data. Calculating the probability g=a+d+b×e that each corresponding transmitting SR node is preferentially processed in the next month by calculating the data, and sorting and marking the priorities according to the size of each transmitting SR node g as follows: 1-10. The target SR node processes the data according to the priority level in the next month, wherein the specific processing mode is that the data received by the current day is processed according to the priority level in the time period of each day in the next month; when all data is processed on that day, the data received on the next day is processed. The transmitting SR node that transmits the first 4 bits of processing in each day is referred to as priority processing, and is referred to as non-priority processing.
Wherein, since not every transmitting SR node will transmit a message on every day, every transmitting SR node has an opportunity to be prioritized, for example, on a certain day, one transmitting SR node with the top four of the priority ranks does not transmit a message on the same day, and then the fifth transmitting SR node with the top four of the priority ranks is listed on the same day, so as to be prioritized.
The calculation method for a certain transmitting SR node a is as follows: the database obtains the number of times the node is processed preferentially in the previous month, and divides the number of times by the total number of times processed in the previous month; the node b is calculated in such a way that b=1-a.
The calculation method for the transition probability c for transitioning to the non-priority processing in the next month in the case where the corresponding transmitting SR node is preferentially processed is as follows: the history database is used for obtaining the total priority treatment rate x (total priority treatment times/total treatment times) in history (last month and last month); knowing the priority treatment probability a (the priority treatment times of the last month/the total treatment times of the last month) in the last month through a history database; calculating the probability c, c=s+ (x-a) of transitioning to non-preferential treatment in the next month in the case of preferential treatment in the previous month; where s is a threshold value, and since c+d=1, d can be obtained.
For example, when the total priority treatment rate x=30% =0.3 and the previous priority treatment rate a=28% =0.28, the transition of 2% =0.02 to the non-priority treatment is described, and the transition probability c=22% =0.22 and d=1 to 22% =0.78 in the next month is obtained by 2% +20% (threshold s). The threshold s is preset, and a specific threshold is selected for the actual transition difference value (the difference value is 2% in this example) in different regions, so as to ensure that the transition probability is smaller than 1 and larger than 0.
The calculation method of the transition probability e for the transition to the priority processing in the next month in the case of the non-priority processing of the corresponding transmitting SR node is as follows: the total non-preferential treatment rate x' (total non-preferential treatment times/total treatment times) in history (last month and last month) is known through a history database; knowing the non-preferential treatment probability b (the non-preferential treatment times of the last month/the total treatment times of the last month) in the last month through a historical database; calculating the probability e, e=s '+ (x' -b) of transition to priority treatment in the next month in the case of non-priority treatment in the previous month; where s' is a threshold value, since e+f=1, f can be obtained.
For example, the total non-priority treatment rate x '=70% =0.3, the previous priority treatment rate a=72% =0.72, and the transition to the priority treatment of 2% =0.02 is explained, and the transition probability e=32% =0.32, and f=1-32% =0.68 is obtained in the next month by 2% +30% (threshold s'). The threshold s' is preset, and a specific threshold is selected for the actual transition difference value (in this example, the difference value is 2%) in different regions, so as to ensure that the transition probability is smaller than 1 and larger than 0.
To sum up, in the next month, the priority probability g=0.28×0.78+0.72×0.32= 0.4488 of the corresponding transmitting SR node, and similarly, other transmitting SR nodes are calculated and compared to make the respective priority levels clear.
The application adopts the idea of a Markov chain algorithm. The Markov transfer matrix method model formula is as follows: x (k+1) =x (k) ×p; x (k) represents a state vector of the trend analysis and prediction object at time t=k, P represents a one-step transition probability matrix, and X (k+1) represents a state vector of the trend analysis and prediction object at time t=k+1.
It should be noted that the terms like "upper", "lower", "left", "right", "front", "rear", and the like are also used for descriptive purposes only and are not intended to limit the scope of the invention in which the invention may be practiced, but rather the relative relationship of the terms may be altered or modified without materially altering the teachings of the invention.
The above is only a preferred embodiment of the present invention, and the protection scope of the present invention is not limited to the above examples, and all technical solutions belonging to the concept of the present invention belong to the protection scope of the present invention. It should be noted that modifications and adaptations to the invention without departing from the principles thereof are intended to be within the scope of the invention as set forth in the following claims.
Claims (2)
1. The network path priority analysis method based on SRv is characterized by comprising the following steps:
S1: periodically analyzing the priority levels of a plurality of transmitting SR nodes through a database; the method specifically comprises the following sub-steps:
s1.1: the database analyzes the probability a of the prior processing of the SR node and the probability b of the non-prior processing of the corresponding SR node in the last period according to the historical data;
S1.2: the database analyzes the transition probability c that the transition to the non-priority processing is in the next period in the probability a that the corresponding sending SR node is processed preferentially and the transition probability d that the transition to the priority processing is still in the next period in the probability a that the corresponding sending SR node is processed preferentially according to the historical data; and a transition probability e of transition to priority processing in the next period in the probability b of non-priority processing of the corresponding transmitting SR node, and a transition probability f of transition to non-priority processing in the next period in the probability b of non-priority processing of the corresponding transmitting SR node; wherein a+b=1, c+d=1, e+f=1;
s1.3: calculating the probability of the corresponding transmitting SR node being preferentially processed in the next period, wherein g=a+b+e;
S1.4: identifying a priority level according to the size of the probability g that each transmitting SR node is preferentially processed in the next period;
s2: the target SR node processes the messages in each time period sequentially for each sending SR node according to the priority level.
2. A SRv-based network path priority resolution system, comprising:
The SR node is used for sending the data information to the target SR node for processing;
a database for periodically analyzing priority levels of the plurality of transmitting SR nodes;
The target SR node is used for processing the messages sent by the sending SR node according to the priority level in sequence;
The database is also for:
analyzing the probability a of the prior processing of the SR node and the probability b of the non-prior processing of the corresponding SR node in the last period according to the historical data;
Analyzing transition probability c which is changed to be non-preferential processing in the next period in the probability a which is processed by the corresponding sending SR node preferentially and transition probability d which is still changed to be preferential processing in the next period in the probability a which is processed by the corresponding sending SR node preferentially according to the historical data; and a transition probability e of transition to priority processing in the next period in the probability b of non-priority processing of the corresponding transmitting SR node, and a transition probability f of transition to non-priority processing in the next period in the probability b of non-priority processing of the corresponding transmitting SR node; wherein a+b=1, c+d=1, e+f=1;
calculating the probability of the corresponding transmitting SR node being preferentially processed in the next period, wherein g=a+b+e;
the priority level is identified according to the magnitude of the probability g that each transmitting SR node is prioritized in the next phase.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111533296.XA CN114301849B (en) | 2021-12-15 | 2021-12-15 | SRv 6-based network path priority analysis method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111533296.XA CN114301849B (en) | 2021-12-15 | 2021-12-15 | SRv 6-based network path priority analysis method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114301849A CN114301849A (en) | 2022-04-08 |
| CN114301849B true CN114301849B (en) | 2024-05-17 |
Family
ID=80967888
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111533296.XA Active CN114301849B (en) | 2021-12-15 | 2021-12-15 | SRv 6-based network path priority analysis method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114301849B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105210347A (en) * | 2014-04-04 | 2015-12-30 | 华为技术有限公司 | Monitoring server, parsing server, request device and node selection method |
| CN112311592A (en) * | 2020-09-29 | 2021-02-02 | 新华三信息安全技术有限公司 | SRv6SID self-adaptive networking method and device |
| CN113037651A (en) * | 2020-12-30 | 2021-06-25 | 网络通信与安全紫金山实验室 | Method, device and equipment for improving QoS (quality of service) of flow forwarding and storage medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CL2010000027A1 (en) * | 2010-01-15 | 2011-04-25 | Univ Tecnica Federico Santa Maria Utfsm | Method for sizing a cellular mobile communications network with users of different categories to optimize the use of the channels available in said network with prioritized access. |
| US9853906B2 (en) * | 2015-09-10 | 2017-12-26 | Lenovo Enterprise Solutions (Singapore) Pte. Ltd. | Network prioritization based on node-level attributes |
-
2021
- 2021-12-15 CN CN202111533296.XA patent/CN114301849B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105210347A (en) * | 2014-04-04 | 2015-12-30 | 华为技术有限公司 | Monitoring server, parsing server, request device and node selection method |
| CN112311592A (en) * | 2020-09-29 | 2021-02-02 | 新华三信息安全技术有限公司 | SRv6SID self-adaptive networking method and device |
| CN113037651A (en) * | 2020-12-30 | 2021-06-25 | 网络通信与安全紫金山实验室 | Method, device and equipment for improving QoS (quality of service) of flow forwarding and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114301849A (en) | 2022-04-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11057294B2 (en) | Route control method and route setting device | |
| CN113498106A (en) | Scheduling method and device for time-sensitive network TSN (transport stream network) stream | |
| CN112887217B (en) | Control data packet sending method, model training method, device and system | |
| CN106202092A (en) | The method and system that data process | |
| CN103477595A (en) | Network, data transfer node, communication method and program | |
| Wang et al. | A reinforcement learning approach for online service tree placement in edge computing | |
| CN102315956A (en) | Method and device for supervising flow | |
| CN113328953B (en) | Method, device and storage medium for network congestion adjustment | |
| WO2023082431A1 (en) | Traffic scheduling method and system under multi-square ring structure | |
| CN106506275B (en) | A kind of method and device for predicting switching node destination port propagation delay time | |
| WO2018166249A1 (en) | Network service transmission method and system | |
| CN111865681A (en) | Core network slice end-to-end time delay optimization method, system and storage medium | |
| CN114301849B (en) | SRv 6-based network path priority analysis method and system | |
| CN111740922B (en) | Data transmission method, device, electronic equipment and medium | |
| Nilim et al. | Multi-aircraft routing and traffic flow management under uncertainty | |
| CN109905331A (en) | Array dispatching method and device, communication equipment, storage medium | |
| EP3531622B1 (en) | Method of handling packet flow in software-defined network, computer program product, and software-defined network | |
| CN115277572B (en) | Congestion control method and system for multi-source multi-sink network | |
| CN113891466B (en) | Online scheduling system and method for UDL tasks in edge wireless network | |
| CN112333102B (en) | Software defined network routing method and system based on knowledge graph | |
| CN114448838B (en) | System reliability evaluation method | |
| CN112232605B (en) | Processing method, device and equipment for dispatching resources and computer readable storage medium | |
| CN107659501A (en) | Efficiency optimized transmission method and system based on complicated gradient network | |
| CN115297047B (en) | Networking method, electronic device and computer-readable storage medium | |
| CN105897604B (en) | A method of it improving data center network and is updated to power |
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 |