-
公开(公告)号：US20220263571A1
公开(公告)日：2022-08-18
申请号：US17733199
申请日：2022-04-29
发明人： Gang XIE , Hao LI , Xianlong LUO , Min ZHAO , Haomian ZHENG
IPC分类号： H04B10/032
摘要： A path protection method includes receiving, by a source node of a first path, a path event notify message from a first node on the first path. The path event notify message includes indication information that the first path is predicted to fail. The path protection method further includes obtaining, by the source node, information about a predicted protection path. The information about the predicted protection path includes resource information of a second path useable to protect a service on the first path. The first path and the second path include the source node and a same sink node. The path protection method further includes storing, by the source node, the resource information of the second path.
-
公开(公告)号：US20230007563A1
公开(公告)日：2023-01-05
申请号：US17944422
申请日：2022-09-14
发明人： Haomian ZHENG , Lei MAO , Zeshan CHANG
摘要： A route calculation method, device, and system. The route calculation method includes: receiving, by a first device, a service request message, where the service request message is used to request the first device to determine a transmission path of a borne service requested by the service request message to be established; and determining, by the first device, a transmission path of the service based on the service request message and first bearing capability information, where the first bearing capability information is used to indicate an actual bearing capability of each link on the transmission path. According to the foregoing solution, the system can calculate a route and configure the service based on an actual service bearing capability of each link of a network.
-
公开(公告)号：US20190215060A1
公开(公告)日：2019-07-11
申请号：US16360379
申请日：2019-03-21
发明人： Haomian ZHENG , Yu ZHENG , Italo BUSI , Qinfen TAN , Qingcong LU
IPC分类号： H04B10/038 , H04B10/077
CPC分类号： H04B10/038 , H04B10/0771 , H04J3/14 , H04J2203/006 , H04L12/10 , Y02D50/30
摘要： The present disclosure discloses a protection switching method and a node. The method includes: receiving, by an intermediate node, a first protection switching request message sent by an upstream neighboring node, where the first protection switching request message is used to request to activate a first protection path, and the intermediate node is a node on the first protection path; determining, by the intermediate node, that the first protection path needs to occupy N1 timeslots, and selecting N1 timeslots for the first protection path from N2 available timeslots in a preset order; and sending, by the intermediate node, a second protection switching request message to the downstream neighboring node, where the second protection switching request message is used to request the downstream neighboring node to complete a cross-connection, on the first protection path, between the downstream neighboring node and the intermediate node based on the first group of timeslots.
-
4.发明申请VIRTUAL SHORTEST PATH TREE ESTABLISHMENT AND PROCESSING METHODS AND PATH COMPUTATION ELEMENT 审中-公开虚拟短程路径建立和处理方法和路径计算元素公开(公告)号：US20170078187A1
公开(公告)日：2017-03-16
申请号：US15357761
申请日：2016-11-21
发明人： Haomian ZHENG , Yi Lin
IPC分类号： H04L12/721 , H04L12/44 , H04L12/46
CPC分类号： H04L45/124 , H04L12/44 , H04L12/4641 , H04L29/06 , H04L45/00 , H04L45/04 , H04L45/12 , H04L45/36 , H04L45/48 , H04L47/786 , H04L47/826
摘要： The present application provides virtual shortest path tree establishment and processing methods and a path computation element, so as to improve a resource utilization rate in a process of establishing and processing a virtual shortest path tree. In a process of establishing the virtual shortest path tree, a cost of an established path from a root node (a destination node) to a leaf node is compared with a cost threshold, and a new path branch is added to the VSPT when the cost is less than the cost threshold. In a process of processing the virtual shortest path tree, a resource occupied by a path branch in the VSPT that does not belong to an optimal path is released after the optimal path is obtained.
摘要翻译： 本申请提供虚拟最短路径树建立和处理方法以及路径计算元素，以便在建立和处理虚拟最短路径树的过程中提高资源利用率。 在建立虚拟最短路径树的过程中，将从根节点（目的地节点）到叶节点的建立路径的成本与成本阈值进行比较，并且当成本阈值添加新路径分支时，VSPT 小于成本阈值。 在处理虚拟最短路径树的过程中，在获得最优路径之后释放在VSPT中不属于最佳路径的路径分支占用的资源。
-
公开(公告)号：US20210306724A1
公开(公告)日：2021-09-30
申请号：US17344536
申请日：2021-06-10
发明人： Gang XIE , Hao LI , Haomian ZHENG , Zhe LIU
IPC分类号： H04Q11/00
摘要： This application provides example methods for establishing a service path in a transport network and example systems. One example method includes, obtaining, by an automatically switched optical network (ASON) first node, a service path computation result path. The service path includes the ASON first node, an ASON last node, and at least one first edge network node. The method also includes sending, by the ASON first node, a path establishment request message to a downstream node. The path establishment request message carries cross-connection configuration information of the ASON last node and the at least one first edge network node. The method further includes receiving, by the ASON first node, a path establishment response message of the downstream node. The path establishment response message indicates that cross-connection configuration for the ASON last node and the at least one first edge network node is complete.
-
公开(公告)号：US20200343971A1
公开(公告)日：2020-10-29
申请号：US16925687
申请日：2020-07-10
发明人： Haomian ZHENG , Yu ZHENG , Italo BUSI , Qinfen TAN , Qingcong LU
IPC分类号： H04B10/038 , H04L12/10 , H04J3/14 , H04B10/077
摘要： The present disclosure discloses a protection switching method and a node. The method can include: receiving, by an intermediate node, a first protection switching request message sent by an upstream neighboring node, where the first protection switching request message is used to request to activate a first protection path, and the intermediate node is a node on the first protection path; determining, by the intermediate node, that the first protection path needs to occupy N1 timeslots, and selecting N1 timeslots for the first protection path from N2 available timeslots in a preset order; and sending, by the intermediate node, a second protection switching request message to the downstream neighboring node, where the second protection switching request message is used to request the downstream neighboring node to complete a cross-connection, on the first protection path, between the downstream neighboring node and the intermediate node based on the first group of timeslots.
-
公开(公告)号：US20160352636A1
公开(公告)日：2016-12-01
申请号：US15236347
申请日：2016-08-12
发明人： Haomian ZHENG , Xian ZHANG , Yi LIN
IPC分类号： H04L12/721 , H04L12/733 , H04L12/26 , H04L12/723
摘要： Embodiments of the present invention provide a network path computation method, apparatus and system, where the method includes: sending, by a first node, a path computation request to a first path computation element PCE, where the path computation request includes a resource sharing object, and a head node and a last node of a first label switched path LSP; and receiving, by the first node, a path computation result that is returned by the first PCE and that is obtained by means of computation according to the resource sharing object, and establishing a second path from the head node to the last node according to the path computation result. According to the network path computation method, apparatus, and system provided in the embodiments of the present invention, link resource utilization can be improved.
摘要翻译： 本发明的实施例提供了一种网路计算方法，装置和系统，其中该方法包括：由第一节点向第一路径计算元件PCE发送路径计算请求，其中路径计算请求包括资源共享对象 ，以及第一标签交换路径LSP的头节点和最后节点; 并且由所述第一节点接收由所述第一PCE返回并且根据所述资源共享对象通过计算而获得的路径计算结果，以及根据所述第一节点建立从所述头节点到所述最后节点的第二路径 路径计算结果。 根据本发明实施例提供的网络路径计算方法，装置和系统，可以提高链路资源的利用。
-
-
-
-
-
-
搜索结果
7 条记录 (耗时 0.018 秒)
