会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • LINK STATE PROTOCOL ROUTING MESSAGE CONTAINMENT
    • 链接协议路由消息容量
    • US20090172190A1
    • 2009-07-02
    • US11967931
    • 2007-12-31
    • Navindra YadavSuresh KatukamAbhay Roy
    • Navindra YadavSuresh KatukamAbhay Roy
    • G06F15/16
    • H04W40/30H04L45/025H04L45/04
    • In one example embodiment, a system and method are shown that includes calculating a first SPF tree for a first device, the first SPF tree including a root node and a first child node, the first device being the root node of the first SPF tree. Additionally, the system and method may include calculating a second SPF tree for a second device that is a neighbor of the first device, the second SPF tree including a root node and a first child node, the second device being the root node of the second SPF tree. Further, the system and method may include building a set of interested nodes including the second device, if the first child node if the first SPF tree and the first child node of the second SPF tree are distinct.
    • 在一个示例实施例中,示出了系统和方法,其包括为第一设备计算第一SPF树,第一SPF树包括根节点和第一子节点,第一设备是第一SPF树的根节点。 另外,该系统和方法可以包括为作为第一设备的邻居的第二设备计算第二SPF树,第二SPF树包括根节点和第一子节点,第二设备是第二设备的根节点 SPF树。 此外,所述系统和方法可以包括:如果第一子节点(如果第一SPF树和第二SPF树的第一子节点是不同的),则建立包括第二设备的一组感兴趣的节点。
    • 4. 发明授权
    • Link state protocol routing message containment
    • 链路状态协议路由消息遏制
    • US08423668B2
    • 2013-04-16
    • US11967931
    • 2007-12-31
    • Navindra YadavSuresh KatukamAbhay Roy
    • Navindra YadavSuresh KatukamAbhay Roy
    • G06F15/173
    • H04W40/30H04L45/025H04L45/04
    • In one example embodiment, a system and method are shown that includes calculating a first SPF tree for a first device, the first SPF tree including a root node and a first child node, the first device being the root node of the first SPF tree. Additionally, the system and method may include calculating a second SPF tree for a second device that is a neighbor of the first device, the second SPF tree including a root node and a first child node, the second device being the root node of the second SPF tree. Further, the system and method may include building a set of interested nodes including the second device, if the first child node if the first SPF tree and the first child node of the second SPF tree are distinct.
    • 在一个示例实施例中,示出了系统和方法,其包括为第一设备计算第一SPF树,第一SPF树包括根节点和第一子节点,第一设备是第一SPF树的根节点。 另外,该系统和方法可以包括为作为第一设备的邻居的第二设备计算第二SPF树,第二SPF树包括根节点和第一子节点,第二设备是第二设备的根节点 SPF树。 此外,所述系统和方法可以包括:如果第一子节点(如果第一SPF树和第二SPF树的第一子节点是不同的),则建立包括第二设备的一组感兴趣的节点。
    • 6. 发明授权
    • Host route convergence based on sequence values
    • 基于序列值的主机路由收敛
    • US08711729B2
    • 2014-04-29
    • US12013176
    • 2008-01-11
    • Suresh KatukamNavindra YadavVenkata TanikellaAbhay Roy
    • Suresh KatukamNavindra YadavVenkata TanikellaAbhay Roy
    • H04L12/28
    • H04L45/70H04W40/36
    • In an example embodiment, a method is provided that assigns a sequence value to a host. The host is identified by a host network layer address. After the assignment, the host network layer address and the sequence value are included in an advertisement for transmission. In another example embodiment, another method is provided. Here, a first sequence value associated with the host network layer address is received from a network device. In addition, a second sequence value associated with the same host network layer address is received from a different network device. The first sequence value is ranked relative to the second sequence value and data is transmitted to the network device based on the ranking.
    • 在示例实施例中,提供了向主机分配序列值的方法。 主机由主机网络层地址标识。 在分配之后,主机网络层地址和序列值被包括在用于传输的广告中。 在另一示例实施例中,提供了另一种方法。 这里,从网络设备接收与主机网络层地址相关联的第一序列值。 此外,从不同的网络设备接收与相同主机网络层地址相关联的第二序列值。 第一序列值相对于第二序列值排序,并且基于排名将数据发送到网络设备。
    • 9. 发明授权
    • Method and apparatus for computing a path through a bidirectional line switched
    • 用于计算通过双向线路切换的路径的方法和装置
    • US06975588B1
    • 2005-12-13
    • US09872176
    • 2001-06-01
    • Suresh KatukamVenkataraman Anand
    • Suresh KatukamVenkataraman Anand
    • G01R31/08H04L12/43H04Q3/66
    • H04L12/43H04Q3/66H04Q2213/13103H04Q2213/13106H04Q2213/13141H04Q2213/13144H04Q2213/13292H04Q2213/13392H04Q2213/13399
    • Methods and apparatus for automatically creating a path through a bi-directional line switched ring which uses common time slots are disclosed. According to one aspect of the present invention, an apparatus for creating a path between first and second nodes through a third node using first and second links includes a querying device, a comparator, and a routing device. The querying device identifies a first time slot of the first link for transferring data from the first node to the third node, and also identifies a second time slot associated with the second link for transferring data between the third node and the second node. The comparator determines when the first time slot and the second time slot are consistent, and the routing device computes the path between the first and second nodes using the first and second time slots when the first and second time slots are consistent.
    • 公开了通过使用公共时隙的双向线路交换环自动创建路径的方法和装置。 根据本发明的一个方面,一种使用第一和第二链路通过第三节点创建在第一和第二节点之间的路径的装置包括查询装置,比较器和路由装置。 查询设备识别第一链路的第一时隙,用于将数据从第一节点传送到第三节点,并且还识别与第二链路相关联的第二时隙,用于在第三节点和第二节点之间传送数据。 比较器确定第一时隙和第二时隙何时一致,并且当第一和第二时隙一致时,路由设备使用第一和第二时隙计算第一和第二节点之间的路径。