公开(公告)号：US07545804B2

公开(公告)日：2009-06-09

申请号：US10659320

申请日：2003-09-11

申请人： Ernst A. Munter ,  Delfin Y. Montuno ,  James Aweya

发明人： Ernst A. Munter ,  Delfin Y. Montuno ,  James Aweya

IPC分类号： H04L12/54 ,  H04L12/56

CPC分类号： H04L49/103 ,  H04L49/1553

摘要： A rotator switch including more tandem buffers than inputs is disclosed. An input data conditioner formats data to be transferred from the multiple inputs to the tandem buffers. Excess tandem buffers allow data to be transferred from inputs to tandem buffers at a rate less than the rate at which data arrives at the inputs. Excess capacity of the switch fabric may be used to carry overhead, or slow the rate at which data is transferred to the switch fabric.

摘要翻译： 公开了包括比输入更多的串联缓冲器的旋转开关。 输入数据调节器将要从多个输入传送到串联缓冲器的数据。 过多的串联缓冲器允许数据以低于数据到达输入的速率的速率从输入传输到串联缓冲器。 交换结构的过多容量可能用于携带开销，或者减慢数据传输到交换结构的速率。

公开(公告)号：US07043651B2

公开(公告)日：2006-05-09

申请号：US10076415

申请日：2002-02-19

申请人： James Aweya ,  Michel Ouellette ,  Delfin Y. Montuno ,  Kent E. Felske

发明人： James Aweya ,  Michel Ouellette ,  Delfin Y. Montuno ,  Kent E. Felske

IPC分类号： G06F1/12 ,  H04L7/00

CPC分类号： H04N21/64322 ,  H03L7/093 ,  H03L7/0992 ,  H03L7/18 ,  H04J3/0632 ,  H04J3/0664 ,  H04N21/242 ,  H04N21/4305

摘要： A technique for synchronizing clocks in a network is disclosed. In one exemplary embodiment, the technique may be realized as a method for synchronizing clocks in a network. The method comprises receiving a first timestamp and a second timestamp, each indicating a respective time instance as determined by a first clock signal within the network. The method also comprises measuring a first time interval between the first timestamp and the second timestamp. The method further comprises generating a difference signal representing a difference between the first time interval and a second time interval, and generating a second clock signal based upon the difference signal such that the second clock signal is synchronized with the first clock signal.

公开(公告)号：US06993025B1

公开(公告)日：2006-01-31

申请号：US09475308

申请日：1999-12-30

申请人： Delfin Y. Montuno ,  James Aweya

发明人： Delfin Y. Montuno ,  James Aweya

IPC分类号： H04L12/28

CPC分类号： H04L45/00 ,  H04L45/54 ,  Y10S707/99933

摘要： A method of encoding a plurality of pre-defined codes into a search key and a method of using the search key to locate a longest matching pre-defined code to a given code is disclosed. Encoding the pre-defined codes into a search key involves producing a prefix node bit array (PNBA) having a plurality of bit positions corresponding to possible bit combinations of a bit string having a length equal to or less than the longest predefined code in said plurality of said pre-defined codes such that said bit positions are arranged by the lengths of said possible bit combinations and by numeric value of said possible bit combinations and to setting bits active in bit positions which correspond to bit combinations identified by said pre-defined codes. The method of locating involves producing a search mask encoding at least one portion of said given code and comparing said 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 said plurality of said pre-defined codes and arranged by the lengths of said possible bit combinations and by numeric values of said bit combinations, to identify a common active bit position in said search key and said search mask corresponding to a one of said pre-defined codes having a length greater than all others of said pre-defined codes which correspond to common active bit positions.

摘要翻译： 公开了一种将多个预定义代码编码成搜索关键字的方法，以及使用搜索关键字将最长匹配的预定义代码定位到给定代码的方法。 将预定义代码编码到搜索关键字中涉及产生具有多个比特位置的前缀节点比特阵列（PNBA），该多个比特位置对应于长度等于或小于所述多个中最长预定义码长度的比特串的可能比特组合 的所述预定义代码，使得所述位位置由所述可能位组合的长度和所述可能位组合的数值排列，并且设置位对应于由所述预定义代码识别的位组合的位位置中的位 。 定位方法涉及产生编码所述给定代码的至少一部分的搜索掩码，并将所述搜索掩码与具有前缀节点比特阵列（PNBA）的搜索关键字进行比较，其中将比特设置为多个 对应于具有等于或小于所述多个所述预定义代码中的最长预定义代码的长度的比特串中的比特的可能比特组合的比特位置，并且由所述可能比特组合的长度和数字值 所述比特组合，用于识别所述搜索关键字中的公共活动比特位置，并且所述搜索掩码对应于所述预定义码之一，其长度大于对应于公共活动比特位置的所述预定义码的所有其他长度。

公开(公告)号：US06928054B1

公开(公告)日：2005-08-09

申请号：US09665994

申请日：2000-09-20

申请人： Delfin Y. Montuno ,  James Aweya ,  Michel Ouellette

发明人： Delfin Y. Montuno ,  James Aweya ,  Michel Ouellette

IPC分类号： H04L12/26 ,  H04L12/56 ,  H04L29/06

CPC分类号： H04L47/10 ,  H04L29/06 ,  H04L47/26 ,  H04L47/30 ,  H04L69/16 ,  H04L69/163

摘要： An apparatus, method, computer-readable medium and signals for connection-class parameter control of packet flow, involves indicating a desired packet flow from a packet source to a network element having a queue, by communicating to the packet source an indication of a desired number of packets to be received from the source in a time period, in response to a class parameter associated with a class of connections supported by the network element and queue conditions at the network element.

摘要翻译： 用于分组流的连接级参数控制的装置，方法，计算机可读介质和信号涉及通过向分组源通信来指示期望的分组流从分组源到具有队列的网元， 响应于与网络元件支持的连接类相关联的类参数和网元处的队列条件，在时间段内从源接收的分组的数量。

公开(公告)号：US06584111B1

公开(公告)日：2003-06-24

申请号：US09185635

申请日：1998-11-04

申请人： James Aweya ,  Delfin Y. Montuno

发明人： James Aweya ,  Delfin Y. Montuno

IPC分类号： H04L1228

CPC分类号： H04L49/3081 ,  H04L12/5602 ,  H04L49/20 ,  H04L49/30 ,  H04L49/50 ,  H04L2012/5635 ,  H04L2012/5681

摘要： A flow control system and methodology controls and avoids congestion in an Asynchronous Transfer Mode (ATM) network. The congestion state of a network switch is determined based on incoming Available Bit Rate (ABR) traffic, Constant Bit Rate (CBR) traffic, and Variable Bit Rate (VBR) traffic. High-frequency fluctuations due to VBR traffic are filtered out of the CBR/VBR traffic to determine the underlying trend of network traffic. A filtering mechanism is based on wavelet transforms. The switch congestion state is determined based on the current ABR traffic, the filtered CBR/VBR traffic, and the current status of buffers in the switch. The congestion state can then be used to adjust the ABR rate according to a feedback scheme such as Explicit Forward Congestion Indication (EFCI).

摘要翻译： 流控制系统和方法控制并避免异步传输模式（ATM）网络中的拥塞。 基于传入的可用比特率（ABR）流量，恒定比特率（CBR）流量和可变比特率（VBR）流量来确定网络交换机的拥塞状态。 由于VBR流量引起的高频波动被从CBR / VBR流量中滤除，以确定网络流量的潜在趋势。 滤波机制是基于小波变换的。 交换机拥塞状态根据当前ABR流量，CBR / VBR流量的过滤和交换机缓冲区的当前状态确定。 然后可以使用拥塞状态根据诸如显式前向拥塞指示（EFCI）的反馈方案来调整ABR速率。

公开(公告)号：US07613268B2

公开(公告)日：2009-11-03

申请号：US11394705

申请日：2006-03-31

申请人： James Aweya ,  Delfin Y. Montuno ,  Michel Ouellette ,  Kent Felske

发明人： James Aweya ,  Delfin Y. Montuno ,  Michel Ouellette ,  Kent Felske

IPC分类号： H03D3/24

CPC分类号： H03L7/08 ,  H03L2207/50

摘要： A method and apparatus for designing a PLL enables initial component characteristics and design specifications of the PLL to be specified. Time constants for a loop filter that would be required to create a PLL having the desired design specifications and component characteristics are then computed. The performance or behavior characteristics of the PLL may then be computed for the PLL given the time constants and the initial set of components, to determine whether the performance of the PLL would be considered satisfactory. For example, PLL design software may determine whether a PLL would be sufficiently stable if it was to be created using the particular selected components given the required design specifications. Where the PLL does not meet particular behavior characteristics, the PLL design software may provide guidance as to what component characteristics would improve performance of the PLL. Designed PLLs may be used for timestamp based clock synchronization.

