An Efficient Crosstalk-Free Routing Algorithm Based on Permutation Decomposition for Optical Multi-log2N Switching Networks

Abstract : Optical switching networks (OSN) based on optical directional couplers (DC) may be the most promising candidate to provide a high switching rate when the speed mismatch problem between links (optical fibers) and switches is increasingly serious. Although such switches have many advantages, the DC suffers from an inherent crosstalk problem that can greatly aggravate the switching performance. Based on semi-permutations, a parallel decomposition algorithm,which is called multi-decomposition, is proposed in this paper for solving the optical crosstalk problem in optical multi-log2N switching networks. According to the number of planes in a multi-log2N network, the multi-decomposition is performed in parallel to partition a permutation into several sub-permutations, each of which is established without crosstalk within each plane. We demonstrate that our algorithm can completely remove the crosstalk in optical multi-log2N networks when n is even, and that it may be generated only in the stage (n-1)/2 (i.e., the middle stage) when n is odd, but the corresponding probability of generating crosstalk is to be less than or equal to $\frac{1}{2^{(n+1)/2}-1}$ . In addition, our algorithm can achieve a low complexity for decomposition a permutation due to its parallelism so that any permutations can be realized in multi-log2N networks under the constraint of avoiding crosstalk.
Type de document :
Communication dans un congrès
Ching-Hsien Hsu; Xiaoming Li; Xuanhua Shi; Ran Zheng. 10th International Conference on Network and Parallel Computing (NPC), Sep 2013, Guiyang, China. Springer, Lecture Notes in Computer Science, LNCS-8147, pp.207-219, 2013, Network and Parallel Computing. 〈10.1007/978-3-642-40820-5_18〉
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01513777
Contributeur : Hal Ifip <>
Soumis le : mardi 25 avril 2017 - 14:33:43
Dernière modification le : mardi 25 avril 2017 - 14:35:49
Document(s) archivé(s) le : mercredi 26 juillet 2017 - 13:51:03

Fichier

978-3-642-40820-5_18_Chapter.p...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Xiaofeng Liu, Youjian Zhao, Yajuan Wu. An Efficient Crosstalk-Free Routing Algorithm Based on Permutation Decomposition for Optical Multi-log2N Switching Networks. Ching-Hsien Hsu; Xiaoming Li; Xuanhua Shi; Ran Zheng. 10th International Conference on Network and Parallel Computing (NPC), Sep 2013, Guiyang, China. Springer, Lecture Notes in Computer Science, LNCS-8147, pp.207-219, 2013, Network and Parallel Computing. 〈10.1007/978-3-642-40820-5_18〉. 〈hal-01513777〉

Partager

Métriques

Consultations de la notice

134

Téléchargements de fichiers

31