利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

199 条记录 (耗时 0.174 秒)

    Method and apparatus for identifying network connectivity changes in dynamic networks
    1.
    发明授权
    Method and apparatus for identifying network connectivity changes in dynamic networks 失效
    用于识别动态网络中网络连接变化的方法和装置

    公开(公告)号：US08509098B2

    公开(公告)日：2013-08-13

    申请号：US11414126

    申请日：2006-04-28

    申请人： Gary W. Atkinson ,  Xiang Liu ,  Ramesh Nagarajan ,  Shyam P. Parekh

    发明人： Gary W. Atkinson ,  Xiang Liu ,  Ramesh Nagarajan ,  Shyam P. Parekh

    IPC分类号： G01R31/08 ,  H04W4/00

    CPC分类号： H04W40/24 ,  H04L45/02 ,  H04W84/18

    摘要： The invention comprises a method and apparatus for determining a network connectivity in a network having a plurality of nodes. In particular, one embodiment of the method includes generating a candidate link for each of a plurality of node pairs, predicting a performance of each candidate link by evaluating an expected impact of at least one condition on each candidate link, and determining the network topology using the predicted performances of the candidate links. The performance of each candidate link may be predicted by identifying at least one condition, determining the expected impact of the at least one condition on the candidate link, and predicting the performance of the candidate link by adjusting an expected performance of the candidate link using the expected impact of the at least one condition on the candidate link.

    摘要翻译： 本发明包括一种用于确定具有多个节点的网络中的网络连接性的方法和装置。 特别地，该方法的一个实施例包括为多个节点对中的每一个生成候选链路，通过评估至少一个条件对每个候选链路的预期影响来预测每个候选链路的性能，以及使用 候选人链接的预测表现。 每个候选链路的性能可以通过识别至少一个条件，确定至少一个条件对候选链路的预期影响以及通过使用该候选链路调整候选链路的预期性能来预测候选链路的性能来预测 至少一个条件对候选链接的预期影响。

    QUALITY OF SERVICE AWARE ROUTING OVER MOBILE AD HOC NETWORKS (MANETS)
    3.
    发明申请
    QUALITY OF SERVICE AWARE ROUTING OVER MOBILE AD HOC NETWORKS (MANETS) 审中-公开
    服务质量通过移动广告网络（MANETS）

    公开(公告)号：US20080159144A1

    公开(公告)日：2008-07-03

    申请号：US11617876

    申请日：2006-12-29

    申请人： Ramesh Nagarajan ,  Shyam P. Parekh ,  Kiran M. Rege

    发明人： Ramesh Nagarajan ,  Shyam P. Parekh ,  Kiran M. Rege

    IPC分类号： G08C15/00

    CPC分类号： H04W40/30 ,  H04L45/124 ,  H04L45/3065 ,  H04W40/24

    摘要： The present invention provides a method and apparatus for routing a data flow from a source node to a destination node in a mobile ad-hoc network (MANET). The present invention performs this function by first determining desired service requirements for an individual data flow to be forwarded to a destination node. Next, the present invention broadcasts an advertisement for each of the links in the MANET by the corresponding origination nodes, the advertisement including a value indicating the current performance level of the link. After broadcasting the advertisements, routing tables are composed at each of the nodes based upon the advertisements. Each routing table is constructed taking into account the advertised links and their corresponding values. After composing the routing tables, packets are forwarded toward their respective destinations by utilizing the routing tables in such a manner that the desired service requirements are satisfied.

    摘要翻译： 本发明提供一种用于将数据流从源节点路由到移动自组织网络（MANET）中的目的地节点的方法和装置。 本发明通过首先确定要转发到目的地节点的单个数据流的期望业务需求来执行该功能。 接下来，本发明通过相应的发起节点广播MANET中的每个链路的广告，该广告包括指示链接的当前性能水平的值。 在广播广告之后，基于广告在每个节点上组成路由表。 每个路由表的构建考虑到所通告的链接及其对应的值。 在组合路由表之后，通过利用路由表将分组转发到它们各自的目的地，使得满足期望的业务需求。

    EFFICIENT PERFORMANCE MONITORING USING IPv6 CAPABILITIES
    4.
    发明申请
    EFFICIENT PERFORMANCE MONITORING USING IPv6 CAPABILITIES 审中-公开
    使用IPv6能力进行有效的性能监控

    公开(公告)号：US20080159287A1

    公开(公告)日：2008-07-03

    申请号：US11617837

    申请日：2006-12-29

    申请人： Ramesh Nagarajan ,  Shyam P. Parekh ,  Kiran M. Rege

    发明人： Ramesh Nagarajan ,  Shyam P. Parekh ,  Kiran M. Rege

    IPC分类号： H04L12/56

    CPC分类号： H04L12/66 ,  H04L47/724 ,  H04L69/22

    摘要： The present invention provides a method for obtaining and reporting performance information on node-to-node data transfers, i.e., network hops, based on integrated capabilities in Internet Protocol version 6 (IPv6), specifically extension headers. The performance of a (real-time) data flow is monitored between a source-destination pair by inserting specific information in an extension header of select data packets in the data flow. By initiating an extension header at a source client, and updating the extension header at any intermediate nodes along the source-destination path, a destination node can produce a detailed set of statistics relating to the current performance level of select nodes in a network based upon the reported data in the extension header. Additionally, data flow performance can be monitored on any desired network path or segment independent of particular flows on those paths.

    摘要翻译： 本发明提供一种用于基于因特网协议版本6（IPv6）中的集成能力，特别是扩展报头来获得和报告节点到节点数据传输（即，网络跳跃）的性能信息的方法。 通过在数据流中的选择数据分组的扩展头部插入特定信息，在源 - 目的地对之间监视（实时）数据流的性能。 通过在源客户端发起扩展报头，并且沿着源 - 目的地路径更新任何中间节点处的扩展报头，目的地节点可以产生与网络中的选择节点的当前性能级别相关的详细的一组统计信息 报告的数据在扩展头中。 此外，可以在任何所需的网络路径或段上独立于这些路径上的特定流量来监视数据流性能。

    LINK SIGNAL-TO-NOISE AWARE ROUTING OVER MOBILE AD HOC NETWORKS (MANETS)
    5.
    发明申请
    LINK SIGNAL-TO-NOISE AWARE ROUTING OVER MOBILE AD HOC NETWORKS (MANETS) 审中-公开
    链接信号通知移动通信网络（MANETS）

    公开(公告)号：US20080159143A1

    公开(公告)日：2008-07-03

    申请号：US11617858

    申请日：2006-12-29

    申请人： Ramesh Nagarajan ,  Shyam P. Parekh ,  Kiran M. Rege

    发明人： Ramesh Nagarajan ,  Shyam P. Parekh ,  Kiran M. Rege

    IPC分类号： G08C15/00

    CPC分类号： H04W40/30 ,  H04W40/12

    摘要： The present invention provides a method and apparatus for routing a data flow from a source node to a destination node in a mobile ad-hoc network (MANET). The present invention performs this function by first determining a quantitative value for each link at an individual node in the MANET, where the value represents the current quality level of each of the links. Next, the present invention broadcasts an advertisement for each of the links in the MANET by each of the nodes, the advertisement including the value determined above. After broadcasting the advertisement, routing tables are composed at each of the nodes based upon the advertisements. Each routing table includes the value determined above. After composing the routing tables, a route based upon the routing table (and the link values contained therein) is selecting by the source node to direct the data flow to the destination node.

    摘要翻译： 本发明提供一种用于将数据流从源节点路由到移动自组织网络（MANET）中的目的地节点的方法和装置。 本发明通过首先确定MANET中各个节点上的每个链路的定量值来执行该功能，其中该值表示每个链路的当前质量等级。 接下来，本发明通过每个节点广播MANET中的每个链路的广告，广告包括上面确定的值。 在广播广告之后，基于广告在每个节点上组成路由表。 每个路由表包括上面确定的值。 在组合路由表之后，基于路由表（及其中包含的链路值）的路由是由源节点选择以将数据流引导到目的地节点。

    TRAFFIC ENGINEERING AND FAST PROTECTION USING IPv6 CAPABILITIES
    6.
    发明申请
    TRAFFIC ENGINEERING AND FAST PROTECTION USING IPv6 CAPABILITIES 审中-公开
    使用IPv6能力的交通工程和快速保护

    公开(公告)号：US20080159288A1

    公开(公告)日：2008-07-03

    申请号：US11617843

    申请日：2006-12-29

    申请人： Ramesh Nagarajan ,  Shyam P. Parekh ,  Kiran M. Rege

    发明人： Ramesh Nagarajan ,  Shyam P. Parekh ,  Kiran M. Rege

    IPC分类号： H04L12/56

    CPC分类号： H04L45/22 ,  H04L45/10 ,  H04L45/28 ,  H04L45/34 ,  H04L45/38

    摘要： The present invention provides a method for traffic engineering and fast protection of individual data flows using capabilities supported by IPv6. By utilizing IPv6 extension headers and flow labels a specific network route based upon quality of service (QoS) requirements of a data flow can be selected by a source node. Once a route meeting the QoS requirements of the data flow is selected, a source node can insert the route in an initial packet header and force the flow along the corresponding network path. The source and intermediate nodes cache the route and the flow label selected for a data flow. For subsequent packets, the flow label is used by intermediate nodes to determine the next hop along the route. In the event of a failure, an intermediate node can force the insertion of a new route (along with the original flow label) in the next packet belonging to the failed data flow so that, as the packet is forwarded toward the destination, intermediate nodes on this new path can cache the route and the corresponding flow label. This new route is then used to continue forwarding the data flow to the destination node.

    摘要翻译： 本发明提供一种流量工程方法，并且利用IPv6支持的能力快速保护各个数据流。 通过利用IPv6扩展报头和流标签，可以由源节点选择基于数据流的服务质量（QoS）要求的特定网络路由。 一旦选择了满足数据流的QoS要求的路由，源节点可以将路由插入到初始分组报头中，并强制流沿相应的网络路径。 源节点和中间节点缓存为数据流选择的路由和流标签。 对于后续数据包，中间节点使用流标签来确定沿路由的下一跳。 在发生故障的情况下，中间节点可以强制将新路由（连同原始流标签）插入属于失败数据流的下一个分组，使得当分组被转发到目的地时，中间节点 在这个新路径上可以缓存路由和相应的流标签。 然后使用该新路由继续将数据流转发到目的地节点。

    LINK ACCESS DELAY AWARE ROUTING OVER MOBILE AD HOC NETWORKS (MANETS)
    7.
    发明申请
    LINK ACCESS DELAY AWARE ROUTING OVER MOBILE AD HOC NETWORKS (MANETS) 审中-公开
    链接访问延迟通过移动广告网络（MANETS）

    公开(公告)号：US20080159142A1

    公开(公告)日：2008-07-03

    申请号：US11617849

    申请日：2006-12-29

    申请人： Ramesh Nagarajan ,  Shyam P. Parekh ,  Kiran M. Rege

    发明人： Ramesh Nagarajan ,  Shyam P. Parekh ,  Kiran M. Rege

    IPC分类号： G08C15/00

    CPC分类号： H04W40/24 ,  H04L45/00 ,  H04L45/121 ,  H04L45/122 ,  H04L45/3065 ,  H04W40/02 ,  H04W40/30 ,  H04W48/08 ,  H04W84/18

    摘要： The present invention provides a method and apparatus for routing a data flow from a source node to a destination node in a mobile ad-hoc network (MANET). The present invention performs this function by first determining a quantitative value for each link at a corresponding origination node, where the value represents the current performance level of the links. Next, the present invention broadcasts an advertisement for each of the links in the MANET by the corresponding origination nodes, the advertisement including the value determined above. After broadcasting the advertisements, routing tables are composed at each of the nodes based upon the advertisements. Each routing table is constructed taking into account the advertised links and their corresponding values. After composing the routing tables, packets are forwarded toward their respective destinations in accordance with the next hops indicated by the routing table.

    摘要翻译： 本发明提供一种用于将数据流从源节点路由到移动自组织网络（MANET）中的目的地节点的方法和装置。 本发明通过首先确定对应始发节点处的每个链路的定量值来执行该功能，其中该值表示链路的当前性能级别。 接下来，本发明通过对应的发起节点广播MANET中的每个链路的广告，该广告包括上述确定的值。 在广播广告之后，基于广告在每个节点上组成路由表。 每个路由表的构建考虑到所通告的链接及其对应的值。 在组合路由表之后，根据路由表指示的下一跳，将数据包转发到其各自的目的地。

    Restoration time in networks
    9.
    发明授权
    Restoration time in networks 有权
    网络恢复时间

    公开(公告)号：US07643408B2

    公开(公告)日：2010-01-05

    申请号：US10815123

    申请日：2004-03-31

    申请人： Gary W. Atkinson ,  Michael L. Craner ,  Ramesh Nagarajan

    发明人： Gary W. Atkinson ,  Michael L. Craner ,  Ramesh Nagarajan

    IPC分类号： H04L1/22

    CPC分类号： H04L41/0668 ,  H04L41/0896 ,  H04L43/0811

    摘要： A restoration path planner minimizes cost while meeting restoration-time constraints of a network by reducing the worst-case number of cross-connections that must be performed in a network in the event of a single element failure. The planner involves optimization that identifies primary and restoration path plans for demands within the network such that the worst-case number of cross-connections at any node within the network is minimal and/or bounded. Embodiments further constrain the cost of the path plan. In one embodiment, restoration time is bounded and cost is relaxed until a solution is found. In another embodiment, the restoration time bound is relaxed to a limit while path plans and their costs are stored. These plans can later be chosen amongst for the desired balance of cost and restoration time. At least one approach to minimization of network cost involves maximizing sharing within restoration path plans.

    摘要翻译： 恢复路径规划器通过减少在单个元件发生故障时必须在网络中执行的最坏情况的交叉连接数来满足网络的恢复时间限制，从而最大限度地降低成本。 计划员涉及到优化，其识别网络内的需求的主要和恢复路径计划，使得网络内任何节点处的最坏情况数量的交叉连接最小和/或限制。 实施例进一步限制路径规划的成本。 在一个实施例中，恢复时间是有限的并且成本被放宽直到找到解决方案。 在另一个实施例中，将恢复时间限制放宽到极限，同时存储路径计划及其成本。 这些计划可以随后在所需的成本和恢复时间之间进行选择。 使网络成本最小化的至少一种方法涉及最大化恢复路径规划中的共享。