公开(公告)号：US08369220B1

公开(公告)日：2013-02-05

申请号：US12006128

申请日：2007-12-31

申请人： Bakul Khanna ,  Jozef Babiarz ,  Ali Labed ,  Delfin Montuno ,  Hesham El-Bakoury

发明人： Bakul Khanna ,  Jozef Babiarz ,  Ali Labed ,  Delfin Montuno ,  Hesham El-Bakoury

IPC分类号： H04L12/26

CPC分类号： H04L45/22 ,  H04L41/5022 ,  H04L41/5087 ,  H04L43/08 ,  H04L43/0888 ,  H04L45/10 ,  H04L45/125 ,  H04L45/24 ,  H04L45/38

摘要： To route a flow of elastic traffic, plural candidate paths are identified for the flow of elastic traffic. A particular path from among the plural candidate paths is selected to route the flow of elastic traffic according to criteria including numbers of flows on respective candidate paths and measured performances of the respective candidate paths.

摘要翻译： 为了布置弹性交通流，针对弹性交通流量识别出多个候选路径。 选择多个候选路径中的特定路径，以根据包括各个候选路径上的流数和各个候选路径的测量性能的标准来路由弹性业务流。

公开(公告)号：US08934357B2

公开(公告)日：2015-01-13

申请号：US13044598

申请日：2011-03-10

申请人： Ravishankar Ravindran ,  Francois Blouin ,  Delfin Montuno

发明人： Ravishankar Ravindran ,  Francois Blouin ,  Delfin Montuno

IPC分类号： H04L1/00 ,  H04L12/24

CPC分类号： H04L41/5006 ,  H04L41/046 ,  H04L41/5003 ,  H04L41/5009 ,  H04L41/5038 ,  H04L41/5054 ,  H04L41/5058

摘要： Domains (multiple collaborating service providers) create service offerings between pairs of edge nodes that interconnect with other domains in the network. The service offerings may specify the available bandwidth, quality of service, reliability, available security, price, subscriber and service contextual specific and other SLA information. When a new service is to be created, the service definition is used along with information about the available service offerings to determine a set of networks to implement the service. Information associated with the service offerings may be flooded to all other networks. Alternatively, the service offering information may be provided to a trusted third party (SLA broker) which may provide SLA services on the network to select sets of domains to implement inter-domain services, and may also proxy to set up the service for the SLA requesting party. A hybrid approach may also be used wherein some SLA information is flooded and other information is retained in secret and provided only to the SLA broker.

公开(公告)号：US08040906B2

公开(公告)日：2011-10-18

申请号：US12490187

申请日：2009-06-23

申请人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

发明人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

IPC分类号： H04L12/28

CPC分类号： H04L45/122 ,  H04L12/185 ,  H04L45/02 ,  H04L45/12 ,  H04L45/16 ,  H04L45/48

摘要： A set of critical nodes or links is identified on the network through which most of the shortest paths on the network occur. Each node compares their distance to end points on the network with a distance between the end points and each of the distinct critical nodes. Where the distance between the end points and the critical nodes is shorter than the distance between the end points and the node, the node is not on the shortest path and does not install forwarding state. Where the distance between the end points and the critical node is larger than or equal to the distance between the end points and the node, the node may be on the shortest path between the pair of end nodes and installs forwarding state. Installation of forwarding state may cause packet duplication, but determining forwarding state is dramatically simplified. The level of duplication may be reduced by selecting a larger number of critical nodes on the network.

摘要翻译： 在网络上识别出一组关键节点或链路，通过该关键节点或链路，网络上的大多数最短路径都会发生。 每个节点将其距离与网络上的终点进行比较，并在终点与每个不同关键节点之间建立距离。 终点与关键节点之间的距离短于端点与节点之间的距离，节点不在最短路径上，不会安装转发状态。 在端点和关键节点之间的距离大于或等于端点和节点之间的距离的情况下，节点可以在一对端节点之间的最短路径上，并安装转发状态。 转发状态的安装可能会导致数据包复制，但是显着地简化了确定转发状态。 可以通过在网络上选择更多的关键节点来减少重复级别。

公开(公告)号：US20090279444A1

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

申请号：US12152085

申请日：2008-05-12

申请人： Ravishankar Ravindran ,  Francois Blouin ,  Delfin Montuno

发明人： Ravishankar Ravindran ,  Francois Blouin ,  Delfin Montuno

IPC分类号： H04L12/26

CPC分类号： H04L41/5006 ,  H04L41/046 ,  H04L41/5003 ,  H04L41/5009 ,  H04L41/5038 ,  H04L41/5054 ,  H04L41/5058

