CN108429685A - A kind of service function chain method for searching based on Segment routing technology - Google Patents
A kind of service function chain method for searching based on Segment routing technology Download PDFInfo
- Publication number
- CN108429685A CN108429685A CN201810398963.XA CN201810398963A CN108429685A CN 108429685 A CN108429685 A CN 108429685A CN 201810398963 A CN201810398963 A CN 201810398963A CN 108429685 A CN108429685 A CN 108429685A
- Authority
- CN
- China
- Prior art keywords
- node
- service function
- function chain
- path
- list
- 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
- 238000000034 method Methods 0.000 title claims abstract description 30
- 230000006835 compression Effects 0.000 claims description 16
- 238000007906 compression Methods 0.000 claims description 16
- 230000007704 transition Effects 0.000 claims description 6
- 238000005457 optimization Methods 0.000 abstract description 3
- 238000002372 labelling Methods 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000007373 indentation Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 239000011800 void material Substances 0.000 description 1
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]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of service function chain method for searching based on Segment routing technology, includes the following steps：S1, service function chain pathfinding request is generated；S2, descending sort is carried out；S3, setting source node and destination node；S4, the node set for obtaining virtual network function；S5, according to shortest path principle, calculate shortest path；S6, judge whether shortest path is feasible；S7, the corresponding node not being labeled or destination node are judged whether；S8, pathfinding again is carried out；S9, addition routed path, and segment labeling is added in section list；S10, update Internet resources；S11, service function chain deployment path is obtained；S12, section list is compressed；S13, output service function chain deployment path and compressed section of list.The present invention solve the problems, such as it is of the existing technology it is complicated for operation, cannot achieve and carry out routing, functional poor, low without optimization function and practicability under complicated Rule of judgment.
Description
Technical field
The invention belongs to network architecture fields, and in particular to a kind of service function chain pathfinding side based on Segment routing technology
Method.
Background technology
It is general that network function virtualizes a kind of (Network Function Virtualization, NFV) new network architecture
It reads, using virtualization technology, a series of network function is packaged into an individually action, by way of software definition,
The virtualization for exploring network entity uses, and to reduce the equipment cost of network costliness, meets network peak demand, can be with root
Resource is discharged at any time according to network demand, facilitates deployment, is conducive to fault management, is quickly upgraded, quickly meet the market demand.
Service function chain (Service Function Chain, SFC) is that some operators and manufacturer are directed to network work(
The relevant art of trend proposition can be virtualized, it is intended to be eliminated by instantiating a service function path and be based on physical topology
The relevant constraint of service function.When data message transmits in a network, need according to set suitable required by service logic
Sequence passes through various service nodes, just can guarantee that network can be supplied to user security, network service quickly, stable, this
Form of service, that is, service function chain that kind passes through multiple network server devices according to certain logic sequence.How in network function void
Service implementation function chain is specifically disposed on the basis of quasi-ization becomes new problem.
Software defined network (Software Defined Network, SDN), is a kind of new network of Emulex network innovation framework, is
A kind of realization method of network virtualization, core technology OpenFlow agreements are by equalling network device control plane and data
Face detaches, and uses the control plane of centralization and distributed Forwarding plane, to realize the flexible control of network flow,
Network is set to become more intelligent.
Segment routing (Segment Routing, SR) is a kind of source-routed protocol, also referred to as Segment routing agreement, by source
Node is the data packet specified path in network, and service path is encoded into an orderly Segment by special algorithm
List is encapsulated into data packet header and comes explicit identification path, and the node on forward-path is not necessarily and is possible to by them
Stream maintain status information, that is, " state is in data packet ".It is coded in data packet header because instructing, in network
Node receive data packet after, matching forwarding table execute operation.The intermediate node in path is only needed according to corresponding data
The path specified in packet stem is forwarded.The basic principle of SR is exactly centralized control, by source routing mechanism in source node point
It is pressed into label stack with label, and by the label of explicit route.This framework also agrees with the framework of current SDN network very much simultaneously,
So the centralized control of most of current Segment Routing has been made on SDN controllers.
Node segment identification (Node Segment Identifier), abbreviation segment identification are to distribute one to each node of the whole network
A unique node segment identification, as the mark of guiding routing, indentation section list (segment list) is injected among packet stem.
The scheme of existing service function chain deployment has very much, but only only a few is considered as Segment routing skill at present
The scheme of art.In conventional service function chain deployment scheme, most commonly on existing MPLS and IPv6 data planes
It realizes.
The prior art has the following problems：
(1) MPLS network needs to realize the different work(such as distribution, traffic engineering of label by external protocols such as LDP, RSVP
Can, it is complicated for operation；
(2) prior art cannot achieve there are flow black hole and carry out routing under the complicated Rule of judgment such as bandwidth and time delay,
It is functional poor；
(3) prior art, the overwhelming majority only lay particular emphasis on realization, do not fully consider the pathfinding for service function chain
Problem optimizes Segment routing technology, and practicability is low.
Invention content
For above-mentioned deficiency in the prior art, one kind provided by the invention is easy to operate, functional good and practicability is high
The service function chain method for searching based on Segment routing technology, solve it is of the existing technology it is complicated for operation, cannot achieve
Carried out under complicated Rule of judgment routing, it is functional it is poor, without optimizing function and the low problem of practicability.
In order to reach foregoing invention purpose, the technical solution adopted by the present invention is：
A kind of service function chain method for searching based on Segment routing technology, includes the following steps：
S1：According to network topology and related network resources, receives Business Stream and generate service function chain pathfinding request；
S2：The service function chain pathfinding request that traversal step S1 is generated, bandwidth asks service function chain pathfinding according to demand
Ask carry out descending sort；
S3：It is asked according to current service function chain pathfinding, source node and destination node is set, and source node is set as current
Node；
S4：The node of corresponding all virtual network function entities is sorted out during current service function chain pathfinding is asked
Set, obtains the node set that each virtual network function can be handled；
S5：According to shortest path principle, calculate in present node to the node set of the virtual network function of next-hop not
The path of labeled corresponding node, obtains shortest path, and corresponding node is set as present node, carries out pathfinding trial；
S6：Judge whether shortest path is feasible, if then entering step S7, otherwise enters step S8；
S7：Judge in the node set of the virtual network function of the next-hop of present node with the presence or absence of not labeled pair
Node or destination node are answered, if then entering step S9, otherwise enters step S8；
S8：Present node is marked, and the corresponding node of a upper virtual network function for present node is set as current
Node enters step S5, carries out pathfinding again；
S9：Feasible shortest path is added to routed path, and the segment identification of present node in a network is added to section
In list；
S10：Update Internet resources, the i.e. handling capacity of the server of link bandwidth and network node；
S11：Judge whether present node is destination node, if then combining all feasible shortest paths, obtains service work(
Energy chain disposes path, otherwise enters step S5；
S12：Path is disposed according to the service function chain that the section list of step S9 and step S11 obtain, target phase list is deep
Compression algorithm is spent, section list is compressed, compressed section of list is obtained；
S13：Judge whether to calculate and complete all service function chain pathfinding requests, if then exporting all service functions
Chain disposes path and compressed section of list, and ending method, otherwise enters step S3.
Further, in step S6, judge the whether feasible method of shortest path, include the following steps：
S6-1：Judge whether the link bandwidth on shortest path is greater than or equal to the bandwidth of service function chain pathfinding request,
If then entering step S6-2, S8 is otherwise entered step；
S6-2：Judge whether the handling capacity of the virtual network function entity of present node receives current service function chain enough
Pathfinding is asked, if then entering step S7, otherwise enters step S8.
Further, in step S12, to the method that section list is compressed, include the following steps：
S12-1：Subproblem S is divided from the beginning to section list, traverses all subproblems；
S12-2：Preceding i section list is optimized, subproblem S before traversal1To Si-1All dividing conditions, obtain S1
To Si-1Between segment identification；
S12-3：By Si-kTo SiBetween segment identification traversed, k ∈ [2, i]；
S12-4：Judge whether segment identification can delete, if can if enter S12-5, otherwise enter step S12-6；
S12-5：The position that segment identification can be deleted is marked, and is included in the number that can delete segment identification；
S12-6：Judge that current segment identification whether there is next segment identification, if then moving to Si-kTo SiBetween it is next
A segment identification, and S12-4 is entered step, otherwise enter step S12-7；
S12-7：Calculate current subproblem SiNext transfer subproblem Si-k+1, obtain alternative compression approach；
S12-8：Segment identification is deleted according to what the obtained alternative compression approach of step S12-7 and step S12-5 obtained
Number calculates subproblem S by state transition equationiOptimal compression scheme；
S12-9：Judge current subproblem SiWith the presence or absence of next subproblem Si+1If then moving to next subproblem
Si+1, and enter S12-2, otherwise enter S12-10；
S12-10：The optimal compression scheme obtained according to S12-8, combination obtains reduced overall scheme, in section list
Segment identification is deleted, and exports compressed section of list.
Further, in step S12-4, judge whether segment identification can delete, i.e., judge two most according to merging formula
Whether short circuit can merge into a shortest path, set up if merging formula, enter S12-5, otherwise enter step S12-6.
Further, merging formula is：
SP(vi-k+1,vi)=SP (vi-k+1,vm)+SP(vm,vi)
In formula, SP (vi-k+1,vi) it is node vi-k+1To node viPath；SP(vi-k+1,vm) it is node vi-k+1To node
vmPath；SP(vm,vi) it is node vmTo node viPath.
Further, in step S12-8, state transition equation is：
In formula, SiFor current subproblem；h(Si) be i-th section of list state；Si-kFor the i-th-k subproblems；h(Si-k)
For the state of the i-th-k section lists；B is the number that can delete segment identification；K is the quantity of segment identification；k.b(i,k)To compress situation
Coefficient.
This programme has the beneficial effect that：
This method carries out path finding using retrogressive method, easy to operate, finds to apply based on shortest path principle and divide
The service function chain of section route technology disposes path, is used in combination dynamic programming algorithm additional caused by Segment routing technology to using
Expense, that is, section list is compressed, and the path solution for the service function chain pathfinding problem based on Segment routing technology is realized,
Functionality is improved, section list is optimized, practicability is improved, can save and introduce the network that Segment routing technology is brought
Expense.Solve it is of the existing technology it is complicated for operation, cannot achieve carried out under complicated Rule of judgment routing, it is functional it is poor,
Without the low problem of optimization function and practicability.
Description of the drawings
Fig. 1 is the service function chain method for searching flow chart based on Segment routing technology；
Fig. 2 is to judge the whether feasible method flow diagram of shortest path；
Fig. 3 is the method flow diagram compressed to section list.
Specific implementation mode
The specific implementation mode of the present invention is described below, in order to facilitate understanding by those skilled in the art this hair
It is bright, it should be apparent that the present invention is not limited to the ranges of specific implementation mode, for those skilled in the art,
As long as various change is in the spirit and scope of the present invention that the attached claims limit and determine, these variations are aobvious and easy
See, all are using the innovation and creation of present inventive concept in the row of protection.
In the embodiment of the present invention, a kind of service function chain method for searching based on Segment routing technology, as shown in Figure 1, packet
Include following steps：
S1：According to network topology and related network resources, receives Business Stream and generate service function chain pathfinding request；
S2：The service function chain pathfinding request that traversal step S1 is generated, bandwidth asks service function chain pathfinding according to demand
Ask carry out descending sort；
S3：It is asked according to current service function chain pathfinding, source node and destination node is set, and source node is set as current
Node；
S4：The node of corresponding all virtual network function entities is sorted out during current service function chain pathfinding is asked
Set, obtains the node set that each virtual network function can be handled；
S5：According to shortest path principle, calculate in present node to the node set of the virtual network function of next-hop not
The path of labeled corresponding node, obtains shortest path, and corresponding node is set as present node, carries out pathfinding trial；
S6：Judge whether shortest path is feasible, if then entering step S7, otherwise enters step S8；
The whether feasible method of shortest path is judged, as shown in Fig. 2, including the following steps：
S6-1：Judge whether the link bandwidth on shortest path is greater than or equal to the bandwidth of service function chain pathfinding request,
If then entering step S6-2, S8 is otherwise entered step；
S6-2：Judge whether the handling capacity of the virtual network function entity of present node receives current service function chain enough
Pathfinding is asked, if then entering step S7, otherwise enters step S8；
S7：Judge in the node set of the virtual network function of the next-hop of present node with the presence or absence of not labeled pair
Node or destination node are answered, if then entering step S9, otherwise enters step S8；
S8：Present node is marked, and the corresponding node of a upper virtual network function for present node is set as current
Node enters step S5, carries out pathfinding again；
S9：Feasible shortest path is added to routed path, and the segment identification of present node in a network is added to section
In list；
S10：Update Internet resources, the i.e. handling capacity of the server of link bandwidth and network node；
S11：Judge whether present node is destination node, if then combining all feasible shortest paths, obtains service work(
Energy chain disposes path, otherwise enters step S5；
S12：Path is disposed according to the service function chain that the section list of step S9 and step S11 obtain, target phase list is deep
Compression algorithm is spent, section list is compressed, compressed section of list is obtained；
To the method that section list is compressed, as shown in figure 3, including the following steps：
S12-1：Subproblem S is divided from the beginning to section list, traverses all subproblems；
S12-2：Preceding i section list is optimized, subproblem S before traversal1To Si-1All dividing conditions, obtain S1
To Si-1Between segment identification；
S12-3：By Si-kTo SiBetween segment identification traversed, k ∈ [2, i]；
S12-4：Judge whether segment identification can delete, i.e., judges whether two shortest paths can be merged into according to merging formula
One shortest path is set up if merging formula, enters S12-5, otherwise enter step S12-6；
Merging formula is：
SP(vi-k+1,vi)=SP (vi-k+1,vm)+SP(vm,vi)
In formula, SP (vi-k+1,vi) it is node vi-k+1To node viPath；SP(vi-k+1,vm) it is node vi-k+1To node
vmPath；SP(vm,vi) it is node vmTo node viPath；
S12-5：The position that segment identification can be deleted is marked, and is included in the number that can delete segment identification；
S12-6：Judge that current segment identification whether there is next segment identification, if then moving to Si-kTo SiBetween it is next
A segment identification, and S12-4 is entered step, otherwise enter step S12-7；
S12-7：Calculate current subproblem SiNext transfer subproblem Si-k+1, obtain alternative compression approach；
S12-8：Segment identification is deleted according to what the obtained alternative compression approach of step S12-7 and step S12-5 obtained
Number calculates subproblem S by state transition equationiOptimal compression scheme；
State transition equation is：
In formula, SiFor current subproblem；h(Si) be i-th section of list state；Si-kFor the i-th-k subproblems；h(Si-k)
For the state of the i-th-k section lists；B is the number that can delete segment identification；K is the quantity of segment identification；k.b(i,k)To compress situation
Coefficient；
S12-9：Judge current subproblem SiWith the presence or absence of next subproblem Si+1If then moving to next subproblem
Si+1, and enter S12-2, otherwise enter S12-10；
S12-10：The optimal compression scheme obtained according to S12-8, combination obtains reduced overall scheme, in section list
Segment identification is deleted, and exports compressed section of list；
S13：Judge whether to calculate and complete all service function chain pathfinding requests, if then exporting all service functions
Chain disposes path and compressed section of list, and ending method, otherwise enters step S3.
This method carries out path finding using retrogressive method, easy to operate, finds to apply based on shortest path principle and divide
Section route technology service function chain dispose path, and to use overhead caused by Segment routing technology i.e. section list into
Row compression realizes the path solution for the service function chain pathfinding problem based on Segment routing technology, improves functionality, right
Duan Liebiao is optimized, and improves practicability, can be saved and be introduced the network overhead that Segment routing technology is brought.It solves existing
It is complicated for operation existing for technology, cannot achieve carried out under complicated Rule of judgment routing, it is functional it is poor, without optimization function and practicality
The low problem of property.
Claims (6)
1. a kind of service function chain method for searching based on Segment routing technology, which is characterized in that include the following steps：
S1：According to network topology and related network resources, receives Business Stream and generate service function chain pathfinding request；
S2：The service function chain pathfinding request that traversal step S1 is generated, according to demand bandwidth to service function chain pathfinding ask into
Row descending sort；
S3：It is asked according to current service function chain pathfinding, source node and destination node is set, and source node is set as to work as prosthomere
Point；
S4：The node of corresponding all virtual network function entities carries out classification collection during current service function chain pathfinding is asked
It closes, obtains the node set that each virtual network function can be handled；
S5：According to shortest path principle, calculates and do not marked in present node to the node set of the virtual network function of next-hop
The path of the corresponding node of note, obtains shortest path, and corresponding node is set as present node, carries out pathfinding trial；
S6：Judge whether shortest path is feasible, if then entering step S7, otherwise enters step S8；
S7：Judge in the node set of the virtual network function of the next-hop of present node with the presence or absence of not labeled corresponding section
Otherwise point or destination node enter step S8 if then entering step S9；
S8：Present node is marked, and sets the corresponding node of a upper virtual network function for present node to present node,
S5 is entered step, pathfinding again is carried out；
S9：Feasible shortest path is added to routed path, and the segment identification of present node in a network is added to a section list
In；
S10：Update Internet resources, the i.e. handling capacity of the server of link bandwidth and network node；
S11：Judge whether present node is destination node, if then combining all feasible shortest paths, obtains service function chain
Path is disposed, S5 is otherwise entered step；
S12：Path, target phase list depth pressure are disposed according to the service function chain that the section list of step S9 and step S11 obtain
Compression algorithm compresses section list, obtains compressed section of list；
S13：Judge whether to calculate and complete all service function chain pathfinding requests, if then exporting all service function chain portions
Path and compressed section of list, and ending method are affixed one's name to, S3 is otherwise entered step.
2. the service function chain method for searching according to claim 1 based on Segment routing technology, which is characterized in that described
In step S6, judges the whether feasible method of shortest path, include the following steps：
S6-1：Judge whether the link bandwidth on shortest path is greater than or equal to the bandwidth of service function chain pathfinding request, if
S6-2 is then entered step, S8 is otherwise entered step；
S6-2：Judge whether the handling capacity of the virtual network function entity of present node receives current service function chain pathfinding enough
Request, if then entering step S7, otherwise enters step S8.
3. the service function chain method for searching according to claim 1 based on Segment routing technology, which is characterized in that described
In step S12, to the method that section list is compressed, include the following steps：
S12-1：Subproblem S is divided from the beginning to section list, traverses all subproblems；
S12-2：Preceding i section list is optimized, subproblem S before traversal1To Si-1All dividing conditions, obtain S1It arrives
Si-1Between segment identification；
S12-3：By Si-kTo SiBetween segment identification traversed, k ∈ [2, i]；
S12-4：Judge whether segment identification can delete, if can if enter S12-5, otherwise enter step S12-6；
S12-5：The position that segment identification can be deleted is marked, and is included in the number that can delete segment identification；
S12-6：Judge that current segment identification whether there is next segment identification, if then moving to Si-kTo SiBetween next segment mark
Know, and enter step S12-4, otherwise enters step S12-7；
S12-7：Calculate current subproblem SiNext transfer subproblem Si-k+1, obtain alternative compression approach；
S12-8：According to the number for deleting segment identification that the obtained alternative compression approach of step S12-7 and step S12-5 are obtained,
Subproblem S is calculated by state transition equationiOptimal compression scheme；
S12-9：Judge current subproblem SiWith the presence or absence of next subproblem Si+1If then moving to next subproblem Si+1, and
Into S12-2, otherwise enter S12-10；
S12-10：The optimal compression scheme obtained according to S12-8, combination obtains reduced overall scheme, to the segment mark in section list
Knowledge is deleted, and exports compressed section of list.
4. the service function chain method for searching according to claim 3 based on Segment routing technology, which is characterized in that described
In step S12-4, judge whether segment identification can delete, i.e., judges whether two shortest paths can merge into one according to merging formula
Shortest path is set up if merging formula, enters S12-5, otherwise enter step S12-6.
5. the service function chain method for searching according to claim 4 based on Segment routing technology, which is characterized in that described
Merging formula is：
SP(vi-k+1,vi)=SP (vi-k+1,vm)+SP(vm,vi)
In formula, SP (vi-k+1,vi) it is node vi-k+1To node viPath；SP(vi-k+1,vm) it is node vi-k+1To node vm's
Path；SP(vm,vi) it is node vmTo node viPath.
6. the service function chain method for searching according to claim 3 based on Segment routing technology, which is characterized in that described
In step S12-8, state transition equation is：
In formula, SiFor current subproblem；h(Si) be i-th section of list state；Si-kFor the i-th-k subproblems；h(Si-k) it is the
The state of i-k section list；B is the number that can delete segment identification；K is the quantity of segment identification；k.b(i,k)To compress situation coefficient.
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 true CN108429685A (en) | 2018-08-21 |
| CN108429685B CN108429685B (en) | 2020-08-04 |
Family
ID=63162085
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810398963.XA Expired - Fee Related 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) |
Cited By (27)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109194577A (en) * | 2018-10-23 | 2019-01-11 | 清华大学 | A kind of traffic engineering method and device of the Segment routing network based on partial deployment |
| CN109194579A (en) * | 2018-11-19 | 2019-01-11 | 盛科网络（苏州）有限公司 | A kind of IPv6 realizes the method and device of Segment routing |
| CN111464441A (en) * | 2019-01-21 | 2020-07-28 | 华为技术有限公司 | Communication method and device |
| CN111917640A (en) * | 2019-05-09 | 2020-11-10 | 华为技术有限公司 | SRv6 method, device and system for network generation segment list and message forwarding |
| CN112118179A (en) * | 2020-08-10 | 2020-12-22 | 中盈优创资讯科技有限公司 | Method and device for creating end-to-end Segmented Routing (SR) path |
| CN112311675A (en) * | 2019-07-24 | 2021-02-02 | 瞻博网络公司 | Guaranteed bandwidth for Segment Routing (SR) paths |
| CN112511429A (en) * | 2020-03-25 | 2021-03-16 | 中兴通讯股份有限公司 | Method, node, controller and computer readable medium for information transmission and processing |
| WO2021056945A1 (en) * | 2019-09-27 | 2021-04-01 | 华为技术有限公司 | Method for forwarding message in sr network, device, and system |
| CN112822104A (en) * | 2019-11-15 | 2021-05-18 | 华为技术有限公司 | Data message processing method, device, storage medium and system |
| WO2021143279A1 (en) * | 2020-01-14 | 2021-07-22 | 中兴通讯股份有限公司 | Method and device for segment routing service processing, routing equipment, and storage medium |
| CN113368499A (en) * | 2020-03-09 | 2021-09-10 | 柏项网络科技(上海)有限公司 | Path finding method and device and computer readable storage medium |
| CN113395334A (en) * | 2021-05-31 | 2021-09-14 | 河南信大网御科技有限公司 | Service function chain online updating method, system and equipment |
| CN113438160A (en) * | 2020-03-23 | 2021-09-24 | 中兴通讯股份有限公司 | Routing method, routing device and computer readable storage medium |
| CN113472659A (en) * | 2021-07-02 | 2021-10-01 | 中国电信股份有限公司 | Method and device for determining forwarding path and SDN controller |
| WO2021197141A1 (en) * | 2020-03-30 | 2021-10-07 | 中兴通讯股份有限公司 | Service processing method and apparatus, and device and storage medium |
| CN113497760A (en) * | 2020-04-07 | 2021-10-12 | 中兴通讯股份有限公司 | Segmented routing header compression method, service processing method and device |
| CN113542118A (en) * | 2020-04-13 | 2021-10-22 | 中兴通讯股份有限公司 | Segmented routing header compression method, service processing method and device |
| CN113824632A (en) * | 2021-09-03 | 2021-12-21 | 比威网络技术有限公司 | Method and device for compressing path points in safe hierarchical multipath routing |
| WO2021254500A1 (en) * | 2020-06-18 | 2021-12-23 | 华为技术有限公司 | Method, device and system for forwarding message |
| WO2022001365A1 (en) * | 2020-06-28 | 2022-01-06 | 中兴通讯股份有限公司 | Information exchange and tunnel establishment methods, apparatuses, communication nodes, and storage medium |
| CN114363249A (en) * | 2020-09-30 | 2022-04-15 | 瞻博网络公司 | Bandwidth constraints for multi-path segment routing |
| CN114448868A (en) * | 2022-02-28 | 2022-05-06 | 百果园技术(新加坡)有限公司 | Path scheduling method, device and equipment based on segmented routing strategy |
| CN114531385A (en) * | 2020-10-31 | 2022-05-24 | 华为技术有限公司 | Method, device and system for sending message |
| CN114785727A (en) * | 2022-05-06 | 2022-07-22 | 河海大学 | Calculation method for eliminating repeated routes |
| CN114900457A (en) * | 2022-05-20 | 2022-08-12 | 中电信数智科技有限公司 | Method and system for reducing SRv6 message header length |
| JP7448597B2 (en) | 2020-01-20 | 2024-03-12 | 華為技術有限公司 | Message generation method and device and message processing method and device |
| CN113438160B (en) * | 2020-03-23 | 2024-05-31 | 中兴通讯股份有限公司 | Routing method, routing device and computer readable storage medium |
Citations (4)
| 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 |
| US20170324654A1 (en) * | 2015-07-01 | 2017-11-09 | Cisco Technology, Inc. | Forwarding packets with encapsulated service chain headers |
| 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 |
-
2018
- 2018-04-28 CN CN201810398963.XA patent/CN108429685B/en not_active Expired - Fee Related
Patent Citations (4)
| 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 |
| US20170324654A1 (en) * | 2015-07-01 | 2017-11-09 | Cisco Technology, Inc. | Forwarding packets with encapsulated service chain headers |
| 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 |
|---|
| 吕晨: "网络服务功能链拓扑设计及映射研究", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (40)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109194577A (en) * | 2018-10-23 | 2019-01-11 | 清华大学 | A kind of traffic engineering method and device of the Segment routing network based on partial deployment |
| CN109194577B (en) * | 2018-10-23 | 2020-04-10 | 清华大学 | Traffic engineering method and device of segmented routing network based on partial deployment |
| CN109194579A (en) * | 2018-11-19 | 2019-01-11 | 盛科网络（苏州）有限公司 | A kind of IPv6 realizes the method and device of Segment routing |
| CN111464441A (en) * | 2019-01-21 | 2020-07-28 | 华为技术有限公司 | Communication method and device |
| CN111917640A (en) * | 2019-05-09 | 2020-11-10 | 华为技术有限公司 | SRv6 method, device and system for network generation segment list and message forwarding |
| US11902156B2 (en) | 2019-05-09 | 2024-02-13 | Huawei Technologies Co., Ltd. | Method for generating segment list, method for forwarding packet, device, and system in SRv6 network |
| CN112311675A (en) * | 2019-07-24 | 2021-02-02 | 瞻博网络公司 | Guaranteed bandwidth for Segment Routing (SR) paths |
| CN112311675B (en) * | 2019-07-24 | 2022-05-27 | 瞻博网络公司 | Guaranteed bandwidth for Segment Routing (SR) paths |
| WO2021056945A1 (en) * | 2019-09-27 | 2021-04-01 | 华为技术有限公司 | Method for forwarding message in sr network, device, and system |
| CN112822104A (en) * | 2019-11-15 | 2021-05-18 | 华为技术有限公司 | Data message processing method, device, storage medium and system |
| WO2021143279A1 (en) * | 2020-01-14 | 2021-07-22 | 中兴通讯股份有限公司 | Method and device for segment routing service processing, routing equipment, and storage medium |
| JP7448597B2 (en) | 2020-01-20 | 2024-03-12 | 華為技術有限公司 | Message generation method and device and message processing method and device |
| CN113368499B (en) * | 2020-03-09 | 2022-09-06 | 柏项网络科技(上海)有限公司 | Path finding method and device and computer readable storage medium |
| CN113368499A (en) * | 2020-03-09 | 2021-09-10 | 柏项网络科技(上海)有限公司 | Path finding method and device and computer readable storage medium |
| CN113438160B (en) * | 2020-03-23 | 2024-05-31 | 中兴通讯股份有限公司 | Routing method, routing 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 |
| WO2021197141A1 (en) * | 2020-03-30 | 2021-10-07 | 中兴通讯股份有限公司 | Service processing method and apparatus, and device and storage medium |
| CN113497760A (en) * | 2020-04-07 | 2021-10-12 | 中兴通讯股份有限公司 | Segmented routing header compression method, service processing method and device |
| CN113497760B (en) * | 2020-04-07 | 2024-05-07 | 中兴通讯股份有限公司 | Segmented route header compression method, service processing method and device |
| CN113542118A (en) * | 2020-04-13 | 2021-10-22 | 中兴通讯股份有限公司 | 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 |
| WO2021254500A1 (en) * | 2020-06-18 | 2021-12-23 | 华为技术有限公司 | Method, device and system for forwarding message |
| WO2022001365A1 (en) * | 2020-06-28 | 2022-01-06 | 中兴通讯股份有限公司 | Information exchange and tunnel establishment methods, apparatuses, communication nodes, and storage medium |
| CN112118179A (en) * | 2020-08-10 | 2020-12-22 | 中盈优创资讯科技有限公司 | Method and device for creating end-to-end Segmented Routing (SR) path |
| CN114363249B (en) * | 2020-09-30 | 2023-09-12 | 瞻博网络公司 | Bandwidth constraint for multi-path segment routing |
| CN114363249A (en) * | 2020-09-30 | 2022-04-15 | 瞻博网络公司 | Bandwidth constraints for multi-path segment routing |
| US11818032B2 (en) | 2020-09-30 | 2023-11-14 | Juniper Networks, Inc. | Bandwidth constraint for multipath segment routing |
| CN114531385B (en) * | 2020-10-31 | 2022-12-27 | 华为技术有限公司 | Method, device and system for sending message |
| CN114531385A (en) * | 2020-10-31 | 2022-05-24 | 华为技术有限公司 | Method, device and system for sending message |
| CN113395334A (en) * | 2021-05-31 | 2021-09-14 | 河南信大网御科技有限公司 | 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 |
| CN113472659A (en) * | 2021-07-02 | 2021-10-01 | 中国电信股份有限公司 | Method and device for determining forwarding path and SDN controller |
| CN113824632A (en) * | 2021-09-03 | 2021-12-21 | 比威网络技术有限公司 | Method and device for compressing path points in safe hierarchical multipath routing |
| CN114448868A (en) * | 2022-02-28 | 2022-05-06 | 百果园技术(新加坡)有限公司 | Path scheduling method, device and equipment based on segmented routing strategy |
| 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 |
| CN114785727A (en) * | 2022-05-06 | 2022-07-22 | 河海大学 | Calculation method for eliminating repeated routes |
| CN114900457A (en) * | 2022-05-20 | 2022-08-12 | 中电信数智科技有限公司 | Method and system for reducing SRv6 message header length |
| CN114900457B (en) * | 2022-05-20 | 2024-04-16 | 中电信数智科技有限公司 | Method and system for reducing SRv message header length |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108429685B (en) | 2020-08-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108429685A (en) | A kind of service function chain method for searching based on Segment routing technology | |
| CN100448216C (en) | Data structure and storage medium for realizing multi-protocol habel exchange system engineering | |
| CN103346922B (en) | The controller of determination network state based on SDN and determine method | |
| CN103119900B (en) | Communication system, control appliance, node control method and node control program | |
| CN1918861B (en) | Traffic flow determination in communications networks | |
| CN112187517B (en) | Configuration method, platform and controller for SDN virtual routing of data center | |
| CN108173761A (en) | A kind of method for optimizing resources of SDN and NFV fusions | |
| CN104702479B (en) | The method and apparatus that tunnel is established in SDN network | |
| US7525919B2 (en) | Packet communication method with increased traffic engineering efficiency | |
| CN106209623A (en) | Determine method and the control equipment of forward-path | |
| WO2001086891A2 (en) | System and method for application object transport | |
| Wang et al. | Implementation of multipath network virtualization with SDN and NFV | |
| CN107566237B (en) | Data message processing method and device | |
| CN109379230B (en) | Service function chain deployment method based on breadth-first search | |
| Yan et al. | A survey of low-latency transmission strategies in software defined networking | |
| CN104717098A (en) | Data processing method and device | |
| CN105376158A (en) | SDN circulation method and device based on EXP value in MPLS message | |
| CN105681196B (en) | A kind of method of business processing, transponder and classifier | |
| CN112291147A (en) | Dynamic intelligent SR tunnel application method for 5G service | |
| CN113472811A (en) | Heterogeneous service function chain forwarding protocol and method in intelligent fusion identification network | |
| US7370096B2 (en) | Methods and systems to generate and implement a changeover sequence to reconfigure a connection-oriented network | |
| CN117118886A (en) | Message forwarding method, head-end equipment, controller, equipment and storage medium | |
| Hicham et al. | 5G mobile networks based on SDN concepts | |
| CN108494597A (en) | Intelligent Optical Network analogue system and method | |
| de Oliveira et al. | Virtualizing packet-processing network functions over heterogeneous openflow switches |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200804 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |