WO2016078461A1 - Procédé de calcul de chemin et serveur de calcul de chemin - Google Patents

Procédé de calcul de chemin et serveur de calcul de chemin Download PDF

Info

Publication number
WO2016078461A1
WO2016078461A1 PCT/CN2015/088044 CN2015088044W WO2016078461A1 WO 2016078461 A1 WO2016078461 A1 WO 2016078461A1 CN 2015088044 W CN2015088044 W CN 2015088044W WO 2016078461 A1 WO2016078461 A1 WO 2016078461A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
path
load information
integrated load
overloaded
Prior art date
Application number
PCT/CN2015/088044
Other languages
English (en)
Chinese (zh)
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 WO2016078461A1 publication Critical patent/WO2016078461A1/fr

Links

Images

Definitions

  • This application relates to, but is not limited to, routing techniques.
  • Routing refers to the process by which a node in a network discovers one or more paths to a destination.
  • the routing process consists of the following parts: neighbor discovery, topology discovery, and path selection.
  • neighbor discovery nodes in the network can discover neighbor nodes adjacent to them and can know how they are connected to these neighbor nodes.
  • the role of topology discovery is to enable nodes to discover other nodes in the network and know how these nodes are connected.
  • the path calculation algorithm can be used to calculate the path from the source point to the sink point.
  • Routes in an optical network need to know the types and restrictions of different resources in the network.
  • resources are unavailable and connection cannot be established.
  • In its routing algorithm all possible paths can be calculated based on one or more constraints, and an optimal path is selected according to a certain strategy, thereby optimizing network performance.
  • a constraint of “rejecting specific network resources” is included, which excludes some network elements in the network from being used to calculate the optimal path according to the attributes of the nodes and links.
  • the constraint is judged only according to the state of the link, the reachability of the node, etc., and does not consider whether the actual load of the node itself (such as CPU usage, memory usage, etc.) is overloaded, in the actual routing process.
  • the actual load overload of a node that satisfies the constraint condition causes the service route to be processed in time or correctly through the node, the route fails, and the success rate of the path calculation is low.
  • This paper proposes a method for calculating paths and a path calculation server, which can improve the success rate of path calculation.
  • a method of calculating a path comprising:
  • the path calculation server acquires comprehensive load information of each node in advance
  • the path calculation server receives the path calculation request from the client, and calculates the path according to the integrated load information of each node.
  • the path calculation server calculates the path according to the integrated load information of each node, including:
  • the path calculation server determines whether each node is overloaded according to the obtained comprehensive load information of each node, and excludes the overloaded node, and calculates the path according to the constraint condition of the integrated load information that does not include the node;
  • the path calculation server calculates the path according to the integrated load information of each node, including:
  • the path calculation server calculates a path according to a constraint condition that does not include comprehensive load information of the node
  • the path calculation server determines whether there is an overloaded node in the path according to the integrated load information of each node in the calculated path, and if not, sends the calculated path to the client.
  • the method further includes:
  • the step of calculating the path according to the constraint that does not include the integrated load information of the node is continued until all the nodes in the calculated path are not overloaded.
  • the integrated load information is an integrated load value or a level corresponding to the integrated load value.
  • the integrated load value is calculated according to one or more of the following:
  • the integrated load value is a weighted average between the CPU usage and the memory usage.
  • a path calculation server comprising:
  • the obtaining module is set to: obtain comprehensive load information of each node in advance;
  • the receiving module is configured to: receive a path calculation request from the client;
  • the calculation module is set to: calculate a path according to the integrated load information of each node.
  • the computing module is configured to:
  • the computing module is configured to:
  • a computer readable storage medium storing computer executable instructions for performing the method of any of the above.
  • the embodiment of the present invention includes: the path calculation server acquires the integrated load information of each node in advance; the path calculation server receives the path calculation request from the client, and calculates the path according to the integrated load information of each node. According to the solution of the embodiment of the present invention, the calculation of the path is performed according to the integrated load information of each node, so that the nodes on the calculated path have sufficient resources for routing processing, thereby improving the success rate of the path calculation.
  • FIG. 1 is a flowchart of a method for calculating a path according to an embodiment of the present invention
  • FIG. 2 is a schematic structural diagram of a network according to an embodiment of the present invention.
  • FIG. 3 is a flowchart of a method for a path calculation server to calculate a path when each node actively reports comprehensive load information in a network according to an embodiment of the present invention
  • FIG. 4 is a flowchart of a method for a path calculation server to calculate a path when the path calculation server actively queries the integrated load information of each node according to an embodiment of the present invention
  • FIG. 5 is a schematic structural diagram of a path calculation server according to an embodiment of the present invention.
  • an embodiment of the present invention provides a method for calculating a path, including:
  • Step 100 The path calculation server acquires comprehensive load information of each node in advance.
  • each node may periodically calculate the current integrated load information when receiving the query request from the path calculation server, and send the calculated integrated load information to the path calculation server; or, each node When it is determined that the integrated load information of the self changes, the calculated integrated load information is transmitted to the path calculation server.
  • the integrated load information may be a comprehensive load value or a level corresponding to the integrated load value.
  • the integrated load value may be calculated by one or more of the indicators related to the load of the node (such as CPU usage, number of processes waiting for resources, memory usage, throughput, number of interrupts, etc.), and may be used. The method is calculated and will not be described here.
  • the indicators related to the load of the node such as CPU usage, number of processes waiting for resources, memory usage, throughput, number of interrupts, etc.
  • the combined load value may be a weighted average between the CPU usage and the memory usage.
  • the level corresponding to the comprehensive load value can be set according to the actual situation.
  • Step 101 The path calculation server receives a path calculation request from the client, and calculates a path according to the integrated load information of each node.
  • This step includes:
  • the path calculation server determines whether each node is overloaded according to the obtained comprehensive load information of each node, and excludes the overloaded node, and calculates the path according to the constraint condition of the integrated load information that does not include the node; or, whether the node is overloaded or not included in the constraint condition Calculate the path in .
  • the path calculation server determines that the node is overloaded; if the integrated load value of the node is less than the preset threshold, the path calculation server determines that the node is not overloaded.
  • the path calculation server determines that the node is overloaded; if the level of the integrated load value of the node is less than the pre- If the level is set, the path calculation server determines that the node is not overloaded.
  • the path calculation server calculates the path according to the constraint condition that does not include the integrated load information of the node; the path calculation server determines whether there is an overloaded node in the path according to the integrated load information of each node in the calculated path, if not, Send the calculated path to the client. If the path calculation server determines that there is an overloaded node in the path, after the overloaded node is excluded, the step of calculating the path according to the constraint condition that does not include the integrated load information of the node is continued until all the nodes in the calculated path are not overloaded. .
  • the path request server may send a query request to each node in the path to query the integrated load information of each node in the path.
  • calculating the path according to the constraint condition of the integrated load information that does not include the node means that the existing method is used to calculate the path without considering the comprehensive load information of each node in the network. Including whether a node is overloaded in a constraint, calculating a path refers to whether each node is overloaded as one of the constraints for path calculation.
  • FIG. 2 is a schematic structural diagram of a network. As shown in FIG. 2, the network is composed of 4 nodes and a path calculation server.
  • FIG. 3 is a flowchart of a method for a path calculation server to calculate a path when each node actively reports comprehensive load information in the network. As shown in FIG. 3, the method includes:
  • Step 300 Node 1, Node 2, Node 3, and Node 4 establish a connection with the path calculation server, and report their initial integrated load information P1, P2, P3, and P4 to the path calculation server.
  • the integrated load information is a level corresponding to the comprehensive load value, and the integration of the nodes can be performed.
  • the load value is divided into five levels for management.
  • the level 1 of the integrated load value indicates that the CPU usage is less than or equal to 20%
  • the level 2 indicates CPU usage is greater than 20% and less than or equal to 40%.
  • Level 3 indicates that the CPU usage is greater than 40% and less than or equal to 60%.
  • Level 4 indicates that the CPU usage is greater than 60% and less than or equal to 80%.
  • Level 5 indicates CPU usage. The rate is greater than 80%;
  • the initial integrated load information P1 of the node 1 is 3, the initial integrated load information P2 of the node 2 is 2, the initial integrated load information P3 of the node 3 is 1 level, and the initial integrated load information P4 of the node 4 is 2nd.
  • Step 301 The path calculation server receives and saves the integrated load information from each node.
  • Step 302 When the CPU usage of the node 1 reaches 85%, the comprehensive load information is changed to level 5, and the node 1 reports its own comprehensive load information P1 to the path calculation server again;
  • Step 303 After receiving the integrated load information P1 reported by the node 1, the path calculation server updates the value of the locally saved P1.
  • Step 304 The client initiates a path calculation request to the path calculation server.
  • Step 305 After receiving the path calculation request, the path calculation server acquires the comprehensive load information of each node stored locally, determines whether each node is overloaded according to the comprehensive load information of each node, and excludes the overloaded node.
  • Step 306 The path calculation server performs path calculation according to a constraint condition that does not include the integrated load information of the node.
  • Step 307 The path calculation server sends the calculated path information to the path calculation client.
  • FIG. 4 is a flowchart of a method for a path calculation server to calculate a path when the path calculation server actively queries the integrated load information of each node. As shown in FIG. 4, the method includes:
  • Step 400 The client sends a path calculation request to the server.
  • Step 401 After receiving the path calculation request, the path calculation server performs path calculation according to the constraint condition that does not include the integrated load information of the node, and the obtained path is node 1->node 2->node 4.
  • Step 402 The path calculation server sends a query request to the node 1, the node 2, and the node 4 according to the result of the path calculation.
  • the node 401, the node 1, the node 2, and the node 4 After receiving the query request of the path calculation server, the node 401, the node 1, the node 2, and the node 4 return the current integrated load information to the path calculation server, and assume that the integrated load information of the node 1 is level 1, and the comprehensive load of the node 2 The information is level 5, and the integrated load information of node 4 is level 2.
  • Step 404 The path calculation server determines, according to the integrated load information, that the node 2 is overloaded, does not satisfy the path requirement, and excludes the node 2.
  • Step 405 The path calculation server recalculates the path, and the path information obtained after the recalculation is: Node 1->Node 3 -> Node 4, and the path calculation server queries the Node 1, Node 3, and Node 4 for the integrated load information.
  • Step 406 node 1, node 3, and node 4 return their integrated load information to the path calculation server.
  • the integrated load information of node 1 is level 1
  • the integrated load information of node 3 is level 2
  • the integrated load information of node 4 is At level 2
  • the path calculation server determines that node 1, node 3, and node 4 are not overloaded, meeting the requirements.
  • Step 407 The path calculation server sends the calculated path information to the path calculation client.
  • an embodiment of the present invention further provides a path calculation server, including:
  • the obtaining module 51 is configured to: obtain comprehensive load information of each node in advance;
  • the receiving module 52 is configured to: receive a path calculation request from the client;
  • the calculation module 53 is configured to calculate a path according to the integrated load information of each node.
  • the calculation module 53 is configured to:
  • the path is calculated according to the constraint condition of the integrated load information that does not include the node.
  • the calculation module 53 is configured to:
  • the calculation module 53 is further configured to:
  • the step of calculating the path according to the constraint condition that does not include the integrated load information of the node is continued until all the nodes in the calculated path are not overloaded.
  • all or part of the steps of the above embodiments may also be implemented by using an integrated circuit. These steps may be separately fabricated into individual integrated circuit modules, or multiple modules or steps may be fabricated into a single integrated circuit module. achieve.
  • the devices/function modules/functional units in the above embodiments may be implemented by a general-purpose computing device, which may be centralized on a single computing device or distributed over a network of multiple computing devices.
  • the device/function module/functional unit in the above embodiment When the device/function module/functional unit in the above embodiment is implemented in the form of a software function module and sold or used as a stand-alone product, it can be stored in a computer readable storage medium.
  • the above mentioned computer readable storage medium may be a read only memory, a magnetic disk or an optical disk or the like.
  • the calculation of the path is performed according to the integrated load information of each node, so that the nodes on the calculated path have sufficient resources for routing processing, thereby improving the success rate of the path calculation.

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Computer And Data Communications (AREA)