摘要： Domains (multiple collaborating service providers) create service offerings between pairs of edge nodes that interconnect with other domains in the network. The service offerings may specify the available bandwidth, quality of service, reliability, available security, price, subscriber and service contextual specific and other SLA information. When a new service is to be created, the service definition is used along with information about the available service offerings to determine a set of networks to implement the service. Information associated with the service offerings may be flooded to all other networks. Alternatively, the service offering information may be provided to a trusted third party (SLA broker) which may provide SLA services on the network to select sets of domains to implement inter-domain services, and may also proxy to set up the service for the SLA requesting party. A hybrid approach may also be used wherein some SLA information is flooded and other information is retained in secret and provided only to the SLA broker.

摘要翻译： 域（多个协作服务提供商）在与网络中的其他域互连的边缘节点之间创建服务提供。 服务提供可以指定可用带宽，服务质量，可靠性，可用安全性，价格，订户和服务上下文特定和其他SLA信息。 当要创建新服务时，将使用服务定义以及有关可用服务产品的信息来确定一组实现该服务的网络。 与服务提供相关联的信息可能被洪泛到所有其他网络。 或者，可以将服务提供信息提供给可以在网络上提供SLA服务以选择一组域以实现域间服务的可信第三方（SLA代理），并且还可以代理为SLA建立服务 请求方。 还可以使用混合方法，其中一些SLA信息被淹没，并且其他信息被保密并且仅提供给SLA代理。

公开(公告)号：US07492732B2

公开(公告)日：2009-02-17

申请号：US11294146

申请日：2005-12-05

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

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

IPC分类号： H04B7/212

CPC分类号： H04J3/0658

摘要： Where a common network clock is available at both a TDM receiver and a TDM transmitter which communicate via a packet network, differential clock recovery can be accomplished by matching the number of service clock pulses in a network reference clock period at the transmitter and receiver. In one embodiment the transmitter need only send a counter value from a counter that is clocked and reset, respectively, by the service clock and network reference clock, thereby allowing use of different types of oscillators, both analog and digital, to be implemented at the transmitter and receiver. The technique is also general enough to be applied in a wide variety of packet networks including but not limited to IP, MPLS and Ethernet. In an alternative embodiment, a faster derived network clock fdnc drives both the transmitter and receiver counters, which in turn are reset, respectively by the slower transmitter service clock fsc and slower receiver service clock frc.

摘要翻译： 在通过分组网络进行通信的TDM接收机和TDM发射机都可以使用公共网络时钟的情况下，差分时钟恢复可以通过在发射机和接收机的网络参考时钟周期内匹配服务时钟脉冲的数量来实现。 在一个实施例中，发射机仅需要通过服务时钟和网络参考时钟分别从计时器发送计数器值并将其复位，从而允许使用不同类型的模拟和数字振荡器来实现 发射机和接收机。 该技术也足以应用于各种分组网络，包括但不限于IP，MPLS和以太网。 在替代实施例中，更快的导出网络时钟fdnc驱动发射机和接收机计数器，发射机和接收机计数器又分别被较慢的发射机业务时钟fsc和较慢的接收机业务时钟frc复位。

公开(公告)号：US20070097947A1

公开(公告)日：2007-05-03

申请号：US11362697

申请日：2006-02-27

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

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

IPC分类号： H04J3/06

CPC分类号： H04J3/065 ,  H04J3/0667

摘要： The invention includes a technique for clock recovery in a network having master and slave clocks in respective Time Division Multiplexing (“TDM”) network segments which are interconnected by a non-TDM segment. Master clock timestamps are sent to the slave. The slave measures a master clock timestamp inter-arrival interval, and sends slave clock timestamps to the master. The master measures a slave clock timestamp inter-arrival interval, and sends that slave clock timestamp inter-arrival interval to the slave. The slave then calculates an error signal based at least in-part on the difference between the master clock timestamp inter-arrival interval and the slave clock timestamp inter-arrival interval, and employs the difference to recover the first service clock in the second TDM segment.

摘要翻译： 本发明包括一种用于在通过非TDM分段互连的相应时分复用（“TDM”）网段中的主时钟和从时钟的网络中的时钟恢复技术。 主时钟时间戳被发送到从站。 从站测量主时钟时间戳到达间隔时间，并向主机发送从时钟时间戳。 主机测量从时钟时间戳到达间隔时间，并将从属时钟时间戳到到达间隔发送到从机。 然后，从设备至少部分地基于主时钟间隔到达间隔和从时钟时间戳到达间隔之间的差异来计算误差信号，并且采用差异来恢复第二TDM段中的第一服务时钟 。

公开(公告)号：US20050157724A1

公开(公告)日：2005-07-21

申请号：US11034839

申请日：2005-01-14

申请人： Delfin Montuno ,  James Aweya

发明人： Delfin Montuno ,  James Aweya

