专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08781320B2 Automatically switched optical network and method for data transmission in the network 有权
标题翻译：自动交换光网络和网络数据传输方法
公开(公告)号：US08781320B2
公开(公告)日：2014-07-15
申请号：US12743432
申请日：2007-11-21
申请人： Dajiang Wang , Zhenyu Wang
发明人： Dajiang Wang , Zhenyu Wang
IPC分类号： H04J14/00 , H04L12/56 , H04Q11/00
CPC分类号： H04L45/22 , H04L45/04 , H04L45/28 , H04Q11/0062 , H04Q2011/0073
摘要： An automatically switched optical network includes several areas of a transmission plane and a control plane, and a method for data transmission in the network includes that when the control plane has detected at least one partition of an area separated from other partitions of the area, a route over area is realized between the separated partitions of the area by the way of virtual link in the area. When several partitions exist in a certain area of the network, which can not be connected with each other through routes within the area, and the data transmission can not be performed between these partitions, a hierarchical route in the case of the area of ASON transmission plane being parted is realized by the method, so when the several separated partitions are caused by link fault in a certain area, the hierarchical route over area can be realized for the partitions of the area.
摘要翻译：自动切换光网络包括传输平面和控制平面的几个区域，并且网络中的数据传输方法包括当控制平面已经检测到与该区域的其他分区分离的区域的至少一个分区时，通过该区域中的虚拟链路的方式，在区域的分离的分区之间实现路由区域。当网络的某个区域存在多个分区时，不能通过该区域内的路由相互连接，并且不能在这些分区之间进行数据传输，在ASON传输区域的情况下，分层路由被分割的平面是通过该方法实现的，所以当几个分离的分区是由一定区域中的链路故障引起时，可以为该区域的分区实现分层路由。

2. 发明授权

US08467315B2 Method and apparatus for implementing K-shortest paths algorithm in the case of existing multiple edges between adjacent nodes 有权
标题翻译：在相邻节点之间存在多个边缘的情况下实现K-最短路径算法的方法和装置
公开(公告)号：US08467315B2
公开(公告)日：2013-06-18
申请号：US13257609
申请日：2009-09-02
申请人： Dajiang Wang , Zhenyu Wang
发明人： Dajiang Wang , Zhenyu Wang
IPC分类号： H04L12/28
CPC分类号： H04L45/24 , H04L45/00 , H04L45/12
摘要： The present invention discloses a method and apparatus for implementing a K-shortest paths algorithm in a condition of multiple sides between adjacent nodes. The implementing method comprises: recording original topology information into a topology structure; adding one virtual node into each of the original sides other than the one with the shortest weight between the two nodes respectively to divide each of the original sides except for the original side with the shortest weight into two new sides, a weight of the new side being obtained by splitting a weight of the original edge where the new side locates; according to new topology information after adding virtual nodes, calculating K-shortest paths between designated nodes; and checking each path in the calculated K-shortest paths in sequence: reinstituting hops which belong to virtual nodes and new sides in each path into the original topology information recoded in said topology structure.
摘要翻译：本发明公开了一种在相邻节点之间的多边条件下实现K-最短路径算法的方法和装置。实现方法包括：将原始拓扑信息记录到拓扑结构中; 在两个节点之间的最小权重之外的每个原始侧面中分别添加一个虚拟节点，以将最短权重的原始侧面之外的每个原始侧划分成两个新的边，新边的权重通过分割新侧所在的原始边缘的重量来获得; 根据添加虚拟节点后的新拓扑信息，计算指定节点之间的K-最短路径; 并且按顺序检查所计算的K个最短路径中的每个路径：将属于每个路径中的虚拟节点和新侧的跳再次重建为在所述拓扑结构中重新编码的原始拓扑信息。

3. 发明申请

