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

11. 发明授权

US07400589B2 Method and apparatus for deriving optimal paths through a network subject to a subset sequence constraint 有权
标题翻译：用于通过经受子集序列约束的网络导出最优路径的方法和装置
公开(公告)号：US07400589B2
公开(公告)日：2008-07-15
申请号：US10787107
申请日：2004-02-27
申请人： Hong Zhang , Ravi Ravindran , Peter Ashwood Smith , Guo Qiang Wang
发明人： Hong Zhang , Ravi Ravindran , Peter Ashwood Smith , Guo Qiang Wang
IPC分类号： H04L12/28
CPC分类号： H04L45/00 , H04L45/48
摘要： A routing tree that spans a graph representing a network is constructed by iteratively expanding the tree to include a node of the graph that is not in the tree, the node being chosen because an allowable path extends from a root of the tree to the node that is optimal in comparison with the other paths to the other nodes not in the tree. If the path to the node cannot be extended to a node in the serial restriction group, the node is re-included in the tree using a secondary path to the node that can be extended to a node in the serial restriction group, if the secondary path is most optimal among the paths to nodes outside of the tree.
摘要翻译：跨越表示网络的图形的路由树通过迭代地扩展树以构成不包括在树中的图的节点来构造，该节点被选择，因为允许的路径从树的根延伸到节点与不在树中的其他节点的其他路径相比是最佳的。如果节点的路径不能扩展到串行限制组中的一个节点，则使用可以扩展到串行限制组中的节点的节点的辅助路径将节点重新包含在树中，如果辅助节点路径在树之外的节点的路径中是最佳的。

12. 发明申请

US20080056137A1 Method and apparatus for selecting between available neighbors in a rapid alternate path calculation 失效
标题翻译：用于在快速替代路径计算中在可用邻居之间进行选择的方法和装置
公开(公告)号：US20080056137A1
公开(公告)日：2008-03-06
申请号：US11512671
申请日：2006-08-30
申请人： Ravi Ravindran , Peter Ashwood Smith , Hong Zhang
发明人： Ravi Ravindran , Peter Ashwood Smith , Hong Zhang
IPC分类号： H04J3/14 , G06F15/173 , H04J1/16 , H04L12/28
CPC分类号： H04L45/12 , H04L41/06 , H04L45/00 , H04L45/02 , H04L45/123 , H04L45/18 , H04L45/22 , H04L45/28
摘要： A weighting process may be used to select between alternate neighbors in a RAPID calculation to enable policy and/or traffic engineering considerations to affect the selection of an alternate path through the network. The information used to weight the neighbors may static administratively assigned weighting information or dynamic weighting information such as local statistical traffic condition information. The process may take into account the amount of traffic being handled by the current primary next hop for the destination, the available capacity of the available alternate neighbors, the ability of the alternate neighbors to handle the additional traffic, and other considerations. Weighting may occur after a set of available loop free alternate neighbors has been determined. Alternatively, weighting may occur before the RAPID calculation has been performed to cause the neighbors to be ordered prior to RAPID processing. This may enable RAPID calculation to stop without considering all available neighbors.
摘要翻译：可以使用加权过程来在RAPID计算中的备选邻居之间进行选择，以使策略和/或流量工程注意事项能够影响通过网络的备用路径的选择。用于加权邻居的信息可以静态地管理地分配加权信息或动态加权信息，例如本地统计交通状况信息。该过程可以考虑由目的地的当前主要下一跳处理的业务量，可用替代邻居的可用容量，备用邻居处理附加业务的能力以及其他考虑。在确定了一组可用的无环路交替邻居之后，可能会发生加权。或者，可以在执行RAPID计算之前进行加权，以使得在RAPID处理之前对邻居进行排序。这可能使RAPID计算停止，而不考虑所有可用的邻居。

13. 发明授权

