This paper presents a joint sender/receiver optimization algorithm and a seamless rate adjustment protocol to reduce the total number of packets over different paths in a streaming framework with a variety of constraints such as target throughput, dynamic packet loss ratio, and available bandwidths. This paper exploits the high rate erasure resilient code for the ease of packet loss adaption and seamless rate adjustment. The proposed algorithm and adjustment protocol can be applied at an arbitrary scale.
Did you find this white paper useful?
25 out of 43 users found this white paper useful
Related white papers
InHouse vs Hosted: Location Scout
Is it better to have your CRM system hosted or on premises? Correspondent James Hilliard looks at how to tackle the software, hardware and staffing questions.
Exploring Real Time Multimedia Content Creation in Video Games
Video games represent a class of media applications for which creating video content is as important as displaying it. This paper compares video games running on an Apple Macintosh G5...
neosnetworks: Delivering "Liquid Bandwidth" Ethernet Services
Neos created the Ethernet Service Provider (ESP) market in the UK in October 2001 and today has 100% market share. Neos is the UK's fastest-growing service provider, having achieved a...
Maximizing Bandwidth in CCII for Wireless Optical Applications
This paper discusses bandwidth problems associated with the usage of second-generation current conveyors in wireless optical systems, and presents a new current amplifier with wide bandwidth and large input dynamic...
Performance and Implementation of Dynamic Frequency Hopping in Limited-Bandwidth Cellular Systems
This paper evaluates the performance of recently proposed Dynamic Frequency Hopping (DFH) when applied to cellular systems with a limited total bandwidth. The paper also illustrates a practical implementation for...
The Effect of Bandwidth on Speech Intelligibility
Of all the elements that affect the intelligibility of speech in telephony, bandwidth has been shown to be one of the most critical. This paper discusses the relation between bandwidth...
On Orthogonal Reduction to Hessenberg Form With Small Bandwidth
Numerous algorithms in numerical linear algebra are based on the reduction of a given matrix A to a more convenient form. One of the most useful types of such reduction...