US20120140762A1 Method for Calculating Interlayer Path 有权
标题翻译：层间路径计算方法
公开(公告)号：US20120140762A1
公开(公告)日：2012-06-07
申请号：US13390224
申请日：2010-04-28
申请人： Dajiang Wang , Zhenyu Wang
发明人： Dajiang Wang , Zhenyu Wang
IPC分类号： H04L12/28
CPC分类号： H04L45/42 , H04L45/04 , H04L45/50
摘要： In order to achieve the discovery and calculation of interlayer paths, a method for calculating an interlayer path is proposed by the present invention, comprising: a label switch router (LSR) of a layer selecting a path calculation element (PCE) of the layer according to the received discovery information of each PCE and sending thereto a path calculation request for the LSR, wherein the above discovery information comprises: indication information and interlayer information, with the indication information indicating whether the PCE can be used as a default interlayer path calculation element of the layer, and the interlayer information indicating a layer where the PCE is located and an adjacent layer thereof; when a path of the LSR is disconnected, selecting based on the interlayer information a path calculation element (PCE) of the next layer and sending thereto a path calculation request for the disconnected portion of the path until the path is connected; and replying a path calculation result to the PCE of the layer.
摘要翻译：为了实现层间路径的发现和计算，本发明提出了一种用于计算层间路径的方法，包括：选择层的路径计算元素（PCE）的层的标签交换路由器（LSR），根据对于所接收到的每个PCE的发现信息，并向其发送LSR的路径计算请求，其中上述发现信息包括：指示信息和层间信息，其中指示信息指示PCE是否可以用作默认层间路径计算元素以及指示PCE所在的层的层间信息及其相邻层; 当LSR的路径断开时，基于层间信息选择下一层的路径计算单元（PCE），并向其发送路径的断开部分的路径计算请求，直到路径连接为止; 并将路径计算结果应答到该层的PCE。

4. 发明申请

US20120057868A1 Method and System for Implementing Alternate Routes in Optical Transmission Network of Wavelength Switched Optical Network (WSON) 有权
标题翻译：在波长切换光网络（WSON）的光传输网络中实现备用路由的方法和系统
公开(公告)号：US20120057868A1
公开(公告)日：2012-03-08
申请号：US13257966
申请日：2009-09-02
申请人： Zhenyu Wang , Dajiang Wang
发明人： Zhenyu Wang , Dajiang Wang
IPC分类号： H04J14/00
CPC分类号： H04Q11/0062 , H04J14/0268 , H04J14/0284 , H04L45/22 , H04L45/62 , H04Q2011/0081
摘要： The present invention discloses a method and a system for implementing alternative routes in optical transmission network of WSON. By using the method and the system the following alternative routes implementing process is realized: computing the alternative routes of each subsegment independently based on a constraining condition distributed by a managing plane, and combining the computed alternative routes of each subsegment to form complete alternative routes. The present method and system for implementing alternative routes is capable of obtaining more alternative routes than those of prior art, and takes full advantage of network resource topology.
摘要翻译：本发明公开了一种在WSON光传输网络中实现替代路由的方法和系统。通过使用该方法和系统，实现以下替代路由实现过程：基于由管理平面分布的约束条件独立地计算每个子段的替代路由，并且组合每个子段的计算的替代路由以形成完整的备选路由。实现替代路由的本方法和系统能够获得比现有技术更多的替代路由，并充分利用网络资源拓扑。

5. 发明授权

US08971214B2 Method and apparatus for acquiring traffic-engineering label switched path 有权
标题翻译：用于获取交通工程标签交换路径的方法和装置
公开(公告)号：US08971214B2
公开(公告)日：2015-03-03
申请号：US13512124
申请日：2010-04-24
申请人： Wei Zhao , Dajiang Wang
发明人： Wei Zhao , Dajiang Wang
IPC分类号： H04L12/28 , H04L12/24 , H04L12/715 , H04L12/717 , H04L12/721 , H04L12/723
CPC分类号： H04L41/12 , H04L45/04 , H04L45/42 , H04L45/44 , H04L45/50 , H04L45/62
摘要： A method and apparatus for acquiring a Traffic-Engineering Label Switched Path (TE LSP) provided by the present invention relate to communication field. The method includes: performing path tracing from a source node to a target node, and obtaining a passing node passed by the path tracing; acquiring a Path Compute Element (PCE) in a region in which the passing node is located; acquiring traffic-engineering database of a region in which the PCE is located from the PCE; and according to the traffic-engineering database, obtaining the TE LSP between the source node and the target node.
摘要翻译：本发明提供的用于获取交通工程标签交换路径（TE LSP）的方法和装置涉及通信领域。该方法包括：从源节点到目标节点执行路径跟踪，并获得通过路径跟踪传递的传递节点; 在传递节点所在的区域中获取路径计算元素（PCE）; 从PCE获取PCE所在地区的交通工程数据库; 根据流量工程数据库，获取源节点与目标节点之间的TE LSP。

6. 发明申请

US20120093164A1 Method and Apparatus for Generating Constraint Route 审中-公开
标题翻译：用于生成约束路线的方法和装置
公开(公告)号：US20120093164A1
公开(公告)日：2012-04-19
申请号：US13257911
申请日：2010-04-26
申请人： Zhihong Wang , Dajiang Wang
发明人： Zhihong Wang , Dajiang Wang
IPC分类号： H04L12/56
CPC分类号： H04L45/12 , H04L45/14
摘要： A method and an apparatus for generating a constraint based routing are disclosed in the present invention. The method includes: when computing a routing with a constraint condition, directly computing paths from a head node to a tail node of the routing, and comparing the paths that are computed with the constraint condition of the routing, and adding one or more paths which satisfy the constraint condition of the routing to a result set of routing computation. The present invention further discloses a corresponding apparatus, which includes a path calculation module, a comparison module and a storage module. With the present invention, when a routing query request with constraint conditions is processed, phenomena of omission or error can be avoided, thereby ensuring the correctness of the routing calculation result.
摘要翻译：在本发明中公开了一种用于生成基于约束的路由的方法和装置。该方法包括：当计算具有约束条件的路由时，直接计算从路由的头节点到尾节点的路径，以及将所计算的路径与路由的约束条件进行比较，并且添加一条或多条路径满足路由到路由计算结果集的约束条件。本发明还公开了一种对应的装置，其包括路径计算模块，比较模块和存储模块。利用本发明，当处理具有约束条件的路由查询请求时，可以避免遗漏或错误现象，从而确保路由计算结果的正确性。

7. 发明申请

US20100266278A1 AUTOMATICALLY SWITCHED OPTICAL NETWORK AND METHOD FOR DATA TRANSMISSION IN THE NETWORK 有权
标题翻译：自动切换光网络和网络中数据传输的方法
公开(公告)号：US20100266278A1
公开(公告)日：2010-10-21
申请号：US12743432
申请日：2007-11-21
申请人： Dajiang Wang , Zhenyu Wang
发明人： Dajiang Wang , Zhenyu Wang
IPC分类号： H04J14/00
CPC分类号： H04L45/22 , H04L45/04 , H04L45/28 , H04Q11/0062 , H04Q2011/0073
摘要： An automatically switched optical network includes several areas of a transmission plane and a control plane, and a method for data transmission in the network includes that when the control plane has detected at least one partition of an area separated from other partitions of the area, a route over area is realized between the separated partitions of the area by the way of virtual link in the area. When several partitions exist in a certain area of the network, which can not be connected with each other through routes within the area, and the data transmission can not be performed between these partitions, a hierarchical route in the case of the area of ASON transmission plane being parted is realized by the method, so when the several separated partitions are caused by link fault in a certain area, the hierarchical route over area can be realized for the partitions of the area.
摘要翻译：自动切换光网络包括传输平面和控制平面的几个区域，并且网络中的数据传输方法包括当控制平面已经检测到与该区域的其他分区分离的区域的至少一个分区时，通过该区域中的虚拟链路的方式，在区域的分离的分区之间实现路由区域。当网络的某个区域存在多个分区时，不能通过该区域内的路由相互连接，并且不能在这些分区之间进行数据传输，在ASON传输区域的情况下，分层路由被分割的平面是通过该方法实现的，所以当几个分离的分区是由一定区域中的链路故障引起时，可以为该区域的分区实现分层路由。

8. 发明授权

US09301028B2 Method and system for implementing alternate routes in optical transmission network of wavelength switched optical network (WSON) 有权
标题翻译：在波长交换光网络（WSON）的光传输网络中实现替代路由的方法和系统
公开(公告)号：US09301028B2
公开(公告)日：2016-03-29
申请号：US13257966
申请日：2009-09-02
申请人： Zhenyu Wang , Dajiang Wang
发明人： Zhenyu Wang , Dajiang Wang
IPC分类号： H04J14/00 , H04L1/00 , H04Q11/00 , H04J14/02 , H04L12/707 , H04L12/721
CPC分类号： H04Q11/0062 , H04J14/0268 , H04J14/0284 , H04L45/22 , H04L45/62 , H04Q2011/0081
摘要： The present invention discloses a method and a system for implementing alternative routes in optical transmission network of WSON. By using the method and the system the following alternative routes implementing process is realized: computing the alternative routes of each subsegment independently based on a constraining condition distributed by a managing plane, and combining the computed alternative routes of each subsegment to form complete alternative routes. The present method and system for implementing alternative routes is capable of obtaining more alternative routes than those of prior art, and takes full advantage of network resource topology.
摘要翻译：本发明公开了一种在WSON光传输网络中实现替代路由的方法和系统。通过使用该方法和系统，实现以下替代路由实现过程：基于由管理平面分布的约束条件独立地计算每个子段的替代路由，并且组合每个子段的计算的替代路由以形成完整的备选路由。实现替代路由的本方法和系统能够获得比现有技术更多的替代路由，并充分利用网络资源拓扑。

9. 发明授权

US08670328B2 Method for calculating interlayer path 有权
标题翻译：层间路径计算方法
公开(公告)号：US08670328B2
公开(公告)日：2014-03-11
申请号：US13390224
申请日：2010-04-28
申请人： Dajiang Wang , Zhenyu Wang
发明人： Dajiang Wang , Zhenyu Wang
IPC分类号： H04L12/28 , H04J3/22
CPC分类号： H04L45/42 , H04L45/04 , H04L45/50
摘要： In order to achieve the discovery and calculation of interlayer paths, a method for calculating an interlayer path is proposed by the present invention, comprising: a label switch router (LSR) of a layer selecting a path calculation element (PCE) of the layer according to the received discovery information of each PCE and sending thereto a path calculation request for the LSR, wherein the above discovery information comprises: indication information and interlayer information, with the indication information indicating whether the PCE can be used as a default interlayer path calculation element of the layer, and the interlayer information indicating a layer where the PCE is located and an adjacent layer thereof; when a path of the LSR is disconnected, selecting based on the interlayer information a path calculation element (PCE) of the next layer and sending thereto a path calculation request for the disconnected portion of the path until the path is connected; and replying a path calculation result to the PCE of the layer.
摘要翻译：为了实现层间路径的发现和计算，本发明提出了一种用于计算层间路径的方法，包括：选择层的路径计算元素（PCE）的层的标签交换路由器（LSR），根据对于所接收到的每个PCE的发现信息，并向其发送LSR的路径计算请求，其中上述发现信息包括：指示信息和层间信息，其中指示信息指示PCE是否可以用作默认层间路径计算元素以及指示PCE所在的层的层间信息及其相邻层; 当LSR的路径断开时，基于层间信息选择下一层的路径计算单元（PCE），并向其发送路径的断开部分的路径计算请求，直到路径连接为止; 并将路径计算结果应答到该层的PCE。

10. 发明申请

US20120281592A1 METHOD AND APPARATUS FOR ACQUIRING TRAFFIC-ENGINEERING LABEL SWITCHED PATH 有权
标题翻译：获取交通工程标签交换路径的方法和装置
公开(公告)号：US20120281592A1
公开(公告)日：2012-11-08
申请号：US13512124
申请日：2010-04-21
申请人： Wei Zhao , Dajiang Wang
发明人： Wei Zhao , Dajiang Wang
IPC分类号： H04L12/28
CPC分类号： H04L41/12 , H04L45/04 , H04L45/42 , H04L45/44 , H04L45/50 , H04L45/62
摘要： A method and apparatus for acquiring a Traffic-Engineering Label Switched Path (TE LSP) provided by the present invention relate to communication field. The method includes: performing path tracing from a source node to a target node, and obtaining a passing node passed by the path tracing; acquiring a Path Compute Element (PCE) in a region in which the passing node is located; acquiring traffic-engineering database of a region in which the PCE is located from the PCE; and according to the traffic-engineering database, obtaining the TE LSP between the source node and the target node.
摘要翻译：本发明提供的用于获取交通工程标签交换路径（TE LSP）的方法和装置涉及通信领域。该方法包括：从源节点到目标节点执行路径跟踪，并获得通过路径跟踪传递的传递节点; 在传递节点所在的区域中获取路径计算元素（PCE）; 从PCE获取PCE所在地区的交通工程数据库; 根据流量工程数据库，获取源节点与目标节点之间的TE LSP。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式