Abstract: Technologies are described for performing equation-based rate control using delay. For example, an observed network data rate and a network delay can be obtained for a network communication. A target network data rate can be calculated using the observed network data rate and the network delay. The target network data rate is calculated using an equation-based approach. For example, the equation-based rate control can set the target network data rate to a value that is directly proportional to the observed network data rate and inversely related to the network delay. The target network data rate is used to set the bitrate for the network communication.

Abstract: Technologies are described for performing equation-based rate control using delay. For example, an observed network data rate and a network delay can be obtained for a network communication. A target network data rate can be calculated using the observed network data rate and the network delay. The target network data rate is calculated using an equation-based approach. For example, the equation-based rate control can set the target network data rate to a value that is directly proportional to the observed network data rate and inversely related to the network delay. The target network data rate is used to set the bitrate for the network communication.

Abstract: Technologies are described for performing equation-based rate control using delay. For example, an observed network data rate and a network delay can be obtained for a network communication. A target network data rate can be calculated using the observed network data rate and the network delay. The target network data rate is calculated using an equation-based approach. For example, the equation-based rate control can set the target network data rate to a value that is directly proportional to the observed network data rate and inversely related to the network delay. The target network data rate is used to set the bitrate for the network communication.

Abstract: Technologies are described for performing hybrid rate control that switches between a delay-based mode and a passive loss-based mode for a flow of network traffic. The switching can be performed based on the presence of loss-based TCP network flows. For example, rate control can be performed for a flow of network traffic in a delay-based mode. When the presence of a loss-based TCP network flow is detected, the flow of network traffic can be switched from the delay-based mode to a passive loss-based mode and rate control can be performed in the passive loss-based mode. When the loss-based TCP flow is no longer detected, the flow of network traffic can be switched back to the delay-based mode.

Abstract: Technologies are described for performing equation-based rate control using delay. For example, an observed network data rate and a network delay can be obtained for a network communication. A target network data rate can be calculated using the observed network data rate and the network delay. The target network data rate is calculated using an equation-based approach. For example, the equation-based rate control can set the target network data rate to a value that is directly proportional to the observed network data rate and inversely related to the network delay. The target network data rate is used to set the bitrate for the network communication.

Abstract: Technologies are described for performing hybrid rate control that switches between a delay-based mode and a passive loss-based mode for a flow of network traffic. The switching can be performed based on the presence of loss-based TCP network flows. For example, rate control can be performed for a flow of network traffic in a delay-based mode. When the presence of a loss-based TCP network flow is detected, the flow of network traffic can be switched from the delay-based mode to a passive loss-based mode and rate control can be performed in the passive loss-based mode. When the loss-based TCP flow is no longer detected, the flow of network traffic can be switched back to the delay-based mode.

Abstract: A computing system manages communications congestion by selecting a transmission rate differently in different operating modes. In a delay-plus-loss mode, the transmission rate is selected as the lesser of a rate that would be selected by loss-based algorithm or by a delay-based algorithm. In a loss-based mode, the transmission rate is selected as the lesser of a rate that would be selected by loss-based algorithm, on one hand, and the maximum of a rate that would be selected by a delay-based algorithm or a rate proportional to the maximum estimated link rate divided by the number of data flows estimated to be competing for link bandwidth on the other hand. A database may be maintained of observations of network and link performance over time, where the database contains such information as the maximum estimated link rate capacity, minimum delays, and minimum losses.

Abstract: An audio decoder provides a combination of decoding components including components implementing base band decoding, spectral peak decoding, frequency extension decoding and channel extension decoding techniques. The audio decoder decodes a compressed bitstream structured by a bitstream syntax scheme to permit the various decoding components to extract the appropriate parameters for their respective decoding technique.

