CN113364619A - Method and system for establishing packet transport network - Google Patents
Method and system for establishing packet transport network Download PDFInfo
- Publication number
- CN113364619A CN113364619A CN202110619146.4A CN202110619146A CN113364619A CN 113364619 A CN113364619 A CN 113364619A CN 202110619146 A CN202110619146 A CN 202110619146A CN 113364619 A CN113364619 A CN 113364619A
- Authority
- CN
- China
- Prior art keywords
- path
- fitness value
- shortest
- packet transport
- network
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/142—Network analysis or design using statistical or mathematical methods
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Algebra (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Pure & Applied Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method and a system for establishing a packet transport network. The method comprises the following steps: establishing a primary network structure according to equipment information of an equipment supplier; the device information includes: network elements, board cards, links and communication pipelines; optimizing the primary network structure by using K shortest path algorithms to obtain a secondary network model; and optimizing the secondary network structure according to the multi-objective gray wolf algorithm to obtain the packet transport network. The method and the system provided by the invention consider establishing the packet transport network from two aspects of operators and equipment suppliers, thereby reducing the cost and improving the service quality of the network.
Description
Technical Field
The invention relates to the technical field of packet transport network optimization, in particular to a method and a system for establishing a packet transport network.
Background
At present, the information communication industry in China is rapidly developing, a Packet Transport Network (PTN) technology is developed and matured, the PTN is used as a basic support Network of an operator and always meets the requirement of a carried service, and a series of faults can occur in initial PTN Network deployment along with the time, so that the PTN needs to be optimized in a later period. Optimization for PTN networks typically involves both roles as equipment provider and operator user. The equipment supplier provides PTN equipment for the operator user, and provides services such as network optimization. However, existing PTN network optimization is optimized for a single layer of equipment provider, only improves service quality, and does not consider double-layer optimization, thereby improving cost while improving service quality.
Disclosure of Invention
The invention aims to provide a method and a system for establishing a packet transport network, which improve the establishment of the packet transport network from the two aspects of operators and equipment suppliers, reduce the cost and improve the service quality of the network.
In order to achieve the purpose, the invention provides the following scheme:
a method of packet transport network establishment, the method comprising:
establishing a primary network structure according to equipment information of an equipment supplier; the device information includes: network elements, board cards, links and communication pipelines;
optimizing the primary network structure by using K shortest path algorithms to obtain a secondary network model;
and optimizing the secondary network structure according to the multi-objective gray wolf algorithm to obtain a packet transport network.
Optionally, the optimizing the primary network structure by using the K shortest path algorithm to obtain a secondary network model specifically includes:
searching a first shortest path of each communication pipeline in the primary network structure by using K shortest path algorithms;
judging whether the path of the communication pipeline comprises a standby path or not;
if yes, replacing the standby path with the first shortest path;
if not, taking the first shortest path as a standby path of the communication pipeline;
and when the standby paths of all the communication pipelines are the first shortest circuit, obtaining the secondary network structure.
Optionally, the finding a first shortest path of each communication pipe in the preliminary network structure by using the K shortest path algorithm specifically includes:
finding a target path set according to K shortest path algorithms; the target path set comprises the first k paths found in the first path set according to the sequence of the network element number from small to large; the first path set is paths except for a main path and a standby path in all paths of the communication pipeline;
calculating the bandwidth occupation value of each path in the target path set;
and obtaining a path with the minimum bandwidth occupation value according to the bandwidth occupation value, and taking the path with the minimum bandwidth occupation value as a first shortest path.
Optionally, the optimizing the secondary network structure according to the multi-objective grayling algorithm to obtain a packet transport network specifically includes:
taking each communication pipeline in the secondary network structure as an individual of the initial gray wolf population, and taking each link in the communication pipeline as a gene segment of the individual of the initial gray wolf population;
determining a first fitness value for the individual and a second fitness value for the gene segment; the first fitness value is a label switching master/slave routing rate fitness value, and the second fitness value is a link bandwidth occupancy rate fitness value;
finding a second shortest path in the second path set by using a K shortest path algorithm; the second path set is paths except for the main path and the standby path in all paths of the first target individual; the first target individual is an individual with the first fitness value of 0;
finding a third shortest path in the third path set by using a K shortest path algorithm; the third path set is paths except the path subset in all paths of the second target individual; the second target individual is the individual in which the gene segment with the second fitness value of 0 is located; the path subset comprises a main path of the second target individual, a standby path of the second target individual and a path where the gene segment with the second fitness value of 0 is located;
replacing the backup path of the first target individual with the second shortest path;
and replacing the standby path of the second target individual with the third shortest path so as to obtain an optimal wolf pack, wherein the optimal wolf pack is the packet transport network.
Optionally, determining the first fitness value of the individual specifically includes:
acquiring the path information of the individual main path and the path information of the individual standby path; the path information includes: the network element, the board card and the link;
and determining the first fitness value according to the path information of the main path and the path information of the standby path.
Optionally, the determining the first fitness value according to the path information of the active path and the path information of the standby path specifically includes:
judging whether the same information exists in the path information of the main path and the path information of the standby path;
if yes, determining that the first fitness value is 0;
if not, determining that the first fitness value is 1.
Optionally, determining a second fitness value of the gene segment specifically includes:
calculating the committed information rate of the gene segment and the optical fiber rate of the optical fiber where the gene segment is located;
determining the total bandwidth value of the gene segments according to the optical fiber speed;
calculating the bandwidth ratio; the bandwidth ratio is the ratio of the committed information rate to the total bandwidth value;
and determining the second fitness value according to the bandwidth ratio.
Optionally, the determining the second fitness value according to the bandwidth ratio specifically includes:
judging whether the bandwidth ratio is greater than 0.8;
if yes, determining that the second fitness value is 0;
and if not, determining that the second fitness value is 1.
A packet transport network establishment system comprising:
a first establishing module for establishing a primary network structure according to device information of a device provider; the device information includes: network elements, board cards, links and communication pipelines;
the secondary network acquisition module is used for optimizing the primary network structure by utilizing a K shortest path algorithm to obtain a secondary network model;
and the packet transport network establishing module is used for optimizing the secondary network structure according to the multi-objective wolf algorithm to obtain the packet transport network.
Optionally, the secondary network acquiring module specifically includes:
a first shortest path searching unit, configured to search a first shortest path of each communication pipe in the primary network structure by using a K shortest path algorithm;
a judging unit, configured to judge whether a path of the communication pipe includes a backup path;
a first replacement unit, configured to replace, if a path of the communication pipe includes a backup path, the backup path with the first shortest path;
a second replacement unit, configured to, if a path of the communication pipe does not include a backup path, use the first shortest path as a backup path of the communication pipe;
and the secondary network acquisition unit is used for acquiring the secondary network structure when the standby paths of the communication pipelines are all the first shortest paths.
According to the specific embodiment provided by the invention, the invention discloses the following technical effects:
the invention discloses a method and a system for establishing a packet transport network, wherein a primary network structure is established according to equipment information of an equipment supplier; the device information includes: network elements, board cards, links and communication pipelines; optimizing the primary network structure by using K shortest path algorithms to obtain a secondary network model, and shortening the path of the network by using the K shortest path algorithms, thereby reducing the cost of operators; and optimizing the secondary network structure according to the multi-target gray wolf algorithm to obtain a packet transport network, and improving the adaptability value according to the multi-target gray wolf algorithm, thereby improving the service quality of equipment operators. The method and the system provided by the invention consider establishing the packet transport network from two aspects of operators and equipment suppliers, thereby reducing the cost and improving the service quality of the network.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings without inventive exercise.
Fig. 1 is a flowchart of a packet transport network establishment method according to an embodiment of the present invention;
fig. 2 is a structural diagram of a packet transport network establishment system according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The invention aims to provide a method and a system for establishing a packet transport network, aims to reduce cost and improve the service quality of the network, and can be applied to the technical field of packet transport network optimization.
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in further detail below.
Fig. 1 is a flowchart of a method for establishing a packet transport network according to an embodiment of the present invention. As shown in fig. 1, the method for establishing a packet transport network in this embodiment includes:
step 101: the primary network structure is established based on the device information of the device vendor. The device information includes: network elements, boards, links and communication pipes.
Step 102: and optimizing the primary network structure by using the K shortest path algorithm to obtain a secondary network model.
Step 103: and optimizing the secondary network structure according to the multi-objective gray wolf algorithm to obtain the packet transport network.
In practical application, the packet transport network serves as a basic support network for mobile and telecommunication operators, and service requirements of borne communication and the like are met.
As an optional implementation manner, the method for optimizing the primary network structure by using the K shortest path algorithm to obtain the secondary network model specifically includes:
and searching a first shortest path of each communication pipeline in the primary network structure by using a K shortest path algorithm.
And judging whether the path of the communication pipeline comprises a standby path or not.
And if so, replacing the standby path with the first shortest path.
And if not, taking the first shortest path as a standby path of the communication pipeline.
And when the standby paths of all the communication pipelines are the first shortest circuit, obtaining a secondary network structure.
As an optional implementation manner, finding the first shortest path of each communication pipe in the preliminary network structure by using the K shortest path algorithm specifically includes:
finding a target path set according to a K shortest path algorithm; the target path set comprises the first k paths found in the first path set according to the sequence of the network element number from small to large; the first set of paths is paths of all paths of the communication pipe except the active path and the standby path.
And calculating the bandwidth occupation value of each path in each target path set.
And obtaining a path with the minimum bandwidth occupation value according to the bandwidth occupation value, and taking the path with the minimum bandwidth occupation value as a first shortest path.
As an optional implementation manner, optimizing the secondary network structure according to the multi-objective graying algorithm to obtain the packet transport network specifically includes:
each communication pipeline in the secondary network structure is used as an individual of the initial gray wolf population, and each link in the communication pipeline is used as a gene segment of the individual of the initial gray wolf population.
Determining a first fitness value of the individual and a second fitness value of the gene segment; the first fitness value is a label switching master-slave routing rate fitness value, and the second fitness value is a link bandwidth occupancy rate fitness value;
finding a second shortest path in the second path set by using a K shortest path algorithm; the second path set is paths except the main path and the standby path in all paths of the first target individual; the first target individual is an individual having a first fitness value of 0.
Finding a third shortest path in the third path set by using a K shortest path algorithm; the third path set is paths except the path subset in all paths of the second target individual; the second target individual is the individual in which the gene segment with the second fitness value of 0 is located; the path subset comprises a main path of the second target individual, a standby path of the second target individual and a path where the gene segment with the second fitness value of 0 is located.
And replacing the standby path of the first target individual with the second shortest path.
And replacing the standby path of the second target individual with a third shortest path so as to obtain an optimal wolf pack, wherein the optimal wolf pack is a packet transport network.
As an optional implementation, determining the first fitness value of the individual specifically includes:
acquiring path information of an individual main path and path information of an individual standby path; the path information includes: network elements, boards and links.
And determining a first fitness value according to the path information of the main path and the path information of the standby path.
As an optional implementation manner, determining the first fitness value according to the path information of the primary path and the path information of the backup path specifically includes:
and judging whether the same information exists in the path information of the main path and the path information of the standby path.
If yes, the first fitness value is determined to be 0.
If not, determining that the first fitness value is 1.
Specifically, the presence of the same information includes: at least one of the network elements are the same, the board cards are the same or the links are the same; the network element of the main path is the same as the network element of the standby path, the board cards are the same as the board cards of the main path and the board cards of the standby path, and the links are the same as the links in the main path and the links in the standby path.
As an alternative embodiment, the determination of the second fitness value of the gene segment comprises:
and calculating the committed information rate of the gene segment and the optical fiber rate of the optical fiber where the gene segment is positioned.
And determining the total bandwidth value of the gene segments according to the fiber speed.
Calculating the bandwidth ratio; the bandwidth ratio is the ratio of the committed information rate to the total bandwidth value.
And determining a second fitness value according to the bandwidth ratio.
As an optional implementation manner, determining the second fitness value according to the bandwidth ratio specifically includes:
and judging whether the bandwidth ratio is more than 0.8.
If yes, the second fitness value is determined to be 0.
If not, determining that the second fitness value is 1.
In practical application, after the optimization of the secondary network structure is finished and a packet transport network is obtained, the packet transport network can be used as a new secondary network structure to be optimized again according to actual requirements, iteration is performed in sequence, and the iteration is stopped after the set maximum multi-target iteration number is reached. Before each new optimization time, setting a value of a convergence factor, and optimizing a linear convergence factor in the gray wolf algorithm into nonlinear convergence, specifically:
wherein, α is the convergence factor of the current iteration number, rand () is a random number generation function with a range of [0,1], t is the current iteration number, maxiter is the set maximum multi-target iteration number, the formula changes the conventional linear decrease of the convergence factor into the size of the random number and combines with a trigonometric function, and finally presents a nonlinear convex descending trend of descending first and then descending rapidly.
And after the optimization of the secondary network structure is finished, the packet transport network can be optimized again as a new primary network structure according to actual requirements after the packet transport network is obtained, iteration is performed in sequence, and the iteration is stopped after the set maximum double-layer iteration number is reached.
Fig. 2 is a structural diagram of a packet transport network establishment system according to an embodiment of the present invention. As shown in fig. 2, the packet transport network establishing system in this embodiment includes:
a first establishing module 201, configured to establish a primary network structure according to the device information of the device provider; the device information includes: network elements, boards, links and communication pipes.
And the secondary network obtaining module 202 is configured to optimize the primary network structure by using a K shortest path algorithm to obtain a secondary network model.
And the packet transport network establishing module 203 optimizes the secondary network structure according to the multi-objective wolf algorithm to obtain the packet transport network.
As an optional implementation manner, the secondary network acquiring module 202 specifically includes:
and the first shortest path searching unit is used for searching the first shortest path of each communication pipeline in the primary network structure by using the K shortest path algorithms.
The judging unit is used for judging whether the communication pipeline path contains a standby path or not;
the first replacing unit is used for replacing the standby path with the first shortest path if the path of the communication pipeline comprises the standby path.
And the second replacing unit is used for taking the first shortest path as the standby path of the communication pipeline if the path of the communication pipeline does not contain the standby path.
And the secondary network acquisition unit is used for acquiring a secondary network structure when the standby paths of the communication pipelines are all the first shortest paths.
The invention has the following effects:
(1) the method and the system provided by the invention construct the packet transport network from the double-layer view of the operator and the equipment supplier, improve the service quality and reduce the cost.
(2) The method and the system provided by the invention comprehensively consider the adaptability value of the label switching main/standby route rate and the adaptability value of the link bandwidth occupancy rate when establishing the packet transport network, and greatly improve the optimization time and the accuracy rate of the optimization result.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. For the system disclosed by the embodiment, the description is relatively simple because the system corresponds to the method disclosed by the embodiment, and the relevant points can be referred to the method part for description.
The principles and embodiments of the present invention have been described herein using specific examples, which are presented solely to aid in the understanding of the apparatus and its core concepts; meanwhile, for a person skilled in the art, according to the idea of the present invention, the specific embodiments and the application range may be changed. In view of the above, the present disclosure should not be construed as limiting the invention.
Claims (10)
1. A method for establishing a packet transport network, the method comprising:
establishing a primary network structure according to equipment information of an equipment supplier; the device information includes: network elements, board cards, links and communication pipelines;
optimizing the primary network structure by using K shortest path algorithms to obtain a secondary network model;
and optimizing the secondary network structure according to the multi-objective gray wolf algorithm to obtain a packet transport network.
2. The method according to claim 1, wherein the optimizing the primary network structure by using the K shortest path algorithm to obtain a secondary network model specifically comprises:
searching a first shortest path of each communication pipeline in the primary network structure by using K shortest path algorithms;
judging whether the path of the communication pipeline comprises a standby path or not;
if yes, replacing the standby path with the first shortest path;
if not, taking the first shortest path as a standby path of the communication pipeline;
and when the standby paths of all the communication pipelines are the first shortest circuit, obtaining the secondary network structure.
3. The method for establishing a packet transport network according to claim 2, wherein the finding the first shortest path of each communication pipe in the initial network structure by using a K shortest path algorithm specifically comprises:
finding a target path set according to K shortest path algorithms; the target path set comprises the first k paths found in the first path set according to the sequence of the network element number from small to large; the first path set is paths except for a main path and a standby path in all paths of the communication pipeline;
calculating the bandwidth occupation value of each path in the target path set;
and obtaining a path with the minimum bandwidth occupation value according to the bandwidth occupation value, and taking the path with the minimum bandwidth occupation value as a first shortest path.
4. The method for establishing a packet transport network according to claim 1, wherein the optimizing the secondary network structure according to the multi-objective grayish wolf algorithm to obtain the packet transport network specifically comprises:
taking each communication pipeline in the secondary network structure as an individual of the initial gray wolf population, and taking each link in the communication pipeline as a gene segment of the individual of the initial gray wolf population;
determining a first fitness value for the individual and a second fitness value for the gene segment; the first fitness value is a label switching master/slave routing rate fitness value, and the second fitness value is a link bandwidth occupancy rate fitness value;
finding a second shortest path in the second path set by using a K shortest path algorithm; the second path set is paths except for the main path and the standby path in all paths of the first target individual; the first target individual is an individual with the first fitness value of 0;
finding a third shortest path in the third path set by using a K shortest path algorithm; the third path set is paths except the path subset in all paths of the second target individual; the second target individual is the individual in which the gene segment with the second fitness value of 0 is located; the path subset comprises a main path of the second target individual, a standby path of the second target individual and a path where the gene segment with the second fitness value of 0 is located;
replacing the backup path of the first target individual with the second shortest path;
and replacing the standby path of the second target individual with the third shortest path so as to obtain an optimal wolf pack, wherein the optimal wolf pack is the packet transport network.
5. The method according to claim 4, wherein determining the first fitness value of the individual comprises:
acquiring the path information of the individual main path and the path information of the individual standby path; the path information includes: the network element, the board card and the link;
and determining the first fitness value according to the path information of the main path and the path information of the standby path.
6. The method for establishing a packet transport network according to claim 5, wherein the determining the first fitness value according to the path information of the active path and the path information of the standby path specifically includes:
judging whether the same information exists in the path information of the main path and the path information of the standby path;
if yes, determining that the first fitness value is 0;
if not, determining that the first fitness value is 1.
7. The method of claim 6, wherein determining the second fitness value of the gene segment specifically comprises:
calculating the committed information rate of the gene segment and the optical fiber rate of the optical fiber where the gene segment is located;
determining the total bandwidth value of the gene segments according to the optical fiber speed;
calculating the bandwidth ratio; the bandwidth ratio is the ratio of the committed information rate to the total bandwidth value;
and determining the second fitness value according to the bandwidth ratio.
8. The method for establishing a packet transport network according to claim 7, wherein the determining the second fitness value according to the bandwidth ratio specifically includes:
judging whether the bandwidth ratio is greater than 0.8;
if yes, determining that the second fitness value is 0;
and if not, determining that the second fitness value is 1.
9. A packet transport network establishment system, comprising:
a first establishing module for establishing a primary network structure according to device information of a device provider; the device information includes: network elements, board cards, links and communication pipelines;
the secondary network acquisition module is used for optimizing the primary network structure by utilizing a K shortest path algorithm to obtain a secondary network model;
and the packet transport network establishing module is used for optimizing the secondary network structure according to the multi-objective wolf algorithm to obtain the packet transport network.
10. The packet transport network establishing system according to claim 9, wherein the secondary network acquiring module specifically includes:
a first shortest path searching unit, configured to search a first shortest path of each communication pipe in the primary network structure by using a K shortest path algorithm;
a judging unit, configured to judge whether a path of the communication pipe includes a backup path;
a first replacement unit, configured to replace, if a path of the communication pipe includes a backup path, the backup path with the first shortest path;
a second replacement unit, configured to, if a path of the communication pipe does not include a backup path, use the first shortest path as a backup path of the communication pipe;
and the secondary network acquisition unit is used for acquiring the secondary network structure when the standby paths of the communication pipelines are all the first shortest paths.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110619146.4A CN113364619B (en) | 2021-06-03 | 2021-06-03 | Method and system for establishing packet transport network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110619146.4A CN113364619B (en) | 2021-06-03 | 2021-06-03 | Method and system for establishing packet transport network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113364619A true CN113364619A (en) | 2021-09-07 |
| CN113364619B CN113364619B (en) | 2022-06-03 |
Family
ID=77531753
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110619146.4A Active CN113364619B (en) | 2021-06-03 | 2021-06-03 | Method and system for establishing packet transport network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113364619B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101777990A (en) * | 2010-01-15 | 2010-07-14 | 西安电子科技大学 | Method for selecting multi-objective immune optimization multicast router path |
| US20120182865A1 (en) * | 2009-02-06 | 2012-07-19 | Vpisystems, Inc. | Systems, Methods, and Apparatuses for Managing the Flow of Traffic in Data Networks |
| WO2014180448A1 (en) * | 2013-12-20 | 2014-11-13 | 中兴通讯股份有限公司 | Method and device for protecting ptn network service |
| CN104994021A (en) * | 2015-07-21 | 2015-10-21 | 三星电子（中国）研发中心 | Method and device for determining optimal path |
| CN106789707A (en) * | 2016-11-28 | 2017-05-31 | 北京邮电大学 | A kind of software definition Packet Transport Network overall situation service dynamic optimization method and device |
| CN108111411A (en) * | 2017-12-06 | 2018-06-01 | 上海神添实业有限公司 | Backbone network and its active path planning system and planing method |
| CN109688056A (en) * | 2018-12-07 | 2019-04-26 | 南京理工大学 | Intelligent Network Control System and method |
| CN109951391A (en) * | 2019-03-25 | 2019-06-28 | 中电莱斯信息***有限公司 | A kind of network path quick calculation method based on multi-QoS constraint |
| CN112671631A (en) * | 2020-12-15 | 2021-04-16 | 湖北工业大学 | Packet transport network optimization method and system |
| CN112822109A (en) * | 2020-12-31 | 2021-05-18 | 上海缔安科技股份有限公司 | SDN core network QoS route optimization algorithm based on reinforcement learning |
-
2021
- 2021-06-03 CN CN202110619146.4A patent/CN113364619B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120182865A1 (en) * | 2009-02-06 | 2012-07-19 | Vpisystems, Inc. | Systems, Methods, and Apparatuses for Managing the Flow of Traffic in Data Networks |
| CN101777990A (en) * | 2010-01-15 | 2010-07-14 | 西安电子科技大学 | Method for selecting multi-objective immune optimization multicast router path |
| WO2014180448A1 (en) * | 2013-12-20 | 2014-11-13 | 中兴通讯股份有限公司 | Method and device for protecting ptn network service |
| CN104994021A (en) * | 2015-07-21 | 2015-10-21 | 三星电子（中国）研发中心 | Method and device for determining optimal path |
| CN106789707A (en) * | 2016-11-28 | 2017-05-31 | 北京邮电大学 | A kind of software definition Packet Transport Network overall situation service dynamic optimization method and device |
| CN108111411A (en) * | 2017-12-06 | 2018-06-01 | 上海神添实业有限公司 | Backbone network and its active path planning system and planing method |
| CN109688056A (en) * | 2018-12-07 | 2019-04-26 | 南京理工大学 | Intelligent Network Control System and method |
| CN109951391A (en) * | 2019-03-25 | 2019-06-28 | 中电莱斯信息***有限公司 | A kind of network path quick calculation method based on multi-QoS constraint |
| CN112671631A (en) * | 2020-12-15 | 2021-04-16 | 湖北工业大学 | Packet transport network optimization method and system |
| CN112822109A (en) * | 2020-12-31 | 2021-05-18 | 上海缔安科技股份有限公司 | SDN core network QoS route optimization algorithm based on reinforcement learning |
Non-Patent Citations (1)
| Title |
|---|
| 史长琼等: "基于改进遗传算法的QoS路由优化", 《计算机工程与设计》, no. 07, 16 April 2009 (2009-04-16) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113364619B (en) | 2022-06-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Li et al. | Optimization of free space optical wireless network for cellular backhauling | |
| US20120163163A1 (en) | Apparatus and method for protection switching of multiple protection group | |
| CN110809317B (en) | Multi-source dynamic grid network RTK positioning method, system, terminal and storage medium | |
| US20230421501A1 (en) | Joint optimization method and system for delay and spectrum occupation in cloud-edge collaborative network | |
| CN111191918A (en) | Service route planning method and device for smart power grid communication network | |
| CN111835564B (en) | Self-adaptive recovery method and system for power Internet of things communication link fault | |
| US11638193B2 (en) | Load balancing method and device, storage medium, and electronic device | |
| CN113193996B (en) | Power optical transmission network optimization method, device, equipment and storage medium | |
| CN107124365B (en) | Routing strategy acquisition system based on machine learning | |
| CN107743092A (en) | Path selecting method and device | |
| CN110166280A (en) | A kind of network expansion method and device | |
| CN109510681B (en) | Reference node selection method with minimum time synchronization series of communication network | |
| CN115604171A (en) | Network line selection method, system, terminal and storage medium | |
| CN113364619B (en) | Method and system for establishing packet transport network | |
| CN113692058A (en) | Spectrum resource evaluation set-based satellite optical network spectrum allocation method and system | |
| Cheng et al. | Machine learning for regenerator placement based on the features of the optical network | |
| CN110677306B (en) | Network topology replica server configuration method and device, storage medium and terminal | |
| Xiao et al. | A proposal of survivable virtual network embedding algorithm | |
| CN107231661B (en) | A kind of method and micro-base station of flow equalization | |
| CN111586178B (en) | Intelligent communication distribution system based on big data | |
| CN112561508A (en) | Payment method between mobile terminals | |
| Booker et al. | Efficient traffic loss evaluation for transport backbone networks | |
| CN112672110A (en) | Unmanned aerial vehicle patrols and examines real-time video transmission system based on network section | |
| CN102377661A (en) | Blade server and method for building shortest blade transmission path in blade server | |
| US20190207677A1 (en) | Replacement scheduling method and system for ultra-low loss optical fibers in backbone network |
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 |