利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

18 条记录 (耗时 0.021 秒)

    Method and apparatus for instantiating a path with the minimum number of segments
    3.
    发明授权
    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.

    LINE-RATE, REAL-TIME-TRAFFIC DETECTOR
    5.
    发明申请
    LINE-RATE, REAL-TIME-TRAFFIC DETECTOR 有权
    线速度，实时交通检测器

    公开(公告)号：US20110044201A1

    公开(公告)日：2011-02-24

    申请号：US12543529

    申请日：2009-08-19

    申请人： Fang Hao ,  Murali Kodialam ,  T. V. Lakshman

    发明人： Fang Hao ,  Murali Kodialam ,  T. V. Lakshman

    IPC分类号： H04L12/26

    CPC分类号： H04L41/142 ,  H04L47/19 ,  H04L47/2416 ,  H04L47/2441 ,  H04L65/80

    摘要： A line-rate, real-time-traffic detector classifies a network traffic flow as real-time when it determines the smoothness of the packet arrival rate of the network traffic flow is bounded by an empirically derived bound. In some embodiments, to improve performance, a tighter smoothness bound is applied to the smoothness calculations performed on a first set of packet arrival times, while a looser smoothness bound is applied to a second set of packet arrival times, the second set inclusive of and larger than the first.

    摘要翻译： 线速率实时业务检测器在确定网络业务流的分组到达速率由经验导出的边界限定时的平滑度时，将网络流量流分类为实时。 在一些实施例中，为了提高性能，对于在第一组分组到达时间上执行的平滑度计算应用更紧密的平滑度约束，而将更松散的平滑度约束应用于第二组分组到达时间，第二组包括和 大于第一。

    Securing software defined networks via flow deflection
    6.
    发明授权
    Securing software defined networks via flow deflection 有权
    通过流量偏移保护软件定义的网络

    公开(公告)号：US09306840B2

    公开(公告)日：2016-04-05

    申请号：US13627003

    申请日：2012-09-26

    申请人： Krishna P. Puttaswamy Naga ,  Fang Hao ,  T. V. Lakshman

    发明人： Krishna P. Puttaswamy Naga ,  Fang Hao ,  T. V. Lakshman

    IPC分类号： G06F15/173 ,  H04L12/717 ,  H04L29/06 ,  H04L12/715 ,  H04L12/743

    CPC分类号： H04L47/80 ,  H04L12/4641 ,  H04L45/42 ,  H04L45/50 ,  H04L45/64 ,  H04L45/7457 ,  H04L63/1458 ,  H04L63/20

    摘要： A flow deflection capability is provided for deflecting data flows within a Software Defined Network (SDN) in order to provide security for the SDN. A flow forwarding rule is generated for a first network element of the SDN based on detection of a condition (e.g., TCAM utilization condition, CPU utilization condition, or the like) associated with the first network element. The flow forwarding rule is generated by a control element of the SDN or the first network element of the SDN. The flow forwarding rule is indicative that at least a portion of new flow requests received at the first network element are to be forwarded from the first network element to a second network element of the SDN. The flow forwarding rule may specify full flow deflection or selective flow deflection.

    摘要翻译： 提供流量偏转能力用于偏转软件定义网络（SDN）内的数据流，以便为SDN提供安全性。 基于与第一网元相关联的条件（例如，TCAM利用条件，CPU利用条件等）的检测，为SDN的第一网元生成流转发规则。 流转发规则由SDN的控制元素或SDN的第一网元生成。 流转发规则指示在第一网元接收到的新流请求的至少一部分将从第一网元转发到SDN的第二网元。 流量转移规则可以指定全流量偏转或选择性流量偏转。

    Apparatus and method for matching offers and requests for sharing of resources
    7.
    发明授权
    Apparatus and method for matching offers and requests for sharing of resources 有权
    用于匹配资源和资源共享的请求的装置和方法

    公开(公告)号：US09535748B2

    公开(公告)日：2017-01-03

    申请号：US13370443

    申请日：2012-02-10

    申请人： Ramesh Viswanathan ,  Adiseshu Hari ,  Yuh-Jye Chang ,  T. V. Lakshman

    发明人： Ramesh Viswanathan ,  Adiseshu Hari ,  Yuh-Jye Chang ,  T. V. Lakshman

    IPC分类号： G06F15/173 ,  G06F9/50

    CPC分类号： G06F9/5005 ,  G06F9/50 ,  H04L67/10

    摘要： A resource assignment capability is presented. A resource specification associated with a plurality of elements is received. The resource specification includes, for each of the elements, a resource request including an indication of a quantity of resources requested by the element and a resource offer including an indication of a quantity of resources offered by the element for use by one or more other elements. A resource assignment, including an indication of an association between the resources requests and the resource offers, is determined using a resource assignment process. The resource assignment process may be a greedy assignment process or a maximum flow resource assignment process. The maximum flow resource assignment process includes constructing a maximum flow resource graph based on the one or more resource specifications and applying a maximum flow process to the maximum flow resource graph to determine thereby the resource assignment.

    摘要翻译： 提出资源分配能力。 接收与多个元素相关联的资源规范。 所述资源规范对于每个元素包括资源请求，其包括由所述元素请求的资源的数量的指示和资源提供，所述资源提供包括由所述元素提供的资源的数量的指示以供一个或多个其他元素使用 。 使用资源分配处理来确定包括资源请求与资源提供之间的关联的指示的资源分配。 资源分配过程可以是贪心分配过程或最大流资源分配过程。 最大流资源分配过程包括基于一个或多个资源规范构建最大流资源图，并将最大流程应用于最大流资源图，从而确定资源分配。

    Routing with service level guarantees between ingress-egress points in a packet network
    8.
    发明授权
    Routing with service level guarantees between ingress-egress points in a packet network 有权
    在分组网络中的入口到出口点之间进行业务级保证的路由

    公开(公告)号：US06584071B1

    公开(公告)日：2003-06-24

    申请号：US09366620

    申请日：1999-08-03

    申请人： Muralidharan S. Kodialam ,  T. V. Lakshman

    发明人： Muralidharan S. Kodialam ,  T. V. Lakshman

    IPC分类号： H04L1256

    CPC分类号： H04L45/50 ,  H04L45/02 ,  H04L45/10 ,  H04L45/12 ,  H04L45/122 ,  H04L45/124 ,  H04L45/302 ,  H04L45/308

    摘要： A packet network of interconnected nodes employs a method of routing with service level guarantees to determine a path through the network for a requested label-switched path (LSP). Each of the nodes includes one or more routers that forward packets based on a forwarding table constructed from paths determined in accordance with the method of routing with service level guarantees. The method of routing with service level guarantees determines the path of the requested LSP based on the effect that routing those packets of the requested LSP may have on current and/or future demands on the capacity of network nodes for currently provisioned LSPs. Such method of routing with service level guarantees may not necessarily route packets of a requested LSP along the shortest path, or minimum number of hops, through the network. Given the packet network and LSP request, a linear programming system may be defined by a set of linear programming equations for a non-split demand case. The linear programming system is based on the network topology, the values of the ingress-egress point pair o and t and demand bd of the LSP request, and the total maxflow values of the existing ingress-egress point pair for currently provisioned LSPs. To estimate the solution for the linear programming system, a subnetwork is formed using link weights and links removed that cannot support the requested demand. Link weights are calculated based on the critical links of a pseudo-network in which increased maximum flow along existing paths between ingress-egress point pairs is maintained. A shortest path routing algorithm may then be employed to generate a path, if available, for the LSP request using the subnetwork with the calculated link weights.

    摘要翻译： 互连节点的分组网络采用使用服务级别保证进行路由的方法，以针对所请求的标签交换路径（LSP）确定通过网络的路径。 每个节点包括一个或多个路由器，其基于由根据具有服务级别保证的路由方法确定的路径构建的转发表来转发分组。 基于服务级保证路由的方法基于所请求的LSP的这些分组的路由可能对当前和/或将来对当前配置的LSP的网络节点的容量的需求的影响来确定所请求的LSP的路径。 这种使用服务级别保证的路由方法可能不一定通过网络沿着最短路径或最小跳数来路由所请求的LSP的分组。 给定分组网络和LSP请求，可以通过用于非分裂需求情况的一组线性规划方程来定义线性规划系统。 线性规划系统基于网络拓扑，入口出口点对o和t的值以及LSP请求的需求bd以及当前配置的LSP的现有入口出口对的总最大流量值。 为了估计线性规划系统的解决方案，使用不能支持请求的需求的链路权重和链路去除形成子网络。 基于伪网络的关键链路来计算链路权重，其中保持了入口到出站对之间沿现有路径的最大流量增加。 然后可以采用最短路径路由算法来生成使用具有计算的链路权重的子网络的LSP请求的路径（如果可用）。

    Constraint-based routing between ingress-egress points in a packet network
    9.
    发明授权
    Constraint-based routing between ingress-egress points in a packet network 有权
    分组网络中出入口点之间的基于约束的路由

    公开(公告)号：US06538991B1

    公开(公告)日：2003-03-25

    申请号：US09366619

    申请日：1999-08-03

    申请人： Muralidharan S. Kodialam ,  T. V. Lakshman

    发明人： Muralidharan S. Kodialam ,  T. V. Lakshman

    IPC分类号： H04L1256

    CPC分类号： H04L47/825 ,  H04L41/5003 ,  H04L41/5025 ,  H04L45/00 ,  H04L45/14 ,  H04L45/302 ,  H04L45/308 ,  H04L45/50 ,  H04L47/15 ,  H04L47/70 ,  H04L47/724 ,  H04L47/781 ,  H04L47/783 ,  H04L47/822 ,  H04L47/823 ,  H04L47/829

    摘要： A packet network of interconnected nodes employs a constraint-based routing method to determine a path through the network for a requested label-switched path (LSP). Each of the nodes includes one or more routers that forward packets based on a forwarding table constructed from paths determined in accordance with the constraint-based routing method. The constraint-based method determines the path of the requested LSP based on the effect that routing those packets of the requested LSP may have on current and/or future demands on the capacity of network nodes for currently provisioned LSPs. Such constraint-based routing method may not necessarily route packets of a requested LSP along the shortest path, or minimum number of hops, through the network. Given the packet network and LSP request, a linear programming system is defined by a set of linear programming equations. The linear programming system is based on the network topology, the values of the ingress-egress point pair o and t and demand bd of the LSP request, and the total maxflow values of the existing ingress-egress point pair for currently provisioned LSPs. The solution is estimated for a linear programming system of either split demand, non-split demand, or batch demand implementations for routing packets of the LSP. The constraint-based routing method may solve the linear programming system using common linear programming techniques.

    摘要翻译： 互连节点的分组网络采用基于约束的路由方法来确定针对所请求的标签交换路径（LSP）的通过网络的路径。 每个节点包括一个或多个路由器，其基于由根据基于约束的路由方法确定的路径构建的转发表来转发分组。 基于约束的方法基于所请求的LSP的这些分组的路由可能对当前和/或将来对当前配置的LSP的网络节点的容量的需求的影响来确定所请求的LSP的路径。 这种基于约束的路由方法可能不一定通过网络沿着最短路径或最小跳数来路由请求的LSP的分组。 给定分组网络和LSP请求，线性规划系统由一组线性规划方程定义。 线性规划系统基于网络拓扑，入口出口点对o和t的值以及LSP请求的需求bd以及当前配置的LSP的现有入口出口对的总最大流量值。 该解决方案针对用于路由LSP的分组的分组需求，非分裂需求或批量需求实现的线性规划系统进行估计。 基于约束的路由方法可以使用公共线性规划技术来解决线性规划系统。