Optimization for trill LAN hellos
    51.
    发明授权
    Optimization for trill LAN hellos 有权
    trill LAN hellos的优化

    公开(公告)号:US09025432B2

    公开(公告)日:2015-05-05

    申请号:US13465218

    申请日:2012-05-07

    摘要: Systems and methods may be provided embodying an optimized Trill LAN network hello mode. The optimized hello mode may allow the number of LAN hellos exchanged to be reduced significantly in a steady state mode of operation. No modifications to the current Trill specification are needed and in a converged state (when designated RBridge election and appointed forwarder appointments are complete), only 1 hello PDU per RBridge is originated in every hello interval.

    摘要翻译: 可以提供系统和方法,体现优化的Trill LAN网络问候模式。 优化的hello模式可以允许在稳定状态操作模式下交换的LAN hello的数量显着减少。 不需要修改当前的Trill规范,并且在融合状态(当指定RBridge选举和指定的转发器约会完成时),每个Hello报文间隔只会发送一个每个RBridge的1个hello PDU。

    TRANSITIVE PROBING FOR FAILURE DETECTION OF NETWORK INTERFACES
    52.
    发明申请
    TRANSITIVE PROBING FOR FAILURE DETECTION OF NETWORK INTERFACES 有权
    网络接口故障检测的瞬态探测

    公开(公告)号:US20120120811A1

    公开(公告)日:2012-05-17

    申请号:US12944271

    申请日:2010-11-11

    IPC分类号: H04L12/26

    CPC分类号: H04L43/10

    摘要: The method involves issuing, by an active interface, an Internet Protocol probe packet (IPPP) to a probe target, issuing, by a first alternate interface, a first transitive probe packet (TPP) to the active interface, where the first alternate interface and the active interface belong to a broadcast domain. The method further involves awaiting, by the active interface, a responsive IPPP from the probe target, awaiting, by the first alternate interface, a first responsive TPP from the active interface, and determining network conditions based upon receiving at least one of the responsive IPPP and the first responsive TPP.

    摘要翻译: 该方法包括通过主动接口向探测目标发布因特网协议探测分组(IPPP),由第一替代接口向主动接口发布第一传输探测分组(TPP),其中第一替代接口和 活动接口属于广播域。 该方法还包括通过主动接口等待来自探测目标的响应IPPP,等待由第一替代接口从主动接口发出的第一响应TPP,以及基于接收响应IPPP中的至少一个来确定网络状况 和第一反应性TPP。

    METHOD AND SYSTEM FOR ROUTING USING MULTI-STAGE ROUTE ENTRY LOOKUP
    53.
    发明申请
    METHOD AND SYSTEM FOR ROUTING USING MULTI-STAGE ROUTE ENTRY LOOKUP 有权
    使用多阶段路由进入路由的方法和系统

    公开(公告)号:US20100080225A1

    公开(公告)日:2010-04-01

    申请号:US12242373

    申请日:2008-09-30

    申请人: Erik Nordmark

    发明人: Erik Nordmark

    IPC分类号: H04L12/56

    CPC分类号: H04L45/00 H04L45/54

    摘要: The invention relates to a method for routing packets. The method includes receiving a first packet to route, obtaining a first route entry using a first IP address associated with the first packet, where the first route entry includes a first prefix, a first route nexthop generation (RNG) and a first route nexthop pointer (RNP) to a second route entry. The method further includes comparing a route generation (RG) for the second route entry with the first RNG where the RG for the second route entry and the first RNG are equal, obtaining a first neighbor cache entry (NCE) from a first NCE pointer (NP) stored in the first route entry, and routing the first packet using the ARP information in the first NCE, where a route dependency list pointer (RDLP) in the second route entry points to the first route entry.

    摘要翻译: 本发明涉及一种用于路由分组的方法。 该方法包括接收第一分组以路由,使用与第一分组相关联的第一IP地址获得第一路由条目,其中第一路由条目包括第一前缀,第一路由下一代生成(RNG)和第一路由下一跳指针 (RNP)到第二路由条目。 该方法还包括将第二路由条目的路由生成(RG)与第二路由条目的RG和第一RNG相等的第一RNG进行比较,从第一NCE指针获得第一相邻高速缓存条目(NCE) NP)存储在第一路由条目中,并且使用第一NCE中的ARP信息来路由第一分组,其中第二路由入口中的路由依赖列表指针(RDLP)指向第一路由条目。

    PREDICTIVE ROUTING TECHNIQUE IN THE AD HOC WIRELESS NETWORK
    54.
    发明申请
    PREDICTIVE ROUTING TECHNIQUE IN THE AD HOC WIRELESS NETWORK 有权
    公共无线网络中的预测路由技术

    公开(公告)号:US20090046712A1

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

    申请号:US12058509

    申请日:2008-03-28

    IPC分类号: H04L12/56

    摘要: In a particular embodiment of the present invention, a forwarding node in an ad hoc network collects sets of node information pertaining to its neighbor nodes. An example of a type of node information is history information that indicates previous time periods during which a neighbor node has been available for communication. Other types of node information may include proximity information that indicates how far a neighbor node is from the forwarding node. In selecting a routing path, the forwarding node takes into account information collected in the sets of node information. A routing path can be selected to include a neighbor node having the highest probability to be available for communication. Additionally or alternatively, a routing path may be selected to minimize the power transmission level required for the forwarding node to forward data packets.

    摘要翻译: 在本发明的特定实施例中,自组织网络中的转发节点收集与其相邻节点有关的节点信息集合。 一种节点信息的示例是指示相邻节点已经可用于通信的先前时间段的历史信息。 其他类型的节点信息可以包括指示邻居节点与转发节点有多远的邻近信息。 在选择路由路径时,转发节点考虑在节点信息集中收集的信息。 可以选择路由路径以包括具有可用于通信的最高概率的邻居节点。 附加地或替代地,可以选择路由路径以最小化转发节点转发数据分组所需的功率传输级别。