公开(公告)号：US20080005336A1

公开(公告)日：2008-01-03

申请号：US11740912

申请日：2007-04-26

申请人： Bram Cohen ,  Steven Hazel ,  Gregory Hazel ,  David Harrison

发明人： Bram Cohen ,  Steven Hazel ,  Gregory Hazel ,  David Harrison

IPC分类号： G06F15/16

CPC分类号： H04L67/06 ,  H04L67/104 ,  H04L67/1085 ,  H04L67/32

摘要： Transfer policy management methods in a peer-to-peer networking environment such as BitTorrent are provided. A download TPM maximizes the usage of available bandwidth, while focusing on as few torrents as possible. For a given list of torrents, a peer in accordance with the present invention determines how many download connections to maintain at a given time in order to maximize usage of bandwidth. If the variance of per-connection bandwidths exceeds a threshold, more connections are added until either variance does not exceed the threshold or a maximum number of connections are established. A seeding peer determines when to reduce the number of files being seeded by monitoring its average upload rate per torrent. If its average rate falls below a threshold, then the peer stops seeding a file. The file that the peer stops seeding is one to which the peer is making the smallest overall contribution.

摘要翻译： 提供了诸如BitTorrent之类的对等网络环境中的传输策略管理方法。 下载TPM最大限度地利用可用带宽，同时专注于尽可能少的洪流。 对于给定的洪流列表，根据本发明的对等体确定在给定时间维持多少个下载连接以最大化带宽的使用。 如果每个连接带宽的差异超过阈值，则会增加更多的连接，直到任一方差不超过阈值或者建立最大连接数。 播种对等方通过监视其每个洪流的平均上传速率来确定何时减少播种的文件数量。 如果平均速率低于阈值，则对等体停止播种文件。 对等体停止播种的文件是对等体做出最小总体贡献的文件。

公开(公告)号：US08738778B2

公开(公告)日：2014-05-27

申请号：US11740912

申请日：2007-04-26

申请人： Bram Cohen ,  Steven Hazel ,  Gregory Hazel ,  David Harrison

发明人： Bram Cohen ,  Steven Hazel ,  Gregory Hazel ,  David Harrison

IPC分类号： G06F15/16

CPC分类号： H04L67/06 ,  H04L67/104 ,  H04L67/1085 ,  H04L67/32

摘要： Transfer policy management methods in a peer-to-peer networking environment such as BitTorrent are provided. A download TPM maximizes the usage of available bandwidth, while focusing on as few torrents as possible. For a given list of torrents, a peer in accordance with the present invention determines how many download connections to maintain at a given time in order to maximize usage of bandwidth. If the variance of per-connection bandwidths exceeds a threshold, more connections are added until either variance does not exceed the threshold or a maximum number of connections are established. A seeding peer determines when to reduce the number of files being seeded by monitoring its average upload rate per torrent. If its average rate falls below a threshold, then the peer stops seeding a file. The file that the peer stops seeding is one to which the peer is making the smallest overall contribution.

摘要翻译： 提供了诸如BitTorrent之类的对等网络环境中的传输策略管理方法。 下载TPM最大限度地利用可用带宽，同时专注于尽可能少的洪流。 对于给定的洪流列表，根据本发明的对等体确定在给定时间维持多少个下载连接以最大化带宽的使用。 如果每个连接带宽的差异超过阈值，则会增加更多的连接，直到任一方差不超过阈值或者建立最大连接数。 播种对等方通过监视其每个洪流的平均上传速率来确定何时减少播种的文件数量。 如果平均速率低于阈值，则对等体停止播种文件。 对等体停止播种的文件是对等体做出最小总体贡献的文件。

公开(公告)号：US07706260B2

公开(公告)日：2010-04-27

申请号：US11740918

申请日：2007-04-26

申请人： Bram Cohen ,  David Harrison ,  Gregory Hazel

发明人： Bram Cohen ,  David Harrison ,  Gregory Hazel

IPC分类号： G01R31/08

CPC分类号： H04L67/104 ,  H04L67/1042 ,  H04L69/16

摘要： Dynamic rate limiting of background traffic to alleviate congestion in the access network is enabled. ICMP echo round-trip times and ICMP losses to a nearby node outside the local area and just beyond the divergence in end-to-end paths are measured, allowing unambiguous discrimination of nearby from distant congestion points. Using round-trip time samples, either short-run delay or short-run variance in delay can be measured to estimate congestion. When combined with an appropriate control law, background traffic can be rapidly reduced to allow interactive traffic to traverse unhindered through the access network. The described system and methods can be implemented in the application-layer and without any additional support from the network.

