公开(公告)号：US08437284B2

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

申请号：US11685181

申请日：2007-03-12

申请人： Robert Plamondon ,  Michael Ovsiannikov ,  Allen Samuels

发明人： Robert Plamondon ,  Michael Ovsiannikov ,  Allen Samuels

IPC分类号： H04B3/36 ,  G06F11/00

CPC分类号： H04L47/2466 ,  H04L1/1887 ,  H04L1/189 ,  H04L41/00 ,  H04L41/12 ,  H04L67/28 ,  H04L67/2876 ,  H04L69/16 ,  H04L69/166 ,  H04L2001/0092

摘要： Systems and methods for utilizing transaction boundary detection methods in queuing and retransmission decisions relating to network traffic are described. By detecting transaction boundaries and sizes, a client, server, or intermediary device may prioritize based on transaction sizes in queuing decisions, giving precedence to smaller transactions which may represent interactive and/or latency-sensitive traffic. Further, after detecting a transaction boundary, a device may retransmit one or more additional packets prompting acknowledgements, in order to ensure timely notification if the last packet of the transaction has been dropped. Systems and methods for potentially improving network latency, including retransmitting a dropped packet twice or more in order to avoid incurring additional delays due to a retransmitted packet being lost are also described.

公开(公告)号：US08255570B2

公开(公告)日：2012-08-28

申请号：US11685172

申请日：2007-03-12

申请人： Allen Samuels ,  Richard Jensen ,  Zubin Dittia ,  Dan Decasper ,  Michael Ovsiannikov ,  Robert Plamondon

发明人： Allen Samuels ,  Richard Jensen ,  Zubin Dittia ,  Dan Decasper ,  Michael Ovsiannikov ,  Robert Plamondon

IPC分类号： G06F15/16

CPC分类号： H04L67/1095 ,  H04L69/04

摘要： Systems and methods of storing previously transmitted data and using it to reduce bandwidth usage and accelerate future communications are described. By using algorithms to identify long compression history matches, a network device may improve compression efficiently and speed. A network device may also use application specific parsing to improve the length and number of compression history matches. Further, by sharing compression histories, compression history indexes and caches across multiple devices, devices can utilize data previously transmitted to other devices to compress network traffic. Any combination of the systems and methods may be used to efficiently find long matches to stored data, synchronize the storage of previously sent data, and share previously sent data among one or more other devices.

摘要翻译： 描述了存储先前传输的数据并使用它来减少带宽使用并加速未来通信的系统和方法。 通过使用算法来识别长的压缩历史匹配，网络设备可以有效地提高压缩速度和速度。 网络设备还可以使用应用特定解析来改进压缩历史匹配的长度和数量。 此外，通过在多个设备之间共享压缩历史，压缩历史索引和高速缓存，设备可以利用之前传送到其他设备的数据来压缩网络流量。 可以使用系统和方法的任何组合来有效地找到与存储的数据的长匹配，同步先前发送的数据的存储，以及在一个或多个其他设备之间共享先前发送的数据。

公开(公告)号：US20120089579A1

公开(公告)日：2012-04-12

申请号：US12901385

申请日：2010-10-08

申请人： Sandeep Ranade ,  Allen Samuels

发明人： Sandeep Ranade ,  Allen Samuels

IPC分类号： G06F17/00

CPC分类号： G06F16/1744 ,  G06F16/183

摘要： A cloud storage appliance separates a point-in-time copy of a storage system into payload data chunks and metadata data chunks. The cloud storage appliance identifies a plurality of payload data chunks that have not been saved to a storage cloud. The cloud storage appliance compresses the plurality of payload data chunks. The cloud storage appliance groups the plurality of compressed payload data chunks into one or more cloud files, wherein each of the one or more cloud files is formatted for storage on the storage cloud. The cloud storage appliance then sends the one or more cloud files to the storage cloud.

摘要翻译： 云存储设备将存储系统的时间点副本分为有效载荷数据块和元数据数据块。 云存储设备识别尚未保存到存储云的多个有效载荷数据块。 云存储设备压缩多个有效载荷数据块。 云存储设备将多个压缩的有效载荷数据块组合成一个或多个云文件，其中一个或多个云文件中的每一个被格式化以存储在存储云上。 然后，云存储设备将一个或多个云文件发送到存储云。

