WO2018166249A1 - 一种网络业务传输的方法及系统 - Google Patents

一种网络业务传输的方法及系统 Download PDF

Info

Publication number
WO2018166249A1
WO2018166249A1 PCT/CN2017/115328 CN2017115328W WO2018166249A1 WO 2018166249 A1 WO2018166249 A1 WO 2018166249A1 CN 2017115328 W CN2017115328 W CN 2017115328W WO 2018166249 A1 WO2018166249 A1 WO 2018166249A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
network
network service
nodes
centripetality
Prior art date
Application number
PCT/CN2017/115328
Other languages
English (en)
French (fr)
Inventor
乔治·简波尼亚斯
徐宏
陈志堂
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2018166249A1 publication Critical patent/WO2018166249A1/zh
Priority to US16/569,239 priority Critical patent/US11252077B2/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/124—Shortest path evaluation using a combination of metrics
    • 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/08—Configuration management of networks or network elements
    • H04L41/0893—Assignment of logical groups to network elements
    • 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
    • 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
    • H04L41/122—Discovery or management of network topologies of virtualised topologies, e.g. software-defined networks [SDN] or network function virtualisation [NFV]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/24—Multipath
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion
    • H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation

Definitions

  • the present application relates to the field of communications technologies, and in particular, to a method and system for network traffic transmission.
  • the shortest transmission path between the source node and the sink node of the network service to be transmitted is usually determined based on the topology between the nodes in the network, and then the source node passes The shortest transmission path sends the network traffic that needs to be transmitted to the sink node.
  • the shortest transmission path between the source node and the sink node of the network service to be transmitted is directly determined. The calculation of the time is large and complicated.
  • a routing scheme of the segmentation route is proposed, that is, by determining one between the source node and the sink node. Or a plurality of segment nodes, wherein the segment node is an intermediate node on a transmission path through the source node and the sink node, and the transmission path between the source node and the sink node is divided into at least two segments.
  • the path then determines the nodes on each segmented path, but in the prior art, the segmentation node is determined and the traffic on each of the multiple paths consisting of the source node, the segment node, and the sink node is forwarded. It is more generalized to solve a unified optimization problem.
  • the optimization problem is a mixed problem of integer programming and linear programming. Therefore, the computational workload is still large, and it is difficult to calculate the result in a limited time.
  • the embodiments of the present invention provide a method and a system for transmitting network services, which are used to reduce the complexity of the planning of network service transmission paths existing in the prior art.
  • a method for network traffic transmission including:
  • the network topology information includes each node in the network and a connection relationship between the nodes, where the network service information includes traffic information of at least one network service to be transmitted, and is used to transmit at least one network service.
  • a source end node and a sink end node of each network service and then determining, according to network topology information and network source information, source node and sink node for transmitting each network service, respectively determining each node in the other node set
  • the centripetality of the node is used to indicate the possibility that the node passes through the shortest transmission path where the source end node and the sink end node are located.
  • the other node sets do not include the source end node and the sink end node, and the nodes in other node sets are a node in the network; and determining at least one segment node from the other node set according to the centripetality of each of the other node sets, wherein the segment node is an intermediate node that passes through the shortest transmission path of each network service; And according to at least one segment node, each network And the source node and the sink node determine at least one transmission path for respectively transmitting each network service; and finally determining, according to the traffic information of the at least one network service and the at least one transmission path for respectively transmitting each network service, respectively For transmitting at least each network service The traffic of a network service that needs to be transmitted on a transmission path.
  • the traffic of the transmitted network service on each transmission path is determined after determining the segmentation node in the present application, and the same segmentation node is shared between the transmission paths of the respective network services, it will be compared with the prior art.
  • the determination of the segmentation node and the determination of the traffic of the transmitted network service on each transmission path are unified to determine an optimization problem, which reduces the complexity of the network service transmission path planning to a certain extent.
  • the nodes in the other node set are sorted according to the size of the centripetality of the node to obtain the node ranked in the top K, and the node ranked in the top K is determined as the at least one point.
  • the node centripetality of the nodes in the other node sets satisfies the following expression:
  • V represents a set of all nodes in the network
  • v represents any one of the other node sets
  • other set of nodes includes each node except the source end node and the sink end node in the network
  • s represents that at least one is used for transmission.
  • a source node of a network service in the network service t is used to represent a sink node for receiving a network service
  • ⁇ (v) is used to represent the centripetality of the node of v
  • ⁇ st is used to represent s and t in the network.
  • the number of strips between the shortest transmission paths, ⁇ st (v) is used to indicate the number of strips of the shortest transmission path that v has passed in the shortest transmission path of ⁇ st .
  • the node centripetality of the nodes in the other node sets satisfies the following expression:
  • v represents any node in the other node set
  • V′ represents the other node set
  • the nodes included in the other node set are the shortest transmission path in the network for transmitting the respective network services, and the source node and the sink are excluded.
  • ⁇ (v) represents the centripetality of the nodes of v
  • v - represents the number of nodes connected to v in the network
  • v + represents the number of nodes connected to v out in the network.
  • the group centripetality of each node group included in the other node set satisfies the following expression:
  • V represents a set of all nodes in the network
  • C represents a node group in the other node set
  • other node sets include each node except the source end node and the sink end node in the network
  • s represents that at least one is used for transmission.
  • a source node of a network service in the network service t represents a sink node for receiving a network service
  • ⁇ (C) represents a group centripetality of C
  • ⁇ st represents a shortest transmission path between s and t in the network.
  • ⁇ st (C) represents the number of pieces in each of the node C included in the transmission path [sigma] st shortest path through bar and.
  • determining a traffic forwarding ratio of a network service that needs to be transmitted on at least one transmission path for transmitting each network service and determining, according to the determined traffic forwarding ratio and traffic information of at least one network service, A traffic for transmitting network traffic that needs to be transmitted on at least one transmission path of each network service.
  • At least one transmission path for transmitting each network service needs to be transmitted respectively.
  • the traffic forwarding ratio of the lost network service satisfies the following expression:
  • E is used to represent the edge set in the network
  • each edge of the edge set is used to indicate a relationship in which two nodes in the network are directly connected
  • e is used to represent an edge in the network
  • F is used to indicate at least one that needs to be transmitted.
  • the traffic information of the network service f is used to indicate the traffic information on the path for transmitting the network service
  • Tf is used to represent the set of paths for transmitting the respective network services
  • t is used to represent the path of one of the network services
  • S t is used to represent a set of segment paths for transmitting respective network services
  • the segment path is a path between the source node to the intermediate node or a path between the intermediate node and the sink node
  • s is used to represent the segment Path
  • P S is used to represent the set of shortest segmented paths
  • the shortest segmented path is the shortest path from the source node to the intermediate node, or the shortest path from the intermediate node to the sink node
  • p is used to represent the shortest segment path
  • x f t is used to indicate the traffic forwarding ratio
  • D f is used to represent the bandwidth requirement of the traffic information f
  • I p e is used to indicate the possibility that the edge e is one of the shortest
  • the traffic forwarding ratio is determined based on the above manner, on the basis of simplifying the operation, the possibility that the traffic in each transmission path in the network exceeds the maximum load is reduced, and the efficiency of network service transmission is greatly improved.
  • a system for network service transmission including:
  • the acquiring module is configured to obtain network topology information, where the network topology information includes a connection relationship between each node in the network and each node, where the network service information includes traffic information of at least one network service that needs to be transmitted, and is used for transmission. a source node and a sink node of each network service in at least one network service;
  • a segmentation node determining module configured to determine a centripetality of each node of the other node set according to the network topology information and the source end node and the sink end node included in the network service information for transmitting each network service, respectively
  • the centripetality is used to indicate the possibility that the node passes through the shortest transmission path where the source end node and the sink end node are located.
  • the other node sets do not include the source end node and the sink end node, and the nodes in other node sets are nodes in the network; And determining, according to centripetality of each of the other node sets, at least one segment node from the other node set, wherein the segment node is an intermediate node that passes through the shortest transmission path of each network service;
  • a service flow determining module configured to determine, according to at least one segment node, a source end node and a sink end node of each network service, at least one transmission path respectively used for transmitting each network service; according to traffic information and respectively of at least one network service At least one transmission path for transmitting each network service, and determining traffic for network traffic that needs to be transmitted on at least one transmission path for transmitting each network service.
  • the segment node determining module is specifically configured to sort the nodes in the other node sets according to the centripetality of the node to obtain the node ranked in the top K; and determine the node ranked in the top K as At least one segmentation node; wherein K is a positive integer greater than or equal to one.
  • the node centripetality of the nodes in the other node sets satisfies the following expression:
  • V represents a set of all nodes in the network
  • v represents any one of the other node sets
  • other set of nodes includes each node except the source end node and the sink end node in the network
  • s represents that at least one is used for transmission.
  • a source node of a network service in the network service t is used to represent a sink node for receiving a network service
  • ⁇ (v) is used to represent the centripetality of the node of v
  • ⁇ st is used to represent s and t in the network.
  • the number of strips between the shortest transmission paths, ⁇ st (v) is used to indicate the number of strips of the shortest transmission path that v has passed in the shortest transmission path of ⁇ st .
  • the node centripetality of the nodes in the other node sets satisfies the following expression:
  • v represents any node in the other node set
  • V′ represents the other node set
  • the nodes included in the other node set are the shortest transmission path in the network for transmitting the respective network services, and the source node and the sink are excluded.
  • ⁇ (v) represents the centripetality of the nodes of v
  • v - represents the number of nodes connected to v in the network
  • v + represents the number of nodes connected to v out in the network.
  • the segment node determining module is specifically configured to determine group centripetality of each node group included in another node set according to node centripetality of each node in the other node set, where the node group includes J nodes, and J is a positive integer greater than or equal to 1; and selects a group of nodes having the largest centripetality from each node group, and determines J nodes included in the group of nodes with the most centripetality as at least one point Segment node.
  • the group centripetality of each node group included in the other node set satisfies the following expression:
  • V represents a set of all nodes in the network
  • C represents a node group in the other node set
  • other node sets include each node except the source end node and the sink end node in the network
  • s represents that at least one is used for transmission.
  • a source node of a network service in the network service t represents a sink node for receiving a network service
  • ⁇ (C) represents a group centripetality of C
  • ⁇ st represents a shortest transmission path between s and t in the network.
  • the number of bars, ⁇ st (C) represents the sum of the number of paths that each node included in C passes in the shortest transmission path of ⁇ st .
  • the service flow determining module is specifically configured to: determine a traffic forwarding ratio of the network service that needs to be transmitted on the at least one transmission path for transmitting each network service, respectively, and according to the determined traffic forwarding ratio and at least The traffic information of a network service determines the traffic of the network service that needs to be transmitted on at least one transmission path for transmitting each network service.
  • the traffic forwarding ratio of the network service that needs to be transmitted on the at least one transmission path for transmitting each network service respectively satisfies the following expression:
  • E is used to represent the edge set in the network
  • each edge of the edge set is used to indicate a relationship in which two nodes in the network are directly connected
  • e is used to represent an edge in the network
  • F is used to indicate at least one that needs to be transmitted.
  • the traffic information of the network service f is used to indicate the traffic information on the path for transmitting the network service
  • Tf is used to represent the set of paths for transmitting the respective network services
  • t is used to represent the path of one of the network services
  • S t is used to represent a set of segment paths for transmitting respective network services
  • the segment path is a path between the source node to the intermediate node or a path between the intermediate node and the sink node
  • s is used to represent the segment Path
  • P S is used to represent the set of shortest segmented paths
  • the shortest segmented path is the shortest path from the source node to the intermediate node, or the shortest path from the intermediate node to the sink node
  • p is used to represent the shortest segment path
  • x f t is used to indicate the traffic forwarding ratio
  • D f is used to represent the bandwidth requirement of the traffic information f
  • I p e is used to indicate the possibility that the edge e is one of the shortest
  • FIG. 1 is a schematic flowchart of a method for transmitting network services according to an embodiment of the present application
  • FIG. 2 is a schematic diagram of a network topology structure according to an embodiment of the present application.
  • FIG. 3 is a schematic diagram of performance analysis of a network service according to an embodiment of the present application.
  • FIG. 4 is a schematic structural diagram of a system for network service transmission according to an embodiment of the present application.
  • FIG. 5 is a schematic structural diagram of hardware of a device for performing network service performance transmission according to an embodiment of the present disclosure.
  • the traffic of the transmitted network service on each transmission path is determined after determining the segmentation node in the present application, and the same segmentation node is shared between the transmission paths of the respective network services, it will be compared with the prior art.
  • the determination of the segmentation node and the determination of the traffic of the transmitted network service on each transmission path are unified to determine an optimization problem, which reduces the complexity of the network service transmission path planning to a certain extent.
  • the method for transmitting network services in the embodiment of the present application includes:
  • Step 100 Obtain network topology information and network service information, where the network topology information includes a connection relationship between each node in the network and each node, where the network service information includes traffic information of at least one network service that needs to be transmitted, and is used to transmit at least one The source node and the sink node of each network service in the network service.
  • network topology information and network service information may be obtained from the SDN controller periodically.
  • Step 101 Determine, according to the network topology information and the source end node and the sink node for transmitting each network service, the centripetality of each node in the other node set, and use the node centripetality to indicate The probability that the node passes through the shortest transmission path where the source end node and the sink end node are located, the other end node set does not include the source end node and the sink end node, and the nodes in other node sets are nodes in the network.
  • Step 102 Determine at least one segment node from other node sets according to centripetality of each node in the other node set, where the segment node is an intermediate node that passes through the shortest transmission path of each network service.
  • Step 103 Determine at least one transmission path for transmitting each network service according to at least one segment node, a source end node of each network service, and a sink end node.
  • Step 104 Determine, according to the traffic information of the at least one network service and the at least one transmission path used for transmitting each network service, the traffic of the network service that needs to be transmitted on the at least one transmission path of each network service.
  • At least one segment node may be determined in the following manner:
  • the nodes in the other node sets are sorted according to the size of the node centripetality to obtain the nodes ranked in the top K; and the nodes ranked in the top K are determined as at least one segment node, where K is a positive integer greater than or equal to 1. Then, the number of segment nodes determined in this way is K.
  • node centripetality of nodes in other node sets can satisfy the following expression:
  • V represents a set of all nodes in the network
  • v represents any one of the other node sets
  • other set of nodes includes each node except the source end node and the sink end node in the network
  • s represents that at least one is used for transmission.
  • a source node of a network service in the network service t is used to represent a sink node for receiving a network service
  • ⁇ (v) is used to represent the centripetality of the node of v
  • ⁇ st is used to represent s and t in the network.
  • the number of strips between the shortest transmission paths, ⁇ st (v) is used to indicate the number of strips of the shortest transmission path that v has passed in the shortest transmission path of ⁇ st .
  • s1 is a source node for transmitting network service 1
  • t1 is a sink node for receiving network service 1
  • s2 is a source end for transmitting network service 2.
  • the node, t2 is a sink node for receiving the network service 2, wherein, as can be seen from FIG. 2, the shortest transmission path through s1 and t1 includes s1->v1->t1, s1->v2->t1. S1->v3->t1, s1->v4->t1, s1->v5->t1, the shortest transmission path through s2 and t2 includes s2->v2->t2, s2->v4>t2, s2- >v5->t2.
  • the node centripetality of each node of the other node set satisfies the following expression:
  • v represents any of the other node sets
  • V′ represents the other node set
  • the nodes included in the other node set are the shortest path in the network for transmitting the respective network services, and the source node and the sink are excluded.
  • nodes other than the end nodes ⁇ (v) represented by concentric node v, v - v represents the network and the number of connected nodes, v + represents the number of nodes in the network and the connection of v.
  • s1 is a source node for transmitting network service 1
  • t1 is a sink node for receiving network service 1
  • s2 is a source end for transmitting network service 2.
  • the node, t2 is a sink node for receiving the network service 2, wherein, as can be seen from FIG. 2, the shortest transmission path through s1 and t1 includes s1->v1->t1, s1->v2->t1. S1->v3->t1, s1->v4->t1, s1->v5->t1, the shortest transmission path through s2 and t2 includes s2->v2->t2, s2->v4>t2, s2- >v5->t2.
  • v2 Takes v2 as an example.
  • the ingress nodes of v2 are s1, s2, and v2, and the egress nodes are v4, t1, and t2.
  • ⁇ (v4) 3, Therefore, when the network topology is as shown in Figure 2, and the source node and the sink node are s1 and t1, s2, and t2, respectively, if the nodes with the centripetality of the first three nodes are selected as the segment nodes, then The segment nodes are v2, v4, and v5, and the transmission paths of the network service 1 are s1->v2->t1, s1->v4->t1, and s1->v5->t1, respectively, and the transmission paths of the network service 2 are respectively S2->v2->t2, s2->v4>t2 and s2->v5->t2; if the node with the first two centripetal concentricity is selected as the segmentation node, the segmentation nodes are v2 and v4. It should be noted that, in the embodiment of the present application, the value of K may be set according to actual conditions.
  • the group centripetality of each node group included in the other node set may be determined according to the centripetality of each node in the other node set, where the node group includes J nodes, and J is a positive integer greater than or equal to 1; select the node group with the largest centripetality from each node group, and set the group with the largest centripetality
  • the J nodes included in the determination are determined to be at least one segment node.
  • the number of at least one segment node determined in this way is J, and the number of Js can be set correspondingly as needed.
  • each node group included in the other node set satisfies the following expression:
  • V represents a set of all nodes in the network
  • C represents a node group in the other node set
  • other node sets include each node except the source end node and the sink end node in the network
  • s represents that at least one is used for transmission.
  • a source node of a network service in the network service t represents a sink node for receiving a network service
  • ⁇ (C) represents a group centripetality of C
  • ⁇ st represents a shortest transmission path between s and t in the network.
  • the number of bars, ⁇ st (C) represents the sum of the number of paths that each node included in C passes in the shortest transmission path of ⁇ st .
  • each node group includes 3 nodes.
  • each node group includes 4 nodes, wherein the nodes included in each node group are not identical.
  • the number of nodes included in each node group is set according to actual conditions.
  • s1 is a source node for transmitting network service 1
  • t1 is a sink node for receiving network service 1
  • s2 is a source end for transmitting network service 2.
  • the node, t2 is a sink node for receiving the network service 2, wherein, as can be seen from FIG. 2, the shortest transmission path through s1 and t1 includes s1->v1->t1, s1->v2->t1. S1->v3->t1, s1->v4->t1, s1->v5->t1, the shortest transmission path through s2 and t2 includes s2->v2->t2, s2->v4>t2, s2- >v5->t2.
  • the other node sets include v1, v2, v3, v4, and v5. If the node group includes three nodes, the switch group includes 10 possible node groups, for example, v1, v2, and v3 form a node group, and v2 is composed. V3 and v4 form a node group.
  • the K value can be set according to actual conditions.
  • a traffic forwarding ratio of a network service that needs to be transmitted on at least one transmission path for transmitting each network service is determined; and then according to the determined traffic forwarding ratio and at least one
  • the traffic information of the network service determines the traffic of the network service that needs to be transmitted on at least one transmission path for transmitting each network service.
  • the traffic forwarding ratio of the network service that needs to be transmitted on the at least one transmission path for transmitting each network service is respectively satisfied with the following expression:
  • E is used to represent the edge set in the network
  • each edge of the edge set is used to indicate a relationship in which two nodes in the network are directly connected
  • e is used to represent an edge in the network
  • F is used to indicate at least one that needs to be transmitted.
  • the traffic information of the network service f is used to indicate the traffic information on the path for transmitting the network service
  • Tf is used to represent the set of paths for transmitting the respective network services
  • t is used to represent the path of one of the network services
  • S t represents a transmission path for each segment a set of network traffic and path segments as the source node or to an intermediate path between the intermediate node to the sink path between end nodes
  • s represents a segment Path
  • P S is used to represent the set of shortest segmented paths
  • the shortest segmented path is the shortest path from the source node to the intermediate node, or the shortest path from the intermediate node to the sink node
  • p is used to represent the shortest segment path
  • x f t is used to indicate the traffic forwarding ratio
  • D f is used to represent the bandwidth requirement of the traffic information f
  • I p, e is used to indicate the possibility that the edge e is one of the shortest segment paths
  • C e is used to
  • s1 is a source node for transmitting network service 1
  • t1 is a sink node for receiving network service 1
  • s2 is a source node for transmitting network service 2
  • t2 is for Receiving the sink node of the network service 2
  • the transmission path of the network service 1 is s1->v2->t1, s1->v4->t1, and s1->v5->t1, respectively
  • the transmission path of the network service 2 is s2 ->v2->t2, s2->v4>t2 and s2->v5->t2
  • the expression of the embodiment of the present application is such that the network traffic transmitted on each transmission path does not exceed each side of the transmission path.
  • the maximum capacity, in which the transmission path s1->v2->t1 of the network service 1 is taken as an example, s1->v2 is an edge.
  • Network Topology Number of nodes Links Network service Synth50 50 276 2449 Synth100 100 572 9817 Rf3257 161 656 25486
  • the horizontal axis identifies the number of segment nodes determined in a transmission path for transmitting network traffic in the network
  • the vertical axis indicates the utilization of each edge
  • FIG. 3 shows that the determination is performed in one transmission path.
  • the segmentation node is the utilization of each edge in the transmission path of 1 and 2 time.
  • a network service transmission system is also provided in the embodiment of the present application.
  • the method corresponding to the network service transmission system in the embodiment of the present application is the method for transmitting the network service in the embodiment of the present application.
  • the implementation of the service transmission system can be referred to the implementation of the method, and the repeated description will not be repeated.
  • the system for transmitting network services in the embodiment of the present application includes:
  • the obtaining module 400 is configured to obtain network topology information and network service information, where the network topology information includes a connection relationship between each node in the network and each node, where the network service information includes traffic information of at least one network service that needs to be transmitted, and is used for Transmitting at least one source node and a sink node of each network service in the network service;
  • the segment node determining module 410 is configured to determine a centripetality of each node in the other node set according to the network topology information and the source end node and the sink end node included in the network service information for transmitting each network service,
  • the node centripetality is used to indicate the possibility that the node passes the shortest transmission path where the source end node and the sink end node are located.
  • the other node sets do not include the source end node and the sink end node, and the nodes in other node sets are nodes in the network. And according to Determining a node of each of the other node sets, determining at least one segment node from the other node set, wherein the segment node is an intermediate node that passes through the shortest transmission path of each network service;
  • the service flow determining module 420 is configured to determine, according to the at least one segment node, the source end node and the sink end node of each network service, at least one transmission path respectively used for transmitting each network service; and according to the traffic information of the at least one network service Each of the at least one transmission path for transmitting each network service is used to determine the traffic of the network service that needs to be transmitted on the at least one transmission path of each network service.
  • the obtaining module 400, the segment node determining module 410, and the service flow determining module 420 may be respectively a physical device having a transceiving function and a processing function, or an obtaining module 400, a segment node determining module 410, and a service flow.
  • the determining module 420 can be integrated into a physical device having a transceiving function and a processing function at the same time, or any two modules of the obtaining module 400, the segment node determining module 410, and the service flow determining module 420 are integrated into one simultaneously integrated into A physical device having a transceiving function and a processing function is not limited in this application.
  • the segment node determining module 410 is specifically configured to sort the nodes in the other node sets according to the centripetality of the node to obtain the node ranked in the top K, and determine the node ranked in the top K as At least one segmentation node, where K is a positive integer greater than or equal to one.
  • the node centripetality of the nodes in the other node sets satisfies the following expression:
  • V represents a set of all nodes in the network
  • v represents any one of the other node sets
  • other set of nodes includes each node except the source end node and the sink end node in the network
  • s represents that at least one is used for transmission.
  • a source node of a network service in the network service t is used to represent a sink node for receiving a network service
  • ⁇ (v) is used to represent the centripetality of the node of v
  • ⁇ st is used to represent s and t in the network.
  • the number of strips between the shortest transmission paths, ⁇ st (v) is used to indicate the number of strips of the shortest transmission path that v has passed in the shortest transmission path of ⁇ st .
  • the node centripetality of the nodes in the other node sets satisfies the following expression:
  • v represents any node in the other node set
  • V′ represents the other node set
  • the nodes included in the other node set are the shortest transmission path in the network for transmitting the respective network services, and the source node and the sink are excluded.
  • ⁇ (v) represents the centripetality of the nodes of v
  • v - represents the number of nodes connected to v in the network
  • v + represents the number of nodes connected to v out in the network.
  • the segment node determining module 410 is specifically configured to determine group centripetality of each node group included in another node set according to node centripetality of each node in the other node set, where the node group is in the node group A J-th node is included, and J is a positive integer greater than or equal to 1; and a group of nodes having the largest centripetality is selected from each node group, and J nodes included in the group of nodes having the largest centripetality are determined as at least one Segmentation node.
  • the group centripetality of each node group included in the other node set satisfies the following expression:
  • V represents a set of all nodes in the network
  • C represents a node group in the other node set
  • other node sets include each node except the source end node and the sink end node in the network
  • s represents that at least one is used for transmission.
  • a source node of a network service in the network service t represents a sink node for receiving a network service
  • ⁇ (C) represents a group centripetality of C
  • ⁇ st represents a shortest transmission path between s and t in the network.
  • the number of bars, ⁇ st (C) represents the sum of the number of paths that each node included in C passes in the shortest transmission path of ⁇ st .
  • the service flow determining module 420 is specifically configured to: determine a traffic forwarding ratio of the network service that needs to be transmitted on the at least one transmission path that is used to transmit each network service, respectively, and according to the determined traffic forwarding ratio and The traffic information of the at least one network service determines the traffic of the network service that needs to be transmitted on the at least one transmission path for transmitting each network service.
  • the traffic forwarding ratio of the network service that needs to be transmitted on the at least one transmission path for transmitting each network service respectively satisfies the following expression:
  • E is used to represent the edge set in the network
  • each edge of the edge set is used to indicate a relationship in which two nodes in the network are directly connected
  • e is used to represent an edge in the network
  • F is used to indicate at least one that needs to be transmitted.
  • the traffic information of the network service f is used to indicate the traffic information on the path for transmitting the network service
  • Tf is used to represent the set of paths for transmitting the respective network services
  • t is used to represent the path of one of the network services
  • S t is used to represent a set of segment paths for transmitting respective network services
  • the segment path is a path between the source node to the intermediate node or a path between the intermediate node and the sink node
  • s is used to represent the segment Path
  • P S is used to represent the set of shortest segmented paths
  • the shortest segmented path is the shortest path from the source node to the intermediate node, or the shortest path from the intermediate node to the sink node
  • p is used to represent the shortest segment path
  • x f t is used to indicate the traffic forwarding ratio
  • D f is used to represent the bandwidth requirement of the traffic information f
  • I p e is used to indicate the possibility that the edge e is one of the shortest
  • the obtaining module 400 can be implemented by a transceiver, and the segment node determining module 410,
  • the traffic flow determination module 420 can be implemented by one or more processors.
  • the network service transmission device 500 includes a processor 510, a transceiver 520, and a memory 530.
  • the memory 530 can be used to store the program/code pre-installed by the device 500 at the factory, or to store code and the like when the processor 510 is executed.
  • the processor 510 can be a general-purpose central processing unit (CPU), a microprocessor, an application specific integrated circuit (ASIC), or one or more integrated circuits for performing related operations.
  • CPU central processing unit
  • ASIC application specific integrated circuit
  • the device 500 shown in FIG. 5 only shows the processor 510, the transceiver 520, and the memory 530, in a specific implementation process, those skilled in the art should understand that the device 500 also includes a normal operation. Other devices that are required. At the same time, those skilled in the art will appreciate that the device 500 may also include hardware devices that implement other additional functions, depending on the particular needs. Moreover, those skilled in the art will appreciate that the device 500 may also only include the devices or modules necessary to implement the embodiments of the present application, and does not necessarily include all of the devices shown in FIG.
  • embodiments of the present application can be provided as a method, system, or computer program product. Therefore, embodiments of the present application may adopt an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware.
  • embodiments of the present application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) including computer usable program code.
  • Embodiments of the present application are described with reference to flowchart illustrations and/or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present application. It will be understood that each flow and/or block of the flowchart illustrations and/or FIG.
  • These computer program instructions can be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing device to produce a machine for the execution of instructions for execution by a processor of a computer or other programmable data processing device.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