US08264949B2 Method and apparatus for selecting between available neighbors in a rapid alternate path calculation 失效
标题翻译：用于在快速替代路径计算中在可用邻居之间进行选择的方法和装置
公开(公告)号：US08264949B2
公开(公告)日：2012-09-11
申请号：US11512671
申请日：2006-08-30
申请人： Ravi Ravindran , Peter Ashwood Smith , Hong Zhang
发明人： Ravi Ravindran , Peter Ashwood Smith , Hong Zhang
IPC分类号： G01R31/08
CPC分类号： H04L45/12 , H04L41/06 , H04L45/00 , H04L45/02 , H04L45/123 , H04L45/18 , H04L45/22 , H04L45/28
摘要： A weighting process may be used to select between alternate neighbors in a RAPID calculation to enable policy and/or traffic engineering considerations to affect the selection of an alternate path through the network. The information used to weight the neighbors may static administratively assigned weighting information or dynamic weighting information such as local statistical traffic condition information. The process may take into account the amount of traffic being handled by the current primary next hop for the destination, the available capacity of the available alternate neighbors, the ability of the alternate neighbors to handle the additional traffic, and other considerations. Weighting may occur after a set of available loop free alternate neighbors has been determined. Alternatively, weighting may occur before the RAPID calculation has been performed to cause the neighbors to be ordered prior to RAPID processing. This may enable RAPID calculation to stop without considering all available neighbors.
摘要翻译：可以使用加权过程来在RAPID计算中的备选邻居之间进行选择，以使策略和/或流量工程注意事项能够影响通过网络的备用路径的选择。用于加权邻居的信息可以静态地管理地分配加权信息或动态加权信息，例如本地统计交通状况信息。该过程可以考虑由目的地的当前主要下一跳处理的业务量，可用备用邻居的可用容量，备用邻居处理附加业务的能力以及其他考虑。在确定了一组可用的无环路交替邻居之后，可能会发生加权。或者，可以在执行RAPID计算之前进行加权，以使得在RAPID处理之前对邻居进行排序。这可能使RAPID计算停止，而不考虑所有可用的邻居。

14. 发明授权

US08189481B2 QoS-based routing for CE-based VPN 有权
标题翻译：基于QoS的路由为基于CE的VPN
公开(公告)号：US08189481B2
公开(公告)日：2012-05-29
申请号：US11400755
申请日：2006-04-07
申请人： Ravi Ravindran , Donald Fedyk , Lakshminath Dondeti , Hong Zhang
发明人： Ravi Ravindran , Donald Fedyk , Lakshminath Dondeti , Hong Zhang
IPC分类号： G01R31/08 , G06F11/00 , G08C15/00 , H04J1/16 , H04J3/14 , H04L1/00 , H04L12/26
CPC分类号： H04L12/4641 , H04L45/02 , H04L45/124 , H04L45/302 , H04L63/0272
摘要： CE devices of the present invention are enabled to make more judicious routing decisions in CE-based VPNs. In determining a next-hop in a path from a source CE to a destination subnet, CE-to-CE costs are associated with each next-hop CE in a plurality of next-hop CEs. Each CE-to-CE cost is a cost of a path from the source CE to the associated next-hop CE. CE-to-subnet costs are associated with each of the next-hop CEs. Each CE-to-subnet cost is a cost of a path from the associated next-hop CE to the destination subnet. Total-costs are associated with each of the next-hop CEs. Each total-cost is a sum of a CE-to-CE cost associated with a next-hop CE and a CE-to-subnet cost associated with the same next-hop CE. The next-hop in the path is set to be a next-hop CE associated with an associated total-cost.
摘要翻译：本发明的CE设备能够在基于CE的VPN中做出更明智的路由决策。在确定从源CE到目的地子网的路径中的下一跳时，CE到CE的成本与多个下一跳CE中的每个下一跳CE相关联。每个CE到CE的成本是从源CE到相关联的下一跳CE的路径的成本。 CE到子网的成本与每个下一跳CE相关联。每个CE到子网的成本是从相关联的下一跳CE到目的地子网的路径的成本。总成本与每个下一跳CE相关联。每个总成本是与下一跳CE相关联的CE到CE成本和与相同下一跳CE相关联的CE到子网成本的总和。该路径中的下一跳设置为与相关总成本相关联的下一跳CE。

15. 发明授权

US07561586B2 Method and apparatus for providing network VPN services on demand 失效
标题翻译：根据需要提供网络VPN服务的方法和装置
公开(公告)号：US07561586B2
公开(公告)日：2009-07-14
申请号：US10666529
申请日：2003-09-19
申请人： Guo-Quiang Wang , Ravi Ravindran , Min Xia
发明人： Guo-Quiang Wang , Ravi Ravindran , Min Xia
IPC分类号： H04L12/28 , H04L12/56 , H04J3/16 , H04J3/22 , H04J3/12
CPC分类号： H04L12/4608
摘要： A S-VPN gateway provides a signaling gateway to integrate SIP signaling and UNI/NNI signaling, and manage the mapping between SIP sessions and VPN connections. The mapping relationship reflects the access of user applications to the specific VPN tunnels, multiplexing of media service sessions to VPN tunnels, VPN service creation, service duration, VPN QoS, VPN service life cycle management, and VPN service charge based on a per-service-usage. The S-VPN gateway also provides VPN access policy/security management (i.e., inter-domain AAA process), VPN membership auto-discovery, service auto-discovery, network resource auto-discovery, address resolution service for both SIP and VPN naming space, VPN service mobility, and SLA management. The S-VPN gateway enables network VPN tunnels to be created in advanced and accessed on-demand, for example by enterprise VPN applications such as GRID applications, through a SIP interface.
摘要翻译： S-VPN网关提供信令网关，集成SIP信令和UNI / NNI信令，并管理SIP会话和VPN连接之间的映射。映射关系反映了用户应用对特定VPN隧道的访问，媒体业务会话到VPN隧道的复用，VPN业务创建，业务持续时间，VPN QoS，VPN业务生命周期管理以及基于每个业务的VPN业务费用 -用法。 S-VPN网关还提供VPN访问策略/安全管理（即域间AAA进程），VPN成员自动发现，服务自动发现，网络资源自动发现，SIP和VPN命名空间的地址解析服务，VPN服务移动性和SLA管理。 S-VPN网关使网络VPN隧道可以按照高级和按需访问的方式创建，例如通过SIP接口的企业VPN应用程序，如GRID应用程序。

