WO2019061169A1 - 一种基于混合资源的路由选路方法、装置和服务器 - Google Patents

一种基于混合资源的路由选路方法、装置和服务器 Download PDF

Info

Publication number
WO2019061169A1
WO2019061169A1 PCT/CN2017/104033 CN2017104033W WO2019061169A1 WO 2019061169 A1 WO2019061169 A1 WO 2019061169A1 CN 2017104033 W CN2017104033 W CN 2017104033W WO 2019061169 A1 WO2019061169 A1 WO 2019061169A1
Authority
WO
WIPO (PCT)
Prior art keywords
network
path
node
weight value
delay weight
Prior art date
Application number
PCT/CN2017/104033
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 深圳前海达闼云端智能科技有限公司
Priority to PCT/CN2017/104033 priority Critical patent/WO2019061169A1/zh
Priority to CN201780003266.3A priority patent/CN108401492B/zh
Publication of WO2019061169A1 publication Critical patent/WO2019061169A1/zh
Priority to US16/831,724 priority patent/US11082326B2/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/121—Shortest path evaluation by minimising delays
    • 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
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/125—Shortest path evaluation based on throughput or bandwidth
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/78—Architectures of resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources

Definitions

  • the embodiments of the present application relate to the field of network communication technologies, for example, to a hybrid resource-based routing and routing method, apparatus, and server.
  • two network nodes In a network environment, two network nodes often have multiple network resources, such as an Internet link connection or a dedicated link connection (for example, a physical fiber link connection). Different levels of users can select different network resources.
  • a directed graph is defined for each network node, only one network resource can define a directed edge between any two network nodes. For example, only a directed edge is defined for the Internet resource or a directed edge is defined only for the dedicated line resource.
  • the inventor found that at least the following problems exist in the related art: the current directed graph can only reflect the information of one network resource, and the routing algorithm cannot be flexibly dispatched in the network when constructing the communication path. Network resources.
  • An object of the embodiments of the present application is to provide a method, a device, and a server for routing routing based on a hybrid resource, which can reflect information of at least two network resources in a directed graph, and can flexibly invoke network resources in the network.
  • an embodiment of the present application provides a routing method based on a hybrid resource, where the routing method is applied to a server, and the server is communicatively connected to a multi-node network, where the multi-node network includes at least two networks.
  • the method includes:
  • the embodiment of the present application further provides a routing routing device based on a hybrid resource, where the routing device is applied to a server, the server is communicatively connected to a multi-node network, and the multi-node network includes at least two a network node, the device comprising:
  • a directed graph building module configured to construct a directed graph for the multi-node network, and if at least two network resources are included between any two network nodes, constructing a directed edge for at least two network resources in the network resource ;
  • a delay weight value determining module configured to receive node information of each network node, obtain a delay weight value between any two network nodes under any network resource according to the node information, and allocate the delay weight value to Corresponding directed edges.
  • the embodiment of the present application further provides a server, including:
  • At least one processor and,
  • the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to perform the method as described above.
  • the routing method, device, and server provided by the embodiments of the present application construct a directed edge for at least two network resources in the network resource by using two or more network resources between two network nodes.
  • the information of at least two network resources can be embodied in the directed graph, and the network resources in the network can be flexibly invoked.
  • FIG. 1 is a schematic diagram of an application scenario of a routing method and apparatus of the present application
  • FIG. 2 is a schematic diagram of a network node having two network resources between two network nodes
  • FIG. 3 is a flow chart of an embodiment of a routing method of the present application.
  • FIG. 4 is a diagram showing an example of a directed edge in the routing method of the present application.
  • FIG. 5 is a flow chart of an embodiment of a routing method of the present application.
  • FIG. 6 is a diagram showing an example of a directed graph in the routing method of the present application.
  • FIG. 7 is a flow chart of an embodiment of a routing method of the present application.
  • Figure 8 is a schematic structural view of an embodiment of a routing device of the present application.
  • FIG. 9 is a schematic structural view of an embodiment of a routing device of the present application.
  • Figure 10 is a schematic structural view of an embodiment of a routing device of the present application.
  • FIG. 11 is a schematic structural view of an embodiment of a routing device of the present application.
  • FIG. 12 is a schematic diagram showing the hardware structure of an embodiment of the server of the present application.
  • the hybrid resource-based routing routing method and apparatus provided by the present application are applicable to the application scenario shown in FIG. 1, and include a multi-node network 20 and a server 10, and any one of the multi-node networks 20 is communicably connected to the server 10.
  • the multi-node network 20 includes a plurality of network nodes, and FIG. 1 exemplarily shows the network node A, the network node B, the network node C, the network node D, and the network node E, and further includes more networks in the actual network environment. Nodes, each network node can support routing functions, and can send and receive data between each other.
  • a data collection device (not shown) may be disposed on each network node for collecting data such as bandwidth, delay, jitter, and packet loss ratio between the two network nodes.
  • network node A and network node B have network resources 1 and network resources 2, such as Internet resources and dedicated resources.
  • the data packet may be transmitted from the network node A to the network node B through the network resource 1, or may be transmitted from the network node A to the network node B through the network resource 2.
  • Server 10 is used to manage the transmission path of data packets between network nodes, and server 10 may define a directed graph that includes one or more communication paths (see Figure 1).
  • the transmission path of the data packet is constructed between the source network node and the destination network node according to the directed graph, and the transmission path is sent to the corresponding network node, corresponding to The network node forwards the data packet according to the transmission path information.
  • the server 10 is a device that provides a computing service.
  • the server is composed of a processor, a hard disk, a memory, a system bus, etc.
  • the server is similar to a general computer architecture, but is capable of processing, stability, and reliability due to the need to provide highly reliable services. Sex, security, scalability, manageability and other aspects are high.
  • the server 10 constructs the directed graph
  • a directed edge is constructed for at least two network resources in the network resource.
  • Each network node periodically transmits data such as collected bandwidth, delay, jitter, and packet loss rate to the server 10.
  • the server 10 obtains a delay weight value of any directed edge according to one or more values in the data.
  • the scheme can simultaneously include at least two network resource information into the directed graph, and the routing algorithm can be flexibly scheduled. Network resources in the network.
  • the embodiment of the present application provides a route routing method based on a hybrid resource, which may be performed by the server 10 in FIG. 1.
  • the routing method includes:
  • any two network nodes construct a directed edge. If there is only one network resource between the two network nodes, a directed edge is constructed for the network resource between the two network nodes; if there are more than two between the two network nodes
  • the network resource selects two or more network resources from two or more network resources, and constructs a directed edge for the two or more network resources.
  • the network node 1 and the network node B include a network resource 1 and a network resource 2, and a directed edge can be constructed for both the network resource 1 and the network resource 2.
  • network node A and network node B include more network resources, at least two network resources may be selected to construct a directed edge for them. For example, if you include three network resources, you can select two network resources to construct directed edges, or you can select all three network resources to construct directed edges.
  • the directed edge refers to a directional edge, for example, the directed edge between the network node A and the network node B may be A->B or B->A.
  • any two network nodes include at least two network resources
  • constructing a directed edge for at least two network resources in the network resource including:
  • the two endpoints of the directed edge of one network resource between the two network nodes are the two network nodes, and the two endpoints of the directed edges of other network resources are respectively corresponding to the two network nodes.
  • Logical node The two endpoints of the directed edge of one network resource between the two network nodes are the two network nodes, and the two endpoints of the directed edges of other network resources are respectively corresponding to the two network nodes.
  • different endpoints can be set for the directed edges of different network resources respectively, because there are only two network nodes, so it is necessary to set a virtual logical node, so that network resource 1 and network resources are included between network node A and network node B in FIG. 2
  • a logical node A' corresponding to the network node A and a logical node B' corresponding to the network node B may be set.
  • Network node A and network node B as network resources 1
  • the two endpoints of the directed edge use logical node A' and logical node B' as the two endpoints of the directed edge of network resource 2. Please refer to Figure 4.
  • Network Node B is the same as Logical Node B'.
  • the network node and its corresponding logical node can be represented by different IP addresses. For example, if network resource 1 is an Internet resource and network resource 2 is a dedicated network resource, network node A and network node B can be represented by a public network IP address. Node A' and logical node B' can be represented by an intranet IP address.
  • Step 102 Receive node information of each network node, obtain a delay weight value between any two network nodes under any network resource according to the node information, and allocate the delay weight value to the corresponding directed edge.
  • the node information may be one or more of bandwidth, delay, jitter, and packet loss rate.
  • the node information includes a delay, a jitter, and a packet loss rate of the network node A to the network node B, and the server 10 is configured according to the server.
  • the above delay, jitter and packet loss rate calculations obtain the delay weight values of the directed edges from the network node A to the network node B.
  • the routing method provided by the embodiment of the present application constructs a directed edge for at least two network resources in the network resource by using two or more network resources between two network nodes.
  • the information of at least two network resources can be embodied in the directed graph, and the network resources in the network can be flexibly invoked.
  • the method is in addition to 201 and 202 (refer to 101 and 102 for details of 201 and 202), and further includes:
  • the delay weight values of the three communication paths can be calculated as 145, 115, and 95, respectively.
  • the optimal path from the network node S to the network node D can be obtained according to the shortest path routing algorithm as S->A->B'->D.
  • At least two network resources in the network resource are constructed with directed edges.
  • the information of at least two network resources may be embodied in the directed graph, and the routing method may select an optimal path from the path including each network resource, thereby improving the efficiency of data packet transmission.
  • the network resource 1 and the network resource 2 may also be used from the network node S to the network node D, and the traffic distribution between the two is performed according to the delay weight value. balanced.
  • the method is in addition to 301 and 302 (see 101 and 102 for details of 301 and 302), and further includes:
  • the delay weight values of the three communication paths S->A->B->D, S->D, and S->A->B'->D are obtained, respectively, 145, 115, and 95.
  • the communication path includes at least two network resources, obtain an optimal path that utilizes each network resource.
  • the optimal path using network resource 1 is S->D
  • the delay weight value is 115
  • the optimal path using network resource 2 is S->A->B'->D
  • the delay weight value is 95.
  • the bandwidth usage rate and the delay weight value can be considered at the same time. If the bandwidth usage of an optimal path is large, the traffic flowing through the path can be appropriately reduced. If the delay weight value of an optimal path is small, Traffic that flows through this path can be increased as appropriate.
  • the path usage weight of the optimal path is set to a weight minimum threshold W min ;
  • the path usage weights of the optimal paths S->D and S->A->B’->D are respectively:
  • a directed edge is constructed for at least two network resources in the network resource.
  • the information of at least two network resources may be embodied in the directed graph.
  • the optimal path using each network resource is selected according to the directed graph, and at least two network resources are used simultaneously for data packet transmission, which can be avoided.
  • the bandwidth usage of a communication path is too high, which further improves the efficiency of data packet transmission.
  • the method further includes:
  • the delay weight value of the directed edge corresponding to the network resource between the two network nodes is set to be greater than the first preset threshold.
  • the delay weight value of the directed edge corresponding to the network resource may be set to a larger value, so that the calculation method does not select the network resource again.
  • the path, the routing mechanism can seamlessly switch the link to another network resource to ensure the normal transmission of the data packet.
  • the delay weight value of the directed edge A'->B' can be set to a larger value. Therefore, the first preset threshold needs to take a larger value, for example, 100000. In practical applications, the delay weight value of the directed edge A'->B' can also be directly set to infinity.
  • the method further includes:
  • the delay weight value of the directed edge of the user under the network resource is set to be greater than the first preset threshold.
  • the user may have the advanced network resource.
  • the delay weight value to the edge is set to a larger value, such as infinity.
  • the embodiment of the present application further provides a routing routing device based on a hybrid resource.
  • the routing device is disposed in the server 10 shown in FIG. 1.
  • the routing device 800 includes :
  • a directed graph construction module 801 configured to construct a directed graph for the multi-node network, and if at least two network resources are included between any two network nodes, construct a directed resource for at least two network resources in the network resource side;
  • a delay weight value determining module 802 configured to receive node information of each network node, according to the section The point information obtains a delay weight value between any two network nodes under any network resource, and assigns the delay weight value to the corresponding directed edge.
  • the routing device constructs a directed edge for at least two network resources in the network resource by using two or more network resources between two network nodes.
  • the information of at least two network resources can be embodied in the directed graph, and the network resources in the network can be flexibly invoked.
  • the routing device 800 further includes:
  • the first delay weight value setting module 803 is configured to set a delay weight value of the directed edge corresponding to the network resource between the two network nodes when a network resource between any two network nodes fails. It is greater than the first preset threshold.
  • the routing device 800 further includes:
  • the second delay weight value setting module 804 is configured to: if the user does not have the right to use a certain network resource, set the delay weight value of the directed edge of the user under the network resource to be greater than the first preset. Threshold.
  • the directed graph construction module 801 is specifically configured to:
  • the two endpoints of the directed edge of one network resource between the two network nodes are the two network nodes, and the two endpoints of the directed edges of other network resources are respectively corresponding to the two network nodes.
  • Logical node The two endpoints of the directed edge of one network resource between the two network nodes are the two network nodes, and the two endpoints of the directed edges of other network resources are respectively corresponding to the two network nodes.
  • the routing device 800 further includes:
  • the first path construction module 805 is configured to:
  • the optimal path is selected according to the delay weight value of the communication path.
  • the routing device 800 further includes:
  • the second path construction module 806 is configured to:
  • the communication path includes at least two network resources, obtaining an optimal path using each network resource;
  • the network traffic is passed through the respective optimal paths according to the path usage weight.
  • the second path building module 806 is specifically configured to:
  • the path usage weight of the optimal path is set to the weight minimum threshold Wmin ;
  • x represents the delay weight value of each optimal path
  • i represents the sequence number of the optimal path
  • n represents the number of optimal paths.
  • routing device can perform the routing method provided by the embodiment of the present application, and has the corresponding functional modules and beneficial effects of the execution method.
  • routing method provided by the embodiment of the present application.
  • FIG. 12 is a schematic diagram showing the hardware structure of the server 10 according to the embodiment of the present application. As shown in FIG. 12, the server 10 includes:
  • processors 11 and a memory 12 are exemplified by a processor 11 in FIG.
  • the processor 11 and the memory 12 can be connected by a bus or other means, as exemplified by a bus connection in FIG.
  • the memory 12 is a non-volatile computer readable storage medium, and can be used for storing non-volatile software programs, non-volatile computer-executable programs, and modules, such as program instructions corresponding to the routing method in the embodiment of the present application. / Module (for example, directed graph building block 801 shown in Figure 8).
  • the processor 11 executes various functional applications and data processing of the server by executing non-volatile software programs, instructions, and modules stored in the memory 12, that is, the routing method of the above-described method embodiments.
  • the memory 12 may include a storage program area and an storage data area, wherein the storage program area may store an operating system, an application required for at least one function; the storage data area may store data created according to usage of the routing device, and the like. Further, the memory 12 may include a high speed random access memory, and may also include a nonvolatile memory such as at least one magnetic disk storage device, flash memory device, or other nonvolatile solid state storage device. In some embodiments, memory 12 can optionally include memory remotely located relative to processor 11 that can be connected to the routing device via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
  • the one or more modules are stored in the memory 12, and when executed by the one or more processors 11, performing a routing method in any of the above method embodiments, for example, performing the above described FIG. Method steps 101-102, method steps 201 to 203 in FIG. 5, method steps 301 to 306 in FIG. 7, implementation of modules 801 and 802 in FIG. 8, and modules 801-804 in FIG. 9, FIG.
  • Embodiments of the present application provide a non-transitory computer readable storage medium storing computer-executable instructions that are executed by one or more processors, such as in FIG. a processor 11 that can cause the one or more processors to perform the routing method in any of the above method embodiments, for example, to perform the method steps 101-102 in FIG. 3 described above, the method steps in FIG. 201 to 203, method steps 301 to 306 in FIG. 7; modules 801 and 802 in FIG. 8, modules 801-804 in FIG. 9, modules 801-805 in FIG. 10, and modules 801-804 in FIG. And 806.
  • the device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, ie may be located A place, or it can be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the embodiment.
  • the storage medium may be a magnetic disk, an optical disk, a read-only memory (ROM), or a random access memory (RAM).

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Hardware Design (AREA)
  • Computer Security & Cryptography (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本申请实施例涉及一种基于混合资源的路由选路方法、装置和服务器，所述选路方法应用于服务器，所述服务器通信连接一多节点网络，所述多节点网络包括至少两个网络节点，所述方法包括：为所述多节点网络构建有向图，如果任意两个网络节点间包括至少两个网络资源，则为所述网络资源中的至少两个网络资源构建有向边；接收各个网络节点的节点信息，根据所述节点信息获得任意两个网络节点间在任一网络资源下的时延权重值，并将所述时延权重值分配给对应的有向边。通过在两个网络节点间存在两个以上的网络资源时，为所述网络资源中的至少两个网络资源构建有向边。可以在有向图中体现至少两个网络资源的信息，能够灵活调用网络中的网络资源。

Description

一种基于混合资源的路由选路方法、装置和服务器 技术领域
本申请实施例涉及网络通信技术领域，例如涉及一种基于混合资源的路由选路方法、装置和服务器。
背景技术
在网络环境中，两个网络节点之间常具有多种网络资源，例如既有互联网链路连接，也有专线链路连接(例如物理光纤链路连接)，不同级别用户可以选用不同网络资源。目前在为各网络节点定义有向图时，任意两个网络节点间只能为一个网络资源定义有向边，例如，只为互联网资源定义有向边或者只为专线资源定义有向边。
在研究现有技术的过程中，发明人发现相关技术中至少存在如下问题：目前的有向图只能将一个网络资源的信息体现出来，在构建通信路径时，选路算法无法灵活调度网络中的网络资源。
申请内容
本申请实施例的一个目的是提供一种基于混合资源的路由选路方法、装置和服务器，可以在有向图中体现至少两个网络资源的信息，能灵活调用网络中的网络资源。
第一方面，本申请实施例提供了一种基于混合资源的路由选路方法，所述选路方法应用于服务器，所述服务器通信连接一多节点网络，所述多节点网络包括至少两个网络节点，所述方法包括：
为所述多节点网络构建有向图，如果任意两个网络节点间包括至少两个网络资源，则为所述网络资源中的至少两个网络资源构建有向边；
接收各个网络节点的节点信息，根据所述节点信息获得任意两个网络节点间在任一网络资源下的时延权重值，并将所述时延权重值分配给对应的有向边。
第二方面，本申请实施例还提供了一种基于混合资源的路由选路装置，所述选路装置应用于服务器，所述服务器通信连接一多节点网络，所述多节点网络包括至少两个网络节点，所述装置包括：
有向图构建模块，用于为所述多节点网络构建有向图，如果任意两个网络节点间包括至少两个网络资源，则为所述网络资源中的至少两个网络资源构建有向边；
时延权重值确定模块，用于接收各个网络节点的节点信息，根据所述节点信息获得任意两个网络节点间在任一网络资源下的时延权重值，并将所述时延权重值分配给对应的有向边。
第三方面，本申请实施例还提供了一种服务器，包括：
至少一个处理器；以及，
与所述至少一个处理器通信连接的存储器；其中，
所述存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行，以使所述至少一个处理器能够执行如上所述的方法。
本申请实施例提供的选路方法、装置和服务器，通过在两个网络节点间存在两个以上的网络资源时，为所述网络资源中的至少两个网络资源构建有向边。可以在有向图中体现至少两个网络资源的信息，能够灵活调用网络中的网络资源。
附图说明
一个或多个实施例通过与之对应的附图中的图片进行示例性说明，这些示例性说明并不构成对实施例的限定，附图中具有相同参考数字标号的元件表示为类似的元件，除非有特别申明，附图中的图不构成比例限制。
图1是本申请选路方法和装置的应用场景示意图；
图2是两个网络节点间具有两种网络资源的网络节点示意图；
图3是本申请选路方法的一个实施例的流程图；
图4是本申请选路方法中有向边的示例图；
图5是本申请选路方法的一个实施例的流程图；
图6是本申请选路方法中有向图的示例图；
图7是本申请选路方法的一个实施例的流程图；
图8是本申请选路装置的一个实施例的结构示意图；
图9是本申请选路装置的一个实施例的结构示意图；
图10是本申请选路装置的一个实施例的结构示意图；
图11是本申请选路装置的一个实施例的结构示意图；
图12是本申请服务器的一个实施例的硬件结构示意图。
具体实施方式
为使本申请实施例的目的、技术方案和优点更加清楚，下面将结合本申请实施例中的附图，对本申请实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例是本申请一部分实施例，而不是全部的实施例。基于本申请中的实施例，本领域普通技术人员在没有作出创造性劳动前提下所获得的所有其他实施例，都属于本申请保护的范围。
本申请提供的基于混合资源的路由选路方法和装置适用于图1所示的应用场景，包括多节点网络20和服务器10，多节点网络20中的任意一个网络节点与服务器10通信连接。多节点网络20包括多个网络节点，图1只是示例性的示出了网络节点A、网络节点B、网络节点C、网络节点D和网络节点E，在实际网络环境中还包括更多的网络节点，各个网络节点可以支持路由功能，彼此间可以发送和接收数据。每个网络节点上可以设置数据采集装置(图中未示出)，用于采集两个网络节点间带宽、时延、抖动和丢包率等数据。
每两个网络节点间可以具有一种或者多种网络资源，例如图2所示，网络节点A和网络节点B之间具有网络资源1和网络资源2两种网络资源，例如互联网资源和专线资源。数据包可以通过网络资源1从网络节点A传输至网络节点B，也可以通过网络资源2从网络节点A传输至网络节点B。
服务器10用于对数据包在各网络节点间的传输路径进行管理，服务器10可以定义包括一个或更多通信路径的有向图(请参照图1)。当服务器10检测到或发起某个数据包传输任务时，根据该有向图在源网络节点和目的网络节点间构建出数据包的传输路径，并将该传输路径发送给对应的网络节点，对应的网络节点根据该传输路径信息进行数据包的转发。服务器10为提供计算服务的设备，服务器的构成包括处理器、硬盘、内存、系统总线等，服务器和通用的计算机架构类似，但是由于需要提供高可靠的服务，因此在处理能力、稳定性、可靠性、安全性、可扩展性、可管理性等方面要求较高。
具体的，服务器10在构建有向图时，如果任意两个网络节点间包括至少两个网络资源，则为所述网络资源中的至少两个网络资源构建有向边。各网络节点会定时传送采集到的带宽、时延、抖动和丢包率等数据给服务器10，服务器10根据上述数据中的一个或者多个值得到任意有向边的时延权重值。区别于现 有技术，不管两个网络节点间有多少个网络资源，都只为一个网络资源构建有向边，本方案可以同时把至少两个网络资源信息包含到有向图中，选路算法可以灵活调度网络中的网络资源。
如图3所示，本申请实施例提供了一种基于混合资源的路由选路方法，可以由图1中的服务器10执行，所述选路方法包括：
101：为所述多节点网络构建有向图，如果任意两个网络节点间包括至少两个网络资源，则为所述网络资源中的至少两个网络资源构建有向边。
即为任意两个网络节点构建有向边，如果两个网络节点间只有一个网络资源，则在该两个网络节点间为该网络资源构建有向边；如果两个网络节点间有两个以上的网络资源，则从两个以上的网络资源中选出两个或者更多个网络资源，并给该两个或更多个网络资源构建有向边。例如，如图2所示，网络节点A和网络节点B之间包括网络资源1和网络资源2，可以为网络资源1和网络资源2均构建一条有向边。如果网络节点A和网络节点B之间包括更多的网络资源，也可以从中选出至少两个网络资源为其构建有向边。例如，如果包括三个网络资源，则可以选择两个网络资源构建有向边，也可以选择全部三个网络资源均构建有向边。
其中，所述有向边是指有方向的边，例如网络节点A和网络节点B之间的有向边可以为A->B或者B->A。
其中，可选的，所述如果任意两个网络节点间包括至少两个网络资源，则为所述网络资源中的至少两个网络资源构建有向边，包括：
设置与所述两个网络节点对应的逻辑节点，所述逻辑节点具有地址，所述逻辑节点与其对应的网络节点之间的时延权重值小于第二预设阀值；
其中，所述两个网络节点间的一个网络资源的有向边的两个端点为所述两个网络节点，其他网络资源的有向边的两个端点为分别与所述两个网络节点对应的逻辑节点。
即可以分别为不同网络资源的有向边设置不同的端点，因为只有两个网络节点，因此需要设置虚拟的逻辑节点，以图2网络节点A和网络节点B之间包括网络资源1和网络资源2为例，可以设置与网络节点A对应的逻辑节点A’和与网络节点B对应的逻辑节点B’。将网络节点A和网络节点B作为网络资源1 的有向边的两个端点，将逻辑节点A’和逻辑节点B’作为网络资源2的有向边的两个端点。请参照图4。
其中，网络节点A和逻辑节点A’实际上表示同一节点，因此网络节点A和逻辑节点A’之间的时延权重值可以设置为一个很小的值，例如0.0001，因此，第二预设阀值可以取值0.0001或者更小的值。网络节点B和逻辑节点B’同理。网络节点与其对应的逻辑节点可以用不同的IP地址来表示，例如如果网络资源1为互联网资源，网络资源2为专线网络资源，则网络节点A和网络节点B可以用公网IP地址表示，逻辑节点A’和逻辑节点B’可以用内网IP地址表示。
102：接收各个网络节点的节点信息，根据所述节点信息获得任意两个网络节点间在任一网络资源下的时延权重值，并将所述时延权重值分配给对应的有向边。
其中，所述节点信息可以为带宽、时延、抖动和丢包率中的一种或几种，例如节点信息包括网络节点A到网络节点B的时延、抖动和丢包率，服务器10根据上述时延、抖动和丢包率计算获得从网络节点A到网络节点B的有向边的时延权重值。
本申请实施例提供的选路方法，通过在两个网络节点间存在两个以上的网络资源时，为所述网络资源中的至少两个网络资源构建有向边。可以在有向图中体现至少两个网络资源的信息，能够灵活调用网络中的网络资源。
可选的，如图5所示，在所述方法的其他实施例中，所述方法除了201和202之外(201和202的详细内容请参照101和102)，还包括：
203：根据所述有向图构建通信路径，并获取每个通信路径的时延权重值；
204：根据所述通信路径的时延权重值选择最优路径。
以如图6所示的有向图为例，如果构建从起始网络节点S到终止网络节点D之间的通信路径，可以构建三条通信路径，分别为S->A->B->D,S->D和S->A->A’->B’->B->D。最后一条通信路径包含了网络节点和逻辑节点，可以进行合并，合并后路径为：S->A->B’->D。由图6可以算得三个通信路径的时延权重值分别145、115和95。
可以根据最短路径选路算法获得从网络节点S到网络节点D的最优路径为S->A->B’->D。
本申请实施例通过在两个网络节点间存在两个以上的网络资源时，为所述 网络资源中的至少两个网络资源构建有向边。可以在有向图中体现至少两个网络资源的信息，选路方法可以从包含各个网络资源的路径中选择出最优路径，提高了数据包传输的效率。
可选的，在图6所示的混合资源路径有向图中，从网络节点S到网络节点D也可以同时使用网络资源1和网络资源2，两者之间流量分配按时延权重值进行负载均衡。如图7所示，在所述方法的其他实施例中，所述方法除了301和302之外(301和302的详细内容请参照101和102)，还包括：
303：根据所述有向图构建通信路径，并获取每个通信路径的时延权重值。
仍以图6为例，获得三条通信路径S->A->B->D,S->D和S->A->B’->D的时延权重值分别145、115和95。
304：如果所述通信路径包括至少两个网络资源，获得利用每个网络资源的最优路径。
利用网络资源1的最优路径为S->D，时延权重值为115，利用网络资源2的最优路径为S->A->B’->D，时延权重值为95。
305：根据各个最优路径的带宽使用率和时延权重值获得每个最优路径的路径使用权重。
可以同时考虑带宽使用率和时延权重值，如果某个最优路径的带宽使用率大，则可适当减小流过此路径的流量，如果某个最优路径的时延权重值小，则可以适当增加流过此路径的流量。
具体的，如果所述最优路径的带宽使用率超过带宽使用阀值，将该最优路径的路径使用权重设置为权重最小阀值Wmin；
否则，所述最优路径的路径使用权重为
Figure PCTCN2017104033-appb-000001
Figure PCTCN2017104033-appb-000002
以图6为例，如果两个最优路径的带宽使用率均未超过带宽使用阈值，则最优路径S->D和S->A->B’->D的路径使用权重分别为：
W1＝V1/(V1+V2)×(255-Wmin)和W2＝V2/(V1+V2)×(255-Wmin)，其中V1＝115+95-115＝95，V2＝95+115-95＝115，Wmin的值可以根据实际应用情况预先设定。
306：将网络流量按照所述路径使用权重通过各个最优路径。
本申请实施例通过在两个网络节点间存在两个以上的网络资源时，为所述网络资源中的至少两个网络资源构建有向边。可以在有向图中体现至少两个网络资源的信息，选路时根据该有向图选出利用每个网络资源的最优路径，同时使用至少两个网络资源，进行数据包传输，可以避免某条通信路径带宽使用率过高，进一步提高数据包传输的效率。
可选的，在所述方法的其他实施例中，所述方法还包括：
当任意两个网络节点间的某个网络资源出现故障时，将所述两个网络节点间该网络资源对应的有向边的时延权重值设置为大于第一预设阀值。
当两个网络节点间的某一网络资源出现故障时，可以将该网络资源对应的有向边的时延权重值设置为一个较大的值，这样算路方法不会再选择含有这个网络资源的路径，选路机制可以无缝把链路切换到另一网络资源，保证数据包的正常传输。例如图6中网络节点A和网络节点B之间的网络资源2出现故障时，可以将有向边A’->B’的时延权重值设置为一个较大的值。因此第一预设阈值需取一个较大的值，例如100000，在实际应用中，也可以直接将有向边A’->B’的时延权重值设置为无穷大。
可选的，在所述方法的其他实施例中，所述方法还包括：
如果用户不具有使用某一网络资源的权限，则将所述用户在该网络资源下的有向边的时延权重值设置为大于第一预设阀值。
在网络使用中，有些用户不具有使用较高级网络资源的权限，为了使选路算法处理该用户的任务时不会选择较高级别的网络资源，可以将该用户在该高级网络资源下的有向边的时延权重值设置为一个较大的值，例如无穷大。
相应的，本申请实施例还提供了一种基于混合资源的路由选路装置，所述选路装置设置于图1所示的服务器10内，如图8所示，所述选路装置800包括：
有向图构建模块801，用于为所述多节点网络构建有向图，如果任意两个网络节点间包括至少两个网络资源，则为所述网络资源中的至少两个网络资源构建有向边；
时延权重值确定模块802，用于接收各个网络节点的节点信息，根据所述节 点信息获得任意两个网络节点间在任一网络资源下的时延权重值，并将所述时延权重值分配给对应的有向边。
本申请实施例提供的选路装置，通过在两个网络节点间存在两个以上的网络资源时，为所述网络资源中的至少两个网络资源构建有向边。可以在有向图中体现至少两个网络资源的信息，能够灵活调用网络中的网络资源。
可选的，在所述装置的某些实施例中，如图9所示，选路装置800还包括：
第一时延权重值设置模块803，用于当任意两个网络节点间的某个网络资源出现故障时，将所述两个网络节点间该网络资源对应的有向边的时延权重值设置为大于第一预设阀值。
可选的，在所述装置的某些实施例中，如图9所示，选路装置800还包括：
第二时延权重值设置模块804，用于如果用户不具有使用某一网络资源的权限，则将所述用户在该网络资源下的有向边的时延权重值设置为大于第一预设阀值。
可选的，在所述装置的某些实施例中，所述有向图构建模块801具体用于：
设置与所述两个网络节点对应的逻辑节点，所述逻辑节点具有地址，所述逻辑节点与其对应的网络节点之间的时延权重值小于第二预设阀值；
其中，所述两个网络节点间的一个网络资源的有向边的两个端点为所述两个网络节点，其他网络资源的有向边的两个端点为分别与所述两个网络节点对应的逻辑节点。
可选的，在所述装置的其他实施例中，如图10所示，选路装置800还包括：
第一路径构建模块805，用于：
根据所述有向图构建通信路径，并获取每个通信路径的时延权重值；
根据所述通信路径的时延权重值选择最优路径。
可选的，在所述装置的其他实施例中，如图11所示，选路装置800还包括：
第二路径构建模块806，用于：
根据所述有向图构建通信路径，并获取每个通信路径的时延权重值；
如果所述通信路径包括至少两个网络资源，获得利用每个网络资源的最优路径；
根据各个最优路径的带宽使用率和时延权重值获得每个最优路径的路径使 用权重；
将网络流量按照所述路径使用权重通过各个最优路径。
可选的，在选路装置800的某些实施例中，第二路径构建模块806具体用于：
如果所述最优路径的带宽使用率超过带宽使用阀值，将该最优路径的路径使用权重设置为权重最小阀值Wmin；
否则，所述最优路径的路径使用权重为
Figure PCTCN2017104033-appb-000003
其中，
Figure PCTCN2017104033-appb-000004
x表示每个最优路径的时延权重值，i表示最优路径的序号，n表示最优路径的数量。
需要说明的是，上述选路装置可执行本申请实施例所提供的选路方法，具备执行方法相应的功能模块和有益效果。未在选路装置实施例中详尽描述的技术细节，可参见本申请实施例所提供的选路方法。
图12是本申请实施例提供的服务器10的硬件结构示意图，如图12所示，该服务器10包括：
一个或多个处理器11以及存储器12，图12中以一个处理器11为例。
处理器11和存储器12可以通过总线或者其他方式连接，图12中以通过总线连接为例。
存储器12作为一种非易失性计算机可读存储介质，可用于存储非易失性软件程序、非易失性计算机可执行程序以及模块，如本申请实施例中的选路方法对应的程序指令/模块(例如，附图8所示的有向图构建模块801)。处理器11通过运行存储在存储器12中的非易失性软件程序、指令以及模块，从而执行服务器的各种功能应用以及数据处理，即实现上述方法实施例的选路方法。
存储器12可以包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需要的应用程序；存储数据区可存储根据选路装置的使用所创建的数据等。此外，存储器12可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件、或其他非易失性固态存储器件。在一些实施例中，存储器12可选包括相对于处理器11远程设置的存储器，这些远程存储器可以通过网络连接至选路装置。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
所述一个或者多个模块存储在所述存储器12中，当被所述一个或者多个处理器11执行时，执行上述任意方法实施例中的选路方法，例如，执行以上描述的图3中的方法步骤101-102，图5中的方法步骤201至步骤203，图7中的方法步骤301至步骤306；实现图8中的模块801和802、图9中的模块801-804，图10中模块801-805，图11中模块801-804和806的功能。
上述产品可执行本申请实施例所提供的方法，具备执行方法相应的功能模块和有益效果。未在本实施例中详尽描述的技术细节，可参见本申请实施例所提供的方法。
本申请实施例提供了一种非易失性计算机可读存储介质，所述计算机可读存储介质存储有计算机可执行指令，该计算机可执行指令被一个或多个处理器执行，例如图12中的一个处理器11，可使得上述一个或多个处理器可执行上述任意方法实施例中的选路方法，例如，执行以上描述的图3中的方法步骤101-102，图5中的方法步骤201至步骤203，图7中的方法步骤301至步骤306；实现图8中的模块801和802、图9中的模块801-804，图10中模块801-805，图11中模块801-804和806。
以上所描述的装置实施例仅仅是示意性的，其中所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部模块来实现本实施例方案的目的。
通过以上的实施方式的描述，本领域普通技术人员可以清楚地了解到各实施方式可借助软件加通用硬件平台的方式来实现，当然也可以通过硬件。本领域普通技术人员可以理解实现上述实施例方法中的全部或部分流程是可以通过计算机程序来指令相关的硬件来完成，所述的程序可存储于一计算机可读取存储介质中，该程序在执行时，可包括如上述各方法的实施例的流程。其中，所述的存储介质可为磁碟、光盘、只读存储记忆体(Read-Only Memory,ROM)或随机存储记忆体(Random Access Memory,RAM)等。
最后应说明的是：以上实施例仅用以说明本申请的技术方案，而非对其限制；在本申请的思路下，以上实施例或者不同实施例中的技术特征之间也可以进行组合，步骤可以以任意顺序实现，并存在如上所述的本申请的不同方面的 许多其它变化，为了简明，它们没有在细节中提供；尽管参照前述实施例对本申请进行了详细的说明，本领域的普通技术人员应当理解：其依然可以对前述各实施例所记载的技术方案进行修改，或者对其中部分技术特征进行等同替换；而这些修改或者替换，并不使相应技术方案的本质脱离本申请各实施例技术方案的范围。

Claims (17)

  1. 一种基于混合资源的路由选路方法，所述选路方法应用于服务器，所述服务器通信连接一多节点网络，所述多节点网络包括至少两个网络节点，其特征在于，所述方法包括：
    为所述多节点网络构建有向图，如果任意两个网络节点间包括至少两个网络资源，则为网络资源中的至少两个网络资源构建有向边；
    接收各个网络节点的节点信息，根据所述节点信息获得任意两个网络节点间在任一网络资源下的时延权重值，并将所述时延权重值分配给对应的有向边。
  2. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    当任意两个网络节点间的某个网络资源出现故障时，将所述两个网络节点间该网络资源对应的有向边的时延权重值设置为大于第一预设阀值。
  3. 根据权利要求1或2所述的方法，其特征在于，所述方法还包括：
    如果用户不具有使用某一网络资源的权限，则将所述用户在该网络资源下的有向边的时延权重值设置为大于第一预设阀值。
  4. 根据权利要求1-3任意一项所述的方法，其特征在于，所述如果任意两个网络节点间包括至少两个网络资源，则为网络资源中的至少两个网络资源构建有向边，包括：
    设置与所述两个网络节点对应的逻辑节点，所述逻辑节点具有地址，所述逻辑节点与其对应的网络节点之间的时延权重值小于第二预设阀值；
    其中，所述两个网络节点间的一个网络资源的有向边的两个端点为所述两个网络节点，其他网络资源的有向边的两个端点为分别与所述两个网络节点对应的逻辑节点。
  5. 根据权利要求1-4任意一项所述的方法，其特征在于，所述方法还包括：
    根据所述有向图构建通信路径，并获取每个通信路径的时延权重值；
    根据所述通信路径的时延权重值选择最优路径。
  6. 根据权利要求1-4任意一项所述的方法，其特征在于，所述方法还包括：
    根据所述有向图构建通信路径，并获取每个通信路径的时延权重值；
    如果所述通信路径包括至少两个网络资源，获得利用每个网络资源的最优路径；
    根据各个最优路径的带宽使用率和时延权重值获得每个最优路径的路径使用权重；
    将网络流量按照所述路径使用权重通过各个最优路径。
  7. 根据权利要求6所述的方法，其特征在于，所述根据各个最优路径的带 宽使用率和时延权重值获得所述最优路径的路径使用权重，包括：
    如果所述最优路径的带宽使用率超过带宽使用阀值，将该最优路径的路径使用权重设置为权重最小阀值Wmin；
    否则，所述最优路径的路径使用权重为
    Figure PCTCN2017104033-appb-100001
    其中，
    Figure PCTCN2017104033-appb-100002
    x表示每个最优路径的时延权重值，i表示最优路径的序号，n表示最优路径的数量。
  8. 一种基于混合资源的路由选路装置，所述选路装置应用于服务器，所述服务器通信连接一多节点网络，所述多节点网络包括至少两个网络节点，其特征在于，所述装置包括：
    有向图构建模块，用于为所述多节点网络构建有向图，如果任意两个网络节点间包括至少两个网络资源，则为网络资源中的至少两个网络资源构建有向边；
    时延权重值确定模块，用于接收各个网络节点的节点信息，根据所述节点信息获得任意两个网络节点间在任一网络资源下的时延权重值，并将所述时延权重值分配给对应的有向边。
  9. 根据权利要求8所述的装置，其特征在于，所述装置还包括：
    第一时延权重值设置模块，用于当任意两个网络节点间的某个网络资源出现故障时，将所述两个网络节点间该网络资源对应的有向边的时延权重值设置为大于第一预设阀值。
  10. 根据权利要求8或9所述的装置，其特征在于，所述装置还包括：
    第二时延权重值设置模块，用于如果用户不具有使用某一网络资源的权限，则将所述用户在该网络资源下的有向边的时延权重值设置为大于第一预设阀值。
  11. 根据权利要求8-10任意一项所述的装置，其特征在于，所述有向图构建模块，具体用于：
    设置与所述两个网络节点对应的逻辑节点，所述逻辑节点具有地址，所述逻辑节点与其对应的网络节点之间的时延权重值小于第二预设阀值；
    其中，所述两个网络节点间的一个网络资源的有向边的两个端点为所述两个网络节点，其他网络资源的有向边的两个端点为分别与所述两个网络节点对应的逻辑节点。
  12. 根据权利要求8-11任意一项所述的装置，其特征在于，所述装置还包括：
    第一路径构建模块，用于：
    根据所述有向图构建通信路径，并获取每个通信路径的时延权重值；
    根据所述通信路径的时延权重值选择最优路径。
  13. 根据权利要求8-11任意一项所述的装置，其特征在于，所述装置还包括：
    第二路径构建模块，用于：
    根据所述有向图构建通信路径，并获取每个通信路径的时延权重值；
    如果所述通信路径包括至少两个网络资源，获得利用每个网络资源的最优路径；
    根据各个最优路径的带宽使用率和时延权重值获得每个最优路径的路径使用权重；
    将网络流量按照所述路径使用权重通过各个最优路径。
  14. 根据权利要求13所述的装置，其特征在于，所述第二路径构建模块具体用于：
    如果所述最优路径的带宽使用率超过带宽使用阀值，将该最优路径的路径使用权重设置为权重最小阀值Wmin；
    否则，所述最优路径的路径使用权重为
    Figure PCTCN2017104033-appb-100003
    其中，
    Figure PCTCN2017104033-appb-100004
    x表示每个最优路径的时延权重值，i表示最优路径的序号，n表示最优路径的数量。
  15. 一种服务器，其特征在于，包括：
    至少一个处理器；以及，
    与所述至少一个处理器通信连接的存储器；其中，
    所述存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行，以使所述至少一个处理器能够执行权利要求1-7任一项所述的方法。
  16. 一种非易失性计算机可读存储介质，其特征在于，所述计算机可读存储介质存储有计算机可执行指令，当所述计算机可执行指令被服务器执行时，使所述服务器执行执行权利要求1-7任一项所述的方法。
  17. 一种计算机程序产品，其特征在于，所述计算机程序产品包括存储在非易失性计算机可读存储介质上的计算机程序，所述计算机程序包括程序指令，当所述程序指令被服务器执行时，使所述服务器执行权利要求1-7任一项所述的方法。
PCT/CN2017/104033 2017-09-28 2017-09-28 一种基于混合资源的路由选路方法、装置和服务器 WO2019061169A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
PCT/CN2017/104033 WO2019061169A1 (zh) 2017-09-28 2017-09-28 一种基于混合资源的路由选路方法、装置和服务器
CN201780003266.3A CN108401492B (zh) 2017-09-28 2017-09-28 一种基于混合资源的路由选路方法、装置和服务器
US16/831,724 US11082326B2 (en) 2017-09-28 2020-03-26 Route selection method and apparatus based on hybrid resource, and server thereof

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2017/104033 WO2019061169A1 (zh) 2017-09-28 2017-09-28 一种基于混合资源的路由选路方法、装置和服务器

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/831,724 Continuation US11082326B2 (en) 2017-09-28 2020-03-26 Route selection method and apparatus based on hybrid resource, and server thereof

Publications (1)

Publication Number Publication Date
WO2019061169A1 true WO2019061169A1 (zh) 2019-04-04

Family

ID=63095115

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/104033 WO2019061169A1 (zh) 2017-09-28 2017-09-28 一种基于混合资源的路由选路方法、装置和服务器

Country Status (3)

Country Link
US (1) US11082326B2 (zh)
CN (1) CN108401492B (zh)
WO (1) WO2019061169A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112116136A (zh) * 2020-09-04 2020-12-22 上海汽车集团股份有限公司 一种最短路径的生成方法及相关装置
CN112954765A (zh) * 2021-02-24 2021-06-11 四川速宝网络科技有限公司 一种基于网络状态监控的动态算子选路方法
CN115396515A (zh) * 2022-08-19 2022-11-25 中国联合网络通信集团有限公司 资源调度方法、装置及存储介质

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019075642A1 (zh) * 2017-10-17 2019-04-25 深圳前海达闼云端智能科技有限公司 一种网络路径优化方法、系统、控制服务端以及入网端
CN109766188B (zh) * 2019-01-14 2020-12-08 长春理工大学 一种负载均衡调度方法及系统
CN110958066B (zh) * 2019-11-18 2022-09-09 腾讯科技（深圳）有限公司 增益网络的获取方法、装置、存储介质和计算机设备
CN114124942B (zh) * 2020-08-10 2023-08-15 中国移动通信集团湖南有限公司 核心网资源调度方法、装置及电子设备
CN113556573A (zh) * 2021-07-23 2021-10-26 上海哔哩哔哩科技有限公司 推流链路选择方法及系统
CN114239900A (zh) * 2021-10-13 2022-03-25 三明学院 一种最优路径的选择方法、装置、设备及可读存储介质
CN115604171B (zh) * 2022-11-29 2023-06-30 北京天维信通科技有限公司 一种网络线路选择方法、系统、终端及存储介质
CN117880766B (zh) * 2024-03-13 2024-05-28 深圳市诚立业科技发展有限公司 基于随机权重算法的短信通道路由方法
CN117978623B (zh) * 2024-04-02 2024-06-11 北京大数据先进技术研究院 应对网络攻击的韧性数据共享网络构建方法、装置和设备

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101051972A (zh) * 2007-05-24 2007-10-10 武汉理工大学 一种网格资源路由选择方法
CN101729353A (zh) * 2008-11-03 2010-06-09 华为技术有限公司 网络拓扑布局的方法、装置及系统
CN103024597A (zh) * 2012-12-26 2013-04-03 上海大学 多视点视频流多速率组播传输的最优速率分配方法
CN106571947A (zh) * 2015-11-16 2017-04-19 中国人民解放军理工大学 一种支持复杂多元网络构造的网络元模型实现方法

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7590067B2 (en) * 2003-10-24 2009-09-15 Nortel Networks Limtied Method and apparatus for deriving allowable paths through a network with intransitivity constraints
CN101267450B (zh) * 2008-03-18 2011-01-19 上海大学 基于网络编码的分布式网络应用层组播路由方法
US8631094B1 (en) * 2008-08-08 2014-01-14 Google Inc. Distributed parallel determination of single and multiple source shortest paths in large directed graphs
US8914505B2 (en) * 2012-04-19 2014-12-16 Massachusetts Institute Of Technology Methods and apparatus for tuning a network for optimal performance
US9172613B2 (en) * 2013-08-06 2015-10-27 Cisco Technology, Inc. Multiple topology routing architecture in computer networks
US9628380B2 (en) * 2015-03-06 2017-04-18 Telefonaktiebolaget L M Ericsson (Publ) Method and system for routing a network function chain
CN106572019B (zh) * 2016-11-07 2020-06-09 电子科技大学 一种时延保障混合sdn网络节能流量调度方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101051972A (zh) * 2007-05-24 2007-10-10 武汉理工大学 一种网格资源路由选择方法
CN101729353A (zh) * 2008-11-03 2010-06-09 华为技术有限公司 网络拓扑布局的方法、装置及系统
CN103024597A (zh) * 2012-12-26 2013-04-03 上海大学 多视点视频流多速率组播传输的最优速率分配方法
CN106571947A (zh) * 2015-11-16 2017-04-19 中国人民解放军理工大学 一种支持复杂多元网络构造的网络元模型实现方法

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112116136A (zh) * 2020-09-04 2020-12-22 上海汽车集团股份有限公司 一种最短路径的生成方法及相关装置
CN112954765A (zh) * 2021-02-24 2021-06-11 四川速宝网络科技有限公司 一种基于网络状态监控的动态算子选路方法
CN115396515A (zh) * 2022-08-19 2022-11-25 中国联合网络通信集团有限公司 资源调度方法、装置及存储介质

Also Published As

Publication number Publication date
US20200228436A1 (en) 2020-07-16
US11082326B2 (en) 2021-08-03
CN108401492B (zh) 2020-12-08
CN108401492A (zh) 2018-08-14

Similar Documents

Publication Publication Date Title
WO2019061169A1 (zh) 一种基于混合资源的路由选路方法、装置和服务器
Noormohammadpour et al. Datacenter traffic control: Understanding techniques and tradeoffs
US10949233B2 (en) Optimized virtual network function service chaining with hardware acceleration
US9450874B2 (en) Method for internet traffic management using a central traffic controller
US11005721B1 (en) Scalable control plane for telemetry data collection within a distributed computing system
JP2019523621A (ja) 複数のチャネルを使用してパフォーマンスを向上するインテリジェントアダプティブトランスポートレイヤー
US9584369B2 (en) Methods of representing software defined networking-based multiple layer network topology views
ES2665571T3 (es) Control de servicio en nube informática y arquitectura de gestión extendida para conectarse al estrato de red
US10531332B2 (en) Virtual switch-based congestion control for multiple TCP flows
US10785163B2 (en) Maintaining a queuing policy with multipath traffic
WO2018153221A1 (zh) 传输网络中业务服务质量的控制方法、设备及系统
Medhat et al. Near optimal service function path instantiation in a multi-datacenter environment
KR20160042441A (ko) 애플리케이션-인식 네트워크 관리
US10630579B1 (en) Ensuring separate paths for network traffic between source devices and a destination device
US20140086065A1 (en) Disjoint multi-paths with service guarantee extension
CN108476175B (zh) 使用对偶变量的传送sdn流量工程方法与系统
Bartolomeo et al. Oakestra: A lightweight hierarchical orchestration framework for edge computing
Zhu et al. A congestion-aware and robust multicast protocol in SDN-based data center networks
US9489242B2 (en) Algorithm for faster convergence through affinity override
Zinner et al. Using concurrent multipath transmission for transport virtualization: analyzing path selection
US20130201829A1 (en) Method for call admission control in mpls networks
US11411998B2 (en) Reputation-based policy in enterprise fabric architectures
Szymanski Low latency energy efficient communications in global-scale cloud computing systems
Alali et al. Calibers: A bandwidth calendaring paradigm for science workflows
US10644994B1 (en) Ensuring separate network paths between pairs of source and destination devices

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: 17927558

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205N DATED 04/09/2020)

122 Ep: pct application non-entry in european phase

Ref document number: 17927558

Country of ref document: EP

Kind code of ref document: A1