This Article 
 Bibliographic References 
 Add to: 
Broadcast Ring Sandwich Networks
October 1995 (vol. 44 no. 10)
pp. 1169-1180

Abstract—In this paper we will present a constructive design of a new class of cascaded network structures for broadcast applications called ring sandwich networks. These ring sandwich networks are rearrangeable in the sense that a request for a connection between a sender and a receiver can sometimes be realized only by first rearranging other existing connection paths through the network. We will present analytical results which permit the average rearrangeability of ring sandwich networks to be evaluated on the basis of fundamental structural parameters associated with the ring sandwich design so that the trade-off between the network rearrangeability and the network cost can be determined. It will be shown that the average number of rearrangements to satisfy a broadcast connection request relative to the subnetwork of the cascaded ring sandwich structure providing fanout can be reduced to O(1); this is in contrast to O(N) for other existing cascaded designs. We will give detailed connecting algorithms that can be used to satisfy connection requests. We will also support our analytically derived results with corroborating simulation data. This work provides an analytical framework for a class of low-cost broadcast networks currently being employed by government and industry in both broadcasting and conferencing applications wherein only a limited degree of rearrangements can be tolerated.

[1] C.-T. Lea, “A New Broadcast Switching Network,” IEEE Trans. Comm., vol. 36, no. 10, pp. 1,128-1,137, 1988.
[2] J.P. Ofman,“A universal automation,” Trans. Moscow Math. Soc., vol. 14, 1965 (translation published by Am. Math. Soc. pp. 1,119-1,125, 1967).
[3] C.D. Thompson,“General connection networks for parallel processor interconnection,” IEEE Trans. Computers, vol. 27, pp. 1,119-1,125, 1978.
[4] M. Kumar,“Supporting broadcast connections in Benes networks,” IBM Research Report RC-14063, 1988.
[5] V.E. Benes,Mathematical Theory of Connecting Networks and Telephone Traffic.New York: Academic, 1965.
[6] W.A. Waksman,“A permutation network,” J. ACM, vol. 15, pp. 159-163, 1968.
[7] D. Cantor,“On nonblocking switching networks,” Networks, vol. 2, pp. 367-377, 1972.
[8] G.M. Masson,G. Gingher,, and S. Nakamura,“A sampler of circuit switching networks,” Computer, vol. 12, pp. 9-48, 1979.
[9] Y. Yang,“On broadcast switching networks,” PhD dissertation, Johns Hopkins Univ., Baltimore, Md., 1992.
[10] S. Arora,T. Leighton,, and B. Maggs,“On line algorithms for path selection in a nonblocking network,” Proc. 22nd Ann. ACM Symp. Theory of Computing, pp. 149-158, 1990.
[11] D. Gross and C.M. Harris,Fundamentals of Queueing Theory, 2nd edition. New York: John Wiley&Sons, 1985.
[12] G. Masson and J. Driscoll,“Broadcast switching rings and arrays,” United States Patent No. 4,975,909, (assigned to Compunetix, Inc., Monroeville, Penn.), 1991.

Index Terms:
Interconnection network, broadcast network, rearrangeable, multistage, ring structure.
Gerald M. Masson, Yuanyuan Yang, "Broadcast Ring Sandwich Networks," IEEE Transactions on Computers, vol. 44, no. 10, pp. 1169-1180, Oct. 1995, doi:10.1109/12.467692
Usage of this product signifies your acceptance of the Terms of Use.