一种网络业务传输的方法及系统，涉及通信技术领域，用以降低目前网络业务传输路径的规划较为复杂的问题。该方法包括：获取网络拓扑信息以及网络业务信息，然后分别确定其它节点集合中每个节点的节点向心性；以及从其它节点集合中确定至少一个分段节点；并确定分别用于传输各个网络业务的至少一个传输路径；最后确定分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量。在本申请中由于在确定分段节点之后，再确定各个传输路径上的所传输的网络业务的流量，而且各个网络业务的传输路径之间共享相同的分段节点，因此在一定程度上降低了网络业务传输路径规划的复杂度。

Description

一种网络业务传输的方法及系统
本申请要求在2017年03月14日提交中国专利局、申请号为201710149180.3、申请名称为“一种网络业务传输的方法及系统”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域，特别涉及一种网络业务传输的方法及系统。
背景技术
在网络中当存在需要传输的网络业务时，通常情况下基于网络中各个节点之间的拓扑结构确定需要传输的网络业务的源端节点和宿端节点之间最短传输路径，然后源端节点通过最短传输路径向宿端节点发送需要传输的网络业务。但是，当网络中的节点个数较多，或者网络拓扑结构较为复杂、且需要传输的网络业务较多时，通过直接确定需要传输的网络业务的源端节点与宿端节点之间的最短传输路径时计算的工作量较大，较为复杂。
为了降低确定需要传输的网络业务的源端节点与宿端节点之间的最短传输路径时的工作量，提出了分段路由的路由方案，即通过确定源端节点和宿端节点之间的一个或多个分段节点，其中，分段节点为经过源端节点和宿端节点的传输路径上的一个中间节点，将源端节点和宿端节点之间的传输路径划分成至少两段分段路径，然后确定每段分段路径上的节点，但是现有技术中，是将分段节点的确定和在各个由源端节点、分段节点和宿端节点组成的多条路径上的流量转发比归纳为一个统一的优化问题进行求解的，该优化问题是一个整数规划和线性规划的混合问题，因此计算工作量依然较大，很难在有限的时间内计算得到结果。
因此综上所述，现有技术中网络业务传输路径的规划较为复杂。
发明内容
本申请实施例提供一种网络业务传输的方法及系统，用以降低现有技术中存在的网络业务传输路径的规划较为复杂的问题。
第一方面，提供了一种网络业务传输的方法，包括：
获取网络拓扑信息以及网络业务信息，其中网络拓扑信息包括网络中各个节点以及各个节点之间的连接关系，网络业务信息包括需要传输的至少一个网络业务的流量信息、用于传输至少一个网络业务中各个网络业务的源端节点和宿端节点；然后根据网络拓扑信息和网络业务信息中所包括的用于传输各个网络业务的源端节点和宿端节点，分别确定其它节点集合中每个节点的节点向心性，节点向心性用于指示节点经过源端节点和宿端节点所在的最短传输路径的可能性，其它节点集合中不包括源端节点和宿端节点，且其它节点集合中的节点为网络中的节点；以及根据其它节点集合中每个的节点向心性，从其它节点集合中确定至少一个分段节点，其中分段节点为各个网络业务的最短传输路径中共同经过的一个中间节点；并根据至少一个分段节点、各个网络业务的源端节点和宿端节点，确定分别用于传输各个网络业务的至少一个传输路径；最后根据至少一个网络业务的流量信息和分别用于传输各个网络业务的至少一个传输路径，确定分别用于传输各个网络业务的至少 一个传输路径上需要传输的网络业务的流量。
由于在本申请中在确定分段节点之后，再确定各个传输路径上的所传输的网络业务的流量，而且各个网络业务的传输路径之间共享相同的分段节点，因此与现有技术中将分段节点的确定和各个传输路径上的所传输的网络业务的流量的确定统一为一个优化问题进行确定相比，在一定程度上降低了网络业务传输路径规划的复杂度。
在一种可能的实现方式中，按照节点向心性的大小对所述其它节点集合中节点进行排序以获取排在前K的节点，将所述排在前K的节点确定为所述至少一个分段节点，其中K为大于等于1的正整数。
在一种可能的实现方式中，其它节点集合中节点的节点向心性满足下述表达式：
Figure PCTCN2017115328-appb-000001
其中，V表示网络中所有节点的集合，v表示其它节点集合中的任一节点、且其它节点集合中包括网络中除源端节点和宿端节点以外的各个节点，s表示用于传输至少一个网络业务中的一个网络业务的源端节点，t用于表示用于接收一个网络业务的宿端节点，δ(v)用于表示v的节点向心性，σst用于表示网络中s和t之间最短传输路径的条数，σst(v)用于表示v在σst条最短传输路径中所经过的最短传输路径的条数。
由于基于上述方式确定节点向心性，简化了计算的复杂度的同时，提高了网络确定分段节点的效率。
在一种可能的实现方式中，其它节点集合中节点的节点向心性满足下述表达式：
Figure PCTCN2017115328-appb-000002
其中，v表示其它节点集合中的任一节点，V′表示其它节点集合，其它节点集合中包括的节点为网络中同时经过用于传输各个网络业务的最短传输路径、且除源端节点和宿端节点以外的节点，δ(v)表示v的节点向心性，v-表示网络中与v入连接的节点的个数，v+表示网络中与v出连接的节点的个数。
在一种可能的实现方式中，根据其它节点集合中每个节点的节点向心性，确定其它节点集合中包括的各个节点组的组向心性，其中节点组中包括J个节点，且J为大于等于1的正整数；从各个节点组中选择组向心性最大的节点组，并将所述组向心性最大的节点组中所包括的J个节点确定为至少一个分段节点。
在一种可能的实现方式中，其它节点集合中包括的各个节点组的组向心性满足下述表达式：
Figure PCTCN2017115328-appb-000003
其中，V表示网络中所有节点的集合，C表示其它节点集合中的一个节点组、且其它节点集合中包括网络中除源端节点和宿端节点以外的各个节点，s表示用于传输至少一个网络业务中的一个网络业务的源端节点，t表示用于接收一个网络业务的宿端节点，δ(C)表示C的组向心性，σst表示网络中s和t之间最短传输路径的条数，σst(C)表示C中所包括的各个节点在σst条最短传输路径中所经过的路径的条数之和。
在一种可能的实现方式中，确定分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量转发比；并根据确定的流量转发比和至少一个网络业务的流量信息，确定用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量。
在一种可能的实现方式中，分别用于传输各个网络业务的至少一个传输路径上需要传 输的网络业务的流量转发比满足下述表达式：
Figure PCTCN2017115328-appb-000004
其中，E用于表示网络中的边集，且边集中的每条边用于表示网络中两个节点直接连接的关系，e用于表示网络中的边，F用于表示需要传输的至少一个网络业务的流量信息，f用于表示用于传输网络业务的路径上的流量信息，Tf用于表示用于传输各个网络业务的路径的集合，t用于表示其中一个网络业务的路径，St用于表示用于传输各个网络业务的分段路径的集合，且分段路径为源端节点到中间节点之间的路径或者中间节点到宿端节点之间的路径，s用于表示分段路径，PS用于表示最短分段路径的集合，且最短分段路径为源端节点到中间节点最短路径、或中间节点到宿端节点最短路径，p用于表示最短分段路径，xf,t用于表示流量转发比，Df用于表示流量信息f的带宽需求，Ip,e用于表示边e为最短分段路径中的一条边的可能性，Ce用于表示边e所能够承载的最大业务流量的大小，θ用于表示预设的比例值。
由于基于上述方式确定流量转发比，在简化运算的基础上，降低了网络中各个传输路径中的流量超出负载最大限度的可能性，大大提高了网络业务传输的效率。
第二方面，提供了一种网络业务传输的系统，包括：
获取模块，用于获取网络拓扑信息以及网络业务信息，其中网络拓扑信息包括网络中各个节点以及各个节点之间的连接关系，网络业务信息包括需要传输的至少一个网络业务的流量信息、用于传输至少一个网络业务中各个网络业务的源端节点和宿端节点；
分段节点确定模块，用于根据网络拓扑信息和网络业务信息中所包括的用于传输各个网络业务的源端节点和宿端节点，分别确定其它节点集合中每个节点的节点向心性，节点向心性用于指示节点经过源端节点和宿端节点所在的最短传输路径的可能性，其它节点集合中不包括源端节点和宿端节点，且其它节点集合中的节点为网络中的节点；并根据其它节点集合中每个的节点向心性，从其它节点集合中确定至少一个分段节点，其中分段节点为各个网络业务的最短传输路径中共同经过的一个中间节点；
业务流量确定模块，用于根据至少一个分段节点、各个网络业务的源端节点和宿端节点，确定分别用于传输各个网络业务的至少一个传输路径；根据至少一个网络业务的流量信息和分别用于传输各个网络业务的至少一个传输路径，确定分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量。
在一种可能的实现方式中，分段节点确定模块具体用于按照节点向心性的大小对其它节点集合中节点进行排序以获取排在前K的节点；并将排在前K的节点确定为至少一个分段节点；其中K为大于等于1的正整数。
在一种可能的实现方式中，其它节点集合中节点的节点向心性满足下述表达式：
Figure PCTCN2017115328-appb-000005
其中，V表示网络中所有节点的集合，v表示其它节点集合中的任一节点、且其它节点集合中包括网络中除源端节点和宿端节点以外的各个节点，s表示用于传输至少一个网 络业务中的一个网络业务的源端节点，t用于表示用于接收一个网络业务的宿端节点，δ(v)用于表示v的节点向心性，σst用于表示网络中s和t之间最短传输路径的条数，σst(v)用于表示v在σst条最短传输路径中所经过的最短传输路径的条数。
在一种可能的实现方式中，其它节点集合中节点的节点向心性满足下述表达式：
Figure PCTCN2017115328-appb-000006
其中，v表示其它节点集合中的任一节点，V′表示其它节点集合，其它节点集合中包括的节点为网络中同时经过用于传输各个网络业务的最短传输路径、且除源端节点和宿端节点以外的节点，δ(v)表示v的节点向心性，v-表示网络中与v入连接的节点的个数，v+表示网络中与v出连接的节点的个数。
在一种可能的实现方式中，分段节点确定模块具体用于根据其它节点集合中每个节点的节点向心性，确定其它节点集合中包括的各个节点组的组向心性，其中节点组中包括J个节点，且J为大于等于1的正整数；并从各个节点组中选择组向心性最大的节点组，并将组向心性最大的节点组中所包括的J个节点确定为至少一个分段节点。
在一种可能的实现方式中，其它节点集合中包括的各个节点组的组向心性满足下述表达式：
Figure PCTCN2017115328-appb-000007
其中，V表示网络中所有节点的集合，C表示其它节点集合中的一个节点组、且其它节点集合中包括网络中除源端节点和宿端节点以外的各个节点，s表示用于传输至少一个网络业务中的一个网络业务的源端节点，t表示用于接收一个网络业务的宿端节点，δ(C)表示C的组向心性，σst表示网络中s和t之间最短传输路径的条数，σst(C)表示C中所包括的各个节点在σst条最短传输路径中所经过的路径的条数之和。
在一种可能的实现方式中，业务流量确定模块具体用于：确定分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量转发比；并根据确定的流量转发比和至少一个网络业务的流量信息，确定用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量。
在一种可能的实现方式中，分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量转发比满足下述表达式：
Figure PCTCN2017115328-appb-000008
其中，E用于表示网络中的边集，且边集中的每条边用于表示网络中两个节点直接连接的关系，e用于表示网络中的边，F用于表示需要传输的至少一个网络业务的流量信息，f用于表示用于传输网络业务的路径上的流量信息，Tf用于表示用于传输各个网络业务的路径的集合，t用于表示其中一个网络业务的路径，St用于表示用于传输各个网络业务的分段路径的集合，且分段路径为源端节点到中间节点之间的路径或者中间节点到宿端节点之间的路径，s用于表示分段路径，PS用于表示最短分段路径的集合，且最短分段路径为 源端节点到中间节点最短路径、或中间节点到宿端节点最短路径，p用于表示最短分段路径，xf,t用于表示流量转发比，Df用于表示流量信息f的带宽需求，Ip,e用于表示边e为最短分段路径中的一条边的可能性，Ce用于表示边e所能够承载的最大业务流量的大小，θ用于表示预设的比例值。
附图说明
图1为本申请实施例网络业务传输的方法的流程示意图；
图2为本申请实施例网络拓扑结构示意图；
图3为本申请实施例网络业务性能分析示意图；
图4为本申请实施例网络业务性传输的系统结构示意图；
图5为本申请实施例网络业务性能传输的设备的硬件结构示意图。
具体实施方式
由于在本申请中在确定分段节点之后，再确定各个传输路径上的所传输的网络业务的流量，而且各个网络业务的传输路径之间共享相同的分段节点，因此与现有技术中将分段节点的确定和各个传输路径上的所传输的网络业务的流量的确定统一为一个优化问题进行确定相比，在一定程度上降低了网络业务传输路径规划的复杂度。
如图1所示，本申请实施例网络业务传输的方法，包括：
步骤100，获取网络拓扑信息以及网络业务信息，其中网络拓扑信息包括网络中各个节点以及各个节点之间的连接关系，网络业务信息包括需要传输的至少一个网络业务的流量信息、用于传输至少一个网络业务中各个网络业务的源端节点和宿端节点。
具体的，可以周期性的从SDN控制器获取网络拓扑信息和网络业务信息。
步骤101，根据网络拓扑信息和网络业务信息中所包括的用于传输各个网络业务的源端节点和宿端节点，分别确定其它节点集合中每个节点的节点向心性，节点向心性用于指示节点经过源端节点和宿端节点所在的最短传输路径的可能性，其它节点集合中不包括源端节点和宿端节点，且其它节点集合中的节点为网络中的节点。
步骤102，根据其它节点集合中每个的节点向心性，从其它节点集合中确定至少一个分段节点，其中分段节点为各个网络业务的最短传输路径中共同经过的一个中间节点。
步骤103，根据至少一个分段节点、各个网络业务的源端节点和宿端节点，确定分别用于传输各个网络业务的至少一个传输路径。
步骤104，根据至少一个网络业务的流量信息和分别用于传输各个网络业务的至少一个传输路径，确定分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量。
其中，步骤102在具体实现时可以通过下述方式确定至少一个分段节点：
按照节点向心性的大小对其它节点集合中节点进行排序以获取排在前K的节点；并将排在前K的节点确定为至少一个分段节点，其中K为大于等于1的正整数。则通过这种方式确定的分段节点的个数为K个。
示例的，其它节点集合中节点的节点向心性可以满足下述表达式：
Figure PCTCN2017115328-appb-000009
其中，V表示网络中所有节点的集合，v表示其它节点集合中的任一节点、且其它节点集合中包括网络中除源端节点和宿端节点以外的各个节点，s表示用于传输至少一个网络业务中的一个网络业务的源端节点，t用于表示用于接收一个网络业务的宿端节点，δ(v)用于表示v的节点向心性，σst用于表示网络中s和t之间最短传输路径的条数，σst(v)用于表示v在σst条最短传输路径中所经过的最短传输路径的条数。
以图2所示的网络拓扑结构为例，假设s1为用于传输网络业务1的源端节点，t1为用于接收网络业务1的宿端节点，s2为用于传输网络业务2的源端节点，t2为用于接收网络业务2的宿端节点，其中，从图2中可以看出，经过s1和t1的最短传输路径包括s1->v1->t1、s1->v2->t1、s1->v3->t1、s1->v4->t1、s1->v5->t1，经过s2和t2的最短传输路径包括s2->v2->t2、s2->v4>t2、s2->v5->t2。
则其它节点集合中包括v1、v2、v3、v4和v5。则以v1为例，
Figure PCTCN2017115328-appb-000010
同理，
Figure PCTCN2017115328-appb-000011
因此当网络拓扑结构如图2所示时，且源端节点和宿端节点分别为s1和t1、s2和t2时，则若选择节点向心性排在前3个的节点作为分段节点，则分段节点分别为v2、v4和v5，则网络业务1的传输路径分别为s1->v2->t1、s1->v4->t1和s1->v5->t1，网络业务2的传输路径分别为s2->v2->t2、s2->v4>t2和s2->v5->t2；若选择节点向心性排在前2个的节点作为分段节点，则由于节点向心性排在前3个的节点向心性相等，则分段节点可以分别为v2、v4和v5中的任意两个。需要说明的是，在本申请实施例中K值可以根据实际情况需要进行设定。
示例的，其它节点集合的每个节点的节点向心性满足下述表达式：
Figure PCTCN2017115328-appb-000012
其中，v表示其它节点集合中的任一节点，V′表示其它节点集合、且其它节点集合中包括的节点为网络中同时经过用于传输各个网络业务的最短路径、且除源端节点和宿端节点以外的节点，δ(v)表示v的节点向心性，v-表示网络中与v入连接的节点的个数，v+表示网络中与v出连接的节点的个数。
以图2所示的网络拓扑结构为例，假设s1为用于传输网络业务1的源端节点，t1为用于接收网络业务1的宿端节点，s2为用于传输网络业务2的源端节点，t2为用于接收网络业务2的宿端节点，其中，从图2中可以看出，经过s1和t1的最短传输路径包括s1->v1->t1、s1->v2->t1、s1->v3->t1、s1->v4->t1、s1->v5->t1，经过s2和t2的最短传输路径包括s2->v2->t2、s2->v4>t2、s2->v5->t2。
则其它节点集合中包括v2、v4和v5。则以v2为例，v2的入节点为s1、s2和v2、出节点为v4、t1和t2，则
Figure PCTCN2017115328-appb-000013
同理，δ(v4)＝3，
Figure PCTCN2017115328-appb-000014
因此当网络拓扑结构如图2所示时，且源端节点和宿端节点分别为s1和t1、s2和t2时，若选择节点向心性排在前3个的节点作为分段节点，则分段节点为v2、v4和v5，则网络业务1的传输路径分别为s1->v2->t1、s1->v4->t1和s1->v5->t1，网络业务2的传输路径分别为s2->v2->t2、s2->v4>t2和s2->v5->t2；若选择节点向心性排在前2个的节点作为分段节点，则分段节点为v2和v4。需要说明的是，在本申请实施例中K值可以根据实际情况需要进行设定。
此外，在本申请实施例中还可以根据其它节点集合中每个节点的节点向心性，确定其它节点集合中包括的各个节点组的组向心性，其中节点组中包括J个节点，且J为大于等于1的正整数；从各个节点组中选择组向心性最大的节点组，并将组向心性最大的节点组 中所包括的J个节点确定为至少一个分段节点。通过这种方式确定的至少一个分段节点的个数为J个，其中J的个数可以根据需要进行相应的设置。
具体的，其它节点集合中包括的各个节点组的组向心性满足下述表达式：
Figure PCTCN2017115328-appb-000015
其中，V表示网络中所有节点的集合，C表示其它节点集合中的一个节点组、且其它节点集合中包括网络中除源端节点和宿端节点以外的各个节点，s表示用于传输至少一个网络业务中的一个网络业务的源端节点，t表示用于接收一个网络业务的宿端节点，δ(C)表示C的组向心性，σst表示网络中s和t之间最短传输路径的条数，σst(C)表示C中所包括的各个节点在σst条最短传输路径中所经过的路径的条数之和。
应理解，通常情况下，各个节点组中包括的节点的个数是相同的，各节点组中包括的节点的个数为需要确定的分段节点的个数，例如若要确定3个分段节点，则每个节点组中包括3个节点，若要确定4个分段节点，则每个节点组中包括4个节点，其中，每个节点组中所包括的节点不完全相同。其中，各个节点组中包括的节点的个数是根据实际情况需要进行设定的。
以图2所示的网络拓扑结构为例，假设s1为用于传输网络业务1的源端节点，t1为用于接收网络业务1的宿端节点，s2为用于传输网络业务2的源端节点，t2为用于接收网络业务2的宿端节点，其中，从图2中可以看出，经过s1和t1的最短传输路径包括s1->v1->t1、s1->v2->t1、s1->v3->t1、s1->v4->t1、s1->v5->t1，经过s2和t2的最短传输路径包括s2->v2->t2、s2->v4>t2、s2->v5->t2。
则其它节点集合中包括v1、v2、v3、v4和v5，若节点组中包括3个节点，则共包括10种可能的节点组，例如由v1、v2和v3组成一个节点组，由v2、v3和v4组成一个节点组。以由v1、v2和v3组成一个节点组为例，由于
Figure PCTCN2017115328-appb-000016
Figure PCTCN2017115328-appb-000017
则
Figure PCTCN2017115328-appb-000018
由于v1、v2、v3、v4和v5中v2、v4和v5的节点向心性最大，因此由v2、v4和v5组成的节点组的组节点向心性也最大，因此确定分段节点为v2、v4和v5，需要说明的是，在本申请实施例中K值可以根据实际情况需要进行设定。
为了简化步骤104的实现方式，在本申请实施例中，首先确定分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量转发比；然后根据确定的流量转发比和至少一个网络业务的流量信息，确定用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量。
具体的，分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量转发比满足下述表达式：
Figure PCTCN2017115328-appb-000019
其中，E用于表示网络中的边集，且边集中的每条边用于表示网络中两个节点直接连接的关系，e用于表示网络中的边，F用于表示需要传输的至少一个网络业务的流量信息，f用于表示用于传输网络业务的路径上的流量信息，Tf用于表示用于传输各个网络业务的路径的集合，t用于表示其中一个网络业务的路径，St用于表示用于传输各个网络业务的分段路径的集合，且分段路径为源端节点到中间节点之间的路径或者中间节点到宿端节点之间的路径，s用于表示分段路径，PS用于表示最短分段路径的集合，且最短分段路径为源端节点到中间节点最短路径、或中间节点到宿端节点最短路径，p用于表示最短分段路径，xf,t用于表示流量转发比，Df用于表示流量信息f的带宽需求，Ip,e用于表示边e为最短分段路径中的一条边的可能性，Ce用于表示边e所能够承载的最大业务流量的大小，θ用于表示预设的比例值。
以图2为例，假设s1为用于传输网络业务1的源端节点，t1为用于接收网络业务1的宿端节点，s2为用于传输网络业务2的源端节点，t2为用于接收网络业务2的宿端节点，网络业务1的传输路径分别为s1->v2->t1、s1->v4->t1和s1->v5->t1，网络业务2的传输路径分别为s2->v2->t2、s2->v4>t2和s2->v5->t2；通过本申请实施例的表达式使得每个传输路径上传输的网络业务流量不超过该传输路径的各个边上的最大容量，其中以网络业务1的传输路径s1->v2->t1为例，s1->v2即为一条边。
为了验证本申请实施例的有效性。我们采用三个网络拓扑(synth50,synth100，rf3257)进行了模拟仿真。其中synth50、synth100为人工生成的网络，而rf3257为真实网络拓扑。三个网络拓扑的参数如下表所示：
表1
网络拓扑结构 节点个数 links 网络业务
synth50 50 276 2449
synth100 100 572 9817
rf3257 161 656 25486
如图3所示，横轴标识网络中用于传输网络业务的一条传输路径中确定的分段节点的个数，纵轴表示各个边的利用率，图3示出了在一条传输路径中确定分段节点为1个和2个时传输路径中各个边的利用情况，其中纵轴的值越小说明路由算法的负载均衡效果越好。从图3中可以看出，分段节点为2个时和分段节点为1个时负载均衡效果相近，但是确定两个分段节点与确定1个分段节点相比较为复杂。
对于一个大规模网络，采用本申请实施例的实现方式，只需从网络中选择2.5％～5％的节点作为分段节点即可实现很好的负载均衡。
基于同一构思，本申请实施例中还提供了一种网络业务传输的系统，由于本申请实施例的网络业务传输系统对应的方法为本申请实施例网络业务传输的方法，因此本申请实施例网络业务传输系统的实施可以参见该方法的实施，重复之处不再赘述。
如图4所示，本申请实施例网络业务传输的系统，包括：
获取模块400，用于获取网络拓扑信息以及网络业务信息，其中网络拓扑信息包括网络中各个节点以及各个节点之间的连接关系，网络业务信息包括需要传输的至少一个网络业务的流量信息、用于传输至少一个网络业务中各个网络业务的源端节点和宿端节点；
分段节点确定模块410，用于根据网络拓扑信息和网络业务信息中所包括的用于传输各个网络业务的源端节点和宿端节点，分别确定其它节点集合中每个节点的节点向心性，节点向心性用于指示节点经过源端节点和宿端节点所在的最短传输路径的可能性，其它节点集合中不包括源端节点和宿端节点，且其它节点集合中的节点为网络中的节点；并根据 其它节点集合中每个的节点向心性，从其它节点集合中确定至少一个分段节点，其中分段节点为各个网络业务的最短传输路径中共同经过的一个中间节点；
业务流量确定模块420，用于根据至少一个分段节点、各个网络业务的源端节点和宿端节点，确定分别用于传输各个网络业务的至少一个传输路径；根据至少一个网络业务的流量信息和分别用于传输各个网络业务的至少一个传输路径，确定分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量。
需要说明的是，获取模块400、分段节点确定模块410、业务流量确定模块420可以分别为一个具有收发功能和处理功能的实体设备，或者，获取模块400、分段节点确定模块410、业务流量确定模块420可以同时集成到一个具有收发功能和处理功能的实体设备中，亦或是获取模块400、分段节点确定模块410、业务流量确定模块420中的任意两个模块集成在一个同时集成到一个具有收发功能和处理功能的实体设备中，在本申请中对此不做限定。
在一种可能的实现方式中，分段节点确定模块410具体用于按照节点向心性的大小对其它节点集合中节点进行排序以获取排在前K的节点，将排在前K的节点确定为至少一个分段节点，其中K为大于等于1的正整数。
在一种可能的实现方式中，其它节点集合中节点的节点向心性满足下述表达式：
Figure PCTCN2017115328-appb-000020
其中，V表示网络中所有节点的集合，v表示其它节点集合中的任一节点、且其它节点集合中包括网络中除源端节点和宿端节点以外的各个节点，s表示用于传输至少一个网络业务中的一个网络业务的源端节点，t用于表示用于接收一个网络业务的宿端节点，δ(v)用于表示v的节点向心性，σst用于表示网络中s和t之间最短传输路径的条数，σst(v)用于表示v在σst条最短传输路径中所经过的最短传输路径的条数。
在一种可能的实现方式中，其它节点集合中节点的节点向心性满足下述表达式：
Figure PCTCN2017115328-appb-000021
其中，v表示其它节点集合中的任一节点，V′表示其它节点集合，其它节点集合中包括的节点为网络中同时经过用于传输各个网络业务的最短传输路径、且除源端节点和宿端节点以外的节点，δ(v)表示v的节点向心性，v-表示网络中与v入连接的节点的个数，v+表示网络中与v出连接的节点的个数。
在一种可能的实现方式中，分段节点确定模块410具体用于根据其它节点集合中每个节点的节点向心性，确定其它节点集合中包括的各个节点组的组向心性，其中节点组中包括J个节点，且J为大于等于1的正整数；并从各个节点组中选择组向心性最大的节点组，并将组向心性最大的节点组中所包括的J个节点确定为至少一个分段节点。
在一种可能的实现方式中，其它节点集合中包括的各个节点组的组向心性满足下述表达式：
Figure PCTCN2017115328-appb-000022
其中，V表示网络中所有节点的集合，C表示其它节点集合中的一个节点组、且其它节点集合中包括网络中除源端节点和宿端节点以外的各个节点，s表示用于传输至少一个网络业务中的一个网络业务的源端节点，t表示用于接收一个网络业务的宿端节点，δ(C)表 示C的组向心性，σst表示网络中s和t之间最短传输路径的条数，σst(C)表示C中所包括的各个节点在σst条最短传输路径中所经过的路径的条数之和。
在一种可能的实现方式中，业务流量确定模块420具体用于：确定分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量转发比；并根据确定的流量转发比和至少一个网络业务的流量信息，确定用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量。
在一种可能的实现方式中，分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量转发比满足下述表达式：
Figure PCTCN2017115328-appb-000023
其中，E用于表示网络中的边集，且边集中的每条边用于表示网络中两个节点直接连接的关系，e用于表示网络中的边，F用于表示需要传输的至少一个网络业务的流量信息，f用于表示用于传输网络业务的路径上的流量信息，Tf用于表示用于传输各个网络业务的路径的集合，t用于表示其中一个网络业务的路径，St用于表示用于传输各个网络业务的分段路径的集合，且分段路径为源端节点到中间节点之间的路径或者中间节点到宿端节点之间的路径，s用于表示分段路径，PS用于表示最短分段路径的集合，且最短分段路径为源端节点到中间节点最短路径、或中间节点到宿端节点最短路径，p用于表示最短分段路径，xf,t用于表示流量转发比，Df用于表示流量信息f的带宽需求，Ip,e用于表示边e为最短分段路径中的一条边的可能性，Ce用于表示边e所能够承载的最大业务流量的大小，θ用于表示预设的比例值。
当获取模块400、分段节点确定模块410、业务流量确定模块420可以同时集成到一个具有收发功能和处理功能的实体设备中时，获取模块400可以通过收发器实现，分段节点确定模块410、业务流量确定模块420可以通过一个或多个处理器实现。具体的如图5所示，该网络业务传输的设备500包括可以包括处理器510、收发器520和存储器530。其中，存储器530可以用于存储设备500出厂时预装的程序/代码，也可以存储用于处理器510执行时的代码等。
其中，处理器510可以采用通用的中央处理器(Central Processing Unit，CPU)，微处理器，应用专用集成电路(Application Specific Integrated Circuit，ASIC)，或者一个或多个集成电路，用于执行相关操作，以实现本发明实施例所提供的技术方案。
应注意，尽管图5所示的设备500仅仅示出了处理器510、收发器520和存储器530，但是在具体实现过程中，本领域的技术人员应当明白，该设备500还包含实现正常运行所必须的其他器件。同时，根据具体需要，本领域的技术人员应当明白，该设备500还可包含实现其他附加功能的硬件器件。此外，本领域的技术人员应当明白，该设备500也可仅仅包含实现本申请实施例所必须的器件或模块，而不必包含图5中所示的全部器件。
本领域内的技术人员应明白，本申请实施例可提供为方法、系统、或计算机程序产品。因此，本申请实施例可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的 实施例的形式。而且，本申请实施例可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本申请实施例是参照根据本申请实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
显然，本领域的技术人员可以对本申请实施例进行各种改动和变型而不脱离本申请的精神和范围。这样，倘若本申请实施例的这些修改和变型属于本申请权利要求及其等同技术的范围之内，则本申请也意图包含这些改动和变型在内。

