-
公开(公告)号：US07336672B1
公开(公告)日：2008-02-26
申请号：US10422796
申请日：2003-04-25
IPC分类号： H04L12/28
CPC分类号： H04L47/10 , H04L47/283 , H04L47/30 , H04L47/32
摘要： Various techniques for queue management based on random early detection (RED) are disclosed herein. In particular, a method for generating a drop probability for an incoming packet in a device having a queue to buffer packets between segments of a network is provided. The method comprises determining, upon receipt of an incoming packet, a size of the queue and determining an error based at least in part on a difference between the queue size and a threshold. The method further comprises determining a drop probability for the incoming packet based at least in part on the error and a constant gain factor. The constant gain factor may be based at least in part on a linearized second order dynamic model of the network.
摘要翻译： 本文中公开了基于随机早期检测（RED）的队列管理的各种技术。 特别地，提供了一种用于在具有队列以在网络的段之间缓冲分组的设备中生成用于输入分组的丢弃概率的方法。 该方法包括在接收到传入分组时确定队列的大小并且至少部分地基于队列大小与阈值之间的差异来确定错误。 该方法还包括至少部分地基于误差和恒定增益因子确定输入分组的丢弃概率。 恒定增益因子可以至少部分地基于网络的线性化二阶动态模型。
-
公开(公告)号：US06788697B1
公开(公告)日：2004-09-07
申请号：US09635898
申请日：2000-08-11
申请人： James Aweya , Michel Ouellette , Delfin Y. Montuno
发明人： James Aweya , Michel Ouellette , Delfin Y. Montuno
IPC分类号： H04L1226
CPC分类号： H04L49/9036 , H04L49/90 , H04L49/901 , H04L49/9026 , H04L49/9052 , H04L49/9078
摘要： An improved buffer management process is disclosed wherein the buffer is shared among a plurality of packet queues. The improved buffer management process comprises computing a common queue threshold value based upon the aggregate size of the plurality of packet queues and a predetermined buffer threshold value. The common queue threshold value is then used to manage the size of each of the plurality of packet queues and thereby manage the buffer.
摘要翻译： 公开了一种改进的缓冲器管理过程，其中缓冲器在多个分组队列之间共享。 改进的缓冲器管理过程包括基于多个分组队列的聚合大小和预定的缓冲器阈值来计算公共队列阈值。 然后使用公共队列阈值来管理多个分组队列中的每一个的大小，从而管理缓冲器。
-
3.发明授权公开(公告)号：US06657983B1
公开(公告)日：2003-12-02
申请号：US09429014
申请日：1999-10-29
申请人： Mieczyslaw J. Surazski , James Aweya , Imed Frigui , Pierre A. Hamel , Delfin Y. Montuno , Tong Shan , Bernard Thiboutot , Genzao G. Zhang
发明人： Mieczyslaw J. Surazski , James Aweya , Imed Frigui , Pierre A. Hamel , Delfin Y. Montuno , Tong Shan , Bernard Thiboutot , Genzao G. Zhang
IPC分类号： H04B7212
CPC分类号： H04B7/2646
摘要： A method of allocating bandwidth for transmitting upstream cells from a CPE unit to a BTS. The CPE determines arrival time information associated with each cell and sends arrival time information associated with at least one cell to the BTS. The BTS allocates future bandwidth to the CPE as a function of the arrival time information received from the CPE. For example, the BTS estimates the number of cell arrivals occurring in the current scheduling period based on past cell arrival times. The BTS then sends information to the CPE in which the allocated future bandwidth is specified. Finally, the CPE groups a number of cells into a burst packet occupying the allocated bandwidth and sends the burst packet to the BTS. Rather than respond in a delayed manner to a bandwidth deficiency or surplus at an individual CPE unit, the BTS produces an estimate of a CPE unit's bandwidth demands, resulting in more efficient bandwidth utilization and reduced cell loss ratio.
摘要翻译： 分配用于从CPE单元向BTS发送上行小区的带宽的方法。 CPE确定与每个小区相关联的到达时间信息，并将与至少一个小区相关联的到达时间信息发送到BTS。 作为从CPE接收的到达时间信息的函数，BTS将CPE的未来带宽分配给CPE。 例如，BTS基于过去的小区到达时间估计在当前调度周期中发生的小区到达的数量。 BTS然后向CPE发送信息，其中指定了分配的未来带宽。 最后，CPE将多个小区分组成占用分配带宽的突发分组，并将突发分组发送到BTS。 不是以延迟的方式响应单个CPE单元的带宽不足或剩余，所以BTS产生CPE单元的带宽需求的估计，导致更有效的带宽利用和减少的信元丢失率。
-
4.发明授权公开(公告)号：US07787370B1
公开(公告)日：2010-08-31
申请号：US09946736
申请日：2001-09-06
申请人： James Aweya , Michel Ouellette , Delfin Y. Montuno , Kent Felske
发明人： James Aweya , Michel Ouellette , Delfin Y. Montuno , Kent Felske
IPC分类号： G01R31/08
CPC分类号： H04L47/10 , H04L45/245 , H04L47/125 , Y02D50/30
摘要： A technique for adaptively load balancing connections in multi-link trunks is disclosed. The present invention provides an adaptive load balancing algorithm that utilizes relative link quality metrics to adjust traffic distribution between links. Link quality metrics may include short-term averages of an observed packet drop rate for each member link in a bundle. The present invention may dynamically adjust the number of flows on each link in proportion to available bandwidth. In addition, link quality metrics may be equalized, such that no link is more lossy than the others.
摘要翻译： 公开了一种用于在多链路干线中自适应地负载平衡连接的技术。 本发明提供一种自适应负载平衡算法，其利用相对链路质量度量来调整链路之间的业务分布。 链路质量度量可以包括捆绑中每个成员链路观察到的分组丢弃率的短期平均值。 本发明可以与可用带宽成比例地动态地调整每个链路上的流量。 此外，链路质量度量可能会相等，使得没有链路比其他链路更有损耗。
-
5.发明授权Method and apparatus for encoding a plurality of pre-defined codes into a search key and for locating a longest matching pre-defined code 失效用于将多个预定义代码编码到搜索关键字中并用于定位最长匹配的预定义代码的方法和装置公开(公告)号：US07324519B2
公开(公告)日：2008-01-29
申请号：US11034839
申请日：2005-01-14
申请人： Delfin Y. Montuno , James Aweya
发明人： Delfin Y. Montuno , James Aweya
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/54 , Y10S707/99933
摘要： A method and apparatus for locating in a list of pre-defined codes, a longest code matching a given code. The method and apparatus involve producing a search mask encoding at least one portion of said given code and comparing the search mask to a search key having a Prefix Node Bit Array (PNBA) in which a bit is set active in at least one of a plurality of bit positions corresponding to possible bit combinations of bits in a bit string having a length equal to or less than the longest predefined code in the plurality of pre-defined codes and arranged by the lengths of possible bit combinations and by numeric values of the bit combinations, to identify a common active bit position in the search key and the search mask corresponding to one of the pre-defined codes having a length greater than all others of said pre-defined codes which correspond to common active bit positions.
摘要翻译： 用于定位在预定义代码列表中的方法和装置，其是与给定代码匹配的最长代码。 所述方法和装置包括产生编码所述给定代码的至少一部分的搜索掩码，并且将搜索掩码与具有前缀节点位阵列（PNBA）的搜索关键字进行比较，其中将位设置为多个 对应于具有等于或小于多个预定义代码中的最长预定义代码的长度的比特串中的比特的可能比特组合的比特位置，并且由可能的比特组合的长度和比特的数值 组合，以识别搜索关键字中的公共活动比特位置和对应于具有大于对应于公共活动比特位置的所述预定义码的所有其他长度的预定义码之一的搜索掩码。
-
公开(公告)号：US07221656B1
公开(公告)日：2007-05-22
申请号：US10172981
申请日：2002-06-18
申请人： James Aweya , Michel Ouellette , Delfin Y. Montuno
发明人： James Aweya , Michel Ouellette , Delfin Y. Montuno
CPC分类号： H04L47/10 , H04L47/2441 , H04L47/30 , H04L47/326
摘要： A technique for implementing an admission control scheme for data flows is disclosed. In one embodiment, the technique is realized by determining a current error value in response to a queue size in a packet buffer; generating a packet drop probability based at least in part on the current error value; receiving a data packet having a data type; and determining whether to reject or accept the received data packet at a queue based at least in part on the packet drop probability and a predetermined flow rejection threshold. In addition, the technique may involve determining whether a randomly generated number is less than or equal to the packet drop probability and determining whether a count variable is greater than or equal to an inter-drop interval.
摘要翻译： 公开了一种用于实现数据流的准入控制方案的技术。 在一个实施例中，通过响应于分组缓冲器中的队列大小来确定当前错误值来实现该技术; 至少部分地基于当前误差值产生分组丢弃概率; 接收具有数据类型的数据分组; 以及至少部分地基于分组丢弃概率和预定流拒绝阈值来确定是否拒绝或接受队列处的接收数据分组。 此外，该技术可以涉及确定随机生成的数量是否小于或等于分组丢弃概率，并且确定计数变量是否大于或等于中间间隔。
-
公开(公告)号：US07184431B2
公开(公告)日：2007-02-27
申请号：US09954192
申请日：2001-09-18
申请人： Ernst A. Munter , Delfin Y. Montuno , James Aweya
发明人： Ernst A. Munter , Delfin Y. Montuno , James Aweya
IPC分类号： H04L12/50
摘要： A rotator switch includes active and redundant tandem buffers used to switch information units through the switch. The tandem buffers are interconnected to inputs and outputs by way of commutators. Information provided to one or more of the active buffers is provided to a redundant buffer. If an active tandem buffer fails, the switch may use the redundant buffer in place of the failed active buffer. A further rotator switch is formed using a plurality of switching blocks. Each switching block includes its own set of tandem buffers, and ingress and egress commutators to interconnect the tandem buffers to inputs and outputs. The plurality of switching blocks is interconnected using additional commutators. At least one of these switching blocks is redundant and is provided with information provided to an active switching block. In the event of failure of an active block, the switch may use a redundant switching block in place of the failed or replaced active block.
摘要翻译： 旋转开关包括用于通过开关切换信息单元的主动和冗余串联缓冲器。 串联缓冲器通过换向器与输入和输出互连。 提供给一个或多个活动缓冲器的信息被提供给冗余缓冲器。 如果主动串联缓冲区出现故障，则交换机可能会使用冗余缓冲区来代替故障的主动缓冲区。 使用多个切换块形成另外的旋转开关。 每个切换块包括其自己的串联缓冲器集合，以及用于将串联缓冲器互连到输入和输出的入口和出口换向器。 多个切换块使用附加换向器互连。 这些切换块中的至少一个是冗余的并且被提供有提供给有源切换块的信息。 在活动块发生故障的情况下，交换机可以使用冗余交换块来代替故障或更换的活动块。
-
公开(公告)号：US07130368B1
公开(公告)日：2006-10-31
申请号：US10246399
申请日：2002-09-19
IPC分类号： H03D3/24
CPC分类号： H03L7/085 , H03L7/0992 , H03L7/181 , H04J3/0632 , H04N21/21805 , H04N21/4305 , H04N21/44004
摘要： A system and method for synchronizing a local clock to a reference clock using a linear model of the error between the local clock and the reference clock is disclosed. In one embodiment, a direct smoothing process is used in conjunction with the linear model to estimate a frequency offset by which the frequency of an oscillator of the local clock is adjusted. Also disclosed herein is a phased-lock loop (PLL) adapted to synchronize a local clock with a reference clock using the direct smoothing process, as well as a system implementing the PLL for timing the playout of data received from a transmitter.
摘要翻译： 公开了一种使用本地时钟和参考时钟之间的误差的线性模型将本地时钟同步到参考时钟的系统和方法。 在一个实施例中，直线平滑处理与线性模型一起使用以估计调整本地时钟的振荡器的频率的频率偏移。 本文还公开了适用于使用直接平滑处理将本地时钟与参考时钟同步的相控锁环（PLL），以及实现用于定时从发射机接收的数据的播出的定时的PLL的系统。
-
公开(公告)号：US06961307B1
公开(公告)日：2005-11-01
申请号：US09900146
申请日：2001-07-09
申请人： James Aweya , Michel Ouellette , Delfin Y. Montuno
发明人： James Aweya , Michel Ouellette , Delfin Y. Montuno
CPC分类号： H04L47/30 , H04L47/10 , H04L47/263 , H04L47/32
摘要： A technique for managing a queue so as to distribute losses among different service classes is disclosed. In one embodiment, the technique is realized by classifying an incoming packet into one of a plurality of classes. Each class has an associated weighting factor. The system continuously monitors a queue size and determines an overall packet drop probability based on the actual queue size and a target queue size and calculates a target class drop probability based on the overall packet drop probability and the weighting factor. Finally, the system makes a comparison based on the target class drop probability and a selected value and decides whether to drop the incoming packet based on a result of the comparison. If losses are unavoidable in the system, the technique ensures that the losses will be distributed among the different service classes in inverse proportion to the service price of each class.
摘要翻译： 公开了一种用于管理队列以便在不同服务类别之间分配丢失的技术。 在一个实施例中，该技术通过将输入分组分类为多个类中的一个来实现。 每个类都有相关的加权因子。 系统连续监视队列大小，并根据实际队列大小和目标队列大小确定整体分组丢弃概率，并根据整体分组丢弃概率和权重因子计算目标类丢弃概率。 最后，系统根据目标类丢弃概率和选定值进行比较，并根据比较结果决定是否丢弃传入的数据包。 如果系统中的损失是不可避免的，则该技术可以确保不同服务类别之间的损失与每个类的服务价格成反比。
-
公开(公告)号：US08755308B2
公开(公告)日：2014-06-17
申请号：US13362319
申请日：2012-01-31
IPC分类号： H04L12/28
CPC分类号： H04L41/12 , H04J3/0679
摘要： In response to a network topology change, a clock root node calculates a new clock path for each affected node by building a clock source topology tree, and identifying from that tree a path to the network node from a clock source of higher or equal stratum relative to that network node. The root node then sends a network message to each node indicating the new path that the node should use. Each node receives the message and compares the new path with the existing path. If the paths are different then the node acquires the new path just received in the message. If the paths are the same then the node does nothing and discards the message.
摘要翻译： 响应于网络拓扑变化，时钟根节点通过构建时钟源拓扑树来计算每个受影响节点的新时钟路径，并且从该树中识别来自较高或相等层次的时钟源的网络节点的路径 到该网络节点。 根节点然后向每个节点发送一个网络消息，指示该节点应该使用的新路径。 每个节点接收消息，并将新路径与现有路径进行比较。 如果路径不同，则节点获取刚刚在消息中接收到的新路径。 如果路径相同，则节点不执行任何操作并丢弃该消息。
-
-
-
-
-
-
-
-
-
搜索结果
48 条记录 (耗时 0.023 秒)
