CN106411553B - Method and device for optimizing service chain path - Google Patents

Method and device for optimizing service chain path Download PDF

Info

Publication number
CN106411553B
CN106411553B CN201510467846.0A CN201510467846A CN106411553B CN 106411553 B CN106411553 B CN 106411553B CN 201510467846 A CN201510467846 A CN 201510467846A CN 106411553 B CN106411553 B CN 106411553B
Authority
CN
China
Prior art keywords
sfp
path loss
sfps
service chain
loss value
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201510467846.0A
Other languages
Chinese (zh)
Other versions
CN106411553A (en
Inventor
付乔
曾宪超
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Mobile Communications Group Co Ltd
Original Assignee
China Mobile Communications Group Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China Mobile Communications Group Co Ltd filed Critical China Mobile Communications Group Co Ltd
Priority to CN201510467846.0A priority Critical patent/CN106411553B/en
Publication of CN106411553A publication Critical patent/CN106411553A/en
Application granted granted Critical
Publication of CN106411553B publication Critical patent/CN106411553B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12Discovery 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 a method and a device for optimizing a service chain path, wherein the method for optimizing the service chain path comprises the following steps: acquiring a plurality of service chain paths SFP for realizing the SFC according to the service chain SFC set by a user; sending a query request for querying the SFP path loss total value condition to an application layer traffic optimization Server (ALTO Server); and receiving a query result returned by the ALTO Server, and determining the SFP with the minimum total path loss value in the SFP as the optimal SFP for realizing the SFC according to the query result. The method for optimizing the service chain path provided by the invention can determine the SFP with the minimum total path loss value in a plurality of SFPs as the optimal SFP for realizing the SFC set by the user according to the total path loss value condition of the service chain path through the information interaction between the service chain control plane and the ALTO Server, thereby realizing the global selection optimization of the service chain control plane to the SFP, not only having high optimization accuracy, but also simplifying the algorithm of the data plane, further reducing the calculation time of the data plane and accelerating the service forwarding speed.

Description

Method and device for optimizing service chain path
Technical Field
The present invention relates to the field of data transmission technologies, and in particular, to a method and an apparatus for optimizing a service link path.
Background
ALTO (Application-Layer Traffic Optimization) is a protocol that provides network information to applications at the Application Layer. The network information provided by ALTO includes network topology, routing rules, and path loss, among others. In the overall system architecture for ALTO as shown in fig. 1, the ALTO Server stores network information that ALTO may provide. The ALTO Client determines a suitable Server through the ALTO protocol and requests the required network information from the Server using the ALTO protocol. For a given network, the ALTO Server maintains a loss table that defines the path loss from an origination point to a destination point in the network. Currently, application scenarios of ALTO include a P2P Network (Peer to Peer Network), a CDN Network (Content Delivery Network), and the like.
A Service chain refers to a group of ordered SFs (Service functions) that a network operator usually needs to use when providing network access to an end user, such as firewalls, packet filtering, load balancing, transport proxies, and so on. An ordered set of SFs through which user traffic passes is called an SFC (Service Function Chain), and an SFC Service Chain is instantiated by selecting an SFP (Service Function Path) formed by a particular SF at a particular network node.
The SFC architecture includes an SFF (Service Function Forwarder), an SCF (Service Classification Function), and multiple SFs. Specifically, the SFC architecture is shown in fig. 2. The SCF is responsible for classifying the arriving services, the SFF marks the labels of the subsequent service chain paths, namely SFC-headers, for each stream according to the classification information of the SCF, and each service enters a service chain domain. Each service firstly enters the first SF in the service chain path according to the label marked on the SFF, and after the SF finishes the service processing, the SF returns to the SFF. And the SFF forwards the service to the second SF on the SF path according to the SFC-header, and the like.
The current SFC optimization algorithm mainly focuses on optimization of partial data packets in the data plane, and lacks global selection optimization of SFC, and selection of SFP determines the quality of access service provided by a network operator to an end user to a certain extent. Therefore, the existing optimization method has low optimization accuracy and the forwarding speed of the SFF is slow.
Disclosure of Invention
In order to overcome the technical problem, the invention provides a method and a device for optimizing a service chain path, which realize the global selection optimization of a service chain control plane to SFP and accelerate the service forwarding speed through the information interaction between the service chain control plane and an ALTO Server.
In order to solve the technical problems, the invention adopts the following technical scheme:
according to an aspect of the present invention, there is provided a method for optimizing a service link path, which is applied to a service link control plane, the method including:
acquiring a plurality of service chain paths SFP for realizing the SFC according to the service chain SFC set by a user;
sending a query request for querying the SFP path loss total value condition to an application layer traffic optimization Server (ALTO Server);
and receiving a query result returned by the ALTO Server, and determining the SFP with the minimum total path loss value in the SFP as the optimal SFP for realizing the SFC according to the query result.
Optionally, in the step of receiving a query result returned by the ALTO Server, the query result includes a total path loss value of each of the SFPs, and after the step of receiving the query result returned by the ALTO Server, the optimization method further includes:
and comparing the obtained total path loss value of each SFP in the plurality of SFPs to obtain the corresponding SFP with the minimum total path loss value.
Optionally, the step of sending, to the application layer traffic optimization Server ALTO Server, a query request for querying a condition of the SFP path loss total value specifically includes:
and writing the query request into a JSON format, and sending a query request for querying the path loss of each SFP in a plurality of SFPs to an application layer traffic optimization Server (ALTO Server) through an Application Layer Traffic Optimization (ALTO) protocol.
Optionally, when the query request is written into the JSON format, the method specifically includes:
writing path information of a plurality of SFPs to be queried in the query request into the JSON format, wherein the path information comprises: a source address of the SFP and a destination address corresponding to each service function SF;
and modifying the JSON format of the path information to enable the JSON format to support the destination address chains of the plurality of SFPs, or to enable the JSON format to support the address chains corresponding to each SFP in the plurality of SFPs.
Optionally, when the JSON format supports the destination address chains of the multiple SFPs, the method specifically includes:
acquiring a processing sequence set in the SFC for each SF;
and according to the processing sequence, sequentially writing the destination address group corresponding to each SF into a JSON format to form a destination address chain, wherein the destination address group consists of destination addresses of multiple SFs with the same function.
Optionally, the JSON format is enabled to support an address chain corresponding to each of the plurality of SFPs, specifically:
and writing the address chain corresponding to each SFP in the plurality of SFPs into a JSON format one by one, wherein the address chain consists of a source address of each SFP and a destination address of each SF in the SFP.
According to another aspect of the present invention, there is also provided a method for optimizing a traffic chain path, applied to an application layer traffic optimization Server ALTO Server, the method including:
receiving a query request which is sent by a service chain control plane to query the total loss value condition of a service chain path (SFP) when a plurality of service chain paths (SFPs) for realizing the SFC are acquired by the service chain control plane according to the service chain (SFC) set by a user;
and according to the query request, calculating to obtain a total path loss value after each service function SF serial path in each SFP in the plurality of SFPs, and returning a query result to the service chain control plane.
Optionally, after the step of calculating a total path loss value after each service function SF serial path in each of the SFPs, the optimization method further includes:
and comparing the obtained total path loss value of each SFP in the plurality of SFPs to obtain the corresponding SFP with the minimum total path loss value, and returning the information of the corresponding SFP as a query result to the service chain control plane.
Optionally, the step of calculating, according to the query request, a total path loss value after each service function SF serial path in each of the SFPs includes:
inquiring a path loss table according to the inquiry request, and acquiring path loss values transmitted between a source address in the SFP and a destination address corresponding to the SF with the same service function;
and adding the path loss values of the SFCs to obtain the total path loss value after the SFPs in each SFP are connected with the paths in series, wherein the total path loss value is a relative loss value.
According to another aspect of the present invention, there is also provided an optimization apparatus for a service chain path, applied to a service chain control plane, the optimization apparatus including:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring a plurality of service chain paths SFP for realizing the SFC according to the service chain SFC set by a user;
a sending module, configured to send a query request for querying the SFP path loss total value to an application layer traffic optimization Server ALTO Server;
and the determining module is used for receiving the query result returned by the ALTO Server and determining the SFP with the minimum total path loss value in the SFP as the optimal SFP for realizing the SFC according to the query result.
Optionally, the query result includes a total path loss value of each of the SFPs, and the optimization apparatus further includes:
and the first comparing module is used for comparing the total path loss value of each SFP in the multiple SFPs to obtain the corresponding SFP with the minimum total path loss value.
Optionally, the sending module is specifically configured to: and writing the query request into a JSON format, and sending a query request for querying the path loss of each SFP in a plurality of SFPs to an application layer traffic optimization Server (ALTO Server) through an Application Layer Traffic Optimization (ALTO) protocol.
Optionally, when the sending module writes the query request into the JSON format, the method specifically includes:
writing path information of a plurality of SFPs to be queried in the query request into the JSON format, wherein the path information comprises: a source address of the SFP and a destination address corresponding to each service function SF;
and modifying the JSON format of the path information to enable the JSON format to support the destination address chains of the plurality of SFPs, or to enable the JSON format to support the address chains corresponding to each SFP in the plurality of SFPs.
Optionally, when the JSON format supports the destination address chains of the multiple SFPs, the method specifically includes:
acquiring a processing sequence set in the SFC for each SF;
and according to the processing sequence, sequentially writing a destination address group corresponding to each SF into a JSON format to form a destination address chain, wherein the destination address group consists of destination addresses of multiple SFs with the same function.
Optionally, the JSON format is enabled to support an address chain corresponding to each of the plurality of SFPs, specifically:
and writing the address chain corresponding to each SFP in the plurality of SFPs into a JSON format one by one, wherein the address chain consists of a source address of each SFP and a destination address of each SF in the SFP.
According to another aspect of the present invention, there is also provided an optimization apparatus for a traffic chain path, applied to an application layer traffic optimization Server ALTO Server, the optimization apparatus including:
a receiving module, configured to receive a service chain control plane, and obtain, according to a service chain SFC set by a user, multiple query requests for querying a total loss value of a service chain path SFP when the SFC is implemented;
and the calculation module is used for calculating a total path loss value after each service function SF serial path in each SFP in the plurality of SFPs according to the query request and returning a query result to the service chain control plane.
Optionally, the optimization apparatus further includes:
and the second comparison module is used for comparing the obtained total path loss value of each SFP in the plurality of SFPs to obtain the corresponding SFP with the minimum total path loss value, and returning the information of the corresponding SFP serving as a query result to the service chain control plane.
Optionally, the calculation module specifically includes:
a query unit, configured to query a path loss table according to the query request, and obtain a path loss value transmitted between a source address in the SFP and a destination address corresponding to an SF of the same service function;
and the adding unit is used for adding the path loss values of the SFCs to obtain the total path loss value after the paths of the SFPs are connected in series in each SFP of the plurality of SFPs, wherein the total path loss value is a relative loss value.
The invention has the beneficial effects that:
in the method for optimizing the service chain path, firstly, a service chain control plane is required to send a query request to an ALTO Server, so that the ALTO Server queries the path loss total value condition of each SFP in a plurality of SFPs, and then the SFP with the minimum path loss total value in the SFP is determined as the optimal SFP for realizing SFC according to the query result returned by the ALTO Server. Therefore, the optimization method of the service chain path provided by the invention can carry out information interaction between the service chain control plane and the ALTOServer, realizes the global selection optimization of the service chain control plane to the SFP, and improves the accuracy of path optimization. In addition, after the service chain control plane obtains the optimal SFP, the service chain control plane can be directly issued to the data plane, the SFF only needs to execute the forwarding requirement of the service chain control plane, and further optimization calculation is not needed, so that the algorithm of the data plane is simplified, the calculation time of the data plane is reduced, and the service forwarding speed is accelerated.
Drawings
FIG. 1 shows an overall system architecture diagram for ALTO;
FIG. 2 shows a service chaining architecture diagram;
FIG. 3 is a flow chart of a method for optimizing a traffic chain path according to an embodiment of the present invention;
FIG. 4 is a planning diagram of a traffic chain path in an embodiment of the present invention;
FIG. 5 is a second flowchart of a method for optimizing a traffic link path according to an embodiment of the present invention;
FIG. 6 is a flow chart illustrating the calculation of a total pathloss value according to an embodiment of the present invention;
fig. 7 shows one of the block diagrams of the structure of the apparatus for optimizing a traffic chain path according to the embodiment of the present invention;
fig. 8 is a second block diagram of the apparatus for optimizing a traffic chain path according to the embodiment of the present invention; and
fig. 9 shows a block diagram of a computing module in an embodiment of the invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in detail with reference to the accompanying drawings and specific embodiments.
Example one
According to an aspect of the present invention, there is provided an optimization method of a service chain path, applied to a service chain control plane, as shown in fig. 3, the optimization method includes:
step S301, acquiring a plurality of service chain paths SFP for realizing SFC according to the service chain SFC set by a user;
step S303, sending a query request for querying the SFP path loss total value condition to an application layer traffic optimization Server (ALTO Server);
and S305, receiving a query result returned by the ALTO Server, and determining the SFP with the minimum total path loss value in the SFP as the optimal SFP for realizing the SFC according to the query result.
In the method for optimizing the service link path provided in the embodiment of the present invention, first, a service link control plane is required to serve as an ALTO user (ALTO Client) to send a query request to an ALTO Server, so that the ALTO Server queries a total path loss value of each SFP in a plurality of SFPs, and then, from a query result returned by the ALTO Server, an SFP with the smallest total path loss value in the SFPs is selected to be determined as an optimal SFP for implementing the SFC. Therefore, through information interaction between the service chain control plane and the ALTO Server, the overall selection optimization of the service chain control plane to the SFP is realized, and the accuracy of path optimization is improved. In addition, after the service chain control plane obtains the optimal SFP, the service chain control plane can be directly issued to the data plane, the SFF only needs to execute the forwarding requirement of the service chain control plane, further optimization calculation is not needed, the algorithm of the data plane is simplified, the calculation time of the data plane is further reduced, and the service forwarding speed is accelerated.
In this embodiment of the present invention, when the query result returned by the ALTO Server is the total pathloss value of each of the SFPs in the multiple SFPs, after the step of receiving the query result returned by the ALTO Server, the optimization method further includes:
and comparing the total path loss value of each SFP in the multiple SFPs to obtain the corresponding SFP with the minimum total path loss value.
Because the ALTO Server needs to return according to the requirement of the query request sent by the service chain control plane when returning the query result, the SFP with the minimum total path loss value or the total path loss value of each SFP may be returned. Therefore, when the ALTO Server returns the total path loss value of each SFP, the service chain control plane needs to compare the total path loss values of each SFP to obtain the corresponding SFP with the minimum total path loss value, which is used as the optimal SFP for implementing the SFC.
Specifically, in the embodiment of the present invention, the sending, to the application layer traffic optimization Server ALTO Server, a query request for querying the SFP path loss total value condition (step S303) specifically includes:
and writing the query request into a JSON format, and sending a query request for querying the path loss of each SFP in the multiple SFPs to an application layer traffic optimization Server (ALTO Server) through an Application Layer Traffic Optimization (ALTO) protocol.
The JSON format is a lightweight data exchange format, is easy to read and write, is easy to analyze and generate by a machine, and improves the network transmission rate.
Specifically, in the embodiment of the present invention, when writing the query request into the JSON format, path information of a plurality of SFPs that need to be queried in the query request is first written into the JSON format, where the path information includes: a source address of the SFP and a destination address corresponding to each service function SF; and then modifying the JSON format of the path information to enable the JSON format to support the destination address chain of a plurality of SFPs or enable the JSON format to support the address chain corresponding to each SFP in the plurality of SFPs.
The format of the existing ALTO protocol between the ALTO Client and the ALTO Server is as follows:
the JSON format described above indicates that the ALTO Client queries the ALTO Server for the path loss from the source address (192.0.2.2) to the two destination addresses (192.0.2.89 and 198.51.100.34). After receiving the query, the ALTO Server compares the two path losses according to the obtained Endpoint loss information and returns ALTO Client absolute or relative path loss information.
Because the current ALTO protocol only supports path loss query from a source address to a plurality of destination addresses, the ALTO protocol needs to be expanded when a query request for querying the path loss of each of a plurality of SFPs is sent to the ALTO Server through the ALTO protocol. The extension of the ALTO protocol is mainly embodied in the modification of the JSON format, namely the modified JSON format supports the destination address chain of a plurality of SFPs, or the JSON format supports the address chain corresponding to each SFP in the plurality of SFPs.
The two extensions are specifically described below with respect to the planning diagram of the traffic chain path shown in fig. 4. As can be seen from fig. 4, according to the current network situation, four SFPs can be determined, which are:
◆SFP 1:FW1—>DPI1
◆SFP 2:FW2—>DPI1
◆SFP 3:FW1—>DPI2
◆SFP 4:FW2—>DPI2
when the first modification mode is adopted: that is, the modified JSON format supports multiple destination address chains of SFPs, and when expanding, the method specifically includes:
acquiring a processing sequence set in the SFC for each SF;
and according to the processing sequence, sequentially writing the destination address group corresponding to each SF into the JSON format to form a destination address chain, wherein the destination address group consists of destination addresses of multiple SF with the same function.
Writing into a JSON format through a first modification mode, wherein:
Figure BDA0000773387210000091
wherein the first group of IPs (192.0.2.89 and 198.51.100.34) is a destination address of FW (Firewall), and the second group (203.0.113.45 and 295.1.67.3) is a destination address of DPI (Deep Packet Inspection). The JSON format indicates that the ALTO Server calculates the path loss from the source address to an IP in the first destination address group and then to an IP in the second destination address group according to the sequence sent from the service chain control plane. The ALTO Server needs to calculate the total path loss value of the path after the IP in each destination address group is sequentially arranged from the source address.
When the path planned in fig. 4 is processed, the sequence of SF processing is as follows: FW, DPI, and the sequence of the destination address group in the JSON format is also: FW and DPI. Therefore, the appearance order of the destination address group represents the order of the SFs in the SFC. Wherein, each destination address group contains SF with the same function and address information, and the IP number in different destination address groups is not always consistent.
When the second modification is adopted: that is, the modified JSON format supports an address chain corresponding to each of the multiple SFPs, and when expanding, the specific steps are as follows:
and writing an address chain corresponding to each SFP in the plurality of SFPs into the JSON format one by one, wherein the address chain consists of a source address of each SFP and a destination address of each SF in the SFP.
Writing into the JSON format through a second modification mode, wherein:
the second modification mode is different from the first modification mode in that: the second modification enumerates the source addresses and the respective destination addresses of all SFCs. The advantage of the second modification over the first modification is that if the service chain control plane only needs to know the loss of a certain service chain (not the service chain permutation and combination composed of all SFs), only the service chain needing to be known needs to be listed. The disadvantage is that the enumeration is more complicated, and when there is more SF, the enumeration is more complicated.
Therefore, the query request of the service chain control plane can be sent to the ALTO Server through the expanded ALTO protocol, and when the query request is sent, a corresponding expansion mode can be selected according to the self requirement.
Example two
According to another aspect of the present invention, there is also provided a method for optimizing a traffic chain path, applied to an application layer traffic optimization Server ALTO Server, as shown in fig. 5, the method includes:
step S501, receiving a query request for querying the total loss value condition of an SFP path, which is sent when a service chain control plane acquires a plurality of service chain paths SFP for realizing the SFC according to a service chain SFC set by a user;
step S503, according to the query request, calculating to obtain a total path loss value after each service function SF serial path in each SFP of the plurality of SFPs, and returning a query result to the service chain control plane.
In the method for optimizing a service link path provided in the embodiment of the present invention, after receiving a query request sent by a service link control plane, the ALTO Server calculates a total path loss value of each of a plurality of SFPs, then returns a specific condition of the total path loss value of each of the SFPs to the service link control plane, and obtains a corresponding SFP with the minimum total path loss value as an optimal SFP. Therefore, through information interaction between the service chain control plane and the ALTO Server, the service chain control plane can perform global selection optimization on the SFP, and the accuracy of path optimization is improved.
In the embodiment of the present invention, when returning the query result, the ALTO Server returns according to the requirement of the query request sent by the service chain control plane, and may return the SFP with the minimum total pathloss value, or the total pathloss value of each SFP. When the ALTO Server returns to the corresponding SFP with the minimum total loss value of the path, the optimization method further comprises the following steps:
and comparing the total path loss value of each SFP in the multiple SFPs to obtain the corresponding SFP with the minimum total path loss value, and returning the information of the corresponding SFP serving as a query result to the service chain control plane.
Specifically, in the embodiment of the present invention, as shown in fig. 6, calculating a total path loss value after obtaining serial paths of the service functions SF in each SFP of the multiple SFPs according to the query request (step S503) specifically includes:
step S5031, according to the query request, querying a path loss table to obtain a path loss value transmitted between a source address in the SFP and a destination address corresponding to the SF having the same service function;
step S5033, adding the path loss values of the SFCs to obtain a total path loss value after the serial path of the SFs in each SFP of the SFPs, where the total path loss value is a relative loss value.
Among them, with respect to the traffic chain path planning diagram shown in fig. 4, there is a path loss table shown below.
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
The path loss table can obtain the path loss values transmitted between the source address and the destination address corresponding to the SF of the same service function. According to the existing SFC implementation mode, SFC always goes from SFF to SF1, after SF1 processing is completed, the service needs to return SFF, and then goes from SFF to next SF 2. According to this calculation strategy, a path loss total value table corresponding to each SFP as shown below can be calculated.
SFP_ID SFP Total value of 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
As can be seen from the above table, the total path loss value of the SFP1 is small, so the ALTO Server may recommend the SFP1 as an optimal path to the traffic chain control plane, or return the specific case of the total path loss value of each of the SFPs to the traffic chain control plane.
However, due to the introduction of NFV (Network Function Virtualization) technology, the strategy of calculating the total value of the path loss may increase. For example, in the NFV scenario, some SFs may be virtual network elements located on the same hardware, and in this case, the traffic chain between such network elements may be switched only by using the virtual switch without going back to the SFF. At this time, the calculation of different traffic paths will change.
As can be seen from fig. 4, FW2 and DPI1 are located in two virtual network elements on one physical machine, and SFF 2 is a virtual switch. At this time, the path loss of FW2- > DPI will be significantly reduced because there is no need to go through FW2- > GW- > DPI 1. At this time, the ALTO server needs to know that FW2 and DPI1 as terminals are virtual devices and attributes located on one physical device, thereby obtaining a path loss table as shown below.
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
And calculating to obtain the total path loss value of each SFP according to the table, wherein the table of the total path loss values corresponding to each SFP is shown in the following table.
SFP_ID SFP Total value of path loss
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 can be seen from the above table, the total path loss value of the SFP2 is small, so the ALTO Server may recommend the SFP2 as an optimal path to the traffic chain control plane, or return the specific case of the total path loss value of each of the SFPs to the traffic chain control plane.
In summary, due to the introduction of the NFV technology, a calculation strategy for calculating a total path loss value is added, so that more selectivity is provided for obtaining an optimal path, and the accuracy of path optimization is ensured. In addition, the service chain control plane can directly send the optimal SFP to the data plane after obtaining the optimal SFP, and the SFF only needs to execute the forwarding requirement of the service chain control plane without further optimization calculation, thereby simplifying the algorithm of the data plane, further reducing the calculation time of the data plane and accelerating the service forwarding speed.
EXAMPLE III
According to another aspect of the present invention, there is provided an optimization apparatus for a service chain path, which is applied to a service chain control plane, as shown in fig. 7, the optimization apparatus 700 includes:
an obtaining module 701, configured to obtain multiple service chain paths SFP for implementing SFC according to a service chain SFC set by a user;
a sending module 703, configured to send a query request for querying an SFP path loss total value to an application layer traffic optimization Server ALTO Server;
and the determining module 705 is configured to receive a query result returned by the ALTO Server, and determine, according to the query result, an SFP with the smallest total path loss value in the SFPs as an optimal SFP for implementing the SFC.
When returning the query result, the ALTO Server needs to return according to the requirement of the query request sent by the service chain control plane, and may return the SFP with the minimum total path loss value or the total path loss value of each SFP. Therefore, when the ALTO Server returns the total value of the path loss for each SFP, the optimizing means further comprises:
and the first comparison module is used for comparing the total path loss value of each SFP in the multiple obtained SFPs to obtain the corresponding SFP with the minimum total path loss value.
Specifically, in the embodiment of the present invention, the sending module 703 is specifically configured to: and writing the query request into a JSON format, and sending a query request for querying the path loss of each SFP in the multiple SFPs to an application layer traffic optimization Server (ALTO Server) through an Application Layer Traffic Optimization (ALTO) protocol.
When the sending module 703 writes the query into the JSON format, first, the path information of the multiple SFPs that need to be queried in the query request is written into the JSON format, where the path information includes: the source address of the SFP and the destination address corresponding to each service function SF are then modified in the JSON format of the path information so that the JSON format supports a plurality of destination address chains of the SFP, or so that the JSON format supports an address chain corresponding to each of the plurality of SFPs.
Because the current ALTO protocol only supports path loss query from a source address to a plurality of destination addresses, the ALTO protocol needs to be expanded when a query request for querying the path loss of each of a plurality of SFPs is sent to the ALTO Server through the ALTO protocol. The extension of the ALTO protocol is mainly embodied in the modification of the JSON format, namely the modified JSON format supports the destination address chain of a plurality of SFPs, or the JSON format supports the address chain corresponding to each SFP in the plurality of SFPs.
Wherein, when the first modification mode is adopted: that is, the modified JSON format supports multiple destination address chains of SFPs, and when expanding, the method specifically includes:
acquiring a processing sequence set in the SFC for each SF;
and according to the processing sequence, sequentially writing the destination address group corresponding to each SF into the JSON format to form a destination address chain, wherein the destination address group consists of destination addresses of multiple SF with the same function.
When the second modification is adopted: that is, the modified JSON format supports an address chain corresponding to each of the multiple SFPs, and when expanding, the specific steps are as follows:
and writing an address chain corresponding to each SFP in the plurality of SFPs into the JSON format one by one, wherein the address chain consists of a source address of each SFP and a destination address of each SF in the SFP.
When the ALTO protocol is expanded through the two modification modes and the query request of the service chain control plane is sent to the ALTO Server, the corresponding expansion mode can be selected according to the self requirement.
The optimization device of the service chain path provided by the embodiment of the invention enables information interaction between the service chain control plane and the ALTO Server, realizes the global selection optimization of the service chain control plane to the SFP, and improves the accuracy of path optimization. And after the service chain control plane obtains the optimal SFP, the SFP can be directly issued to the data plane, and the SFF only needs to execute the forwarding requirement of the service chain control plane without further optimization calculation, thereby simplifying the algorithm of the data plane, reducing the calculation time of the data plane and accelerating the service forwarding speed.
Example four
According to another aspect of the present invention, there is also provided an optimization apparatus for a traffic chain path, applied to an application layer traffic optimization Server ALTO Server, as shown in fig. 8, where the optimization apparatus 800 includes:
a receiving module 801, configured to receive a query request for querying a total loss value condition of a service chain path SFP, sent when a service chain control plane obtains multiple service chain paths SFP implementing SFC according to a service chain SFC set by a user;
and the calculating module 803 is configured to calculate, according to the query request, a total path loss value after each service function SF serial path in each of the multiple SFPs, and return a query result to the service chain control plane.
Because the ALTO Server needs to return according to the requirement of the query request sent by the service chain control plane when returning the query result, the SFP with the minimum total path loss value or the total path loss value of each SFP may be returned. When the total value of the ALTOServer return path loss is minimum corresponding SFP, the optimizing device further comprises:
and the second comparison module is used for comparing the total path loss value of each SFP in the multiple obtained SFPs to obtain the corresponding SFP with the minimum total path loss value, and returning the information of the corresponding SFP serving as a query result to the service chain control plane.
Specifically, as shown in fig. 9, in the embodiment of the present invention, the calculating module 803 specifically includes:
a query unit 8031, configured to query the path loss table according to the query request, and obtain a path loss value transmitted between a source address in the SFP and a destination address corresponding to the SF of the same service function;
the adding unit 8033 is configured to add the path loss values of the SFCs to obtain a total path loss value after serial paths of the SFs in each of the SFPs, where the total path loss value is a relative loss value.
When the total path loss value of each SFP is calculated, due to the introduction of the NFV (Network Function Virtualization) technology, a calculation strategy for calculating the total path loss value is added. Therefore, more selectivity is provided for obtaining the optimal path, and the accuracy of path optimization is guaranteed.
By the optimization device for the service chain path provided by the embodiment of the invention, the total path loss value of each SFP of a plurality of SFPs can be calculated, so that the corresponding SFP with the minimum total path loss value is obtained and returned to the service chain control plane. Therefore, the optimization device of the service chain path provided by the embodiment of the invention enables information interaction between the service chain control plane and the ALTOServer, realizes the global selection optimization of the service chain control plane to the SFP, and improves the accuracy of path optimization.
The foregoing is a preferred embodiment of the present invention, and it should be noted that those skilled in the art can make various improvements and modifications without departing from the principle of the present invention, and those improvements and modifications are also within the scope of the present invention.

Claims (18)

1. A method for optimizing a service chain path is applied to a service chain control plane, and is characterized in that the method comprises the following steps:
acquiring a plurality of service chain paths SFP for realizing the SFC according to the service chain SFC set by a user;
sending a query request for querying the SFP path loss total value condition to an application layer traffic optimization Server (ALTO Server);
and receiving a query result returned by the ALTO Server, and determining the SFP with the minimum total path loss value in the SFP as the optimal SFP for realizing the SFC according to the query result.
2. The optimization method of claim 1, wherein in the step of receiving the query result returned by the ALTO Server, the query result includes a total path loss value for each of the plurality of SFPs, and wherein after the step of receiving the query result returned by the ALTO Server, the optimization method further comprises:
and comparing the obtained total path loss value of each SFP in the plurality of SFPs to obtain the corresponding SFP with the minimum total path loss value.
3. The optimization method according to claim 1, wherein the step of sending a query request for querying the SFP path loss total value to an application layer traffic optimization Server ALTO Server specifically comprises:
and writing the query request into a JSON format, and sending a query request for querying the path loss of each SFP in a plurality of SFPs to an application layer traffic optimization Server (ALTO Server) through an Application Layer Traffic Optimization (ALTO) protocol.
4. The optimization method according to claim 3, wherein the writing of the query request into the JSON format specifically comprises:
writing path information of a plurality of SFPs to be queried in the query request into the JSON format, wherein the path information comprises: a source address of the SFP and a destination address corresponding to each service function SF;
and modifying the JSON format of the path information to enable the JSON format to support the destination address chains of the plurality of SFPs, or to enable the JSON format to support the address chains corresponding to each SFP in the plurality of SFPs.
5. The optimization method of claim 4, wherein the enabling the JSON format to support the destination address chains of the plurality of SFPs specifically comprises:
acquiring a processing sequence set in the SFC for each SF;
and according to the processing sequence, sequentially writing the destination address group corresponding to each SF into a JSON format to form a destination address chain, wherein the destination address group consists of destination addresses of multiple SFs with the same function.
6. The optimization method of claim 4, wherein the JSON format is enabled to support an address chain corresponding to each of the plurality of SFPs by:
and writing the address chain corresponding to each SFP in the plurality of SFPs into a JSON format one by one, wherein the address chain consists of a source address of each SFP and a destination address of each SF in the SFP.
7. A method for optimizing a traffic chain path is applied to an application layer traffic optimization Server (ALTO Server), and is characterized in that the method comprises the following steps:
receiving a query request which is sent by a service chain control plane to query the total loss value condition of a service chain path (SFP) when a plurality of service chain paths (SFPs) for realizing the SFC are acquired by the service chain control plane according to the service chain (SFC) set by a user;
and according to the query request, calculating to obtain a total path loss value after each service function SF serial path in each SFP in the plurality of SFPs, and returning a query result to the service chain control plane.
8. The optimization method of claim 7, wherein after the step of calculating the total value of the path loss after the serial path of each service function SF in each of the plurality of SFPs, the optimization method further comprises:
and comparing the obtained total path loss value of each SFP in the plurality of SFPs to obtain the corresponding SFP with the minimum total path loss value, and returning the information of the corresponding SFP as a query result to the service chain control plane.
9. The optimization method of claim 7, wherein the step of calculating, according to the query request, a total value of path loss after each service function SF serial path in each of the plurality of SFPs specifically comprises:
inquiring a path loss table according to the inquiry request, and acquiring path loss values transmitted between a source address in the SFP and a destination address corresponding to the SF with the same service function;
and adding the path loss values of the SFCs to obtain the total path loss value after the SFPs in each SFP are connected with the paths in series, wherein the total path loss value is a relative loss value.
10. An optimization apparatus for a service chain path, applied to a service chain control plane, the optimization apparatus comprising:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring a plurality of service chain paths SFP for realizing the SFC according to the service chain SFC set by a user;
a sending module, configured to send a query request for querying the SFP path loss total value to an application layer traffic optimization Server ALTO Server;
and the determining module is used for receiving the query result returned by the ALTO Server and determining the SFP with the minimum total path loss value in the SFP as the optimal SFP for realizing the SFC according to the query result.
11. The optimization apparatus of claim 10, wherein the query result includes a total path loss value for each of the plurality of SFPs, the optimization apparatus further comprising:
and the first comparing module is used for comparing the total path loss value of each SFP in the multiple SFPs to obtain the corresponding SFP with the minimum total path loss value.
12. The optimization apparatus of claim 10, wherein the sending module is specifically configured to: and writing the query request into a JSON format, and sending a query request for querying the path loss of each SFP in a plurality of SFPs to an application layer traffic optimization server ALTOServer through an Application Layer Traffic Optimization (ALTO) protocol.
13. The optimization apparatus of claim 12, wherein the sending module, when writing the query request into the JSON format, specifically comprises:
writing path information of a plurality of SFPs to be queried in the query request into the JSON format, wherein the path information comprises: a source address of the SFP and a destination address corresponding to each service function SF;
and modifying the JSON format of the path information to enable the JSON format to support the destination address chains of the plurality of SFPs, or to enable the JSON format to support the address chains corresponding to each SFP in the plurality of SFPs.
14. The optimization apparatus of claim 13, wherein enabling the JSON format to support the destination address chains of the plurality of SFPs specifically comprises:
acquiring a processing sequence set in the SFC for each SF;
and according to the processing sequence, sequentially writing the destination address group corresponding to each SF into a JSON format to form a destination address chain, wherein the destination address group consists of destination addresses of multiple SFs with the same function.
15. The optimization apparatus of claim 13, wherein the JSON format is enabled to support an address chain corresponding to each of the plurality of SFPs by:
and writing the address chain corresponding to each SFP in the plurality of SFPs into a JSON format one by one, wherein the address chain consists of a source address of each SFP and a destination address of each SF in the SFP.
16. An optimization device of a traffic chain path, applied to an application layer traffic optimization Server (ALTO Server), the optimization device comprising:
a receiving module, configured to receive a service chain control plane, and obtain, according to a service chain SFC set by a user, multiple query requests for querying a total loss value of a service chain path SFP when the SFC is implemented;
and the calculation module is used for calculating a total path loss value after each service function SF serial path in each SFP in the plurality of SFPs according to the query request and returning a query result to the service chain control plane.
17. The optimization apparatus of claim 16, wherein the optimization apparatus further comprises:
and the second comparison module is used for comparing the obtained total path loss value of each SFP in the plurality of SFPs to obtain the corresponding SFP with the minimum total path loss value, and returning the information of the corresponding SFP serving as a query result to the service chain control plane.
18. The optimization apparatus of claim 16, wherein the calculation module specifically comprises:
a query unit, configured to query a path loss table according to the query request, and obtain a path loss value transmitted between a source address in the SFP and a destination address corresponding to an SF of the same service function;
and the adding unit is used for adding the path loss values of the SFCs to obtain the total path loss value after the paths of the SFPs are connected in series in each SFP of the plurality of SFPs, wherein the total path loss value is a relative loss value.
CN201510467846.0A 2015-08-03 2015-08-03 Method and device for optimizing service chain path Active CN106411553B (en)

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 CN106411553A (en) 2017-02-15
CN106411553B true 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)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107395506B (en) * 2017-09-07 2020-04-21 电子科技大学 Service function chain deployment method for optimizing transmission delay
CN108768736B (en) * 2018-06-05 2021-04-23 中国人民解放军国防科技大学 Optimization method of hybrid service function chain embedding cost
CN111314220B (en) * 2018-12-11 2022-05-17 中国电信股份有限公司 Method and system for minimizing SFC time delay
US11677614B2 (en) * 2020-08-20 2023-06-13 Huawei Technologies Co., Ltd. Method and apparatus for protecting stateful service function paths

