会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • METHOD AND SYSTEM FOR PRIORITY BASED (1:1)n ETHERNET PROTECTION
    • 基于优先级(1:1)的以太网保护方法与系统
    • US20120281525A1
    • 2012-11-08
    • US13101615
    • 2011-05-05
    • Venkata Ramana Kiran AddankiArun SahaMandar Joshi
    • Venkata Ramana Kiran AddankiArun SahaMandar Joshi
    • G06F11/00
    • H04L49/557H04L49/351
    • A method and system for priority based (1:1)n Ethernet protection. The method and system includes assigning a priority to each of the flows associated with a working path. Upon fail of one or more of the working paths checking available bandwidth and priority of the flows. Once the request is complete, switching one or more flows to the protection path based on at least the priority of the flow, the bandwidth of the working path and the available bandwidth on the protection path. If a newly failed working path has a higher priority flow then dropping a flow from the protection path to a pending state. Once a working path has recovered, reverting the flow back to the working path and possibly admitting pending data to the protection path if the bandwidth and prioritization requirements are met.
    • 一种基于优先级(1:1)n以太网保护的方法和系统。 该方法和系统包括为与工作路径相关联的每个流分配优先级。 在一个或多个工作路径失败时,检查可用带宽和流的优先级。 一旦请求完成,至少基于流的优先级,工作路径的带宽和保护路径上的可用带宽,将一个或多个流切换到保护路径。 如果新故障工作路径具有较高优先级流,则将流从保护路径丢弃到挂起状态。 一旦工作路径恢复,如果满足带宽和优先级要求,则将流程还原回工作路径,并可能将待处理数据接收到保护路径。
    • 2. 发明授权
    • Method and system for priority based (1:1)n ethernet protection
    • 基于优先级(1:1)n以太网保护的方法和系统
    • US08830825B2
    • 2014-09-09
    • US13101615
    • 2011-05-05
    • Venkata Ramana Kiran AddankiArun SahaMandar Joshi
    • Venkata Ramana Kiran AddankiArun SahaMandar Joshi
    • G06F11/00H04L12/56
    • H04L49/557H04L49/351
    • A method for priority-based protection includes assigning a priority to each of a plurality of flows associated with a plurality of working paths, wherein each of the plurality of the flows has a unique priority. The method also includes determining that one or more of the working paths has failed, and determining the available bandwidth on a protection path upon the failure of the one or more of the working paths. In addition, the method includes determining the priority of the flows on the one or more failed working paths, and switching two or more flows from the one or more failed working paths to the protection path based on at least the priority of the two or more flows, the bandwidth of the working path and the available bandwidth on the protected path.
    • 一种用于基于优先级的保护的方法包括:将优先级分配给与多个工作路径相关联的多个流中的每个流,其中所述多个流中的每一个具有唯一的优先级。 该方法还包括确定一个或多个工作路径失败,以及在一个或多个工作路径发生故障时确定保护路径上的可用带宽。 此外,该方法包括确定一个或多个故障工作路径上的流的优先级,以及至少基于两个或多个故障工作路径的优先级将两个或多个流从一个或多个故障工作路径切换到保护路径 流量,工作路径的带宽和受保护路径上的可用带宽。
    • 3. 发明授权
    • Hierarchical isolated learning and flooding for metro ethernet bridging domains
    • 城域以太网桥接域的分层学习和洪泛
    • US08630288B2
    • 2014-01-14
    • US12781531
    • 2010-05-17
    • Bijendra SinghArun SahaMandar JoshiAbinder S. Dhillon
    • Bijendra SinghArun SahaMandar JoshiAbinder S. Dhillon
    • H04L12/28
    • H04L12/4625
    • A switch includes a processor coupled to a memory, one or more forwarding tables residing within the memory, and one or more ports. The ports are associated with a plurality of virtual local area networks and a plurality of bridge domains. Each of the bridge domains is associated with one of the forwarding tables, and each of the forwarding tables is associated with one of the bridge domains. The processor is configured to assign a first tag to a received packet, assign a second tag to the received packet, look up the destination address of the received packet in one of the forwarding tables, and selectively flood the ports of the active bridge domain with a copy of the received packet. The active bridge domain includes one of the plurality of bridge domains. The active bridge domain is associated with the ingress port of the received packet.
    • 交换机包括耦合到存储器的处理器,驻留在存储器内的一个或多个转发表以及一个或多个端口。 端口与多个虚拟局域网和多个桥域相关联。 每个桥接域与转发表中的一个相关联,并且每个转发表与一个桥接域相关联。 处理器被配置为向接收到的分组分配第一标签,向接收到的分组分配第二标签,在转发表之一中查找接收到的分组的目的地址,并选择性地将活动网桥域的端口泛洪, 接收到的数据包的副本。 有源桥接域包括多个桥接域中的一个。 活动网桥域与接收到的数据包的入口端口相关联。
    • 4. 发明申请
    • Hierarchical Isolated Learning and Flooding for Metro Ethernet Bridging Domains
    • 用于城域以太网桥接的分层学习和洪泛
    • US20110280248A1
    • 2011-11-17
    • US12781531
    • 2010-05-17
    • Bijendra SinghArun SahaMandar JoshiAbinder S. Dhillon
    • Bijendra SinghArun SahaMandar JoshiAbinder S. Dhillon
    • H04L12/56
    • H04L12/4625
    • In one embodiment, a switch includes a processor coupled to a memory, one or more forwarding tables residing within the memory, and one or more ports. The one or more ports are associated with a plurality of virtual local area networks. The one or more ports are associated with a plurality of bridge domains. Each of the bridge domains is associated with one of the forwarding tables, and each of the forwarding tables is associated with one of the bridge domains. The processor is configured to assign a first tag to a received packet, the first tag comprising an identification of an active bridge domain, assign a second tag to the received packet, look up the destination address of the received packet in one of the forwarding tables, and if the destination address is not found in the forwarding table, and selectively flood the one or more ports of the active bridge domain with a copy of the received packet. The active bridge domain includes one of the plurality of bridge domains. The active bridge domain is associated with the ingress port of the received packet. The second tag includes an identification of one of the plurality of virtual local area networks.
    • 在一个实施例中,交换机包括耦合到存储器的处理器,驻留在存储器内的一个或多个转发表以及一个或多个端口。 一个或多个端口与多个虚拟局域网相关联。 一个或多个端口与多个桥接域相关联。 每个桥接域与转发表中的一个相关联,并且每个转发表与一个桥接域相关联。 处理器被配置为向接收到的分组分配第一标签,第一标签包括活动网桥域的标识,为接收到的分组分配第二标签,在转发表之一中查找接收到的分组的目的地址 并且如果在转发表中没有找到目的地址,并且使用接收到的分组的副本选择性地泛洪有效网桥域的一个或多个端口。 有源桥接域包括多个桥接域中的一个。 活动网桥域与接收到的数据包的入口端口相关联。 第二标签包括多个虚拟局域网之一的标识。
    • 5. 发明申请
    • MAC ADDRESS TABLE COLLECTION IN DISTRIBUTED SWITCHING SYSTEMS
    • 分布式交换系统中的MAC地址表收集
    • US20120320930A1
    • 2012-12-20
    • US13160283
    • 2011-06-14
    • Bijendra SinghArun SahaArindam Paul
    • Bijendra SinghArun SahaArindam Paul
    • H04L12/56
    • H04L49/351H04L49/3009
    • In accordance with embodiments of the present disclosure, a switch may include a processor and a plurality of line cards, each line card including a table of addresses. The processor may be configured to: (i) read, from a first line card of the plurality of line cards, addresses relating to all flooding domains present on the first line card; (ii) store the addresses read from the first line card on a memory accessible to the processor; (iii) determine a second line card of the plurality of line cards, the second line card having the presence of at least one flooding domain not present on the first line card; (iv) read, from the second line card, addresses relating to all flooding domains present on the second line card; and (v) store the addresses read from the second line card on the memory.
    • 根据本公开的实施例,开关可以包括处理器和多个线卡,每个线卡包括地址表。 处理器可以被配置为:(i)从多个线路卡的第一线路卡读取与存在于第一线路卡上的所有洪泛域有关的地址; (ii)将从第一线卡读取的地址存储在处理器可访问的存储器上; (iii)确定所述多个线路卡的第二线路卡,所述第二线路卡具有不存在于所述第一线路卡上的至少一个洪泛域; (iv)从第二线卡读取与存在于第二线卡上的所有洪泛域有关的地址; 和(v)将从第二线卡读取的地址存储在存储器上。
    • 6. 发明授权
    • Runtime flow debugging a network device by examining packet counters at internal points
    • 运行时流程通过检查内部点的分组计数器来调试网络设备
    • US08000337B2
    • 2011-08-16
    • US12413507
    • 2009-03-27
    • Arun Saha
    • Arun Saha
    • H04L12/26H04J1/16G08C15/00G06F11/00G01R31/06
    • H04L43/0888H04L41/22
    • In one embodiment, the internal path traversed by packets between two user visible interface, selected by a user, is displayed. The path displayed includes internal interfaces traversed by the packets. First and second count values showing the packets traversing each displayed internal interface at the beginning and end of a selected time period are also displayed. A delta, being the difference between the first and second count values for each internal interface indicates the number of packets traversing the interface during the time period and can be analyzed to determine the identity of a packet processing hardware logic block where packets might be getting dropped.
    • 在一个实施例中,显示由用户选择的两个用户可见界面之间的分组穿过的内部路径。 显示的路径包括数据包遍历的内部接口。 还显示了显示在所选择的时间段的开始和结束时遍历每个显示的内部接口的分组的第一和第二计数值。 作为每个内部接口的第一和第二计数值之间的差异的增量表示在该时间段期间穿过接口的分组数量,并且可以被分析以确定分组处理硬件逻辑块的身份,其中分组可能被丢弃 。
    • 7. 发明申请
    • METHOD AND SYSTEM FOR REDUCING ENTRIES IN A CONTENT-ADDRESSABLE MEMORY
    • 用于减少内容可寻址存储器中的入口的方法和系统
    • US20120131299A1
    • 2012-05-24
    • US12952050
    • 2010-11-22
    • Arun SahaBijendra Singh
    • Arun SahaBijendra Singh
    • G06F12/02
    • G11C15/00
    • A method for reducing memory entries in a ternary content-addressable memory may include determining if a first entry and a second entry are associated with the same data value. The method may also include determining if the first entry can be masked such that searching the memory with the content value of either of the first entry or the second entry returns the same data value. The method may further include, in response to determining that the first entry and a second entry are associated with the same data value and determining that the first entry can be masked such that addressing the memory with the content value of either of the first entry or the second entry returns the same data value: (i) masking the first entry such that addressing the memory with the content value of either of the first entry or the second entry returns the same data value; and (ii) deleting the second entry.
    • 用于减少三元可内容寻址存储器中的存储器条目的方法可以包括确定第一条目和第二条目是否与相同的数据值相关联。 该方法还可以包括确定第一条目是否可以被屏蔽,使得用第一条目或第二条目中的任一条的内容值搜索存储器返回相同的数据值。 该方法还可以包括响应于确定第一条目和第二条目与相同的数据值相关联并且确定可以屏蔽第一条目,使得以第一条目的任一条的内容值寻址存储器 第二条目返回相同的数据值:(i)屏蔽第一条目,使得利用第一条目或第二条目中的任一条的内容值寻址存储器返回相同的数据值; 和(ii)删除第二项。
    • 8. 发明申请
    • Systems and Methods for Minimizing the Number of Forwarding Identifiers in a Network Element with Distributed Architecture
    • 用于最小化具有分布式架构的网络元素中的转发标识符数量的系统和方法
    • US20110243135A1
    • 2011-10-06
    • US12753550
    • 2010-04-02
    • Bijendra SinghArun SahaMelvin Tan Wee Loon
    • Bijendra SinghArun SahaMelvin Tan Wee Loon
    • H04L12/56
    • H04L49/3009H04L49/101
    • A method may include, by a first network interface: receiving a packet having a flow via a first port of the first network interface; examining the packet to determine an ingress local forwarding identifier (LFID) associated with the flow of the packet; converting the ingress LFID to a global forwarding identifier (GFID) of the network element; and forwarding the packet to a switching element. The method may also include, by the switching element: determining a second network interface for egress of the packet based on the GFID; and forwarding the packet to the second network interface. The method may further include, by the second network interface: converting the GFID to an egress LFID associated with the flow of the packet; and forwarding the packet to a second port of the second network interface and a flow of the second network interface based on the egress LFID.
    • 一种方法可以包括:通过第一网络接口:经由第一网络接口的第一端口接收具有流的分组; 检查分组以确定与分组的流相关联的入口本地转发标识符(LFID); 将所述入口LFID转换为所述网元的全局转发标识符(GFID); 并将分组转发到交换单元。 所述方法还可以包括:所述交换单元:基于所述GFID确定用于所述分组出口的第二网络接口; 并将分组转发到第二网络接口。 所述方法还可以包括:通过所述第二网络接口将所述GFID转换为与所述分组的流相关联的出口LFID; 以及将所述分组转发到所述第二网络接口的第二端口以及基于所述出口LFID的所述第二网络接口的流程。
    • 9. 发明申请
    • RUNTIME FLOW DEBUGGING A NETWORK DEVICE BY EXAMINING PACKET COUNTERS AT INTERNAL POINTS
    • 通过在内部点检查分组计数器来运行流量调试网络设备
    • US20100246407A1
    • 2010-09-30
    • US12413507
    • 2009-03-27
    • Arun Saha
    • Arun Saha
    • H04L12/26
    • H04L43/0888H04L41/22
    • In one embodiment, the internal path traversed by packets between two user visible interface, selected by a user, is displayed. The path displayed includes internal interfaces traversed by the packets. First and second count values showing the packets traversing each displayed internal interface at the beginning and end of a selected time period are also displayed. A delta, being the difference between the first and second count values for each internal interface indicates the number of packets traversing the interface during the time period and can be analyzed to determine the identity of a packet processing hardware logic block where packets might be getting dropped.
    • 在一个实施例中,显示由用户选择的两个用户可见界面之间的分组穿过的内部路径。 显示的路径包括数据包遍历的内部接口。 还显示了显示在所选择的时间段的开始和结束时遍历每个显示的内部接口的分组的第一和第二计数值。 作为每个内部接口的第一和第二计数值之间的差异的增量表示在该时间段期间穿过接口的分组数量,并且可以被分析以确定分组处理硬件逻辑块的身份,其中分组可能被丢弃 。
    • 10. 发明授权
    • Systems and methods for minimizing the number of forwarding identifiers in a network element with distributed architecture
    • 用于最小化具有分布式架构的网络元件中的转发标识符的数量的系统和方法
    • US08605724B2
    • 2013-12-10
    • US12753550
    • 2010-04-02
    • Bijendra SinghArun SahaMelvin Tan Wee Loon
    • Bijendra SinghArun SahaMelvin Tan Wee Loon
    • H04L12/28
    • H04L49/3009H04L49/101
    • A method may include, by a first network interface: receiving a packet having a flow via a first port of the first network interface; examining the packet to determine an ingress local forwarding identifier (LFID) associated with the flow of the packet; converting the ingress LFID to a global forwarding identifier (GFID) of the network element; and forwarding the packet to a switching element. The method may also include, by the switching element: determining a second network interface for egress of the packet based on the GFID; and forwarding the packet to the second network interface. The method may further include, by the second network interface: converting the GFID to an egress LFID associated with the flow of the packet; and forwarding the packet to a second port of the second network interface and a flow of the second network interface based on the egress LFID.
    • 一种方法可以包括:通过第一网络接口:经由第一网络接口的第一端口接收具有流的分组; 检查分组以确定与分组的流相关联的入口本地转发标识符(LFID); 将所述入口LFID转换为所述网元的全局转发标识符(GFID); 并将分组转发到交换单元。 所述方法还可以包括:所述交换单元:基于所述GFID确定用于所述分组出口的第二网络接口; 并将分组转发到第二网络接口。 所述方法还可以包括:通过所述第二网络接口将所述GFID转换为与所述分组的流相关联的出口LFID; 以及将所述分组转发到所述第二网络接口的第二端口以及基于所述出口LFID的所述第二网络接口的流程。