A video segment broadcasting scheme can reduce server and network bandwidth by periodically broadcasting popular videos that are most likely demanded by clients, instead of responding to each client requests. When video segments broadcast on a channel, in general, alternate broadcasting schemes periodically transmit all segments on a given channel with the same transmission period, which reduces the transmission efficiency of stream channels and requires sufficient client storage space for video segments broadcast on simultaneous channels. The author proposed a novel alternate video broadcast scheme, a delayed buffering broadcast that requires lower server bandwidth and client buffer space compared with those of previous approaches. In addition, the study provides an analytical analysis of the scheme, including a lower bound on the video segment transmission rate for any alternate broadcast scheme. It also derives an upper bound on its storage requirements from the client side. Using the performance study of the proposed scheme and simulation results, the author establishes that the proposed scheme uses fewer server channels and storage resources than previously reported alternate video broadcast schemes for any given client waiting time.

A new data parallel simulation technique of Time-Warp on the Connection Machine is presented. Our scheme handles the rollback problem of Time-Warp efficiently, and maximizes data parallelism, where the parallelism is extracted from simultaneous evaluation of different circuit elements. Each event is assigned to one of the processors of the Connection Machine to achieve high data parallelism. A new scheme to reduce space overhead in Time-Warp is proposed.