Claims (16)

  1. 一种网络业务传输的方法，其特征在于，包括：
    获取网络拓扑信息以及网络业务信息，其中所述网络拓扑信息包括网络中各个节点以及所述各个节点之间的连接关系，所述网络业务信息包括需要传输的至少一个网络业务的流量信息、用于传输所述至少一个网络业务中各个网络业务的源端节点和宿端节点；
    根据所述网络拓扑信息和所述网络业务信息中所包括的用于传输各个网络业务的源端节点和宿端节点，分别确定其它节点集合中每个节点的节点向心性，所述节点向心性用于指示节点经过所述源端节点和宿端节点所在的最短传输路径的可能性，所述其它节点集合中不包括所述源端节点和宿端节点，且所述其它节点集合中的节点为所述网络中的节点；
    根据所述其它节点集合中每个的节点向心性，从所述其它节点集合中确定至少一个分段节点，其中所述分段节点为各个网络业务的最短传输路径中共同经过的一个中间节点；
    根据所述至少一个分段节点、各个网络业务的源端节点和宿端节点，确定分别用于传输各个网络业务的至少一个传输路径；
    根据所述至少一个网络业务的流量信息和分别用于传输各个网络业务的至少一个传输路径，确定分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量。
  2. 如权利要求1所述的方法，其特征在于，根据所述其它节点集合中每个节点的节点向心性，从所述其它节点集合中确定至少一个分段节点，包括：
    按照节点向心性的大小对所述其它节点集合中节点进行排序以获取排在前K的节点；
    将所述排在前K的节点确定为所述至少一个分段节点；其中K为大于等于1的正整数。
  3. 如权利要求1或2所述的方法，其特征在于，所述其它节点集合中节点的节点向心性满足下述表达式：
    Figure PCTCN2017115328-appb-100001
    其中，V表示网络中所有节点的集合，v表示其它节点集合中的任一节点、且所述其它节点集合中包括所述网络中除所述源端节点和宿端节点以外的各个节点，s表示用于传输所述所述至少一个网络业务中的一个网络业务的源端节点，t用于表示用于接收所述一个网络业务的宿端节点，δ(v)用于表示v的节点向心性，σst用于表示网络中s和t之间最短传输路径的条数，σst(v)用于表示v在σst条最短传输路径中所经过的最短传输路径的条数。
  4. 如权利要求1或2所述的方法，其特征在于，所述其它节点集合中节点的节点向心性满足下述表达式：
    Figure PCTCN2017115328-appb-100002
    其中，v表示其它节点集合中的任一节点，V′表示所述其它节点集合，所述其它节点集合中包括的节点为所述网络中同时经过用于传输各个网络业务的最短传输路径、且除所述源端节点和宿端节点以外的节点，δ(v)表示v的节点向心性，v-表示所述网络中与v入连接的节点的个数，v+表示所述网络中与v出连接的节点的个数。
  5. 如权利要求1所述的方法，其特征在于，根据所述其它节点集合中每个节点的节 点向心性，从所述其它节点集合中确定至少一个分段节点，包括：
    根据所述其它节点集合中每个节点的节点向心性，确定所述其它节点集合中包括的各个节点组的组向心性，其中所述节点组中包括J个节点，且J为大于等于1的正整数；
    从各个节点组中选择组向心性最大的节点组，并将所述组向心性最大的节点组中所包括的J个节点确定为所述至少一个分段节点。
  6. 如权利要求5所述的方法，其特征在于，所述其它节点集合中包括的各个节点组的组向心性满足下述表达式：
    Figure PCTCN2017115328-appb-100003
    其中，V表示网络中所有节点的集合，C表示其它节点集合中的一个节点组、且所述其它节点集合中包括所述网络中除所述源端节点和宿端节点以外的各个节点，s表示用于传输所述所述至少一个网络业务中的一个网络业务的源端节点，t表示用于接收所述一个网络业务的宿端节点，δ(C)表示C的组向心性，σst表示网络中s和t之间最短传输路径的条数，σst(C)表示C中所包括的各个节点在σst条最短传输路径中所经过的路径的条数之和。
  7. 如权利要求1至6任一所述的方法，其特征在于，根据所述至少一个网络业务的流量信息和分别用于传输各个网络业务的至少一个传输路径，确定分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量，包括：
    确定分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量转发比；
    根据确定的所述流量转发比和所述至少一个网络业务的流量信息，确定用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量。
  8. 如权利要求7所述的方法，其特征在于，分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量转发比满足下述表达式：
    min  θ，
    Figure PCTCN2017115328-appb-100004
    Figure PCTCN2017115328-appb-100005
    Figure PCTCN2017115328-appb-100006
    其中，E用于表示网络中的边集，且边集中的每条边用于表示网络中两个节点直接连接的关系，e用于表示网络中的边，F用于表示需要传输的至少一个网络业务的流量信息，f用于表示用于传输网络业务的路径上的流量信息，Tf用于表示用于传输各个网络业务的路径的集合，t用于表示其中一个网络业务的路径，St用于表示用于传输各个网络业务的分段路径的集合，且分段路径为源端节点到中间节点之间的路径或者中间节点到宿端节点之间的路径，s用于表示分段路径，PS用于表示最短分段路径的集合，且最短分段路径为源端节点到中间节点最短路径、或中间节点到宿端节点最短路径，p用于表示最短分段路径，xf,t用于表示流量转发比，Df用于表示流量信息f的带宽需求，Ip,e用于表示边e为最短分段路径中的一条边的可能性，Ce用于表示边e所能够承载的最大业务流量的大小，θ用于表示预设的比例值。
  9. 一种网络业务传输的系统，其特征在于，包括：
    获取模块，用于获取网络拓扑信息以及网络业务信息，其中所述网络拓扑信息包括网络中各个节点以及所述各个节点之间的连接关系，所述网络业务信息包括需要传输的至少一个网络业务的流量信息、用于传输所述至少一个网络业务中各个网络业务的源端节点和宿端节点；
    分段节点确定模块，用于根据所述网络拓扑信息和所述网络业务信息中所包括的用于传输各个网络业务的源端节点和宿端节点，分别确定其它节点集合中每个节点的节点向心性，所述节点向心性用于指示节点经过所述源端节点和宿端节点所在的最短传输路径的可能性，所述其它节点集合中不包括所述源端节点和宿端节点，且所述其它节点集合中的节点为所述网络中的节点；并根据所述其它节点集合中每个的节点向心性，从所述其它节点集合中确定至少一个分段节点，其中所述分段节点为各个网络业务的最短传输路径中共同经过的一个中间节点；
    业务流量确定模块，用于根据所述至少一个分段节点、各个网络业务的源端节点和宿端节点，确定分别用于传输各个网络业务的至少一个传输路径；根据所述至少一个网络业务的流量信息和分别用于传输各个网络业务的至少一个传输路径，确定分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量。
  10. 如权利要求9所述的系统，其特征在于，所述分段节点确定模块根据所述其它节点集合中每个节点的节点向心性，从所述其它节点集合中确定至少一个分段节点，具体用于：
    按照节点向心性的大小对所述其它节点集合中节点进行排序以获取排在前K的节点；并将所述排在前K的节点确定为所述至少一个分段节点；其中K为大于等于1的正整数。
  11. 如权利要求9或10所述的系统，其特征在于，所述其它节点集合中节点的节点向心性满足下述表达式：
    Figure PCTCN2017115328-appb-100007
    其中，V表示网络中所有节点的集合，v表示其它节点集合中的任一节点、且所述其它节点集合中包括所述网络中除所述源端节点和宿端节点以外的各个节点，s表示用于传输所述所述至少一个网络业务中的一个网络业务的源端节点，t用于表示用于接收所述一个网络业务的宿端节点，δ(v)用于表示v的节点向心性，σst用于表示网络中s和t之间最短传输路径的条数，σst(v)用于表示v在σst条最短传输路径中所经过的最短传输路径的条数。
  12. 如权利要求9或10所述的系统，其特征在于，所述其它节点集合中节点的节点向心性满足下述表达式：
    Figure PCTCN2017115328-appb-100008
    其中，v表示其它节点集合中的任一节点，V′表示所述其它节点集合，所述其它节点集合中包括的节点为所述网络中同时经过用于传输各个网络业务的最短传输路径、且除所述源端节点和宿端节点以外的节点，δ(v)表示v的节点向心性，v-表示所述网络中与v入连接的节点的个数，v+表示所述网络中与v出连接的节点的个数。
  13. 如权利要求9所述的系统，其特征在于，所述分段节点确定模块根据所述其它节点集合中每个节点的节点向心性，从所述其它节点集合中确定至少一个分段节点，具体用于：
    根据所述其它节点集合中每个节点的节点向心性，确定所述其它节点集合中包括的各个节点组的组向心性，其中所述节点组中包括J个节点，且J为大于等于1的正整数；并从各个节点组中选择组向心性最大的节点组，并将所述组向心性最大的节点组中所包括的K个节点确定为所述至少一个分段节点。
  14. 如权利要求13所述的系统，其特征在于，所述其它节点集合中包括的各个节点组的组向心性满足下述表达式：
    Figure PCTCN2017115328-appb-100009
    其中，V表示网络中所有节点的集合，C表示其它节点集合中的一个节点组、且所述其它节点集合中包括所述网络中除所述源端节点和宿端节点以外的各个节点，s表示用于传输所述所述至少一个网络业务中的一个网络业务的源端节点，t表示用于接收所述一个网络业务的宿端节点，δ(C)表示C的组向心性，σst表示网络中s和t之间最短传输路径的条数，σst(C)表示C中所包括的各个节点在σst条最短传输路径中所经过的路径的条数之和。
  15. 如权利要求9至14任一所述的系统，其特征在于，所述业务流量确定模块根据所述至少一个网络业务的流量信息和分别用于传输各个网络业务的至少一个传输路径，确定分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量，具体用于：
    确定分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量转发比；并根据确定的所述流量转发比和所述至少一个网络业务的流量信息，确定用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量。
  16. 如权利要求15所述的系统，其特征在于，分别用于传输各个网络业务的至少一个传输路径上需要传输的网络业务的流量转发比满足下述表达式：
    min  θ，
    Figure PCTCN2017115328-appb-100010
    Figure PCTCN2017115328-appb-100011
    Figure PCTCN2017115328-appb-100012
    其中，E用于表示网络中的边集，且边集中的每条边用于表示网络中两个节点直接连接的关系，e用于表示网络中的边，F用于表示需要传输的至少一个网络业务的流量信息，f用于表示用于传输网络业务的路径上的流量信息，Tf用于表示用于传输各个网络业务的路径的集合，t用于表示其中一个网络业务的路径，St用于表示用于传输各个网络业务的分段路径的集合，且分段路径为源端节点到中间节点之间的路径或者中间节点到宿端节点之间的路径，s用于表示分段路径，PS用于表示最短分段路径的集合，且最短分段路径为源端节点到中间节点最短路径、或中间节点到宿端节点最短路径，p用于表示最短分段路径，xf,t用于表示流量转发比，Df用于表示流量信息f的带宽需求，Ip,e用于表示边e为最短分段路径中的一条边的可能性，Ce用于表示边e所能够承载的最大业务流量的大小，θ用于表示预设的比例值。
