## Abstract

A hybrid routing scheme with an adaptive spectrum assignment is proposed for flex-grid all-optical core switch supporting multihop transparent paths in data center networks. Compared with conventional spectrum assignment algorithms (RSA) developed for a multihop network with optical-electric-optical (OEO) conversion in every hop (i.e., RSA for EO) and that devised for an all-optical multihop network (i.e., RSA for AO), the present RSA algorithm provides better utilization of network resources. Being aware of the all-optical bypass path in hopping, the proposed RSA reduces the blocking probability due to lack of bandwidth-tunable transceivers, which is the major reason for blocking for an RSA for the EO. Similar to the RSA for the AO, the proposed RSA is compatible with the number-of-hops adaptive spectrum assignment, which improves spectrum efficiency. On the other hand, the new algorithm enhances connectivity by eliminating the number-of-hops limitation, which severely constrains the performance of RSA for the AO. Simulations for the system are carried out to investigate the performance of the new algorithm. The impacts of various parameters, such as traffic load, ratio of connection requests with different data rates, and resource configuration on the link cost, are studied in terms of network blocking probability (BP). The achievable traffic load of the proposed RSA under varied connection degrees (i.e., the maximum number of ports that one rack has in order to connect to the core switch) and number of racks is also assessed to keep BP no more than 0.1. The results show that the proposed RSA with appropriate cost functions outperforms the EO and AO, which implies that it has the highest scalability.

© 2018 Optical Society of America

Full Article | PDF Article**OSA Recommended Articles**

Jingxin Wu, Maotong Xu, Suresh Subramaniam, and Hiroshi Hasegawa

J. Opt. Commun. Netw. **10**(8) C27-C38 (2018)

Yuxin Cheng, Matteo Fiorani, Rui Lin, Lena Wosinska, and Jiajia Chen

J. Opt. Commun. Netw. **9**(5) 401-411 (2017)

Xiaojun Yu, Gaoxi Xiao, and Tee-Hiang Cheng

J. Opt. Commun. Netw. **5**(8) 870-880 (2013)