利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

98 条记录 (耗时 0.026 秒)

    Logically grouping physical ports into logical interfaces to expand bandwidth
    1.
    发明授权
    Logically grouping physical ports into logical interfaces to expand bandwidth 失效
    将物理端口逻辑分组为逻辑接口以扩展带宽

    公开(公告)号：US07280527B2

    公开(公告)日：2007-10-09

    申请号：US10144075

    申请日：2002-05-13

    申请人： Claude Basso ,  Francis Arts ,  Bay Van Nguyen ,  Natarajan Vaidhyanathan ,  Colin Beaton Verrilli

    发明人： Claude Basso ,  Francis Arts ,  Bay Van Nguyen ,  Natarajan Vaidhyanathan ,  Colin Beaton Verrilli

    IPC分类号： H04L12/28

    CPC分类号： H04L45/54 ,  H04L45/00 ,  H04L45/24

    摘要： A method, system and computer program product for routing packets. A network device, e.g., router, may comprise a switch fabric coupled to a plurality of blades where each blade may comprise one or more network processors coupled to one or more physical ports. The physical ports may be connected to another one or more network devices. A plurality of physical ports across one or more blades connected to the same network device may be logically mapped into a logical interface to that network device. By logically grouping a plurality of physical ports into a logical interface to a network device, a network processor may be able to transmit packets of data to that network device across multiple ports instead of one physical port.

    摘要翻译： 用于路由数据包的方法，系统和计算机程序产品。 网络设备（例如，路由器）可以包括耦合到多个叶片的交换结构，其中每个叶片可以包括耦合到一个或多个物理端口的一个或多个网络处理器。 物理端口可以连接到另一个或多个网络设备。 连接到同一网络设备的一个或多个刀片上的多个物理端口可以逻辑地映​​射到该网络设备的逻辑接口中。 通过将多个物理端口逻辑地分组成到网络设备的逻辑接口，网络处理器可能能够跨多个端口而不是一个物理端口向该网络设备传送数据分组。

    Method and System for Reducing Look-Up Time in Packet Forwarding on Computer Networks
    2.
    发明申请
    Method and System for Reducing Look-Up Time in Packet Forwarding on Computer Networks 有权
    减少计算机网络中数据包转发查找时间的方法和系统

    公开(公告)号：US20090103536A1

    公开(公告)日：2009-04-23

    申请号：US11780444

    申请日：2007-07-19

    申请人： Claude Basso ,  Bay Van Nguyen ,  Max Robert Povse ,  Natarajan Vaidhyanathan ,  Colin Beaton Verrilli

    发明人： Claude Basso ,  Bay Van Nguyen ,  Max Robert Povse ,  Natarajan Vaidhyanathan ,  Colin Beaton Verrilli

    IPC分类号： H04L12/56

    CPC分类号： H04L29/00 ,  H04L45/742

    摘要： A method and system for reducing the lookup time in packet forwarding on computer networks. A first lookup is performed in a memory tree to find a first protocol forwarding entry in the memory tree. The forwarding entry includes first protocol (e.g., EGP) information and cached associated second protocol (e.g., IGP) information. Both EGP and IGP information are retrievable with the first lookup and used in the determination of an EGP route for the data packet. If the cached IGP information has been invalidated due to address updates, a second lookup can be performed to find an original IGP entry in the memory tree, the information from which can be cached in the EGP forwarding entry if a background maintenance task has finished designating all the EGP entries as having out-of-date caches.

    摘要翻译： 一种用于减少计算机网络上的分组转发中的查找时间的方法和系统。 在存储器树中执行第一次查找以在存储器树中找到第一协议转发条目。 转发条目包括第一协议（例如，EGP）信息和缓存的相关联的第二协议（例如，IGP）信息。 EGP和IGP信息都可以通过第一次查找进行检索，并用于确定数据包的EGP路由。 如果缓存的IGP信息由于地址更新而被无效，则可以执行第二次查找以在存储器树中找到原始IGP条目，如果后台维护任务已经完成指定，则可以将其从EGP转发条目缓存到其中 所有EGP条目都具有过期缓存。

    Method and system for reducing look-up time in packet forwarding on computer networks
    3.
    发明授权
    Method and system for reducing look-up time in packet forwarding on computer networks 有权
    减少计算机网络上数据包转发查找时间的方法和系统

    公开(公告)号：US07788406B2

    公开(公告)日：2010-08-31

    申请号：US11780444

    申请日：2007-07-19

    申请人： Claude Basso ,  Bay Van Nguyen ,  Max Robert Povse ,  Natarajan Vaidhyanathan ,  Colin Beaton Verrilli

    发明人： Claude Basso ,  Bay Van Nguyen ,  Max Robert Povse ,  Natarajan Vaidhyanathan ,  Colin Beaton Verrilli

    IPC分类号： H04L12/28

    CPC分类号： H04L29/00 ,  H04L45/742

    摘要： Lookup time in packet forwarding on computer networks is reduced. A first lookup is performed in a memory tree to find a first protocol forwarding entry in the memory tree. The forwarding entry includes first protocol (e.g., EGP) information and cached associated second protocol (e.g., IGP) information. Both EGP and IGP information are retrievable with the first lookup and used in the determination of an EGP route for the data packet. If the cached IGP information has been invalidated due to address updates, a second lookup can be performed to find an original IGP entry in the memory tree, the information from which can be cached in the EGP forwarding entry if a background maintenance task has finished designating all the EGP entries as having out-of-date caches.

    摘要翻译： 在计算机网络上的分组转发中的查找时间减少了。 在存储器树中执行第一次查找以在存储器树中找到第一协议转发条目。 转发条目包括第一协议（例如，EGP）信息和缓存的相关联的第二协议（例如，IGP）信息。 EGP和IGP信息都可以通过第一次查找进行检索，并用于确定数据包的EGP路由。 如果缓存的IGP信息由于地址更新而被无效，则可以执行第二次查找以在存储器树中找到原始IGP条目，如果后台维护任务已经完成指定，则可以将其从EGP转发条目缓存到其中 所有EGP条目都具有过期缓存。

    Method and system for reducing look-up time in packet forwarding on computer networks
    4.
    发明授权
    Method and system for reducing look-up time in packet forwarding on computer networks 失效
    减少计算机网络上数据包转发查找时间的方法和系统

    公开(公告)号：US07310685B2

    公开(公告)日：2007-12-18

    申请号：US10230921

    申请日：2002-08-29

    申请人： Claude Basso ,  Bay Van Nguyen ,  Max Robert Povse ,  Natarajan Vaidhyanathan ,  Colin Beaton Verrilli

    发明人： Claude Basso ,  Bay Van Nguyen ,  Max Robert Povse ,  Natarajan Vaidhyanathan ,  Colin Beaton Verrilli

    IPC分类号： H04L12/28

    CPC分类号： H04L29/00 ,  H04L45/742

    摘要： A method and system for reducing the lookup time in packet forwarding on computer networks. A first lookup is performed in a memory tree to find a first protocol forwarding entry in the memory tree. The forwarding entry includes first protocol (e.g., EGP) information and cached associated second protocol (e.g., IGP) information. Both EGP and IGP information are retrievable with the first lookup and used in the determination of an EGP route for the data packet. If the cached IGP information has been invalidated due to address updates, a second lookup can be performed to find an original IGP entry in the memory tree, the information from which can be cached in the EGP forwarding entry if a background maintenance task has finished designating all the EGP entries as having out-of-date caches.

    摘要翻译： 一种用于减少计算机网络上的分组转发中的查找时间的方法和系统。 在存储器树中执行第一次查找以在存储器树中找到第一协议转发条目。 转发条目包括第一协议（例如，EGP）信息和缓存的相关联的第二协议（例如，IGP）信息。 EGP和IGP信息都可以通过第一次查找进行检索，并用于确定数据包的EGP路由。 如果缓存的IGP信息由于地址更新而被无效，则可以执行第二次查找以在存储器树中找到原始IGP条目，如果后台维护任务已经完成指定，则可以将其从EGP转发条目缓存到其中 所有EGP条目都具有过期缓存。

    Robust NP-based data forwarding techniques that tolerate failure of control-based applications
    10.
    发明授权
    Robust NP-based data forwarding techniques that tolerate failure of control-based applications 失效

    公开(公告)号：US07003582B2

    公开(公告)日：2006-02-21

    申请号：US09885782

    申请日：2001-06-20

    申请人： Claude Basso ,  Natarajan Vaidhyanathan ,  Colin Beaton Verrilli ,  Rama Mohan Yedavalli

    发明人： Claude Basso ,  Natarajan Vaidhyanathan ,  Colin Beaton Verrilli ,  Rama Mohan Yedavalli

    IPC分类号： G06F15/173

    CPC分类号： H04L45/02

    摘要： In a network environment including one or more network processing (NP) devices implementing for communicating packets, each NP device supporting a forwarding table comprising entries to enable forwarding of received data packets from a source device to a destination device according to a routing protocol via a network connection, the network device routing receiving updated forwarding table entries from one or more network control devices executing routing protocol applications, a system and method for updating forwarding table entries comprises: generating for each forwarding table entry update, a data structure indicating identification of the routing protocol application and a version of a particular routing protocol application instance generating the entry update, the data structure received by the forwarding table and incorporated within a respective forwarding table entry; identifying for deletion forwarding table entries having data structures matching a designated selection criteria; and, deleting the designated forwarding table entries. By doing this old forwarding table entries in the forwarding table are updated efficiently without disrupting packet forwarding process.