公开(公告)号：US07664857B2

公开(公告)日：2010-02-16

申请号：US11685154

申请日：2007-03-12

申请人： Mike Ovsiannikov ,  Dan Decasper ,  Robert Plamondon ,  Allen Samuels

发明人： Mike Ovsiannikov ,  Dan Decasper ,  Robert Plamondon ,  Allen Samuels

IPC分类号： H04L12/56

CPC分类号： H04L69/16 ,  H04L41/0803 ,  H04L41/12 ,  H04L43/0817 ,  H04L63/0281 ,  H04L63/029 ,  H04L63/164 ,  H04L63/166 ,  H04L67/28 ,  H04L67/2876 ,  H04L69/169 ,  H04L69/22

摘要： The solution of the present invention provides systems and methods for encoding information into an Internet Protocol identification field (IPID) of an IP layer header of a network packet in a manner acceptable to many or all of the network devices that encounter the encoded packet. In one embodiment, the solution described herein encodes the IP identification field of the IPID header with information to be communicated between devices. Appliances may use the encoded IP field as a signal or a means for a low-bandwidth subcarrier of data between the appliances that is transparent to any intervening network equipment. For example, the encoded field may be used to announce or probe the presence of a device, a functionality or capability of device or to indicate a type or speed of a network connection of a port on a device.

摘要翻译： 本发明的解决方案提供了将信息编码到网络分组的IP层报头的因特网协议标识字段（IPID）中的系统和方法，该方法可以以许多或所有遇到编码分组的网络设备的方式接受。 在一个实施例中，本文描述的解决方案使用要在设备之间传送的信息来对IPID头部的IP标识字段进行编码。 设备可以使用编码的IP字段作为对任何中间网络设备透明的设备之间的数据的低带宽子载波的信号或装置。 例如，编码字段可以用于宣布或探测设备的存在，设备的功能或能力，或者指示设备上的端口的网络连接的类型或速度。

公开(公告)号：US07542471B2

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

申请号：US10696507

申请日：2003-10-29

申请人： Allen Samuels ,  Paul Sutter

发明人： Allen Samuels ,  Paul Sutter

IPC分类号： H04L12/28

CPC分类号： H04L69/16 ,  H04L67/28 ,  H04L67/2876 ,  H04L69/166

摘要： Network endpoints using TCP/IP operate to determine the maximum transmission unit (MTU) of the path between them. This determination is done so as to avoid the expensive IP fragmentation that will occur when transitioning links with a smaller MTU size. The standard method of determining the path MTU (PMTU) has several known deficiencies, including: inefficient use of bandwidth as proper operation will likely result in the loss of one or more packets and difficulty of implementation as the reverse channel communication mechanism, reception of ICMP messages indicating the discarding of unfragmentable packets, is frequently blocked by firewalls and other security apparatus. A method of determining the PMTU between intermediate proxies is disclosed that does not require reception of ICMP messages or the inefficient use of bandwidth due to the presumed dropping of packets with valid data.

摘要翻译： 使用TCP / IP的网络端点可以确定它们之间路径的最大传输单元（MTU）。 进行此确定以避免在以较小的MTU大小转换链路时将发生昂贵的IP分段。 确定路径MTU（PMTU）的标准方法有几个已知的缺陷，包括：作为正确的操作，带宽的低效使用可能导致一个或多个分组的丢失和难以实现的反向信道通信机制，ICMP的接收 指示丢弃未分片的消息的消息经常被防火墙和其他安全设备阻止。 公开了一种确定中间代理之间的PMTU的方法，其不需要接收ICMP消息或由于假设丢弃具有有效数据的分组而带宽的低效使用。

公开(公告)号：US20090067440A1

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

申请号：US11851934

申请日：2007-09-07

申请人： Sanjay CHADDA ,  Allen SAMUELS ,  Dan DECASPER ,  Zubin DITTIA ,  Shiva ANKAM

