-
公开(公告)号：US08570864B2
公开(公告)日：2013-10-29
申请号：US12970952
申请日：2010-12-17
Applicant: Jin Li , Hua Chen , Sourabh Jain , Sanjeev Mehrotra
Inventor： Jin Li , Hua Chen , Sourabh Jain , Sanjeev Mehrotra
IPC: H04L12/26
CPC classification number: H04L41/0816 , H04L43/04 , H04L43/0894 , H04L47/12 , H04L47/193 , H04L47/20 , H04L47/22 , H04L47/2408 , H04L47/2416 , H04L47/2441 , H04L47/263 , H04L47/34 , Y02D50/10
Abstract: Described are techniques to use adaptive learning to control bandwidth or rate of transmission of a computer on a network. Congestion observations such as packet delay and packet loss are used to compute a congestion signal. The congestion signal is correlated with information about actual congestion on the network, and the transmission rate is adjusted according to the degree of correlation. Transmission rate may not adjust when packet delay or packet loss is not strongly correlated with actual congestion. The congestion signal is adaptively learned. For instance, the relative effects of loss and delay on the congestion signal may change over time. Moreover, an operating congestion level may be minimized by adaptive adjustment.
Abstract translation: 描述了使用自适应学习来控制网络上的计算机的带宽或速率的技术。 拥塞观察，如分组延迟和分组丢失，用于计算拥塞信号。 拥塞信号与网络上的实际拥塞信息相关，传输速率根据相关程度进行调整。 分组延迟或分组丢失与实际拥塞密切相关时，传输速率可能无法调整。 自适应地学习拥塞信号。 例如，丢失和延迟对拥塞信号的相对影响可能会随时间而变化。 此外，可以通过自适应调整来最小化操作拥塞级别。
-
公开(公告)号：US20120155262A1
公开(公告)日：2012-06-21
申请号：US12970952
申请日：2010-12-17
Applicant: Jin Li , Hua Chen , Sourabh Jain , Sanjeev Mehrotra
Inventor： Jin Li , Hua Chen , Sourabh Jain , Sanjeev Mehrotra
IPC: H04L12/26
CPC classification number: H04L41/0816 , H04L43/04 , H04L43/0894 , H04L47/12 , H04L47/193 , H04L47/20 , H04L47/22 , H04L47/2408 , H04L47/2416 , H04L47/2441 , H04L47/263 , H04L47/34 , Y02D50/10
Abstract: Described are techniques to use adaptive learning to control bandwidth or rate of transmission of a computer on a network. Congestion observations such as packet delay and packet loss are used to compute a congestion signal. The congestion signal is correlated with information about actual congestion on the network, and the transmission rate is adjusted according to the degree of correlation. Transmission rate may not adjust when packet delay or packet loss is not strongly correlated with actual congestion. The congestion signal is adaptively learned. For instance, the relative effects of loss and delay on the congestion signal may change over time. Moreover, an operating congestion level may be minimized by adaptive adjustment.
Abstract translation: 描述了使用自适应学习来控制网络上的计算机的带宽或速率的技术。 拥塞观察，如分组延迟和分组丢失，用于计算拥塞信号。 拥塞信号与网络上的实际拥塞信息相关，传输速率根据相关程度进行调整。 分组延迟或分组丢失与实际拥塞密切相关时，传输速率可能无法调整。 自适应地学习拥塞信号。 例如，丢失和延迟对拥塞信号的相对影响可能会随时间而变化。 此外，可以通过自适应调整来最小化操作拥塞级别。
-
公开(公告)号：US20130114421A1
公开(公告)日：2013-05-09
申请号：US13288968
申请日：2011-11-04
Applicant: Tin Qian , Jin Li , Tanner M. Hodgeson , Sanjeev Mehrotra , Jiannan Zheng , Timothy M. Moore
Inventor： Tin Qian , Jin Li , Tanner M. Hodgeson , Sanjeev Mehrotra , Jiannan Zheng , Timothy M. Moore
IPC: H04L12/26
CPC classification number: H04L43/0829 , H04L43/0852 , H04L43/16
Abstract: It can be determined whether relative one way delay for data packets in a data stream exceeds a delay threshold. If so, then a delay congestion signal indicating that the relative one way delay exceeds the delay threshold can be generated. The delay congestion signal can be used in calculating an adaptive bandwidth estimate for the data stream. A packet loss rate congestion signal may also be used in calculating the bandwidth estimate. It can be determined whether a data stream of data packets is in a contention state. If the data stream is in the contention state, then an adaptive bandwidth estimate can be calculated for the data stream using a first bandwidth estimation technique. If the data stream is not in the contention state, then the bandwidth estimate for the data stream can be calculated using a second bandwidth estimation technique.
Abstract translation: 可以确定数据流中的数据分组的相对单向延迟是否超过延迟阈值。 如果是，则可以产生指示相对单向延迟超过延迟阈值的延迟拥塞信号。 延迟拥塞信号可用于计算数据流的自适应带宽估计。 丢包率拥塞信号也可用于计算带宽估计。 可以确定数据包的数据流是否处于争用状态。 如果数据流处于竞争状态，则可以使用第一带宽估计技术对数据流计算自适应带宽估计。 如果数据流不处于竞争状态，则可以使用第二带宽估计技术来计算数据流的带宽估计。
-
公开(公告)号：US20100153822A1
公开(公告)日：2010-06-17
申请号：US12335496
申请日：2008-12-15
Applicant: Cheng Huang , Sanjeev Mehrotra , Jin Li , Xiping Zuo , Walid S.I. Ali , Regis J. Crinon , Ruchir Astavans
Inventor： Cheng Huang , Sanjeev Mehrotra , Jin Li , Xiping Zuo , Walid S.I. Ali , Regis J. Crinon , Ruchir Astavans
CPC classification number: H03M13/134 , H03M13/373 , H04L1/0057
Abstract: Construction and use of forward error correction codes is provided. A systematic MDS FEC code is obtained having a property wherein any set of contiguous or non-contiguous r packets can be lost during a data transmission of k data packets and r encoded packets and the original k packets can be recovered unambiguously. The systematic MDS FEC code is transformed into a (k+r, k) systematic MDS FEC code that guarantees at least one of the encoded packets is a parity packet. The starting systematic MDS FEC code may be Cauchy-based, and the transformation code derived from the starting Cauchy-based MDS FEC code allows for very efficient initialization, encoding and decoding operations.
Abstract translation: 提供前向纠错码的构造和使用。 获得具有属性的系统MDS FEC代码，其中在k个数据分组和r个编码分组的数据传输期间可能丢失任何一组连续的或不连续的r分组，并且可以明确地恢复原始k个分组。 系统MDS FEC码被变换为（k + r，k）系统MDS FEC码，其保证编码分组中的至少一个是奇偶校验分组。 起始的系统MDS FEC码可以是基于Cauchy的，并且从起始的基于Cauchy的MDS FEC码导出的变换码允许非常有效的初始化，编码和解码操作。
-
公开(公告)号：US09215157B2
公开(公告)日：2015-12-15
申请号：US13288968
申请日：2011-11-04
Applicant: Tin Qian , Jin Li , Tanner M. Hodgeson , Sanjeev Mehrotra , Jiannan Zheng , Timothy M. Moore
Inventor： Tin Qian , Jin Li , Tanner M. Hodgeson , Sanjeev Mehrotra , Jiannan Zheng , Timothy M. Moore
CPC classification number: H04L43/0829 , H04L43/0852 , H04L43/16
Abstract: It can be determined whether relative one way delay for data packets in a data stream exceeds a delay threshold. If so, then a delay congestion signal indicating that the relative one way delay exceeds the delay threshold can be generated. The delay congestion signal can be used in calculating an adaptive bandwidth estimate for the data stream. A packet loss rate congestion signal may also be used in calculating the bandwidth estimate. It can be determined whether a data stream of data packets is in a contention state. If the data stream is in the contention state, then an adaptive bandwidth estimate can be calculated for the data stream using a first bandwidth estimation technique. If the data stream is not in the contention state, then the bandwidth estimate for the data stream can be calculated using a second bandwidth estimation technique.
Abstract translation: 可以确定数据流中的数据分组的相对单向延迟是否超过延迟阈值。 如果是，则可以产生指示相对单向延迟超过延迟阈值的延迟拥塞信号。 延迟拥塞信号可用于计算数据流的自适应带宽估计。 丢包率拥塞信号也可用于计算带宽估计。 可以确定数据包的数据流是否处于争用状态。 如果数据流处于竞争状态，则可以使用第一带宽估计技术对数据流计算自适应带宽估计。 如果数据流不处于竞争状态，则可以使用第二带宽估计技术来计算数据流的带宽估计。
-
Patent Agency Ranking
公开(公告)号：US09059817B2
公开(公告)日：2015-06-16
申请号：US12951908
申请日：2010-11-22
Applicant: Cheng Huang , Jin Li , Sanjeev Mehrotra , Philip A. Chou , Felix Livni , Hao Chen , Jay Thaler , Chao Zhang , Keith W. Ross
Inventor： Cheng Huang , Jin Li , Sanjeev Mehrotra , Philip A. Chou , Felix Livni , Hao Chen , Jay Thaler , Chao Zhang , Keith W. Ross
CPC classification number: H04L1/0009 , H04L1/1812 , H04L1/188
Abstract: A method and system that enhances a user's performance while interacting with an interactive internet application such as a Massively Multiplayer Online (MMO) game is provided. The network latency experienced by users participating in the MMO game is minimized by dynamically determining an optimal transmission action for a message generated by the MMO game. In one embodiment, determining the optimal transmission action for a message includes dynamically determining the optimal number of redundant Forward Error Correction (FEC) packets to add to a message prior to transmitting a message to a receiving device. The optimal number of FEC packets is determined based on a wide range of varying network conditions.
Abstract translation: 提供了一种在与诸如大型多人在线（MMO）游戏之类的交互式互联网应用交互的同时增强用户表现的方法和系统。 通过动态地确定由MMO游戏产生的消息的最佳传输动作，使参与MMO游戏的用户经历的网络延迟最小化。 在一个实施例中，确定消息的最佳传输动作包括在将消息发送到接收设备之前动态地确定要添加到消息的冗余前向纠错（FEC）分组的最佳数量。 基于广泛的变化的网络条件来确定FEC分组的最佳数量。
-
7.发明申请公开(公告)号：US20130054544A1
公开(公告)日：2013-02-28
申请号：US13222198
申请日：2011-08-31
Applicant: Jin Li , Sudipta Sengupta , Sanjeev Mehrotra , Ran Kalach , Paul Adrian Oltean
Inventor： Jin Li , Sudipta Sengupta , Sanjeev Mehrotra , Ran Kalach , Paul Adrian Oltean
IPC: G06F7/00
CPC classification number: G06F7/00 , G06F3/0608 , G06F3/0641 , G06F3/0674 , G06F11/1004 , G06F17/30159
Abstract: The subject disclosure is directed towards partitioning a file into chunks that satisfy a chunk size restriction, such as maximum and minimum chunk sizes, using a sliding window. For file positions within the chunk size restriction, a signature representative of a window fingerprint is compared with a target pattern, with a chunk boundary candidate identified if matched. Other signatures and patterns are then checked to determine a highest ranking signature (corresponding to a lowest numbered Rule) to associate with that chunk boundary candidate, or set an actual boundary if the highest ranked signature is matched. If the maximum chunk size is reached without matching the highest ranked signature, the chunking mechanism regresses to set the boundary based on the candidate with the next highest ranked signature (if no candidates, the boundary is set at the maximum). Also described is setting chunk boundaries based upon pattern detection (e.g., runs of zeros).
Abstract translation: 本发明涉及使用滑动窗口将文件分成满足块大小限制的块，例如最大和最小块大小。 对于块大小限制内的文件位置，将窗口指纹的签名代表与目标模式进行比较，如果匹配则识别出块边界候选。 然后检查其他签名和模式以确定与该块块边界候选者相关联的最高排名签名（对应于最小编号的规则），或者如果最高排名签名匹配则设置实际边界。 如果没有匹配最高排名的签名达到最大块大小，则分块机制基于具有下一个最高排名的签名的候选者（如果没有候选，边界被设置为最大）而退化以设置边界。 还描述了基于模式检测（例如，零的运行）设置块边界。
-
公开(公告)号：US20110216648A1
公开(公告)日：2011-09-08
申请号：US12762016
申请日：2010-04-16
Applicant: Sanjeev Mehrotra , Tong L. Wynn , Jin Li , Sudipta Sengupta
Inventor： Sanjeev Mehrotra , Tong L. Wynn , Jin Li , Sudipta Sengupta
CPC classification number: H04L47/25 , H04L47/22 , H04L47/2416 , H04L47/29 , H04L47/30
Abstract: In various embodiments, methods and systems are disclosed for a hybrid rate plus window based congestion protocol that controls the rate of packet transmission into the network and provides low queuing delay, practically zero packet loss, fair allocation of network resources amongst multiple flows, and full link utilization. In one embodiment, a congestion window may be used to control the maximum number of outstanding bits, a transmission rate may be used to control the rate of packets entering the network (packet pacing), a queuing delay based rate update may be used to control queuing delay within tolerated bounds and minimize packet loss, and aggressive ramp-up/graceful back-off may be used to fully utilize the link capacity and additive-increase, multiplicative-decrease (AIMD) rate control may be used to provide fairness amongst multiple flows.
Abstract translation: 在各种实施例中，公开了用于混合速率加上基于窗口的拥塞协议的方法和系统，其控制到网络的分组传输速率并提供低排队延迟，实际上零分组丢失，多个流之间的网络资源的公平分配以及全部 链接利用率。 在一个实施例中，可以使用拥塞窗口来控制未完成比特的最大数量，可以使用传输速率来控制进入网络的分组的速率（分组起搏），基于排队延迟的速率更新可以用于控制 可以利用容忍范围内的排队延迟并尽可能减少分组丢失，并且可以使用积极的提升/优雅退避来充分利用链路容量，并且可以使用加法增加乘法减少（AIMD）速率控制来提供多个 流动。
-
9.发明授权公开(公告)号：US08918375B2
公开(公告)日：2014-12-23
申请号：US13222198
申请日：2011-08-31
Applicant: Jin Li , Sudipta Sengupta , Sanjeev Mehrotra , Ran Kalach , Paul Adrian Oltean
Inventor： Jin Li , Sudipta Sengupta , Sanjeev Mehrotra , Ran Kalach , Paul Adrian Oltean
CPC classification number: G06F7/00 , G06F3/0608 , G06F3/0641 , G06F3/0674 , G06F11/1004 , G06F17/30159
Abstract: The subject disclosure is directed towards partitioning a file into chunks that satisfy a chunk size restriction, such as maximum and minimum chunk sizes, using a sliding window. For file positions within the chunk size restriction, a signature representative of a window fingerprint is compared with a target pattern, with a chunk boundary candidate identified if matched. Other signatures and patterns are then checked to determine a highest ranking signature (corresponding to a lowest numbered Rule) to associate with that chunk boundary candidate, or set an actual boundary if the highest ranked signature is matched. If the maximum chunk size is reached without matching the highest ranked signature, the chunking mechanism regresses to set the boundary based on the candidate with the next highest ranked signature (if no candidates, the boundary is set at the maximum). Also described is setting chunk boundaries based upon pattern detection (e.g., runs of zeros).
Abstract translation: 本发明涉及使用滑动窗口将文件分成满足块大小限制的块，例如最大和最小块大小。 对于块大小限制内的文件位置，将窗口指纹的签名代表与目标模式进行比较，如果匹配则识别出块边界候选。 然后检查其他签名和模式以确定与该块块边界候选者相关联的最高排名签名（对应于最小编号的规则），或者如果最高排名签名匹配则设置实际边界。 如果没有匹配最高排名的签名达到最大块大小，则分块机制基于具有下一个最高排名的签名的候选者（如果没有候选，边界被设置为最大）而退化以设置边界。 还描述了基于模式检测（例如，零的运行）设置块边界。
-
公开(公告)号：US08228800B2
公开(公告)日：2012-07-24
申请号：US12364520
申请日：2009-02-03
Applicant: Sanjeev Mehrotra , Ying-zong Huang , Jin Li , Sayandeep Sen , Manish Jain , Sudipta Sengupta
Inventor： Sanjeev Mehrotra , Ying-zong Huang , Jin Li , Sayandeep Sen , Manish Jain , Sudipta Sengupta
IPC: G06F11/00
CPC classification number: H04L47/10 , H04J3/0682 , H04L1/0002 , H04L1/0009 , H04L1/0015 , H04L1/1867 , H04L47/115 , H04L47/193 , H04L47/25 , H04L47/283 , H04L47/37 , Y02D50/10
Abstract: Transmission delays are minimized when packets are transmitted from a source computer over a network to a destination computer. The source computer measures the network's available bandwidth, forms a sequence of output packets from a sequence of data packets, and transmits the output packets over the network to the destination computer, where the transmission rate is ramped up to the measured bandwidth. In conjunction with the transmission, the source computer monitors a transmission delay indicator which it computes using acknowledgement packets it receives from the destination computer. Whenever the indicator specifies that the transmission delay is increasing, the source computer reduces the transmission rate until the indicator specifies that the delay is unchanged. The source computer dynamically decides whether each output packet will be a forward error correction packet or a single data packet, where the decision is based on minimizing the expected transmission delays.
Abstract translation: 当数据包通过网络从源计算机传输到目标计算机时，传输延迟最小化。 源计算机测量网络的可用带宽，形成来自一系列数据分组的输出分组序列，并通过网络将输出分组发送到目标计算机，其中传输速率升高到测量带宽。 结合传输，源计算机监视传输延迟指示符，其使用从目的地计算机接收的确认分组来计算它。 每当指示符指示传输延迟增加时，源计算机降低传输速率，直到指示符指定延迟不变。 源计算机动态地确定每个输出分组是否将是前向纠错分组或单个数据分组，其中决定基于最小化期望的传输延迟。
-
-
-
-
-
-
-
-
-
Search Results
413
records
(took 0.063 seconds)
