Intact versus fractional switching in SONET/SDH cross - connects

Synchronous Optical Network/Synchronous Digital Hierarchy (SONET/SDH) cross connect switching structures may be made non-blocking by providing sufficient hardware resources. For example, in a three-stage Clos switching structure this is accomplished by providing a sufficient number of middle stage switches to allow connections to be made without blocking. Nonblocking SONET/SDH cross-connects are more expensive than architectures which reduce the hardware complexity in their implementations at the expense of increased blocking probability. Under certain circumstances, initially unsuccessful new connections may still be connected if rearrangement of existing connections is possible. Factors which make rearranging connections difficult in a SONET/SDH signal environment is the multirate and multicast nature of the traffic, the requirement that any rearrangements must not interrupt existing sessions, and subnetwork connection protection. Cross-connects with this subnetwork connection protection capability must provide hardware and software functionality that selects between two independent copies of a signal and passes the error-free copy through the matrix. We explain how subnetwork protection introduces a requirement for intact switching of SONET/SDH signals. We also present a comparison of intact and fractional SONET/SDH connection and rearrangement algorithms in the context of subnetwork connection protection requirements. We demonstrate the blocking probability impact of introducing subnetwork protection connections into cross-connects.

[1]  F. K. Hwang Rearrangeability of multi-connection three-stage clos networks , 1972, Networks.

[2]  Achille Pattavina,et al.  Blocking performance of a three-stage multicasting network , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.

[3]  Won Bae Park Routing algorithms for Clos networks in SONET/SDH digital cross-connect systems , 1996 .

[4]  G. C. Hudek Blocking in digital cross-connect systems , 1993 .

[5]  Andrzej Jajszczyk,et al.  The Effect of Choosing the Switches for Rearrangements in Switching Networks , 1980, IEEE Trans. Commun..

[6]  Frank K. Hwang,et al.  Control Algorithms for Rearrangeable Clos Networks , 1983, IEEE Trans. Commun..

[7]  Richard Cole,et al.  On Edge Coloring Bipartite Graphs , 1980, SIAM J. Comput..

[8]  Frank K. Hwang,et al.  On Nonblocking Multiconnection Networks , 1986, IEEE Trans. Commun..

[9]  Satoru Ohta,et al.  A rearrangement algorithm for three‐stage switching networks , 1987 .

[10]  Yuanyuan Yang,et al.  Nonblocking Broadcast Switching Networks , 1991, IEEE Trans. Computers.

[11]  N. Tsao-Wu On Neiman's Algorithm for the Control of Rearrangeable Switching Networks , 1974, IEEE Trans. Commun..

[12]  Ellen W. Zegura,et al.  Evaluating blocking probability in generalized connectors , 1995, TNET.

[13]  Ellen W. Zegura,et al.  An improved model for evaluating blocking probability in generalized connectors , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[14]  Harold N. Gabow,et al.  Algorithms for Edge Coloring Bipartite Graphs and Multigraphs , 1982, SIAM J. Comput..

[15]  M. Paull Reswitching of connection networks , 1962 .

[16]  A. Yavuz Oruç,et al.  Applications of matching and edge-coloring algorithms to routing in clos networks , 1994, Networks.

[17]  D. C. Opferman,et al.  On a class of rearrangeable switching networks part I: Control algorithm , 1971 .

[18]  Paolo Giacomazzi,et al.  A study of non blocking multicast switching networks , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[19]  Ellen W. Zegura,et al.  SONET/SDH traffic generation models , 1998, Eur. Trans. Telecommun..

[20]  Gerald M. Masson,et al.  Generalized multi-stage connection networks , 1972, Networks.

[21]  Andrzej Jajszczyk Comments on “Three-stage multiconnection networks which are nonblocking in the wide sense,” by F. K. Hwang , 1983, The Bell System Technical Journal.

[22]  F. K. Hwang Three-stage multiconnection networks which are nonblocking in the wide sense , 1979, The Bell System Technical Journal.

[23]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[24]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[25]  M.K.R. Walker Optimum structures of space switching fabrics for SDH cross-connect equipment , 1993 .

[26]  Ting-Chao Hou,et al.  Hierarchical Path Hunt in a Broadband Multirate Circuit Switching Fabric , 1996, IEEE J. Sel. Areas Commun..