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

1. 发明授权

US10326688B2 Method and apparatus for instantiating a path with the minimum number of segments 有权
公开(公告)号：US10326688B2
公开(公告)日：2019-06-18
申请号：US15605712
申请日：2017-05-25
申请人： Fang Hao , Murali Kodialam , T. V. Lakshman , Ehsan Rezaaifar
发明人： Fang Hao , Murali Kodialam , T. V. Lakshman , Ehsan Rezaaifar
IPC分类号： H04L12/721 , H04L12/723
摘要： Various embodiments relate to a method and apparatus for computing a minimum segment labeling of a given path on a segment cover graph, the method including receiving a connection request for a connection between a source node and a destination node, generating a Shortest Path Directed Acyclic Graph (“SPDAG”) from the source node to the destination node by running a shortest path algorithm from the source node, determining an end node, between the source node and the destination node, at which the SPDAG deviates from the given path, determining whether the end node is the end of an Equal Cost Multipath (“ECMP”) and terminating the shortest path algorithm at a predecessor node to the end node if the end node is the end of an ECMP and making the predecessor node to the end node the source node.

2. 发明申请

US20180343190A1 METHOD AND APPARATUS FOR INSTANTIATING A PATH WITH THE MINIMUM NUMBER OF SEGMENTS 审中-公开
公开(公告)号：US20180343190A1
公开(公告)日：2018-11-29
申请号：US15605712
申请日：2017-05-25
申请人： Fang HAO , Murali KODIALAM , T.V. LAKSHMAN , Ehsan Rezaaifar
发明人： Fang HAO , Murali KODIALAM , T.V. LAKSHMAN , Ehsan Rezaaifar
IPC分类号： H04L12/721 , H04L12/723
CPC分类号： H04L45/123 , H04L45/50 , H04Q2213/13138
摘要： Various embodiments relate to a method and apparatus for computing a minimum segment labeling of a given path on a segment cover graph, the method including receiving a connection request for a connection between a source node and a destination node, generating a Shortest Path Directed Acyclic Graph (“SPDAG”) from the source node to the destination node by running a shortest path algorithm from the source node, determining an end node, between the source node and the destination node, at which the SPDAG deviates from the given path, determining whether the end node is the end of an Equal Cost Multipath (“ECMP”) and terminating the shortest path algorithm at a predecessor node to the end node if the end node is the end of an ECMP and making the predecessor node to the end node the source node.

3. 发明申请

US20180343193A1 METHOD AND APPARATUS FOR MINIMUM LABEL BANDWIDTH GUARANTEED PATH FOR SEGMENT ROUTING 审中-公开
公开(公告)号：US20180343193A1
公开(公告)日：2018-11-29
申请号：US15605749
申请日：2017-05-25
申请人： Fang HAO , Murali KODIALAM , T.V. LAKSHMAN , Ehsan Rezaaifar
发明人： Fang HAO , Murali KODIALAM , T.V. LAKSHMAN , Ehsan Rezaaifar
IPC分类号： H04L12/729 , H04L12/733 , H04L12/723
CPC分类号： H04L45/125 , H04L45/20 , H04L45/34 , H04L45/50 , H04L45/745
摘要： Various embodiments relate to a non-transitory computer readable medium and method thereof for finding a minimum hop path in a segment graph traversing the least number of links in a physical topology, the method including receiving a connection request for a connection between a source node and a destination node, computing the segment graph, the segment graph having a plurality of links, computing a bandwidth for each of the plurality of links in the segment graph, computing the number of links for a shortest path (“N(q)”) for each of the plurality of links, eliminating each of the plurality of link with a bandwidth less than the minimum bandwidth and selecting the shortest path in the physical topology between the plurality of links.

4. 发明授权

US09031085B2 Routing path calculation apparatus and methods 有权
标题翻译：路径计算装置及方法
公开(公告)号：US09031085B2
公开(公告)日：2015-05-12
申请号：US11692578
申请日：2007-03-28
申请人： Christopher Warren Murray , Reza Mohammad Rokui , Ehsan Rezaaifar , Chuong Ngoc Ngo
发明人： Christopher Warren Murray , Reza Mohammad Rokui , Ehsan Rezaaifar , Chuong Ngoc Ngo
IPC分类号： H04L12/28 , H04L12/707 , H04L12/751 , H04L12/715 , H04L12/733 , H04L12/721 , H04L12/703 , H04L12/725 , H04L12/717 , H04L12/773
CPC分类号： H04L45/22 , H04L45/02 , H04L45/04 , H04L45/122 , H04L45/124 , H04L45/28 , H04L45/306 , H04L45/42 , H04L45/44 , H04L45/60
摘要： Routing path calculation apparatus and methods are disclosed. Calculation of routing paths within different routing areas of a communication system is handled by respective routing path calculation devices. Multiple devices may be requested to perform respective routing path calculations for segments of a routing path between endpoints in different routing areas. Recalculations may be requested from the same or different devices in the event of a change in a routing area that affects a segment of a routing path. A routing path calculation device, whether or not in this type of distributed routing path calculation system, may determine whether a previously configured path exists between an intermediate node of a calculated routing path, and take the previously configured path into account in calculating the routing path if it is determined that a previously configured path exists. The previously configured path may be an Interior Gateway Protocol (IGP) shortcut, for example.
摘要翻译：公开了路径计算装置和方法。通信系统的不同路由区域内的路由路径的计算由相应的路由路径计算设备来处理。可以请求多个设备对不同路由区域中的端点之间的路由路径的段执行相应的路由路径计算。在影响路由路径的段的路由区域发生变化的情况下，可以从相同或不同的设备请求重新计算。无论是否在这种分布式路由路径计算系统中，路由路径计算设备可以确定在计算的路由路径的中间节点之间是否存在先前配置的路径，并且在计算路由路径时考虑到先前配置的路径如果确定先前配置的路径存在。例如，先前配置的路径可以是内部网关协议（IGP）快捷方式。

5. 发明授权

US07346706B2 Equivalent multiple path traffic distribution in communications networks 有权
标题翻译：通信网络中的等效多路径业务分布
公开(公告)号：US07346706B2
公开(公告)日：2008-03-18
申请号：US10427938
申请日：2003-05-02
申请人： Ehsan Rezaaifar , Yuri Bassin
发明人： Ehsan Rezaaifar , Yuri Bassin
IPC分类号： G06F15/173 , G06F15/16
CPC分类号： H04L45/00 , H04L45/24
摘要： A method and associated device for selecting one of a number of equivalent paths in forwarding a network message from a node of a communication network. A source and destination address is provided for the network message. The addresses are formed of individual bit values, and these values have a relative mapping between them. The relative mapping is decorrelated to obtain a decorrelated address pair. A randomized selection function is applied to the decorrelated address pair to produce an index which is derived from the relative sequence of bit values of the decorrelated address paid. The index is then used to select one of the equivalent paths. The associated device provides an address reader, a decorrelation module and a randomized selection module for performing the method previously described.
摘要翻译：一种用于从通信网络的节点转发网络消息的多个等效路径中的一个的方法和相关联的设备。为网络消息提供源和目的地址。地址由单独的位值形成，并且这些值具有它们之间的相对映射。相对映射被去相关以获得解相关的地址对。随机选择函数被应用于去相关地址对以产生从相关的解除地址支付的位值的相对序列导出的索引。然后使用索引来选择一个等效路径。相关联的设备提供地址读取器，解相关模块和用于执行先前描述的方法的随机选择模块。

6. 发明授权

US10560367B2 Bidirectional constrained path search 有权
公开(公告)号：US10560367B2
公开(公告)日：2020-02-11
申请号：US14997921
申请日：2016-01-18
申请人： Andrew W. Stone , Felix Katz , Ehsan Rezaaifar , Attaullah Zabihi-Seissan
发明人： Andrew W. Stone , Felix Katz , Ehsan Rezaaifar , Attaullah Zabihi-Seissan
IPC分类号： H04L12/751
摘要： This disclosure generally discloses a bidirectional constrained path search mechanism. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, such that the bidirectional paths share a common set of resources. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, by determining a forward path that satisfies a set of forward path constraints associated with the forward path and determining a reverse path that satisfies a set of reverse path constraints associated with the reverse path. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes in a single path search iteration, such as via a traversal of a weighted directed graph, thereby improving performance.

7. 发明授权

US10348610B2 Method and apparatus for minimum label bandwidth guaranteed path for segment routing 有权
公开(公告)号：US10348610B2
公开(公告)日：2019-07-09
申请号：US15605749
申请日：2017-05-25
申请人： Fang Hao , Murali Kodialam , T. V. Lakshman , Ehsan Rezaaifar
发明人： Fang Hao , Murali Kodialam , T. V. Lakshman , Ehsan Rezaaifar
IPC分类号： H04L12/749 , H04L12/729 , H04L12/733 , H04L12/723 , H04L12/721 , H04L12/741
摘要： Various embodiments relate to a non-transitory computer readable medium and method thereof for finding a minimum hop path in a segment graph traversing the least number of links in a physical topology, the method including receiving a connection request for a connection between a source node and a destination node, computing the segment graph, the segment graph having a plurality of links, computing a bandwidth for each of the plurality of links in the segment graph, computing the number of links for a shortest path (“N(q)”) for each of the plurality of links, eliminating each of the plurality of link with a bandwidth less than the minimum bandwidth and selecting the shortest path in the physical topology between the plurality of links.

8. 发明申请

US20170207993A1 BIDIRECTIONAL CONSTRAINED PATH SEARCH 审中-公开
公开(公告)号：US20170207993A1
公开(公告)日：2017-07-20
申请号：US14997921
申请日：2016-01-18
申请人： Andrew W. Stone , Felix Katz , Ehsan Rezaaifar , Attaullah Zabihi-Seissan
发明人： Andrew W. Stone , Felix Katz , Ehsan Rezaaifar , Attaullah Zabihi-Seissan
IPC分类号： H04L12/751
CPC分类号： H04L45/02 , H04L45/12 , H04L45/123
摘要： This disclosure generally discloses a bidirectional constrained path search mechanism. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, such that the bidirectional paths share a common set of resources. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes, subject to one or more constraints, by determining a forward path that satisfies a set of forward path constraints associated with the forward path and determining a reverse path that satisfies a set of reverse path constraints associated with the reverse path. The bidirectional constrained path search mechanism may be configured to determine bidirectional paths between a pair of nodes in a single path search iteration, such as via a traversal of a weighted directed graph, thereby improving performance.

9. 发明申请

US20080239958A1 ROUTING PATH CALCULATION APPARATUS AND METHODS 有权
标题翻译：路由计算设备和方法
公开(公告)号：US20080239958A1
公开(公告)日：2008-10-02
申请号：US11692578
申请日：2007-03-28
申请人： Christopher Warren Murray , Reza Mohammad Rokui , Ehsan Rezaaifar , Chuong Ngoc Ngo
发明人： Christopher Warren Murray , Reza Mohammad Rokui , Ehsan Rezaaifar , Chuong Ngoc Ngo
IPC分类号： H04L12/56
CPC分类号： H04L45/22 , H04L45/02 , H04L45/04 , H04L45/122 , H04L45/124 , H04L45/28 , H04L45/306 , H04L45/42 , H04L45/44 , H04L45/60
摘要： Routing path calculation apparatus and methods are disclosed. Calculation of routing paths within different routing areas of a communication system is handled by respective routing path calculation devices. Multiple devices may be requested to perform respective routing path calculations for segments of a routing path between endpoints in different routing areas. Recalculations may be requested from the same or different devices in the event of a change in a routing area that affects a segment of a routing path. A routing path calculation device, whether or not in this type of distributed routing path calculation system, may determine whether a previously configured path exists between an intermediate node of a calculated routing path, and take the previously configured path into account in calculating the routing path if it is determined that a previously configured path exists. The previously configured path may be an Interior Gateway Protocol (IGP) shortcut, for example.
摘要翻译：公开了路径计算装置和方法。通信系统的不同路由区域内的路由路径的计算由相应的路由路径计算设备来处理。可以请求多个设备对不同路由区域中的端点之间的路由路径的段执行相应的路由路径计算。在影响路由路径的段的路由区域发生变化的情况下，可以从相同或不同的设备请求重新计算。无论是否在这种分布式路由路径计算系统中，路由路径计算设备可以确定在计算的路由路径的中间节点之间是否存在先前配置的路径，并且在计算路由路径时考虑以前配置的路径如果确定先前配置的路径存在。例如，先前配置的路径可以是内部网关协议（IGP）快捷方式。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式