Method and apparatus for network routing between a tactical network and a satellite network
    1.
    发明授权
    Method and apparatus for network routing between a tactical network and a satellite network 有权
    在战术网络和卫星网络之间进行网络路由的方法和装置

    公开(公告)号:US07760745B2

    公开(公告)日:2010-07-20

    申请号:US11856305

    申请日:2007-09-17

    CPC classification number: H04W40/20 H04L45/04 H04W40/04 H04W40/22 H04W40/30

    Abstract: A method, apparatus, and computer usable program code for managing networks. In one advantageous embodiment, a computer implemented method processes routing information. The process collects updates to the routing information in a first network. Responsive to an event, a cost of reaching each address in the first network from each of a plurality of gateways in the first network that has access to a second network is identified to form identified costs. The process also selects a set of addresses for a set of gateways providing access to the second network, wherein each gateway in the set of gateways is identified using a policy with respect to a cost of reaching a particular address in the first network to form an update list. The update list is sent to the second network.

    Abstract translation: 一种用于管理网络的方法,装置和计算机可用程序代码。 在一个有利的实施例中,计算机实现的方法处理路由信息。 该过程在第一网络中收集路由信息的更新。 对事件的响应被识别为识别成本,从第一网络中具有访问第二网络的第一网络中的多个网关中的每一个到达第一网络中的每个地址的成本被识别。 该过程还为提供对第二网络的访问的一组网关选择一组地址,其中使用关于到达第一网络中的特定地址的成本的策略来识别该组网关中的每个网关,以形成 更新列表。 更新列表被发送到第二个网络。

    METHOD AND APPARATUS FOR NETWORK ROUTING BETWEEN A TACTICAL NETWORK AND A SATELLITE NETWORK
    2.
    发明申请
    METHOD AND APPARATUS FOR NETWORK ROUTING BETWEEN A TACTICAL NETWORK AND A SATELLITE NETWORK 有权
    一种战术网络与卫星网络之间的网络路由的方法和装置

    公开(公告)号:US20090073993A1

    公开(公告)日:2009-03-19

    申请号:US11856305

    申请日:2007-09-17

    CPC classification number: H04W40/20 H04L45/04 H04W40/04 H04W40/22 H04W40/30

    Abstract: A method, apparatus, and computer usable program code for managing networks. In one advantageous embodiment, a computer implemented method processes routing information. The process collects updates to the routing information in a first network. Responsive to an event, a cost of reaching each address in the first network from each of a plurality of gateways in the first network that has access to a second network is identified to form identified costs. The process also selects a set of addresses for a set of gateways providing access to the second network, wherein each gateway in the set of gateways is identified using a policy with respect to a cost of reaching a particular address in the first network to form an update list. The update list is sent to the second network.

    Abstract translation: 一种用于管理网络的方法,装置和计算机可用程序代码。 在一个有利的实施例中,计算机实现的方法处理路由信息。 该过程在第一网络中收集路由信息的更新。 对事件的响应被识别为识别成本,从第一网络中具有访问第二网络的第一网络中的多个网关中的每一个到达第一网络中的每个地址的成本被识别。 该过程还为提供对第二网络的访问的一组网关选择一组地址,其中使用关于到达第一网络中的特定地址的成本的策略来识别该组网关中的每个网关,以形成 更新列表。 更新列表被发送到第二个网络。

    Queuing Architectures for Orthogonal Requirements in Quality of Service (QoS)
    3.
    发明申请
    Queuing Architectures for Orthogonal Requirements in Quality of Service (QoS) 有权
    服务质量(QoS)正交要求的排队架构

    公开(公告)号:US20120287941A1

    公开(公告)日:2012-11-15

    申请号:US13546233

    申请日:2012-07-11

    CPC classification number: H04W72/1242 H04W84/18

    Abstract: A node in a mobile ad-hoc network or other network classifies packets (a) in accordance with a first set of priority levels based on urgency and (b) within each priority level of the first set, in accordance with a second set of priority levels based on importance. The node: (a) queues packets classified at highest priority levels of the first and/or second sets in high-priority output queues; (b) queues packets classified at medium priority levels of the first set in medium-priority output queue(s); and (3) queues packets classified at low priority levels of the first and/or second set in low-priority output queue(s). Using an output priority scheduler, the node serves the packets in order of the priorities of the output queues. In such manner, orthogonal aspects of DiffServ and MLPP can be resolved in a MANET or other network.

    Abstract translation: 移动自组织网络或其他网络中的节点根据第一组优先级,根据第一组优先级,根据紧急程度和(b)在第一组的每个优先级中对第一组优先级进行分类(a) 基于重要性的水平。 节点:(a)将分类在高优先级输出队列中的第一和/或第二组的最高优先级的分组排队; (b)将在中等优先级输出队列中的第一组的中等优先级分级的分组排队; 和(3)将分类为低优先级输出队列中的第一和/或第二组的低优先级的分组排队。 使用输出优先级调度器,节点按照输出队列的优先级顺序提供数据包。 以这种方式,可以在MANET或其他网络中解决DiffServ和MLPP的正交方面。

    QUEUING ARCHITECTURES FOR ORTHOGONAL REQUIREMENTS IN QUALITY OF SERVICE (QoS)
    4.
    发明申请
    QUEUING ARCHITECTURES FOR ORTHOGONAL REQUIREMENTS IN QUALITY OF SERVICE (QoS) 有权
    质量服务质量要求的质量体系结构(QoS)

    公开(公告)号:US20110007687A1

    公开(公告)日:2011-01-13

    申请号:US12500049

    申请日:2009-07-09

    CPC classification number: H04W72/1242 H04W84/18

    Abstract: A node in a mobile ad-hoc network or other network classifies packets (a) in accordance with a first set of priority levels based on urgency and (b) within each priority level of the first set, in accordance with a second set of priority levels based on importance. The node: (a) queues packets classified at highest priority levels of the first and/or second sets in high-priority output queues; (b) queues packets classified at medium priority levels of the first set in medium-priority output queue(s); and (3) queues packets classified at low priority levels of the first and/or second set in low-priority output queue(s). Using an output priority scheduler, the node serves the packets in order of the priorities of the output queues. In such manner, orthogonal aspects of DiffServ and MLPP can be resolved in a MANET or other network.

    Abstract translation: 移动自组织网络或其他网络中的节点根据第一组优先级,根据第一组优先级,根据紧急程度和(b)在第一组的每个优先级中对第一组优先级进行分类(a) 基于重要性的水平。 节点:(a)将分类在高优先级输出队列中的第一和/或第二组的最高优先级的分组排队; (b)将在中等优先级输出队列中的第一组的中等优先级分级的分组排队; 和(3)将分类为低优先级输出队列中的第一和/或第二组的低优先级的分组排队。 使用输出优先级调度器,节点按照输出队列的优先级顺序提供数据包。 以这种方式,可以在MANET或其他网络中解决DiffServ和MLPP的正交方面。

    Queuing architectures for orthogonal requirements in quality of service (QoS)
    5.
    发明授权
    Queuing architectures for orthogonal requirements in quality of service (QoS) 有权
    服务质量(QoS)正交要求的排队架构

    公开(公告)号:US08238346B2

    公开(公告)日:2012-08-07

    申请号:US12500049

    申请日:2009-07-09

    CPC classification number: H04W72/1242 H04W84/18

    Abstract: A node in a mobile ad-hoc network or other network classifies packets (a) in accordance with a first set of priority levels based on urgency and (b) within each priority level of the first set, in accordance with a second set of priority levels based on importance. The node: (a) queues packets classified at highest priority levels of the first and/or second sets in high-priority output queues; (b) queues packets classified at medium priority levels of the first set in medium-priority output queue(s); and (3) queues packets classified at low priority levels of the first and/or second set in low-priority output queue(s). Using an output priority scheduler, the node serves the packets in order of the priorities of the output queues. In such manner, orthogonal aspects of DiffServ and MLPP can be resolved in a MANET or other network.

    Abstract translation: 移动自组织网络或其他网络中的节点根据第一组优先级,根据第一组优先级,根据紧急性和(b)在第一组的每个优先级中对第一组优先级进行分类(a) 基于重要性的水平。 节点:(a)将分类在高优先级输出队列中的第一和/或第二组的最高优先级的分组排队; (b)将在中等优先级输出队列中的第一组的中等优先级分级的分组排队; 和(3)将分类为低优先级输出队列中的第一和/或第二组的低优先级的分组排队。 使用输出优先级调度器,节点按照输出队列的优先级顺序提供数据包。 以这种方式,可以在MANET或其他网络中解决DiffServ和MLPP的正交方面。

    Method and apparatus for distributing dynamic auto-summarization of internet protocol reachable addresses
    6.
    发明授权
    Method and apparatus for distributing dynamic auto-summarization of internet protocol reachable addresses 有权
    用于分发互联网协议可达地址的动态自动总结的方法和装置

    公开(公告)号:US07782882B2

    公开(公告)日:2010-08-24

    申请号:US11856334

    申请日:2007-09-17

    Abstract: A computer implemented method, apparatus, and computer usable program code for managing addresses in a network. In one advantageous embodiment, a computer implemented method is used to managing addresses for a plurality of destinations in a network. Addresses assigned to a plurality of gateways are summarized to form summarized addresses containing prefixes and addresses for the plurality of gateways in which each gateway in the plurality of gateways is associated with a portion of the prefixes and addresses for destinations handled by the each gateway in the plurality of gateways. A gateway in the plurality of gateways having a largest portion of the summarized addresses is assigned a prefix for all addresses assigned to the network to form a selected gateway. An associated portion of the summarized addresses for the selected gateway is replaced with the prefix.

    Abstract translation: 计算机实现的方法,装置和用于管理网络中的地址的计算机可用程序代码。 在一个有利的实施例中,使用计算机实现的方法来管理网络中的多个目的地的地址。 总结分配给多个网关的地址以形成包含多个网关的前缀和地址的汇总地址,其中多个网关中的每个网关与其中的每个网关处理的前缀和地址的一部分相关联, 多个网关。 在具有总结地址的最大部分的多个网关中的网关被分配给分配给网络的所有地址的前缀以形成所选择的网关。 所选网关的汇总地址的相关部分将被前缀替换。

    METHOD AND APPARATUS FOR DISTRIBUTING DYNAMIC AUTO-SUMMARIZATION OF INTERNET PROTOCOL REACHABLE ADDRESSES
    7.
    发明申请
    METHOD AND APPARATUS FOR DISTRIBUTING DYNAMIC AUTO-SUMMARIZATION OF INTERNET PROTOCOL REACHABLE ADDRESSES 有权
    分配互联网协议可追溯地址的动态自动概述的方法和装置

    公开(公告)号:US20090073994A1

    公开(公告)日:2009-03-19

    申请号:US11856334

    申请日:2007-09-17

    Abstract: A computer implemented method, apparatus, and computer usable program code for managing addresses in a network. In one advantageous embodiment, a computer implemented method is used to managing addresses for a plurality of destinations in a network. Addresses assigned to a plurality of gateways are summarized to form summarized addresses containing prefixes and addresses for the plurality of gateways in which each gateway in the plurality of gateways is associated with a portion of the prefixes and addresses for destinations handled by the each gateway in the plurality of gateways. A gateway in the plurality of gateways having a largest portion of the summarized addresses is assigned a prefix for all addresses assigned to the network to form a selected gateway. An associated portion of the summarized addresses for the selected gateway is replaced with the prefix.

    Abstract translation: 计算机实现的方法,装置和用于管理网络中的地址的计算机可用程序代码。 在一个有利的实施例中,使用计算机实现的方法来管理网络中的多个目的地的地址。 总结分配给多个网关的地址以形成包含多个网关的前缀和地址的汇总地址,其中多个网关中的每个网关与其中的每个网关处理的前缀和地址的一部分相关联, 多个网关。 在具有总结地址的最大部分的多个网关中的网关被分配给分配给网络的所有地址的前缀以形成所选择的网关。 所选网关的汇总地址的相关部分将被前缀替换。

Patent Agency Ranking