Abstract:
Optimized conferencing performance may be provided. First, a plurality of data streams respectively received from a plurality of conferencing users may be monitored. Then, for each of the plurality of conferencing users, a plurality of talk frequency conditions respectively corresponding to the plurality of conferencing users may be determined based upon the monitored plurality of data streams. The plurality of talk frequency conditions may comprise, for example, active-talker, infrequent talker, or listener-only. Next, a plurality of data packet size values respectively corresponding to the plurality of conferencing users may be determined based upon the determined plurality of talk frequency conditions. The plurality of data streams may then be mixed to create data. Next, the data may be transmitted to each of the plurality of conferencing users respectively using the determined plurality of data packet size values respectively corresponding to the plurality of conferencing users.
Abstract:
Techniques for providing third party incentivized communications sessions are described. In some embodiments, a Voice over IP (VoIP) conversation is sampled for audio information such as a word, phrase, utterance, or phoneme that may be associated with an advertisement in a database. The database may be searched for the audio information, or in some embodiments a text equivalent of the audio information, and the associated advertisement may be served to a participant in the VoIP communication session. In some implementations, data from or about the conversation may be compiled for analysis.
Abstract:
Techniques for providing third party incentivized communications sessions are described. In some embodiments, a Voice over IP (VoIP) conversation is sampled for audio information such as a word, phrase, utterance, or phoneme that may be associated with an advertisement in a database. The database may be searched for the audio information, or in some embodiments a text equivalent of the audio information, and the associated advertisement may be served to a participant in the VoIP communication session. In some implementations, data from or about the conversation may be compiled for analysis.
Abstract:
Tools and techniques for dynamically transcoding media streams are described herein. These tools may provide machine-readable storage media that contain machine-readable instructions that, when executed by the machine, cause the machine to define initial transcoding schemes under which media streams are to be transcoded as they passes between endpoints. In response to changes in conditions affecting the media streams, the machine may dynamically update the initial transcoding scheme.
Abstract:
Procedures for commanding a media relay to direct interactive connectivity establishment (ICE) communications are discussed. In an implementation, a back-to-back user agent may issue a command changing the state of the media relay so that communications initially routed through the back-to-back user agent may be routed to a non-ICE device.
Abstract:
Optimized conferencing performance may be provided. First, a plurality of data streams respectively received from a plurality of conferencing users may be monitored. Then, for each of the plurality of conferencing users, a plurality of talk frequency conditions respectively corresponding to the plurality of conferencing users may be determined based upon the monitored plurality of data streams. The plurality of talk frequency conditions may comprise, for example, active-talker, infrequent talker, or listener-only. Next, a plurality of data packet size values respectively corresponding to the plurality of conferencing users may be determined based upon the determined plurality of talk frequency conditions. The plurality of data streams may then be mixed to create data. Next, the data may be transmitted to each of the plurality of conferencing users respectively using the determined plurality of data packet size values respectively corresponding to the plurality of conferencing users.
Abstract:
A conference server may request a key frame from a conference participant in response to determining that the conference participant should become a most active participant, and the conference server may make the conference participant the most active participant in response to receiving the key frame from the conference participant.
Abstract:
Feedback and frame synchronization between media encoders and decoders is described. More particularly, the encoder can encode frames that are based on source content to be sent to the decoder. The encoder can determine whether the frame should be cached by the encoder and the decoder. If the frame is to be cached, the encoder can so indicate by encoding the frame with one or more cache control bits. The decoder can receive the frame from the decoder, and can examine the cache control bits to determine whether to cache the frame. The decoder can also decode the frame.
Abstract:
Systems, methods, and/or techniques (“tools”) are described that sort speakers in a network-enabled conference. In some cases, this sorted list of speakers indicates which speaker is dominant. With this sorted list, a participant's communication device may provide context about the speakers. In some cases a participant's communication device has a display that presents real-time video of the speakers or other visual indicia, such as each or the most dominant speaker's name, picture, title, or location. These and other context about speakers may help participants better understand discussions in network-enabled conferences.
Abstract:
Tools and techniques for dynamically transcoding media streams are described herein. These tools may provide machine-readable storage media that contain machine-readable instructions that, when executed by the machine, cause the machine to define initial transcoding schemes under which media streams are to be transcoded as they passes between endpoints. In response to changes in conditions affecting the media streams, the machine may dynamically update the initial transcoding scheme.