PCT/CN2017/115328 2017-03-14 2017-12-08 一种网络业务传输的方法及系统 WO2018166249A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US16/569,239 US11252077B2 (en) 2017-03-14 2019-09-12 Network service transmission method and system

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710149180.3A CN108574594B (zh) 2017-03-14 2017-03-14 一种网络业务传输的方法及系统
CN201710149180.3 2017-03-14

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/569,239 Continuation US11252077B2 (en) 2017-03-14 2019-09-12 Network service transmission method and system

Publications (1)

Publication Number Publication Date
WO2018166249A1 true WO2018166249A1 (zh) 2018-09-20

Family

ID=63523702

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/115328 WO2018166249A1 (zh) 2017-03-14 2017-12-08 一种网络业务传输的方法及系统

Country Status (3)

Country Link
US (1) US11252077B2 (zh)
CN (1) CN108574594B (zh)
WO (1) WO2018166249A1 (zh)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112242950B (zh) * 2019-07-18 2022-05-17 华为技术有限公司 确定路径的方法和相关设备
CN111817959A (zh) * 2020-07-16 2020-10-23 迈普通信技术股份有限公司 网络路径管理方法、装置、sdn控制器及可读存储介质
CN112311687B (zh) * 2020-10-26 2022-04-01 新华三大数据技术有限公司 一种流量调度方法及装置
CN115150320B (zh) * 2021-03-31 2023-12-08 北京华为数字技术有限公司 报文传输方法、装置及系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100260177A1 (en) * 2007-12-27 2010-10-14 Chuanjun Wu Path selection method and network system, path computation element
CN102223671A (zh) * 2010-04-15 2011-10-19 华为技术有限公司 无线多跳网络中数据传输的方法和通信设备
CN103036792A (zh) * 2013-01-07 2013-04-10 北京邮电大学 一种最大化最小公平多数据流传输调度方法
CN104283789A (zh) * 2014-09-19 2015-01-14 深圳市腾讯计算机系统有限公司 路由收敛方法和系统

