. The new algorithm is simpler, faster, and requires n-d-1 fewer message transmissions than previously proposed optimal k-fault-tolerant broadcast schemes. keywords: Hypercube, Fault-tolerant, Broadcasting 1 supported by the National Sciences and Engineering Research Council of Canada 494 1 Introduction

0 k < d. The new scheme requires 1) fewer message transmissions and (n 1)F # less time compared to previously proposed fault-tolerant all-toall broadcasting schemes.

Although the capacity of multiple-input/multiple-output (MIMO) broadcast channels (BCs) can be achieved by dirty paper coding (DPC), it is difficult to implement in practical systems. This paper investigates if, for a large number of users, simpler schemes can achieve the same performance

. The superiority of the DDF protocol is shown to be more significant in the cooperative broadcast channel. The situation is reversed in the CMA channel where we propose a new AF protocol that achieves the optimal tradeoff for all multiplexing gains. A distinguishing feature of the proposed protocols in the three

combination of a traditional broadcast protocol and a contentbased routing protocol. We present the combined scheme and its requirements over the broadcast protocol. We then detail the content-based routing protocol, highlighting a set of optimization heuristics. We also present the results of our evaluation

. This paper investigates fault-tolerant broadcasting in star networks. We propose a non-adaptive single-port broadcasting scheme in the n-star network such that it tolerates n 0 2 faults in the worst case and completes the broadcasting in O(n log n) time. The existence of such a broadcasting

of the intended signal. This scheme has been shown to be optimal. We conclude that present methods of allocating different frequency bands to different transmitters are necessarily suboptimal.

broadcast news data, from the TRECVID 2005/2006 benchmark, using a lexicon of 101 semantic concepts. By establishing a minimum performance on each experiment, the challenge problem allows for component-based optimization of the generic indexing issue, while simultaneously offering other researchers a

Harmonic broadcasting was introduced by Juhn and Tseng as a way to reduce the bandwidth requirements required for video-on-demand broadcasting. In this paper, we note that harmonic broadcasting is actually a special case of the priority encoded transmission scheme introduced by Albanese et al

approach is applied readily to the VBR videos and can achieve zero loss and best bandwidth efficiency. We give proof why existing techniques such as smoothing and prefetching is not necessary and in some cases inefficient in broadcasting protocols. We also discuss how broadcasting schemes can be tailored