A Case-Based Component Selection Framework for Mobile Context-Aware Applications

This paper proposes a new semi-reliable multicast algorithm based on the (m, k)-firm scheduling technique, where in each consecutive k window messages sent by a sender, at least m of these messages must be received by the receiver. To assure this restriction, message recovery mechanisms from reliable multicast protocols can be used. This algorithm is mainly applicable to applications that may suffer losses, as long as these losses do not occur consecutively and do not overrun a specified maximum value of message, without any degradation of the quality of service.