An Efficient Greedy Algorithm on Optimizing the Architecture of Erasure Error Recovery under Strict Delay Constraints

Abstract:

In this paper, we address the QoS issue of reliable real-time multimedia multicast services over packet-switched networks. Using a generalized architecture of delay limited erasure error recovery, we propose an efficient greedy algorithm for optimizing the parameters of the general architecture. Through the proposed greedy algorithm, the total needed redundant information can be minimized by choosing the best scheme automatically among those entire schemes integrated in the architecture. As a result, the greedy algorithm can be a good candidate technique for guaranteeing QoS requirements for real-time multimedia multicast services over packet-switched, especially over wireless networks.