CN108429685B - Service function chain routing method based on segmented routing technology - Google Patents
Service function chain routing method based on segmented routing technology Download PDFInfo
- Publication number
- CN108429685B CN108429685B CN201810398963.XA CN201810398963A CN108429685B CN 108429685 B CN108429685 B CN 108429685B CN 201810398963 A CN201810398963 A CN 201810398963A CN 108429685 B CN108429685 B CN 108429685B
- Authority
- CN
- China
- Prior art keywords
- node
- segment
- path
- service function
- entering
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
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/12—Shortest path evaluation
- H04L45/125—Shortest path evaluation based on throughput or bandwidth
-
- 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/02—Topology update or discovery
-
- 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
- H04L45/126—Shortest path evaluation minimising geographical or physical path length
-
- 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/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
Abstract
The invention discloses a service function chain routing method based on a segmented routing technology, which comprises the following steps: s1, generating a service function chain path searching request; s2, sorting in descending order; s3, setting a source node and a target node; s4, obtaining a node set with virtual network functions; s5, calculating the shortest path according to the principle of the shortest path; s6, judging whether the shortest path is feasible; s7, judging whether an unmarked corresponding node or a target node exists; s8, carrying out path searching again; s9, adding a routing path, and adding a segment label into the segment list; s10, updating network resources; s11, obtaining a service function chain deployment path; s12, compressing the segment list; s13, outputting the service function chain deployment path and the compressed segment list. The invention solves the problems of complex operation, incapability of realizing routing under complex judgment conditions, poor functionality, no optimization function and low practicability in the prior art.
Description
Technical Field
The invention belongs to the field of network architecture, and particularly relates to a service function chain routing method based on a segmented routing technology.
Background
Network Function Virtualization (NFV) is a new Network architecture concept, and a series of Network functions are packaged into an individual action by using a Virtualization technology, and the Virtualization use of a Network entity is explored in a software definition mode, so that the expensive equipment cost of a Network is reduced, the peak demand of the Network is met, resources can be released at any time according to the Network demand, the deployment is convenient, the fault management is facilitated, the upgrading is fast, and the market demand is fast met.
SFC (Service Function Chain) is a corresponding technology proposed by some operators and manufacturers for network Function virtualization trends, which attempts to remove constraints related to physical topology-based Service functions by instantiating one Service Function path. When data packets are transmitted in a network, the data packets need to pass through various service nodes according to a predetermined sequence required by service logic, so that the network can be guaranteed to provide safe, fast and stable network services for users, and the service form, i.e. a service function chain, of a plurality of network service devices is passed through according to a specific logic sequence. How to specifically deploy and implement a service function chain on the basis of network function virtualization becomes a new problem.
A Software Defined Network (SDN), which is a novel Network innovation architecture, is an implementation manner of Network virtualization, and a core technology OpenFlow protocol thereof separates a control plane and a data plane of a Network device, and adopts a centralized control plane and a distributed forwarding plane, thereby realizing flexible control of Network traffic and making a Network more intelligent.
Segment Routing (SR) is a source Routing protocol, also called Segment Routing protocol, in which a source node specifies a path for a packet in a network and encodes the traffic path into an ordered list of segments encapsulated in the packet header by a specific algorithm to explicitly identify the path, and nodes on the forwarding path do not have to maintain state information for all possible flows passing through them, i.e. "state in packet". Because the instruction is encoded in the header of the data packet, the nodes in the network only need to match the forwarding table to perform the operation after receiving the data packet. The intermediate nodes of the path only need to forward according to the path specified in the corresponding packet header. The basic principle of SR is centralized control, which distributes labels at source nodes through a source routing mechanism and pushes explicitly routed labels to a label stack. The architecture is also very suitable for the architecture of the current SDN network, so most of the current Segment Routing centralized control is performed on an SDN controller.
The Node Segment Identifier (Segment Identifier), referred to as Segment Identifier for short, is a unique Node Segment Identifier allocated to each Node in the whole network, and is used as a mark for guiding routing, and is injected into the packet header by pressing a Segment list (Segment list).
In conventional service function chain deployment schemes, the most common ones are implemented on the existing MP L S and IPv6 data planes.
The prior art has the following problems:
(1) the MP L S network needs to rely on external protocols such as L DP, RSVP and the like to realize different functions such as label distribution, traffic engineering and the like, and the operation is complex;
(2) in the prior art, a flow black hole exists, routing can not be realized under complex judgment conditions such as bandwidth and time delay, and the functionality is poor;
(3) in the prior art, most of the methods only focus on implementation, and the path searching problem aiming at the service function chain is not fully considered to optimize the segmented routing technology, so that the practicability is low.
Disclosure of Invention
Aiming at the defects in the prior art, the service function chain path-finding method based on the segmented routing technology, which is provided by the invention, has the advantages of simple operation, good functionality and high practicability, and solves the problems of complex operation, incapability of realizing path selection under complex judgment conditions, poor functionality, no optimization function and low practicability in the prior art.
In order to achieve the purpose of the invention, the invention adopts the technical scheme that:
a service function chain routing method based on a segmented routing technology comprises the following steps:
s1: receiving a service flow and generating a service function link routing request according to the network topology and related network resources;
s2: traversing the service function link path-finding requests generated in the step S1, and performing descending order on the service function link path-finding requests according to the required bandwidth;
s3: setting a source node and a target node according to a current service function chain routing request, and setting the source node as a current node;
s4: classifying and collecting nodes of all virtual network function entities corresponding to the current service function chain routing request to obtain a node collection which can be processed by each virtual network function;
s5: according to the shortest path principle, calculating the path from the current node to the unmarked corresponding node in the node set of the virtual network function of the next hop to obtain the shortest path, setting the corresponding node as the current node, and performing a path finding attempt;
s6: judging whether the shortest path is feasible, if yes, entering step S7, otherwise, entering step S8;
s7: judging whether an unmarked corresponding node or a target node exists in a node set of the virtual network function of the next hop of the current node, if so, entering step S9, otherwise, entering step S8;
s8: marking the current node, setting the corresponding node of the last virtual network function of the current node as the current node, and entering step S5 to perform routing again;
s9: adding the shortest feasible path to a routing path, and adding the segment identifier of the current node in the network into a segment list;
s10: updating network resources, namely link bandwidth and throughput of a server of the network node;
s11: judging whether the current node is a target node, if so, combining all the shortest feasible paths to obtain a service function chain deployment path, otherwise, entering the step S5;
s12: according to the segment list obtained in the step S9 and the service function chain deployment path obtained in the step S11, a segment list depth compression algorithm is operated to compress the segment list to obtain a compressed segment list;
s13: and judging whether all service function chain path searching requests are calculated, if so, outputting all service function chain deployment paths and the compressed segment list, and ending the method, otherwise, entering the step S3.
Further, in step S6, the method for determining whether the shortest path is feasible includes the following steps:
s6-1: judging whether the link bandwidth on the shortest path is greater than or equal to the bandwidth of the service function link routing request, if so, entering a step S6-2, otherwise, entering a step S8;
s6-2: and judging whether the throughput of the virtual network function entity of the current node is enough to accommodate the current service function link routing request, if so, entering the step S7, and otherwise, entering the step S8.
Further, in step S12, the method for compressing the segment list includes the following steps:
s12-1: dividing a sub-problem S from the head of the segment list, and traversing all sub-problems;
s12-2: optimizing the first i segment lists and traversing the previous subproblems S1To Si-1All division cases of (1) to obtain S1To Si-1Segment identification in between;
s12-3: will Si-kTo SiThe segment identifiers in between are traversed, k ∈ [2, i]；
S12-4: judging whether the segment identifier can be deleted, if so, entering S12-5, otherwise, entering step S12-6;
s12-5: marking the positions of the deletable segment identifications, and counting the number of the deletable segment identifications;
s12-6: judging whether the current segment mark has a next segment mark, if so, moving to Si-kTo SiAnd proceeds to step S12-4, otherwise proceeds to step S12-7;
s12-7: calculating the current sub-problem SiNext branch question Si-k+1Obtaining an alternative compression scheme;
s12-8: calculating the sub-problem S by the state transition equation according to the alternative compression scheme obtained at step S12-7 and the number of deletable segment identifications obtained at step S12-5iThe optimal compression scheme of (1);
s12-9: judging the current sub-problem SiWhether there is the next sub-problem Si+1If yes, move to next sub-problem Si+1And entering S12-2, otherwise entering S12-10;
s12-10: and according to the optimal compression scheme obtained in the step S12-8, combining to obtain an overall compression scheme, deleting the segment identifiers in the segment list, and outputting the compressed segment list.
Further, in step S12-4, it is determined whether the segment flag can be deleted, that is, it is determined whether the two shortest paths can be merged into one shortest path according to the merging formula, if the merging formula is true, the process proceeds to step S12-5, otherwise, the process proceeds to step S12-6.
Further, the combined formula is:
SP(vi-k+1,vi)＝SP(vi-k+1,vm)+SP(vm,vi)
wherein SP (v)i-k+1,vi) Is a node vi-k+1To node viA path of (a); SP (v)i-k+1,vm) Is a node vi-k+1To node vmA path of (a); SP (v)m,vi) Is a node vmTo node viThe path of (2).
Further, in step S12-8, the state transition equation is:
in the formula, SiIs the current sub-problem; h (S)i) Is the status of the ith segment list; si-kThe ith-k sub-questions; h (S)i-k) Is the state of the ith-kth segment list; b is the number of deletable segment identifiers; k is the number of segment identifiers; k.b(i,k)Are compression case coefficients.
The beneficial effect of this scheme does:
the method adopts a backtracking method to search the path, is simple to operate, finds the service function chain deployment path capable of applying the segmented routing technology based on the shortest path principle, compresses the additional overhead generated by using the segmented routing technology, namely a segment list, by using a dynamic programming algorithm, realizes the path solution of the service function chain routing problem based on the segmented routing technology, improves the functionality, optimizes the segment list, improves the practicability, and can save the network overhead brought by introducing the segmented routing technology. The problems that in the prior art, the operation is complex, the routing can not be realized under the complex judgment condition, the functionality is poor, the optimization function is not available, and the practicability is low are solved.
Drawings
FIG. 1 is a flow chart of a service function chain routing method based on a segment routing technique;
FIG. 2 is a flowchart of a method for determining whether a shortest path is feasible;
fig. 3 is a flow diagram of a method of compressing a segment list.
Detailed Description
The following description of the embodiments of the present invention is provided to facilitate the understanding of the present invention by those skilled in the art, but it should be understood that the present invention is not limited to the scope of the embodiments, and it will be apparent to those skilled in the art that various changes may be made without departing from the spirit and scope of the invention as defined and defined in the appended claims, and all matters produced by the invention using the inventive concept are protected.
In the embodiment of the present invention, a service function link routing method based on a segment routing technology, as shown in fig. 1, includes the following steps:
s1: receiving a service flow and generating a service function link routing request according to the network topology and related network resources;
s2: traversing the service function link path-finding requests generated in the step S1, and performing descending order on the service function link path-finding requests according to the required bandwidth;
s3: setting a source node and a target node according to a current service function chain routing request, and setting the source node as a current node;
s4: classifying and collecting nodes of all virtual network function entities corresponding to the current service function chain routing request to obtain a node collection which can be processed by each virtual network function;
s5: according to the shortest path principle, calculating the path from the current node to the unmarked corresponding node in the node set of the virtual network function of the next hop to obtain the shortest path, setting the corresponding node as the current node, and performing a path finding attempt;
s6: judging whether the shortest path is feasible, if yes, entering step S7, otherwise, entering step S8;
the method for determining whether the shortest path is feasible, as shown in fig. 2, includes the following steps:
s6-1: judging whether the link bandwidth on the shortest path is greater than or equal to the bandwidth of the service function link routing request, if so, entering a step S6-2, otherwise, entering a step S8;
s6-2: judging whether the throughput of the virtual network function entity of the current node is enough to accommodate the current service function link routing request, if so, entering a step S7, otherwise, entering a step S8;
s7: judging whether an unmarked corresponding node or a target node exists in a node set of the virtual network function of the next hop of the current node, if so, entering step S9, otherwise, entering step S8;
s8: marking the current node, setting the corresponding node of the last virtual network function of the current node as the current node, and entering step S5 to perform routing again;
s9: adding the shortest feasible path to a routing path, and adding the segment identifier of the current node in the network into a segment list;
s10: updating network resources, namely link bandwidth and throughput of a server of the network node;
s11: judging whether the current node is a target node, if so, combining all the shortest feasible paths to obtain a service function chain deployment path, otherwise, entering the step S5;
s12: according to the segment list obtained in the step S9 and the service function chain deployment path obtained in the step S11, a segment list depth compression algorithm is operated to compress the segment list to obtain a compressed segment list;
the method for compressing the segment list, as shown in fig. 3, includes the following steps:
s12-1: dividing a sub-problem S from the head of the segment list, and traversing all sub-problems;
s12-2: optimizing the first i segment lists and traversing the previous subproblems S1To Si-1All division cases of (1) to obtain S1To Si-1Segment identification in between;
s12-3: will Si-kTo SiThe segment identifiers in between are traversed, k ∈ [2, i]；
S12-4: judging whether the segment identifications can be deleted or not, namely judging whether the two shortest circuits can be combined into one shortest circuit or not according to a combination formula, if the combination formula is established, entering S12-5, otherwise, entering S12-6;
the combined formula is:
SP(vi-k+1,vi)＝SP(vi-k+1,vm)+SP(vm,vi)
wherein SP (v)i-k+1,vi) Is a node vi-k+1To node viA path of (a); SP (v)i-k+1,vm) Is a node vi-k+1To node vmA path of (a); SP (v)m,vi) Is a node vmTo node viA path of (a);
s12-5: marking the positions of the deletable segment identifications, and counting the number of the deletable segment identifications;
s12-6: judging whether the current segment mark has a next segment mark, if so, moving to Si-kTo SiAnd proceeds to step S12-4, otherwise proceeds to step S12-7;
s12-7: calculating the current sub-problem SiNext branch question Si-k+1Obtaining an alternative compression scheme;
s12-8: calculating the sub-problem S by the state transition equation according to the alternative compression scheme obtained at step S12-7 and the number of deletable segment identifications obtained at step S12-5iThe optimal compression scheme of (1);
the state transition equation is:
in the formula, SiIs the current sub-problem; h (S)i) Is the status of the ith segment list; si-kThe ith-k sub-questions; h (S)i-k) Is the state of the ith-kth segment list; b is the number of deletable segment identifiers; k is the number of segment identifiers; k.b(i,k)Is the compression case coefficient;
s12-9: judging the current sub-problem SiWhether there is the next sub-problem Si+1If yes, move to next sub-problem Si+1And entering S12-2, otherwise entering S12-10;
s12-10: according to the optimal compression scheme obtained in the S12-8, combining to obtain an overall compression scheme, deleting segment identifiers in the segment list, and outputting the compressed segment list;
s13: and judging whether all service function chain path searching requests are calculated, if so, outputting all service function chain deployment paths and the compressed segment list, and ending the method, otherwise, entering the step S3.
The method adopts a backtracking method to search the path, is simple to operate, finds the service function chain deployment path capable of applying the segmented routing technology based on the shortest path principle, compresses the segment list which is the extra overhead generated by using the segmented routing technology, realizes the path solution of the service function chain routing problem based on the segmented routing technology, improves the functionality, optimizes the segment list, improves the practicability and can save the network overhead brought by introducing the segmented routing technology. The problems that in the prior art, the operation is complex, the routing can not be realized under the complex judgment condition, the functionality is poor, the optimization function is not available, and the practicability is low are solved.
Claims (5)
1. A service function chain routing method based on a segmented routing technology is characterized by comprising the following steps:
s1: receiving a service flow and generating a service function link routing request according to the network topology and related network resources;
s2: traversing the service function link path-finding requests generated in the step S1, and performing descending order on the service function link path-finding requests according to the required bandwidth;
s3: setting a source node and a target node according to a current service function chain routing request, and setting the source node as a current node;
s4: classifying and collecting nodes of all virtual network function entities corresponding to the current service function chain routing request to obtain a node collection which can be processed by each virtual network function;
s5: according to the shortest path principle, calculating the path from the current node to the unmarked corresponding node in the node set of the virtual network function of the next hop to obtain the shortest path, setting the corresponding node as the current node, and performing a path finding attempt;
s6: judging whether the shortest path is feasible, if yes, entering step S7, otherwise, entering step S8;
s7: judging whether an unmarked corresponding node or a target node exists in a node set of the virtual network function of the next hop of the current node, if so, entering step S9, otherwise, entering step S8;
s8: marking the current node, setting the corresponding node of the last virtual network function of the current node as the current node, and entering step S5 to perform routing again;
s9: adding the shortest feasible path to a routing path, and adding the segment identifier of the current node in the network into a segment list;
s10: updating network resources, namely link bandwidth and throughput of a server of the network node;
s11: judging whether the current node is a target node, if so, combining all the shortest feasible paths to obtain a service function chain deployment path, otherwise, entering the step S5;
s12: according to the segment list obtained in the step S9 and the service function chain deployment path obtained in the step S11, a segment list depth compression algorithm is operated to compress the segment list to obtain a compressed segment list;
s13: judging whether all service function chain path-finding requests are calculated, if so, outputting all service function chain deployment paths and compressed segment lists, and ending the method, otherwise, entering the step S3;
in step S6, the method for determining whether the shortest path is feasible includes the following steps:
s6-1: judging whether the link bandwidth on the shortest path is greater than or equal to the bandwidth of the service function link routing request, if so, entering a step S6-2, otherwise, entering a step S8;
s6-2: and judging whether the throughput of the virtual network function entity of the current node is enough to accommodate the current service function link routing request, if so, entering the step S7, and otherwise, entering the step S8.
2. The method for finding the service function link based on the segment routing technology of claim 1, wherein in the step S12, the method for compressing the segment list comprises the following steps:
s12-1: dividing a sub-problem S from the head of the segment list, and traversing all sub-problems;
s12-2: optimizing the first i segment lists and traversing the previous subproblems S1To Si-1All division cases of (1) to obtain S1To Si-1Segment identification in between;
s12-3: will Si-kTo SiThe segment identifiers in between are traversed, k ∈ [2, i]；
S12-4: judging whether the segment identifier can be deleted, if so, entering S12-5, otherwise, entering step S12-6;
s12-5: marking the positions of the deletable segment identifications, and counting the number of the deletable segment identifications;
s12-6: judging whether the current segment mark has a next segment mark, if so, moving to Si-kTo SiAnd proceeds to step S12-4, otherwise proceeds to step S12-7;
s12-7: calculating the current sub-problem SiNext branch question Si-k+1Obtaining an alternative compression scheme;
s12-8: calculating the sub-problem S by the state transition equation according to the alternative compression scheme obtained at step S12-7 and the number of deletable segment identifications obtained at step S12-5iThe optimal compression scheme of (1);
s12-9: judgmentBreaking the current sub-problem SiWhether there is the next sub-problem Si+1If yes, move to next sub-problem Si+1And entering S12-2, otherwise entering S12-10;
s12-10: and according to the optimal compression scheme obtained in the step S12-8, combining to obtain an overall compression scheme, deleting the segment identifiers in the segment list, and outputting the compressed segment list.
3. The method of claim 2, wherein in step S12-4, it is determined whether the segment id can be deleted, that is, it is determined whether the two shortest paths can be merged into a shortest path according to a merging formula, and if the merging formula is satisfied, the method proceeds to step S12-5, otherwise, the method proceeds to step S12-6.
4. The method of claim 3, wherein the merging formula is:
SP(vi-k+1,vi)＝SP(vi-k+1,vm)+SP(vm,vi)
wherein SP (v)i-k+1,vi) Is a node vi-k+1To node viA path of (a); SP (v)i-k+1,vm) Is a node vi-k+1To node vmA path of (a); SP (v)m,vi) Is a node vmTo node viThe path of (2).
5. The method for finding the service function chain based on the segment routing technology as claimed in claim 2, wherein in the step S12-8, the state transition equation is:
in the formula, SiIs the current sub-problem; h (S)i) Is the status of the ith segment list; si-kThe ith-k sub-questions; h (S)i-k) Tabulated for the i-k segmentsA state; b is the number of deletable segment identifiers; k is the number of segment identifiers; k.b(i,k)Are compression case coefficients.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810398963.XA CN108429685B (en) | 2018-04-28 | 2018-04-28 | Service function chain routing method based on segmented routing technology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810398963.XA CN108429685B (en) | 2018-04-28 | 2018-04-28 | Service function chain routing method based on segmented routing technology |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108429685A CN108429685A (en) | 2018-08-21 |
| CN108429685B true CN108429685B (en) | 2020-08-04 |
Family
ID=63162085
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810398963.XA Active CN108429685B (en) | 2018-04-28 | 2018-04-28 | Service function chain routing method based on segmented routing technology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108429685B (en) |
Families Citing this family (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109194577B (en) * | 2018-10-23 | 2020-04-10 | 清华大学 | Traffic engineering method and device of segmented routing network based on partial deployment |
| CN109194579B (en) * | 2018-11-19 | 2020-09-04 | 盛科网络（苏州）有限公司 | Method and device for realizing segmented routing by IPv6 |
| CN111464441A (en) * | 2019-01-21 | 2020-07-28 | 华为技术有限公司 | Communication method and device |
| CN111917640B (en) | 2019-05-09 | 2023-06-06 | 华为技术有限公司 | SRv6 network segment list generation method, message forwarding method, device and system |
| US11070463B2 (en) * | 2019-07-24 | 2021-07-20 | Juniper Networks, Inc. | Guaranteed bandwidth for segment routed (SR) paths |
| CN112583745A (en) * | 2019-09-27 | 2021-03-30 | 华为技术有限公司 | Method, equipment and system for forwarding message in SR network |
| CN112822104A (en) * | 2019-11-15 | 2021-05-18 | 华为技术有限公司 | Data message processing method, device, storage medium and system |
| CN112511427A (en) * | 2020-01-14 | 2021-03-16 | 中兴通讯股份有限公司 | Segment routing service processing method and device, routing equipment and storage medium |
| CN113141338B (en) | 2020-01-20 | 2022-07-22 | 华为技术有限公司 | Message generation method, processing method and device |
| CN113368499B (en) * | 2020-03-09 | 2022-09-06 | 柏项网络科技(上海)有限公司 | Path finding method and device and computer readable storage medium |
| CN113438160A (en) * | 2020-03-23 | 2021-09-24 | 中兴通讯股份有限公司 | Routing method, routing device and computer readable storage medium |
| CN112511429A (en) * | 2020-03-25 | 2021-03-16 | 中兴通讯股份有限公司 | Method, node, controller and computer readable medium for information transmission and processing |
| CN113472718A (en) * | 2020-03-30 | 2021-10-01 | 中兴通讯股份有限公司 | Service processing method, device, equipment and storage medium |
| CN113497760A (en) * | 2020-04-07 | 2021-10-12 | 中兴通讯股份有限公司 | Segmented routing header compression method, service processing method and device |
| CN113542118B (en) * | 2020-04-13 | 2024-01-23 | 中兴通讯股份有限公司 | Segmented route header compression method, service processing method and device |
| CN113824638A (en) * | 2020-06-18 | 2021-12-21 | 华为技术有限公司 | Method, equipment and system for forwarding message |
| CN112511430A (en) * | 2020-06-28 | 2021-03-16 | 中兴通讯股份有限公司 | Information interaction method, information interaction device, tunnel establishment method, tunnel establishment device, communication node and storage medium |
| CN112118179B (en) * | 2020-08-10 | 2022-01-14 | 中盈优创资讯科技有限公司 | Method and device for creating end-to-end Segmented Routing (SR) path |
| US11516114B2 (en) * | 2020-09-30 | 2022-11-29 | Juniper Networks, Inc. | Bandwidth constraint for multipath segment routing |
| CN114531385B (en) * | 2020-10-31 | 2022-12-27 | 华为技术有限公司 | Method, device and system for sending message |
| CN113395334B (en) * | 2021-05-31 | 2022-12-13 | 河南信大网御科技有限公司 | Service function chain online updating method, system and equipment |
| CN113472659B (en) * | 2021-07-02 | 2023-04-18 | 中国电信股份有限公司 | Method and device for determining forwarding path and SDN controller |
| CN113824632B (en) * | 2021-09-03 | 2023-04-18 | 比威网络技术有限公司 | Method and device for compressing path points in safe hierarchical multipath routing |
| CN114448868B (en) * | 2022-02-28 | 2024-02-27 | 百果园技术(新加坡)有限公司 | Path scheduling method, device and equipment based on segmented routing strategy |
| CN114785727B (en) * | 2022-05-06 | 2023-04-25 | 河海大学 | Calculation method for eliminating repeated route |
| CN114900457B (en) * | 2022-05-20 | 2024-04-16 | 中电信数智科技有限公司 | Method and system for reducing SRv message header length |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107332913A (en) * | 2017-07-04 | 2017-11-07 | 电子科技大学 | A kind of Optimization deployment method of service function chain in 5G mobile networks |
| CN107395506A (en) * | 2017-09-07 | 2017-11-24 | 电子科技大学 | A kind of service function chain dispositions method of propagation delay time optimization |
| CN107567704A (en) * | 2015-04-27 | 2018-01-09 | 思科技术公司 | Pass through checking using the network path with interior metadata |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9749229B2 (en) * | 2015-07-01 | 2017-08-29 | Cisco Technology, Inc. | Forwarding packets with encapsulated service chain headers |
-
2018
- 2018-04-28 CN CN201810398963.XA patent/CN108429685B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107567704A (en) * | 2015-04-27 | 2018-01-09 | 思科技术公司 | Pass through checking using the network path with interior metadata |
| CN107332913A (en) * | 2017-07-04 | 2017-11-07 | 电子科技大学 | A kind of Optimization deployment method of service function chain in 5G mobile networks |
| CN107395506A (en) * | 2017-09-07 | 2017-11-24 | 电子科技大学 | A kind of service function chain dispositions method of propagation delay time optimization |
Non-Patent Citations (1)
| Title |
|---|
| 网络服务功能链拓扑设计及映射研究;吕晨;《中国优秀硕士学位论文全文数据库》;20170228;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108429685A (en) | 2018-08-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108429685B (en) | Service function chain routing method based on segmented routing technology | |
| US7142518B2 (en) | Monitoring communications networks | |
| CN103765839B (en) | Variable-based forwarding path construction for packet processing within a network device | |
| US9258220B2 (en) | Communication system, node, control server, communication method and program | |
| CN1359218A (en) | Data structure and storage medium for realizing multi-protocol habel exchange system engineering | |
| US10904152B2 (en) | Hardware-friendly mechanisms for in-band OAM processing | |
| CN107566237B (en) | Data message processing method and device | |
| US11431556B2 (en) | Cross-layer network fault recovery system and method based on configuration migration | |
| CN104518984A (en) | SDN controller for carrying out traffic classification on data package based on multiple classifiers | |
| CN107995121B (en) | Method for counting flow in software defined network based on wildcard | |
| CN107005479B (en) | Method, device and system for forwarding data in Software Defined Network (SDN) | |
| Xu et al. | IARA: An intelligent application-aware VNF for network resource allocation with deep learning | |
| Hicham et al. | 5G mobile networks based on SDN concepts | |
| CN105992186B (en) | Data transmission method and device | |
| CN113949667A (en) | Message processing method and node equipment in segmented network | |
| CN108494597A (en) | Intelligent Optical Network analogue system and method | |
| CN117118886A (en) | Message forwarding method, head-end equipment, controller, equipment and storage medium | |
| CN114745227B (en) | Electric power business network slicing time delay calculation method and device based on FlexE and SPN technologies | |
| EP4075739B1 (en) | Service chain forwarding control methods and devices | |
| CN114079640B (en) | Data processing method, user plane function and device | |
| CN115378876A (en) | Data center network load balancing method in SDN environment | |
| CN117061432A (en) | Multiple network transmission method and related equipment thereof | |
| CN112910774B (en) | Communication method, system and network forwarding equipment | |
| CN108512771A (en) | A kind of method and apparatus that data stream load is shared | |
| CN106341320A (en) | Business backtracking method and device |
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 |