会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • LONGEST PREFIX MATCH SCHEME
    • 最早的PREFIX MATCH计划
    • WO2013016502A3
    • 2013-07-11
    • PCT/US2012048273
    • 2012-07-26
    • BROCADE COMM SYSTEMS INCLIU JIANLEICHTY PHILIP LYNNLIM HOW TUNGTERRY JOHN MICHAELMADDURY MAHESH SRINIVASACHEUNG WINGKO KUNG LING
    • LIU JIANLEICHTY PHILIP LYNNLIM HOW TUNGTERRY JOHN MICHAELMADDURY MAHESH SRINIVASACHEUNG WINGKO KUNG LING
    • G06F7/02
    • G06F7/02H04L45/7457H04L45/748
    • A LPM search engine includes a plurality of exact match (EXM) engines and a moderately sized TCAM. Each EXM engine uses a prefix bitmap scheme that allows the EXM engine to cover multiple consecutive prefix lengths. Thus,instead of covering one prefix length L per EXM engine, the prefix bitmapscheme enables each EXM engine to cover entries having prefix lengths of L,L+1, L+2 and L+3, for example. As a result, fewer EXM engines are potentially underutilized, which effectively reduces quantization loss. Each EXM engine provides a search result with a determined fixed latency when using the prefix bitmap scheme. The results of multiple EXM engines and the moderately sizedTCAM are combined to provide a single search result, representative of the longest prefix match. In one embodiment, the LPM search engine supports 32-bitIPv4 (or 128-bit IPv6) search keys, each having associated 15-bit level 3 VPN identification values.
    • LPM搜索引擎包括多个精确匹配(EXM)引擎和适度大小的TCAM。 每个EXM引擎使用前缀位图方案,允许EXM引擎覆盖多个连续的前缀长度。 因此,例如,前缀位图方案不是覆盖每个EXM引擎的一个前缀长度L,而是允许每个EXM引擎覆盖具有前缀长度L,L + 1,L + 2和L + 3的条目。 因此,更少的EXM引擎可能未充分利用,从而有效减少量化损失。 当使用前缀位图方案时,每个EXM引擎提供具有确定的固定延迟的搜索结果。 将多个EXM引擎和中等大小的TCAM的结果组合起来以提供单个搜索结果,代表最长的前缀匹配。 在一个实施例中,LPM搜索引擎支持32位IPv4(或128位IPv6)搜索关键字,每个搜索关键字具有关联的15位3级VPN标识值。
    • 6. 发明公开
    • RAILWAY TRAIN WITH LENGTH EXCEEDING THAT OF PLATFORM AND CONFIGURATION SYSTEM THEREFOR
    • EISENBAHNZUG MITGLEISÜBERSTEIGENDERLÄNGEUND KONFIGURATIONSSYSTEMDAFÜR
    • EP3040250A4
    • 2017-06-21
    • EP14840921
    • 2014-08-25
    • LIU JIAN
    • LIU JIAN
    • B61B1/00B61D17/00G07B11/00
    • B61D13/00B61B1/00B61L21/00B61L25/02G07B11/00G07B15/00Y02T30/30
    • A railroad train marshaling system or marshaling method is disclosed. The railroad train includes cars within platform area which are made up of several cars; door-free cars which are connected with the cars within platform area at both ends or one end and made up of at least one car with no side door for passengers to get on and off the train. When the railroad train stops at the platform, the cars within plat form area are arranged to stop within the area of platform or corresponding to the platform, the door-free car is arranged to stop beyond platform area and passengers in the door-free car will get to the platform directly from the car within platform area. The sum of length of door-free car and cars within platform area is more than that of the platform.
    • 公开了一种铁路列车编组系统或编组方法。 铁路列车包括由多辆汽车组成的平台区域内的汽车; 无门轿厢,两端或一端与平台区域内的轿厢连接,至少由一辆轿车组成,轿厢无侧门,供乘客上下列车。 当列车停靠在平台上时,平台区内的车辆布置成停在平台区域内或与平台对应,无门轿厢布置成停在平台区域之外并停在无门轿厢中的乘客 将直接从平台区域内的汽车到达平台。 平台区内的免门轿厢和轿厢长度之和大于平台区域。