发明人： Sanjay CHADDA ,  Allen SAMUELS ,  Dan DECASPER ,  Zubin DITTIA ,  Shiva ANKAM

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

CPC分类号： H04L45/74 ,  H04L29/08729 ,  H04L63/0227 ,  H04L63/0236 ,  H04L63/10 ,  H04L67/2804

摘要： The solution described herein provides systems and methods for the interoperability of network processing programs that process network packets at different levels of the network stack. This solution bridges the communications of a network packet between a first network processing program operating at a first level of a network stack in an intermediary and a second network processing program operating at a second level of the network stack of the intermediary. The first network processing program may modify an incoming network packet so that the packet may traverse the network stack to an upper level of the stack to the second network processing program. After processing the network packet at the upper layers of the stack or by the second network processing program, the first network processing program modifies the network pack in order to transmit the packet to the intended destination while traversing the intermediary.

摘要翻译： 本文描述的解决方案提供了用于在网络堆栈的不同级别处理网络分组的网络处理程序的互操作性的系统和方法。 该解决方案将网络分组的通信桥接在在中间体的网络堆栈的第一级操作的第一网络处理程序和在中间体的网络堆栈的第二级别操作的第二网络处理程序之间。 第一网络处理程序可以修改传入网络分组，使得分组可以将网络堆栈穿过堆栈的上层到第二网络处理程序。 在堆栈的上层或第二网络处理程序处理网络分组之后，第一网络处理程序修改网络包，以便在穿过中间体时将分组发送到预定的目的地。

公开(公告)号：US20080224902A1

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

申请号：US11685157

申请日：2007-03-12

申请人： Allen Samuels ,  Richard Jensen ,  Zubin Dittia ,  Dan Decasper ,  Michael Ovsiannikov ,  Robert Plamondon

发明人： Allen Samuels ,  Richard Jensen ,  Zubin Dittia ,  Dan Decasper ,  Michael Ovsiannikov ,  Robert Plamondon

IPC分类号： H03M7/38

CPC分类号： H03M7/3084

摘要： Systems and methods of storing previously transmitted data and using it to reduce bandwidth usage and accelerate future communications are described. By using algorithms to identify long compression history matches, a network device may improve compression efficiently and speed. A network device may also use application specific parsing to improve the length and number of compression history matches. Further, by sharing compression histories, compression history indexes and caches across multiple devices, devices can utilize data previously transmitted to other devices to compress network traffic. Any combination of the systems and methods may be used to efficiently find long matches to stored data, synchronize the storage of previously sent data, and share previously sent data among one or more other devices.

摘要翻译： 描述了存储先前传输的数据并使用它来减少带宽使用并加速未来通信的系统和方法。 通过使用算法来识别长的压缩历史匹配，网络设备可以有效地提高压缩速度和速度。 网络设备还可以使用应用特定解析来改进压缩历史匹配的长度和数量。 此外，通过在多个设备之间共享压缩历史，压缩历史索引和高速缓存，设备可以利用之前传送到其他设备的数据来压缩网络流量。 可以使用系统和方法的任何组合来有效地找到与存储的数据的长匹配，同步先前发送的数据的存储，以及在一个或多个其他设备之间共享先前发送的数据。

公开(公告)号：US20070206621A1

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

申请号：US11685183

申请日：2007-03-12

申请人： Robert Plamondon ,  Michael Ovsiannikov ,  Allen Samuels

发明人： Robert Plamondon ,  Michael Ovsiannikov ,  Allen Samuels

IPC分类号： H04L12/28

CPC分类号： H04L1/1887 ,  H04L1/189 ,  H04L41/00 ,  H04L41/12 ,  H04L43/0829 ,  H04L47/40 ,  H04L67/28 ,  H04L67/2876 ,  H04L69/16 ,  H04L69/166 ,  H04L2001/0092

摘要： Systems and methods for utilizing transaction boundary detection methods in queuing and retransmission decisions relating to network traffic are described. By detecting transaction boundaries and sizes, a client, server, or intermediary device may prioritize based on transaction sizes in queuing decisions, giving precedence to smaller transactions which may represent interactive and/or latency-sensitive traffic. Further, after detecting a transaction boundary, a device may retransmit one or more additional packets prompting acknowledgements, in order to ensure timely notification if the last packet of the transaction has been dropped. Systems and methods for potentially improving network latency, including retransmitting a dropped packet twice or more in order to avoid incurring additional delays due to a retransmitted packet being lost are also described.