Abstract

La présente invention concerne un procédé de calcul de chemin et un serveur de calcul de chemin. Le procédé comprend les étapes dans lesquelles : un serveur de calcul de chemin acquiert des informations de charge complète de chaque nœud à l'avance (100) ; et le serveur de calcul de chemin reçoit une demande de calcul de chemin en provenance d'un client, et calcule un chemin en fonction des informations de charge complète de chaque nœud (101).
PCT/CN2015/088044 2014-11-18 2015-08-25 Procédé de calcul de chemin et serveur de calcul de chemin WO2016078461A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410657336.5A CN105591888A (zh) 2014-11-18 2014-11-18 一种计算路径的方法和路径计算服务器
CN201410657336.5 2014-11-18

Publications (1)

Publication Number Publication Date
WO2016078461A1 true WO2016078461A1 (fr) 2016-05-26

Family

ID=55931133

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/088044 WO2016078461A1 (fr) 2014-11-18 2015-08-25 Procédé de calcul de chemin et serveur de calcul de chemin

Country Status (2)

Country Link
CN (1) CN105591888A (fr)
WO (1) WO2016078461A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP6427697B1 (ja) * 2018-01-22 2018-11-21 株式会社Ｔｒｉａｒｔ 情報処理装置、情報処理方法、プログラムおよび情報処理システム

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1860748A (zh) * 2004-03-18 2006-11-08 松下电器产业株式会社 无线通信装置及路径搜索方法
US20080151896A1 (en) * 2005-05-20 2008-06-26 Renhai Zhang Method and Apparatus for Computing a Path in a Network Domain
CN101312464A (zh) * 2008-07-11 2008-11-26 烽火通信科技股份有限公司 一种在自动交换光网络中实现负载均衡的方法
CN102594449A (zh) * 2012-02-14 2012-07-18 中兴通讯股份有限公司 一种光网络中多路径计算单元协作的实现系统及方法
CN103188149A (zh) * 2011-12-28 2013-07-03 中国移动通信集团广东有限公司 一种路由计算方法和路由器

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102136994B (zh) * 2010-08-02 2014-04-30 华为技术有限公司 一种建立标签交换路径的方法、系统和节点设备
CN102055675B (zh) * 2011-01-21 2012-12-19 清华大学 一种基于负载均衡的多径路由分配方法
WO2013033869A1 (fr) * 2011-09-09 2013-03-14 Nokia Siemens Networks Oy Procédé, dispositif et système pour fournir et sélectionner des nœuds candidats pour des services de diffusion multimédia en direct
CN103716251B (zh) * 2014-01-14 2017-06-27 三星电子（中国）研发中心 用于内容分发网络的负载均衡方法及设备

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1860748A (zh) * 2004-03-18 2006-11-08 松下电器产业株式会社 无线通信装置及路径搜索方法
US20080151896A1 (en) * 2005-05-20 2008-06-26 Renhai Zhang Method and Apparatus for Computing a Path in a Network Domain
CN101312464A (zh) * 2008-07-11 2008-11-26 烽火通信科技股份有限公司 一种在自动交换光网络中实现负载均衡的方法
CN103188149A (zh) * 2011-12-28 2013-07-03 中国移动通信集团广东有限公司 一种路由计算方法和路由器
CN102594449A (zh) * 2012-02-14 2012-07-18 中兴通讯股份有限公司 一种光网络中多路径计算单元协作的实现系统及方法