Abstract: An indexed file layout, comprising index information, is defined for segmented streaming of multimedia content. The index information can comprise program description information and streaming segment index information. In addition, the layout can comprise files containing streaming segments of the program, where the streaming segments are each encoded at one or more bitrates independently of other streaming segments of the program. The layout supports client switching between different bitrates at segment boundaries. Optimized client-side rate control of streaming content can be provided by defining a plurality of states, selecting available paths based on constraint conditions, and selecting a best path through the states (e.g., based on a distortion measure). In one client-side rate control solution states correspond to a specific bitrate of a specific streaming segment, and in another client-side rate control solution states correspond to a measure of client buffer fullness.

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: A computer-implemented method and system for determining documents that are nearest to a query are provided herein. The method includes constructing a vantage point tree based on a number of document vectors. The method also includes searching the vantage point tree to determine a number of nearest neighbor document vectors to a query vector by removing a portion of the document vectors from the vantage point tree based on one or more vantage points for each of a number of nodes in the vantage point tree and a specified search radius centered about the query vector.

Abstract: An audio decoder provides a combination of decoding components including components implementing base band decoding, spectral peak decoding, frequency extension decoding and channel extension decoding techniques. The audio decoder decodes a compressed bitstream structured by a bitstream syntax scheme to permit the various decoding components to extract the appropriate parameters for their respective decoding technique.

Abstract: Embodiments are directed to controlling bandwidth usage using a token-based crediting and debiting scheme and to allowing connections to temporarily exceed bandwidth allocations using token credits. In one scenario, a bandwidth managing service receives a request to establish a connection with a network. The connection is associated with various subscribers that are part of a subscription. The bandwidth managing service assigns tokens to the connection, which are distributed from a pool of tokens that represents a total available bandwidth for the network. The bandwidth managing service receives a data transfer request from a logical user to transfer data over the network connection, where the data transfer request includes at least some of the assigned tokens. The bandwidth managing service also allocates to the connection a specified amount of bandwidth commensurate with the number of assigned tokens provided in the data transfer request.

Abstract: An encoder performs context-adaptive arithmetic encoding of transform coefficient data. For example, an encoder switches between coding of direct levels of quantized transform coefficient data and run-level coding of run lengths and levels of quantized transform coefficient data. The encoder can determine when to switch between coding modes based on a pre-determined switch point or by counting consecutive coefficients having a predominant value (e.g., zero). A decoder performs corresponding context-adaptive arithmetic decoding.

Abstract: An audio decoder provides a combination of decoding components including components implementing base band decoding, spectral peak decoding, frequency extension decoding and channel extension decoding techniques. The audio decoder decodes a compressed bitstream structured by a bitstream syntax scheme to permit the various decoding components to extract the appropriate parameters for their respective decoding technique.

Abstract: Disclosed herein are systems and methods for executing programs written in functional style. A distributed computing system receives a program that expresses computation upon one or more sets of distributed key-value pairs (DKVs) and one or more global variables (GVs). The system distributes an assembly that includes at least a compiled binary of the program to the nodes of a computing cluster, with different portions of the DKVs being stored across the plurality of nodes of the computing cluster. The system causes execution of the assembly by each of the plurality of nodes of the computing cluster, the ones of the plurality of nodes executing the assembly using the different portions of the one or more DKVs stored thereon.

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: Disclosed herein are systems and methods for executing programs written in functional style. A distributed computing system receives a program that expresses computation upon one or more sets of distributed key-value pairs (DKVs) and one or more global variables (GVs). The system distributes an assembly that includes at least a compiled binary of the program to the nodes of a computing cluster, with different portions of the DKVs being stored across the plurality of nodes of the computing cluster. The system causes execution of the assembly by each of the plurality of nodes of the computing cluster, the ones of the plurality of nodes executing the assembly using the different portions of the one or more DKVs stored thereon.

Abstract: An audio encoder receives multi-channel audio data comprising a group of plural source channels and performs channel extension coding, which comprises encoding a combined channel for the group and determining plural parameters for representing individual source channels of the group as modified versions of the encoded combined channel. The encoder also performs frequency extension coding. The frequency extension coding can comprise, for example, partitioning frequency bands in the multi-channel audio data into a baseband group and an extended band group, and coding audio coefficients in the extended band group based on audio coefficients in the baseband group. The encoder also can perform other kinds of transforms. An audio decoder performs corresponding decoding and/or additional processing tasks, such as a forward complex transform.

Abstract: An audio decoder provides a combination of decoding components including components implementing base band decoding, spectral peak decoding, frequency extension decoding and channel extension decoding techniques. The audio decoder decodes a compressed bitstream structured by a bitstream syntax scheme to permit the various decoding components to extract the appropriate parameters for their respective decoding technique.