会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 22. 发明申请
    • NETWORK ROUTING USING INDIRECT NEXT HOP DATA
    • 使用间接下一个HOP数据的网络路由
    • US20100296517A1
    • 2010-11-25
    • US12847735
    • 2010-07-30
    • Kireeti Kompella
    • Kireeti Kompella
    • H04L12/56
    • H04L45/20H04L12/44H04L12/56H04L45/02H04L45/46H04L45/48H04L45/60
    • A router maintains routing information including (i) route data representing destinations within a computer network, (ii) next hop data representing interfaces to neighboring network devices, and (iii) indirect next hop data that maps a subset of the routes represented by the route data to a common one of the next hop data elements. In this manner, routing information is structured such that routes having the same next hop use indirect next hop data structures to reference common next hop data. In particular, in response to a change in network topology, the router need not change all of the affected routes, but only the common next hop data referenced by the intermediate data structures. This provides for increased efficiency in updating routing information after a change in network topology, such as link failure.
    • 路由器维护路由信息,包括(i)表示计算机网络内的目的地的路由数据,(ii)表示到相邻网络设备的接口的下一跳数据,以及(iii)映射路由表示的路由的子集的间接下一跳数据 数据到下一跳数据元素中的共同的一个。 以这种方式,路由信息的结构使得具有相同下一跳的路由使用间接的下一跳数据结构来引用公共的下一跳数据。 特别地,为了响应网络拓扑的变化,路由器不需要改变所有受影响的路由,而只能改变由中间数据结构引用的公共下一跳数据。 这提高了在网络拓扑变化(如链路故障)后更新路由信息的效率。
    • 24. 发明授权
    • Seamless split-horizon flooding of layer two (L2) network traffic on non-native and mixed architectures
    • 在非本地和混合架构上的第二层(L2)网络流量的无缝分裂溢流
    • US07649904B1
    • 2010-01-19
    • US12034299
    • 2008-02-20
    • Kaushik GhoshKireeti KompellaJunan ChenRaj Tuplur
    • Kaushik GhoshKireeti KompellaJunan ChenRaj Tuplur
    • H04L12/54
    • H04L45/50H04L45/02H04L45/025
    • A forwarding component of a routing node floods copies of a packet to a plurality of next hops associated with the same layer two (L2) network as an interface on which the packet was received. The plurality of next hops excludes a next hop that corresponds to the interface that received the packet. The forwarding component requires that forwarding information installed by a control unit specify the plurality of next hops to which to flood the copies of the packet, and the forwarding component is not capable of deriving the plurality of next hops to which to flood the copies of the packet from a single flooding next hop identifier after the packet is received. Prior to receiving the packet, a flooding next hop control module derives the plurality of next hops based on the flooding next hop and installs the derived next hops into the forwarding information.
    • 路由节点的转发组件将分组的副本泛洪到与其接收分组的接口相关联的多个与相同的第二层(L2)网络相关联的下一跳。 多个下一跳排除了对应于接收到分组的接口的下一跳。 转发组件要求由控制单元安装的转发信息指定多个下一跳,洪泛化分组的副本,并且转发组件不能导出多个下一跳,洪泛的副本 在接收到分组之后,来自单个洪泛下一跳标识符的分组。 在接收到分组之前,洪泛的下一跳控制模块基于洪泛下一跳导出多个下一跳,并将导出的下一跳安装到转发信息中。
    • 28. 发明授权
    • Communicating constraint information for determining a path subject to such constraints
    • 通信约束信息用于确定受这种限制的路径
    • US07319700B1
    • 2008-01-15
    • US09752501
    • 2000-12-29
    • Kireeti Kompella
    • Kireeti Kompella
    • H04L12/28H04L12/56G01R31/08G06F11/00
    • H04L45/50H04L45/02H04L45/20H04L45/62
    • Path determination constraints may be encoded in the form of a program having one or more instructions. Each of instructions may include an operation code, and operands (or pointers to locations where operands are stored). In this way, an extensible, interoperable way for a nodes (e.g., label-switching routers) to communicate constraints within a network is provided. Such constraints may be inserted (e.g., as one or more CONSTRAINT objects) into signaling messages (e.g., a PATH RSVP message). By enabling the signaling of constraints, the determination of constraint-based (label-switched) paths can be distributed among a number of (label-switching) routers or other nodes. Upon receiving a message with constraints (e.g., a CONSTRAINT object(s)), a node may (i) ignore the constraints if the node is a tail-end node (label-switching router), (ii) apply the constraints to a link if the next hop in the (label-switched) path is strict, and/or (iii) perform a constraint-based path determination to a next hop if the next hop is loose.
    • 路径确定约束可以以具有一个或多个指令的程序的形式进行编码。 每个指令可以包括操作码和操作数(或指向存储操作数的位置的指针)。 以这种方式,提供了用于节点(例如,标签交换路由器)在网络内传送约束的可扩展的可互操作的方式。 可以将这样的约束(例如,作为一个或多个CONSTRAINT对象)插入信令消息(例如,PATH RSVP消息)中。 通过启用约束的信令,可以在多个(标签交换)路由器或其他节点之间分配基于约束的(标签交换)路径的确定。 在接收到具有约束的消息(例如,CONSTRAINT对象)时,如果节点是尾端节点(标签交换路由器),则节点可以(i)忽略约束,(ii)将约束应用于 如果(标签交换)路径中的下一跳是严格的,和/或(iii)如果下一跳是松散的,则对下一跳执行基于约束的路径确定。