IPC分类号： H03M7/40 ,  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）的搜索关键字进行比较，其中将位设置为多个 对应于具有等于或小于多个预定义代码中的最长预定义代码的长度的比特串中的比特的可能比特组合的比特位置，并且由可能的比特组合的长度和比特的数值 组合，以识别搜索关键字中的公共活动比特位置和对应于具有大于对应于公共活动比特位置的所述预定义码的所有其他长度的预定义码之一的搜索掩码。

公开(公告)号：US09064093B1

公开(公告)日：2015-06-23

申请号：US10745065

申请日：2003-12-22

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

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

IPC分类号： G06F21/00

CPC分类号： G06F21/00 ,  G06F21/16 ,  G06F2221/0788

摘要： A system in which data signatures are used to identify copyrighted content passing through a network. The data signatures are derived from files containing copyrighted content to be identified. The signatures are used to search within peer-to-peer data streams flowing through one or more network nodes in a communications network. Any specific technique may be used for pattern recognition between the signatures and the monitored traffic. When a particular file of interest is identified, the system may operate to perform one or more of several possible actions, including stopping the transmission, allowing the transmission but recording the event, making an offer to the recipient allowing them to legally purchase the file, or sending alternative information or intentionally corrupting the information to render it useless to the recipient.

摘要翻译： 使用数据签名来识别经过网络的受版权保护的内容的系统。 数据签名是从包含要识别的受版权保护的内容的文件导出的。 这些签名用于在流经通信网络中的一个或多个网络节点的对等数据流中搜索。 任何具体技术可用于签名和被监视业务之间的模式识别。 当识别出感兴趣的特定文件时，系统可以操作以执行几种可能的动作中的一种或多种，​​包括停止传输，允许传输但记录事件，向接收者提供允许他们合法购买文件的提议， 或发送替代信息或故意破坏信息，使其对接收者无效。

公开(公告)号：US07424546B1

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

申请号：US10426286

申请日：2003-04-30

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

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

IPC分类号： G06F15/16 ,  G06F15/173 ,  G06F11/00

CPC分类号： H04L47/10 ,  H04L43/0894 ,  H04L43/16 ,  H04L47/12 ,  H04L47/193 ,  H04L47/31 ,  H04L47/32 ,  H04L69/02 ,  H04L69/28

摘要： Disclosed is an Active Queue Management method and apparatus which uses traffic rate information for congestion control. Using a nonlinear fluid-flow model of Traffic Control Protocol, a proportional-integral controller in a closed loop configuration with gain settings characterized for stable operation allows a matching of the aggregate rate of the active TCP connections to the available capacity. Further disclosed is a method for calculation of the regime of gain settings for which stable operation of a given network obtains. This approach allows for capacity matching while maintaining minimal queue size and high link utilization.

摘要翻译： 公开了一种使用业务速率信息进行拥塞控制的活动队列管理方法和装置。 使用流量控制协议的非线性流体流模型，闭环配置中的比例积分控制器，其特征在于稳定操作的增益设置允许活动TCP连接的总速率与可用容量的匹配。 还公开了一种用于计算给定网络的稳定操作获得的增益设置的方案的方法。 这种方法允许容量匹配，同时保持最小的队列大小和高的链路利用率。

公开(公告)号：US07359324B1

公开(公告)日：2008-04-15

申请号：US10796321

申请日：2004-03-09

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

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

IPC分类号： H04L12/26

CPC分类号： H04L43/087 ,  H04L43/0852

摘要： A method for dynamically adjusting jitter buffer size according to buffer fill dynamics is disclosed. In one embodiment, an upper threshold and lower threshold for the jitter buffer are identified, wherein the lower buffer threshold identifies a minimum desirable number of packets in the jitter buffer, and the upper buffer threshold identifies a maximum desirable number of packets in the jitter buffer. Operating characteristics of the jitter buffer are monitored to identify instances when the jitter buffer size falls below or exceeds the desired thresholds. When a threshold is crossed, the adaptive algorithm alters the playback offset time, by introducing or deleting packets into the transmission path, to allow the jitter buffer size to return to a desirable target size within the threshold boundaries.

摘要翻译： 公开了一种根据缓冲区填充动态动态调整抖动缓冲区大小的方法。 在一个实施例中，识别抖动缓冲器的上阈值和下阈值，其中下缓冲器阈值标识抖动缓冲器中最小期望数量的分组，并且高缓冲器阈值识别抖动缓冲器中的最大期望数量的分组 。 当抖动缓冲区大小低于或超过所需阈值时，监视抖动缓冲区的操作特性以识别实例。 当超过阈值时，自适应算法通过将分组引入或删除到传输路径来改变播放偏移时间，以允许抖动缓冲器大小在阈值边界内返回到期望的目标大小。