Citations (4)

* Cited by examiner, † Cited by third party
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

Patent Citations (4)

* Cited by examiner, † Cited by third party
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)

* Cited by examiner, † Cited by third party
Title
"ALTO server in IMS P2P CDS";InterDigital Communicaiton;《3GPP s2-113483》;20110715;摘要,6.X *

Also Published As

Publication number Publication date
CN106411553A (en) 2017-02-15

Similar Documents

Publication Publication Date Title
CN107465590B (en) Network infrastructure system, method of routing network traffic and computer readable medium
EP3300316B1 (en) Deterministic controller-based path query
CN111107001B (en) Method for segment source route in network and storage medium
US8913613B2 (en) Method and system for classification and management of inter-blade network traffic in a blade server
US10263861B2 (en) Multi-path aware tracing and probing functionality at service topology layer
US10348646B2 (en) Two-stage port-channel resolution in a multistage fabric switch
US9608938B2 (en) Method and system for tracking and managing network flows
US8873567B1 (en) Providing routing information to support routing by port groups via corresponding network paths
CN107547391A (en) A kind of message transmitting method and device
CN104335537A (en) System and method for layer-2 multicast multipathing
CN106411553B (en) Method and device for optimizing service chain path
US9716592B1 (en) Traffic distribution over multiple paths in a network while maintaining flow affinity
CN102857414A (en) Forwarding table writing method and device and message forwarding method and device
US10084701B2 (en) Packet relaying method and non-transitory computer-readable recording medium
KR102059971B1 (en) Data routing method and apparatus
US20110110372A1 (en) Systems and methods to perform hybrid switching and routing functions
CN104038425A (en) Method and device for forwarding Ethernet packet
CN101599910B (en) Method and device for sending messages
US20180343194A1 (en) Network-aware routing in information centric networking
Hemalatha et al. Real time prefix matching based IP lookup and update mechanism for efficient routing in networks
US10229459B1 (en) Method and apparatus for routing in transaction management systems
CN108111422A (en) A kind of data high-speed multichannel retransmission method and device based on DPDK
CN106209554A (en) Message forwarding method and equipment across virtual expansible LAN
CN104038419A (en) Method for transmitting data packets in a data network from a plurality of network nodes
CN110636003A (en) Message forwarding method, device, system and computer readable storage medium

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