公开(公告)号：EP1705834A1

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

申请号：EP06111617.4

申请日：2006-03-23

Applicant: MICROSOFT CORPORATION

Inventor： Padhye, Jitendra D. ,  Padmanabhan, Venkata N.

IPC: H04L12/26

CPC classification number: H04L43/12 ,  H04L43/0858 ,  H04L43/0882

Abstract: A new system and method of available bandwidth estimation applies even where the narrow link and tight link in a network path are in different locations. In embodiments of the invention, a unique packet probe series structure and processing is employed to estimate available bandwidth. In an embodiment of the invention, the spacing between probe packets is adjusted at the source to account for dilation caused by links leading to the tight link (311), so that the spacing is appropriate when the probes arrive at the tight link (311). Moreover, the multi-packet probe comprises a large packet (301) followed by two much smaller packets (303,305). The large packet (301) is then dropped once it has traversed the tight link (311). The two small packets (303,305), which are impacted little by subsequent narrow links, preserve the spacing set by the tight link (311), encoding the delay induced by the tight link (311), all the way to the destination.

Abstract translation: 即使在网络路径中的窄链路和紧密链路位于不同位置的情况下，也可以使用新的可用带宽估计的系统和方法。 在本发明的实施例中，使用独特的分组探测器序列结构和处理来估计可用带宽。 在本发明的一个实施例中，探测分组之间的间距在源处被调整以考虑由导致紧密连接（311）的链路引起的扩张，使得当探针到达紧密连接（311）时间隙是适当的 。 此外，多分组探测器包括大分组（301），后面是两个小得多的分组（303,305）。 一旦该数据包（301）已经穿过紧密链接（311），则丢弃该大包（301）。 由后续的窄链接影响很小的两个小包（303,305）保留由紧链接（311）设定的间隔，将由紧链接（311）引起的延迟编码到目的地。

公开(公告)号：EP1351469B1

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

申请号：EP03005821.8

申请日：2003-03-14

Applicant: MICROSOFT CORPORATION

Inventor： Cabrera, Luis Felipe ,  Padmanabhan, Venkata N.

IPC: H04L29/06 ,  H04L12/18

CPC classification number: H04L67/42 ,  H04L29/06

公开(公告)号：EP1816826A3

公开(公告)日：2007-10-24

申请号：EP07009717.5

申请日：2003-03-14

Applicant: Microsoft Corporation

Inventor： Cabrera, Luis Felipe ,  Padmanabhan, Venkata N.

IPC: H04L29/06 ,  H04L12/18

CPC classification number: H04L67/42 ,  H04L29/06

Abstract: A method of reducing bandwidth limitations to send events to a set of interested clients within a pre-defined time period as quickly and fairly as possible. The clients can be re-distributed among the servers in a network such that the delay due to server overloading is minimized by moving clients from an overloaded server to a server with available bandwidth. In addition, the latency of client-server communications can be incorporated into an estimation of download times, and the servers can then initiate delivery to respective clients based on those download times. By staggering the send times to account for heterogeneous latencies, more clients can receive the event at the same time, and a fairness of distribution can be achieved.

公开(公告)号：EP1351469A2

公开(公告)日：2003-10-08

申请号：EP03005821.8

申请日：2003-03-14

Applicant: MICROSOFT CORPORATION

Inventor： Cabrera, Luis Felipe ,  Padmanabhan, Venkata N.

IPC: H04L29/06 ,  H04L12/18

CPC classification number: H04L67/42 ,  H04L29/06

Abstract: A method of reducing bandwidth limitations to send events to a set of interested clients within a pre-defined time period as quickly and fairly as possible. The clients can be re-distributed among the servers in a network such that the delay due to server overloading is minimized by moving clients from an overloaded server to a server with available bandwidth. In addition, the latency of client-server communications can be incorporated into an estimation of download times, and the servers can then initiate delivery to respective clients based on those download times. By staggering the send times to account for heterogeneous latencies, more clients can receive the event at the same time, and a fairness of distribution can be achieved.