16. 发明申请

US20060245363A1 QoS-based routing for CE-based VPN 有权
标题翻译：基于QoS的路由为基于CE的VPN
公开(公告)号：US20060245363A1
公开(公告)日：2006-11-02
申请号：US11400755
申请日：2006-04-07
申请人： Ravi Ravindran , Donald Fedyk , Lakshminath Dondeti , Hong Zhang
发明人： Ravi Ravindran , Donald Fedyk , Lakshminath Dondeti , Hong Zhang
IPC分类号： H04J3/14
CPC分类号： H04L12/4641 , H04L45/02 , H04L45/124 , H04L45/302 , H04L63/0272
摘要： CE devices of the present invention are enabled to make more judicious routing decisions in CE-based VPNs. In determining a next-hop in a path from a source CE to a destination subnet, CE-to-CE costs are associated with each next-hop CE in a plurality of next-hop CEs. Each CE-to-CE cost is a cost of a path from the source CE to the associated next-hop CE. CE-to-subnet costs are associated with each of the next-hop CEs. Each CE-to-subnet cost is a cost of a path from the associated next-hop CE to the destination subnet. Total-costs are associated with each of the next-hop CEs. Each total-cost is a sum of a CE-to-CE cost associated with a next-hop CE and a CE-to-subnet cost associated with the same next-hop CE. The next-hop in the path is set to be a next-hop CE associated with an associated total-cost.
摘要翻译：本发明的CE设备能够在基于CE的VPN中做出更明智的路由决策。在确定从源CE到目的地子网的路径中的下一跳时，CE到CE的成本与多个下一跳CE中的每个下一跳CE相关联。每个CE到CE的成本是从源CE到相关联的下一跳CE的路径的成本。 CE到子网的成本与每个下一跳CE相关联。每个CE到子网的成本是从相关联的下一跳CE到目的地子网的路径的成本。总成本与每个下一跳CE相关联。每个总成本是与下一跳CE相关联的CE到CE成本和与相同下一跳CE相关联的CE到子网成本的总和。该路径中的下一跳设置为与相关总成本相关联的下一跳CE。

17. 发明申请

US20050111375A1 Method and apparatus for computing metric information for abstracted network links 有权
标题翻译：用于计算抽象网络链路的度量信息的方法和装置
公开(公告)号：US20050111375A1
公开(公告)日：2005-05-26
申请号：US10718681
申请日：2003-11-24
申请人： Ravi Ravindran , Peter Ashwood Smith , Guo Wang , Hong Zhang
发明人： Ravi Ravindran , Peter Ashwood Smith , Guo Wang , Hong Zhang
IPC分类号： H04L12/56 , H04L12/66
CPC分类号： H04L45/123 , H04L45/12
摘要： A method and apparatus for associating metric information with an abstracted link of an abstracted network map that includes certain network elements (NEs) of a data transport network involves computing routes through the data transport network between the NEs of the abstracted network map. The routes may be computed using the shortest widest path algorithm. The routes from an NE are exchanged with the other NEs of the abstracted network map, so that an edge NE receives the resource availability information of all optimal routes between pairs of NEs in the abstracted network map. The edge NE then transforms the resource availability of a corresponding optimal route into metric information of an abstracted link. The metric information is sent to a client associated with the abstracted network map to permit the client to make routing decisions.
摘要翻译：用于将度量信息与包括数据传输网络的某些网元（NE）的抽象网络映射的抽象链路相关联的方法和装置涉及通过抽象网络映射的NE之间的数据传输网络来计算路由。可以使用最短最宽路径算法计算路由。来自网元的路由与抽象网络图的其他网元交换，边缘网元在抽象网络图中收到网元对之间的所有最优路由的资源可用性信息。边缘NE然后将对应的最优路由的资源可用性转换为抽象链路的度量信息。将度量信息发送到与抽象网络映射关联的客户端，以允许客户端做出路由决定。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式