Also Published As

Publication number Publication date
CN105591888A (zh) 2016-05-18

Similar Documents

Publication Publication Date Title
US9634923B2 (en) Method, apparatus and system for disseminating routing information
US8773992B2 (en) Methods and apparatus for hierarchical routing in communication networks
US8995277B2 (en) Method for dynamic load balancing of network flows on LAG interfaces
US9548927B2 (en) Flow-based load balancing
JP5276220B2 (ja) バス制御装置およびバス制御装置に指示を出力する制御装置
JP4951717B2 (ja) バックアップリソースを選択する方法、システム
US20070110063A1 (en) Apparatus, system, and method for reliable, fast, and scalable multicast message delivery in service overlay networks
US9853906B2 (en) Network prioritization based on node-level attributes
WO2016091029A1 (fr) Procédé et appareil pour transférer le trafic d'un système d'empilage
EP3186928B1 (fr) Routage multi-chemin à coût constant pondéré par la largeur de bande passante
JP5884892B2 (ja) ネットワークシステム、コントローラ、及び負荷分散方法
JP6256343B2 (ja) ネットワーク、ネットワークノード、配信方法及びネットワークノード用プログラム
CN104283807A (zh) 一种te隧道建立方法和装置
US11277342B2 (en) Lossless data traffic deadlock management system
US20140016510A1 (en) Methods and apparatus for efficient decentralized information dissemination in a network
JPWO2010092751A1 (ja) イベント配信システム、ランデブーノード、ブローカーノード、イベント配信システムの負荷分散方法、ランデブーノードの負荷分散方法、ブローカーノードの配信ルート構築方法、負荷分散プログラム、及び配信ルート構築プログラム
EP3063969B1 (fr) Système et procédé pour ingénierie de trafic au moyen d'un statut de tampon de liaison
JP2010212751A (ja) 接続先ノード選択方法、ノード、およびプログラム
WO2016078461A1 (fr) Procédé de calcul de chemin et serveur de calcul de chemin
JP2015130551A (ja) ネットワーク設計方法及びシステム
WO2020261393A1 (fr) Dispositif de communication et procédé de communication
US20140019508A1 (en) Distributed processing system, distributed processing device, routing table creation method and program recording medium
US10158546B2 (en) System and method for power reduction in network equipment
JP2009033345A (ja) マルチホップネットワークシステム
KR101440454B1 (ko) 무선 메쉬 네트워크 환경에서 가용 대역폭을 고려한 플로우별 라우팅 장치 및 방법

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

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

Country of ref document: EP

Kind code of ref document: A1