摘要翻译： 启用后台流量的动态速率限制以减轻接入网络中的拥塞。 测量ICMP回波往返时间和对局部区域附近的附近节点的ICMP损失，并且在端对端路径之间的偏差之外，测量到来自远距离拥塞点的附近的明确区分。 使用往返时间样本，可以测量延迟的短期延迟或短期差异来估计拥塞。 当与适当的控制规则相结合时，可以快速减少后台流量，以允许交互式流量通过接入网络不受阻碍地穿越。 所描述的系统和方法可以在应用层中实现，而不需要网络的任何额外的支持。

公开(公告)号：US20100284276A1

公开(公告)日：2010-11-11

申请号：US12732264

申请日：2010-03-26

申请人： Bram Cohen ,  David Harrison ,  Gregory Hazel

发明人： Bram Cohen ,  David Harrison ,  Gregory Hazel

IPC分类号： H04L12/26

CPC分类号： H04L67/104 ,  H04L67/1042 ,  H04L69/16

摘要： Dynamic rate limiting of background traffic to alleviate congestion in the access network is enabled. ICMP echo round-trip times and ICMP losses to a nearby node outside the local area and just beyond the divergence in end-to-end paths are measured, allowing unambiguous discrimination of nearby from distant congestion points. Using round-trip time samples, either short-run delay or short-run variance in delay can be measured to estimate congestion. When combined with an appropriate control law, background traffic can be rapidly reduced to allow interactive traffic to traverse unhindered through the access network. The described system and methods can be implemented in the application-layer and without any additional support from the network.

摘要翻译： 启用后台流量的动态速率限制以减轻接入网络中的拥塞。 测量ICMP回波往返时间和对局部区域附近的附近节点的ICMP损失，并且在端对端路径之间的偏差之外，测量到来自远距离拥塞点的附近的明确区分。 使用往返时间样本，可以测量延迟的短期延迟或短期差异来估计拥塞。 当与适当的控制规则相结合时，可以快速减少后台流量，以允许交互式流量通过接入网络不受阻碍地穿越。 所描述的系统和方法可以在应用层中实现，而不需要网络的任何额外的支持。

公开(公告)号：US08385201B2

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

申请号：US12732264

申请日：2010-03-26

申请人： Bram Cohen ,  David Harrison ,  Gregory Hazel

发明人： Bram Cohen ,  David Harrison ,  Gregory Hazel

IPC分类号： G01R31/08

CPC分类号： H04L67/104 ,  H04L67/1042 ,  H04L69/16

摘要： Dynamic rate limiting of background traffic to alleviate congestion in the access network is enabled. ICMP echo round-trip times and ICMP losses to a nearby node outside the local area and just beyond the divergence in end-to-end paths are measured, allowing unambiguous discrimination of nearby from distant congestion points. Using round-trip time samples, either short-run delay or short-run variance in delay can be measured to estimate congestion. When combined with an appropriate control law, background traffic can be rapidly reduced to allow interactive traffic to traverse unhindered through the access network. The described system and methods can be implemented in the application-layer and without any additional support from the network.

摘要翻译： 启用后台流量的动态速率限制以减轻接入网络中的拥塞。 测量ICMP回波往返时间和对局部区域附近的附近节点的ICMP损失，并且在端对端路径之间的偏差之外，测量到来自远距离拥塞点的附近的明确区分。 使用往返时间样本，可以测量延迟的短期延迟或短期差异来估计拥塞。 当与适当的控制规则相结合时，可以快速减少后台流量，以允许交互式流量通过接入网络不受阻碍地穿越。 所描述的系统和方法可以在应用层中实现，而不需要网络的任何额外的支持。

公开(公告)号：US20080043625A1

公开(公告)日：2008-02-21

申请号：US11740918

申请日：2007-04-26

申请人： Bram Cohen ,  David Harrison ,  Gregory Hazel

发明人： Bram Cohen ,  David Harrison ,  Gregory Hazel

IPC分类号： H04L12/56

CPC分类号： H04L67/104 ,  H04L67/1042 ,  H04L69/16

摘要： Dynamic rate limiting of background traffic to alleviate congestion in the access network is enabled. ICMP echo round-trip times and ICMP losses to a nearby node outside the local area and just beyond the divergence in end-to-end paths are measured, allowing unambiguous discrimination of nearby from distant congestion points. Using round-trip time samples, either short-run delay or short-run variance in delay can be measured to estimate congestion. When combined with an appropriate control law, background traffic can be rapidly reduced to allow interactive traffic to traverse unhindered through the access network. The described system and methods can be implemented in the application-layer and without any additional support from the network.

