CN106411553A - Optimization method of service chain path and apparatus thereof - Google Patents
Optimization method of service chain path and apparatus thereof Download PDFInfo
- Publication number
- CN106411553A CN106411553A CN201510467846.0A CN201510467846A CN106411553A CN 106411553 A CN106411553 A CN 106411553A CN 201510467846 A CN201510467846 A CN 201510467846A CN 106411553 A CN106411553 A CN 106411553A
- Authority
- CN
- China
- Prior art keywords
- sfp
- path loss
- total value
- path
- sfc
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
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 optimization method of a service chain path and an apparatus thereof. The optimization method comprises the following steps of according to a service chain SFC set by a user, acquiring multiple service chain paths SFPs used for realizing the SFC; sending a query request of inquiring a SFP path loss total value condition to an application layer flow optimization server ALTO Server; and receiving a query result returned by the ALTO Server, and according to the query result, determining the SFP with a minimum path loss total value in the SFPs to be an optimal SFP realizing the SFC. By using the optimization method of the service chain path, through information interaction between a service chain control plane and the ALTO Server, according to the path loss total value condition of the service chain paths, the SFP with the minimum path loss total value in the SFPs is determined to be the optimal SFP realizing the SFC set by the user; global selection optimization of the service chain control plane to the SFP is realized; optimization accuracy is high and an algorithm of a data plane is simplified; and calculating time of the data plane is reduced and a service forwarding speed is accelerated.
Description
Technical field
The present invention relates to technical field of data transmission, more particularly, to a kind of optimization method and device in business chain path.
Background technology
ALTO (Application-Layer Traffic Optimization, application layer traffic optimization) be a kind of application layer to application provide the network information agreement.Wherein, the network information that ALTO provides includes network topology, routing rule and path loss etc..In the overall system architecture of ALTO as shown in Figure 1, ALTO Server stores the available network information of ALTO.ALTO Client determines a suitable Server by ALTO agreement, and using ALTO agreement to the required network information of this Server request.For a given network, ALTO Server can safeguard an attrition table, for defining in network originating point to the path loss of impact point.At present, the application scenarios of ALTO include P2P network (Peer to Peer, peer-to-peer network), CDN (Content Delivery Network, content distributing network) etc..
Business chain refers to that Virtual network operator typically requires when providing network insertion to terminal use using one group of orderly SF (Service Function, business function), such as fire wall, packet filtering, load balancing and transmission agency etc..One group of orderly SF that customer flow passes through is referred to as SFC (Service Function Chain, business chain), one SFC business chain is to carry out instantiation by the SFP (Service Function Path, business chain path) selecting specific SF to be formed on particular network node.
In SFC framework, comprise SFF (Service Function Forwarder, business chain retransmission unit), SCF (Service Classification Function, business chain taxon) and multiple SF.Specifically, SFC framework is as shown in Figure 2.Wherein SCF is responsible for the business of arrival is classified, and SFF will be the label that each stream stamps follow-up business chain path according to the classification information of SCF, i.e. SFC-header, and each business enters business chain domain since then.Each business enters first SF in business chain path first according to the label that SFF stamps, and after SF finishing service is processed, returns SFF.SFF, further according to SFC-header, business is forwarded to upper second SF of SF path, and so on.
Wherein, current SFC optimized algorithm is concentrated mainly in the optimization of partial data bag of datum plane part, lack the overall situation to SFC to select to optimize, and the selection of SFP determines the height that Virtual network operator provides the quality of access service to terminal use to a certain extent.Therefore, existing optimization method optimization accuracy is low, and the forwarding speed of SFF is slower.
Content of the invention
In order to overcome above-mentioned technical problem, the invention provides a kind of optimization method and device in business chain path, by the information exchange between business chain control plane and ALTO Server it is achieved that business chain control plane selects to optimize to the overall situationization of SFP, accelerate business forwarding speed.
In order to solve above-mentioned technical problem, the present invention adopts the following technical scheme that：
According to one aspect of the present invention, there is provided a kind of optimization method in business chain path, it is applied to business chain control plane, described optimization method includes：
Business chain SFC being set according to user, obtains a plurality of business chain path SFP realizing described SFC；
Optimize server A LTO Server to application layer traffic and send the inquiry request inquiring about described SFP path loss total value situation；
Receive the Query Result that described ALTO Server returns, according to described Query Result, the minimum SFP of described SFP path loss total value is defined as realizing the optimum SFP of described SFC.
Alternatively, described receive in the Query Result step that described ALTO Server returns, described Query Result includes the path loss total value of each SFP in described a plurality of SFP, wherein, after receiving the step of Query Result that described ALTO Server returns, described optimization method also includes：
The path loss total value of each SFP in the described a plurality of SFP obtaining is compared, obtains the minimum corresponding SFP of described path loss total value.
Alternatively, the described step optimizing the inquiry request that server A LTO Server sends the described SFP path loss total value situation of inquiry to application layer traffic is specially：
Described inquiry request is written in JSON form, ALTO agreement is optimized by application layer traffic and optimizes, to application layer traffic, the inquiry request that server A LTO Server sends each SFP path loss in a plurality of SFP of inquiry.
Alternatively, described when described inquiry request is written in JSON form, specifically include：
The routing information needing a plurality of SFP being queried in described inquiry request is written in described JSON form, wherein, described routing information includes：The source address of SFP and the destination address corresponding with each business function SF；
Change the JSON form of described routing information, make described JSON form support the destination address chain of described a plurality of SFP, or make described JSON form support the address chain corresponding with each SFP in described a plurality of SFP.
Alternatively, when making the destination address chain that described JSON form supports described a plurality of SFP, specifically include：
Obtain the processing sequence to each SF setting in described SFC；
According to described processing sequence, successively the destination address group corresponding with each SF is written in JSON form, forms destination address chain, wherein, described destination address group is made up of the destination address of the SF of multiple identical functions.
Alternatively, described JSON form is made to support the address chain corresponding with each SFP in described a plurality of SFP, specially：
The address chain corresponding with each SFP in described a plurality of SFP is written in JSON form one by one, wherein, described address chain is made up of the source address of each SFP and the destination address of each SF in described SFP.
According to another aspect of the present invention, additionally provide a kind of optimization method in business chain path, be applied to application layer traffic and optimize server A LTO Server, described optimization method includes：
Receive business chain SFC that business chain control plane sets according to user, when obtaining a plurality of business chain path SFP realizing described SFC, the inquiry request of the described SFP path loss total value situation of inquiry of transmission；
According to described inquiry request, it is calculated the path loss total value after each business function SF tandem paths in each SFP in described a plurality of SFP, and return Query Result to described business chain control plane.
Alternatively, after the described step of path loss total value being calculated after each business function SF tandem paths in each SFP in described a plurality of SFP, described optimization method also includes：
The path loss total value of each SFP in the described a plurality of SFP obtaining is compared, obtains the minimum corresponding SFP of path loss total value, the information of described corresponding SFP is returned to described business chain control plane as Query Result.
Alternatively, described according to described inquiry request, the step being calculated the path loss total value after each business function SF tandem paths in each SFP in described a plurality of SFP specifically includes：
According to described inquiry request, query path attrition table, obtain the path loss values of mutually transmission between the source address destination address corresponding with the SF of each identical services function in described SFP；
The path loss values realizing each SF in described SFC are added, obtain the path loss total value after each SF tandem paths in each SFP in described a plurality of SFP, wherein, described path loss total value is relative loss factor value.
According to another aspect of the present invention, additionally provide a kind of optimization device in business chain path, be applied to business chain control plane, described optimization device includes：
Acquisition module, for business chain SFC setting according to user, obtains a plurality of business chain path SFP realizing described SFC；
Sending module, sends, for optimizing server A LTO Server to application layer traffic, the inquiry request inquiring about described SFP path loss total value situation；
Determining module, for receiving the Query Result that described ALTO Server returns, according to described Query Result, the minimum SFP of described SFP path loss total value is defined as realizing the optimum SFP of described SFC.
Alternatively, described Query Result includes the path loss total value of each SFP in described a plurality of SFP, and described optimization device also includes：
First comparison module, the path loss total value for each SFP in the described a plurality of SFP to acquisition is compared, and obtains the minimum corresponding SFP of described path loss total value.
Alternatively, described sending module specifically for：Described inquiry request is written in JSON form, ALTO agreement is optimized by application layer traffic and optimizes, to application layer traffic, the inquiry request that server A LTO Server sends each SFP path loss in a plurality of SFP of inquiry.
Alternatively, when described inquiry request is written in JSON form described sending module, specifically include：
The routing information needing a plurality of SFP being queried in described inquiry request is written in described JSON form, wherein, described routing information includes：The source address of SFP and the destination address corresponding with each business function SF；
Change the JSON form of described routing information, make described JSON form support the destination address chain of described a plurality of SFP, or make described JSON form support the address chain corresponding with each SFP in described a plurality of SFP.
Alternatively, when making the destination address chain that described JSON form supports described a plurality of SFP, specifically include：
Obtain the processing sequence to each SF setting in described SFC；
According to described processing sequence, successively the destination address group corresponding with each SF is written in JSON form, forms destination address chain, wherein, described destination address group is made up of the destination address of the SF of multiple identical functions.
Alternatively, described JSON form is made to support the address chain corresponding with each SFP in described a plurality of SFP, specially：
The address chain corresponding with each SFP in described a plurality of SFP is written in JSON form one by one, wherein, described address chain is made up of the source address of each SFP and the destination address of each SF in described SFP.
According to another aspect of the present invention, additionally provide a kind of optimization device in business chain path, be applied to application layer traffic and optimize server A LTO Server, described optimization device includes：
Receiver module, for receiving business chain SFC that business chain control plane sets according to user, when obtaining a plurality of business chain path SFP realizing described SFC, the inquiry request of the described SFP path loss total value situation of inquiry of transmission；
Computing module, for according to described inquiry request, being calculated the path loss total value after each business function SF tandem paths in each SFP in described a plurality of SFP, and returns Query Result to described business chain control plane.
Alternatively, described optimization device also includes：
Second comparison module, the path loss total value for each SFP in the described a plurality of SFP to acquisition is compared, and obtains the minimum corresponding SFP of path loss total value, the information of described corresponding SFP is returned to described business chain control plane as Query Result.
Alternatively, described computing module specifically includes：
Query unit, for according to described inquiry request, query path attrition table, obtaining the path loss values of mutually transmission between the source address destination address corresponding with the SF of each identical services function in described SFP；
Addition unit, for being added the path loss values realizing each SF in described SFC, obtains the path loss total value after each SF tandem paths in each SFP in described a plurality of SFP, and wherein, described path loss total value is relative loss factor value.
The invention has the beneficial effects as follows：
In the optimization method in the business chain path that the present invention provides, send inquiry request firstly the need of business chain control plane to ALTO Server, ALTO Server is made to inquire about the path loss total value situation of each SFP in a plurality of SFP, then the Query Result being returned according to ALTO Server, the minimum SFP of SFP path loss total value is defined as realizing the optimum SFP of SFC.Therefore, the optimization method in the business chain path being provided by the present invention, so that can carry out information exchange between business chain control plane and ALTO Server it is achieved that business chain control plane selects to optimize to the overall situationization of SFP, improves the accuracy of path optimization.In addition, business chain control plane is after obtaining optimum SFP, datum plane can be directly handed down to, the forwarding that SFF only need to execute business chain control plane requires, calculating need not further be optimized, and then simplify the algorithm of datum plane, decrease the calculating time of datum plane, accelerate business forwarding speed.
Brief description
Fig. 1 represents the overall system architecture figure of ALTO；
Fig. 2 represents business chain Organization Chart；
Fig. 3 represents one of flow chart of optimization method in business chain path in the embodiment of the present invention；
Fig. 4 represents the planning chart in business chain path in the embodiment of the present invention；
Fig. 5 represents two of the flow chart of the optimization method in business chain path in the embodiment of the present invention；
Fig. 6 represents the flow chart calculating path loss total value in the embodiment of the present invention；
Fig. 7 represents one of the structured flowchart of optimization device in business chain path in the embodiment of the present invention；
Fig. 8 represents the two of the structured flowchart of optimization device in business chain path in the embodiment of the present invention；And
Fig. 9 represents the structured flowchart of computing module in the embodiment of the present invention.
Specific embodiment
For making the object, technical solutions and advantages of the present invention clearer, describe the present invention below in conjunction with the accompanying drawings and the specific embodiments.
Embodiment one
According to one aspect of the present invention, there is provided a kind of optimization method in business chain path, it is applied to business chain control plane, such as Fig. 3, this optimization method includes：
Step S301, business chain SFC being set according to user, obtain a plurality of business chain path SFP realizing SFC；
Step S303, the inquiry request to application layer traffic optimization server A LTO Server transmission inquiry SFP path loss total value situation；
The Query Result that step S305, reception ALTO Server return, according to Query Result, the minimum SFP of SFP path loss total value is defined as realizing the optimum SFP of SFC.
In the optimization method in business chain path provided in an embodiment of the present invention, send inquiry request firstly the need of business chain control plane as ALTO user (ALTO Client) to ALTO Server, ALTO Server is made to inquire about the path loss total value situation of each SFP in a plurality of SFP, then, from the Query Result that ALTO Server returns, the SFP selecting SFP path loss total value minimum is defined as realizing the optimum SFP of this SFC.Therefore, by the information exchange between business chain control plane and ALTO Server it is achieved that business chain control plane selects to optimize to the overall situationization of SFP, improve the accuracy of path optimization.In addition, business chain control plane is after obtaining optimum SFP, datum plane can be directly handed down to, the forwarding that SFF only need to execute business chain control plane requires, calculating need not further be optimized, simplify the algorithm of datum plane, and then decrease the calculating time of datum plane, accelerate business forwarding speed.
Wherein, in embodiments of the present invention, the path loss total value being each SFP in a plurality of SFP when the Query Result that ALTO Server returns, then, after receiving the step of Query Result that ALTO Server returns, this optimization method also includes：
The path loss total value of each SFP in a plurality of SFP obtaining is compared, obtains the minimum corresponding SFP of path loss total value.
Because ALTO Server is when returning Query Result, need the requirement of the inquiry request of transmission according to business chain control plane to return, the minimum SFP of total value can be lost with return path, or the path loss total value of each SFP.So, when ALTO Server returns the path loss total value of each SFP, business chain control plane needs the path loss total value of each SFP to be compared, to obtain the corresponding SFP of path loss total value minimum, as the optimum SFP realizing this SFC.
Specifically, in embodiments of the present invention, optimize server A LTO Server to application layer traffic and send the inquiry request (step S303) inquiring about SFP path loss total value situation specially：
Inquiry request is written in JSON form, ALTO agreement is optimized by application layer traffic and optimizes, to application layer traffic, the inquiry request that server A LTO Server sends each SFP path loss in a plurality of SFP of inquiry.
Wherein, JSON form is a kind of data interchange format of lightweight it is easy to reading and writing, and is also easy to machine parsing simultaneously and generates, improves network transmission speed.
Specifically, in embodiments of the present invention, when being written to inquiry request in JSON form, first the routing information of a plurality of SFP needing in inquiry request to be queried is written in JSON form, wherein, routing information includes：The source address of SFP and the destination address corresponding with each business function SF；Then in the JSON form of modification routing information, make JSON form support the destination address chain of a plurality of SFP, or make JSON form support the address chain corresponding with each SFP in a plurality of SFP.
Wherein, the ALTO protocol format between existing ALTO Client to ALTO Server is as follows：
Above-mentioned JSON form represents, ALTO Client inquires source address (192.0.2.2) to the path loss of two destination addresses (192.0.2.89 and 198.51.100.34) to ALTO Server.After ALTO Server is connected to this inquiry, the Endpoint loss information according to obtaining compares two path losses, and returns ALTO Client definitely or relative path loss information.
Because current ALTO agreement only supports that the path loss that source address arrives some destination addresses is inquired about, therefore, when sending the inquiry request of each SFP path loss in a plurality of SFP of inquiry by ALTO agreement to ALTO Server, need ALTO agreement is expanded.Wherein, the modification to JSON form is mainly reflected in the expansion of ALTO agreement, that is, makes amended JSON form support the destination address chain of a plurality of SFP, or make JSON form support the address chain corresponding with each SFP in a plurality of SFP.
Below, the planning chart with regard to the business chain path shown in Fig. 4 illustrates above two and expands mode.Wherein, as shown in Figure 4, according to current network conditions it may be determined that four SFP, respectively：
◆SFP 1：FW1—>DPI1
◆SFP 2：FW2—>DPI1
◆SFP 3：FW1—>DPI2
◆SFP 4：FW2—>DPI2
When by way of the first modification：Make amended JSON form support the destination address chain of a plurality of SFP, when being expanded, specifically include：
Obtain the processing sequence to each SF setting in SFC；
According to processing sequence, successively the destination address group corresponding with each SF is written in JSON form, forms destination address chain, wherein, destination address group is made up of the destination address of the SF of multiple identical functions.
It is written in JSON form by the first modification mode, be：
Wherein, first group of IP (192.0.2.89 and 198.51.100.34) is FW (Firewall, fire wall) destination address, second group (203.0.113.45 and 295.1.67.3) is the destination address of DPI (Deep Packet Inspection, deep-packet detection).Wherein, above-mentioned JSON form represents, the order that ALTO Server will send according to business chain control plane, calculates from source address, first passes around certain IP in first destination address group, afterwards in second destination address group certain IP path loss.ALTO Server needs to calculate from source address, after the order arrangement of IP in each destination address group, forms the path loss total value in path.
Due in process Fig. 4, during the path of planning, the sequencing that SF is processed is：FW, DPI, and the sequencing of destination address group is also in JSON form：FW、DPI.Therefore, the order that order represents SF in SFC in destination address group.Wherein, comprise function identical SF extremely address information in each destination address group, and the IP quantity in different destination address group is not necessarily consistent.
When mode is changed by second：Amended JSON form is made to support the address chain corresponding with each SFP in a plurality of SFP, when being expanded, specially：
The address chain corresponding with each SFP in a plurality of SFP is written in JSON form one by one, wherein, address chain is made up of the source address of each SFP and the destination address of each SF in SFP.
It is written to by way of second modification in JSON form, be：
Wherein, second is changed mode and is with the difference of the first modification mode：Second changes source address and each destination address that mode has enumerated all SFC.Second is changed mode and is with respect to the advantage of the first modification mode, if business chain control plane only needs to understand the loss of certain business chain (and business chain permutation and combination of not all SF composition), only need to enumerate it should be understood that business chain.And inferior position is, mode of enumerating is complex, and when SF is more, enumerating will be more complicated.
Therefore, the inquiry request of business chain control plane can be sent to ALTO Server by the ALTO agreement after above-mentioned expansion, and when sending inquiry request, can choose corresponding expansion mode according to self-demand.
Embodiment two
According to another aspect of the present invention, additionally provide a kind of optimization method in business chain path, be applied to application layer traffic and optimize server A LTO Server, this optimization method includes as shown in Figure 5：
Business chain SFC that step S501, reception business chain control plane set according to user, when obtaining a plurality of business chain path SFP realizing SFC, the inquiry request of the inquiry SFP path loss total value situation of transmission；
Step S503, according to inquiry request, be calculated the path loss total value after each business function SF tandem paths in each SFP in a plurality of SFP, and to business chain control plane return Query Result.
In the optimization method in business chain path provided in an embodiment of the present invention, ALTO Server is after receiving the inquiry request that business chain control plane sends, the path loss total value of each SFP in a plurality of SFP is calculated, then the concrete condition of the path loss total value of each SFP is returned to business chain control plane, acquisition approach is lost the minimum corresponding SFP of total value as optimum SFP.Therefore, by the information exchange between business chain control plane and ALTO Server so that business chain control plane can carry out the overall situationization to SFP selects optimization, and then improve the accuracy of path optimization.
Wherein, in embodiments of the present invention, because ALTO Server is when returning Query Result, the requirement of the inquiry request of the transmission according to business chain control plane returns, and total value minimum SFP can be lost with return path, or the path loss total value of each SFP.When ALTO Server return path is lost the minimum corresponding SFP of total value, this optimization method also includes：
The path loss total value of each SFP in a plurality of SFP obtaining is compared, obtains the minimum corresponding SFP of path loss total value, the information of corresponding SFP is returned to business chain control plane as Query Result.
Specifically, in embodiments of the present invention, as shown in fig. 6, according to inquiry request, being calculated the path loss total value (step S503) after each business function SF tandem paths in each SFP in a plurality of SFP and specifically include：
Step S5031, according to inquiry request, query path attrition table, obtain the path loss values of mutually transmission between the source address destination address corresponding with the SF of each identical services function in SFP；
Step S5033, will realize each SF in SFC path loss values be added, obtain the path loss total value after each SF tandem paths in each SFP in a plurality of SFP, wherein, path loss total value be relative loss factor value.
Wherein, for the planning chart in the business chain path shown in Fig. 4, there is path loss table as follows.
| SFP_ID | SFP | Path loss |
| SFP 1 | FW1—>DPI1 | 2+1+2+3=8 |
| SFP 2 | FW2—>DPI1 | 2+3+2+3=10 |
| SFP 3 | FW1—>DPI2 | 2+1+6+4=13 |
| SFP 4 | FW2—>DPI2 | 2+3+6+4=15 |
Wherein, the path loss values of mutually transmission between the source address destination address corresponding with the SF of each identical services function can be obtained by this path loss table.According to existing SFC implementation, always by SFF to SF1, after the completion for the treatment of that SF1 is processed, business need to return SFF to SFC, then reaches next SF2 from SFF.According to this calculative strategy, the footpath path loss total value table of every SFP of correspondence as follows can be calculated.
| SFP_ID | SFP | Path loss total value |
| SFP 1 | FW1—>DPI1 | 2+1+2+3=8 |
| SFP 2 | FW2—>DPI1 | 2+3+2+3=10 |
| SFP 3 | FW1—>DPI2 | 2+1+6+4=13 |
| SFP 4 | FW2—>DPI2 | 2+3+6+4=15 |
As seen from the above table, the path loss total value of SFP1 is little, and therefore, SFP1 can be recommended business chain control plane as optimal path by ALTO Server, or the concrete condition of the path loss total value of each SFP in a plurality of SFP is returned to business chain control plane.
However, due to the introducing of NFV (Network Function Virtualization, network function virtualizes) technology, the strategy calculating path loss total value may increase.Such as, under NFV scene, some SF are probably the Virtual NE being located on same hardware, and now, the business chain between such network element can swap merely with virtual switch, and need not return in SFF.And now, the calculating in different business path will change.
As shown in Figure 4, two Virtual NE that FW2 and DPI1 is located in a physical machine, SFF 2 is virtual switch.Now, FW2->The path loss of DPI will substantially reduce, because needing not move through FW2->GW->DPI1.And now, ALTO server need to understand that FW2 and DPI1 as terminal is virtual unit and the attribute being located on a physical equipment, thus obtain path loss table as follows.
| Source address | Destination address | Path loss |
| Source | FW1 | 2 |
| FW1 | Source | 1 |
| Source | FW2 | 2 |
| FW2 | Source | 3 |
| Source | DPI1 | 2 |
| DPI1 | Source | 3 |
| Source | DPI2 | 6 |
| DPI2 | Source | 4 |
| FW2 | DPI1 | 2 |
According to upper table, every SFP path loss total value can be calculated, wherein, the footpath path loss total value table of corresponding every SFP is as shown in the table.
| SFP_ID | SFP | Path loss total value |
| SFP 1 | FW1—>DPI1 | 2+1+2+3=8 |
| SFP 2 | FW2—>DPI1 | 2+2+3=7 |
| SFP 3 | FW1—>DPI2 | 2+1+6+4=13 |
| SFP 4 | FW2—>DPI2 | 2+3+6+4=15 |
As seen from the above table, the path loss total value of SFP2 is little, and therefore, SFP2 can be recommended business chain control plane as optimal path by ALTO Server, or the concrete condition of the path loss total value of each SFP in a plurality of SFP is returned to business chain control plane.
In summary, due to the introducing of NFV technology, increased the calculative strategy calculating path loss total value, for obtaining more selectivitys of optimal path offer it is ensured that the accuracy of path optimization.In addition, business chain control plane is obtaining optimum SFP, datum plane can be directly handed down to, the forwarding that SFF only need to execute business chain control plane requires, calculating need not further be optimized, simplify the algorithm of datum plane, and then decrease the calculating time of datum plane, accelerate business forwarding speed.
Embodiment three
According to another aspect of the present invention, there is provided a kind of optimization device in business chain path, it is applied to business chain control plane, such as Fig. 7, this optimization device 700 includes：
Acquisition module 701, for business chain SFC setting according to user, obtains a plurality of business chain path SFP realizing SFC；
Sending module 703, for optimizing, to application layer traffic, the inquiry request that server A LTO Server sends inquiry SFP path loss total value situation；
Determining module 705, for receiving the Query Result of ALTO Server return, according to Query Result, the minimum SFP of SFP path loss total value is defined as realizing the optimum SFP of SFC.
Wherein, because ALTO Server is when returning Query Result, need the requirement of the inquiry request of transmission according to business chain control plane to return, the minimum SFP of total value can be lost with return path, or the path loss total value of each SFP.So, when ALTO Server returns the path loss total value of each SFP, this optimization device also includes：
First comparison module, the path loss total value for each SFP in a plurality of SFP to acquisition is compared, and obtains the minimum corresponding SFP of path loss total value.
Specifically, in embodiments of the present invention, sending module 703 specifically for：Inquiry request is written in JSON form, ALTO agreement is optimized by application layer traffic and optimizes, to application layer traffic, the inquiry request that server A LTO Server sends each SFP path loss in a plurality of SFP of inquiry.
Wherein, when inquiry is written in JSON form this sending module 703, first the routing information of a plurality of SFP needing in inquiry request to be queried is written in JSON form, wherein, routing information includes：The source address of SFP and the destination address corresponding with each business function SF, then in the JSON form of modification routing information, make JSON form support the destination address chain of a plurality of SFP, or make JSON form support the address chain corresponding with each SFP in a plurality of SFP.
Because current ALTO agreement only supports that the path loss that source address arrives some destination addresses is inquired about, therefore, when sending the inquiry request of each SFP path loss in a plurality of SFP of inquiry by ALTO agreement to ALTO Server, need ALTO agreement is expanded.Wherein, the modification to JSON form is mainly reflected in the expansion of ALTO agreement, that is, makes amended JSON form support the destination address chain of a plurality of SFP, or make JSON form support the address chain corresponding with each SFP in a plurality of SFP.
Wherein, when by way of the first modification：Make amended JSON form support the destination address chain of a plurality of SFP, when being expanded, specifically include：
Obtain the processing sequence to each SF setting in SFC；
According to processing sequence, successively the destination address group corresponding with each SF is written in JSON form, forms destination address chain, wherein, destination address group is made up of the destination address of the SF of multiple identical functions.
When mode is changed by second：Amended JSON form is made to support the address chain corresponding with each SFP in a plurality of SFP, when being expanded, specially：
The address chain corresponding with each SFP in a plurality of SFP is written in JSON form one by one, wherein, address chain is made up of the source address of each SFP and the destination address of each SF in SFP.
Being expanded to ALTO agreement by way of above two modification, and when the inquiry request of business chain control plane is sent to ALTO Server, can choose and corresponding expand mode according to self-demand.
By the optimization device in business chain path provided in an embodiment of the present invention so that being carried out information exchange between business chain control plane and ALTO Server it is achieved that business chain control plane selects to optimize to the overall situationization of SFP, improve the accuracy of path optimization.And in business chain control plane after obtaining optimum SFP, datum plane can be directly handed down to, the forwarding that SFF only need to execute business chain control plane requires, calculating need not further be optimized, and then simplify the algorithm of datum plane, decrease the calculating time of datum plane, accelerate business forwarding speed.
Example IV
According to another aspect of the present invention, additionally provide a kind of optimization device in business chain path, be applied to application layer traffic and optimize server A LTO Server, as shown in figure 8, this optimization device 800 includes：
Receiver module 801, for receiving business chain SFC that business chain control plane sets according to user, when obtaining a plurality of business chain path SFP realizing SFC, the inquiry request of the inquiry SFP path loss total value situation of transmission；
Computing module 803, for according to inquiry request, being calculated the path loss total value after each business function SF tandem paths in each SFP in a plurality of SFP, and returns Query Result to business chain control plane.
Because ALTO Server is when returning Query Result, need the requirement of the inquiry request of transmission according to business chain control plane to return, the minimum SFP of total value can be lost with return path, or the path loss total value of each SFP.When ALTO Server return path is lost the minimum corresponding SFP of total value, this optimization device also includes：
Second comparison module, the path loss total value for each SFP in a plurality of SFP to acquisition is compared, and obtains the minimum corresponding SFP of path loss total value, and the information of corresponding SFP is returned to business chain control plane as Query Result.
Specifically, as shown in figure 9, in embodiments of the present invention, computing module 803 specifically includes：
Query unit 8031, for according to inquiry request, query path attrition table, obtaining the path loss values of mutually transmission between the source address destination address corresponding with the SF of each identical services function in SFP；
Addition unit 8033, for being added the path loss values realizing each SF in SFC, obtains the path loss total value after each SF tandem paths in each SFP in a plurality of SFP, and wherein, path loss total value is relative loss factor value.
Wherein, when calculating the path loss total value of each SFP, due to the introducing of NFV (Network Function Virtualization, network function virtualizes) technology, increased the calculative strategy calculating path loss total value.Therefore, for obtaining more selectivitys of optimal path offer it is ensured that the accuracy of path optimization.
By the optimization device in business chain path provided in an embodiment of the present invention, the path loss total value of each SFP of a plurality of SFP can be calculated, and then acquisition approach is lost the minimum corresponding SFP of total value, and return to business chain control plane.Therefore, optimization device by business chain path provided in an embodiment of the present invention, make to be carried out information exchange between business chain control plane and ALTO Server, it is achieved that business chain control plane selects to optimize to the overall situationization of SFP, to improve the accuracy of path optimization.
Above is the preferred embodiment of the present invention it should be pointed out that for the ordinary person of the art, can also make some improvements and modifications under the premise of the principle without departing from the present invention, these improvements and modifications are also within the scope of the present invention.
Claims (18)
1. a kind of optimization method in business chain path, is applied to business chain control plane it is characterised in that institute
State optimization method to include：
Business chain SFC being set according to user, obtains a plurality of business chain path SFP realizing described SFC；
Optimize server A LTO Server to application layer traffic and send the described SFP path loss total value feelings of inquiry
The inquiry request of condition；
Receive the Query Result that described ALTO Server returns, according to described Query Result, by described SFP
The minimum SFP of path loss total value is defined as realizing the optimum SFP of described SFC.
2. optimization method as claimed in claim 1 is it is characterised in that described reception described ALTO Server
In the Query Result step returning, described Query Result includes the road of each SFP in described a plurality of SFP
Footpath is lost total value, wherein, after receiving the step of Query Result that described ALTO Server returns, described
Optimization method also includes：
The path loss total value of each SFP in the described a plurality of SFP obtaining is compared, obtains institute
State the minimum corresponding SFP of path loss total value.
3. optimization method as claimed in claim 1 is it is characterised in that described take to application layer traffic optimization
The step that business device ALTO Server sends the inquiry request inquiring about described SFP path loss total value situation is concrete
For：
Described inquiry request is written in JSON form, by application layer traffic optimize ALTO agreement to
Application layer traffic optimizes server A LTO Server and sends each SFP path damage in a plurality of SFP of inquiry
The inquiry request of consumption.
4. optimization method as claimed in claim 3 is it is characterised in that described write described inquiry request
During in JSON form, specifically include：
The routing information needing a plurality of SFP being queried in described inquiry request is written to described JSON lattice
In formula, wherein, described routing information includes：The source address of SFP and corresponding with each business function SF
Destination address；
Change the JSON form of described routing information, make described JSON form support described a plurality of SFP's
Destination address chain, or so that described JSON form is supported and each SFP phase in described a plurality of SFP
Corresponding address chain.
5. optimization method as claimed in claim 4 is it is characterised in that make described JSON form support institute
State a plurality of SFP destination address chain when, specifically include：
Obtain the processing sequence to each SF setting in described SFC；
According to described processing sequence, successively the destination address group corresponding with each SF is written to JSON lattice
In formula, formed destination address chain, wherein, described destination address group by multiple identical functions SF purpose
Address forms.
6. optimization method as claimed in claim 4 it is characterised in that make described JSON form support with
The corresponding address chain of each SFP in described a plurality of SFP, specially：
The address chain corresponding with each SFP in described a plurality of SFP is written to JSON lattice one by one
In formula, wherein, the purpose of the source address by each SFP for the described address chain and each SF in described SFP
Address forms.
7. a kind of optimization method in business chain path, is applied to application layer traffic and optimizes server A LTO
Server is it is characterised in that described optimization method includes：
Receive business chain SFC that business chain control plane sets according to user, acquisition is a plurality of to realize described SFC
Business chain path SFP when, transmission inquiry described SFP path loss total value situation inquiry request；
According to described inquiry request, it is calculated each business function in each SFP in described a plurality of SFP
Path loss total value after SF tandem paths, and return Query Result to described business chain control plane.
8. optimization method as claimed in claim 7 is it is characterised in that described be calculated described a plurality of SFP
In after the step of path loss total value after each business function SF tandem paths in each SFP, described
Optimization method also includes：
The path loss total value of each SFP in the described a plurality of SFP obtaining is compared, obtains road
Footpath is lost the minimum corresponding SFP of total value, the information of described corresponding SFP is returned to described as Query Result
Business chain control plane.
9. optimization method as claimed in claim 7 it is characterised in that described according to described inquiry request,
It is calculated the path loss after each business function SF tandem paths in each SFP in described a plurality of SFP
The step of total value specifically includes：
According to described inquiry request, query path attrition table, obtain source address in described SFP identical with each
The path loss values of mutually transmission between the corresponding destination address of the SF of business function；
The path loss values realizing each SF in described SFC are added, obtain each in described a plurality of SFP
Path loss total value after each SF tandem paths in SFP, wherein, described path loss total value is relatively to damage
Consumption value.
10. a kind of optimization device in business chain path, be applied to business chain control plane it is characterised in that
Described optimization device includes：
Acquisition module, for business chain SFC being set according to user, acquisition is a plurality of to realize described SFC's
Business chain path SFP；
Sending module, sends the described SFP of inquiry for optimizing server A LTO Server to application layer traffic
The inquiry request of path loss total value situation；
Determining module, for receiving the Query Result that described ALTO Server returns, according to described inquiry knot
Really, the minimum SFP of described SFP path loss total value is defined as realizing the optimum SFP of described SFC.
11. as claimed in claim 10 optimize devices it is characterised in that described Query Result include described
The path loss total value of each SFP in a plurality of SFP, described optimization device also includes：
First comparison module, the path loss for each SFP in the described a plurality of SFP to acquisition is total
Value is compared, and obtains the minimum corresponding SFP of described path loss total value.
12. as claimed in claim 10 optimize devices it is characterised in that described sending module specifically for：
Described inquiry request is written in JSON form, ALTO agreement is optimized to application by application layer traffic
Layer flow optimization server A LTO Server sends and inquires about each SFP path loss in a plurality of SFP
Inquiry request.
13. devices that optimize as claimed in claim 12 are it is characterised in that described sending module is looked into described
When inquiry request is written in JSON form, specifically include：
The routing information needing a plurality of SFP being queried in described inquiry request is written to described JSON lattice
In formula, wherein, described routing information includes：The source address of SFP and corresponding with each business function SF
Destination address；
Change the JSON form of described routing information, make described JSON form support described a plurality of SFP's
Destination address chain, or so that described JSON form is supported and each SFP phase in described a plurality of SFP
Corresponding address chain.
14. optimization devices as claimed in claim 13 are it is characterised in that make described JSON form support
During the destination address chain of described a plurality of SFP, specifically include：
Obtain the processing sequence to each SF setting in described SFC；
According to described processing sequence, successively the destination address group corresponding with each SF is written to JSON lattice
In formula, formed destination address chain, wherein, described destination address group by multiple identical functions SF purpose
Address forms.
15. optimization devices as claimed in claim 13 are it is characterised in that make described JSON form support
The address chain corresponding with each SFP in described a plurality of SFP, specially：
The address chain corresponding with each SFP in described a plurality of SFP is written to JSON lattice one by one
In formula, wherein, the purpose of the source address by each SFP for the described address chain and each SF in described SFP
Address forms.
A kind of 16. optimization devices in business chain path, are applied to application layer traffic and optimize server A LTO
Server is it is characterised in that described optimization device includes：
Receiver module, for receiving business chain SFC that business chain control plane sets according to user, obtains many
When bar realizes the business chain path SFP of described SFC, the inquiry described SFP path loss total value feelings of transmission
The inquiry request of condition；
Computing module, for according to described inquiry request, being calculated each SFP in described a plurality of SFP
In path loss total value after each business function SF tandem paths, and return to described business chain control plane
Query Result.
17. devices that optimize as claimed in claim 16 are it is characterised in that described optimization device also includes：
Second comparison module, the path loss for each SFP in the described a plurality of SFP to acquisition is total
Value is compared, and obtains the minimum corresponding SFP of path loss total value, using the information of described corresponding SFP as
Query Result returns to described business chain control plane.
18. devices that optimize as claimed in claim 16 are it is characterised in that described computing module specifically includes：
Query unit, for according to described inquiry request, query path attrition table, obtaining in described SFP
The path loss values of mutually transmission between the source address destination address corresponding with the SF of each identical services function；
Addition unit, for being added the path loss values realizing each SF in described SFC, obtains described many
Path loss total value after each SF tandem paths in each SFP in bar SFP, wherein, described path is damaged
Consumption total value is relative loss factor value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510467846.0A CN106411553B (en) | 2015-08-03 | 2015-08-03 | Method and device for optimizing service chain path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510467846.0A CN106411553B (en) | 2015-08-03 | 2015-08-03 | Method and device for optimizing service chain path |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106411553A true CN106411553A (en) | 2017-02-15 |
| CN106411553B CN106411553B (en) | 2020-01-07 |
Family
ID=58007767
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510467846.0A Active CN106411553B (en) | 2015-08-03 | 2015-08-03 | Method and device for optimizing service chain path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106411553B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107395506A (en) * | 2017-09-07 | 2017-11-24 | 电子科技大学 | A kind of service function chain dispositions method of propagation delay time optimization |
| CN108768736A (en) * | 2018-06-05 | 2018-11-06 | 中国人民解放军国防科技大学 | Optimization method of hybrid service function chain embedding cost |
| CN111314220A (en) * | 2018-12-11 | 2020-06-19 | 中国电信股份有限公司 | Method and system for minimizing SFC time delay |
| WO2022036764A1 (en) * | 2020-08-20 | 2022-02-24 | Huawei Technologies Co., Ltd. | Method and apparatus for protecting stateful service function paths |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101969458A (en) * | 2010-11-26 | 2011-02-09 | 西安电子科技大学 | P2P traffic optimization method supportive of hierarchical network topology |
| CN102546820A (en) * | 2012-02-16 | 2012-07-04 | 华为技术有限公司 | Transmission optimization method, and mapping information storage method, device and system |
| CN102571557A (en) * | 2010-12-01 | 2012-07-11 | 丛林网络公司 | Dynamically generating application-layer traffic optimization protocol maps |
| CN104270312A (en) * | 2014-09-25 | 2015-01-07 | 东北大学 | Relay path allocation system and method supporting flow optimization and application awareness |
-
2015
- 2015-08-03 CN CN201510467846.0A patent/CN106411553B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101969458A (en) * | 2010-11-26 | 2011-02-09 | 西安电子科技大学 | P2P traffic optimization method supportive of hierarchical network topology |
| CN102571557A (en) * | 2010-12-01 | 2012-07-11 | 丛林网络公司 | Dynamically generating application-layer traffic optimization protocol maps |
| CN102546820A (en) * | 2012-02-16 | 2012-07-04 | 华为技术有限公司 | Transmission optimization method, and mapping information storage method, device and system |
| CN104270312A (en) * | 2014-09-25 | 2015-01-07 | 东北大学 | Relay path allocation system and method supporting flow optimization and application awareness |
Non-Patent Citations (1)
| Title |
|---|
| INTERDIGITAL COMMUNICAITON: ""ALTO server in IMS P2P CDS"", 《3GPP S2-113483》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107395506A (en) * | 2017-09-07 | 2017-11-24 | 电子科技大学 | A kind of service function chain dispositions method of propagation delay time optimization |
| CN107395506B (en) * | 2017-09-07 | 2020-04-21 | 电子科技大学 | Service function chain deployment method for optimizing transmission delay |
| CN108768736A (en) * | 2018-06-05 | 2018-11-06 | 中国人民解放军国防科技大学 | Optimization method of hybrid service function chain embedding cost |
| CN108768736B (en) * | 2018-06-05 | 2021-04-23 | 中国人民解放军国防科技大学 | Optimization method of hybrid service function chain embedding cost |
| CN111314220A (en) * | 2018-12-11 | 2020-06-19 | 中国电信股份有限公司 | Method and system for minimizing SFC time delay |
| CN111314220B (en) * | 2018-12-11 | 2022-05-17 | 中国电信股份有限公司 | Method and system for minimizing SFC time delay |
| WO2022036764A1 (en) * | 2020-08-20 | 2022-02-24 | Huawei Technologies Co., Ltd. | Method and apparatus for protecting stateful service function paths |
| US11677614B2 (en) | 2020-08-20 | 2023-06-13 | Huawei Technologies Co., Ltd. | Method and apparatus for protecting stateful service function paths |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106411553B (en) | 2020-01-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11343152B2 (en) | Traffic management for smart network interface cards | |
| EP3300316B1 (en) | Deterministic controller-based path query | |
| US20190089651A1 (en) | Systems and methods for providing container attributes as part of oam techniques | |
| CN107465590B (en) | Network infrastructure system, method of routing network traffic and computer readable medium | |
| US9325609B2 (en) | Segmented source routing in a network | |
| US8873567B1 (en) | Providing routing information to support routing by port groups via corresponding network paths | |
| US10333845B2 (en) | Forwarding data packets | |
| CN104780088A (en) | Service message transmission method and equipment | |
| CN102577256A (en) | Method and apparatus for transparent cloud computing with a virtualized network infrastructure | |
| CN104038425B (en) | The method and apparatus for forwarding ether network packet | |
| CN104168209B (en) | Multiple access SDN message forwarding method and controller | |
| US9929954B2 (en) | Hash-based overlay routing architecture for information centric networks | |
| US10084701B2 (en) | Packet relaying method and non-transitory computer-readable recording medium | |
| CN107547391A (en) | A kind of message transmitting method and device | |
| US20150163072A1 (en) | Virtual Port Extender | |
| CN102857414A (en) | Forwarding table writing method and device and message forwarding method and device | |
| US20200328974A1 (en) | Dynamic forward information base prefix optimization | |
| CN106411553A (en) | Optimization method of service chain path and apparatus thereof | |
| CN109660578A (en) | CDN's returns source processing method and processing device, system | |
| CN105791153A (en) | Service traffic scheduling method and system, traffic controller and network edge device | |
| US11050655B2 (en) | Route information distribution through cloud controller | |
| US20110222538A1 (en) | Method and System for L3 Bridging Using L3-To-L2 Mapping Database | |
| US20240039847A1 (en) | Highly-available host networking with active-active or active-backup traffic load-balancing | |
| US20180026933A1 (en) | Service aware label address resolution protocol switched path instantiation | |
| US20140269686A1 (en) | Virtual router and switch |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |