CN114866452A - SRv6 distributed message forwarding method and system based on AIOps - Google Patents
SRv6 distributed message forwarding method and system based on AIOps Download PDFInfo
- Publication number
- CN114866452A CN114866452A CN202210538790.3A CN202210538790A CN114866452A CN 114866452 A CN114866452 A CN 114866452A CN 202210538790 A CN202210538790 A CN 202210538790A CN 114866452 A CN114866452 A CN 114866452A
- Authority
- CN
- China
- Prior art keywords
- srv6
- node
- network
- sid
- edge node
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 19
- 230000006855 networking Effects 0.000 claims description 8
- 230000005540 biological transmission Effects 0.000 abstract description 3
- 239000003016 pheromone Substances 0.000 description 11
- 241000257303 Hymenoptera Species 0.000 description 6
- 238000013508 migration Methods 0.000 description 3
- 230000005012 migration Effects 0.000 description 3
- 238000011084 recovery Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Images
Classifications
-
- 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/34—Source routing
-
- 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/74—Address processing for routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides an SRv6 distributed message forwarding method and a system based on AIOps, wherein the method comprises the steps of accessing a network topology database by adopting an ant colony algorithm, and obtaining SRv6 nodes of the shortest network line and path from each edge node to a central node and the shortest network line and path from each edge node to a core service node in a network; performing initial G-SRv6 network coverage within SRv6 network according to compressed SID characteristics of the G-SID; the initial G-SRv6 network overlay associates a SID between SRv6 and G-SRv 6; presetting SID between SRv6 and G-SRv6 in an alignment parameter in a SID List in a SRv6 message header SRH; and forwarding the destination address field of the outer IPv6 message header according to the preset SID to finish the forwarding of the big data in the SRv6 network. According to the invention, the SRv6 message inner layer information is preferentially sent, so that the accuracy and flexible configuration of data transmission are improved. And the problem that the number of SIDs carried in an SRH header is greatly limited because the message can only be forwarded by the SIDs with overlarge data volume is avoided.
Description
Technical Field
The invention belongs to the technical field of data communication, and particularly relates to an SRv6 distributed message forwarding method and system based on AIOps.
Background
SRv6 is a network forwarding technique, in which SRv6 makes a new extension directly in the IP extension header of IPv6, and this extension is called srh (segment Routing header).
The 128bit Segment ID (Segment ID) of the standard SRv6 adopts SID in IPv6 address format, and has routable property compared with SID in MPLS Label format, thereby simplifying inter-domain path creation and realizing the capability of simplifying the establishment of end-to-end path in IPv6 network. Meanwhile, the SRv6 SID supports the programmable capability, can meet the flexible network and service function processing, and can flexibly meet the requirements of various services and network functions by combining the cooperative support of a centralized control plane and a distributed control plane, thereby being suitable for the requirements of network and service development.
However, in SRv6 application scenarios such as daily mass data backup, migration, network cutover, etc., a large amount of data messages may be generated. SRv6 when message forwarding is performed on SID in the network, it usually faces the problem that there is a large limit to the number of SID carried in SRH header due to the large amount of SID data.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides a G-SRv6 distributed message forwarding method and system based on AIOps.
In a first aspect, the present invention provides a G-SRv6 distributed packet forwarding method based on AIOps, including:
accessing a network topology database by adopting an ant colony algorithm, and acquiring SRv6 a node of the shortest network line and path from each edge node to a central node and a node of the shortest network line and path from each edge node to a core service node in the network;
performing initial G-SRv6 network coverage within SRv6 network according to compressed SID characteristics of the G-SID;
the initial G-SRv6 network overlay associates a SID between SRv6 and G-SRv 6;
presetting SID between SRv6 and G-SRv6 in an alignment parameter in a SID List in a SRv6 message header SRH;
and forwarding the destination address field of the outer IPv6 message header according to the preset SID to finish the forwarding of the big data in the SRv6 network.
Further, the accessing a network topology database by using an ant colony algorithm to obtain SRv6 a node of the shortest network line and path from each edge node to a central node and a node of the shortest network line and path from each edge node to a core service node in the network includes:
a central node server is arranged to collect servers of the backup data of each edge node of the region and store the servers in a central database;
the central node server issues the ant colony algorithm to each edge node backup data server;
each regional edge node is provided with a server for collecting core service data information and storing the core service data information in a database of the edge node;
accessing a network topology database on a central server, and acquiring the incidence relation between a core service node and each local edge node and related IPv6 information;
acquiring the incidence relation between each edge node and each central node and related IPv6 information;
and obtaining the shortest route, the route node list and the IPv6 information reaching the destination node by adopting an ant colony algorithm.
Further, the compressing SID characteristic according to the G-SID performs initial G-SRv6 network coverage in SRv6 network, including:
acquiring SRv6 SID message header SRH of initial node on each line reaching destination node in network by program execution;
reading a compressed SID corresponding to the SID attribute identification from the G-SRV6 container through the SID attribute identification carried in the SRH and used for determining the destination address of the next hop;
storing the compressed SID into SRv6 message header SRH SID List in the alignment parameter;
and performing initial G-SRv6 network coverage on SRv6 networking of lines from each core service node to each edge node and from each edge node to a central node.
In a second aspect, the present invention provides an AIOps-based G-SRv6 distributed packet forwarding system, including:
the acquisition module is used for accessing the network topology database by adopting an ant colony algorithm to acquire SRv6 the node of the shortest network line and path from each edge node to the central node and the node of the shortest network line and path from each edge node to the core service node in the network;
a network overlay module for performing initial G-SRv6 network overlay within SRv6 network according to the compressed SID characteristic of the G-SID;
an association module to associate the SID between SRv6 and G-SRv6 for the initial G-SRv6 network coverage;
the presetting module is used for presetting the SID between SRv6 and G-SRv6 into an alignment parameter in a SID List in a SRv6 message header SRH;
and the forwarding module is used for forwarding the destination address field of the outer IPv6 message header according to the preset SID so as to complete the forwarding of the big data in the SRv6 network.
Further, the obtaining module comprises:
the first setting unit is used for setting a central node server so as to collect servers of backup data of each local edge node and store the servers in a central database;
the issuing unit is used for the central node server to issue the ant colony algorithm to each edge node backup data server;
the second setting unit is used for setting a server for collecting core service data information by each edge node and storing the server in a database of the edge node;
the first acquisition unit is used for accessing a network topology database on the central server and acquiring the incidence relation between the core service node and each local edge node and related IPv6 information;
the second acquisition unit is used for acquiring the association relation between each edge node and the central node and related IPv6 information;
and the third acquisition unit is used for acquiring the shortest route, the route node list and the IPv6 information reaching the destination node by adopting an ant colony algorithm.
Further, the network overlay module comprises:
a fourth obtaining unit, configured to obtain SRv6, through program execution, a SID packet header SRH of an initial node on each line to a destination node in the network;
a reading unit, configured to read a compressed SID corresponding to a SID attribute identifier from a G-SRV6 container, through the SID attribute identifier carried in the SRH and used for determining a destination address of a next hop;
a storage unit, configured to store the compressed SID into an alignment parameter in a SID List in the SRv6 header SRH;
and the network coverage unit is used for carrying out initial G-SRv6 network coverage on SRv6 networking of lines from each core service node to each edge node and from each edge node to the central node.
The invention has the beneficial effects that: firstly, an ant colony algorithm is adopted to obtain the fastest network lines from each edge node to a core service node and from each edge node to a central node. And secondly, performing initial G-SRv6 network coverage on network nodes of route paths which are destined to the edge nodes and the central node in SRv6 network groups by utilizing the compressed SID characteristic of the G-SID. And finally, when events such as data backup, migration, network cutover, network node switching of remote disaster recovery and the like occur, readjusting the network nodes of the route by using an ant colony algorithm, and simultaneously carrying out initial G-SRv6 network coverage on the associated nodes newly entering SRv6 networking. According to the method, the SRv6 message inner layer information is sent preferentially, so that the accuracy and flexible configuration of data transmission are improved. And the problem that the number of SIDs carried in an SRH header is greatly limited because the message can only be forwarded by the SIDs with overlarge data volume is avoided.
Drawings
In order to more clearly illustrate the technical solution of the present invention, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious to those skilled in the art that other drawings can be obtained based on these drawings without creative efforts.
Fig. 1 is a flowchart of an SRv6 distributed packet forwarding method based on AIOps according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of an SRv6 distributed packet forwarding system based on AIOps according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be described clearly and completely with reference to the accompanying 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.
As shown in fig. 1, an embodiment of the present invention provides an SRv6 distributed packet forwarding method based on AIOps, including:
In this step, a central node server is set to collect servers of backup data of each edge node of the region and store the servers in a central database.
And the central node server issues the ant colony algorithm to each edge node backup data server.
Each edge node is provided with a server for collecting core service data information and storing the core service data information in a database of the edge node.
And accessing a network topology database on the central server to acquire the incidence relation between the core service node and each local edge node and related IPv6 information.
And acquiring the association relation between each edge node and the central node and related IPv6 information.
And obtaining the shortest route, path node list and IPv6 information reaching the destination node by adopting an ant colony algorithm.
The expression of the ant algorithm is as follows:
wherein the content of the first and second substances,
the probability that ant k transfers from city i to city j at time t; alpha is an pheromone heuristic factor and reflects the function of the pheromone on ant path selection; beta is an expected heuristic factor and reflects the degree of importance of the pheromone when ants select paths; tau is ij (t) pheromone concentration on a connecting path between the city i and the city j at the time t; n is ij (t) expected degree of transfer of ants from city i to city j, n ij (t)＝1/d ij ，d ij Distance between city i and city j; j. the design is a square k (i) Is a city currently selectable by ant k.
When the ants release the pheromone, the pheromone on the connecting paths among the cities gradually disappears, and a parameter rho (0 < rho < 1) is set to represent the volatilization degree of the pheromone. When all ants complete an iteration (i.e., each ant has crawled all city nodes), the pheromone on the path must change, so the pheromone needs to be updated in time:
wherein, the first and the second end of the pipe are connected with each other,
the pheromone concentration released by the kth ant on the connection path of the city i and the city j is obtained; delta tau ij The sum of the concentration of pheromones released by ants on the connection paths of the city i and the city j; m is the number of ants.
At step 102, initial G-SRv6 network coverage is performed within SRv6 networks based on the compressed SID characteristics of the G-SID.
In this step, the SID packet header SRH of the initial node on each line reaching the destination node in the network is obtained SRv6 through program execution.
And reading the compressed SID corresponding to the SID attribute identification from the G-SRV6 container through the SID attribute identification carried in the SRH for determining the destination address of the next hop.
The compressed SID is stored SRv6 in the alignment parameter in the SID List in the header SRH.
And performing initial G-SRv6 network coverage on SRv6 networking of lines from each core service node to each edge node and from each edge node to a central node.
And 105, forwarding the destination address field of the outer IPv6 message header according to the preset SID to finish the forwarding of the big data in the SRv6 network.
In this step, when the ant colony algorithm is used to obtain the synchronous data of the association relationship of the network topology database in real time and adjust the possible changes of the network nodes of the route paths of each place in time, if the changes are found, the G-SRv6 network is initially covered by the step 102. And simultaneously uploading the latest ant colony algorithm updating result to the central server.
The invention firstly adopts the ant colony algorithm to obtain the fastest network lines from each edge node to the core service node and from each edge node to the central node. And secondly, performing initial G-SRv6 network coverage on network nodes of route paths which are destined to the edge nodes and the central node in SRv6 network groups by utilizing the compressed SID characteristic of the G-SID. And finally, when events such as data backup, migration, network cutover, network node switching of remote disaster recovery and the like occur, readjusting the network nodes of the route by using an ant colony algorithm, and simultaneously carrying out initial G-SRv6 network coverage on the associated nodes newly entering SRv6 networking. According to the method, the SRv6 message inner layer information is sent preferentially, so that the accuracy and flexible configuration of data transmission are improved. And the problem that the number of SIDs carried in an SRH header is greatly limited because the message can only be forwarded by the SIDs with overlarge data volume is avoided.
As shown in fig. 2, an embodiment of the present invention further provides an SRv6 distributed packet forwarding system based on AIOps, including:
the obtaining module 10 is configured to access a network topology database by using an ant colony algorithm, and obtain SRv6 a node of a shortest network line and route from each edge node to a central node and a node of a shortest network line and route from each edge node to a core service node in a network.
A network overlay module 20 for initial G-SRv6 network overlay within SRv6 network according to the compressed SID characteristic of the G-SID.
An association module 30 for initial G-SRv6 network coverage associates SIDs between SRv6 and G-SRv 6.
And the presetting module 40 is used for presetting the SID between SRv6 and G-SRv6 into an alignment parameter in a SID List in a SRv6 header SRH.
And the forwarding module 50 is configured to forward the destination address field of the outer IPv6 packet header according to the preset SID, so as to complete forwarding of the big data in the SRv6 network.
Optionally, the obtaining module includes:
the first setting unit is used for setting a central node server so as to collect servers of backup data of each local edge node and store the servers in a central database;
the issuing unit is used for the central node server to issue the ant colony algorithm to each edge node backup data server;
the second setting unit is used for setting a server for collecting core service data information by each edge node and storing the server in a database of the edge node;
the first acquisition unit is used for accessing a network topology database on the central server and acquiring the incidence relation between the core service node and each local edge node and related IPv6 information;
the second acquisition unit is used for acquiring the association relation between each edge node and the central node and related IPv6 information;
and the third acquisition unit is used for acquiring the shortest route, the route node list and the IPv6 information reaching the destination node by adopting an ant colony algorithm.
Optionally, the network coverage module includes:
a fourth obtaining unit, configured to obtain SRv6, through program execution, a SID packet header SRH of an initial node on each line to a destination node in the network;
a reading unit, configured to read a compressed SID corresponding to a SID attribute identifier from a G-SRV6 container by using the SID attribute identifier carried in the SRH and used for determining a destination address of a next hop;
a storage unit, configured to store the compressed SID into an alignment parameter in a SID List in the SRv6 header SRH;
and the network coverage unit is used for carrying out initial G-SRv6 network coverage on SRv6 networking of lines from each core service node to each edge node and from each edge node to the central node.
Those skilled in the art will readily appreciate that the techniques of the embodiments of the present invention may be implemented as software plus a required general purpose hardware platform. Based on such understanding, the technical solutions in the embodiments of the present invention may be essentially or partially implemented in the form of a software product, which may be stored in a storage medium, such as ROM/RAM, magnetic disk, optical disk, etc., and includes several instructions for enabling a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method according to the embodiments or some parts of the embodiments.
The same and similar parts in the various embodiments in this specification may be referred to each other. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and the relevant points can be referred to the description in the method embodiment.
The invention has been described in detail with reference to specific embodiments and illustrative examples, but the description is not intended to be construed in a limiting sense. Those skilled in the art will appreciate that various equivalent substitutions, modifications or improvements may be made to the technical solution of the present invention and its embodiments without departing from the spirit and scope of the present invention, which fall within the scope of the present invention. The scope of the invention is defined by the appended claims.
Claims (6)
1. An SRv6 distributed message forwarding method based on AIOps is characterized by comprising the following steps:
accessing a network topology database by adopting an ant colony algorithm, and acquiring SRv6 a node of the shortest network line and path from each edge node to a central node and a node of the shortest network line and path from each edge node to a core service node in the network;
performing initial G-SRv6 network coverage within SRv6 network according to compressed SID characteristics of the G-SID;
the initial G-SRv6 network overlay associates a SID between SRv6 and G-SRv 6;
presetting SID between SRv6 and G-SRv6 in an alignment parameter in a SID List in a SRv6 message header SRH;
and forwarding the destination address field of the outer IPv6 message header according to the preset SID to finish the forwarding of the big data in the SRv6 network.
2. The SRv6 distributed message forwarding method of claim 1, wherein the accessing a network topology database using an ant colony algorithm to obtain SRv6 nodes of shortest network lines and paths from each edge node to a central node and from each edge node to a core service node in the network comprises:
a central node server is arranged to collect servers of the backup data of each edge node of the region and store the servers in a central database;
the central node server issues the ant colony algorithm to each edge node backup data server;
each regional edge node is provided with a server for collecting core service data information and storing the core service data information in a database of the edge node;
accessing a network topology database on a central server, and acquiring the incidence relation between a core service node and each local edge node and related IPv6 information;
acquiring the incidence relation between each edge node and each central node and related IPv6 information;
and obtaining the shortest route, path node list and IPv6 information reaching the destination node by adopting an ant colony algorithm.
3. The SRv6 distributed message forwarding method of claim 2, wherein the performing initial G-SRv6 network overlay within SRv6 network according to the compressed SID characteristics of the G-SID comprises:
acquiring SRv6 SID message header SRH of initial node on each line reaching destination node in network by program execution;
reading a compressed SID corresponding to the SID attribute identification from the G-SRV6 container through the SID attribute identification carried in the SRH and used for determining the destination address of the next hop;
storing the compressed SID into SRv6 the alignment parameter in SID List in header SRH;
and performing initial G-SRv6 network coverage on SRv6 networking of lines from each core service node to each edge node and from each edge node to a central node.
4. An AIOps-based SRv6 distributed message forwarding system, comprising:
the acquisition module is used for accessing the network topology database by adopting an ant colony algorithm to acquire SRv6 the node of the shortest network line and path from each edge node to the central node and the node of the shortest network line and path from each edge node to the core service node in the network;
a network overlay module for performing initial G-SRv6 network overlay within SRv6 network according to the compressed SID characteristic of the G-SID;
an association module to associate SIDs between SRv6 and G-SRv6 for the initial G-SRv6 network coverage;
the presetting module is used for presetting the SID between SRv6 and G-SRv6 into an alignment parameter in a SID List in a SRv6 message header SRH;
and the forwarding module is used for forwarding the destination address field of the outer IPv6 message header according to the preset SID so as to complete the forwarding of the big data in the SRv6 network.
5. The SRv6 distributed message forwarding system of claim 4, wherein the obtaining module comprises:
the first setting unit is used for setting a central node server so as to collect servers of backup data of each local edge node and store the servers in a central database;
the issuing unit is used for the central node server to issue the ant colony algorithm to each edge node backup data server;
the second setting unit is used for setting a server for collecting core service data information by each edge node and storing the server in a database of the edge node;
the first acquisition unit is used for accessing a network topology database on the central server and acquiring the incidence relation between the core service node and each local edge node and related IPv6 information;
the second acquisition unit is used for acquiring the association relation between each edge node and the central node and related IPv6 information;
and the third acquisition unit is used for acquiring the shortest route, the route node list and the IPv6 information reaching the destination node by adopting an ant colony algorithm.
6. The SRv6 distributed message forwarding system of claim 5, wherein the network overlay module comprises:
a fourth obtaining unit, configured to obtain SRv6, through program execution, a SID packet header SRH of an initial node on each line to a destination node in the network;
a reading unit, configured to read a compressed SID corresponding to a SID attribute identifier from a G-SRV6 container by using the SID attribute identifier carried in the SRH and used for determining a destination address of a next hop;
a storage unit, configured to store the compressed SID into an alignment parameter in a SID List in the SRv6 header SRH;
and the network coverage unit is used for carrying out initial G-SRv6 network coverage on SRv6 networking of lines from each core service node to each edge node and from each edge node to the central node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210538790.3A CN114866452A (en) | 2022-05-18 | 2022-05-18 | SRv6 distributed message forwarding method and system based on AIOps |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210538790.3A CN114866452A (en) | 2022-05-18 | 2022-05-18 | SRv6 distributed message forwarding method and system based on AIOps |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114866452A true CN114866452A (en) | 2022-08-05 |
Family
ID=82639267
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210538790.3A Pending CN114866452A (en) | 2022-05-18 | 2022-05-18 | SRv6 distributed message forwarding method and system based on AIOps |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114866452A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113391893A (en) * | 2021-06-02 | 2021-09-14 | 华中科技大学 | Task scheduling method, device and equipment based on improved ant colony and storage medium |
| CN113438160A (en) * | 2020-03-23 | 2021-09-24 | 中兴通讯股份有限公司 | Routing method, routing device and computer readable storage medium |
| WO2021189973A1 (en) * | 2020-03-25 | 2021-09-30 | 中兴通讯股份有限公司 | Information sending method, information processing method, node, controller, and computer-readable medium |
| CN113645135A (en) * | 2021-08-02 | 2021-11-12 | 迈普通信技术股份有限公司 | SID compression method, message forwarding method, message compression device and electronic equipment |
| US20220060414A1 (en) * | 2019-05-09 | 2022-02-24 | Huawei Technologies Co., Ltd. | Method for generating segment list, method for forwarding packet, device, and system in srv6 network |
-
2022
- 2022-05-18 CN CN202210538790.3A patent/CN114866452A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20220060414A1 (en) * | 2019-05-09 | 2022-02-24 | Huawei Technologies Co., Ltd. | Method for generating segment list, method for forwarding packet, device, and system in srv6 network |
| CN113438160A (en) * | 2020-03-23 | 2021-09-24 | 中兴通讯股份有限公司 | Routing method, routing device and computer readable storage medium |
| WO2021189973A1 (en) * | 2020-03-25 | 2021-09-30 | 中兴通讯股份有限公司 | Information sending method, information processing method, node, controller, and computer-readable medium |
| CN113391893A (en) * | 2021-06-02 | 2021-09-14 | 华中科技大学 | Task scheduling method, device and equipment based on improved ant colony and storage medium |
| CN113645135A (en) * | 2021-08-02 | 2021-11-12 | 迈普通信技术股份有限公司 | SID compression method, message forwarding method, message compression device and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102387061B (en) | Method, device and system for accessing VPC (virtual private cloud) to VPN (virtual private network) | |
| CN101330405B (en) | Method for discovering network topology and related equipment | |
| CN103179228B (en) | Internet Protocol address analytic method and fringe node | |
| WO1996001029A1 (en) | Loose source routing over disparate networks | |
| CN107707474B (en) | Route distribution method and system | |
| CN103023773B (en) | Method, device and system for forwarding message in multi-topology network | |
| US20020105915A1 (en) | Method of and apparatus for calculating traffic from data on packet transmission collected from routers | |
| EP1909437A1 (en) | A method for forwarding service of the data communication device and the forwarding apparatus | |
| CN113452561A (en) | Topology generation method, device and equipment and readable storage medium | |
| CN113973026B (en) | Site interconnection method, central controller and route reflector | |
| CN113810287B (en) | Data retrieval and pushing method based on NDN and SDN | |
| US20140317271A1 (en) | Method and node apparatus for collecting information in content network based on information-centric networking | |
| CN110072196B (en) | Communication method and system for providing block chain oriented application for named data network | |
| CN109194914B (en) | Method and device for processing equipment information | |
| CN113285894B (en) | Identity identification network mobility control method and system based on programmable switch | |
| JP3463607B2 (en) | Method and apparatus for selecting start address in communication network system and recording medium on which the method is recorded | |
| CN101997755A (en) | Method for exchanging mapping information and mapping node | |
| CN114866452A (en) | SRv6 distributed message forwarding method and system based on AIOps | |
| JP4391960B2 (en) | Resource management apparatus, system and method | |
| CN114866453B (en) | Message forwarding method and system based on G-SRv protocol | |
| CN115865844A (en) | Virtual-real combined dynamic flow scheduling method and device based on SDN and NDN | |
| CN117176639B (en) | Multi-protocol-based network topology automatic discovery method and device | |
| CN115622900B (en) | Data processing method, device, equipment and storage medium | |
| WO2012029247A1 (en) | Data forwarding system | |
| CN111107002B (en) | Method and device for acquiring routing information |
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 |