摘要翻译： 用于设计PLL的方法和装置使得能够指定PLL的初始组件特性和设计规范。 然后计算创建具有所需设计规范和组件特性的PLL所需的环路滤波器的时间常数。 然后可以为给定时间常数和初始组件组的PLL计算PLL的性能或行为特性，以确定PLL的性能是否被认为是令人满意的。 例如，PLL设计软件可以确定PLL是否将足够稳定，如果要在给定所需设计规范的情况下使用特定的选定组件创建PLL。 在PLL不符合特定行为特性的情况下，PLL设计软件可以提供关于什么组件特性将提高PLL性能的指导。 设计的PLL可用于基于时间戳的时钟同步。

公开(公告)号：US07590210B2

公开(公告)日：2009-09-15

申请号：US11172100

申请日：2005-06-30

申请人： James Aweya ,  Delfin Y. Montuno ,  Michel Ouellette ,  Kent Felske

发明人： James Aweya ,  Delfin Y. Montuno ,  Michel Ouellette ,  Kent Felske

IPC分类号： H04L7/00 ,  H04J3/06

CPC分类号： H03L7/0992 ,  H04J3/0664

摘要： A first level of control over operation of slave Digitally Controlled Frequency Selectors (DCFSs), such as DCOs or DDSs, may occur by periodic transmission of control words from the master clock to the slave clocks. To allow enhanced control over the output of the slave clocks, the frequency of the local oscillator used to generate the synthesized output of the master clock may also be conveyed to the slave clocks to allow a second level of control to take place. The second level of control allows the local oscillators at the slave clocks to lock onto the frequency of the master local oscillator to thereby allow the slave local oscillators to operate the slave DCFSs using the same local oscillator frequency. The first level of control synchronizes operation of the DCFSs while the second level control prevents instabilities in the local oscillators from causing long term drift between the slave and master clock outputs. Timestamps may be used to synchronize the master and slave local oscillators.

摘要翻译： 通过从主时钟到从时钟的控制字的周期性传输，可能会发生对从属数字控制频率选择器（DCFS）（如DCO或DDS）的操作的第一级控制。 为了增强对从时钟的输出的控制，用于产生主时钟的合成输出的本地振荡器的频率也可以被传送到从时钟，以允许进行第二级控制。 第二级控制允许从时钟的本地振荡器锁定到主本地振荡器的频率，从而允许从局部振荡器使用相同的本地振荡器频率来操作从DCFS。 第一级控制同步DCFS的操作，而第二级控制防止本地振荡器中的不稳定性引起从机和主时钟输出之间的长期漂移。 时间戳可用于同步主从本地振荡器。

公开(公告)号：US20080231511A1

公开(公告)日：2008-09-25

申请号：US11689660

申请日：2007-03-22

申请人： Delfin Y. Montuno ,  James Aweya ,  Michel Ouellette ,  Kent Felske

发明人： Delfin Y. Montuno ,  James Aweya ,  Michel Ouellette ,  Kent Felske

IPC分类号： G01S1/24 ,  G01S3/02

CPC分类号： G01S5/06

摘要： A novel beacon-based position location technique for efficient location discovery of untethered clients in packet networks is disclosed. The position location technique utilizes the time-difference-of-arrival (“TDOA”) of a first signal transmitted by a beacon of known location and a second signal transmitted by an untethered client. The TDOA of these two signals is measured locally by at least three non-collinear signal receivers. For each of the receivers, the TDOA is used to calculate a perceived distance to the client. A circle is then calculated for each receiver, centered on the receiver and having a radius equal to the perceived distance. At least two lines defined by points of intersection of the calculated circles are then calculated. The point of intersection of the lines represents the location of the client. To facilitate operation, the signal receivers may be arranged on vertices which define a convex polygon as viewed from above. The location system requires no time (time-of-day) synchronization of the signal receivers, and only the coarse frequency synchronization, on the order of, tens of parts-per-million (ppm). The technique even works for the case where the signal receivers are run asynchronously, provided the frequency accuracies of the signal receivers are on the order of about 50ppm or better. The technique introduces no communication overhead for the beacon, client and signal receivers. Further, the computation overhead at the signal receivers is relatively low because the location detection algorithm involves only simple algebraic operations over scalar values.

