Electronic cell switches are widely used to interconnect computers, processing elements in parallel supercomputers, and line cards in high-speed routers. A shortcoming of cell switches is that they generally cannot support multicast connections without sacrificing either performance or scalability. One promising technique for constructing low complexity, highly scalable multicast cell switches is cell recycling. This paper considers a class of recycling multicast switches which use binary copying to offer complexity comparable to that of unicast switches. The delay and jitter performance of a typical binary copying architecture is examined under uniform and non-uniform (bursty) traffic. The relationship between the number of times a cell is recycled and the quality of service it receives is determined. Finally, measures to improve performance and fairness in recycling switches are presented. This paper shows that multicast cell switches can be constructed without compromising performance or scalability.