Wide-sense nonblocking multiplane baseline switching networks composed dxd switches

• Autorzy: Danilewicz G. , Kabaciński W. , Michalski M. , Żal M.
• Konferencja: Poznan Telecommunications Workshop / sympozjum [11; December 7-8, 2006; Poznan]
• Języki publikacji: EN

Abstrakty

EN

A new control algorithm for log₂(N, 0, p) switching networks composed of 2x2 switching elements has been proposed recently. Under this algorithm. log₂(N,O, p) switching networks with even number of stages are wide-sense nonblocking (WSNB) if p is the same as for the rearrangeable nonblocking (RNB) one. In this paper we extend this solution to log_d(N,0,p) switching networks. The control algorithm is appropriately modified to switching networks composed of dxd switches. Wide-sense nonblocking operation of such switching networks with even number of stages is proved. We showed lhat number of planes needed for WSNB operation is also the same as in RNB switching networks.

Słowa kluczowe

EN

switching networks; multiplane networks; control algorithm; path searching algorithms; wide-sense nonblocking

• Wydawca: Wydawnictwo Politechniki Poznańskiej
• Czasopismo: Poznan University of Technology Academic Journals. Electrical Engineering
• Rocznik: 2007
• Tom: No 54
• Strony: 25--32
• Opis fizyczny: Bibliogr. 12 poz.

Twórcy

autor

Danilewicz G.

autor

Kabaciński W.

autor

Michalski M.

autor

Żal M.

• Poznan University of Technology

Bibliografia

• [1]Beneš V. E., Mathematical Theory of Connecting Networks and Telephone Traffic. Mathematics in Science and Engineering, vol. 17 Academic Press, 1965.
• [2]Danilewicz G., Wide-Sense Nonblocking Logd(N,0,p) Multicast Switching Networks, IEEE Trans. Commun., accepted for publication.
• [3]Hwang F. K., The Mathematical Theory of Nonblocking Switching Networks. Singapore: World Scientific, 2004.
• [4]Hwang F. K., Lin W.-D., Necessary and sufficient conditions for rearrangeable \ogd(N,m,p), IEEE Transactions on Communications, vol. 53, pp. 2020-2023, 2005.
• [5]Kabaciński W., Nonblocking Electronic and Photonic Switching Fabrics. Springer, 2005.
• [6]Kabaciński W., Danilewicz G., Wide-sense and strict-sense non-blocking operation of multicast multi-log2N switching networks, IEEE Trans. Commun., vol. 50, pp. 1025-1036, 2002.
• [7]Kabaciński W., Michalski M., Wide-Sense Nonblocking Log2(N,0,/?) Switching Networks with Even Number of Stages, IEEE ICC 2005, 2005.
• [8]Kabaciński W., Michalski M., Lower Bounds for WSNB Multi-Log2Ar Switching Networks. Conference on Telecommunications A-ICT 2005, pp. 202-206, 2005.
• [9]Kabaciński W., Michalski M., The Routing Algorithm and Wide-Sense Nonblocking Conditions for Multiplane Baseline Switching Networks, IEEE Journal on Sel. Area.of Commun., accepted for publication.
• [10]Lea C.-T., Multi-log2N networks and their applications in high-speed electronic and photonic switching systems, IEEE Trans. Comm., vol. 38, pp. 1749-1740, Oct. 1990.
• [11]Lea C.-T, Shyy D.-J., Tradeoff of horizontal decomposition versus vertical stacking in rearrangeable nonblocking networks, IEEE Trans. Commun., vol. 39, pp. 899-904, 1991.
• [12]Pattavina A., Switching Theory - Architectures and Performance in Broadband ATM Networks. John Wiley & Sons, 1998.