Abstract translation: 一种减少带宽限制的方法，以尽可能快速和公正地在预定义的时间段内将事件发送给一组感兴趣的客户端。 可以在网络中的服务器之间重新分配客户端，以便通过将客户端从重载的服务器移动到具有可用带宽的服务器，使服务器重载引起的延迟最小化。 此外，客户机 - 服务器通信的延迟可以被合并到下载时间的估计中，然后服务器可以基于那些下载时间启动向相应客户端的传送。 通过交错发送时间来解决异构延迟，更多的客户端可以同时接收事件，并且可以实现公平的分配。

公开(公告)号：EP1345352A2

公开(公告)日：2003-09-17

申请号：EP03005311.0

申请日：2003-03-11

Applicant: MICROSOFT CORPORATION

Inventor： Padmanabhan, Venkata N. ,  Cabrera, Luis Felipe

IPC: H04L9/08

CPC classification number: H04L9/0833 ,  H04L2209/60

Abstract: To provide a fairness of distribution, an encrypted event, containing information not intended for release prior to a release time, can be sent to clients prior to the release time. In such a manner the bulk of the information can be transferred to the clients without concern to the duration of the transfer. At the release time, a small decryption key can be sent, either from a central sever, or from multiple server, utilizing multiple network paths to provide for the greatest likelihood that each client will receive the decryption key with a minimum of delay. Each client is thereby provided access to the information at approximately the same time, regardless of the bandwidth available to each client. Additionally, trusted edge servers, that can be trusted not to release information prior to an appropriate time, can send an unencrypted event, or decrypt the encrypted event and send the decrypted event, at a determined time, either prior to or after the release time, such that the decrypted or unencrypted event arrives at the clients that could not store and decrypt the encrypted event at approximately the same time as the key arrives at the other clients. Each client can thus receive the information at approximately the same time, regardless of the client's bandwidth or its ability to store and decrypt information.

Abstract translation: 提供配送的公平性，在加密的情况下，含有不适用于之前的释放时间发布信息，可以前的释放时间被发送到客户端。 在寻求一个方式的信息大部分可以转移到客户端，而关注的传输的持续时间。 在发布时，小解密密钥可以被发送，无论是从一个中央服务器，或从多个服务器，利用多个网络路径，以提供最大的可能性确实每个客户端将收到一个最小延迟的解密密钥。 每个客户端由此提供访问信息在大约相同的时间，不管可用的带宽给每个客户端。 此外，可信边缘服务器，也可以被信任不上适当的时间之前，发布信息，可以被发送到未加密的事件，或解密所述加密的事件和发送所述解密的情况下，在一个确定的开采时间，之前或释放时间之后 ，审查做了解密或加密的事件到达的关键到达其他客户端可能无法存储和解密加密的事件在大约相同的时间客户端。 每个客户端可以在THUS大约在同一时间接收到的信息，无论客户端的带宽，或者其存储和解密信息的能力。

公开(公告)号：EP1705834B1

公开(公告)日：2011-06-08

申请号：EP06111617.4

申请日：2006-03-23

Applicant: MICROSOFT CORPORATION

Inventor： Padhye, Jitendra D. ,  Padmanabhan, Venkata N.

IPC: H04L12/26

CPC classification number: H04L43/12 ,  H04L43/0858 ,  H04L43/0882

公开(公告)号：EP1816826A2

公开(公告)日：2007-08-08

申请号：EP07009717.5

申请日：2003-03-14

Applicant: Microsoft Corporation

Inventor： Cabrera, Luis Felipe ,  Padmanabhan, Venkata N.

IPC: H04L29/06 ,  H04L12/18

CPC classification number: H04L67/42 ,  H04L29/06

Abstract: A method of reducing bandwidth limitations to send events to a set of interested clients within a pre-defined time period as quickly and fairly as possible. The clients can be re-distributed among the servers in a network such that the delay due to server overloading is minimized by moving clients from an overloaded server to a server with available bandwidth. In addition, the latency of client-server communications can be incorporated into an estimation of download times, and the servers can then initiate delivery to respective clients based on those download times. By staggering the send times to account for heterogeneous latencies, more clients can receive the event at the same time, and a fairness of distribution can be achieved.