摘要翻译： 启用后台流量的动态速率限制以减轻接入网络中的拥塞。 测量ICMP回波往返时间和对局部区域附近的附近节点的ICMP损失，并且在端对端路径之间的偏差之外，测量到来自远距离拥塞点的附近的明确区分。 使用往返时间样本，可以测量延迟的短期延迟或短期差异来估计拥塞。 当与适当的控制规则相结合时，可以快速减少后台流量，以允许交互式流量通过接入网络不受阻碍地穿越。 所描述的系统和方法可以在应用层中实现，而不需要网络的任何额外的支持。

公开(公告)号：US20140250204A1

公开(公告)日：2014-09-04

申请号：US13944756

申请日：2013-07-17

申请人： Stanislav Shalunov ,  Gregory Hazel ,  Micha Benoliel

发明人： Stanislav Shalunov ,  Gregory Hazel ,  Micha Benoliel

IPC分类号： H04L29/08

CPC分类号： H04L67/02 ,  H04L67/1008 ,  H04L67/1023 ,  H04L67/104 ,  H04L69/14 ,  H04W74/02 ,  H04W76/15 ,  H04W88/06

摘要： Methods for establishing connection to the Internet using multiple channels. A device takes advantage of several channels available to it internally and/or from neighboring devices to request the various resources of the webpage, and assembles the webpage using the resources arriving from the different channels. When a device has the ability to connect to the Internet using multiple internal channels, the device uses internal heuristics to request the webpage resources using these channels. A cloud exit server may be used to enhance security and to handle requests that may not be handled using multiple channels.

摘要翻译： 使用多个通道建立与Internet的连接的方法。 设备利用内部和/或相邻设备可用的多个信道来请求网页的各种资源，并且使用从不同信道到达的资源来组合网页。 当设备能够使用多个内部通道连接到Internet时，设备使用内部启发式方法来使用这些通道请求网页资源。 可以使用云端口服务器来增强安全性并处理可能不使用多个信道处理的请求。

公开(公告)号：US09049537B2

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

申请号：US13646617

申请日：2012-10-05

申请人： Stanislav Shalunov ,  Gregory Hazel ,  Micha Benoliel

发明人： Stanislav Shalunov ,  Gregory Hazel ,  Micha Benoliel

IPC分类号： G06F15/16 ,  H04W8/00 ,  H04L12/24 ,  H04L29/06

CPC分类号： H04W8/005 ,  H04L41/12 ,  H04L63/0876

摘要： Pairing among computing devices is achieved without any of the device entering discoverable mode. An inquiring device obtains a list of MAC addresses and transmits connection requests using the MAC addresses. Any device within reception distance that has the same MAC address would respond to the request. Upon receiving the response, the two devices would pair up. A beacon may be used to store MAC addresses and related data. Computing devices may send inquiries to the beacon and receive in return MAC addresses corresponding to the inquiry. The devices may then transmit pairing requests using these MAC addresses.

摘要翻译： 在没有任何设备进入可发现模式的情况下实现计算设备之间的配对。 查询设备获取MAC地址列表，并使用MAC地址发送连接请求。 接收距离内具有相同MAC地址的任何设备将对请求进行响应。 收到响应后，两个设备将配对。 可以使用信标来存储MAC地址和相关数据。 计算设备可以向信标发送查询，并且接收与查询对应的MAC地址。 然后，设备可以使用这些MAC地址来发送配对请求。

公开(公告)号：US20130091288A1

公开(公告)日：2013-04-11

申请号：US13646617

申请日：2012-10-05

申请人： Stanislav Shalunov ,  Gregory Hazel

发明人： Stanislav Shalunov ,  Gregory Hazel

IPC分类号： H04W76/00

CPC分类号： H04W8/005 ,  H04L41/12 ,  H04L63/0876

摘要： Pairing among computing devices is achieved without any of the device entering discoverable mode. An inquiring device obtains a list of MAC addresses and transmits connection requests using the MAC addresses. Any device within reception distance that has the same MAC address would respond to the request. Upon receiving the response, the two devices would pair up. A beacon may be used to store MAC addresses and related data. Computing devices may send inquiries to the beacon and receive in return MAC addresses corresponding to the inquiry. The devices may then transmit pairing requests using these MAC addresses.

摘要翻译： 在没有任何设备进入可发现模式的情况下实现计算设备之间的配对。 查询设备获取MAC地址列表，并使用MAC地址发送连接请求。 接收距离内具有相同MAC地址的任何设备将对请求进行响应。 收到响应后，两个设备将配对。 可以使用信标来存储MAC地址和相关数据。 计算设备可以向信标发送查询，并且接收与查询对应的MAC地址。 然后，设备可以使用这些MAC地址来发送配对请求。