Family Cites Families (29)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6584071B1 (en) * 1999-08-03 2003-06-24 Lucent Technologies Inc. Routing with service level guarantees between ingress-egress points in a packet network
US6778531B1 (en) * 1999-11-04 2004-08-17 Lucent Technologies Inc. Multicast routing with service-level guarantees between ingress egress-points in a packet network
US20040049595A1 (en) * 2001-12-04 2004-03-11 Mingzhou Sun System for proactive management of network routing
NO321340B1 (no) * 2003-12-30 2006-05-02 Telenor Asa Fremgangsmate for a administrere nettverk ved analyse av konnektivitet
US7957266B2 (en) * 2004-05-28 2011-06-07 Alcatel-Lucent Usa Inc. Efficient and robust routing independent of traffic pattern variability
CN1770701A (zh) * 2004-11-03 2006-05-10 华为技术有限公司 Mesh网中时钟跟踪的实现方法
EP2395711B1 (en) * 2010-06-11 2013-10-16 Alcatel Lucent Method and router for improved updating of a routing information base
WO2013059683A1 (en) * 2011-10-19 2013-04-25 The Regents Of The University Of California Comprehensive multipath routing for congestion and quality-of-service in communication networks
US8976710B2 (en) * 2011-12-27 2015-03-10 Infosys Limited Methods for discovering and analyzing network topologies and devices thereof
KR101329350B1 (ko) * 2012-06-15 2013-11-14 한국과학기술원 그래프의 매개 중심성 갱신 방법
US9680915B2 (en) * 2012-09-12 2017-06-13 Infosys Limited Methods for clustering networks based on topology discovery and devices thereof
US9276838B2 (en) * 2012-10-05 2016-03-01 Futurewei Technologies, Inc. Software defined network virtualization utilizing service specific topology abstraction and interface
CN103229468B (zh) * 2012-11-19 2016-05-25 华为技术有限公司 分组交换资源分配方法及设备
US9253077B2 (en) * 2012-11-30 2016-02-02 International Business Machines Corporation Parallel top-K simple shortest paths discovery
US20140226525A1 (en) * 2013-02-13 2014-08-14 Futurewei Technologies, Inc. Safe Multicast Distribution with Predictable Topology Changes
US9124506B2 (en) * 2013-06-07 2015-09-01 Brocade Communications Systems, Inc. Techniques for end-to-end network bandwidth optimization using software defined networking
CN105379196B (zh) * 2013-06-14 2019-03-22 微软技术许可有限责任公司 用于容错和负载平衡路由的方法、系统和计算机存储介质
US9369387B2 (en) 2013-10-24 2016-06-14 Cisco Technology, Inc. Segment routing based wide area network orchestration in a network environment
US9590892B2 (en) * 2013-12-02 2017-03-07 University Of Ontario Institute Of Technology Proactive controller for failure resiliency in communication networks
US9397957B2 (en) * 2013-12-23 2016-07-19 Google Inc. Traffic engineering for large scale data center networks
US10172068B2 (en) * 2014-01-22 2019-01-01 Cisco Technology, Inc. Service-oriented routing in software-defined MANETs
US10098051B2 (en) * 2014-01-22 2018-10-09 Cisco Technology, Inc. Gateways and routing in software-defined manets
US9225629B2 (en) * 2014-05-30 2015-12-29 Telefonaktiebolaget L M Ericsson (Publ) Efficient identification of node protection remote LFA target
CN104009915B (zh) * 2014-06-09 2017-12-01 北京邮电大学 一种利用带宽分配简化网络的路由方法
US9628380B2 (en) * 2015-03-06 2017-04-18 Telefonaktiebolaget L M Ericsson (Publ) Method and system for routing a network function chain
US10158566B2 (en) * 2015-03-20 2018-12-18 Telefonaktiebolaget Lm Ericsson (Publ) Shortest path bridge with MPLS labels
CN105376112B (zh) * 2015-11-24 2018-06-19 清华大学 中间处理约束下的异构网络资源配置方法
US20170171066A1 (en) * 2015-12-09 2017-06-15 Alcatel-Lucent Usa, Inc. Optimizing restoration with segment routing
US10469348B2 (en) * 2016-12-29 2019-11-05 Futurewei Technologies, Inc. Centrality-based caching in information-centric networks

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100260177A1 (en) * 2007-12-27 2010-10-14 Chuanjun Wu Path selection method and network system, path computation element
CN102223671A (zh) * 2010-04-15 2011-10-19 华为技术有限公司 无线多跳网络中数据传输的方法和通信设备
CN103036792A (zh) * 2013-01-07 2013-04-10 北京邮电大学 一种最大化最小公平多数据流传输调度方法
CN104283789A (zh) * 2014-09-19 2015-01-14 深圳市腾讯计算机系统有限公司 路由收敛方法和系统