Abstract translation: 尽可能快速和公平地减少带宽限制以在预定时间段内将事件发送到一组感兴趣的客户端的方法。 客户端可以在网络中的服务器之间重新分配，从而通过将客户端从超载服务器移动到具有可用带宽的服务器，将由于服务器过载而导致的延迟降至最低。 另外，客户端 - 服务器通信的延迟可以被纳入对下载时间的估计中，并且服务器然后可以基于那些下载时间向各个客户端发起递送。 通过错开发送时间来解决异构的延迟问题，更多的客户可以同时接收事件，并且可以实现公平分配。

公开(公告)号：EP1345352B1

公开(公告)日：2007-01-17

申请号：EP03005311.0

申请日：2003-03-11

Applicant: MICROSOFT CORPORATION

Inventor： Padmanabhan, Venkata N. ,  Cabrera, Luis Felipe

IPC: H04L12/18 ,  H04L29/06 ,  H04L9/08

CPC classification number: H04L9/0833 ,  H04L2209/60

Abstract: To provide a fairness of distribution, an encrypted event, containing information not intended for release prior to a release time, can be sent to clients prior to the release time. In such a manner the bulk of the information can be transferred to the clients without concern to the duration of the transfer. At the release time, a small decryption key can be sent, either from a central sever, or from multiple server, utilizing multiple network paths to provide for the greatest likelihood that each client will receive the decryption key with a minimum of delay. Each client is thereby provided access to the information at approximately the same time, regardless of the bandwidth available to each client. Additionally, trusted edge servers, that can be trusted not to release information prior to an appropriate time, can send an unencrypted event, or decrypt the encrypted event and send the decrypted event, at a determined time, either prior to or after the release time, such that the decrypted or unencrypted event arrives at the clients that could not store and decrypt the encrypted event at approximately the same time as the key arrives at the other clients. Each client can thus receive the information at approximately the same time, regardless of the client's bandwidth or its ability to store and decrypt information.

公开(公告)号：EP1345352A3

公开(公告)日：2004-10-20

申请号：EP03005311.0

申请日：2003-03-11

Applicant: MICROSOFT CORPORATION

Inventor： Padmanabhan, Venkata N. ,  Cabrera, Luis Felipe

IPC: H04L12/18 ,  H04L29/06 ,  H04L9/08

CPC classification number: H04L9/0833 ,  H04L2209/60

Abstract: To provide a fairness of distribution, an encrypted event, containing information not intended for release prior to a release time, can be sent to clients prior to the release time. In such a manner the bulk of the information can be transferred to the clients without concern to the duration of the transfer. At the release time, a small decryption key can be sent, either from a central sever, or from multiple server, utilizing multiple network paths to provide for the greatest likelihood that each client will receive the decryption key with a minimum of delay. Each client is thereby provided access to the information at approximately the same time, regardless of the bandwidth available to each client. Additionally, trusted edge servers, that can be trusted not to release information prior to an appropriate time, can send an unencrypted event, or decrypt the encrypted event and send the decrypted event, at a determined time, either prior to or after the release time, such that the decrypted or unencrypted event arrives at the clients that could not store and decrypt the encrypted event at approximately the same time as the key arrives at the other clients. Each client can thus receive the information at approximately the same time, regardless of the client's bandwidth or its ability to store and decrypt information.

公开(公告)号：EP1351469A3

公开(公告)日：2004-08-18

申请号：EP03005821.8

申请日：2003-03-14

Applicant: MICROSOFT CORPORATION

Inventor： Cabrera, Luis Felipe ,  Padmanabhan, Venkata N.

IPC: H04L29/06 ,  H04L12/18

CPC classification number: H04L67/42 ,  H04L29/06

Abstract: A method of reducing bandwidth limitations to send events to a set of interested clients within a pre-defined time period as quickly and fairly as possible. The clients can be re-distributed among the servers in a network such that the delay due to server overloading is minimized by moving clients from an overloaded server to a server with available bandwidth. In addition, the latency of client-server communications can be incorporated into an estimation of download times, and the servers can then initiate delivery to respective clients based on those download times. By staggering the send times to account for heterogeneous latencies, more clients can receive the event at the same time, and a fairness of distribution can be achieved.