摘要翻译： 公开了一种新颖的基于信标的位置定位技术，用于在分组网络中无阻塞客户端的有效位置发现。 位置定位技术利用由已知位置的信标发送的第一信号的到达时间差（“TDOA”）和由无阻塞客户端发送的第二信号。 这两个信号的TDOA由至少三个非共线信号接收器本地测量。 对于每个接收机，TDOA用于计算到客户端的感知距离。 然后，以接收机为中心并且具有等于感知距离的半径的每个接收机计算一个圆。 然后计算由计算圆的交点定义的至少两条线。 线的交点表示客户端的位置。 为了便于操作，信号接收器可以被布置在从上方观察的限定凸多边形的顶点上。 定位系统不需要信号接收机的时间（时间）同步，只需要几十分之一百万分之几的粗略频率同步（ppm）。 该技术甚至适用于信号接收机异步运行的情况，只要信号接收机的频率精度约为50ppm或更高。 该技术不引入信标，客户端和信号接收机的通信开销。 此外，信号接收机的计算开销相对较低，因为位置检测算法仅涉及标量值的简单代数运算。

公开(公告)号：US20080144515A1

公开(公告)日：2008-06-19

申请号：US11609966

申请日：2006-12-13

申请人： Michel Ouellette ,  James Aweya ,  Delfin Y. Montuno ,  Kent Felske

发明人： Michel Ouellette ,  James Aweya ,  Delfin Y. Montuno ,  Kent Felske

IPC分类号： H04J3/14

CPC分类号： H04L41/12 ,  H04J3/0679

摘要： Algorithms and data structure are described for constructing and maintaining a clock distribution tree (“CDT”) for timing loop avoidance. The CDT algorithms and data structure allows a node to make an automated and unattended path switch to the most desirable clock source in the network. In response to a network topology change, a clock root node distributes new clock paths to all nodes in the network. In particular, the 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.

摘要翻译： 描述了用于构建和维护用于定时回路的时钟分布树（“CDT”）的算法和数据结构。 CDT算法和数据结构允许节点将自动和无人值守的路径切换到网络中最理想的时钟源。 响应于网络拓扑变化，时钟根节点将新的时钟路径分配给网络中的所有节点。 特别地，根节点通过构建时钟源拓扑树来计算每个受影响节点的新时钟路径，并且从该树中识别来自相对于该网络节点的较高或相等层的时钟源到网络节点的路径。 根节点然后向每个节点发送一个网络消息，指示节点应该使用的新路径。 每个节点接收消息，并将新路径与现有路径进行比较。 如果路径不同，则节点获取刚刚在消息中接收到的新路径。 如果路径相同，则节点不执行任何操作并丢弃该消息。

公开(公告)号：US07231445B1

公开(公告)日：2007-06-12

申请号：US09713319

申请日：2000-11-16

申请人： James Aweya ,  Michel Ouellette ,  Delfin Y. Montuno ,  Bernard J. Doray ,  Kent E. Felske

发明人： James Aweya ,  Michel Ouellette ,  Delfin Y. Montuno ,  Bernard J. Doray ,  Kent E. Felske

IPC分类号： G06F15/173

CPC分类号： G06Q10/00 ,  G06Q50/18 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/1019

摘要： A technique for adaptively distributing a web server request in a system having a plurality of web servers is disclosed. In one embodiment, the technique is realized by first generating a web server request distribution function for each of the plurality of web servers based upon performance measures of each of the plurality of web servers, wherein each of the plurality of web servers is assigned a respective probability range based upon each respective web server request distribution function. A random probability number is then generated for a web server request. The particular probability range encompassing the random probability number is then determined so as to identify the corresponding web server to which the web server request is to be distributed.

摘要翻译： 公开了一种用于在具有多个web服务器的系统中自适应地分发web服务器请求的技术。 在一个实施例中，该技术通过基于多个web服务器中的每一个的性能测量来首先为多个web服务器中的每一个生成web服务器请求分发功能来实现，其中多个web服务器中的每一个被分配相应的 基于每个相应的web服务器请求分发功能的概率范围。 然后为Web服务器请求生成随机概率数。 然后确定包含随机概率数的特定概率范围，以便识别要分发web服务器请求的相应web服务器。