摘要翻译： 描述了利用事务边界检测方法在与网络流量相关的排队和重传决定中的系统和方法。 通过检测事务边界和大小，客户端，服务器或中间设备可以基于排队决策中的事务大小进行优先级排序，优先考虑可表示交互式和/或等待时间敏感流量的较小事务。 此外，在检测到交易边界之后，设备可以重传一个或多个附加分组，提示确认，以便确保交易的最后一个分组已经被丢弃时及时通知。 还描述了用于潜在地改善网络延迟的系统和方法，包括重发丢弃的分组两次或更多，以避免由于重传的分组丢失引起的附加延迟。

公开(公告)号：US07216376B2

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

申请号：US10804445

申请日：2004-03-19

申请人： Allen Samuels

发明人： Allen Samuels

IPC分类号： A47K13/14

CPC分类号： A47K11/105 ,  A47K4/00 ,  A47K11/02 ,  A47K11/04 ,  A47K13/14 ,  A61B10/0038 ,  Y02A50/454

摘要： The present invention comprises a disposable hygiene device with a toilet seat with a top and bottom surfaces, where the toilet seat folds for storage before or after use. A receptacle is attached to the bottom surface of the toilet seat. After use, an adhesive on the top surface of the toilet seat is exposed by the removal of a protective layer. The toilet seat may then be folded onto itself to seal the hygiene device for easy disposal. The toilet seat may also include handles or an extension to ease proper orientation and use of the disposable hygiene device. The present invention also includes hygiene stations, preferably portable, that may be used with the disposable hygiene device, hygiene stations that include rotatable, extendable and height adjustable bathroom fixtures, and hygiene stations have a common connection point for inputs and outputs.

摘要翻译： 本发明包括具有带有顶部和底部表面的马桶座的一次性卫生装置，其中马桶座圈在使用之前或之后折叠。 容器附接到马桶座的底面。 使用后，通过除去保护层，使马桶座顶面上的粘合剂露出。 然后可以将马桶座圈折叠到其上以密封卫生装置以便于处理。 马桶座还可以包括手柄或延伸部，以便于一次性卫生装置的正确定向和使用。 本发明还包括可与一次性卫生装置一起使用的卫生站，优选便携式的卫生站，卫生站包括可旋转的，可延伸的和高度可调的卫生间装置，卫生站具有用于输入和输出的公共连接点。

公开(公告)号：US5021985A

公开(公告)日：1991-06-04

申请号：US467879

申请日：1990-01-19

申请人： Larry Hu ,  Ting Chuk ,  John McLeod ,  Mark Birman ,  Allen Samuels ,  George K. Chu

发明人： Larry Hu ,  Ting Chuk ,  John McLeod ,  Mark Birman ,  Allen Samuels ,  George K. Chu

IPC分类号： G06F1/14 ,  G06F7/00 ,  G06F9/38

CPC分类号： G06F9/3877 ,  G06F9/3836 ,  G06F9/3869

摘要： A programmable latency (a programmable number of clock cycles) needed for an operation completion. The required latency for a pipe is determined from a formula including the system clock cycle time which the unit will be specified to operate under. The latency is preprogrammed by setting the count of a timer accordingly to provide at least the minimum number of clock cycles necessary to cover the time required to do the computation. Separate timers are independently set for arithmetic logic unit (ALU) operations, multiply operations, logical operations and divide and square root operations.

摘要翻译： 操作完成所需的可编程延迟（可编程时钟周期数）。 管道所需的等待时间由包括系统时钟周期时间的公式确定，该单位将被指定在下面进行操作。 通过相应地设置定时器的计数来预编程等待时间，以提供至少需要的最小时钟周期数来覆盖进行计算所需的时间。 单独的定时器被独立地设置用于算术逻辑单元（ALU）操作，乘法运算，逻辑运算和除法和平方根运算。