会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Longest prefix match scheme
    • 最长前缀匹配方案
    • US08880494B2
    • 2014-11-04
    • US13284829
    • 2011-10-28
    • Jian LiuPhilip Lynn LeichtyHow Tung LimJohn Michael TerryMahesh Srinivasa MadduryWing CheungKung Ling Ko
    • Jian LiuPhilip Lynn LeichtyHow Tung LimJohn Michael TerryMahesh Srinivasa MadduryWing CheungKung Ling Ko
    • G06F17/30H04L12/743G06F7/02H04L12/745
    • 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 bitmap scheme 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 sized TCAM are combined to provide a single search result, representative of the longest prefix match. In one embodiment, the LPM search engine supports 32-bit IPv4 (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标识值。
    • 2. 发明申请
    • Longest Prefix Match Scheme
    • 最长前缀匹配方案
    • US20130031077A1
    • 2013-01-31
    • US13284829
    • 2011-10-28
    • Jian LiuPhilip Lynn LeichtyHow Tung LimJohn Michael TerryMahesh Srinivasa MadduryWing CheungKung Ling Ko
    • Jian LiuPhilip Lynn LeichtyHow Tung LimJohn Michael TerryMahesh Srinivasa MadduryWing CheungKung Ling Ko
    • G06F17/30
    • 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 bitmap scheme 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 sized TCAM are combined to provide a single search result, representative of the longest prefix match. In one embodiment, the LPM search engine supports 32-bit IPv4 (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标识值。
    • 4. 发明授权
    • Method and apparatus for resource allocation with guarantees
    • 资源配置的方法和设备与保证
    • US5996013A
    • 1999-11-30
    • US845967
    • 1997-04-30
    • Gary Scott DelpRoch A. GuerinPhilip Lynn LeichtyVinod Gerard John PerisRajendran RajanAlbert Alfonse Slane
    • Gary Scott DelpRoch A. GuerinPhilip Lynn LeichtyVinod Gerard John PerisRajendran RajanAlbert Alfonse Slane
    • G06F9/50G06F15/16
    • G06F9/5027G06F2209/5011G06F2209/5021
    • A method and apparatus are provided for resource allocation with guarantees. A resource allocator is coupled to a controller. The resource allocator allocates resources between a plurality of arrival processes. A dedicated resource pool and a shared resource pool are provided. When an arrival process is identified, the resource allocator obtains a predefined characterizing value for the identified arrival process. Responsive to the obtained predefined characterizing value, resource from one of the dedicated resource pool or the shared resource pool is allocated to the arrival process. The controller is utilized for tracking resource use and for providing the predefined characterizing value for each of the plurality of arrival processes. The dedicated resource pool has a predetermined capacity greater than or equal to the total of all the low threshold values for each of the arrival processes. The dedicated resource pool provides the guarantees with the shared pool providing statistical multiplexed resource use. The controller increments a usage charge for the arrival process when a resource is allocated and decrements the usage charge at the end of use of the allocated resource. The controller evaluates use for the identified arrival process and updates the predefined characterizing value.
    • 提供了一种用于具有保证的资源分配的方法和装置。 资源分配器耦合到控制器。 资源分配器在多个到达处理之间分配资源。 提供专用资源池和共享资源池。 当识别到达过程时,资源分配器获得用于所识别的到达过程的预定义特征值。 响应于获得的预定义特征值,来自专用资源池或共享资源池之一的资源被分配给到达处理。 该控制器被用于跟踪资源的使用和为多个到达过程中的每一个提供预定义的表征值。 专用资源池具有大于或等于每个到达处理的所有低阈值的总和的预定容量。 专用资源池为共享池提供了统一复用资源使用的保证。 当分配资源时,控制器增加到达过程的使用费用,并且在分配的资源的使用结束时递减使用费用。 控制器对所识别的到达过程进行评估,并更新预定义的表征值。
    • 6. 发明授权
    • Communications cell scheduler and scheduling method for providing
proportional use of network bandwith
    • 通信小区调度器和调度方法提供比例使用的网络带宽
    • US5844890A
    • 1998-12-01
    • US823865
    • 1997-03-25
    • Gary Scott DelpPhilip Lynn Leichty
    • Gary Scott DelpPhilip Lynn Leichty
    • H04Q3/00H04L12/56H04J1/16H04L12/28
    • H04L12/5602H04L2012/5638H04L2012/5651H04L2012/5679
    • A method and apparatus are provided for scheduling the transmission of cells of a plurality of data streams in a communications network. A best effort scheduler is provided for scheduling the transmission of cells of a plurality of data streams in a communications network. The best effort scheduler includes a best effort operational mode and can include more than one timing wheel. When the best effort scheduler includes more than one timing wheel, then the priority of the best effort timing wheel is lower than the priority of the other timing wheel or wheels. Data of each data stream is enqueued to a corresponding data cell queue. A target next transmission time for each data cell queue is calculated utilizing predetermined logical channel descriptor parameters. A lower priority or a higher priority timing wheel is selected and a timing wheel time slot is calculated based on an identified target transmission time for each active data cell queue. An active indication is set for the identified timing wheel time slot and an entry is stored to point to the corresponding data cell queue for the identified timing wheel time slot. The relative rates between data streams are maintained, while the absolute rates of the data streams are increased or decreased in the low priority wheel. Scheduling opportunities can be defined utilizing a predefined pseudo data cell queue. Then the calculation of the target transmission time for each data cell queue includes the predefined pseudo data cell queue, and the identified target transmission time for the predefined pseudo data cell queue defines scheduling opportunities of multiple timing wheel time slots.
    • 提供了一种用于调度通信网络中的多个数据流的小区的传输的方法和装置。 提供尽力调度器来调度通信网络中的多个数据流的小区的传输。 尽力而为的调度器包括尽力而为的操作模式,并且可以包括多于一个的定时轮。 当尽力而为调度器包括多于一个的定时轮时,最佳努力定时轮的优先级低于另一个定时轮或轮的优先级。 每个数据流的数据排入相应的数据单元队列。 使用预定的逻辑信道描述符参数计算每个数据信元队列的目标下一传输时间。 选择较低优先级或较高优先级的定时轮,并且基于每个活动数据单元队列的所识别的目标传输时间来计算定时轮时隙。 为所识别的定时轮时隙设置活动指示,并且存储一个条目以指向用于识别的定时轮时隙的对应的数据信元队列。 保持数据流之间的相对速率,而在低优先级轮中数据流的绝对速率增加或减少。 可以使用预定义的伪数据单元队列来定义调度机会。 然后,每个数据单元队列的目标传输时间的计算包括预定义的伪数据小区队列,并且用于预定义伪数据小区队列的所识别的目标传输时间定义了多个定时轮时隙的调度机会。
    • 8. 发明授权
    • Phase locked loop circuit having automatic range setting logic
    • 锁相环电路具有自动量程设定逻辑
    • US5764712A
    • 1998-06-09
    • US634504
    • 1996-04-18
    • Mark William BranstadPhilip Lynn LeichtyBrian Andrew Schuelke
    • Mark William BranstadPhilip Lynn LeichtyBrian Andrew Schuelke
    • H03L7/10H03L7/113
    • H03L7/10H03L7/113Y10S331/02
    • A method for setting a locking frequency operating range of the phase locked loop (PLL) circuit and a phase locked loop (PLL) circuit are provided with range select logic for detecting an unknown reference clock frequency and for setting a locking frequency operating range of the phase locked loop. First a bypass mode for the phase locked loop (PLL) circuit is set. An unknown reference clock frequency is applied to a first counter. A known oscillator clock frequency is applied to a second counter. The first and second counters are reset and a timeout value of the second counter is identified. A first counter count value is compared with precalculated constant values. A set of range bits are latched responsive to said compared values. Two consecutive sets of latched range bits are compared and the steps repeated until a match of two consecutive sets of latched range bits is identified. The matching latched range bits are applied to a programmable range select input of the phase locked loop (PLL) circuit.
    • 用于设置锁相环(PLL)电路和锁相环(PLL)电路的锁定频率工作范围的方法设置有用于检测未知参考时钟频率的范围选择逻辑,并且用于设置锁相环 锁相环。 首先设置锁相环(PLL)电路的旁路模式。 将未知的参考时钟频率应用于第一个计数器。 已知的振荡器时钟频率被施加到第二计数器。 第一和第二计数器被复位,并且识别出第二计数器的超时值。 将第一计数器计数值与预先计算的常数值进行比较。 响应于所述比较值而锁存一组范围位。 比较两个连续的锁存范围比特组,并重复步骤,直到两个连续的锁存范围比特组的匹配被识别。 匹配的锁存范围位被应用于锁相环(PLL)电路的可编程范围选择输入。