Also Published As

Publication number Publication date
US20200007433A1 (en) 2020-01-02
CN108574594B (zh) 2020-04-03
CN108574594A (zh) 2018-09-25
US11252077B2 (en) 2022-02-15

Similar Documents

Publication Publication Date Title
WO2018166249A1 (zh) 一种网络业务传输的方法及系统
CN108243044B (zh) 业务部署的方法与装置
CN104052811A (zh) 一种业务调度的方法、装置及系统
EP3151483B1 (en) Path planning method and controller
CN113033800B (zh) 分布式深度学习方法、装置、参数服务器及主工作节点
WO2014208661A1 (ja) 仮想マシン配置設計装置及び方法とシステム並びにプログラム
CN103179052A (zh) 一种基于接近度中心性的虚拟资源分配方法及系统
EP3868062B1 (en) Methods and apparatus for transmitting data over multiple paths in a network
CN109361547B (zh) 一种网络切片链路部署方法与装置
CN105634974A (zh) 软件定义网络中的路由确定方法和装置
CN106104503B (zh) 使用统一api对用于转发的服务器和架构编程以用于细粒度网络优化
WO2023082431A1 (zh) 一种多口字环形结构下的流量调度方法和系统
CN111865681A (zh) 核心网切片端到端的时延优化方法、系统与存储介质
Kalinin et al. Increasing the fault tolerance and availability of software defined networks using network equipment control based on multiobjective optimization by service quality parameters
US9692667B2 (en) Stream processing method, apparatus, and system
CN107528731B (zh) 应用于ns3并行仿真的网络分割优化算法
US10341137B2 (en) Computer cluster system
CN106878356B (zh) 一种调度方法及计算节点
Nishanbayev et al. Evaluating the effectiveness of a software-defined cloud data center with a distributed structure
JP2020126487A (ja) 並列処理装置、データ転送先決定方法およびデータ転送先決定プログラム
Zhu et al. A customized and cost-efficient backup scheme in software-defined networks
CN105721234B (zh) 端口聚合方法及装置
CN114035906A (zh) 虚拟机迁移方法、装置、电子设备及存储介质
US20170262316A1 (en) Allocation of resources
Kumarasinghe et al. Visiri-distributed complex event processing system for handling large number of queries

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17900793

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17900793

Country of ref document: EP

Kind code of ref document: A1