This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Routing Algorithms for Nonblocking Electronic and Photonic Switching Networks
August 2005 (vol. 16 no. 8)
pp. 702-713
Enyue Lu, IEEE
S.Q. Zheng, IEEE

Abstract—We study the connection capacity of a class of rearrangeable nonblocking (RNB) and strictly nonblocking (SNB) networks with/without crosstalk-free constraint, model their routing problems as weak or strong edge-colorings of bipartite graphs, and propose efficient routing algorithms for these networks using parallel processing techniques. This class of networks includes networks constructed from Banyan networks by horizontal concatenation of extra stages and/or vertical stacking of multiple planes. We present a parallel algorithm that runs in O(\lg^2 N) time for the RNB networks of complexities ranging from O(N\lg N) to O(N^{1.5}\lg N) crosspoints and parallel algorithms that run in O(\min \{d^*\lg N, \sqrt{N}\}) time for the SNB networks of O(N^{1.5}\lg N) crosspoints, using a completely connected multiprocessor system of N processing elements. Our algorithms can be translated into algorithms with an O(\lg N \lg\lg N) slowdown factor for the class of N{\hbox{-}}{\rm{processor}} hypercubic networks, whose structures are no more complex than a single plane in the RNB and SNB networks considered.

[1] D.P. Agrawal, “Graph Theoretical Analysis and Design of Multistage Interconnection Networks,” IEEE Trans. Computers, vol. 32, no. 7, pp. 637-648, July 1983.
[2] V.E. Benes, “Permutation Groups, Complexes, and Rearrangeable Connecting Networks,” The Bell System Technical J., vol. 43, pp. 1619-1640, July 1964.
[3] V.E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic Press, 1965.
[4] J.A. Bondy and U.S. R. Murty, Graph Theory with Applications. Elsevier North-Holland, 1976.
[5] J. Carpinelli and A.Y. Oruc, “A Non-Blocking Matrix Decomposition Algorithm for Routing on Clos Networks,” IEEE Trans. Comm., vol. 39, pp. 1245-1251, 1993.
[6] J. Carpinelli and A.Y. Oruc, “Applications of Matching and Edge-Coloring Algorithms to Routing in Clos Networks,” Networks, vol. 24, pp. 319-326, Sept. 1994.
[7] C.J. Chen and A.A. Frank, “On Programmable Parallel Data Routing Networks via Crossbar Switches for Multiple Element Computer Architectures,” Parallel Processing, G. Goos and J. Harmanis, eds., New York: Springer-Verlag, 1975.
[8] R. Cypher and G. Plaxton, “Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers,” Proc. 22nd Ann. ACM Symp. Theory of Computing, pp. 193-203, 1990.
[9] R. Cole and J. Hopcroft, “On Edge Coloring Bipartite Graphs,” SIAM J. Computing, vol. 11, no. 1, pp. 540-546, 1982.
[10] O. Kariv and H. Gabow, “Algorithms for Edge Coloring Bipartite Graphs and Multigraphs,” SIAM J. Computing, vol. 11, no. 1, pp. 117-129, 1982.
[11] H. Hinton, “A Non-Blocking Optical Interconnection Network Using Directional Couplers,” Proc. IEEE Global Telecomm. Conf., pp. 885-889, Nov. 1984.
[12] D.K. Hunter, P.J. Legg, and I. Andonovic, “Architecture for Large Dilated Optical TDM Switching Networks,” IEE Proc. Optoelectronics, vol. 140, no. 5, pp. 337-343, Oct. 1993.
[13] F.K. Hwang, The Mathematical Theory of Nonblocking Switching Networks. World Scientific, 1998.
[14] J. Jaja, An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
[15] C.T. Lea, “Multi-log2N Networks and Their Applications in High-Speed Electronic and Photonic Switching Systems,” IEEE Trans. Comm., vol. 38, no. 10, pp. 1740-1749, Oct. 1990.
[16] C.T. Lea and D.J. Shyy, “Tradeoff of Horizontal Decomposition versus Vertical Stacking in Rearrangeable Nonblocking Networks,” IEEE Trans. Comm., pp. 899-904, vol. 39, no. 6, June 1991.
[17] H.Y. Lee, F.K. Hwang, and J. Carpinelli, “A New Decomposition Algorithm for Rearrangeable Clos Interconnection Networks,” IEEE Trans. Comm., vol. 44, pp. 1572-1578, 1997.
[18] F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays $\cdot$ Trees $\cdot$ Hypercubes. Morgan Kaufmann Publishers, 1992.
[19] G.F. Lev, N. Pippenger, and L.G. Valiant, “A Fast Parallel Algorithm for Routing in Permutation Networks,” IEEE Trans. Computers, vol. 30, no. 2, pp. 93-100, Feb. 1981.
[20] G. Maier, A. Pattavina, and S.G. Colombo, “Control of Non-Filterable Crosstalk in Optical-Cross-Connect Banyan Architectures,” Proc. IEEE Global Telecomm. Conf. GLOBECOM, vol. 2, pp. 1228-1232, Nov.-Dec. 2000.
[21] G. Maier and A. Pattavina, “Design of Photonic Rearrangeable Networks with Zero First-Order Switching-Element-Crosstalk,” IEEE Trans. Comm., vol. 49, no. 7, pp. 1268-1279, July 2001.
[22] N. Nassimi and S. Sahni, “Parallel Algorithms to Set Up the Benes Permutation Network,” IEEE Trans. Computers, vol. 31, no. 2, pp. 148-154, Feb. 1982.
[23] V.I. Neiman, “Structure et Command Optimals de Reseaux de Connxion Sans Blocage,” Annales des Telecomm., vol. 24, pp. 232-238, 1969.
[24] K. Padmanabhan and A. Netravali, “Dilated Network for Photonic Switching,” IEEE Trans. Comm. , vol. 35, no. 12, pp. 1357-1365, Dec. 1987.
[25] D.C. Opferman and N.T. Tsao-Wu, “On a Class of Rearrangeable Switching Networks,” Bell System Technical J., vol. 50, no. 5, pp. 1579-1600, 1971.
[26] Y. Pan, C. Qiao, and Y. Yang, “Optical Multistage Interconnection Networks: New Challenges and Approaches,” IEEE Comm. Magazine, vol. 37, no. 2, pp. 50-56, Feb. 1999.
[27] R. Ramaswami and K. Sivarajan, Optical Networks: A Practical Perspective, second ed. Morgan Kaufmann, 2001.
[28] G.H. Song and M. Goodman, “Asymmetrically-Dilated Cross-Connect Switches for Low-Crosstalk WDM Optical Networks,” Proc. IEEE Eighth Ann. Meeting Conf. Lasers and Electro-Optics Soc. Ann. Meeting, vol. 1, pp. 212-213, Oct. 1995.
[29] F.M. Suliman, A.B. Mohammad, and K. Seman, “A Space Dilated Lightwave Network— A New Approach,” Proc. IEEE 10th Int'l Conf. Telecomm. (ICT 2003), vol. 2, pp. 1675-1679, 2003.
[30] M. Vaez and C.T. Lea, “Wide-Sense Nonblocking Banyan-Type Switching Systems Based on Directional Couplers,” IEEE J. Selected Areas in Comm., vol. 16, no. 7, pp. 1327-1332, Sept. 1998.
[31] M. Vaez and C.T. Lea, “Strictly Nonblocking Directional-Coupler-Based Switching Networks under Crosstalk Constraint,” IEEE Trans. Comm., vol. 48, no. 2, pp. 316-323, Feb. 2000.
[32] V. Vizing, “On an Estimate of the Chromatic Class of a $p$ -Graph,” Metody Diskret. Analiz, pp. 25-30, 1964.
[33] J.E. Watson et al., “A Low-Voltage $8 \times 8$ ${\rm{Ti:LiNbO}}_3$ Switch with a Dilated Benes Architecture,” IEEE J. Lightwave Technology, vol. 8, pp. 794-800, May 1990.
[34] C.L. Wu and T.Y. Feng, “On a Class of Multistage Interconnection Networks,” IEEE Trans. Computers, vol. 29, no. 8, pp. 694-702, Aug. 1980.

Index Terms:
Banyan network, crosstalk, optical switching, rearrangeable nonblocking network, strictly nonblocking network, switch control, self-routing, graph coloring, parallel algorithm.
Citation:
Enyue Lu, S.Q. Zheng, "Parallel Routing Algorithms for Nonblocking Electronic and Photonic Switching Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 8, pp. 702-713, Aug. 2005, doi:10.1109/TPDS.2005.95
Usage of this product signifies your acceptance of the Terms of Use.